Fix comments that were mis-wrapped, for Tom Lane.

Author: bmomjian

contrib/spi/refint.c

@@ -399,19 +399,29 @@ check_foreign_key(PG_FUNCTION_ARGS)
 		{
 			relname = args2[0];
 
-			/*
-			 * For 'R'estrict action we construct SELECT query - SELECT 1
-			 * FROM _referencing_relation_ WHERE Fkey1 = $1 [AND Fkey2 =
-			 * $2 [...]] - to check is tuple referenced or not.
+			/*---------
+			 * For 'R'estrict action we construct SELECT query:
+			 *
+			 *  SELECT 1
+			 *	FROM _referencing_relation_
+			 *	WHERE Fkey1 = $1 [AND Fkey2 = $2 [...]]
+			 *
+			 *  to check is tuple referenced or not.
+			 *---------
 			 */
 			if (action == 'r')
 
 				sprintf(sql, "select 1 from %s where ", relname);
 
-			/*
-			 * For 'C'ascade action we construct DELETE query - DELETE
-			 * FROM _referencing_relation_ WHERE Fkey1 = $1 [AND Fkey2 =
-			 * $2 [...]] - to delete all referencing tuples.
+			/*---------
+			 * For 'C'ascade action we construct DELETE query
+			 *
+			 *	DELETE
+			 *	FROM _referencing_relation_
+			 *	WHERE Fkey1 = $1 [AND Fkey2 = $2 [...]]
+			 *
+			 * to delete all referencing tuples.
+			 *---------
 			 */
 
 			/*

src/backend/access/gist/gistscan.c

@@ -143,9 +143,10 @@ gistrescan(PG_FUNCTION_ARGS)
 			for (i = 0; i < s->numberOfKeys; i++)
 			{
 
-				/*
+				/*----------
 				 * s->keyData[i].sk_procedure =
-				 * index_getprocid(s->relation, 1, GIST_CONSISTENT_PROC);
+				 * 		index_getprocid(s->relation, 1, GIST_CONSISTENT_PROC);
+				 *----------
 				 */
 				s->keyData[i].sk_procedure
 					= RelationGetGISTStrategy(s->relation, s->keyData[i].sk_attno,

src/backend/access/hash/hashsearch.c

@@ -8,7 +8,7 @@
  *
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/access/hash/hashsearch.c,v 1.25 2001/01/24 19:42:47 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/access/hash/hashsearch.c,v 1.26 2001/03/23 04:49:51 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -334,9 +334,11 @@ _hash_step(IndexScanDesc scan, Buffer *bufP, ScanDirection dir, Buffer metabuf)
 				while (offnum > maxoff)
 				{
 
-					/*
-					 * either this page is empty (maxoff ==
-					 * InvalidOffsetNumber) or we ran off the end.
+					/*--------
+					 * either this page is empty
+					 * (maxoff == InvalidOffsetNumber)
+					 * or we ran off the end.
+					 *--------
 					 */
 					_hash_readnext(rel, &buf, &page, &opaque);
 					if (BufferIsInvalid(buf))
@@ -382,9 +384,11 @@ _hash_step(IndexScanDesc scan, Buffer *bufP, ScanDirection dir, Buffer metabuf)
 				while (offnum < FirstOffsetNumber)
 				{
 
-					/*
-					 * either this page is empty (offnum ==
-					 * InvalidOffsetNumber) or we ran off the end.
+					/*---------
+					 * either this page is empty
+					 * (offnum == InvalidOffsetNumber)
+					 * or we ran off the end.
+					 *---------
 					 */
 					_hash_readprev(rel, &buf, &page, &opaque);
 					if (BufferIsInvalid(buf))

src/backend/access/heap/tuptoaster.c

@@ -8,7 +8,7 @@
  *
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/access/heap/tuptoaster.c,v 1.19 2001/03/22 06:16:07 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/access/heap/tuptoaster.c,v 1.20 2001/03/23 04:49:51 momjian Exp $
  *
  *
  * INTERFACE ROUTINES
@@ -458,9 +458,10 @@ toast_insert_or_update(Relation rel, HeapTuple newtup, HeapTuple oldtup)
 		int32		biggest_size = MAXALIGN(sizeof(varattrib));
 		Datum		old_value;
 
-		/*
-		 * Search for the biggest yet inlined attribute with attstorage =
-		 * 'x' or 'e'
+		/*------
+		 * Search for the biggest yet inlined attribute with
+		 * attstorage equals 'x' or 'e'
+		 *------
 		 */
 		for (i = 0; i < numAttrs; i++)
 		{
@@ -572,9 +573,10 @@ toast_insert_or_update(Relation rel, HeapTuple newtup, HeapTuple oldtup)
 		int32		biggest_size = MAXALIGN(sizeof(varattrib));
 		Datum		old_value;
 
-		/*
-		 * Search for the biggest yet inlined attribute with attstorage =
-		 * 'm'
+		/*--------
+		 * Search for the biggest yet inlined attribute with
+		 * attstorage = 'm'
+		 *--------
 		 */
 		for (i = 0; i < numAttrs; i++)
 		{

src/backend/access/nbtree/nbtsearch.c

@@ -8,7 +8,7 @@
  * Portions Copyright (c) 1994, Regents of the University of California
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtsearch.c,v 1.65 2001/03/22 06:16:07 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtsearch.c,v 1.66 2001/03/23 04:49:51 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -584,8 +584,10 @@ _bt_first(IndexScanDesc scan, ScanDirection dir)
 
 	/*
 	 * At this point we are positioned at the first item >= scan key, or
-	 * possibly at the end of a page on which all the existing items are <
-	 * scan key and we know that everything on later pages is >= scan key.
+	 * possibly at the end of a page on which all the existing items are 
+	 * greater than the scan key and we know that everything on later pages
+	 * is less than or equal to scan key.
+     *
 	 * We could step forward in the latter case, but that'd be a waste of
 	 * time if we want to scan backwards.  So, it's now time to examine
 	 * the scan strategy to find the exact place to start the scan.

src/backend/access/nbtree/nbtutils.c

@@ -8,7 +8,7 @@
  *
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtutils.c,v 1.43 2001/03/22 03:59:15 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtutils.c,v 1.44 2001/03/23 04:49:52 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -412,8 +412,8 @@ _bt_orderkeys(Relation relation, BTScanOpaque so)
 			if (DatumGetBool(test))
 				xform[j].sk_argument = cur->sk_argument;
 			else if (j == (BTEqualStrategyNumber - 1))
-				so->qual_ok = false;	/* key == a && key == b, but a !=
-										 * b */
+				so->qual_ok = false;
+			/* key == a && key == b, but a != b */
 		}
 		else
 		{

src/backend/commands/_deadcode/version.c

@@ -10,7 +10,7 @@
  *	doesn't work! - jolly 8/19/95
  *
  *
- *	$Id: version.c,v 1.25 2001/01/24 19:42:53 momjian Exp $
+ *	$Id: version.c,v 1.26 2001/03/23 04:49:52 momjian Exp $
  *
  * NOTES
  *	At the point the version is defined, 2 physical relations are created
@@ -77,9 +77,12 @@ static void
 eval_as_new_xact(char *query)
 {
 
-	/*
+	/*------
 	 * WARNING! do not uncomment the following lines WARNING!
-	 * CommitTransactionCommand(); StartTransactionCommand();
+	 *
+	 *	CommitTransactionCommand();
+	 *	StartTransactionCommand();
+	 *------
 	 */
 	CommandCounterIncrement();
 	pg_exec_query(query);

src/backend/commands/command.c

@@ -8,7 +8,7 @@
  *
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/commands/Attic/command.c,v 1.124 2001/03/22 06:16:11 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/commands/Attic/command.c,v 1.125 2001/03/23 04:49:52 momjian Exp $
  *
  * NOTES
  *	  The PerformAddAttribute() code, like most of the relation
@@ -1034,11 +1034,13 @@ AlterTableDropColumn(const char *relationName,
 	ScanKeyEntryInitialize(&scankeys[0], 0x0, Anum_pg_attrdef_adrelid,
 						   F_OIDEQ, ObjectIdGetDatum(myrelid));
 
-	/*
+	/*--------
 	 * Oops pg_attrdef doesn't have (adrelid,adnum) index
-	 * ScanKeyEntryInitialize(&scankeys[1], 0x0, Anum_pg_attrdef_adnum,
-	 * F_INT2EQ, Int16GetDatum(attnum)); sysscan =
-	 * systable_beginscan(adrel, AttrDefaultIndex, 2, scankeys);
+	 *
+	 *	ScanKeyEntryInitialize(&scankeys[1], 0x0, Anum_pg_attrdef_adnum,
+	 * 								F_INT2EQ, Int16GetDatum(attnum));
+	 *	sysscan = systable_beginscan(adrel, AttrDefaultIndex, 2, scankeys);
+	 *--------
 	 */
 	sysscan = systable_beginscan(adrel, AttrDefaultIndex, 1, scankeys);
 	while (HeapTupleIsValid(tup = systable_getnext(sysscan)))

src/backend/executor/execQual.c

@@ -8,7 +8,7 @@
  *
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/executor/execQual.c,v 1.84 2001/03/22 03:59:26 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/executor/execQual.c,v 1.85 2001/03/23 04:49:53 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -1499,8 +1499,9 @@ ExecTargetList(List *targetlist,
 	 * and another array that holds the isDone status for each targetlist
 	 * item. The isDone status is needed so that we can iterate,
 	 * generating multiple tuples, when one or more tlist items return
-	 * sets.  (We expect the caller to call us again if we return *isDone
-	 * = ExprMultipleResult.)
+	 * sets.  (We expect the caller to call us again if we return:
+	 *
+	 *	isDone = ExprMultipleResult.)
 	 */
 	if (nodomains > NPREALLOCDOMAINS)
 	{

src/backend/executor/nodeLimit.c

@@ -8,7 +8,7 @@
  *
  *
  * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/executor/nodeLimit.c,v 1.5 2001/03/22 06:16:13 momjian Exp $
+ *	  $Header: /cvsroot/pgsql/src/backend/executor/nodeLimit.c,v 1.6 2001/03/23 04:49:53 momjian Exp $
  *
  *-------------------------------------------------------------------------
  */
@@ -79,8 +79,8 @@ ExecLimit(Limit *node)
 		 * tuple in the offset region before we can return NULL.
 		 * Otherwise we won't be correctly aligned to start going forward
 		 * again.  So, although you might think we can quit when position
-		 * = offset + 1, we have to fetch a subplan tuple first, and then
-		 * exit when position = offset.
+		 * equals offset + 1, we have to fetch a subplan tuple first, and
+		 * then exit when position = offset.
 		 */
 		if (ScanDirectionIsForward(direction))
 		{