diff options
Diffstat (limited to 'src')
-rw-r--r-- | src/backend/access/heap/pruneheap.c | 2 | ||||
-rw-r--r-- | src/backend/catalog/namespace.c | 2 | ||||
-rw-r--r-- | src/backend/catalog/pg_namespace.c | 2 | ||||
-rw-r--r-- | src/backend/commands/copy.c | 6 | ||||
-rw-r--r-- | src/backend/commands/tablecmds.c | 2 | ||||
-rw-r--r-- | src/backend/executor/execExpr.c | 2 | ||||
-rw-r--r-- | src/backend/executor/nodeIncrementalSort.c | 2 | ||||
-rw-r--r-- | src/backend/executor/nodeLimit.c | 2 | ||||
-rw-r--r-- | src/backend/optimizer/path/allpaths.c | 2 | ||||
-rw-r--r-- | src/backend/optimizer/plan/analyzejoins.c | 2 | ||||
-rw-r--r-- | src/backend/partitioning/partbounds.c | 2 | ||||
-rw-r--r-- | src/backend/postmaster/interrupt.c | 2 | ||||
-rw-r--r-- | src/backend/statistics/dependencies.c | 2 | ||||
-rw-r--r-- | src/backend/statistics/extended_stats.c | 2 | ||||
-rw-r--r-- | src/backend/storage/buffer/bufmgr.c | 2 | ||||
-rw-r--r-- | src/backend/utils/adt/varlena.c | 2 | ||||
-rw-r--r-- | src/bin/pg_rewind/parsexlog.c | 2 | ||||
-rw-r--r-- | src/bin/pgbench/pgbench.c | 2 | ||||
-rw-r--r-- | src/interfaces/libpq/fe-connect.c | 2 | ||||
-rw-r--r-- | src/test/modules/dummy_index_am/dummy_index_am.c | 2 |
20 files changed, 22 insertions, 22 deletions
diff --git a/src/backend/access/heap/pruneheap.c b/src/backend/access/heap/pruneheap.c index bc510e2e9b3..9e04bc712c9 100644 --- a/src/backend/access/heap/pruneheap.c +++ b/src/backend/access/heap/pruneheap.c @@ -385,7 +385,7 @@ heap_page_prune(Relation relation, Buffer buffer, /* - * Perform visiblity checks for heap pruning. + * Perform visibility checks for heap pruning. * * This is more complicated than just using GlobalVisTestIsRemovableXid() * because of old_snapshot_threshold. We only want to increase the threshold diff --git a/src/backend/catalog/namespace.c b/src/backend/catalog/namespace.c index 391a9b225db..740570c566d 100644 --- a/src/backend/catalog/namespace.c +++ b/src/backend/catalog/namespace.c @@ -3853,7 +3853,7 @@ recomputeNamespacePath(void) /* * We want to detect the case where the effective value of the base search * path variables didn't change. As long as we're doing so, we can avoid - * copying the OID list unncessarily. + * copying the OID list unnecessarily. */ if (baseCreationNamespace == firstNS && baseTempCreationPending == temp_missing && diff --git a/src/backend/catalog/pg_namespace.c b/src/backend/catalog/pg_namespace.c index ed852760705..7d2e26fd359 100644 --- a/src/backend/catalog/pg_namespace.c +++ b/src/backend/catalog/pg_namespace.c @@ -106,7 +106,7 @@ NamespaceCreate(const char *nspName, Oid ownerId, bool isTemp) /* dependency on owner */ recordDependencyOnOwner(NamespaceRelationId, nspoid, ownerId); - /* dependences on roles mentioned in default ACL */ + /* dependencies on roles mentioned in default ACL */ recordDependencyOnNewAcl(NamespaceRelationId, nspoid, 0, ownerId, nspacl); /* dependency on extension ... but not for magic temp schemas */ diff --git a/src/backend/commands/copy.c b/src/backend/commands/copy.c index 36ddcdccdb8..115860a9d40 100644 --- a/src/backend/commands/copy.c +++ b/src/backend/commands/copy.c @@ -2610,9 +2610,9 @@ CopyMultiInsertInfoFlush(CopyMultiInsertInfo *miinfo, ResultRelInfo *curr_rri) /* * Trim the list of tracked buffers down if it exceeds the limit. Here we - * remove buffers starting with the ones we created first. It seems more - * likely that these older ones are less likely to be needed than ones - * that were just created. + * remove buffers starting with the ones we created first. It seems less + * likely that these older ones will be needed than the ones that were + * just created. */ while (list_length(miinfo->multiInsertBuffers) > MAX_PARTITION_BUFFERS) { diff --git a/src/backend/commands/tablecmds.c b/src/backend/commands/tablecmds.c index a29c14bf1cf..df13b72974f 100644 --- a/src/backend/commands/tablecmds.c +++ b/src/backend/commands/tablecmds.c @@ -1790,7 +1790,7 @@ ExecuteTruncateGuts(List *explicit_rels, List *relids, List *relids_logged, * * We put the ResultRelInfos in the es_opened_result_relations list, even * though we don't have a range table and don't populate the - * es_result_relations array. That's a big bogus, but it's enough to make + * es_result_relations array. That's a bit bogus, but it's enough to make * ExecGetTriggerResultRel() find them. */ estate = CreateExecutorState(); diff --git a/src/backend/executor/execExpr.c b/src/backend/executor/execExpr.c index 868f8b0858f..d76836c09b1 100644 --- a/src/backend/executor/execExpr.c +++ b/src/backend/executor/execExpr.c @@ -3266,7 +3266,7 @@ ExecBuildAggTransCall(ExprState *state, AggState *aggstate, * * For ordered aggregates: * - * Only need to choose between the faster path for a single orderred + * Only need to choose between the faster path for a single ordered * column, and the one between multiple columns. Checking strictness etc * is done when finalizing the aggregate. See * process_ordered_aggregate_{single, multi} and diff --git a/src/backend/executor/nodeIncrementalSort.c b/src/backend/executor/nodeIncrementalSort.c index 6c0d24ee25a..eb6cc19a60c 100644 --- a/src/backend/executor/nodeIncrementalSort.c +++ b/src/backend/executor/nodeIncrementalSort.c @@ -1097,7 +1097,7 @@ ExecEndIncrementalSort(IncrementalSortState *node) ExecClearTuple(node->ss.ss_ScanTupleSlot); /* must drop pointer to sort result tuple */ ExecClearTuple(node->ss.ps.ps_ResultTupleSlot); - /* must drop stanalone tuple slots from outer node */ + /* must drop standalone tuple slots from outer node */ ExecDropSingleTupleTableSlot(node->group_pivot); ExecDropSingleTupleTableSlot(node->transfer_tuple); diff --git a/src/backend/executor/nodeLimit.c b/src/backend/executor/nodeLimit.c index d85cf7d93e8..c5896e57908 100644 --- a/src/backend/executor/nodeLimit.c +++ b/src/backend/executor/nodeLimit.c @@ -105,7 +105,7 @@ ExecLimit(PlanState *pstate) } /* - * Tuple at limit is needed for comparation in subsequent + * Tuple at limit is needed for comparison in subsequent * execution to detect ties. */ if (node->limitOption == LIMIT_OPTION_WITH_TIES && diff --git a/src/backend/optimizer/path/allpaths.c b/src/backend/optimizer/path/allpaths.c index 803d9bae7f1..8ad6384c6ae 100644 --- a/src/backend/optimizer/path/allpaths.c +++ b/src/backend/optimizer/path/allpaths.c @@ -2915,7 +2915,7 @@ generate_useful_gather_paths(PlannerInfo *root, RelOptInfo *rel, bool override_r /* * If the path has no ordering at all, then we can't use either - * incremental sort or rely on implict sorting with a gather + * incremental sort or rely on implicit sorting with a gather * merge. */ if (subpath->pathkeys == NIL) diff --git a/src/backend/optimizer/plan/analyzejoins.c b/src/backend/optimizer/plan/analyzejoins.c index d0ff6602842..806629fff21 100644 --- a/src/backend/optimizer/plan/analyzejoins.c +++ b/src/backend/optimizer/plan/analyzejoins.c @@ -371,7 +371,7 @@ remove_rel_from_query(PlannerInfo *root, int relid, Relids joinrelids) * Likewise remove references from PlaceHolderVar data structures, * removing any no-longer-needed placeholders entirely. * - * Removal is a bit tricker than it might seem: we can remove PHVs that + * Removal is a bit trickier than it might seem: we can remove PHVs that * are used at the target rel and/or in the join qual, but not those that * are used at join partner rels or above the join. It's not that easy to * distinguish PHVs used at partner rels from those used in the join qual, diff --git a/src/backend/partitioning/partbounds.c b/src/backend/partitioning/partbounds.c index a4f97c10fe7..ac0c4959727 100644 --- a/src/backend/partitioning/partbounds.c +++ b/src/backend/partitioning/partbounds.c @@ -1783,7 +1783,7 @@ merge_matching_partitions(PartitionMap *outer_map, PartitionMap *inner_map, if (outer_merged_index >= 0 && inner_merged_index >= 0) { /* - * If the mereged partitions are the same, no need to do anything; + * If the merged partitions are the same, no need to do anything; * return the index of the merged partitions. Otherwise, if each of * the given partitions has been merged with a dummy partition on the * other side, re-map them to either of the two merged partitions. diff --git a/src/backend/postmaster/interrupt.c b/src/backend/postmaster/interrupt.c index 3d02439b79c..ee7dbf924ae 100644 --- a/src/backend/postmaster/interrupt.c +++ b/src/backend/postmaster/interrupt.c @@ -92,7 +92,7 @@ SignalHandlerForCrashExit(SIGNAL_ARGS) * Simple signal handler for triggering a long-running background process to * shut down and exit. * - * Typically, this handler would be used for SIGTERM, but some procesess use + * Typically, this handler would be used for SIGTERM, but some processes use * other signals. In particular, the checkpointer exits on SIGUSR2, the * stats collector on SIGQUIT, and the WAL writer exits on either SIGINT * or SIGTERM. diff --git a/src/backend/statistics/dependencies.c b/src/backend/statistics/dependencies.c index 4e30abb6743..d950b4eabe0 100644 --- a/src/backend/statistics/dependencies.c +++ b/src/backend/statistics/dependencies.c @@ -1305,7 +1305,7 @@ dependencies_clauselist_selectivity(PlannerInfo *root, /* * Work out which dependencies we can apply, starting with the - * widest/stongest ones, and proceeding to smaller/weaker ones. + * widest/strongest ones, and proceeding to smaller/weaker ones. */ dependencies = (MVDependency **) palloc(sizeof(MVDependency *) * total_ndeps); diff --git a/src/backend/statistics/extended_stats.c b/src/backend/statistics/extended_stats.c index 9336f9bc5e9..36326927c6b 100644 --- a/src/backend/statistics/extended_stats.c +++ b/src/backend/statistics/extended_stats.c @@ -1403,7 +1403,7 @@ statext_mcv_clauselist_selectivity(PlannerInfo *root, List *clauses, int varReli stat_sel = mcv_sel + other_sel; CLAMP_PROBABILITY(stat_sel); - /* Factor the estimate from this MCV to the oveall estimate. */ + /* Factor the estimate from this MCV to the overall estimate. */ sel *= stat_sel; } diff --git a/src/backend/storage/buffer/bufmgr.c b/src/backend/storage/buffer/bufmgr.c index 2fa0b065a28..0adf04814cd 100644 --- a/src/backend/storage/buffer/bufmgr.c +++ b/src/backend/storage/buffer/bufmgr.c @@ -560,7 +560,7 @@ PrefetchSharedBuffer(SMgrRelation smgr_reln, * could be used by the caller to avoid the need for a later buffer lookup, but * it's not pinned, so the caller must recheck it. * - * 2. If the kernel has been asked to initiate I/O, the initated_io member is + * 2. If the kernel has been asked to initiate I/O, the initiated_io member is * true. Currently there is no way to know if the data was already cached by * the kernel and therefore didn't really initiate I/O, and no way to know when * the I/O completes other than using synchronous ReadBuffer(). diff --git a/src/backend/utils/adt/varlena.c b/src/backend/utils/adt/varlena.c index d7bc3305417..5512e02940c 100644 --- a/src/backend/utils/adt/varlena.c +++ b/src/backend/utils/adt/varlena.c @@ -6180,7 +6180,7 @@ unicode_normalize_func(PG_FUNCTION_ARGS) /* * Check whether the string is in the specified Unicode normalization form. * - * This is done by convering the string to the specified normal form and then + * This is done by converting the string to the specified normal form and then * comparing that to the original string. To speed that up, we also apply the * "quick check" algorithm specified in UAX #15, which can give a yes or no * answer for many strings by just scanning the string once. diff --git a/src/bin/pg_rewind/parsexlog.c b/src/bin/pg_rewind/parsexlog.c index 2229c86f9af..a2f1ab5422b 100644 --- a/src/bin/pg_rewind/parsexlog.c +++ b/src/bin/pg_rewind/parsexlog.c @@ -207,7 +207,7 @@ findLastCheckpoint(const char *datadir, XLogRecPtr forkptr, int tliIndex, /* * Check if it is a checkpoint record. This checkpoint record needs to * be the latest checkpoint before WAL forked and not the checkpoint - * where the primary has been stopped to be rewinded. + * where the primary has been stopped to be rewound. */ info = XLogRecGetInfo(xlogreader) & ~XLR_INFO_MASK; if (searchptr < forkptr && diff --git a/src/bin/pgbench/pgbench.c b/src/bin/pgbench/pgbench.c index cd39f23d5b9..3057665bbec 100644 --- a/src/bin/pgbench/pgbench.c +++ b/src/bin/pgbench/pgbench.c @@ -4185,7 +4185,7 @@ runInitSteps(const char *initialize_steps) } /* - * Extract pgbench table informations into global variables scale, + * Extract pgbench table information into global variables scale, * partition_method and partitions. */ static void diff --git a/src/interfaces/libpq/fe-connect.c b/src/interfaces/libpq/fe-connect.c index b0ca37c2ed8..e7781d010f0 100644 --- a/src/interfaces/libpq/fe-connect.c +++ b/src/interfaces/libpq/fe-connect.c @@ -7088,7 +7088,7 @@ pgpassfileWarning(PGconn *conn) } /* - * Check if the SSL procotol value given in input is valid or not. + * Check if the SSL protocol value given in input is valid or not. * This is used as a sanity check routine for the connection parameters * ssl_min_protocol_version and ssl_max_protocol_version. */ diff --git a/src/test/modules/dummy_index_am/dummy_index_am.c b/src/test/modules/dummy_index_am/dummy_index_am.c index e97a32d5be2..8f4cdab1b33 100644 --- a/src/test/modules/dummy_index_am/dummy_index_am.c +++ b/src/test/modules/dummy_index_am/dummy_index_am.c @@ -153,7 +153,7 @@ dibuild(Relation heap, Relation index, IndexInfo *indexInfo) } /* - * Build an empty index for the initialiation fork. + * Build an empty index for the initialization fork. */ static void dibuildempty(Relation index) |