Fix a boatload of typos in C comments.

Justin Pryzby

Discussion: https://postgr.es/m/20180331105640.GK28454@telsasoft.com

src/backend/access/common/session.c

@@ -60,7 +60,7 @@ InitializeSession(void)
  * Initialize the per-session DSM segment if it isn't already initialized, and
  * return its handle so that worker processes can attach to it.
  *
- * Unlike the per-context DSM segment, this segement and its contents are
+ * Unlike the per-context DSM segment, this segment and its contents are
  * reused for future parallel queries.
  *
  * Return DSM_HANDLE_INVALID if a segment can't be allocated due to lack of

src/backend/access/nbtree/nbtinsert.c

@@ -187,9 +187,9 @@ top:
 				_bt_relbuf(rel, buf);
 
 				/*
-				 * Something did not workout. Just forget about the cached
+				 * Something did not work out. Just forget about the cached
 				 * block and follow the normal path. It might be set again if
-				 * the conditions are favourble.
+				 * the conditions are favourable.
 				 */
 				RelationSetTargetBlock(rel, InvalidBlockNumber);
 			}

src/backend/executor/execProcnode.c

@@ -409,7 +409,7 @@ ExecSetExecProcNode(PlanState *node, ExecProcNodeMtd function)
 	 * Add a wrapper around the ExecProcNode callback that checks stack depth
 	 * during the first execution and maybe adds an instrumentation
 	 * wrapper. When the callback is changed after execution has already begun
-	 * that means we'll superflously execute ExecProcNodeFirst, but that seems
+	 * that means we'll superfluously execute ExecProcNodeFirst, but that seems
 	 * ok.
 	 */
 	node->ExecProcNodeReal = function;

src/backend/jit/llvm/llvmjit_expr.c

@@ -1768,7 +1768,7 @@ llvm_compile_expr(ExprState *state)
 									b_compare_result,
 									b_null);
 
-					/* build block analying the !NULL comparator result */
+					/* build block analyzing the !NULL comparator result */
 					LLVMPositionBuilderAtEnd(b, b_compare_result);
 
 					/* if results equal, compare next, otherwise done */

src/backend/optimizer/geqo/geqo_misc.c

@@ -92,7 +92,7 @@ print_gen(FILE *fp, Pool *pool, int generation)
 {
 	int			lowest;
 
-	/* Get index to lowest ranking gene in poplulation. */
+	/* Get index to lowest ranking gene in population. */
 	/* Use 2nd to last since last is buffer. */
 	lowest = pool->size > 1 ? pool->size - 2 : 0;
 

src/backend/optimizer/plan/planner.c

@@ -6709,7 +6709,7 @@ create_partial_grouping_paths(PlannerInfo *root,
  * Gather Merge.
  *
  * NB: This function shouldn't be used for anything other than a grouped or
- * partially grouped relation not only because of the fact that it explcitly
+ * partially grouped relation not only because of the fact that it explicitly
  * references group_pathkeys but we pass "true" as the third argument to
  * generate_gather_paths().
  */
@@ -6841,7 +6841,7 @@ apply_scanjoin_target_to_paths(PlannerInfo *root,
 	 */
 	rel->reltarget = llast_node(PathTarget, scanjoin_targets);
 
-	/* Special case: handly dummy relations separately. */
+	/* Special case: handle dummy relations separately. */
 	if (is_dummy_rel)
 	{
 		/*

src/backend/rewrite/rewriteHandler.c

@@ -710,7 +710,7 @@ adjustJoinTreeList(Query *parsetree, bool removert, int rt_index)
  * using the parent relation as reference.  It must not do anything that
  * will not be correct when transposed to the child relation(s).  (Step 4
  * is incorrect by this light, since child relations might have different
- * colun ordering, but the planner will fix things by re-sorting the tlist
+ * column ordering, but the planner will fix things by re-sorting the tlist
  * for each child.)
  */
 static List *

src/backend/storage/ipc/ipc.c

@@ -374,7 +374,7 @@ on_shmem_exit(pg_on_exit_callback function, Datum arg)
 /* ----------------------------------------------------------------
  *		cancel_before_shmem_exit
  *
- *		this function removes a previously-registed before_shmem_exit
+ *		this function removes a previously-registered before_shmem_exit
  *		callback.  For simplicity, only the latest entry can be
  *		removed.  (We could work harder but there is no need for
  *		current uses.)

src/backend/utils/adt/jsonfuncs.c

@@ -1172,7 +1172,7 @@ get_object_field_end(void *state, char *fname, bool isnull)
 	if (get_last && _state->result_start != NULL)
 	{
 		/*
-		 * make a text object from the string from the prevously noted json
+		 * make a text object from the string from the previously noted json
 		 * start up to the end of the previous token (the lexer is by now
 		 * ahead of us on whatever came after what we're interested in).
 		 */

src/backend/utils/adt/oracle_compat.c

@@ -912,7 +912,7 @@ ascii(PG_FUNCTION_ARGS)
  *
  *	Returns the character having the binary equivalent to val.
  *
- * For UTF8 we treat the argumwent as a Unicode code point.
+ * For UTF8 we treat the argument as a Unicode code point.
  * For other multi-byte encodings we raise an error for arguments
  * outside the strict ASCII range (1..127).
  *

src/backend/utils/mmgr/dsa.c

@@ -649,7 +649,7 @@ dsa_pin_mapping(dsa_area *area)
  * will result in an ERROR.
  *
  * DSA_ALLOC_NO_OOM causes this function to return InvalidDsaPointer when
- * no memory is available or a size limit establed by set_dsa_size_limit
+ * no memory is available or a size limit established by set_dsa_size_limit
  * would be exceeded.  Otherwise, such allocations will result in an ERROR.
  *
  * DSA_ALLOC_ZERO causes the allocated memory to be zeroed.  Otherwise, the

src/backend/utils/sort/sharedtuplestore.c

@@ -386,7 +386,7 @@ sts_puttuple(SharedTuplestoreAccessor *accessor, void *meta_data,
 				sts_flush_chunk(accessor);
 
 				/*
-				 * How many oveflow chunks to go?  This will allow readers to
+				 * How many overflow chunks to go?  This will allow readers to
 				 * skip all of them at once instead of reading each one.
 				 */
 				accessor->write_chunk->overflow = (size + STS_CHUNK_DATA_SIZE - 1) /