Commit 1e70c1fe authored by Bruce Momjian's avatar Bruce Momjian

comments cleanup.

parent 7fe29ece
...@@ -7,7 +7,7 @@ ...@@ -7,7 +7,7 @@
* *
* *
* IDENTIFICATION * IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.73 1999/02/18 00:49:12 momjian Exp $ * $Header: /cvsroot/pgsql/src/backend/nodes/copyfuncs.c,v 1.74 1999/02/22 19:55:42 momjian Exp $
* *
*------------------------------------------------------------------------- *-------------------------------------------------------------------------
*/ */
...@@ -1002,9 +1002,9 @@ _copyArrayRef(ArrayRef *from) ...@@ -1002,9 +1002,9 @@ _copyArrayRef(ArrayRef *from)
* ---------------- * ----------------
*/ */
/* /*
** when you change this, also make sure to fix up xfunc_copyRelOptInfo in * when you change this, also make sure to fix up xfunc_copyRelOptInfo in
** planner/path/xfunc.c accordingly!!! * planner/path/xfunc.c accordingly!!!
** -- JMH, 8/2/93 * -- JMH, 8/2/93
*/ */
static RelOptInfo * static RelOptInfo *
_copyRelOptInfo(RelOptInfo * from) _copyRelOptInfo(RelOptInfo * from)
...@@ -1469,9 +1469,8 @@ _copyStream(Stream *from) ...@@ -1469,9 +1469,8 @@ _copyStream(Stream *from)
return newnode; return newnode;
} }
/* **************** /*
* parsenodes.h routines have no copy functions * parsenodes.h routines have no copy functions
* ****************
*/ */
static TargetEntry * static TargetEntry *
...@@ -1604,9 +1603,8 @@ _copyQuery(Query *from) ...@@ -1604,9 +1603,8 @@ _copyQuery(Query *from)
} }
/* **************** /*
* mnodes.h routines have no copy functions * mnodes.h routines have no copy functions
* ****************
*/ */
/* **************************************************************** /* ****************************************************************
......
...@@ -7,7 +7,7 @@ ...@@ -7,7 +7,7 @@
* *
* *
* IDENTIFICATION * IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/nodes/Attic/freefuncs.c,v 1.13 1999/02/18 00:49:14 momjian Exp $ * $Header: /cvsroot/pgsql/src/backend/nodes/Attic/freefuncs.c,v 1.14 1999/02/22 19:55:42 momjian Exp $
* *
*------------------------------------------------------------------------- *-------------------------------------------------------------------------
*/ */
...@@ -1045,9 +1045,8 @@ _freeStream(Stream *node) ...@@ -1045,9 +1045,8 @@ _freeStream(Stream *node)
pfree(node); pfree(node);
} }
/* **************** /*
* parsenodes.h routines have no free functions * parsenodes.h routines have no free functions
* ****************
*/ */
static void static void
...@@ -1134,9 +1133,8 @@ _freeQuery(Query *node) ...@@ -1134,9 +1133,8 @@ _freeQuery(Query *node)
} }
/* **************** /*
* mnodes.h routines have no free functions * mnodes.h routines have no free functions
* ****************
*/ */
/* **************************************************************** /* ****************************************************************
......
...@@ -7,7 +7,7 @@ ...@@ -7,7 +7,7 @@
* *
* *
* IDENTIFICATION * IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/utils/init/postinit.c,v 1.38 1999/02/19 06:06:10 tgl Exp $ * $Header: /cvsroot/pgsql/src/backend/utils/init/postinit.c,v 1.39 1999/02/22 19:55:43 momjian Exp $
* *
* NOTES * NOTES
* InitPostgres() is the function called from PostgresMain * InitPostgres() is the function called from PostgresMain
...@@ -515,19 +515,14 @@ InitPostgres(char *name) /* database name */ ...@@ -515,19 +515,14 @@ InitPostgres(char *name) /* database name */
} }
/* /*
* ******************************** * Code after this point assumes we are in the proper directory!
*
*
*
* code after this point assumes we are in the proper directory!
* *
* So, how do we implement alternate locations for databases? There are * So, how do we implement alternate locations for databases? There are
* two possible locations for tables and we need to look in * two possible locations for tables and we need to look in
* DataDir/pg_database to find the true location of an individual * DataDir/pg_database to find the true location of an individual
* database. We can brute-force it as done in InitMyDatabaseInfo(), or * database. We can brute-force it as done in InitMyDatabaseInfo(), or
* we can be patient and wait until we open pg_database gracefully. * we can be patient and wait until we open pg_database gracefully.
* Will try that, but may not work... - thomas 1997-11-01 ******************************** * Will try that, but may not work... - thomas 1997-11-01
*
*/ */
/* Does not touch files (?) - thomas 1997-11-01 */ /* Does not touch files (?) - thomas 1997-11-01 */
......
...@@ -6,7 +6,7 @@ ...@@ -6,7 +6,7 @@
* *
* Copyright (c) 1994, Regents of the University of California * Copyright (c) 1994, Regents of the University of California
* *
* $Id: relation.h,v 1.28 1999/02/20 19:02:43 momjian Exp $ * $Id: relation.h,v 1.29 1999/02/22 19:55:44 momjian Exp $
* *
*------------------------------------------------------------------------- *-------------------------------------------------------------------------
*/ */
...@@ -185,9 +185,9 @@ typedef struct HashPath ...@@ -185,9 +185,9 @@ typedef struct HashPath
List *innerhashkeys; List *innerhashkeys;
} HashPath; } HashPath;
/****** /*
* Keys * Keys
******/ */
typedef struct OrderKey typedef struct OrderKey
{ {
...@@ -203,9 +203,9 @@ typedef struct JoinKey ...@@ -203,9 +203,9 @@ typedef struct JoinKey
Var *inner; Var *inner;
} JoinKey; } JoinKey;
/******* /*
* clause info * clause info
*******/ */
typedef struct RestrictInfo typedef struct RestrictInfo
{ {
...@@ -260,24 +260,24 @@ typedef struct Iter ...@@ -260,24 +260,24 @@ typedef struct Iter
} Iter; } Iter;
/* /*
** Stream: * Stream:
** A stream represents a root-to-leaf path in a plan tree (i.e. a tree of * A stream represents a root-to-leaf path in a plan tree (i.e. a tree of
** JoinPaths and Paths). The stream includes pointers to all Path nodes, * JoinPaths and Paths). The stream includes pointers to all Path nodes,
** as well as to any clauses that reside above Path nodes. This structure * as well as to any clauses that reside above Path nodes. This structure
** is used to make Path nodes and clauses look similar, so that Predicate * is used to make Path nodes and clauses look similar, so that Predicate
** Migration can run. * Migration can run.
** *
** pathptr -- pointer to the current path node * pathptr -- pointer to the current path node
** cinfo -- if NULL, this stream node referes to the path node. * cinfo -- if NULL, this stream node referes to the path node.
** Otherwise this is a pointer to the current clause. * Otherwise this is a pointer to the current clause.
** clausetype -- whether cinfo is in loc_restrictinfo or pathinfo in the * clausetype -- whether cinfo is in loc_restrictinfo or pathinfo in the
** path node * path node
** upstream -- linked list pointer upwards * upstream -- linked list pointer upwards
** downstream -- ditto, downwards * downstream -- ditto, downwards
** groupup -- whether or not this node is in a group with the node upstream * groupup -- whether or not this node is in a group with the node upstream
** groupcost -- total cost of the group that node is in * groupcost -- total cost of the group that node is in
** groupsel -- total selectivity of the group that node is in * groupsel -- total selectivity of the group that node is in
*/ */
typedef struct Stream *StreamPtr; typedef struct Stream *StreamPtr;
typedef struct Stream typedef struct Stream
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment