Re-pgindent a few files.

In preparation for landing index AM interface changes.

src/backend/catalog/index.c

@@ -2381,8 +2381,8 @@ IndexBuildHeapRangeScan(Relation heapRelation,
 				case HEAPTUPLE_INSERT_IN_PROGRESS:
 
 					/*
-					 * In "anyvisible" mode, this tuple is visible and we don't
+					 * In "anyvisible" mode, this tuple is visible and we
-					 * need any further checks.
+					 * don't need any further checks.
 					 */
 					if (anyvisible)
 					{
@@ -2437,8 +2437,8 @@ IndexBuildHeapRangeScan(Relation heapRelation,
 
 					/*
 					 * As with INSERT_IN_PROGRESS case, this is unexpected
-					 * unless it's our own deletion or a system catalog;
+					 * unless it's our own deletion or a system catalog; but
-					 * but in anyvisible mode, this tuple is visible.
+					 * in anyvisible mode, this tuple is visible.
 					 */
 					if (anyvisible)
 					{

src/backend/optimizer/path/costsize.c

@@ -228,9 +228,9 @@ cost_seqscan(Path *path, PlannerInfo *root,
 	/*
 	 * Primitive parallel cost model.  Assume the leader will do half as much
 	 * work as a regular worker, because it will also need to read the tuples
-	 * returned by the workers when they percolate up to the gather ndoe.
+	 * returned by the workers when they percolate up to the gather node. This
-	 * This is almost certainly not exactly the right way to model this, so
+	 * is almost certainly not exactly the right way to model this, so this
-	 * this will probably need to be changed at some point...
+	 * will probably need to be changed at some point...
 	 */
 	if (nworkers > 0)
 		run_cost = run_cost / (nworkers + 0.5);