diff options
Diffstat (limited to 'src/include')
| -rw-r--r-- | src/include/access/hash.h | 2 | ||||
| -rw-r--r-- | src/include/executor/hashjoin.h | 4 | ||||
| -rw-r--r-- | src/include/executor/nodeAgg.h | 2 | ||||
| -rw-r--r-- | src/include/executor/tablefunc.h | 2 | ||||
| -rw-r--r-- | src/include/jit/jit.h | 2 | ||||
| -rw-r--r-- | src/include/jit/llvmjit.h | 2 | ||||
| -rw-r--r-- | src/include/lib/dshash.h | 2 | ||||
| -rw-r--r-- | src/include/mb/pg_wchar.h | 2 | ||||
| -rw-r--r-- | src/include/nodes/relation.h | 2 | ||||
| -rw-r--r-- | src/include/port.h | 2 |
10 files changed, 11 insertions, 11 deletions
diff --git a/src/include/access/hash.h b/src/include/access/hash.h index 65d23f32ef9..f94bcf9e296 100644 --- a/src/include/access/hash.h +++ b/src/include/access/hash.h @@ -239,7 +239,7 @@ typedef HashScanOpaqueData *HashScanOpaque; #define HASH_SPLITPOINT_PHASE_MASK (HASH_SPLITPOINT_PHASES_PER_GRP - 1) #define HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE 10 -/* defines max number of splitpoit phases a hash index can have */ +/* defines max number of splitpoint phases a hash index can have */ #define HASH_MAX_SPLITPOINT_GROUP 32 #define HASH_MAX_SPLITPOINTS \ (((HASH_MAX_SPLITPOINT_GROUP - HASH_SPLITPOINT_GROUPS_WITH_ONE_PHASE) * \ diff --git a/src/include/executor/hashjoin.h b/src/include/executor/hashjoin.h index 6fb2dc04f6f..a9f9872a78c 100644 --- a/src/include/executor/hashjoin.h +++ b/src/include/executor/hashjoin.h @@ -190,7 +190,7 @@ typedef struct ParallelHashJoinBatch /* * Each backend requires a small amount of per-batch state to interact with - * each ParalellHashJoinBatch. + * each ParallelHashJoinBatch. */ typedef struct ParallelHashJoinBatchAccessor { @@ -201,7 +201,7 @@ typedef struct ParallelHashJoinBatchAccessor size_t ntuples; /* number of tuples */ size_t size; /* size of partition in memory */ size_t estimated_size; /* size of partition on disk */ - size_t old_ntuples; /* how many tuples before repartioning? */ + size_t old_ntuples; /* how many tuples before repartitioning? */ bool at_least_one_chunk; /* has this backend allocated a chunk? */ bool done; /* flag to remember that a batch is done */ diff --git a/src/include/executor/nodeAgg.h b/src/include/executor/nodeAgg.h index 4650dc2c7e9..ab55be8f113 100644 --- a/src/include/executor/nodeAgg.h +++ b/src/include/executor/nodeAgg.h @@ -104,7 +104,7 @@ typedef struct AggStatePerTransData /* * Comparators for input columns --- only set/used when aggregate has * DISTINCT flag. equalfnOne version is used for single-column - * commparisons, equalfnMulti for the case of multiple columns. + * comparisons, equalfnMulti for the case of multiple columns. */ FmgrInfo equalfnOne; ExprState *equalfnMulti; diff --git a/src/include/executor/tablefunc.h b/src/include/executor/tablefunc.h index 29c546f83e4..52424ae2ffd 100644 --- a/src/include/executor/tablefunc.h +++ b/src/include/executor/tablefunc.h @@ -47,7 +47,7 @@ struct TableFuncScanState; * * DestroyBuilder shall release all resources associated with a table builder * context. It may be called either because all rows have been consumed, or - * because an error ocurred while processing the table expression. + * because an error occurred while processing the table expression. */ typedef struct TableFuncRoutine { diff --git a/src/include/jit/jit.h b/src/include/jit/jit.h index 85d234ff3b8..ddeffae2731 100644 --- a/src/include/jit/jit.h +++ b/src/include/jit/jit.h @@ -15,7 +15,7 @@ #include "utils/resowner.h" -/* Flags deterimining what kind of JIT operations to perform */ +/* Flags determining what kind of JIT operations to perform */ #define PGJIT_NONE 0 #define PGJIT_PERFORM 1 << 0 #define PGJIT_OPT3 1 << 1 diff --git a/src/include/jit/llvmjit.h b/src/include/jit/llvmjit.h index dc8fa57f840..b0093db49d7 100644 --- a/src/include/jit/llvmjit.h +++ b/src/include/jit/llvmjit.h @@ -107,7 +107,7 @@ extern void llvm_inline(LLVMModuleRef mod); /* **************************************************************************** - * Code ceneration functions. + * Code generation functions. **************************************************************************** */ extern bool llvm_compile_expr(struct ExprState *state); diff --git a/src/include/lib/dshash.h b/src/include/lib/dshash.h index 3f8086e46d6..8c733bfe256 100644 --- a/src/include/lib/dshash.h +++ b/src/include/lib/dshash.h @@ -42,7 +42,7 @@ typedef dshash_hash (*dshash_hash_function) (const void *v, size_t size, * Compare and hash functions must be supplied even when attaching, because we * can't safely share function pointers between backends in general. Either * the arg variants or the non-arg variants should be supplied; the other - * function pointers should be NULL. If the arg varants are supplied then the + * function pointers should be NULL. If the arg variants are supplied then the * user data pointer supplied to the create and attach functions will be * passed to the hash and compare functions. */ diff --git a/src/include/mb/pg_wchar.h b/src/include/mb/pg_wchar.h index 1d26cb51da3..748db5ba5fe 100644 --- a/src/include/mb/pg_wchar.h +++ b/src/include/mb/pg_wchar.h @@ -410,7 +410,7 @@ extern const pg_wchar_tbl pg_wchar_table[]; * points to a lookup table for the second byte. And so on. * * Physically, all the trees are stored in one big array, in 'chars16' or - * 'chars32', depending on the maximum value that needs to be reprented. For + * 'chars32', depending on the maximum value that needs to be represented. For * each level in each tree, we also store lower and upper bound of allowed * values - values outside those bounds are considered invalid, and are left * out of the tables. diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h index 2b4f773c70a..ea5251c6be2 100644 --- a/src/include/nodes/relation.h +++ b/src/include/nodes/relation.h @@ -1444,7 +1444,7 @@ typedef JoinPath NestPath; * that the executor need find only one match per outer tuple, and that the * mergeclauses are sufficient to identify a match. In such cases the * executor can immediately advance the outer relation after processing a - * match, and therefoere it need never back up the inner relation. + * match, and therefore it need never back up the inner relation. * * materialize_inner is true if a Material node should be placed atop the * inner input. This may appear with or without an inner Sort step. diff --git a/src/include/port.h b/src/include/port.h index a514ab758b5..74a9dc4d4d5 100644 --- a/src/include/port.h +++ b/src/include/port.h @@ -347,7 +347,7 @@ extern int isinf(double x); /* * Glibc doesn't use the builtin for clang due to a *gcc* bug in a version * newer than the gcc compatibility clang claims to have. This would cause a - * *lot* of superflous function calls, therefore revert when using clang. + * *lot* of superfluous function calls, therefore revert when using clang. */ #ifdef __clang__ /* needs to be separate to not confuse other compilers */ |