diff options
| author | Bruce Momjian | 1999-02-13 23:22:53 +0000 |
|---|---|---|
| committer | Bruce Momjian | 1999-02-13 23:22:53 +0000 |
| commit | c2d77d4164e783cd421cc877ea8caa8b8b469ff8 (patch) | |
| tree | 8105ffbe2df2759fcee9d8fcd2420ef94f3ceca6 | |
| parent | add57980ada50540e2d45a7842aa10b4215e4092 (diff) | |
Change my-function-name-- to my_function_name, and optimizer renames.
617 files changed, 1432 insertions, 1458 deletions
diff --git a/src/backend/access/common/heaptuple.c b/src/backend/access/common/heaptuple.c index 4b21ce13e8..648822f93c 100644 --- a/src/backend/access/common/heaptuple.c +++ b/src/backend/access/common/heaptuple.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * heaptuple.c-- + * heaptuple.c * This file contains heap tuple accessor and mutator routines, as well * as a few various tuple utilities. * diff --git a/src/backend/access/common/heapvalid.c b/src/backend/access/common/heapvalid.c index 5024a3e078..42c5f65dc7 100644 --- a/src/backend/access/common/heapvalid.c +++ b/src/backend/access/common/heapvalid.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * heapvalid.c-- + * heapvalid.c * heap tuple qualification validity checking code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/common/indextuple.c b/src/backend/access/common/indextuple.c index b7608ad5b7..37c3ed3e5c 100644 --- a/src/backend/access/common/indextuple.c +++ b/src/backend/access/common/indextuple.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indextuple.c-- + * indextuple.c * This file contains index tuple accessor and mutator routines, * as well as a few various tuple utilities. * diff --git a/src/backend/access/common/indexvalid.c b/src/backend/access/common/indexvalid.c index 39c7838daf..fa7d745232 100644 --- a/src/backend/access/common/indexvalid.c +++ b/src/backend/access/common/indexvalid.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indexvalid.c-- + * indexvalid.c * index tuple qualification validity checking code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/common/printtup.c b/src/backend/access/common/printtup.c index 8c03dc3242..14c9008e87 100644 --- a/src/backend/access/common/printtup.c +++ b/src/backend/access/common/printtup.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * printtup.c-- + * printtup.c * Routines to print out tuples to the destination (binary or non-binary * portals, frontend/interactive backend, etc.). * diff --git a/src/backend/access/common/scankey.c b/src/backend/access/common/scankey.c index 8a3a45f3c9..7096a6915a 100644 --- a/src/backend/access/common/scankey.c +++ b/src/backend/access/common/scankey.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * scan.c-- + * scan.c * scan direction and key code * * Copyright (c) 1994, Regents of the University of California @@ -18,7 +18,7 @@ #include <access/skey.h> /* - * ScanKeyEntryIsLegal -- + * ScanKeyEntryIsLegal * True iff the scan key entry is legal. */ #define ScanKeyEntryIsLegal(entry) \ @@ -28,7 +28,7 @@ ) /* - * ScanKeyEntrySetIllegal -- + * ScanKeyEntrySetIllegal * Marks a scan key entry as illegal. */ void @@ -43,7 +43,7 @@ ScanKeyEntrySetIllegal(ScanKey entry) } /* - * ScanKeyEntryInitialize -- + * ScanKeyEntryInitialize * Initializes an scan key entry. * * Note: diff --git a/src/backend/access/common/tupdesc.c b/src/backend/access/common/tupdesc.c index bd93cac20a..90909f59e4 100644 --- a/src/backend/access/common/tupdesc.c +++ b/src/backend/access/common/tupdesc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tupdesc.c-- + * tupdesc.c * POSTGRES tuple descriptor support code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/gist/gist.c b/src/backend/access/gist/gist.c index ce9ef24c88..54c0c4a4f6 100644 --- a/src/backend/access/gist/gist.c +++ b/src/backend/access/gist/gist.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * gist.c-- + * gist.c * interface routines for the postgres GiST index access method. * * diff --git a/src/backend/access/gist/gistget.c b/src/backend/access/gist/gistget.c index 35708bf653..665bc83035 100644 --- a/src/backend/access/gist/gistget.c +++ b/src/backend/access/gist/gistget.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * gistget.c-- + * gistget.c * fetch tuples from a GiST scan. * * diff --git a/src/backend/access/gist/gistscan.c b/src/backend/access/gist/gistscan.c index 3528fd30ce..92353d71b2 100644 --- a/src/backend/access/gist/gistscan.c +++ b/src/backend/access/gist/gistscan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * gistscan.c-- + * gistscan.c * routines to manage scans on index relations * * diff --git a/src/backend/access/gist/giststrat.c b/src/backend/access/gist/giststrat.c index b54c0951c4..69eb9c31c3 100644 --- a/src/backend/access/gist/giststrat.c +++ b/src/backend/access/gist/giststrat.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * giststrat.c-- + * giststrat.c * strategy map data for GiSTs. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hash.c b/src/backend/access/hash/hash.c index 8740c2dfeb..93aaf8583a 100644 --- a/src/backend/access/hash/hash.c +++ b/src/backend/access/hash/hash.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hash.c-- + * hash.c * Implementation of Margo Seltzer's Hashing package for postgres. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashfunc.c b/src/backend/access/hash/hashfunc.c index ca0e4251e6..52adc2ee47 100644 --- a/src/backend/access/hash/hashfunc.c +++ b/src/backend/access/hash/hashfunc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashfunc.c-- + * hashfunc.c * Comparison functions for hash access method. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashinsert.c b/src/backend/access/hash/hashinsert.c index 962f60edf9..b84fb4632a 100644 --- a/src/backend/access/hash/hashinsert.c +++ b/src/backend/access/hash/hashinsert.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashinsert.c-- + * hashinsert.c * Item insertion in hash tables for Postgres. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashovfl.c b/src/backend/access/hash/hashovfl.c index d16dd4ef8c..7a9fd70a0d 100644 --- a/src/backend/access/hash/hashovfl.c +++ b/src/backend/access/hash/hashovfl.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashovfl.c-- + * hashovfl.c * Overflow page management code for the Postgres hash access method * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashpage.c b/src/backend/access/hash/hashpage.c index 2d600f6e51..56ed1fd9b8 100644 --- a/src/backend/access/hash/hashpage.c +++ b/src/backend/access/hash/hashpage.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashpage.c-- + * hashpage.c * Hash table page management code for the Postgres hash access method * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashscan.c b/src/backend/access/hash/hashscan.c index 00fbaafd20..7d15063f57 100644 --- a/src/backend/access/hash/hashscan.c +++ b/src/backend/access/hash/hashscan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashscan.c-- + * hashscan.c * manage scans on hash tables * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashsearch.c b/src/backend/access/hash/hashsearch.c index caa354c77f..e9b91ad2f1 100644 --- a/src/backend/access/hash/hashsearch.c +++ b/src/backend/access/hash/hashsearch.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashsearch.c-- + * hashsearch.c * search code for postgres hash tables * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashstrat.c b/src/backend/access/hash/hashstrat.c index 0f833e4eba..505cdd25d9 100644 --- a/src/backend/access/hash/hashstrat.c +++ b/src/backend/access/hash/hashstrat.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btstrat.c-- + * btstrat.c * Srategy map entries for the btree indexed access method * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/hash/hashutil.c b/src/backend/access/hash/hashutil.c index a7e8cbf2e9..057514f800 100644 --- a/src/backend/access/hash/hashutil.c +++ b/src/backend/access/hash/hashutil.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btutils.c-- + * btutils.c * Utility code for Postgres btree implementation. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/heap/heapam.c b/src/backend/access/heap/heapam.c index ed31927256..b5f2e87edc 100644 --- a/src/backend/access/heap/heapam.c +++ b/src/backend/access/heap/heapam.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * heapam.c-- + * heapam.c * heap access method code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/heap/hio.c b/src/backend/access/heap/hio.c index 034202d457..1a15caeb14 100644 --- a/src/backend/access/heap/hio.c +++ b/src/backend/access/heap/hio.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hio.c-- + * hio.c * POSTGRES heap access method input/output code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/heap/stats.c b/src/backend/access/heap/stats.c index ee196a71e7..72813edc66 100644 --- a/src/backend/access/heap/stats.c +++ b/src/backend/access/heap/stats.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * stats.c-- + * stats.c * heap access method debugging statistic collection routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/index/genam.c b/src/backend/access/index/genam.c index 72d9979595..103d46751a 100644 --- a/src/backend/access/index/genam.c +++ b/src/backend/access/index/genam.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * genam.c-- + * genam.c * general index access method routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/index/indexam.c b/src/backend/access/index/indexam.c index eba079f0dd..09d5c96d62 100644 --- a/src/backend/access/index/indexam.c +++ b/src/backend/access/index/indexam.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indexam.c-- + * indexam.c * general index access method routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/index/istrat.c b/src/backend/access/index/istrat.c index 49c4933453..4487302e21 100644 --- a/src/backend/access/index/istrat.c +++ b/src/backend/access/index/istrat.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * istrat.c-- + * istrat.c * index scan strategy manipulation code and index strategy manipulation * operator code. * @@ -57,7 +57,7 @@ static bool StrategyTermIsValid(StrategyTerm term, */ /* - * StrategyMapGetScanKeyEntry -- + * StrategyMapGetScanKeyEntry * Returns a scan key entry of a index strategy mapping member. * * Note: @@ -75,7 +75,7 @@ StrategyMapGetScanKeyEntry(StrategyMap map, } /* - * IndexStrategyGetStrategyMap -- + * IndexStrategyGetStrategyMap * Returns an index strategy mapping of an index strategy. * * Note: @@ -97,7 +97,7 @@ IndexStrategyGetStrategyMap(IndexStrategy indexStrategy, } /* - * AttributeNumberGetIndexStrategySize -- + * AttributeNumberGetIndexStrategySize * Computes the size of an index strategy. */ Size @@ -526,7 +526,7 @@ OperatorRelationFillScanKeyEntry(Relation operatorRelation, /* - * IndexSupportInitialize -- + * IndexSupportInitialize * Initializes an index strategy and associated support procedures. */ void diff --git a/src/backend/access/nbtree/nbtcompare.c b/src/backend/access/nbtree/nbtcompare.c index 4f16257c30..f33f57a38c 100644 --- a/src/backend/access/nbtree/nbtcompare.c +++ b/src/backend/access/nbtree/nbtcompare.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nbtcompare.c-- + * nbtcompare.c * Comparison functions for btree access method. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/nbtree/nbtinsert.c b/src/backend/access/nbtree/nbtinsert.c index 4642a5024b..3dc36ee0c7 100644 --- a/src/backend/access/nbtree/nbtinsert.c +++ b/src/backend/access/nbtree/nbtinsert.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btinsert.c-- + * btinsert.c * Item insertion in Lehman and Yao btrees for Postgres. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/nbtree/nbtpage.c b/src/backend/access/nbtree/nbtpage.c index 767b83de2a..b003071a91 100644 --- a/src/backend/access/nbtree/nbtpage.c +++ b/src/backend/access/nbtree/nbtpage.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nbtpage.c-- + * nbtpage.c * BTree-specific page management code for the Postgres btree access * method. * @@ -413,7 +413,7 @@ _bt_pageinit(Page page, Size size) { /* - * Cargo-cult programming -- don't really need this to be zero, but + * Cargo_cult programming -- don't really need this to be zero, but * creating new pages is an infrequent occurrence and it makes me feel * good when I know they're empty. */ diff --git a/src/backend/access/nbtree/nbtree.c b/src/backend/access/nbtree/nbtree.c index d05209c0a5..d152fb7178 100644 --- a/src/backend/access/nbtree/nbtree.c +++ b/src/backend/access/nbtree/nbtree.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btree.c-- + * btree.c * Implementation of Lehman and Yao's btree management algorithm for * Postgres. * diff --git a/src/backend/access/nbtree/nbtscan.c b/src/backend/access/nbtree/nbtscan.c index 4ac40ac46f..f31b9fb803 100644 --- a/src/backend/access/nbtree/nbtscan.c +++ b/src/backend/access/nbtree/nbtscan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btscan.c-- + * btscan.c * manage scans on btrees. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/nbtree/nbtsearch.c b/src/backend/access/nbtree/nbtsearch.c index 881771fae0..cefee164fa 100644 --- a/src/backend/access/nbtree/nbtsearch.c +++ b/src/backend/access/nbtree/nbtsearch.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btsearch.c-- + * btsearch.c * search code for postgres btrees. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/nbtree/nbtsort.c b/src/backend/access/nbtree/nbtsort.c index db17d29965..9bed9354ff 100644 --- a/src/backend/access/nbtree/nbtsort.c +++ b/src/backend/access/nbtree/nbtsort.c @@ -1,5 +1,5 @@ /*------------------------------------------------------------------------- - * btsort.c-- + * btsort.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/access/nbtree/nbtstrat.c b/src/backend/access/nbtree/nbtstrat.c index 44d8f2c664..add5c1cf75 100644 --- a/src/backend/access/nbtree/nbtstrat.c +++ b/src/backend/access/nbtree/nbtstrat.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btstrat.c-- + * btstrat.c * Srategy map entries for the btree indexed access method * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/nbtree/nbtutils.c b/src/backend/access/nbtree/nbtutils.c index 4e3c95b52e..94c07e9751 100644 --- a/src/backend/access/nbtree/nbtutils.c +++ b/src/backend/access/nbtree/nbtutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * btutils.c-- + * btutils.c * Utility code for Postgres btree implementation. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/rtree/rtget.c b/src/backend/access/rtree/rtget.c index 8b1f62650f..4df68a3d4e 100644 --- a/src/backend/access/rtree/rtget.c +++ b/src/backend/access/rtree/rtget.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtget.c-- + * rtget.c * fetch tuples from an rtree scan. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/rtree/rtproc.c b/src/backend/access/rtree/rtproc.c index e05d70b376..b22099c715 100644 --- a/src/backend/access/rtree/rtproc.c +++ b/src/backend/access/rtree/rtproc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtproc.c-- + * rtproc.c * pg_amproc entries for rtrees. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/rtree/rtree.c b/src/backend/access/rtree/rtree.c index aa022f0296..840f480a45 100644 --- a/src/backend/access/rtree/rtree.c +++ b/src/backend/access/rtree/rtree.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtree.c-- + * rtree.c * interface routines for the postgres rtree indexed access method. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/rtree/rtscan.c b/src/backend/access/rtree/rtscan.c index eaccb28c8b..5e03d54f3b 100644 --- a/src/backend/access/rtree/rtscan.c +++ b/src/backend/access/rtree/rtscan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtscan.c-- + * rtscan.c * routines to manage scans on index relations * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/rtree/rtstrat.c b/src/backend/access/rtree/rtstrat.c index 381182dfa4..bde896e871 100644 --- a/src/backend/access/rtree/rtstrat.c +++ b/src/backend/access/rtree/rtstrat.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtstrat.c-- + * rtstrat.c * strategy map data for rtrees. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/transam/transam.c b/src/backend/access/transam/transam.c index 36b9b9329c..cb19be162e 100644 --- a/src/backend/access/transam/transam.c +++ b/src/backend/access/transam/transam.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * transam.c-- + * transam.c * postgres transaction log/time interface routines * * Copyright (c) 1994, Regents of the University of California @@ -375,7 +375,7 @@ TransRecover(Relation logRelation) */ /* - * InitializeTransactionLog -- + * InitializeTransactionLog * Initializes transaction logging. */ void @@ -485,7 +485,7 @@ InitializeTransactionLog(void) */ /* - * TransactionIdDidCommit -- + * TransactionIdDidCommit * True iff transaction associated with the identifier did commit. * * Note: @@ -501,7 +501,7 @@ TransactionIdDidCommit(TransactionId transactionId) } /* - * TransactionIdDidAborted -- + * TransactionIdDidAborted * True iff transaction associated with the identifier did abort. * * Note: @@ -542,7 +542,7 @@ TransactionIdIsInProgress(TransactionId transactionId) */ /* - * TransactionIdCommit -- + * TransactionIdCommit * Commits the transaction associated with the identifier. * * Note: @@ -558,7 +558,7 @@ TransactionIdCommit(TransactionId transactionId) } /* - * TransactionIdAbort -- + * TransactionIdAbort * Aborts the transaction associated with the identifier. * * Note: diff --git a/src/backend/access/transam/transsup.c b/src/backend/access/transam/transsup.c index d012f16668..57c8c0e16b 100644 --- a/src/backend/access/transam/transsup.c +++ b/src/backend/access/transam/transsup.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * transsup.c-- + * transsup.c * postgres transaction access method support code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/access/transam/varsup.c b/src/backend/access/transam/varsup.c index e65c488157..fd924b1938 100644 --- a/src/backend/access/transam/varsup.c +++ b/src/backend/access/transam/varsup.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * varsup.c-- + * varsup.c * postgres variable relation support routines * * Copyright (c) 1994, Regents of the University of California @@ -260,7 +260,7 @@ VariableRelationPutNextOid(Oid *oidP) * In the version 2 transaction system, transaction id's are * restricted in several ways. * - * -- Old comments removed -- + * -- Old comments removed * * Second, since we may someday preform compression of the data * in the log and time relations, we cause the numbering of the diff --git a/src/backend/access/transam/xact.c b/src/backend/access/transam/xact.c index fcaad1a2c0..c069a027c9 100644 --- a/src/backend/access/transam/xact.c +++ b/src/backend/access/transam/xact.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * xact.c-- + * xact.c * top level transaction system support routines * * Copyright (c) 1994, Regents of the University of California @@ -1036,7 +1036,7 @@ StartTransactionCommand() break; /* ---------------- - * As with BEGIN, we should never experience this -- + * As with BEGIN, we should never experience this * if we do it means the END state was not changed in the * previous CommitTransactionCommand(). If we get it, we * print a warning, commit the transaction, start a new diff --git a/src/backend/access/transam/xid.c b/src/backend/access/transam/xid.c index 4c9a0874a9..17203392f2 100644 --- a/src/backend/access/transam/xid.c +++ b/src/backend/access/transam/xid.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * xid.c-- + * xid.c * POSTGRES transaction identifier code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/bootstrap/bootparse.y b/src/backend/bootstrap/bootparse.y index 68354ed3e9..908a99b10f 100644 --- a/src/backend/bootstrap/bootparse.y +++ b/src/backend/bootstrap/bootparse.y @@ -1,7 +1,7 @@ %{ /*------------------------------------------------------------------------- * - * backendparse.y-- + * backendparse.y * yacc parser grammer for the "backend" initialization program. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/bootstrap/bootscanner.l b/src/backend/bootstrap/bootscanner.l index 079995c871..ff4abb3349 100644 --- a/src/backend/bootstrap/bootscanner.l +++ b/src/backend/bootstrap/bootscanner.l @@ -1,7 +1,7 @@ %{ /*------------------------------------------------------------------------- * - * bootscanner.lex-- + * bootscanner.lex * a lexical scanner for the bootstrap parser * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/bootstrap/bootstrap.c b/src/backend/bootstrap/bootstrap.c index ae5659ce7c..7e860e499a 100644 --- a/src/backend/bootstrap/bootstrap.c +++ b/src/backend/bootstrap/bootstrap.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bootstrap.c-- + * bootstrap.c * routines to support running postgres in 'bootstrap' mode * bootstrap mode is used to create the initial template database * diff --git a/src/backend/catalog/aclchk.c b/src/backend/catalog/aclchk.c index 498ef5dded..9c24c8f11d 100644 --- a/src/backend/catalog/aclchk.c +++ b/src/backend/catalog/aclchk.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * aclchk.c-- + * aclchk.c * Routines to check access control permissions. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/catalog/catalog.c b/src/backend/catalog/catalog.c index b463353a75..126aeff855 100644 --- a/src/backend/catalog/catalog.c +++ b/src/backend/catalog/catalog.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * catalog.c-- + * catalog.c * * * Copyright (c) 1994, Regents of the University of California @@ -43,7 +43,7 @@ relpath(char *relname) } /* - * IsSystemRelationName -- + * IsSystemRelationName * True iff name is the name of a system catalog relation. * * We now make a new requirement where system catalog relns must begin @@ -64,7 +64,7 @@ IsSystemRelationName(char *relname) } /* - * IsSharedSystemRelationName -- + * IsSharedSystemRelationName * True iff name is the name of a shared system catalog relation. */ bool diff --git a/src/backend/catalog/heap.c b/src/backend/catalog/heap.c index 448110af2e..0f6fdcd040 100644 --- a/src/backend/catalog/heap.c +++ b/src/backend/catalog/heap.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * heap.c-- + * heap.c * code to create and destroy POSTGRES heap relations * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/catalog/index.c b/src/backend/catalog/index.c index ec7c943cd2..d3b026af0e 100644 --- a/src/backend/catalog/index.c +++ b/src/backend/catalog/index.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * index.c-- + * index.c * code to create and destroy POSTGRES index relations * * Copyright (c) 1994, Regents of the University of California @@ -356,7 +356,7 @@ ConstructTupleDescriptor(Oid heapoid, } /* ---------------------------------------------------------------- - * AccessMethodObjectIdGetForm -- + * AccessMethodObjectIdGetForm * Returns the formated access method tuple given its object identifier. * * XXX ADD INDEXING diff --git a/src/backend/catalog/indexing.c b/src/backend/catalog/indexing.c index 944860d40f..f23cc3a27a 100644 --- a/src/backend/catalog/indexing.c +++ b/src/backend/catalog/indexing.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indexing.c-- + * indexing.c * This file contains routines to support indices defined on system * catalogs. * diff --git a/src/backend/catalog/pg_aggregate.c b/src/backend/catalog/pg_aggregate.c index a81276ee5b..45ba6b925c 100644 --- a/src/backend/catalog/pg_aggregate.c +++ b/src/backend/catalog/pg_aggregate.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_aggregate.c-- + * pg_aggregate.c * routines to support manipulation of the pg_aggregate relation * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/catalog/pg_operator.c b/src/backend/catalog/pg_operator.c index 86fae2b6a5..1b25850026 100644 --- a/src/backend/catalog/pg_operator.c +++ b/src/backend/catalog/pg_operator.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_operator.c-- + * pg_operator.c * routines to support manipulation of the pg_operator relation * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/catalog/pg_proc.c b/src/backend/catalog/pg_proc.c index 4e3fd83c5f..de1ec5f7cb 100644 --- a/src/backend/catalog/pg_proc.c +++ b/src/backend/catalog/pg_proc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_proc.c-- + * pg_proc.c * routines to support manipulation of the pg_proc relation * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/catalog/pg_type.c b/src/backend/catalog/pg_type.c index 0129a066fe..958c00bf61 100644 --- a/src/backend/catalog/pg_type.c +++ b/src/backend/catalog/pg_type.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_type.c-- + * pg_type.c * routines to support manipulation of the pg_type relation * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/_deadcode/version.c b/src/backend/commands/_deadcode/version.c index e9c262d5a5..980791cdd3 100644 --- a/src/backend/commands/_deadcode/version.c +++ b/src/backend/commands/_deadcode/version.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * version.c-- + * version.c * This file contains all the rules that govern all version semantics. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/async.c b/src/backend/commands/async.c index 8b64903d28..6eaab13eac 100644 --- a/src/backend/commands/async.c +++ b/src/backend/commands/async.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * async.c-- + * async.c * Asynchronous notification: NOTIFY, LISTEN, UNLISTEN * * Copyright (c) 1994, Regents of the University of California @@ -141,7 +141,7 @@ static void ClearPendingNotifies(void); /* *-------------------------------------------------------------- - * Async_Notify -- + * Async_Notify * * This is executed by the SQL notify command. * @@ -184,7 +184,7 @@ Async_Notify(char *relname) /* *-------------------------------------------------------------- - * Async_Listen -- + * Async_Listen * * This is executed by the SQL listen command. * @@ -283,7 +283,7 @@ Async_Listen(char *relname, int pid) /* *-------------------------------------------------------------- - * Async_Unlisten -- + * Async_Unlisten * * This is executed by the SQL unlisten command. * @@ -332,7 +332,7 @@ Async_Unlisten(char *relname, int pid) /* *-------------------------------------------------------------- - * Async_UnlistenAll -- + * Async_UnlistenAll * * Unlisten all relations for this backend. * @@ -378,7 +378,7 @@ Async_UnlistenAll() /* *-------------------------------------------------------------- - * Async_UnlistenOnExit -- + * Async_UnlistenOnExit * * Clean up the pg_listener table at backend exit. * @@ -412,7 +412,7 @@ Async_UnlistenOnExit() /* *-------------------------------------------------------------- - * AtCommit_Notify -- + * AtCommit_Notify * * This is called at transaction commit. * @@ -548,7 +548,7 @@ AtCommit_Notify() /* *-------------------------------------------------------------- - * AtAbort_Notify -- + * AtAbort_Notify * * This is called at transaction abort. * @@ -568,7 +568,7 @@ AtAbort_Notify() /* *-------------------------------------------------------------- - * Async_NotifyHandler -- + * Async_NotifyHandler * * This is the signal handler for SIGUSR2. * @@ -627,7 +627,7 @@ Async_NotifyHandler(SIGNAL_ARGS) /* * -------------------------------------------------------------- - * EnableNotifyInterrupt -- + * EnableNotifyInterrupt * * This is called by the PostgresMain main loop just before waiting * for a frontend command. If we are truly idle (ie, *not* inside @@ -685,7 +685,7 @@ EnableNotifyInterrupt(void) /* * -------------------------------------------------------------- - * DisableNotifyInterrupt -- + * DisableNotifyInterrupt * * This is called by the PostgresMain main loop just after receiving * a frontend command. Signal handler execution of inbound notifies @@ -701,7 +701,7 @@ DisableNotifyInterrupt(void) /* * -------------------------------------------------------------- - * ProcessIncomingNotify -- + * ProcessIncomingNotify * * Deal with arriving NOTIFYs from other backends. * This is called either directly from the SIGUSR2 signal handler, diff --git a/src/backend/commands/cluster.c b/src/backend/commands/cluster.c index b2a65dc99e..69af81f6e3 100644 --- a/src/backend/commands/cluster.c +++ b/src/backend/commands/cluster.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * cluster.c-- + * cluster.c * Paul Brown's implementation of cluster index. * * I am going to use the rename function as a model for this in the diff --git a/src/backend/commands/command.c b/src/backend/commands/command.c index 48c96c18e4..77165147eb 100644 --- a/src/backend/commands/command.c +++ b/src/backend/commands/command.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * command.c-- + * command.c * random postgres portal and utility support code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/copy.c b/src/backend/commands/copy.c index 41e4149f39..c7afdb96bc 100644 --- a/src/backend/commands/copy.c +++ b/src/backend/commands/copy.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * copy.c-- + * copy.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/commands/creatinh.c b/src/backend/commands/creatinh.c index 43a9aea5ee..eb9e00e53d 100644 --- a/src/backend/commands/creatinh.c +++ b/src/backend/commands/creatinh.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * creatinh.c-- + * creatinh.c * POSTGRES create/destroy relation with inheritance utility code. * * Copyright (c) 1994, Regents of the University of California @@ -39,7 +39,7 @@ static List *MergeAttributes(List *schema, List *supers, List **supconstr); static void StoreCatalogInheritance(Oid relationId, List *supers); /* ---------------------------------------------------------------- - * DefineRelation -- + * DefineRelation * Creates a new relation. * ---------------------------------------------------------------- */ @@ -145,7 +145,7 @@ DefineRelation(CreateStmt *stmt, char relkind) } /* - * RemoveRelation -- + * RemoveRelation * Deletes a new relation. * * Exceptions: @@ -164,7 +164,7 @@ RemoveRelation(char *name) /* - * MergeAttributes -- + * MergeAttributes * Returns new schema given initial schema and supers. * * @@ -365,7 +365,7 @@ MergeAttributes(List *schema, List *supers, List **supconstr) } /* - * StoreCatalogInheritance -- + * StoreCatalogInheritance * Updates the system catalogs with proper inheritance information. */ static void diff --git a/src/backend/commands/dbcommands.c b/src/backend/commands/dbcommands.c index f90bc66104..1b5b142606 100644 --- a/src/backend/commands/dbcommands.c +++ b/src/backend/commands/dbcommands.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dbcommands.c-- + * dbcommands.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/defind.c b/src/backend/commands/defind.c index f990129669..d173592476 100644 --- a/src/backend/commands/defind.c +++ b/src/backend/commands/defind.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * defind.c-- + * defind.c * POSTGRES define, extend and remove index code. * * Copyright (c) 1994, Regents of the University of California @@ -53,7 +53,7 @@ static void NormIndexAttrs(List *attList, AttrNumber *attNumP, static char *GetDefaultOpClass(Oid atttypid); /* - * DefineIndex -- + * DefineIndex * Creates a new index. * * 'attributeList' is a list of IndexElem specifying either a functional @@ -208,7 +208,7 @@ DefineIndex(char *heapRelationName, /* - * ExtendIndex -- + * ExtendIndex * Extends a partial index. * * Exceptions: @@ -545,7 +545,7 @@ GetDefaultOpClass(Oid atttypid) } /* - * RemoveIndex -- + * RemoveIndex * Deletes an index. * * Exceptions: diff --git a/src/backend/commands/define.c b/src/backend/commands/define.c index 6eff76ac6f..9cce3cb32a 100644 --- a/src/backend/commands/define.c +++ b/src/backend/commands/define.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * define.c-- + * define.c * * These routines execute some of the CREATE statements. In an earlier * version of Postgres, these were "define" statements. @@ -202,7 +202,7 @@ interpret_AS_clause(const char *languageName, const char *as, /* - * CreateFunction -- + * CreateFunction * Execute a CREATE FUNCTION utility statement. * */ @@ -346,7 +346,7 @@ CreateFunction(ProcedureStmt *stmt, CommandDest dest) /* -------------------------------- - * DefineOperator-- + * DefineOperator * * this function extracts all the information from the * parameter list generated by the parser and then has @@ -573,7 +573,7 @@ DefineAggregate(char *aggName, List *parameters) } /* - * DefineType -- + * DefineType * Registers a new type. * */ diff --git a/src/backend/commands/explain.c b/src/backend/commands/explain.c index 4a54e30f9e..09d40154bc 100644 --- a/src/backend/commands/explain.c +++ b/src/backend/commands/explain.c @@ -1,5 +1,5 @@ /* - * explain.c-- + * explain.c * Explain the query execution plan * * Copyright (c) 1994-5, Regents of the University of California diff --git a/src/backend/commands/proclang.c b/src/backend/commands/proclang.c index d95c4efdff..194333fbe9 100644 --- a/src/backend/commands/proclang.c +++ b/src/backend/commands/proclang.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * proclang.c-- + * proclang.c * PostgreSQL PROCEDURAL LANGUAGE support code. * *------------------------------------------------------------------------- diff --git a/src/backend/commands/recipe.c b/src/backend/commands/recipe.c index 0a627c8f19..4443afe458 100644 --- a/src/backend/commands/recipe.c +++ b/src/backend/commands/recipe.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * recipe.c-- + * recipe.c * routines for handling execution of Tioga recipes * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/remove.c b/src/backend/commands/remove.c index 4787672b26..fcb5e1259b 100644 --- a/src/backend/commands/remove.c +++ b/src/backend/commands/remove.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * remove.c-- + * remove.c * POSTGRES remove (function | type | operator ) utilty code. * * Copyright (c) 1994, Regents of the University of California @@ -36,7 +36,7 @@ #endif /* - * RemoveOperator -- + * RemoveOperator * Deletes an operator. * * Exceptions: @@ -288,7 +288,7 @@ RemoveType(char *typeName) /* type name to be removed */ } /* - * RemoveFunction -- + * RemoveFunction * Deletes a function. * * Exceptions: diff --git a/src/backend/commands/rename.c b/src/backend/commands/rename.c index 65e49b8e1b..8ed5e4f4f4 100644 --- a/src/backend/commands/rename.c +++ b/src/backend/commands/rename.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rename.c-- + * rename.c * renameatt() and renamerel() reside here. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/sequence.c b/src/backend/commands/sequence.c index e391936cbf..d76eb07481 100644 --- a/src/backend/commands/sequence.c +++ b/src/backend/commands/sequence.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sequence.c-- + * sequence.c * PostgreSQL sequences support code. * *------------------------------------------------------------------------- @@ -66,7 +66,7 @@ static void init_params(CreateSeqStmt *seq, Form_pg_sequence new); static int get_param(DefElem *def); /* - * DefineSequence -- + * DefineSequence * Creates a new sequence relation */ void @@ -464,7 +464,7 @@ init_sequence(char *caller, char *name) /* - * CloseSequences -- + * CloseSequences * is calling by xact mgr at commit/abort. */ void diff --git a/src/backend/commands/trigger.c b/src/backend/commands/trigger.c index 6f45862322..f23180bfd3 100644 --- a/src/backend/commands/trigger.c +++ b/src/backend/commands/trigger.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * trigger.c-- + * trigger.c * PostgreSQL TRIGGERs support code. * *------------------------------------------------------------------------- diff --git a/src/backend/commands/user.c b/src/backend/commands/user.c index 52d0b81de3..4b205138b2 100644 --- a/src/backend/commands/user.c +++ b/src/backend/commands/user.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * user.c-- + * user.c * use pg_exec_query to create a new user in the catalog * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/vacuum.c b/src/backend/commands/vacuum.c index f62efeaff2..c227f568ac 100644 --- a/src/backend/commands/vacuum.c +++ b/src/backend/commands/vacuum.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * vacuum.c-- + * vacuum.c * the postgres vacuum cleaner * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/commands/view.c b/src/backend/commands/view.c index fa05eacc60..0bbbed3382 100644 --- a/src/backend/commands/view.c +++ b/src/backend/commands/view.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * view.c-- + * view.c * use rewrite rules to construct views * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/execAmi.c b/src/backend/executor/execAmi.c index 5b05876d37..12398f943f 100644 --- a/src/backend/executor/execAmi.c +++ b/src/backend/executor/execAmi.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execAmi.c-- + * execAmi.c * miscellanious executor access method routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/execFlatten.c b/src/backend/executor/execFlatten.c index 61ae60de09..4bf1328f00 100644 --- a/src/backend/executor/execFlatten.c +++ b/src/backend/executor/execFlatten.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execFlatten.c-- + * execFlatten.c * This file handles the nodes associated with flattening sets in the * target list of queries containing functions returning sets. * diff --git a/src/backend/executor/execJunk.c b/src/backend/executor/execJunk.c index c500a974e4..45a1ade83b 100644 --- a/src/backend/executor/execJunk.c +++ b/src/backend/executor/execJunk.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * junk.c-- + * junk.c * Junk attribute support stuff.... * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/execMain.c b/src/backend/executor/execMain.c index 5f80452e60..62f9f7baea 100644 --- a/src/backend/executor/execMain.c +++ b/src/backend/executor/execMain.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execMain.c-- + * execMain.c * top level executor interface routines * * INTERFACE ROUTINES diff --git a/src/backend/executor/execProcnode.c b/src/backend/executor/execProcnode.c index 6763067da6..637481e049 100644 --- a/src/backend/executor/execProcnode.c +++ b/src/backend/executor/execProcnode.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execProcnode.c-- + * execProcnode.c * contains dispatch functions which call the appropriate "initialize", * "get a tuple", and "cleanup" routines for the given node type. * If the node has children, then it will presumably call ExecInitNode, diff --git a/src/backend/executor/execQual.c b/src/backend/executor/execQual.c index 2db2f8ccfc..d938ea2196 100644 --- a/src/backend/executor/execQual.c +++ b/src/backend/executor/execQual.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execQual.c-- + * execQual.c * Routines to evaluate qualification and targetlist expressions * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/execScan.c b/src/backend/executor/execScan.c index fa4b2df6f3..6bb0858b27 100644 --- a/src/backend/executor/execScan.c +++ b/src/backend/executor/execScan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execScan.c-- + * execScan.c * This code provides support for generalized relation scans. ExecScan * is passed a node and a pointer to a function to "do the right thing" * and return a tuple from the relation. ExecScan then does the tedious diff --git a/src/backend/executor/execTuples.c b/src/backend/executor/execTuples.c index cfb6c2853b..bc313019ed 100644 --- a/src/backend/executor/execTuples.c +++ b/src/backend/executor/execTuples.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execTuples.c-- + * execTuples.c * Routines dealing with the executor tuple tables. These are used to * ensure that the executor frees copies of tuples (made by * ExecTargetList) properly. diff --git a/src/backend/executor/execUtils.c b/src/backend/executor/execUtils.c index 3819546c99..b38caa113c 100644 --- a/src/backend/executor/execUtils.c +++ b/src/backend/executor/execUtils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execUtils.c-- + * execUtils.c * miscellanious executor utility routines * * Copyright (c) 1994, Regents of the University of California @@ -450,12 +450,12 @@ ExecAssignScanTypeFromOuterPlan(Plan *node, CommonScanState *csstate) * Routines dealing with the structure 'attribute' which conatains * the type information about attributes in a tuple: * - * ExecMakeTypeInfo(noType) -- + * ExecMakeTypeInfo(noType) * returns pointer to array of 'noType' structure 'attribute'. - * ExecSetTypeInfo(index, typeInfo, attNum, attLen) -- + * ExecSetTypeInfo(index, typeInfo, attNum, attLen) * sets the element indexed by 'index' in typeInfo with * the values: attNum, attLen. - * ExecFreeTypeInfo(typeInfo) -- + * ExecFreeTypeInfo(typeInfo) * frees the structure 'typeInfo'. * ---------------------------------------------------------------- */ diff --git a/src/backend/executor/functions.c b/src/backend/executor/functions.c index 2a23e6f597..b8b8a29984 100644 --- a/src/backend/executor/functions.c +++ b/src/backend/executor/functions.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * functions.c-- + * functions.c * Routines to handle functions called from the executor * Putting this stuff in fmgr makes the postmaster a mess.... * diff --git a/src/backend/executor/nodeAgg.c b/src/backend/executor/nodeAgg.c index 23fc1560d0..d379077af5 100644 --- a/src/backend/executor/nodeAgg.c +++ b/src/backend/executor/nodeAgg.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeAgg.c-- + * nodeAgg.c * Routines to handle aggregate nodes. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeAppend.c b/src/backend/executor/nodeAppend.c index 90bb85a6c8..b9666605a1 100644 --- a/src/backend/executor/nodeAppend.c +++ b/src/backend/executor/nodeAppend.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeAppend.c-- + * nodeAppend.c * routines to handle append nodes. * * Copyright (c) 1994, Regents of the University of California @@ -68,7 +68,7 @@ static bool exec_append_initialize_next(Append *node); /* ---------------------------------------------------------------- - * exec-append-initialize-next + * exec_append_initialize_next * * Sets up the append node state (i.e. the append state node) * for the "next" scan. diff --git a/src/backend/executor/nodeGroup.c b/src/backend/executor/nodeGroup.c index 0f7367ee63..e9fe24e293 100644 --- a/src/backend/executor/nodeGroup.c +++ b/src/backend/executor/nodeGroup.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeGroup.c-- + * nodeGroup.c * Routines to handle group nodes (used for queries with GROUP BY clause). * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeHash.c b/src/backend/executor/nodeHash.c index b6a88a571e..530fc13a61 100644 --- a/src/backend/executor/nodeHash.c +++ b/src/backend/executor/nodeHash.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeHash.c-- + * nodeHash.c * Routines to hash relations for hashjoin * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeHashjoin.c b/src/backend/executor/nodeHashjoin.c index 5abbe17e6c..730a650ca4 100644 --- a/src/backend/executor/nodeHashjoin.c +++ b/src/backend/executor/nodeHashjoin.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeHashjoin.c-- + * nodeHashjoin.c * Routines to handle hash join nodes * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeIndexscan.c b/src/backend/executor/nodeIndexscan.c index c41d102fc6..29a6ee2714 100644 --- a/src/backend/executor/nodeIndexscan.c +++ b/src/backend/executor/nodeIndexscan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeIndexscan.c-- + * nodeIndexscan.c * Routines to support indexes and indexed scans of relations * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeMaterial.c b/src/backend/executor/nodeMaterial.c index a86a3c7203..382af0299a 100644 --- a/src/backend/executor/nodeMaterial.c +++ b/src/backend/executor/nodeMaterial.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeMaterial.c-- + * nodeMaterial.c * Routines to handle materialization nodes. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeMergejoin.c b/src/backend/executor/nodeMergejoin.c index 2f06333107..79c87180ba 100644 --- a/src/backend/executor/nodeMergejoin.c +++ b/src/backend/executor/nodeMergejoin.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeMergejoin.c-- + * nodeMergejoin.c * routines supporting merge joins * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeNestloop.c b/src/backend/executor/nodeNestloop.c index 4c35bf580d..03a5f2dad1 100644 --- a/src/backend/executor/nodeNestloop.c +++ b/src/backend/executor/nodeNestloop.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeNestloop.c-- + * nodeNestloop.c * routines to support nest-loop joins * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeResult.c b/src/backend/executor/nodeResult.c index 1c067849c2..b61dac142d 100644 --- a/src/backend/executor/nodeResult.c +++ b/src/backend/executor/nodeResult.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeResult.c-- + * nodeResult.c * support for constant nodes needing special code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeSeqscan.c b/src/backend/executor/nodeSeqscan.c index 3672e9232b..e26dd01631 100644 --- a/src/backend/executor/nodeSeqscan.c +++ b/src/backend/executor/nodeSeqscan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeSeqscan.c-- + * nodeSeqscan.c * Support routines for sequential scans of relations. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeSort.c b/src/backend/executor/nodeSort.c index c787ff9bb6..5c430b9413 100644 --- a/src/backend/executor/nodeSort.c +++ b/src/backend/executor/nodeSort.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeSort.c-- + * nodeSort.c * Routines to handle sorting of relations. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeSubplan.c b/src/backend/executor/nodeSubplan.c index 2da904a925..9f872c6068 100644 --- a/src/backend/executor/nodeSubplan.c +++ b/src/backend/executor/nodeSubplan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeSubplan.c-- + * nodeSubplan.c * routines to support subselects * *------------------------------------------------------------------------- diff --git a/src/backend/executor/nodeTee.c b/src/backend/executor/nodeTee.c index e8e968f6a5..c6790ed183 100644 --- a/src/backend/executor/nodeTee.c +++ b/src/backend/executor/nodeTee.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeTee.c-- + * nodeTee.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/nodeUnique.c b/src/backend/executor/nodeUnique.c index 4a4bbdb2d6..55b27b6d9a 100644 --- a/src/backend/executor/nodeUnique.c +++ b/src/backend/executor/nodeUnique.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeUnique.c-- + * nodeUnique.c * Routines to handle unique'ing of queries where appropriate * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/executor/spi.c b/src/backend/executor/spi.c index b3f4942f24..2bc52ae209 100644 --- a/src/backend/executor/spi.c +++ b/src/backend/executor/spi.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * spi.c-- + * spi.c * Server Programming Interface * * $Id$ @@ -549,7 +549,7 @@ SPI_pfree(void *pointer) /* =================== private functions =================== */ /* - * spi_printtup -- + * spi_printtup * store tuple retrieved by Executor into SPITupleTable * of current SPI procedure * @@ -925,7 +925,7 @@ _SPI_procmem() } /* - * _SPI_begin_call -- + * _SPI_begin_call * */ static int diff --git a/src/backend/lib/bit.c b/src/backend/lib/bit.c index c579f2bc59..d872e70c50 100644 --- a/src/backend/lib/bit.c +++ b/src/backend/lib/bit.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bit.c-- + * bit.c * Standard bit array code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/lib/dllist.c b/src/backend/lib/dllist.c index 475cfb9261..c0f757e051 100644 --- a/src/backend/lib/dllist.c +++ b/src/backend/lib/dllist.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dllist.c-- + * dllist.c * this is a simple doubly linked list implementation * replaces the old simplelists stuff * the elements of the lists are void* diff --git a/src/backend/lib/fstack.c b/src/backend/lib/fstack.c index 3ad46815d5..f9ec39dfc6 100644 --- a/src/backend/lib/fstack.c +++ b/src/backend/lib/fstack.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fstack.c-- + * fstack.c * Fixed format stack definitions. * * Copyright (c) 1994, Regents of the University of California @@ -20,20 +20,20 @@ */ /* - * FixedItemIsValid -- + * FixedItemIsValid * True iff item is valid. */ #define FixedItemIsValid(item) PointerIsValid(item) /* - * FixedStackGetItemBase -- + * FixedStackGetItemBase * Returns base of enclosing structure. */ #define FixedStackGetItemBase(stack, item) \ ((Pointer)((char *)(item) - (stack)->offset)) /* - * FixedStackGetItem -- + * FixedStackGetItem * Returns item of given pointer to enclosing structure. */ #define FixedStackGetItem(stack, pointer) \ @@ -84,7 +84,7 @@ FixedStackPush(FixedStack stack, Pointer pointer) #ifdef USE_ASSERT_CHECKING /* - * FixedStackContains -- + * FixedStackContains * True iff ordered stack contains given element. * * Note: diff --git a/src/backend/lib/hasht.c b/src/backend/lib/hasht.c index 732fdce999..f4ad935ddc 100644 --- a/src/backend/lib/hasht.c +++ b/src/backend/lib/hasht.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hasht.c-- + * hasht.c * hash table related functions that are not directly supported * by the hashing packages under utils/hash. * diff --git a/src/backend/lib/lispsort.c b/src/backend/lib/lispsort.c index 00f33486ce..342439d201 100644 --- a/src/backend/lib/lispsort.c +++ b/src/backend/lib/lispsort.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lispsort.c-- + * lispsort.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/lib/stringinfo.c b/src/backend/lib/stringinfo.c index 9fc0ad1065..fbbb9fb041 100644 --- a/src/backend/lib/stringinfo.c +++ b/src/backend/lib/stringinfo.c @@ -1,5 +1,5 @@ /* - * stringinfo.c-- + * stringinfo.c * These are routines that can be used to write informations to a string, * without having to worry about string lengths, space allocation etc. * Ideally the interface should look like the file i/o interface, diff --git a/src/backend/libpq/auth.c b/src/backend/libpq/auth.c index 8e5ff87b74..0305bffa2e 100644 --- a/src/backend/libpq/auth.c +++ b/src/backend/libpq/auth.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * auth.c-- + * auth.c * Routines to handle network authentication * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/libpq/be-dumpdata.c b/src/backend/libpq/be-dumpdata.c index 1b6892446a..909c5ed649 100644 --- a/src/backend/libpq/be-dumpdata.c +++ b/src/backend/libpq/be-dumpdata.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * be-dumpdata.c-- + * be-dumpdata.c * support for collection of returned tuples from an internal * PQ call into a backend buffer. * diff --git a/src/backend/libpq/be-fsstubs.c b/src/backend/libpq/be-fsstubs.c index 42fe5be9be..ad46bdf818 100644 --- a/src/backend/libpq/be-fsstubs.c +++ b/src/backend/libpq/be-fsstubs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * be-fsstubs.c-- + * be-fsstubs.c * support for filesystem operations on large objects * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/libpq/be-pqexec.c b/src/backend/libpq/be-pqexec.c index a26ea18dd2..e70a838593 100644 --- a/src/backend/libpq/be-pqexec.c +++ b/src/backend/libpq/be-pqexec.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * be-pqexec.c-- + * be-pqexec.c * support for executing POSTGRES commands and functions from a * user-defined function in a backend. * diff --git a/src/backend/libpq/crypt.c b/src/backend/libpq/crypt.c index 4090341284..4fdbed9db4 100644 --- a/src/backend/libpq/crypt.c +++ b/src/backend/libpq/crypt.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * crypt.c-- + * crypt.c * Look into pg_shadow and check the encrypted password with * the one passed in from the frontend. * diff --git a/src/backend/libpq/hba.c b/src/backend/libpq/hba.c index 56e097d35b..1f4228a6a1 100644 --- a/src/backend/libpq/hba.c +++ b/src/backend/libpq/hba.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hba.c-- + * hba.c * Routines to handle host based authentication (that's the scheme * wherein you authenticate a user by seeing what IP address the system * says he comes from and possibly using ident). diff --git a/src/backend/libpq/portal.c b/src/backend/libpq/portal.c index 51a7968c9b..04236db6ec 100644 --- a/src/backend/libpq/portal.c +++ b/src/backend/libpq/portal.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * portal.c-- + * portal.c * generalized portal support routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/libpq/portalbuf.c b/src/backend/libpq/portalbuf.c index 240a3c5924..9aff988f86 100644 --- a/src/backend/libpq/portalbuf.c +++ b/src/backend/libpq/portalbuf.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * portalbuf.c-- + * portalbuf.c * portal buffer support routines for src/libpq/portal.c * * Copyright (c) 1994, Regents of the University of California @@ -63,7 +63,7 @@ size_t portals_array_size = 0; /* GlobalMemory portals_mmcxt = (GlobalMemory) NULL; */ /* ------------------------------- - * portals_realloc -- + * portals_realloc * grow the size of the portals array by size * * also ensures that elements are initially NULL diff --git a/src/backend/libpq/pqcomm.c b/src/backend/libpq/pqcomm.c index 732d3d8e20..f7b9e3e218 100644 --- a/src/backend/libpq/pqcomm.c +++ b/src/backend/libpq/pqcomm.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqcomm.c-- + * pqcomm.c * Communication functions between the Frontend and the Backend * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/libpq/pqpacket.c b/src/backend/libpq/pqpacket.c index 2d67387be7..d9ce537e5c 100644 --- a/src/backend/libpq/pqpacket.c +++ b/src/backend/libpq/pqpacket.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqpacket.c-- + * pqpacket.c * routines for reading and writing data packets sent/received by * POSTGRES clients and servers * diff --git a/src/backend/libpq/pqsignal.c b/src/backend/libpq/pqsignal.c index 520f55dee3..be570b2e0e 100644 --- a/src/backend/libpq/pqsignal.c +++ b/src/backend/libpq/pqsignal.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqsignal.c-- + * pqsignal.c * reliable BSD-style signal(2) routine stolen from RWW who stole it * from Stevens... * diff --git a/src/backend/libpq/util.c b/src/backend/libpq/util.c index cde9a74f27..c66e76bdce 100644 --- a/src/backend/libpq/util.c +++ b/src/backend/libpq/util.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * util.c-- + * util.c * general routines for libpq backend * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/main/main.c b/src/backend/main/main.c index 79dac9eed6..c6613929e2 100644 --- a/src/backend/main/main.c +++ b/src/backend/main/main.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * main.c-- + * main.c * Stub main() routine for the postgres backend. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/nodes/copyfuncs.c b/src/backend/nodes/copyfuncs.c index 0cc4d44f33..1c7e226f52 100644 --- a/src/backend/nodes/copyfuncs.c +++ b/src/backend/nodes/copyfuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * copyfuncs.c-- + * copyfuncs.c * Copy functions for Postgres tree nodes. * * Copyright (c) 1994, Regents of the University of California @@ -32,7 +32,7 @@ #include "optimizer/planmain.h" /* - * listCopy-- + * listCopy * this copy function only copies the "lcons-cells" of the list but not * its contents. (good for list of pointers as well as list of integers). */ @@ -57,7 +57,7 @@ listCopy(List *list) } /* - * Node_Copy-- + * Node_Copy * a macro to simplify calling of copyObject on the specified field */ #define Node_Copy(from, newnode, field) \ @@ -1327,7 +1327,7 @@ _copyMergeOrder(MergeOrder *from) * ---------------- */ static RestrictInfo * -_copyRestrictInfo(RestrictInfo * from) +_copyRestrictInfo(RestrictInfo *from) { RestrictInfo *newnode = makeNode(RestrictInfo); diff --git a/src/backend/nodes/equalfuncs.c b/src/backend/nodes/equalfuncs.c index ce03433112..3b8424d0f4 100644 --- a/src/backend/nodes/equalfuncs.c +++ b/src/backend/nodes/equalfuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * equalfuncs.c-- + * equalfuncs.c * equal functions to compare the nodes * * Copyright (c) 1994, Regents of the University of California @@ -281,7 +281,7 @@ _equalFunc(Func *a, Func *b) * RestrictInfo is a subclass of Node. */ static bool -_equalRestrictInfo(RestrictInfo * a, RestrictInfo * b) +_equalRestrictInfo(RestrictInfo *a, RestrictInfo *b) { Assert(IsA(a, RestrictInfo)); Assert(IsA(b, RestrictInfo)); @@ -697,7 +697,7 @@ _equalValue(Value *a, Value *b) } /* - * equal-- + * equal * returns whether two nodes are equal */ bool @@ -846,7 +846,7 @@ equal(void *a, void *b) } /* - * equali-- + * equali * compares two lists of integers * * XXX temp hack. needs something like T_IntList diff --git a/src/backend/nodes/freefuncs.c b/src/backend/nodes/freefuncs.c index d14e44df9f..d065c36221 100644 --- a/src/backend/nodes/freefuncs.c +++ b/src/backend/nodes/freefuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * freefuncs.c-- + * freefuncs.c * Free functions for Postgres tree nodes. * * Copyright (c) 1994, Regents of the University of California @@ -939,7 +939,7 @@ _freeMergeOrder(MergeOrder *node) * ---------------- */ static void -_freeRestrictInfo(RestrictInfo * node) +_freeRestrictInfo(RestrictInfo *node) { /* ---------------- * free remainder of node diff --git a/src/backend/nodes/list.c b/src/backend/nodes/list.c index c9f1e911f3..6bd9534b3e 100644 --- a/src/backend/nodes/list.c +++ b/src/backend/nodes/list.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * list.c-- + * list.c * various list handling routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/nodes/makefuncs.c b/src/backend/nodes/makefuncs.c index 32a0ebf057..bb9cf39dfb 100644 --- a/src/backend/nodes/makefuncs.c +++ b/src/backend/nodes/makefuncs.c @@ -1,5 +1,5 @@ /* - * makefuncs.c-- + * makefuncs.c * creator functions for primitive nodes. The functions here are for * the most frequently created nodes. * diff --git a/src/backend/nodes/nodeFuncs.c b/src/backend/nodes/nodeFuncs.c index 9db787fea7..dd35c15aea 100644 --- a/src/backend/nodes/nodeFuncs.c +++ b/src/backend/nodes/nodeFuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeFuncs.c-- + * nodeFuncs.c * All node routines more complicated than simple access/modification * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/nodes/nodes.c b/src/backend/nodes/nodes.c index 5465557c20..0447959514 100644 --- a/src/backend/nodes/nodes.c +++ b/src/backend/nodes/nodes.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodes.c-- + * nodes.c * support code for nodes (now that we get rid of the home-brew * inheritance system, our support code for nodes get much simpler) * diff --git a/src/backend/nodes/outfuncs.c b/src/backend/nodes/outfuncs.c index 2e17673b7f..c5991f0fba 100644 --- a/src/backend/nodes/outfuncs.c +++ b/src/backend/nodes/outfuncs.c @@ -1,6 +1,6 @@ /* * - * outfuncs.c-- + * outfuncs.c * routines to convert a node to ascii representation * * Copyright (c) 1994, Regents of the University of California @@ -1148,7 +1148,7 @@ _outMergeOrder(StringInfo str, MergeOrder *node) * RestrictInfo is a subclass of Node. */ static void -_outRestrictInfo(StringInfo str, RestrictInfo * node) +_outRestrictInfo(StringInfo str, RestrictInfo *node) { appendStringInfo(str, " RESTRICTINFO :clause "); _outNode(str, node->clause); diff --git a/src/backend/nodes/print.c b/src/backend/nodes/print.c index afeed4f987..cb6e883dc6 100644 --- a/src/backend/nodes/print.c +++ b/src/backend/nodes/print.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * print.c-- + * print.c * various print routines (used mostly for debugging) * * Copyright (c) 1994, Regents of the University of California @@ -36,7 +36,7 @@ static char *plannode_type(Plan *p); /* - * print-- + * print * print contents of Node to stdout */ void @@ -125,7 +125,7 @@ pprint(void *obj) } /* - * print_rt-- + * print_rt * print contents of range table */ void @@ -150,7 +150,7 @@ print_rt(List *rtable) /* - * print_expr-- + * print_expr * print an expression */ void @@ -233,7 +233,7 @@ print_pathkeys(List *pathkeys, List *rtable) } /* - * print_tl -- + * print_tl * print targetlist in a more legible way. */ void @@ -258,7 +258,7 @@ print_tl(List *tlist, List *rtable) } /* - * print_slot-- + * print_slot * print out the tuple with the given TupleTableSlot */ void diff --git a/src/backend/nodes/read.c b/src/backend/nodes/read.c index ef2e20f92a..1aca7f8d12 100644 --- a/src/backend/nodes/read.c +++ b/src/backend/nodes/read.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * read.c-- + * read.c * routines to convert a string (legal ascii representation of node) back * to nodes * diff --git a/src/backend/nodes/readfuncs.c b/src/backend/nodes/readfuncs.c index 43b535aa5a..ca427162be 100644 --- a/src/backend/nodes/readfuncs.c +++ b/src/backend/nodes/readfuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * readfuncs.c-- + * readfuncs.c * Reader functions for Postgres tree nodes. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/optimizer/geqo/geqo_copy.c b/src/backend/optimizer/geqo/geqo_copy.c index 9f26025063..32cde161ab 100644 --- a/src/backend/optimizer/geqo/geqo_copy.c +++ b/src/backend/optimizer/geqo/geqo_copy.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * - * geqo_copy.c-- + * geqo_copy.c * * Copyright (c) 1994, Regents of the University of California * @@ -50,7 +50,7 @@ #include "optimizer/geqo_gene.h" #include "optimizer/geqo_copy.h" -/* geqo_copy-- +/* geqo_copy * * copies one gene to another * diff --git a/src/backend/optimizer/geqo/geqo_cx.c b/src/backend/optimizer/geqo/geqo_cx.c index 2f3d81e486..c7e46e46c9 100644 --- a/src/backend/optimizer/geqo/geqo_cx.c +++ b/src/backend/optimizer/geqo/geqo_cx.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_cx.c-- +* geqo_cx.c * * cycle crossover [CX] routines; * CX operator according to Oliver et al @@ -55,7 +55,7 @@ #include "optimizer/geqo_random.h" -/* cx-- +/* cx * * cycle crossover */ diff --git a/src/backend/optimizer/geqo/geqo_erx.c b/src/backend/optimizer/geqo/geqo_erx.c index bf562e27f8..15e2458b08 100644 --- a/src/backend/optimizer/geqo/geqo_erx.c +++ b/src/backend/optimizer/geqo/geqo_erx.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_erx.c-- +* geqo_erx.c * edge recombination crossover [ER] * * $Id$ @@ -59,7 +59,7 @@ static Gene gimme_gene(Edge edge, Edge *edge_table); static Gene edge_failure(Gene *gene, int index, Edge *edge_table, int num_gene); -/* alloc_edge_table-- +/* alloc_edge_table * * allocate memory for edge table * @@ -80,7 +80,7 @@ alloc_edge_table(int num_gene) return edge_table; } -/* free_edge_table-- +/* free_edge_table * * deallocate memory of edge table * @@ -91,7 +91,7 @@ free_edge_table(Edge *edge_table) pfree(edge_table); } -/* gimme_edge_table-- +/* gimme_edge_table * * fills a data structure which represents the set of explicit * edges between points in the (2) input genes @@ -150,7 +150,7 @@ gimme_edge_table(Gene *tour1, Gene *tour2, int num_gene, Edge *edge_table) return ((float) (edge_total * 2) / (float) num_gene); } -/* gimme_edge-- +/* gimme_edge * * registers edge from city1 to city2 in input edge table * @@ -198,7 +198,7 @@ gimme_edge(Gene gene1, Gene gene2, Edge *edge_table) return 1; } -/* gimme_tour-- +/* gimme_tour * * creates a new tour using edges from the edge table. * priority is given to "shared" edges (i.e. edges which @@ -246,7 +246,7 @@ gimme_tour(Edge *edge_table, Gene *new_gene, int num_gene) } -/* remove_gene-- +/* remove_gene * * removes input gene from edge_table. * input edge is used @@ -289,7 +289,7 @@ remove_gene(Gene gene, Edge edge, Edge *edge_table) } } -/* gimme_gene-- +/* gimme_gene * * priority is given to "shared" edges * (i.e. edges which both genes possess) @@ -381,7 +381,7 @@ gimme_gene(Edge edge, Edge *edge_table) return 0; /* to keep the compiler quiet */ } -/* edge_failure-- +/* edge_failure * * routine for handling edge failure * diff --git a/src/backend/optimizer/geqo/geqo_eval.c b/src/backend/optimizer/geqo/geqo_eval.c index 353b91fb61..48222224d2 100644 --- a/src/backend/optimizer/geqo/geqo_eval.c +++ b/src/backend/optimizer/geqo/geqo_eval.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * - * geqo_eval.c-- + * geqo_eval.c * Routines to evaluate query trees * * Copyright (c) 1994, Regents of the University of California @@ -59,7 +59,7 @@ static void geqo_joinrel_size(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOpt static RelOptInfo *geqo_nth(int stop, List *rels); /* - * geqo_eval-- + * geqo_eval * * Returns cost of a query tree as an individual of the population. */ @@ -91,7 +91,7 @@ geqo_eval(Query *root, Gene *tour, int num_gene) } /* - * gimme-tree -- + * gimme_tree * this program presumes that only LEFT-SIDED TREES are considered! * * 'outer_rel' is the preceeding join @@ -179,10 +179,10 @@ gimme_tree(Query *root, Gene *tour, int rel_count, int num_gene, RelOptInfo *out } /* - * gimme-clause-joins-- + * gimme_clause_joins * - * 'outer-rel' is the relation entry for the outer relation - * 'inner-rel' is the relation entry for the inner relation + * 'outer_rel' is the relation entry for the outer relation + * 'inner_rel' is the relation entry for the inner relation * * Returns a list of new join relations. */ @@ -231,9 +231,9 @@ gimme_clause_joins(Query *root, RelOptInfo *outer_rel, RelOptInfo *inner_rel) } /* - * gimme-clauseless-join-- - * Given an outer relation 'outer-rel' and an inner relation - * 'inner-rel', create a join relation between 'outer-rel' and 'inner-rel' + * gimme_clauseless_join + * Given an outer relation 'outer_rel' and an inner relation + * 'inner_rel', create a join relation between 'outer_rel' and 'inner_rel' * * Returns a new join relation. */ @@ -245,13 +245,13 @@ gimme_clauseless_join(RelOptInfo *outer_rel, RelOptInfo *inner_rel) } /* - * init-join-rel-- + * init_join_rel * Creates and initializes a new join relation. * - * 'outer-rel' and 'inner-rel' are relation nodes for the relations to be + * 'outer_rel' and 'inner_rel' are relation nodes for the relations to be * joined * 'joininfo' is the joininfo node(join clause) containing both - * 'outer-rel' and 'inner-rel', if any exists + * 'outer_rel' and 'inner_rel', if any exists * * Returns the new join relation node. */ @@ -315,17 +315,17 @@ init_join_rel(RelOptInfo *outer_rel, RelOptInfo *inner_rel, JoinInfo * joininfo) } /* - * new-join-tlist-- + * new_join_tlist * Builds a join relations's target list by keeping those elements that * will be in the final target list and any other elements that are still * needed for future joins. For a target list entry to still be needed * for future joins, its 'joinlist' field must not be empty after removal - * of all relids in 'other-relids'. + * of all relids in 'other_relids'. * * 'tlist' is the target list of one of the join relations - * 'other-relids' is a list of relids contained within the other + * 'other_relids' is a list of relids contained within the other * join relation - * 'first-resdomno' is the resdom number to use for the first created + * 'first_resdomno' is the resdom number to use for the first created * target list entry * * Returns the new target list. @@ -362,19 +362,19 @@ new_join_tlist(List *tlist, } /* - * new-joininfo-list-- + * new_joininfo_list * Builds a join relation's joininfo list by checking for join clauses * which still need to used in future joins involving this relation. A * join clause is still needed if there are still relations in the clause * not contained in the list of relations comprising this join relation. * New joininfo nodes are only created and added to - * 'current-joininfo-list' if a node for a particular join hasn't already + * 'current_joininfo_list' if a node for a particular join hasn't already * been created. * - * 'current-joininfo-list' contains a list of those joininfo nodes that + * 'current_joininfo_list' contains a list of those joininfo nodes that * have already been built - * 'joininfo-list' is the list of join clauses involving this relation - * 'join-relids' is a list of relids corresponding to the relations + * 'joininfo_list' is the list of join clauses involving this relation + * 'join_relids' is a list of relids corresponding to the relations * currently being joined * * Returns a list of joininfo nodes, new and old. @@ -430,7 +430,7 @@ new_joininfo_list(List *joininfo_list, List *join_relids) #ifdef NOTUSED /* - * add-new-joininfos-- + * add_new_joininfos * For each new join relation, create new joininfos that * use the join relation as inner relation, and add * the new joininfos to those rel nodes that still @@ -578,11 +578,11 @@ geqo_add_new_joininfos(Query *root, List *joinrels, List *outerrels) } /* - * final-join-rels-- + * final_join_rels * Find the join relation that includes all the original * relations, i.e. the final join result. * - * 'join-rel-list' is a list of join relations. + * 'join_rel_list' is a list of join relations. * * Returns the list of final join relations. */ @@ -624,11 +624,11 @@ geqo_final_join_rels(List *join_rel_list) } /* - * add_superrels-- + * add_superrels * add rel to the temporary property list superrels. * * 'rel' a rel node - * 'super-rel' rel node of a join relation that includes rel + * 'super_rel' rel node of a join relation that includes rel * * Modifies the superrels field of rel */ @@ -639,7 +639,7 @@ add_superrels(RelOptInfo *rel, RelOptInfo *super_rel) } /* - * nonoverlap-rels-- + * nonoverlap_rels * test if two join relations overlap, i.e., includes the same * relation. * @@ -671,7 +671,7 @@ nonoverlap_sets(List *s1, List *s2) #endif /* NOTUSED */ /* - * geqo_joinrel_size-- + * geqo_joinrel_size * compute estimate for join relation tuples, even for * long join queries; so get logarithm of size when MAXINT overflow; */ diff --git a/src/backend/optimizer/geqo/geqo_main.c b/src/backend/optimizer/geqo/geqo_main.c index 3d0086e0aa..9efa8ed8e4 100644 --- a/src/backend/optimizer/geqo/geqo_main.c +++ b/src/backend/optimizer/geqo/geqo_main.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * - * geqo_main.c-- + * geqo_main.c * solution of the query optimization problem * by means of a Genetic Algorithm (GA) * @@ -58,7 +58,7 @@ /* - * geqo-- + * geqo * solution of the query optimization problem * similar to a constrained Traveling Salesman Problem (TSP) */ diff --git a/src/backend/optimizer/geqo/geqo_misc.c b/src/backend/optimizer/geqo/geqo_misc.c index 798b29b3b9..badd6bf9c7 100644 --- a/src/backend/optimizer/geqo/geqo_misc.c +++ b/src/backend/optimizer/geqo/geqo_misc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * - * geqo_misc.c-- + * geqo_misc.c * misc. printout and debug stuff * * Copyright (c) 1994, Regents of the University of California @@ -43,7 +43,7 @@ static float avg_pool(Pool *pool); -/* avg_pool-- +/* avg_pool * */ static float @@ -61,7 +61,7 @@ avg_pool(Pool *pool) return (float) cumulative / pool->size; } -/* print_pool-- +/* print_pool */ void print_pool(FILE *fp, Pool *pool, int start, int stop) @@ -91,7 +91,7 @@ print_pool(FILE *fp, Pool *pool, int start, int stop) } } -/* print_gen-- +/* print_gen * * printout for chromosome: best, worst, mean, average * diff --git a/src/backend/optimizer/geqo/geqo_mutation.c b/src/backend/optimizer/geqo/geqo_mutation.c index 9d6999c8d8..2861ef8308 100644 --- a/src/backend/optimizer/geqo/geqo_mutation.c +++ b/src/backend/optimizer/geqo/geqo_mutation.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_mutation.c-- +* geqo_mutation.c * * TSP mutation routines * diff --git a/src/backend/optimizer/geqo/geqo_ox1.c b/src/backend/optimizer/geqo/geqo_ox1.c index b1cff75122..c870559ac3 100644 --- a/src/backend/optimizer/geqo/geqo_ox1.c +++ b/src/backend/optimizer/geqo/geqo_ox1.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_ox1.c-- +* geqo_ox1.c * * order crossover [OX] routines; * OX1 operator according to Davis @@ -54,7 +54,7 @@ #include "optimizer/geqo_random.h" -/* ox1-- +/* ox1 * * position crossover */ diff --git a/src/backend/optimizer/geqo/geqo_ox2.c b/src/backend/optimizer/geqo/geqo_ox2.c index 6768f7426d..4827cbf147 100644 --- a/src/backend/optimizer/geqo/geqo_ox2.c +++ b/src/backend/optimizer/geqo/geqo_ox2.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_ox2.c-- +* geqo_ox2.c * * order crossover [OX] routines; * OX2 operator according to Syswerda @@ -54,7 +54,7 @@ #include "optimizer/geqo_random.h" -/* ox2-- +/* ox2 * * position crossover */ diff --git a/src/backend/optimizer/geqo/geqo_params.c b/src/backend/optimizer/geqo/geqo_params.c index d742e655bd..3a824d44c9 100644 --- a/src/backend/optimizer/geqo/geqo_params.c +++ b/src/backend/optimizer/geqo/geqo_params.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_params.c-- +* geqo_params.c * routines for determining necessary genetic optimization parameters * * Copyright (c) 1994, Regents of the University of California @@ -63,7 +63,7 @@ static int gimme_number_generations(int pool_size, int effort); static int next_token(FILE *, char *, int); /* - * geqo_param-- + * geqo_param * get ga parameters out of "$PGDATA/pg_geqo" file. */ void @@ -303,7 +303,7 @@ next_token(FILE *fp, char *buf, int bufsz) return c == '\n' ? '\n' : 0; } -/* gimme_pool_size-- +/* gimme_pool_size * compute good estimation for pool size * according to number of involved rels in a query */ @@ -325,7 +325,7 @@ gimme_pool_size(int string_length) return (int) ceil(size); } -/* gimme_number_generations-- +/* gimme_number_generations * compute good estimation for number of generations size * for convergence */ diff --git a/src/backend/optimizer/geqo/geqo_paths.c b/src/backend/optimizer/geqo/geqo_paths.c index 7d160230d0..109ec84eb5 100644 --- a/src/backend/optimizer/geqo/geqo_paths.c +++ b/src/backend/optimizer/geqo/geqo_paths.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_paths.c-- + * geqo_paths.c * Routines to process redundant paths and relations * * Copyright (c) 1994, Regents of the University of California @@ -31,9 +31,9 @@ static List *geqo_prune_rel(RelOptInfo *rel, List *other_rels); /* - * geqo-prune-rels-- + * geqo_prune_rels * Removes any redundant relation entries from a list of rel nodes - * 'rel-list'. + * 'rel_list'. * * Returns the resulting list. * @@ -53,8 +53,8 @@ geqo_prune_rels(List *rel_list) } /* - * geqo-prune-rel-- - * Prunes those relations from 'other-rels' that are redundant with + * geqo_prune_rel + * Prunes those relations from 'other_rels' that are redundant with * 'rel'. A relation is redundant if it is built up of the same * relations as 'rel'. Paths for the redundant relation are merged into * the pathlist of 'rel'. @@ -91,7 +91,7 @@ geqo_prune_rel(RelOptInfo *rel, List *other_rels) } /* - * geqo-set-cheapest-- + * geqo_set_cheapest * For a relation 'rel' (which corresponds to a join * relation), set pointers to the cheapest path */ diff --git a/src/backend/optimizer/geqo/geqo_pmx.c b/src/backend/optimizer/geqo/geqo_pmx.c index cef42a0213..7f78d69b67 100644 --- a/src/backend/optimizer/geqo/geqo_pmx.c +++ b/src/backend/optimizer/geqo/geqo_pmx.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_pmx.c-- +* geqo_pmx.c * * partially matched crossover [PMX] routines; * PMX operator according to Goldberg & Lingle @@ -54,7 +54,7 @@ #include "optimizer/geqo_random.h" -/* pmx-- +/* pmx * * partially matched crossover */ diff --git a/src/backend/optimizer/geqo/geqo_pool.c b/src/backend/optimizer/geqo/geqo_pool.c index d26e61dc40..8017543a06 100644 --- a/src/backend/optimizer/geqo/geqo_pool.c +++ b/src/backend/optimizer/geqo/geqo_pool.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * - * geqo_pool.c-- + * geqo_pool.c * Genetic Algorithm (GA) pool stuff * * Copyright (c) 1994, Regents of the University of California @@ -45,7 +45,7 @@ static int compare(const void *arg1, const void *arg2); /* - * alloc-pool-- + * alloc_pool * allocates memory for GA pool */ Pool * @@ -72,7 +72,7 @@ alloc_pool(int pool_size, int string_length) } /* - * free-pool-- + * free_pool * deallocates memory for GA pool */ void @@ -94,7 +94,7 @@ free_pool(Pool *pool) } /* - * random-init-pool-- + * random_init_pool * initialize genetic pool */ void @@ -114,7 +114,7 @@ random_init_pool(Query *root, Pool *pool, int strt, int stp) } /* - * sort-pool-- + * sort_pool * sorts input pool according to worth, from smallest to largest * * maybe you have to change compare() for different ordering ... @@ -126,7 +126,7 @@ sort_pool(Pool *pool) } /* - * compare-- + * compare * static input function for pg_sort * * return values for sort from smallest to largest are prooved! @@ -146,7 +146,7 @@ compare(const void *arg1, const void *arg2) return -1; } -/* alloc_chromo-- +/* alloc_chromo * allocates a chromosome and string space */ Chromosome * @@ -160,7 +160,7 @@ alloc_chromo(int string_length) return chromo; } -/* free_chromo-- +/* free_chromo * deallocates a chromosome and string space */ void @@ -170,7 +170,7 @@ free_chromo(Chromosome *chromo) pfree(chromo); } -/* spread_chromo-- +/* spread_chromo * inserts a new chromosome into the pool, displacing worst gene in pool * assumes best->worst = smallest->largest */ diff --git a/src/backend/optimizer/geqo/geqo_px.c b/src/backend/optimizer/geqo/geqo_px.c index fd9fbff828..7e00cac5ef 100644 --- a/src/backend/optimizer/geqo/geqo_px.c +++ b/src/backend/optimizer/geqo/geqo_px.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_px.c-- +* geqo_px.c * * position crossover [PX] routines; * PX operator according to Syswerda @@ -54,7 +54,7 @@ #include "optimizer/geqo_random.h" -/* px-- +/* px * * position crossover */ diff --git a/src/backend/optimizer/geqo/geqo_recombination.c b/src/backend/optimizer/geqo/geqo_recombination.c index 1c992803be..6ff7efdea9 100644 --- a/src/backend/optimizer/geqo/geqo_recombination.c +++ b/src/backend/optimizer/geqo/geqo_recombination.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* geqo_recombination.c-- +* geqo_recombination.c * misc recombination procedures * * $Id$ @@ -40,7 +40,7 @@ /* - * init_tour-- + * init_tour * * Randomly generates a legal "traveling salesman" tour * (i.e. where each point is visited only once.) @@ -79,7 +79,7 @@ init_tour(Gene *tour, int num_gene) pfree(tmp); } -/* alloc_city_table-- +/* alloc_city_table * * allocate memory for city table * @@ -99,7 +99,7 @@ alloc_city_table(int num_gene) return city_table; } -/* free_city_table-- +/* free_city_table * * deallocate memory of city table * diff --git a/src/backend/optimizer/geqo/geqo_selection.c b/src/backend/optimizer/geqo/geqo_selection.c index 55992549cb..33e73f6346 100644 --- a/src/backend/optimizer/geqo/geqo_selection.c +++ b/src/backend/optimizer/geqo/geqo_selection.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_selection.c-- + * geqo_selection.c * linear selection scheme for the genetic query optimizer * * Copyright (c) 1994, Regents of the University of California @@ -57,7 +57,7 @@ static int linear(int max, double bias); -/* geqo_selection-- +/* geqo_selection * * according to bias described by input parameters, * second genes are selected from the pool @@ -81,7 +81,7 @@ geqo_selection(Chromosome *momma, Chromosome *daddy, Pool *pool, double bias) geqo_copy(daddy, &pool->data[second], pool->string_length); } -/* linear-- +/* linear * generates random integer between 0 and input max number * using input linear bias * diff --git a/src/backend/optimizer/geqo/minspantree.c b/src/backend/optimizer/geqo/minspantree.c index 5c3576ba1c..d9ee985c38 100644 --- a/src/backend/optimizer/geqo/minspantree.c +++ b/src/backend/optimizer/geqo/minspantree.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------ * -* minspantree.c-- +* minspantree.c * routine to sort a join graph which is including cycles * * Copyright (c) 1994, Regents of the University of California @@ -32,7 +32,7 @@ #include "optimizer/geqo/geqo.h" /* - * minspantree-- + * minspantree * The function minspantree computes the minimum spanning tree * for a given number of nodes and a given distance function. * For each pair of nodes found to be connected, a given diff --git a/src/backend/optimizer/path/allpaths.c b/src/backend/optimizer/path/allpaths.c index 0bcead3ba3..b5ba0a20f0 100644 --- a/src/backend/optimizer/path/allpaths.c +++ b/src/backend/optimizer/path/allpaths.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * allpaths.c-- + * allpaths.c * Routines to find possible search paths for processing a query * * Copyright (c) 1994, Regents of the University of California @@ -52,7 +52,7 @@ static void debug_print_rel(Query *root, RelOptInfo *rel); #endif /* - * find-paths-- + * find_paths * Finds all possible access paths for executing a query, returning the * top level list of relation entries. * @@ -96,7 +96,7 @@ find_paths(Query *root, List *rels) } /* - * find-rel-paths-- + * find_rel_paths * Finds all paths available for scanning each relation entry in * 'rels'. Sequential scan and any available indices are considered * if possible(indices are not considered for lower nesting levels). @@ -108,7 +108,6 @@ static void find_rel_paths(Query *root, List *rels) { List *temp; - List *lastpath; foreach(temp, rels) { @@ -132,13 +131,6 @@ find_rel_paths(Query *root, List *rels) append(rel_index_scan_list, or_index_scan_list)); - /* - * The unordered path is always the last in the list. If it is not - * the cheapest path, prune it. - */ - lastpath = rel->pathlist; - while (lnext(lastpath) != NIL) - lastpath = lnext(lastpath); set_cheapest(rel, rel->pathlist); /* @@ -153,7 +145,7 @@ find_rel_paths(Query *root, List *rels) } /* - * find-join-paths-- + * find_join_paths * Find all possible joinpaths for a query by successively finding ways * to join single relations into join relations. * @@ -161,10 +153,10 @@ find_rel_paths(Query *root, List *rels) * Find all possible joinpaths(bushy trees) for a query by systematically * finding ways to join relations(both original and derived) together. * - * 'outer-rels' is the current list of relations for which join paths + * 'outer_rels' is the current list of relations for which join paths * are to be found, i.e., he current list of relations that * have already been derived. - * 'levels-needed' is the number of iterations needed + * 'levels_needed' is the number of iterations needed * * Returns the final level of join relations, i.e., the relation that is * the result of joining all the original relations together. @@ -204,7 +196,7 @@ find_join_paths(Query *root, List *outer_rels, int levels_needed) /* * Determine all possible pairs of relations to be joined at this * level. Determine paths for joining these relation pairs and - * modify 'new-rels' accordingly, then eliminate redundant join + * modify 'new_rels' accordingly, then eliminate redundant join * relations. */ new_rels = find_join_rels(root, outer_rels); diff --git a/src/backend/optimizer/path/clausesel.c b/src/backend/optimizer/path/clausesel.c index 4b5d4e9043..b2f66b2e19 100644 --- a/src/backend/optimizer/path/clausesel.c +++ b/src/backend/optimizer/path/clausesel.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * clausesel.c-- + * clausesel.c * Routines to compute and set clause selectivities * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/optimizer/path/costsize.c b/src/backend/optimizer/path/costsize.c index f3920aed6c..184cfe0472 100644 --- a/src/backend/optimizer/path/costsize.c +++ b/src/backend/optimizer/path/costsize.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * costsize.c-- + * costsize.c * Routines to compute (and set) relation sizes and path costs * * Copyright (c) 1994, Regents of the University of California @@ -54,7 +54,7 @@ Cost _cpu_page_wight_ = _CPU_PAGE_WEIGHT_; Cost _cpu_index_page_wight_ = _CPU_INDEX_PAGE_WEIGHT_; /* - * cost_seqscan-- + * cost_seqscan * Determines and returns the cost of scanning a relation sequentially. * If the relation is a temporary to be materialized from a query * embedded within a data field (determined by 'relid' containing an @@ -100,7 +100,7 @@ cost_seqscan(int relid, int relpages, int reltuples) /* - * cost_index-- + * cost_index * Determines and returns the cost of scanning a relation using an index. * * disk = expected-index-pages + expected-data-pages @@ -156,7 +156,7 @@ cost_index(Oid indexid, } /* - * cost_sort-- + * cost_sort * Determines and returns the cost of sorting a relation by considering * 1. the cost of doing an external sort: XXX this is probably too low * disk = (p lg p) @@ -206,7 +206,7 @@ cost_sort(List *pathkeys, int tuples, int width, bool noread) /* - * cost_result-- + * cost_result * Determines and returns the cost of writing a relation of 'tuples' * tuples of 'width' bytes out to a result relation. * @@ -228,7 +228,7 @@ cost_result(int tuples, int width) #endif /* - * cost_nestloop-- + * cost_nestloop * Determines and returns the cost of joining two relations using the * nested loop algorithm. * @@ -259,7 +259,7 @@ cost_nestloop(Cost outercost, } /* - * cost_mergejoin-- + * cost_mergejoin * 'outercost' and 'innercost' are the (disk+cpu) costs of scanning the * outer and inner relations * 'outersortkeys' and 'innersortkeys' are lists of the keys to be used @@ -350,8 +350,8 @@ cost_hashjoin(Cost outercost, } /* - * compute-rel-size-- - * Computes the size of each relation in 'rel-list' (after applying + * compute_rel_size + * Computes the size of each relation in 'rel_list' (after applying * restrictions), by multiplying the selectivity of each restriction * by the original size of the relation. * @@ -377,7 +377,7 @@ compute_rel_size(RelOptInfo *rel) } /* - * compute-rel-width-- + * compute_rel_width * Computes the width in bytes of a tuple from 'rel'. * * Returns the width of the tuple as a fixnum. @@ -389,7 +389,7 @@ compute_rel_width(RelOptInfo *rel) } /* - * compute-targetlist-width-- + * compute_targetlist_width * Computes the width in bytes of a tuple made from 'targetlist'. * * Returns the width of the tuple as a fixnum. @@ -409,7 +409,7 @@ compute_targetlist_width(List *targetlist) } /* - * compute-attribute-width-- + * compute_attribute_width * Given a target list entry, find the size in bytes of the attribute. * * If a field is variable-length, it is assumed to be at least the size @@ -429,7 +429,7 @@ compute_attribute_width(TargetEntry *tlistentry) } /* - * compute-joinrel-size-- + * compute_joinrel_size * Computes the size of the join relation 'joinrel'. * * Returns a fixnum. @@ -461,7 +461,7 @@ compute_joinrel_size(JoinPath *joinpath) } /* - * page-size-- + * page_size * Returns an estimate of the number of pages covered by a given * number of tuples of a given width (size in bytes). */ diff --git a/src/backend/optimizer/path/hashutils.c b/src/backend/optimizer/path/hashutils.c index 2c7d12a2be..807103bc08 100644 --- a/src/backend/optimizer/path/hashutils.c +++ b/src/backend/optimizer/path/hashutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashutils.c-- + * hashutils.c * Utilities for finding applicable merge clauses and pathkeys * * Copyright (c) 1994, Regents of the University of California @@ -23,13 +23,13 @@ static HashInfo *match_hashop_hashinfo(Oid hashop, List *hashinfo_list); /* - * group-clauses-by-hashop-- - * If a join clause node in 'restrictinfo-list' is hashjoinable, store + * group_clauses_by_hashop + * If a join clause node in 'restrictinfo_list' is hashjoinable, store * it within a hashinfo node containing other clause nodes with the same * hash operator. * - * 'restrictinfo-list' is the list of restrictinfo nodes - * 'inner-relid' is the relid of the inner join relation + * 'restrictinfo_list' is the list of restrictinfo nodes + * 'inner_relid' is the relid of the inner join relation * * Returns the new list of hashinfo nodes. * @@ -49,7 +49,7 @@ group_clauses_by_hashop(List *restrictinfo_list, hashjoinop = restrictinfo->hashjoinoperator; /* - * Create a new hashinfo node and add it to 'hashinfo-list' if one + * Create a new hashinfo node and add it to 'hashinfo_list' if one * does not yet exist for this hash operator. */ if (hashjoinop) @@ -98,8 +98,8 @@ group_clauses_by_hashop(List *restrictinfo_list, /* - * match-hashop-hashinfo-- - * Searches the list 'hashinfo-list' for a hashinfo node whose hash op + * match_hashop_hashinfo + * Searches the list 'hashinfo_list' for a hashinfo node whose hash op * field equals 'hashop'. * * Returns the node if it exists. diff --git a/src/backend/optimizer/path/indxpath.c b/src/backend/optimizer/path/indxpath.c index 2ebdf2d043..510190b7ae 100644 --- a/src/backend/optimizer/path/indxpath.c +++ b/src/backend/optimizer/path/indxpath.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indxpath.c-- + * indxpath.c * Routines to determine which indices are usable for scanning a * given relation * @@ -56,7 +56,7 @@ static List *group_clauses_by_indexkey(RelOptInfo *rel, RelOptInfo *index, static List *group_clauses_by_ikey_for_joins(RelOptInfo *rel, RelOptInfo *index, int *indexkeys, Oid *classes, List *join_cinfo_list, List *restr_cinfo_list); static RestrictInfo *match_clause_to_indexkey(RelOptInfo *rel, RelOptInfo *index, int indexkey, - int xclass, RestrictInfo * restrictInfo, bool join); + int xclass, RestrictInfo *restrictInfo, bool join); static bool pred_test(List *predicate_list, List *restrictinfo_list, List *joininfo_list); static bool one_pred_test(Expr *predicate, List *restrictinfo_list); @@ -90,8 +90,8 @@ static bool function_index_operand(Expr *funcOpnd, RelOptInfo *rel, RelOptInfo * * * 'rel' is the relation entry to which these index paths correspond * 'indices' is a list of possible index paths - * 'restrictinfo-list' is a list of restriction restrictinfo nodes for 'rel' - * 'joininfo-list' is a list of joininfo nodes for 'rel' + * 'restrictinfo_list' is a list of restriction restrictinfo nodes for 'rel' + * 'joininfo_list' is a list of joininfo nodes for 'rel' * 'sortkeys' is a node describing the result sort order (from * (find_sortkeys)) * @@ -200,7 +200,7 @@ find_index_paths(Query *root, /* - * match-index-orclauses-- + * match_index_orclauses * Attempt to match an index against subclauses within 'or' clauses. * If the index does match, then the clause is marked with information * about the index. @@ -212,7 +212,7 @@ find_index_paths(Query *root, * 'index' is the index node. * 'indexkey' is the (single) key of the index * 'class' is the class of the operator corresponding to 'indexkey'. - * 'restrictinfo-list' is the list of available restriction clauses. + * 'restrictinfo_list' is the list of available restriction clauses. * * Returns nothing. * @@ -276,7 +276,7 @@ match_index_to_operand(int indexkey, } /* - * match-index-orclause-- + * match_index_orclause * Attempts to match an index against the subclauses of an 'or' clause. * * A match means that: @@ -285,8 +285,8 @@ match_index_to_operand(int indexkey, * (2) there is a usable key that matches the variable within a * searchable clause. * - * 'or-clauses' are the remaining subclauses within the 'or' clause - * 'other-matching-indices' is the list of information on other indices + * 'or_clauses' are the remaining subclauses within the 'or' clause + * 'other_matching_indices' is the list of information on other indices * that have already been matched to subclauses within this * particular 'or' clause (i.e., a list previously generated by * this routine) @@ -364,7 +364,7 @@ match_index_orclause(RelOptInfo *rel, (index->indproc != InvalidOid)) /* - * group-clauses-by-indexkey-- + * group_clauses_by_indexkey * Determines whether there are clauses which will match each and every * one of the remaining keys of an index. * @@ -442,8 +442,8 @@ group_clauses_by_indexkey(RelOptInfo *rel, } /* - * group-clauses-by-ikey-for-joins-- - * special edition of group-clauses-by-indexkey - will + * group_clauses_by_ikey_for_joins + * special edition of group_clauses_by_indexkey - will * match join & restriction clauses. See comment in indexable_joinclauses. * - vadim 03/18/97 * @@ -771,7 +771,7 @@ match_clause_to_indexkey(RelOptInfo *rel, ****************************************************************************/ /* - * pred_test-- + * pred_test * Does the "predicate inclusion test" for partial indexes. * * Recursively checks whether the clauses in restrictinfo_list imply @@ -831,7 +831,7 @@ pred_test(List *predicate_list, List *restrictinfo_list, List *joininfo_list) /* - * one_pred_test-- + * one_pred_test * Does the "predicate inclusion test" for one conjunct of a predicate * expression. */ @@ -854,7 +854,7 @@ one_pred_test(Expr *predicate, List *restrictinfo_list) /* - * one_pred_clause_expr_test-- + * one_pred_clause_expr_test * Does the "predicate inclusion test" for a general restriction-clause * expression. */ @@ -901,7 +901,7 @@ one_pred_clause_expr_test(Expr *predicate, Node *clause) /* - * one_pred_clause_test-- + * one_pred_clause_test * Does the "predicate inclusion test" for one conjunct of a predicate * expression for a simple restriction clause. */ @@ -978,7 +978,7 @@ StrategyNumber BT_implic_table[BTMaxStrategyNumber][BTMaxStrategyNumber] = { /* - * clause_pred_clause_test-- + * clause_pred_clause_test * Use operator class info to check whether clause implies predicate. * * Does the "predicate inclusion test" for a "simple clause" predicate @@ -1168,8 +1168,8 @@ clause_pred_clause_test(Expr *predicate, Node *clause) ****************************************************************************/ /* - * indexable-joinclauses-- - * Finds all groups of join clauses from among 'joininfo-list' that can + * indexable_joinclauses + * Finds all groups of join clauses from among 'joininfo_list' that can * be used in conjunction with 'index'. * * The first clause in the group is marked as having the other relation @@ -1244,7 +1244,7 @@ extract_restrict_clauses(List *clausegroup) #endif /* - * index-innerjoin-- + * index_innerjoin * Creates index path nodes corresponding to paths to be used as inner * relations in nestloop joins. * @@ -1330,7 +1330,7 @@ index_innerjoin(Query *root, RelOptInfo *rel, List *clausegroup_list, } /* - * create-index-paths-- + * create_index_paths * Creates a list of index path nodes for each group of clauses * (restriction or join) that can be used in conjunction with an index. * diff --git a/src/backend/optimizer/path/joinpath.c b/src/backend/optimizer/path/joinpath.c index e04ead9a44..24a405d9ce 100644 --- a/src/backend/optimizer/path/joinpath.c +++ b/src/backend/optimizer/path/joinpath.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * joinpath.c-- + * joinpath.c * Routines to find all possible paths for processing a set of joins * * Copyright (c) 1994, Regents of the University of California @@ -42,7 +42,7 @@ static List *hash_inner_and_outer(RelOptInfo *joinrel, RelOptInfo *outerrel, Rel List *hashinfo_list); /* - * find-all-join-paths-- + * find_all_join_paths * Creates all possible ways to process joins for each of the join * relations in the list 'joinrels.' Each unique path will be included * in the join relation's 'pathlist' field. @@ -131,7 +131,7 @@ find_all_join_paths(Query *root, List *joinrels) * 3. Consider paths where the inner relation need not be * explicitly sorted. This may include nestloops and mergejoins * the actual nestloop nodes were constructed in - * (match-unsorted-outer). + * (match_unsorted_outer). */ pathlist = add_pathlist(joinrel, pathlist, match_unsorted_inner(joinrel, outerrel, @@ -152,8 +152,8 @@ find_all_join_paths(Query *root, List *joinrels) /* * 'OuterJoinCost is only valid when calling - * (match-unsorted-inner) with the same arguments as the previous - * invokation of (match-unsorted-outer), so clear the field before + * (match_unsorted_inner) with the same arguments as the previous + * invokation of (match_unsorted_outer), so clear the field before * going on. */ temp_list = innerrel->pathlist; @@ -180,13 +180,13 @@ find_all_join_paths(Query *root, List *joinrels) } /* - * best-innerjoin-- + * best_innerjoin * Find the cheapest index path that has already been identified by * (indexable_joinclauses) as being a possible inner path for the given * outer relation in a nestloop join. * - * 'join-paths' is a list of join nodes - * 'outer-relid' is the relid of the outer join relation + * 'join_paths' is a list of join nodes + * 'outer_relid' is the relid of the outer join relation * * Returns the pathnode of the selected path. */ @@ -212,14 +212,14 @@ best_innerjoin(List *join_paths, List *outer_relids) } /* - * sort-inner-and-outer-- + * sort_inner_and_outer * Create mergejoin join paths by explicitly sorting both the outer and * inner join relations on each available merge ordering. * * 'joinrel' is the join relation * 'outerrel' is the outer join relation * 'innerrel' is the inner join relation - * 'mergeinfo-list' is a list of nodes containing info on(mergejoinable) + * 'mergeinfo_list' is a list of nodes containing info on(mergejoinable) * clauses for joining the relations * * Returns a list of mergejoin paths. @@ -272,7 +272,7 @@ sort_inner_and_outer(RelOptInfo *joinrel, } /* - * match-unsorted-outer-- + * match_unsorted_outer * Creates possible join paths for processing a single join relation * 'joinrel' by employing either iterative substitution or * mergejoining on each of its possible outer paths(assuming that the @@ -290,10 +290,10 @@ sort_inner_and_outer(RelOptInfo *joinrel, * 'joinrel' is the join relation * 'outerrel' is the outer join relation * 'innerrel' is the inner join relation - * 'outerpath-list' is the list of possible outer paths - * 'cheapest-inner' is the cheapest inner path - * 'best-innerjoin' is the best inner index path(if any) - * 'mergeinfo-list' is a list of nodes containing info on mergejoinable + * 'outerpath_list' is the list of possible outer paths + * 'cheapest_inner' is the cheapest inner path + * 'best_innerjoin' is the best inner index path(if any) + * 'mergeinfo_list' is a list of nodes containing info on mergejoinable * clauses * * Returns a list of possible join path nodes. @@ -391,7 +391,7 @@ match_unsorted_outer(RelOptInfo *joinrel, /* * Keep track of the cost of the outer path used with this * ordered inner path for later processing in - * (match-unsorted-inner), since it isn't a sort and thus + * (match_unsorted_inner), since it isn't a sort and thus * wouldn't otherwise be considered. */ if (path_is_cheaper_than_sort) @@ -421,23 +421,23 @@ match_unsorted_outer(RelOptInfo *joinrel, } /* - * match-unsorted-inner -- + * match_unsorted_inner * Find the cheapest ordered join path for a given(ordered, unsorted) * inner join path. * * Scans through each path available on an inner join relation and tries * matching its ordering keys against those of mergejoin clauses. - * If 1. an appropriately-ordered inner path and matching mergeclause are + * If 1. an appropriately_ordered inner path and matching mergeclause are * found, and * 2. sorting the cheapest outer path is cheaper than using an ordered * but unsorted outer path(as was considered in - * (match-unsorted-outer)), then this merge path is considered. + * (match_unsorted_outer)), then this merge path is considered. * * 'joinrel' is the join result relation * 'outerrel' is the outer join relation * 'innerrel' is the inner join relation - * 'innerpath-list' is the list of possible inner join paths - * 'mergeinfo-list' is a list of nodes containing info on mergejoinable + * 'innerpath_list' is the list of possible inner join paths + * 'mergeinfo_list' is a list of nodes containing info on mergejoinable * clauses * * Returns a list of possible merge paths. @@ -490,7 +490,7 @@ match_unsorted_inner(RelOptInfo *joinrel, } /* - * (match-unsorted-outer) if it is applicable. 'OuterJoinCost was + * (match_unsorted_outer) if it is applicable. 'OuterJoinCost was * set above in */ if (clauses && matchedJoinKeys) @@ -555,14 +555,14 @@ EnoughMemoryForHashjoin(RelOptInfo *hashrel) } /* - * hash-inner-and-outer-- XXX HASH + * hash_inner_and_outer-- XXX HASH * Create hashjoin join paths by explicitly hashing both the outer and * inner join relations on each available hash op. * * 'joinrel' is the join relation * 'outerrel' is the outer join relation * 'innerrel' is the inner join relation - * 'hashinfo-list' is a list of nodes containing info on(hashjoinable) + * 'hashinfo_list' is a list of nodes containing info on(hashjoinable) * clauses for joining the relations * * Returns a list of hashjoin paths. diff --git a/src/backend/optimizer/path/joinrels.c b/src/backend/optimizer/path/joinrels.c index f57efe0abf..c1b4b8fe89 100644 --- a/src/backend/optimizer/path/joinrels.c +++ b/src/backend/optimizer/path/joinrels.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * joinrels.c-- + * joinrels.c * Routines to determine which relations should be joined * * Copyright (c) 1994, Regents of the University of California @@ -44,15 +44,15 @@ static void set_joinrel_size(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptI JoinInfo * jinfo); /* - * find-join-rels-- + * find_join_rels * Find all possible joins for each of the outer join relations in - * 'outer-rels'. A rel node is created for each possible join relation, + * 'outer_rels'. A rel node is created for each possible join relation, * and the resulting list of nodes is returned. If at all possible, only * those relations for which join clauses exist are considered. If none * of these exist for a given relation, all remaining possibilities are * considered. * - * 'outer-rels' is the list of rel nodes + * 'outer_rels' is the list of rel nodes * * Returns a list of rel nodes corresponding to the new join relations. */ @@ -82,16 +82,16 @@ find_join_rels(Query *root, List *outer_rels) } /* - * find-clause-joins-- + * find_clause_joins * Determines whether joins can be performed between an outer relation - * 'outer-rel' and those relations within 'outer-rel's joininfo nodes - * (i.e., relations that participate in join clauses that 'outer-rel' + * 'outer_rel' and those relations within 'outer_rel's joininfo nodes + * (i.e., relations that participate in join clauses that 'outer_rel' * participates in). This is possible if all but one of the relations * contained within the join clauses of the joininfo node are already - * contained within 'outer-rel'. + * contained within 'outer_rel'. * - * 'outer-rel' is the relation entry for the outer relation - * 'joininfo-list' is a list of join clauses which 'outer-rel' + * 'outer_rel' is the relation entry for the outer relation + * 'joininfo_list' is a list of join clauses which 'outer_rel' * participates in * * Returns a list of new join relations. @@ -148,10 +148,10 @@ find_clause_joins(Query *root, RelOptInfo *outer_rel, List *joininfo_list) } /* - * find-clauseless-joins-- - * Given an outer relation 'outer-rel' and a list of inner relations - * 'inner-rels', create a join relation between 'outer-rel' and each - * member of 'inner-rels' that isn't already included in 'outer-rel'. + * find_clauseless_joins + * Given an outer relation 'outer_rel' and a list of inner relations + * 'inner_rels', create a join relation between 'outer_rel' and each + * member of 'inner_rels' that isn't already included in 'outer_rel'. * * Returns a list of new join relations. */ @@ -180,13 +180,13 @@ find_clauseless_joins(RelOptInfo *outer_rel, List *inner_rels) } /* - * init-join-rel-- + * init_join_rel * Creates and initializes a new join relation. * - * 'outer-rel' and 'inner-rel' are relation nodes for the relations to be + * 'outer_rel' and 'inner_rel' are relation nodes for the relations to be * joined * 'joininfo' is the joininfo node(join clause) containing both - * 'outer-rel' and 'inner-rel', if any exists + * 'outer_rel' and 'inner_rel', if any exists * * Returns the new join relation node. */ @@ -251,17 +251,17 @@ init_join_rel(RelOptInfo *outer_rel, RelOptInfo *inner_rel, JoinInfo * joininfo) } /* - * new-join-tlist-- + * new_join_tlist * Builds a join relations's target list by keeping those elements that * will be in the final target list and any other elements that are still * needed for future joins. For a target list entry to still be needed * for future joins, its 'joinlist' field must not be empty after removal - * of all relids in 'other-relids'. + * of all relids in 'other_relids'. * * 'tlist' is the target list of one of the join relations - * 'other-relids' is a list of relids contained within the other + * 'other_relids' is a list of relids contained within the other * join relation - * 'first-resdomno' is the resdom number to use for the first created + * 'first_resdomno' is the resdom number to use for the first created * target list entry * * Returns the new target list. @@ -298,19 +298,19 @@ new_join_tlist(List *tlist, } /* - * new-joininfo-list-- + * new_joininfo_list * Builds a join relation's joininfo list by checking for join clauses * which still need to used in future joins involving this relation. A * join clause is still needed if there are still relations in the clause * not contained in the list of relations comprising this join relation. * New joininfo nodes are only created and added to - * 'current-joininfo-list' if a node for a particular join hasn't already + * 'current_joininfo_list' if a node for a particular join hasn't already * been created. * - * 'current-joininfo-list' contains a list of those joininfo nodes that + * 'current_joininfo_list' contains a list of those joininfo nodes that * have already been built - * 'joininfo-list' is the list of join clauses involving this relation - * 'join-relids' is a list of relids corresponding to the relations + * 'joininfo_list' is the list of join clauses involving this relation + * 'join_relids' is a list of relids corresponding to the relations * currently being joined * * Returns a list of joininfo nodes, new and old. @@ -364,7 +364,7 @@ new_joininfo_list(List *joininfo_list, List *join_relids) } /* - * add-new-joininfos-- + * add_new_joininfos * For each new join relation, create new joininfos that * use the join relation as inner relation, and add * the new joininfos to those rel nodes that still @@ -462,11 +462,11 @@ add_new_joininfos(Query *root, List *joinrels, List *outerrels) } /* - * final-join-rels-- + * final_join_rels * Find the join relation that includes all the original * relations, i.e. the final join result. * - * 'join-rel-list' is a list of join relations. + * 'join_rel_list' is a list of join relations. * * Returns the list of final join relations. */ @@ -508,11 +508,11 @@ final_join_rels(List *join_rel_list) } /* - * add_superrels-- + * add_superrels * add rel to the temporary property list superrels. * * 'rel' a rel node - * 'super-rel' rel node of a join relation that includes rel + * 'super_rel' rel node of a join relation that includes rel * * Modifies the superrels field of rel */ @@ -523,7 +523,7 @@ add_superrels(RelOptInfo *rel, RelOptInfo *super_rel) } /* - * nonoverlap-rels-- + * nonoverlap_rels * test if two join relations overlap, i.e., includes the same * relation. * diff --git a/src/backend/optimizer/path/joinutils.c b/src/backend/optimizer/path/joinutils.c index 309e38d351..59808c722b 100644 --- a/src/backend/optimizer/path/joinutils.c +++ b/src/backend/optimizer/path/joinutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * joinutils.c-- + * joinutils.c * Utilities for matching and building join and path keys * * Copyright (c) 1994, Regents of the University of California @@ -40,7 +40,7 @@ static List *new_matching_subkeys(Var *subkey, List *considered_subkeys, ****************************************************************************/ /* - * match-pathkeys-joinkeys-- + * match_pathkeys_joinkeys * Attempts to match the keys of a path against the keys of join clauses. * This is done by looking for a matching join key in 'joinkeys' for * every path key in the list 'path.keys'. If there is a matching join key @@ -54,7 +54,7 @@ static List *new_matching_subkeys(Var *subkey, List *considered_subkeys, * ( (outer inner) (outer inner) ... ) * 'joinclauses' is a list of clauses corresponding to the join keys in * 'joinkeys' - * 'which-subkey' is a flag that selects the desired subkey of a join key + * 'which_subkey' is a flag that selects the desired subkey of a join key * in 'joinkeys' * * Returns the join keys and corresponding join clauses in a list if all @@ -112,7 +112,7 @@ match_pathkeys_joinkeys(List *pathkeys, } /* - * match-pathkey-joinkeys-- + * match_pathkey_joinkeys * Returns the 0-based index into 'joinkeys' of the first joinkey whose * outer or inner subkey matches any subkey of 'pathkey'. */ @@ -144,7 +144,7 @@ match_pathkey_joinkeys(List *pathkey, } /* - * match-paths-joinkeys-- + * match_paths_joinkeys * Attempts to find a path in 'paths' whose keys match a set of join * keys 'joinkeys'. To match, * 1. the path node ordering must equal 'ordering'. @@ -159,7 +159,7 @@ match_pathkey_joinkeys(List *pathkey, * must correspond * 'paths' is a list of(inner) paths which are to be matched against * each join key in 'joinkeys' - * 'which-subkey' is a flag that selects the desired subkey of a join key + * 'which_subkey' is a flag that selects the desired subkey of a join key * in 'joinkeys' * * Returns the matching path node if one exists, nil otherwise. @@ -238,14 +238,14 @@ match_paths_joinkeys(List *joinkeys, /* - * extract-path-keys-- + * extract_path_keys * Builds a subkey list for a path by pulling one of the subkeys from * a list of join keys 'joinkeys' and then finding the var node in the * target list 'tlist' that corresponds to that subkey. * * 'joinkeys' is a list of join key pairs * 'tlist' is a relation target list - * 'which-subkey' is a flag that selects the desired subkey of a join key + * 'which_subkey' is a flag that selects the desired subkey of a join key * in 'joinkeys' * * Returns a list of pathkeys: ((tlvar1)(tlvar2)...(tlvarN)). @@ -296,7 +296,7 @@ extract_path_keys(List *joinkeys, ****************************************************************************/ /* - * new-join-pathkeys-- + * new_join_pathkeys * Find the path keys for a join relation by finding all vars in the list * of join clauses 'joinclauses' such that: * (1) the var corresponding to the outer join relation is a @@ -305,8 +305,8 @@ extract_path_keys(List *joinkeys, * In other words, add to each outer path key the inner path keys that * are required for qualification. * - * 'outer-pathkeys' is the list of the outer path's path keys - * 'join-rel-tlist' is the target list of the join relation + * 'outer_pathkeys' is the list of the outer path's path keys + * 'join_rel_tlist' is the target list of the join relation * 'joinclauses' is the list of restricting join clauses * * Returns the list of new path keys. @@ -333,17 +333,17 @@ new_join_pathkeys(List *outer_pathkeys, } /* - * new-join-pathkey-- + * new_join_pathkey * Finds new vars that become subkeys due to qualification clauses that * contain any previously considered subkeys. These new subkeys plus the * subkeys from 'subkeys' form a new pathkey for the join relation. * * Note that each returned subkey is the var node found in - * 'join-rel-tlist' rather than the joinclause var node. + * 'join_rel_tlist' rather than the joinclause var node. * * 'subkeys' is a list of subkeys for which matching subkeys are to be * found - * 'considered-subkeys' is the current list of all subkeys corresponding + * 'considered_subkeys' is the current list of all subkeys corresponding * to a given pathkey * * Returns a new pathkey(list of subkeys). @@ -388,15 +388,15 @@ new_join_pathkey(List *subkeys, } /* - * new-matching-subkeys-- + * new_matching_subkeys * Returns a list of new subkeys: - * (1) which are not listed in 'considered-subkeys' + * (1) which are not listed in 'considered_subkeys' * (2) for which the "other" variable in some clause in 'joinclauses' is * 'subkey' - * (3) which are mentioned in 'join-rel-tlist' + * (3) which are mentioned in 'join_rel_tlist' * * Note that each returned subkey is the var node found in - * 'join-rel-tlist' rather than the joinclause var node. + * 'join_rel_tlist' rather than the joinclause var node. * * 'subkey' is the var node for which we are trying to find matching * clauses diff --git a/src/backend/optimizer/path/mergeutils.c b/src/backend/optimizer/path/mergeutils.c index d81ad74d6b..4a032234ad 100644 --- a/src/backend/optimizer/path/mergeutils.c +++ b/src/backend/optimizer/path/mergeutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * mergeutils.c-- + * mergeutils.c * Utilities for finding applicable merge clauses and pathkeys * * Copyright (c) 1994, Regents of the University of California @@ -22,13 +22,13 @@ #include "optimizer/ordering.h" /* - * group-clauses-by-order-- - * If a join clause node in 'restrictinfo-list' is mergejoinable, store + * group_clauses_by_order + * If a join clause node in 'restrictinfo_list' is mergejoinable, store * it within a mergeinfo node containing other clause nodes with the same * mergejoin ordering. * - * 'restrictinfo-list' is the list of restrictinfo nodes - * 'inner-relid' is the relid of the inner join relation + * 'restrictinfo_list' is the list of restrictinfo nodes + * 'inner_relid' is the relid of the inner join relation * * Returns the new list of mergeinfo nodes. * @@ -49,7 +49,7 @@ group_clauses_by_order(List *restrictinfo_list, { /* - * Create a new mergeinfo node and add it to 'mergeinfo-list' + * Create a new mergeinfo node and add it to 'mergeinfo_list' * if one does not yet exist for this merge ordering. */ PathOrder *pathorder; @@ -96,8 +96,8 @@ group_clauses_by_order(List *restrictinfo_list, /* - * match-order-mergeinfo-- - * Searches the list 'mergeinfo-list' for a mergeinfo node whose order + * match_order_mergeinfo + * Searches the list 'mergeinfo_list' for a mergeinfo node whose order * field equals 'ordering'. * * Returns the node if it exists. diff --git a/src/backend/optimizer/path/orindxpath.c b/src/backend/optimizer/path/orindxpath.c index 6fc37e0bda..5f15143c96 100644 --- a/src/backend/optimizer/path/orindxpath.c +++ b/src/backend/optimizer/path/orindxpath.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * orindxpath.c-- + * orindxpath.c * Routines to find index paths that match a set of 'or' clauses * * Copyright (c) 1994, Regents of the University of California @@ -40,7 +40,7 @@ static void best_or_subclause_index(Query *root, RelOptInfo *rel, Expr *subclaus /* - * create-or-index-paths-- + * create_or_index_paths * Creates index paths for indices that match 'or' clauses. * * 'rel' is the relation entry for which the paths are to be defined on @@ -142,7 +142,7 @@ create_or_index_paths(Query *root, } /* - * best-or-subclause-indices-- + * best_or_subclause_indices * Determines the best index to be used in conjunction with each subclause * of an 'or' clause and the cost of scanning a relation using these * indices. The cost is the sum of the individual index costs. @@ -151,9 +151,9 @@ create_or_index_paths(Query *root, * 'subclauses' are the subclauses of the 'or' clause * 'indices' are those index nodes that matched subclauses of the 'or' * clause - * 'examined-indexids' is a list of those index ids to be used with + * 'examined_indexids' is a list of those index ids to be used with * subclauses that have already been examined - * 'subcost' is the cost of using the indices in 'examined-indexids' + * 'subcost' is the cost of using the indices in 'examined_indexids' * 'selectivities' is a list of the selectivities of subclauses that * have already been examined * @@ -199,7 +199,7 @@ best_or_subclause_indices(Query *root, } /* - * best-or-subclause-index-- + * best_or_subclause_index * Determines which is the best index to be used with a subclause of * an 'or' clause by estimating the cost of using each index and selecting * the least expensive. @@ -208,7 +208,7 @@ best_or_subclause_indices(Query *root, * 'subclause' is the subclause * 'indices' is a list of index nodes that match the subclause * - * Returns a list (index-id index-subcost index-selectivity) + * Returns a list (index_id index_subcost index_selectivity) * (a fixnum, a fixnum, and a flonum respectively). * */ diff --git a/src/backend/optimizer/path/predmig.c b/src/backend/optimizer/path/predmig.c index 880ed58dcf..0164dd729e 100644 --- a/src/backend/optimizer/path/predmig.c +++ b/src/backend/optimizer/path/predmig.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * predmig.c-- + * predmig.c * * * Copyright (c) 1994, Regents of the University of California @@ -269,7 +269,7 @@ xfunc_llel_chains(Stream root, Stream bottom) } /* - ** xfunc_complete_stream -- + ** xfunc_complete_stream ** Given a stream composed of join nodes only, make a copy containing the ** join nodes along with the associated restriction nodes. */ @@ -390,7 +390,7 @@ xfunc_prdmig_pullup(Stream origstream, Stream pullme, JoinPath joinpath) } /* - ** xfunc_form_groups -- + ** xfunc_form_groups ** A group is a pair of stream nodes a,b such that a is constrained to ** precede b (for instance if a and b are both joins), but rank(a) > rank(b). ** In such a situation, Monma and Sidney prove that no clauses should end @@ -490,7 +490,7 @@ xfunc_form_groups(Query *queryInfo, Stream root, Stream bottom) /* ------------------- UTILITY FUNCTIONS ------------------------- */ /* - ** xfunc_free_stream -- + ** xfunc_free_stream ** walk down a stream and pfree it */ static void @@ -623,7 +623,7 @@ xfunc_num_relids(Stream node) } /* - ** xfunc_get_downjoin -- + ** xfunc_get_downjoin ** Given a stream node, find the next lowest node which points to a ** join predicate or a scan node. */ @@ -642,7 +642,7 @@ xfunc_get_downjoin(Stream node) } /* - ** xfunc_get_upjoin -- + ** xfunc_get_upjoin ** same as above, but upwards. */ static StreamPtr @@ -660,7 +660,7 @@ xfunc_get_upjoin(Stream node) } /* - ** xfunc_stream_qsort -- + ** xfunc_stream_qsort ** Given a stream, sort by group rank the elements in the stream from the ** node "bottom" up. DESTRUCTIVELY MODIFIES STREAM! Returns new root. */ diff --git a/src/backend/optimizer/path/prune.c b/src/backend/optimizer/path/prune.c index d5732838d9..33a44930a2 100644 --- a/src/backend/optimizer/path/prune.c +++ b/src/backend/optimizer/path/prune.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * prune.c-- + * prune.c * Routines to prune redundant paths and relations * * Copyright (c) 1994, Regents of the University of California @@ -27,9 +27,9 @@ static List *prune_joinrel(RelOptInfo *rel, List *other_rels); /* - * prune-joinrels-- + * prune_joinrels * Removes any redundant relation entries from a list of rel nodes - * 'rel-list'. Obviously, the first relation can't be a duplicate. + * 'rel_list'. Obviously, the first relation can't be a duplicate. * * Returns the resulting list. * @@ -48,8 +48,8 @@ prune_joinrels(List *rel_list) } /* - * prune-joinrel-- - * Prunes those relations from 'other-rels' that are redundant with + * prune_joinrel + * Prunes those relations from 'other_rels' that are redundant with * 'rel'. A relation is redundant if it is built up of the same * relations as 'rel'. Paths for the redundant relation are merged into * the pathlist of 'rel'. @@ -83,8 +83,8 @@ prune_joinrel(RelOptInfo *rel, List *other_rels) } /* - * rels-set-cheapest - * For each relation entry in 'rel-list' (which corresponds to a join + * rels_set_cheapest + * For each relation entry in 'rel_list' (which corresponds to a join * relation), set pointers to the cheapest path */ void @@ -108,12 +108,12 @@ rels_set_cheapest(List *rel_list) /* - * merge-joinrels-- + * merge_joinrels * Given two lists of rel nodes that are already * pruned, merge them into one pruned rel node list * - * 'rel-list1' and - * 'rel-list2' are the rel node lists + * 'rel_list1' and + * 'rel_list2' are the rel node lists * * Returns one pruned rel node list */ @@ -132,7 +132,7 @@ merge_joinrels(List *rel_list1, List *rel_list2) } /* - * prune_oldrels-- + * prune_oldrels * If all the joininfo's in a rel node are inactive, * that means that this node has been joined into * other nodes in all possible ways, therefore diff --git a/src/backend/optimizer/path/xfunc.c b/src/backend/optimizer/path/xfunc.c index a522361176..58aa6e9393 100644 --- a/src/backend/optimizer/path/xfunc.c +++ b/src/backend/optimizer/path/xfunc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * xfunc.c-- + * xfunc.c * Utility routines to handle expensive function optimization. * Includes xfunc_trypullup(), which attempts early pullup of predicates * to allow for maximal pruning. @@ -49,7 +49,7 @@ static int xfunc_card_unreferenced(Query *queryInfo, */ /* -** xfunc_trypullup -- +** xfunc_trypullup ** Preliminary pullup of predicates, to allow for maximal pruning. ** Given a relation, check each of its paths and see if you can ** pullup clauses from its inner and outer. @@ -127,7 +127,7 @@ xfunc_trypullup(RelOptInfo rel) } /* - ** xfunc_shouldpull -- + ** xfunc_shouldpull ** find clause with highest rank, and decide whether to pull it up ** from child to parent. Currently we only pullup secondary join clauses ** that are in the pathrestrictinfo. Secondary hash and sort clauses are @@ -144,7 +144,7 @@ xfunc_shouldpull(Query *queryInfo, Path childpath, JoinPath parentpath, int whichchild, - RestrictInfo * maxcinfopt) /* Out: pointer to clause + RestrictInfo *maxcinfopt) /* Out: pointer to clause * to pullup */ { LispValue clauselist, @@ -250,7 +250,7 @@ xfunc_shouldpull(Query *queryInfo, /* - ** xfunc_pullup -- + ** xfunc_pullup ** move clause from child pathnode to parent pathnode. This operation ** makes the child pathnode produce a larger relation than it used to. ** This means that we must construct a new RelOptInfo just for the childpath, @@ -386,7 +386,7 @@ LispValue clause; } /* - ** xfunc_join_expense -- + ** xfunc_join_expense ** Find global expense of a join clause */ Cost @@ -457,7 +457,7 @@ xfunc_local_expense(LispValue clause) } /* - ** xfunc_func_expense -- + ** xfunc_func_expense ** given a Func or Oper and its args, find its expense. ** Note: in Stonebraker's SIGMOD '91 paper, he uses a more complicated metric ** than the one here. We can ignore the expected number of tuples for @@ -581,7 +581,7 @@ xfunc_func_expense(LispValue node, LispValue args) } /* - ** xfunc_width -- + ** xfunc_width ** recursively find the width of a expression */ @@ -1071,7 +1071,7 @@ xfunc_total_path_cost(JoinPath pathnode) /* - ** xfunc_expense_per_tuple -- + ** xfunc_expense_per_tuple ** return the expense of the join *per-tuple* of the input relation. ** The cost model here is that a join costs ** k*card(outer)*card(inner) + l*card(outer) + m*card(inner) + n @@ -1124,7 +1124,7 @@ xfunc_expense_per_tuple(JoinPath joinnode, int whichchild) } /* - ** xfunc_fixvars -- + ** xfunc_fixvars ** After pulling up a clause, we must walk its expression tree, fixing Var ** nodes to point to the correct varno (either INNER or OUTER, depending ** on which child the clause was pulled from), and the right varattno in the @@ -1154,7 +1154,7 @@ xfunc_fixvars(LispValue clause, /* clause being pulled up */ * have to add it. * * */ - add_tl_element(rel, (Var) clause); + add_var_to_tlist(rel, (Var) clause); tle = tlistentry_member((Var) clause, get_targetlist(rel)); } set_varno(((Var) clause), varno); @@ -1223,7 +1223,7 @@ xfunc_clause_compare(void *arg1, void *arg2) } /* - ** xfunc_disjunct_sort -- + ** xfunc_disjunct_sort ** given a list of clauses, for each clause sort the disjuncts by cost ** (this assumes the predicates have been converted to Conjunctive NF) ** Modifies the clause list! @@ -1287,7 +1287,7 @@ xfunc_disjunct_compare(Query *queryInfo, void *arg1, void *arg2) /* ------------------------ UTILITY FUNCTIONS ------------------------------- */ /* - ** xfunc_func_width -- + ** xfunc_func_width ** Given a function OID and operands, find the width of the return value. */ int @@ -1349,7 +1349,7 @@ exit: } /* - ** xfunc_tuple_width -- + ** xfunc_tuple_width ** Return the sum of the lengths of all the attributes of a given relation */ int @@ -1371,7 +1371,7 @@ xfunc_tuple_width(Relation rd) } /* - ** xfunc_num_join_clauses -- + ** xfunc_num_join_clauses ** Find the number of join clauses associated with this join path */ int @@ -1388,7 +1388,7 @@ xfunc_num_join_clauses(JoinPath path) } /* - ** xfunc_LispRemove -- + ** xfunc_LispRemove ** Just like LispRemove, but it whines if the item to be removed ain't there */ LispValue @@ -1419,7 +1419,7 @@ do { \ } while(0) /* - ** xfunc_copyrel -- + ** xfunc_copyrel ** Just like _copyRel, but doesn't copy the paths */ bool diff --git a/src/backend/optimizer/plan/createplan.c b/src/backend/optimizer/plan/createplan.c index f1fdc1ff80..1d2f1cec4a 100644 --- a/src/backend/optimizer/plan/createplan.c +++ b/src/backend/optimizer/plan/createplan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * createplan.c-- + * createplan.c * Routines to create the desired plan for processing a query * * Copyright (c) 1994, Regents of the University of California @@ -76,9 +76,9 @@ static Material *make_material(List *tlist, Oid nonameid, Plan *lefttree, int keycount); /* - * create_plan-- + * create_plan * Creates the access plan for a query by tracing backwards through the - * desired chain of pathnodes, starting at the node 'best-path'. For + * desired chain of pathnodes, starting at the node 'best_path'. For * every pathnode found: * (1) Create a corresponding plan node containing appropriate id, * target list, and qualification information. @@ -86,7 +86,7 @@ static Material *make_material(List *tlist, Oid nonameid, Plan *lefttree, * relative values. * (3) Target lists are not modified, but will be in another routine. * - * best-path is the best access path + * best_path is the best access path * * Returns the optimal(?) access plan. */ @@ -147,10 +147,10 @@ create_plan(Path *best_path) } /* - * create_scan_node-- - * Create a scan path for the parent relation of 'best-path'. + * create_scan_node + * Create a scan path for the parent relation of 'best_path'. * - * tlist is the targetlist for the base relation scanned by 'best-path' + * tlist is the targetlist for the base relation scanned by 'best_path' * * Returns the scan node. */ @@ -194,12 +194,12 @@ create_scan_node(Path *best_path, List *tlist) } /* - * create_join_node -- - * Create a join path for 'best-path' and(recursively) paths for its + * create_join_node + * Create a join path for 'best_path' and(recursively) paths for its * inner and outer paths. * * 'tlist' is the targetlist for the join relation corresponding to - * 'best-path' + * 'best_path' * * Returns the join node. */ @@ -260,7 +260,7 @@ create_join_node(JoinPath *best_path, List *tlist) /* * * Expensive function pullups may have pulled local predicates * - * into this path node. Put them in the qpqual of the plan node. * -- + * into this path node. Put them in the qpqual of the plan node. * * JMH, 6/15/92 */ if (get_loc_restrictinfo(best_path) != NIL) @@ -281,9 +281,9 @@ create_join_node(JoinPath *best_path, List *tlist) /* - * create_seqscan_node-- - * Returns a seqscan node for the base relation scanned by 'best-path' - * with restriction clauses 'scan-clauses' and targetlist 'tlist'. + * create_seqscan_node + * Returns a seqscan node for the base relation scanned by 'best_path' + * with restriction clauses 'scan_clauses' and targetlist 'tlist'. */ static SeqScan * create_seqscan_node(Path *best_path, List *tlist, List *scan_clauses) @@ -309,9 +309,9 @@ create_seqscan_node(Path *best_path, List *tlist, List *scan_clauses) } /* - * create_indexscan_node-- - * Returns a indexscan node for the base relation scanned by 'best-path' - * with restriction clauses 'scan-clauses' and targetlist 'tlist'. + * create_indexscan_node + * Returns a indexscan node for the base relation scanned by 'best_path' + * with restriction clauses 'scan_clauses' and targetlist 'tlist'. */ static IndexScan * create_indexscan_node(IndexPath *best_path, @@ -758,7 +758,7 @@ fix_indxqual_references(Node *clause, Path *index_path) /* - * switch_outer-- + * switch_outer * Given a list of merge clauses, rearranges the elements within the * clauses so the outer join variable is on the left and the inner is on * the right. @@ -798,7 +798,7 @@ switch_outer(List *clauses) } /* - * set-noname-tlist-operators-- + * set_noname_tlist_operators * Sets the key and keyop fields of resdom nodes in a target list. * * 'tlist' is the target list @@ -846,16 +846,16 @@ set_noname_tlist_operators(List *tlist, List *pathkeys, Oid *operators) *****************************************************************************/ /* - * make_noname-- + * make_noname * Create plan nodes to sort or materialize relations into noname. The - * result returned for a sort will look like (SEQSCAN(SORT(plan-node))) - * or (SEQSCAN(MATERIAL(plan-node))) + * result returned for a sort will look like (SEQSCAN(SORT(plan_node))) + * or (SEQSCAN(MATERIAL(plan_node))) * * 'tlist' is the target list of the scan to be sorted or hashed * 'pathkeys' is the list of keys which the sort or hash will be done on * 'operators' is the operators with which the sort or hash is to be done * (a list of operator OIDs) - * 'plan-node' is the node which yields tuples for the sort + * 'plan_node' is the node which yields tuples for the sort * 'nonametype' indicates which operation(sort or hash) to perform */ static Noname * diff --git a/src/backend/optimizer/plan/initsplan.c b/src/backend/optimizer/plan/initsplan.c index 2db0088869..7e31bb9d71 100644 --- a/src/backend/optimizer/plan/initsplan.c +++ b/src/backend/optimizer/plan/initsplan.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * initsplan.c-- + * initsplan.c * Target list, qualification, joininfo initialization routines * * Copyright (c) 1994, Regents of the University of California @@ -39,8 +39,8 @@ extern int Quiet; -static void add_clause_to_rels(Query *root, List *clause); -static void add_join_info_to_rels(Query *root, RestrictInfo * restrictinfo, +static void add_restrict_and_join_to_rel(Query *root, List *clause); +static void add_join_info_to_rels(Query *root, RestrictInfo *restrictinfo, List *join_relids); static void add_vars_to_targetlist(Query *root, List *vars, List *join_relids); @@ -55,16 +55,14 @@ static Oid hashjoinop(Expr *clause); *****************************************************************************/ /* - * init-base-rel-tlist-- + * make_var_only_tlist * Creates rel nodes for every relation mentioned in the target list * 'tlist' (if a node hasn't already been created) and adds them to - * *query-relation-list*. Creates targetlist entries for each member of + * *query_relation_list*. Creates targetlist entries for each member of * 'tlist' and adds them to the tlist field of the appropriate rel node. - * - * Returns nothing. */ void -init_base_rels_tlist(Query *root, List *tlist) +make_var_only_tlist(Query *root, List *tlist) { List *tlist_vars = NIL; List *l = NIL; @@ -80,20 +78,19 @@ init_base_rels_tlist(Query *root, List *tlist) /* now, the target list only contains Var nodes */ foreach(tvar, tlist_vars) { - Var *var; + Var *var = (Var *) lfirst(tvar); Index varno; RelOptInfo *result; - var = (Var *) lfirst(tvar); varno = var->varno; result = get_base_rel(root, varno); - add_tl_element(result, var); + add_var_to_tlist(result, var); } } /* - * add_missing-vars-to-tlist-- + * add_missing_vars_to_tlist * If we have range variable(s) in the FROM clause that does not appear * in the target list nor qualifications, we add it to the base relation * list. For instance, "select f.x from foo f, foo f2" is a join of f and @@ -121,7 +118,7 @@ add_missing_vars_to_tlist(Query *root, List *tlist) OIDOID, -1, 0, varno, ObjectIdAttributeNumber); /* add it to base_rel_list */ result = get_base_rel(root, varno); - add_tl_element(result, var); + add_var_to_tlist(result, var); } pfree(relids); varno++; @@ -139,25 +136,25 @@ add_missing_vars_to_tlist(Query *root, List *tlist) /* - * init-base-rels-qual-- + * add_restrict_and_join_to_rels- * Initializes RestrictInfo and JoinInfo fields of relation entries for all * relations appearing within clauses. Creates new relation entries if - * necessary, adding them to *query-relation-list*. + * necessary, adding them to *query_relation_list*. * * Returns nothing of interest. */ void -init_base_rels_qual(Query *root, List *clauses) +add_restrict_and_join_to_rels(Query *root, List *clauses) { List *clause; foreach(clause, clauses) - add_clause_to_rels(root, lfirst(clause)); + add_restrict_and_join_to_rel(root, lfirst(clause)); return; } /* - * add-clause-to-rels-- + * add_restrict_and_join_to_rel- * Add clause information to either the 'RestrictInfo' or 'JoinInfo' field * of a relation entry(depending on whether or not the clause is a join) * by creating a new RestrictInfo node and setting appropriate fields @@ -166,7 +163,7 @@ init_base_rels_qual(Query *root, List *clauses) * Returns nothing of interest. */ static void -add_clause_to_rels(Query *root, List *clause) +add_restrict_and_join_to_rel(Query *root, List *clause) { List *relids; List *vars; @@ -186,53 +183,43 @@ add_clause_to_rels(Query *root, List *clause) if (length(relids) == 1) { - RelOptInfo *rel = get_base_rel(root, lfirsti(relids)); - /* * There is only one relation participating in 'clause', so * 'clause' must be a restriction clause. */ + RelOptInfo *rel = get_base_rel(root, lfirsti(relids)); /* - * the selectivity of the clause must be computed regardless of + * The selectivity of the clause must be computed regardless of * whether it's a restriction or a join clause */ if (is_funcclause((Node *) clause)) - { /* * XXX If we have a func clause set selectivity to 1/3, really * need a true selectivity function. */ restrictinfo->selectivity = (Cost) 0.3333333; - } else - { restrictinfo->selectivity = compute_clause_selec(root, (Node *) clause, NIL); - } + rel->restrictinfo = lcons(restrictinfo, rel->restrictinfo); } else { - /* * 'clause' is a join clause, since there is more than one atom in * the relid list. */ - if (is_funcclause((Node *) clause)) - { - /* * XXX If we have a func clause set selectivity to 1/3, really * need a true selectivity function. */ restrictinfo->selectivity = (Cost) 0.3333333; - } else - { restrictinfo->selectivity = compute_clause_selec(root, (Node *) clause, NIL); - } + add_join_info_to_rels(root, restrictinfo, relids); /* we are going to be doing a join, so add var to targetlist */ add_vars_to_targetlist(root, vars, relids); @@ -240,19 +227,19 @@ add_clause_to_rels(Query *root, List *clause) } /* - * add-join-info-to-rels-- + * add_join_info_to_rels * For every relation participating in a join clause, add 'restrictinfo' to * the appropriate joininfo node(creating a new one and adding it to the * appropriate rel node if necessary). * * 'restrictinfo' describes the join clause - * 'join-relids' is the list of relations participating in the join clause + * 'join_relids' is the list of relations participating in the join clause * * Returns nothing. * */ static void -add_join_info_to_rels(Query *root, RestrictInfo * restrictinfo, List *join_relids) +add_join_info_to_rels(Query *root, RestrictInfo *restrictinfo, List *join_relids) { List *join_relid; @@ -276,7 +263,7 @@ add_join_info_to_rels(Query *root, RestrictInfo * restrictinfo, List *join_relid } /* - * add-vars-to-targetlist-- + * add_vars_to_targetlist * For each variable appearing in a clause, * (1) If a targetlist entry for the variable is not already present in * the appropriate relation's target list, add one. @@ -285,7 +272,7 @@ add_join_info_to_rels(Query *root, RestrictInfo * restrictinfo, List *join_relid * entry of the targetlist entry. * * 'vars' is the list of var nodes - * 'join-relids' is the list of relids appearing in the join clause + * 'join_relids' is the list of relids appearing in the join clause * (if this is a join clause) * * Returns nothing. @@ -305,7 +292,7 @@ add_vars_to_targetlist(Query *root, List *vars, List *join_relids) tlistentry = tlistentry_member(var, rel->targetlist); if (tlistentry == NULL) /* add a new entry */ - add_tl_element(rel, var); + add_var_to_tlist(rel, var); } } @@ -316,7 +303,7 @@ add_vars_to_targetlist(Query *root, List *vars, List *join_relids) *****************************************************************************/ /* - * init-join-info-- + * init_join_info * Set the MergeJoinable or HashJoinable field for every joininfo node * (within a rel node) and the MergeJoinOrder or HashJoinOp field for * each restrictinfo node(within a joininfo node) for all relations in a @@ -372,7 +359,7 @@ init_join_info(List *rel_list) } /* - * mergejoinop-- + * mergejoinop * Returns the mergejoin operator of an operator iff 'clause' is * mergejoinable, i.e., both operands are single vars and the operator is * a mergejoinable operator. @@ -406,7 +393,7 @@ mergejoinop(Expr *clause) } /* - * hashjoinop-- + * hashjoinop * Returns the hashjoin operator of an operator iff 'clause' is * hashjoinable, i.e., both operands are single vars and the operator is * a hashjoinable operator. diff --git a/src/backend/optimizer/plan/planmain.c b/src/backend/optimizer/plan/planmain.c index 4f6160d248..136733abe0 100644 --- a/src/backend/optimizer/plan/planmain.c +++ b/src/backend/optimizer/plan/planmain.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * planmain.c-- + * planmain.c * Routines to plan a single query * * Copyright (c) 1994, Regents of the University of California @@ -48,7 +48,7 @@ extern Plan *make_groupPlan(List **tlist, bool tuplePerGroup, List *groupClause, Plan *subplan); /* - * query_planner-- + * query_planner * Routine to create a query plan. It does so by first creating a * subplan for the topmost level of attributes in the query. Then, * it modifies all target list and qualifications to consider the next @@ -58,7 +58,7 @@ extern Plan *make_groupPlan(List **tlist, bool tuplePerGroup, * be placed where and any relation level qualifications to be * satisfied. * - * command-type is the query command, e.g., retrieve, delete, etc. + * command-type is the query command, e.g., select, delete, etc. * tlist is the target list of the query * qual is the qualification of the query * @@ -134,7 +134,6 @@ query_planner(Query *root, */ if (var_only_tlist == NULL && qual == NULL) { - switch (command_type) { case CMD_SELECT: @@ -143,7 +142,6 @@ query_planner(Query *root, (Node *) constant_qual, (Plan *) NULL)); break; - case CMD_DELETE: case CMD_UPDATE: { @@ -153,16 +151,13 @@ query_planner(Query *root, (Plan *) NULL); if (constant_qual != NULL) - { return ((Plan *) make_result(tlist, (Node *) constant_qual, (Plan *) scan)); - } else return (Plan *) scan; } break; - default: return (Plan *) NULL; } @@ -236,7 +231,7 @@ query_planner(Query *root, * Subplanner creates an entire plan consisting of joins and scans * for processing a single level of attributes. * - * flat-tlist is the flattened target list + * flat_tlist is the flattened target list * qual is the qualification to be satisfied * * Returns a subplan. @@ -258,8 +253,8 @@ subplanner(Query *root, root->base_rel_list = NIL; root->join_rel_list = NIL; - init_base_rels_tlist(root, flat_tlist); - init_base_rels_qual(root, qual); + make_var_only_tlist(root, flat_tlist); + add_restrict_and_join_to_rels(root, qual); add_missing_vars_to_tlist(root, flat_tlist); /* diff --git a/src/backend/optimizer/plan/planner.c b/src/backend/optimizer/plan/planner.c index bbe888c640..7c5fce0935 100644 --- a/src/backend/optimizer/plan/planner.c +++ b/src/backend/optimizer/plan/planner.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * planner.c-- + * planner.c * The query optimizer external interface. * * Copyright (c) 1994, Regents of the University of California @@ -91,7 +91,7 @@ planner(Query *parse) } /* - * union_planner-- + * union_planner * * Invokes the planner on union queries if there are any left, * recursing if necessary to get them all, then processes normal plans. @@ -357,7 +357,7 @@ union_planner(Query *parse) } /* - * make_sortplan-- + * make_sortplan * Returns a sortplan which is basically a SORT node attached to the * top of the plan returned from the planner. It also adds the * cost of sorting into the plan. diff --git a/src/backend/optimizer/plan/setrefs.c b/src/backend/optimizer/plan/setrefs.c index 8a8ac24f92..661168160d 100644 --- a/src/backend/optimizer/plan/setrefs.c +++ b/src/backend/optimizer/plan/setrefs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * setrefs.c-- + * setrefs.c * Routines to change varno/attno entries to contain references * * Copyright (c) 1994, Regents of the University of California @@ -55,7 +55,7 @@ static void set_result_tlist_references(Result *resultNode); *****************************************************************************/ /* - * set-tlist-references-- + * set_tlist_references * Modifies the target list of nodes in a plan to reference target lists * at lower levels. * @@ -85,7 +85,7 @@ set_tlist_references(Plan *plan) } /* - * set-join-tlist-references-- + * set_join_tlist_references * Modifies the target list of a join node by setting the varnos and * varattnos to reference the target list of the outer and inner join * relations. @@ -136,7 +136,7 @@ set_join_tlist_references(Join *join) } /* - * set-nonamescan-tlist-references-- + * set_nonamescan_tlist_references * Modifies the target list of a node that scans a noname relation (i.e., a * sort or hash node) so that the varnos refer to the child noname. * @@ -156,7 +156,7 @@ set_nonamescan_tlist_references(SeqScan *nonamescan) } /* - * set-noname-tlist-references-- + * set_noname_tlist_references * The noname's vars are made consistent with (actually, identical to) the * modified version of the target list of the node from which noname node * receives its tuples. @@ -182,14 +182,14 @@ set_noname_tlist_references(Noname *noname) } /* - * join-references-- + * join_references * Creates a new set of join clauses by replacing the varno/varattno * values of variables in the clauses to reference target list values * from the outer and inner join relation target lists. * * 'clauses' is the list of join clauses - * 'outer-tlist' is the target list of the outer join relation - * 'inner-tlist' is the target list of the inner join relation + * 'outer_tlist' is the target list of the outer join relation + * 'inner_tlist' is the target list of the inner join relation * * Returns the new join clauses. * @@ -205,16 +205,16 @@ join_references(List *clauses, } /* - * index-outerjoin-references-- + * index_outerjoin_references * Given a list of join clauses, replace the operand corresponding to the * outer relation in the join with references to the corresponding target - * list element in 'outer-tlist' (the outer is rather obscurely + * list element in 'outer_tlist' (the outer is rather obscurely * identified as the side that doesn't contain a var whose varno equals - * 'inner-relid'). + * 'inner_relid'). * * As a side effect, the operator is replaced by the regproc id. * - * 'inner-indxqual' is the list of join clauses (so-called because they + * 'inner_indxqual' is the list of join clauses (so-called because they * are used as qualifications for the inner (inbex) scan of a nestloop) * * Returns the new list of clauses. @@ -268,17 +268,17 @@ index_outerjoin_references(List *inner_indxqual, } /* - * replace-clause-joinvar-refs - * replace-subclause-joinvar-refs - * replace-joinvar-refs + * replace_clause_joinvar_refs + * replace_subclause_joinvar_refs + * replace_joinvar_refs * * Replaces all variables within a join clause with a new var node * whose varno/varattno fields contain a reference to a target list * element from either the outer or inner join relation. * * 'clause' is the join clause - * 'outer-tlist' is the target list of the outer join relation - * 'inner-tlist' is the target list of the inner join relation + * 'outer_tlist' is the target list of the outer join relation + * 'inner_tlist' is the target list of the inner join relation * * Returns the new join clause. * @@ -475,7 +475,7 @@ replace_joinvar_refs(Var *var, List *outer_tlist, List *inner_tlist) } /* - * tlist-noname-references-- + * tlist_noname_references * Creates a new target list for a node that scans a noname relation, * setting the varnos to the id of the noname relation and setting varids * if necessary (varids are only needed if this is a targetlist internal @@ -937,7 +937,7 @@ check_having_qual_for_vars(Node *clause, List *targetlist_so_far) /* Check if the VAR is already contained in the targetlist */ if (tlist_member((Var *) clause, (List *) targetlist_so_far) == NULL) - add_tl_element(&tmp_rel, (Var *) clause); + add_var_to_tlist(&tmp_rel, (Var *) clause); return tmp_rel.targetlist; } diff --git a/src/backend/optimizer/plan/subselect.c b/src/backend/optimizer/plan/subselect.c index 8c106eb48e..3e190c307c 100644 --- a/src/backend/optimizer/plan/subselect.c +++ b/src/backend/optimizer/plan/subselect.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * subselect.c-- + * subselect.c * *------------------------------------------------------------------------- */ diff --git a/src/backend/optimizer/prep/prepkeyset.c b/src/backend/optimizer/prep/prepkeyset.c index 406c6929d0..979796ffe2 100644 --- a/src/backend/optimizer/prep/prepkeyset.c +++ b/src/backend/optimizer/prep/prepkeyset.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * prepkeyset.c-- + * prepkeyset.c * Special preperation for keyset queries. * * Copyright (c) 1994, Regents of the University of California @@ -14,7 +14,7 @@ #include "optimizer/planmain.h" /* - * Node_Copy-- + * Node_Copy * a macro to simplify calling of copyObject on the specified field */ #define Node_Copy(from, newnode, field) newnode->field = copyObject(from->field) diff --git a/src/backend/optimizer/prep/prepqual.c b/src/backend/optimizer/prep/prepqual.c index 2f8d0349da..1be1ea8c9b 100644 --- a/src/backend/optimizer/prep/prepqual.c +++ b/src/backend/optimizer/prep/prepqual.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * prepqual.c-- + * prepqual.c * Routines for preprocessing the parse tree qualification * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/optimizer/prep/preptlist.c b/src/backend/optimizer/prep/preptlist.c index 979f5be570..b4b9f7571f 100644 --- a/src/backend/optimizer/prep/preptlist.c +++ b/src/backend/optimizer/prep/preptlist.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * preptlist.c-- + * preptlist.c * Routines to preprocess the parse tree target list * * Copyright (c) 1994, Regents of the University of California @@ -43,7 +43,7 @@ static List *new_relation_targetlist(Oid relid, Index rt_index, /* - * preprocess-targetlist-- + * preprocess_targetlist * Driver for preprocessing the parse tree targetlist. * * 1. Deal with appends and replaces by filling missing attributes @@ -124,7 +124,7 @@ preprocess_targetlist(List *tlist, *****************************************************************************/ /* - * expand-targetlist-- + * expand_targetlist * Given a target list as generated by the parser and a result relation, * add targetlist entries for the attributes which have not been used. * @@ -235,9 +235,9 @@ replace_matching_resname(List *new_tlist, List *old_tlist) } /* - * new-relation-targetlist-- + * new_relation_targetlist * Generate a targetlist for the relation with relation OID 'relid' - * and rangetable index 'rt-index'. + * and rangetable index 'rt_index'. * * Returns the new targetlist. */ diff --git a/src/backend/optimizer/prep/prepunion.c b/src/backend/optimizer/prep/prepunion.c index 2558d88b9f..1b291ab8ac 100644 --- a/src/backend/optimizer/prep/prepunion.c +++ b/src/backend/optimizer/prep/prepunion.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * prepunion.c-- + * prepunion.c * Routines to plan inheritance, union, and version queries * * Copyright (c) 1994, Regents of the University of California @@ -48,7 +48,7 @@ static Append *make_append(List *appendplans, List *unionrtables, Index rt_index /* - * plan-union-queries-- + * plan_union_queries * * Plans the queries for a given UNION. * @@ -204,7 +204,7 @@ plan_union_queries(Query *parse) /* - * plan-inherit-queries-- + * plan_inherit_queries * * Plans the queries for a given parent relation. * @@ -243,7 +243,7 @@ plan_inherit_queries(Query *parse, Index rt_index) } /* - * plan-inherit-query-- + * plan_inherit_query * Returns a list of plans for 'relids' and a list of range table entries * in union_rtentries. */ @@ -295,7 +295,7 @@ plan_inherit_query(List *relids, } /* - * find-all-inheritors - + * find_all_inheritors - * Returns a list of relids corresponding to relations that inherit * attributes from any relations listed in either of the argument relid * lists. @@ -310,7 +310,7 @@ find_all_inheritors(List *unexamined_relids, /* * Find all relations which inherit from members of - * 'unexamined-relids' and store them in 'new-inheritors'. + * 'unexamined_relids' and store them in 'new_inheritors'. */ List *rels = NIL; List *newrels = NIL; @@ -336,7 +336,7 @@ find_all_inheritors(List *unexamined_relids, } /* - * first-inherit-rt-entry - + * first_inherit_rt_entry - * Given a rangetable, find the first rangetable entry that represents * the appropriate special case. * @@ -361,11 +361,11 @@ first_inherit_rt_entry(List *rangetable) } /* - * new-rangetable-entry - - * Replaces the name and relid of 'old-entry' with the values for - * 'new-relid'. + * new_rangetable_entry - + * Replaces the name and relid of 'old_entry' with the values for + * 'new_relid'. * - * Returns a copy of 'old-entry' with the parameters substituted. + * Returns a copy of 'old_entry' with the parameters substituted. */ static RangeTblEntry * new_rangetable_entry(Oid new_relid, RangeTblEntry *old_entry) @@ -384,8 +384,8 @@ new_rangetable_entry(Oid new_relid, RangeTblEntry *old_entry) } /* - * subst-rangetable-- - * Replaces the 'index'th rangetable entry in 'root' with 'new-entry'. + * subst_rangetable + * Replaces the 'index'th rangetable entry in 'root' with 'new_entry'. * * Returns a new copy of 'root'. */ @@ -463,12 +463,12 @@ fix_parsetree_attnums_nodes(Index rt_index, } /* - * fix-parsetree-attnums-- + * fix_parsetree_attnums * Replaces attribute numbers from the relation represented by - * 'old-relid' in 'parsetree' with the attribute numbers from - * 'new-relid'. + * 'old_relid' in 'parsetree' with the attribute numbers from + * 'new_relid'. * - * Returns the destructively-modified parsetree. + * Returns the destructively_modified parsetree. * */ static void diff --git a/src/backend/optimizer/util/clauses.c b/src/backend/optimizer/util/clauses.c index 1c24550da8..e4794bf4fc 100644 --- a/src/backend/optimizer/util/clauses.c +++ b/src/backend/optimizer/util/clauses.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * clauses.c-- + * clauses.c * routines to manipulate qualification clauses * * Copyright (c) 1994, Regents of the University of California @@ -71,7 +71,7 @@ make_clause(int type, Node *oper, List *args) /* - * is_opclause-- + * is_opclause * * Returns t iff the clause is an operator clause: * (op expr expr) or (op expr). @@ -88,7 +88,7 @@ is_opclause(Node *clause) } /* - * make_opclause-- + * make_opclause * Creates a clause given its operator left operand and right * operand (if it is non-null). * @@ -106,7 +106,7 @@ make_opclause(Oper *op, Var *leftop, Var *rightop) } /* - * get_leftop-- + * get_leftop * * Returns the left operand of a clause of the form (op expr expr) * or (op expr) @@ -151,7 +151,7 @@ agg_clause(Node *clause) *****************************************************************************/ /* - * is_funcclause-- + * is_funcclause * * Returns t iff the clause is a function clause: (func { expr }). * @@ -164,7 +164,7 @@ is_funcclause(Node *clause) } /* - * make_funcclause-- + * make_funcclause * * Creates a function clause given the FUNC node and the functional * arguments. @@ -187,7 +187,7 @@ make_funcclause(Func *func, List *funcargs) *****************************************************************************/ /* - * or_clause-- + * or_clause * * Returns t iff the clause is an 'or' clause: (OR { expr }). * @@ -201,7 +201,7 @@ or_clause(Node *clause) } /* - * make_orclause-- + * make_orclause * * Creates an 'or' clause given a list of its subclauses. * @@ -223,7 +223,7 @@ make_orclause(List *orclauses) *****************************************************************************/ /* - * not_clause-- + * not_clause * * Returns t iff this is a 'not' clause: (NOT expr). * @@ -236,7 +236,7 @@ not_clause(Node *clause) } /* - * make_notclause-- + * make_notclause * * Create a 'not' clause given the expression to be negated. * @@ -254,7 +254,7 @@ make_notclause(Expr *notclause) } /* - * get_notclausearg-- + * get_notclausearg * * Retrieve the clause within a 'not' clause * @@ -271,7 +271,7 @@ get_notclausearg(Expr *notclause) /* - * and_clause-- + * and_clause * * Returns t iff its argument is an 'and' clause: (AND { expr }). * @@ -284,7 +284,7 @@ and_clause(Node *clause) } /* - * make_andclause-- + * make_andclause * * Create an 'and' clause given its arguments in a list. * @@ -308,7 +308,7 @@ make_andclause(List *andclauses) /* - * case_clause-- + * case_clause * * Returns t iff its argument is a 'case' clause: (CASE { expr }). * @@ -328,7 +328,7 @@ case_clause(Node *clause) /* - * pull-constant-clauses-- + * pull_constant_clauses * Scans through a list of qualifications and find those that * contain no variables. * @@ -356,7 +356,7 @@ pull_constant_clauses(List *quals, List **constantQual) } /* - * clause-relids-vars-- + * clause_relids_vars * Retrieves relids and vars appearing within a clause. * Returns ((relid1 relid2 ... relidn) (var1 var2 ... varm)) where * vars appear in the clause this is done by recursively searching @@ -399,8 +399,8 @@ clause_get_relids_vars(Node *clause, List **relids, List **vars) } /* - * NumRelids-- - * (formerly clause-relids) + * NumRelids + * (formerly clause_relids) * * Returns the number of different relations referenced in 'clause'. */ @@ -423,7 +423,7 @@ NumRelids(Node *clause) } /* - * contains-not-- + * contains_not * * Returns t iff the clause is a 'not' clause or if any of the * subclauses within an 'or' clause contain 'not's. @@ -453,7 +453,7 @@ contains_not(Node *clause) } /* - * is_joinable-- + * is_joinable * * Returns t iff 'clause' is a valid join clause. * @@ -487,7 +487,7 @@ is_joinable(Node *clause) } /* - * qual-clause-p-- + * qual_clause_p * * Returns t iff 'clause' is a valid qualification clause. * @@ -509,7 +509,7 @@ qual_clause_p(Node *clause) } /* - * fix-opid-- + * fix_opid * Calculate the opfid from the opno... * * Returns nothing. @@ -571,7 +571,7 @@ fix_opid(Node *clause) } /* - * fix-opids-- + * fix_opids * Calculate the opfid from the opno for all the clauses... * * Returns its argument. @@ -589,7 +589,7 @@ fix_opids(List *clauses) } /* - * get_relattval-- + * get_relattval * For a non-join clause, returns a list consisting of the * relid, * attno, @@ -716,7 +716,7 @@ get_relattval(Node *clause, } /* - * get_relsatts-- + * get_relsatts * * Returns a list * ( relid1 attno1 relid2 attno2 ) diff --git a/src/backend/optimizer/util/indexnode.c b/src/backend/optimizer/util/indexnode.c index bdc0043640..91fa77e743 100644 --- a/src/backend/optimizer/util/indexnode.c +++ b/src/backend/optimizer/util/indexnode.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indexnode.c-- + * indexnode.c * Routines to find all indices on a relation * * Copyright (c) 1994, Regents of the University of California @@ -27,7 +27,7 @@ static List *find_secondary_index(Query *root, Oid relid); /* - * find-relation-indices-- + * find_relation_indices * Returns a list of index nodes containing appropriate information for * each (secondary) index defined on a relation. * @@ -42,7 +42,7 @@ find_relation_indices(Query *root, RelOptInfo *rel) } /* - * find-secondary-index-- + * find_secondary_index * Creates a list of index path nodes containing information for each * secondary index defined on a relation by searching through the index * catalog. diff --git a/src/backend/optimizer/util/joininfo.c b/src/backend/optimizer/util/joininfo.c index 02fbc7c05d..bc57c81467 100644 --- a/src/backend/optimizer/util/joininfo.c +++ b/src/backend/optimizer/util/joininfo.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * joininfo.c-- + * joininfo.c * JoinInfo node manipulation routines * * Copyright (c) 1994, Regents of the University of California @@ -22,16 +22,16 @@ /* - * joininfo-member-- + * joininfo_member * Determines whether a node has already been created for a join * between a set of join relations and the relation described by - * 'joininfo-list'. + * 'joininfo_list'. * - * 'join-relids' is a list of relids corresponding to the join relation - * 'joininfo-list' is the list of joininfo nodes against which this is + * 'join_relids' is a list of relids corresponding to the join relation + * 'joininfo_list' is the list of joininfo nodes against which this is * checked * - * Returns the corresponding node in 'joininfo-list' if such a node + * Returns the corresponding node in 'joininfo_list' if such a node * exists. * */ @@ -52,9 +52,9 @@ joininfo_member(List *join_relids, List *joininfo_list) /* - * find-joininfo-node-- + * find_joininfo_node * Find the joininfo node within a relation entry corresponding - * to a join between 'this_rel' and the relations in 'join-relids'. A + * to a join between 'this_rel' and the relations in 'join_relids'. A * new node is created and added to the relation entry's joininfo * field if the desired one can't be found. * @@ -81,7 +81,7 @@ find_joininfo_node(RelOptInfo *this_rel, List *join_relids) } /* - * other-join-clause-var-- + * other_join_clause_var * Determines whether a var node is contained within a joinclause * of the form(op var var). * diff --git a/src/backend/optimizer/util/keys.c b/src/backend/optimizer/util/keys.c index 666ae9c576..a4997136d4 100644 --- a/src/backend/optimizer/util/keys.c +++ b/src/backend/optimizer/util/keys.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keys.c-- + * keys.c * Key manipulation routines * * Copyright (c) 1994, Regents of the University of California @@ -35,7 +35,7 @@ static bool equal_indexkey_var(int index_key, Var *var); * where subkeyI is a var node * note that the 'Keys field is a list of these * 3. join key - * (outer-subkey inner-subkey) + * (outer_subkey inner_subkey) * where each subkey is a var node * 4. sort key * one of: @@ -48,8 +48,8 @@ static bool equal_indexkey_var(int index_key, Var *var); */ /* - * match-indexkey-operand-- - * Returns t iff an index key 'index-key' matches the given clause + * match_indexkey_operand + * Returns t iff an index key 'index_key' matches the given clause * operand. * */ @@ -65,8 +65,8 @@ match_indexkey_operand(int indexkey, Var *operand, RelOptInfo *rel) } /* - * equal_indexkey_var-- - * Returns t iff an index key 'index-key' matches the corresponding + * equal_indexkey_var + * Returns t iff an index key 'index_key' matches the corresponding * fields of var node 'var'. * */ @@ -80,7 +80,7 @@ equal_indexkey_var(int index_key, Var *var) } /* - * extract-join-subkey-- + * extract_join_subkey * Returns the subkey in a join key corresponding to the outer or inner * relation. * @@ -106,7 +106,7 @@ extract_join_subkey(JoinKey *jk, int which_subkey) } /* - * pathkeys_match-- + * pathkeys_match * Returns t iff two sets of path keys are equivalent. They are * equivalent if the first Var nodes match the second Var nodes. * @@ -169,14 +169,14 @@ pathkeys_match(List *keys1, List *keys2, int *better_key) } /* - * collect-index-pathkeys-- + * collect_index_pathkeys * Creates a list of subkeys by retrieving var nodes corresponding to - * each index key in 'index-keys' from the relation's target list + * each index key in 'index_keys' from the relation's target list * 'tlist'. If the key is not in the target list, the key is irrelevant * and is thrown away. The returned subkey list is of the form: * ((var1) (var2) ... (varn)) * - * 'index-keys' is a list of index keys + * 'index_keys' is a list of index keys * 'tlist' is a relation target list * * Returns the list of cons'd subkeys. diff --git a/src/backend/optimizer/util/ordering.c b/src/backend/optimizer/util/ordering.c index d75c7ab5ba..6c9696cd00 100644 --- a/src/backend/optimizer/util/ordering.c +++ b/src/backend/optimizer/util/ordering.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ordering.c-- + * ordering.c * Routines to manipulate and compare merge and path orderings * * Copyright (c) 1994, Regents of the University of California @@ -22,7 +22,7 @@ static bool sortops_order_match(Oid *ordering1, Oid *ordering2, int *better_sort); /* - * equal-path-ordering-- + * equal_path_ordering * Returns t iff two path orderings are equal. * */ @@ -83,7 +83,7 @@ pathorder_match(PathOrder *path_ordering1, } /* - * equal-path-merge-ordering-- + * equal_path_merge_ordering * Returns t iff a path ordering is usable for ordering a merge join. * * XXX Presently, this means that the first sortop of the path matches @@ -106,7 +106,7 @@ equal_path_merge_ordering(Oid *path_ordering, } /* - * equal-merge-ordering-- + * equal_merge_ordering * Returns t iff two merge orderings are equal. * */ diff --git a/src/backend/optimizer/util/pathnode.c b/src/backend/optimizer/util/pathnode.c index 20ca560f5e..998a9c461e 100644 --- a/src/backend/optimizer/util/pathnode.c +++ b/src/backend/optimizer/util/pathnode.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pathnode.c-- + * pathnode.c * Routines to manipulate pathlists and create path nodes * * Copyright (c) 1994, Regents of the University of California @@ -37,7 +37,7 @@ static Path *better_path(Path *new_path, List *unique_paths, bool *is_new); *****************************************************************************/ /* - * path-is-cheaper-- + * path_is_cheaper * Returns t iff 'path1' is cheaper than 'path2'. * */ @@ -51,11 +51,11 @@ path_is_cheaper(Path *path1, Path *path2) } /* - * set_cheapest-- + * set_cheapest * Finds the minimum cost path from among a relation's paths. * - * 'parent-rel' is the parent relation - * 'pathlist' is a list of path nodes corresponding to 'parent-rel' + * 'parent_rel' is the parent relation + * 'pathlist' is a list of path nodes corresponding to 'parent_rel' * * Returns and sets the relation entry field with the pathnode that * is minimum. @@ -86,14 +86,14 @@ set_cheapest(RelOptInfo *parent_rel, List *pathlist) } /* - * add_pathlist-- - * For each path in the list 'new-paths', add to the list 'unique-paths' + * add_pathlist + * For each path in the list 'new_paths', add to the list 'unique_paths' * only those paths that are unique (i.e., unique ordering and ordering * keys). Should a conflict arise, the more expensive path is thrown out, * thereby pruning the plan space. But we don't prune if xfunc * told us not to. * - * 'parent-rel' is the relation entry to which these paths correspond. + * 'parent_rel' is the relation entry to which these paths correspond. * * Returns the list of unique pathnodes. * @@ -140,15 +140,15 @@ add_pathlist(RelOptInfo *parent_rel, List *unique_paths, List *new_paths) } /* - * better_path-- - * Determines whether 'new-path' has the same ordering and keys as some - * path in the list 'unique-paths'. If there is a redundant path, + * better_path + * Determines whether 'new_path' has the same ordering and keys as some + * path in the list 'unique_paths'. If there is a redundant path, * eliminate the more expensive path. * * Returns: - * The old path - if 'new-path' matches some path in 'unique-paths' and is + * The old path - if 'new_path' matches some path in 'unique_paths' and is * cheaper - * nil - if 'new-path' matches but isn't cheaper + * nil - if 'new_path' matches but isn't cheaper * t - if there is no path in the list with the same ordering and keys * */ @@ -269,7 +269,7 @@ better_path(Path *new_path, List *unique_paths, bool *is_new) *****************************************************************************/ /* - * create_seqscan_path-- + * create_seqscan_path * Creates a path corresponding to a sequential scan, returning the * pathnode. * @@ -290,7 +290,7 @@ create_seqscan_path(RelOptInfo *rel) pathnode->pathkeys = NIL; /* - * copy restrictinfo list into path for expensive function processing -- + * copy restrictinfo list into path for expensive function processing * JMH, 7/7/92 */ pathnode->loc_restrictinfo = (List *) copyObject((Node *) rel->restrictinfo); @@ -311,13 +311,13 @@ create_seqscan_path(RelOptInfo *rel) } /* - * create_index_path-- + * create_index_path * Creates a single path node for an index scan. * * 'rel' is the parent rel * 'index' is the pathnode for the index on 'rel' - * 'restriction-clauses' is a list of restriction clause nodes. - * 'is-join-scan' is a flag indicating whether or not the index is being + * 'restriction_clauses' is a list of restriction clause nodes. + * 'is_join_scan' is a flag indicating whether or not the index is being * considered because of its sort order. * * Returns the new path node. @@ -343,7 +343,7 @@ create_index_path(Query *root, pathnode->indexqual = NIL; /* - * copy restrictinfo list into path for expensive function processing -- + * copy restrictinfo list into path for expensive function processing * JMH, 7/7/92 */ pathnode->path.loc_restrictinfo = set_difference((List *) copyObject((Node *) rel->restrictinfo), @@ -460,7 +460,7 @@ create_index_path(Query *root, } /* - * create_nestloop_path-- + * create_nestloop_path * Creates a pathnode corresponding to a nestloop join between two * relations. * @@ -523,7 +523,7 @@ create_nestloop_path(RelOptInfo *joinrel, } /* - * create_mergejoin_path-- + * create_mergejoin_path * Creates a pathnode corresponding to a mergejoin join between * two relations * diff --git a/src/backend/optimizer/util/plancat.c b/src/backend/optimizer/util/plancat.c index f4062a99e0..e795407b24 100644 --- a/src/backend/optimizer/util/plancat.c +++ b/src/backend/optimizer/util/plancat.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * plancat.c-- + * plancat.c * routines for accessing the system catalogs * * @@ -47,7 +47,7 @@ static void IndexSelectivity(Oid indexrelid, Oid indrelid, int32 nIndexKeys, /* - * relation-info - + * relation_info - * Retrieves catalog information for a given relation. Given the oid of * the relation, return the following information: * whether the relation has secondary indices @@ -85,7 +85,7 @@ relation_info(Query *root, Index relid, /* - * index-info-- + * index_info * Retrieves catalog information on an index on a given relation. * * The index relation is opened on the first invocation. The current @@ -225,7 +225,7 @@ index_info(Query *root, bool first, int relid, IdxInfoRetval *info) } /* - * index-selectivity-- + * index_selectivity * * Call util/plancat.c:IndexSelectivity with the indicated arguments. * @@ -308,7 +308,7 @@ index_selectivity(Oid indid, } /* - * restriction_selectivity in lisp system.-- + * restriction_selectivity in lisp system. * * NOTE: The routine is now merged with RestrictionClauseSelectivity * as defined in plancat.c @@ -349,7 +349,7 @@ restriction_selectivity(Oid functionObjectId, } /* - * join_selectivity-- + * join_selectivity * Similarly, this routine is merged with JoinClauseSelectivity in * plancat.c * @@ -388,7 +388,7 @@ join_selectivity(Oid functionObjectId, } /* - * find_all_inheritors-- + * find_all_inheritors * * Returns a LISP list containing the OIDs of all relations which * inherits from the relation with OID 'inhparent'. @@ -424,7 +424,7 @@ find_inheritance_children(Oid inhparent) #ifdef NOT_USED /* - * VersionGetParents-- + * VersionGetParents * * Returns a LISP list containing the OIDs of all relations which are * base relations of the relation with OID 'verrelid'. @@ -469,7 +469,7 @@ VersionGetParents(Oid verrelid) *****************************************************************************/ /* - * IdexSelectivity-- + * IdexSelectivity * * Retrieves the 'amopnpages' and 'amopselect' parameters for each * AM operator when a given index (specified by 'indexrelid') is used. diff --git a/src/backend/optimizer/util/relnode.c b/src/backend/optimizer/util/relnode.c index aadf23868d..7dd96f98cc 100644 --- a/src/backend/optimizer/util/relnode.c +++ b/src/backend/optimizer/util/relnode.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * relnode.c-- + * relnode.c * Relation manipulation routines * * Copyright (c) 1994, Regents of the University of California @@ -22,7 +22,7 @@ /* - * get_base_rel-- + * get_base_rel * Returns relation entry corresponding to 'relid', creating a new one if * necessary. This is for base relations. * @@ -93,7 +93,7 @@ get_base_rel(Query *root, int relid) } /* - * get_join_rel-- + * get_join_rel * Returns relation entry corresponding to 'relid' (a list of relids), * creating a new one if necessary. This is for join relations. * @@ -105,7 +105,7 @@ get_join_rel(Query *root, List *relid) } /* - * rel-member-- + * rel_member * Determines whether a relation of id 'relid' is contained within a list * 'rels'. * diff --git a/src/backend/optimizer/util/restrictinfo.c b/src/backend/optimizer/util/restrictinfo.c index cdd5b91f4c..3e330f690e 100644 --- a/src/backend/optimizer/util/restrictinfo.c +++ b/src/backend/optimizer/util/restrictinfo.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * restrictinfo.c-- + * restrictinfo.c * RestrictInfo node manipulation routines. * * Copyright (c) 1994, Regents of the University of California @@ -21,13 +21,13 @@ #include "optimizer/restrictinfo.h" /* - * valid-or-clause-- + * valid_or_clause * * Returns t iff the restrictinfo node contains a 'normal' 'or' clause. * */ bool -valid_or_clause(RestrictInfo * restrictinfo) +valid_or_clause(RestrictInfo *restrictinfo) { if (restrictinfo != NULL && !single_node((Node *) restrictinfo->clause) && @@ -39,9 +39,9 @@ valid_or_clause(RestrictInfo * restrictinfo) } /* - * get-actual-clauses-- + * get_actual_clauses * - * Returns a list containing the clauses from 'restrictinfo-list'. + * Returns a list containing the clauses from 'restrictinfo_list'. * */ List * @@ -68,7 +68,7 @@ get_actual_clauses(List *restrictinfo_list) */ /* - * get_relattvals-- + * get_relattvals * For each member of a list of restrictinfo nodes to be used with an * index, create a vectori-long specifying: * the attnos, @@ -79,7 +79,7 @@ get_actual_clauses(List *restrictinfo_list) * flag indicating whether the constant is on the left or right should * always be *SELEC-CONSTANT-RIGHT*. * - * 'restrictinfo-list' is a list of restrictinfo nodes + * 'restrictinfo_list' is a list of restrictinfo nodes * * Returns a list of vectori-longs. * @@ -117,7 +117,7 @@ get_relattvals(List *restrictinfo_list, } /* - * get_joinvars -- + * get_joinvars * Given a list of join restrictinfo nodes to be used with the index * of an inner join relation, return three lists consisting of: * the attributes corresponding to the inner join relation @@ -126,7 +126,7 @@ get_relattvals(List *restrictinfo_list, * the operator. * * 'relid' is the inner join relation - * 'restrictinfo-list' is a list of qualification clauses to be used with + * 'restrictinfo_list' is a list of qualification clauses to be used with * 'rel' * */ @@ -168,7 +168,7 @@ get_joinvars(Oid relid, } /* - * get_opnos-- + * get_opnos * Create and return a list containing the clause operators of each member * of a list of restrictinfo nodes to be used with an index. * diff --git a/src/backend/optimizer/util/tlist.c b/src/backend/optimizer/util/tlist.c index 4885bb25a7..1b2feee9cf 100644 --- a/src/backend/optimizer/util/tlist.c +++ b/src/backend/optimizer/util/tlist.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tlist.c-- + * tlist.c * Target list manipulation routines * * Copyright (c) 1994, Regents of the University of California @@ -34,13 +34,13 @@ static Node *flatten_tlistentry(Node *tlistentry, List *flat_tlist); *****************************************************************************/ /* - * tlistentry-member-- + * tlistentry_member * * RETURNS: the leftmost member of sequence "targetlist" that satisfies * the predicate "var_equal" * MODIFIES: nothing * REQUIRES: test = function which can operate on a lispval union - * var = valid var-node + * var = valid var_node * targetlist = valid sequence */ TargetEntry * @@ -61,7 +61,7 @@ tlistentry_member(Var *var, List *targetlist) } /* - * matching_tlvar-- + * matching_tlvar * * RETURNS: var node in a target list which is var_equal to 'var', * if one exists. @@ -81,7 +81,7 @@ matching_tlvar(Var *var, List *targetlist) } /* - * add_tl_element-- + * add_var_to_tlist * Creates a targetlist entry corresponding to the supplied var node * * 'var' and adds the new targetlist entry to the targetlist field of @@ -90,10 +90,10 @@ matching_tlvar(Var *var, List *targetlist) * RETURNS: nothing * MODIFIES: vartype and varid fields of leftmost varnode that matches * argument "var" (sometimes). - * CREATES: new var-node iff no matching var-node exists in targetlist + * CREATES: new var_node iff no matching var_node exists in targetlist */ void -add_tl_element(RelOptInfo *rel, Var *var) +add_var_to_tlist(RelOptInfo *rel, Var *var) { Expr *oldvar = (Expr *) NULL; @@ -121,12 +121,12 @@ add_tl_element(RelOptInfo *rel, Var *var) } /* - * create_tl_element-- + * create_tl_element * Creates a target list entry node and its associated (resdom var) pair * with its resdom number equal to 'resdomno' and the joinlist field set * to 'joinlist'. * - * RETURNS: newly created tlist-entry + * RETURNS: newly created tlist_entry * CREATES: new targetlist entry (always). */ TargetEntry * @@ -144,7 +144,7 @@ create_tl_element(Var *var, int resdomno) } /* - * get-actual-tlist-- + * get_actual_tlist * Returns the targetlist elements from a relation tlist. * */ @@ -184,7 +184,7 @@ get_actual_tlist(List *tlist) *****************************************************************************/ /* - * tlist-member-- + * tlist_member * Determines whether a var node is already contained within a * target list. * @@ -245,7 +245,7 @@ tlist_resdom(List *tlist, Resdom *resnode) /* - * match_varid-- + * match_varid * Searches a target list for an entry with some desired varid. * * 'varid' is the desired id @@ -299,7 +299,7 @@ match_varid(Var *test_var, List *tlist) /* - * new-unsorted-tlist-- + * new_unsorted_tlist * Creates a copy of a target list by creating new resdom nodes * without sort information. * @@ -325,7 +325,7 @@ new_unsorted_tlist(List *targetlist) } /* - * copy-vars-- + * copy_vars * Replaces the var nodes in the first target list with those from * the second target list. The two target lists are assumed to be * identical except their actual resdoms and vars are different. @@ -355,7 +355,7 @@ copy_vars(List *target, List *source) } /* - * flatten-tlist-- + * flatten_tlist * Create a target list that only contains unique variables. * * @@ -407,13 +407,13 @@ flatten_tlist(List *tlist) } /* - * flatten-tlist-vars-- + * flatten_tlist_vars * Redoes the target list of a query with no nested attributes by * replacing vars within computational expressions with vars from * the 'flattened' target list of the query. * - * 'full-tlist' is the actual target list - * 'flat-tlist' is the flattened (var-only) target list + * 'full_tlist' is the actual target list + * 'flat_tlist' is the flattened (var-only) target list * * Returns the modified actual target list. * @@ -437,12 +437,12 @@ flatten_tlist_vars(List *full_tlist, List *flat_tlist) } /* - * flatten-tlistentry-- + * flatten_tlistentry * Replaces vars within a target list entry with vars from a flattened * target list. * * 'tlistentry' is the target list entry to be modified - * 'flat-tlist' is the flattened target list + * 'flat_tlist' is the flattened target list * * Returns the (modified) target_list entry from the target list. * diff --git a/src/backend/optimizer/util/var.c b/src/backend/optimizer/util/var.c index 0ec979abf9..1080c12153 100644 --- a/src/backend/optimizer/util/var.c +++ b/src/backend/optimizer/util/var.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * var.c-- + * var.c * Var node manipulation routines * * Copyright (c) 1994, Regents of the University of California @@ -67,7 +67,7 @@ pull_varnos(Node *me) } /* - * contain_var_clause-- + * contain_var_clause * Recursively find var nodes from a clause by pulling vars from the * left and right operands of the clause. * @@ -157,7 +157,7 @@ contain_var_clause(Node *clause) } /* - * pull_var_clause-- + * pull_var_clause * Recursively pulls all var nodes from a clause by pulling vars from the * left and right operands of the clause. * diff --git a/src/backend/parser/analyze.c b/src/backend/parser/analyze.c index d7164a1ff7..4beda8b109 100644 --- a/src/backend/parser/analyze.c +++ b/src/backend/parser/analyze.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * analyze.c-- + * analyze.c * transform the parse tree into a query tree * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/gram.c b/src/backend/parser/gram.c index d6e672759f..49b39f9997 100644 --- a/src/backend/parser/gram.c +++ b/src/backend/parser/gram.c @@ -235,7 +235,7 @@ /*#define YYDEBUG 1*/ /*------------------------------------------------------------------------- * - * gram.y-- + * gram.y * POSTGRES SQL YACC rules/actions * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/gram.y b/src/backend/parser/gram.y index 11dff876f1..d5de3338c3 100644 --- a/src/backend/parser/gram.y +++ b/src/backend/parser/gram.y @@ -3,7 +3,7 @@ /*#define YYDEBUG 1*/ /*------------------------------------------------------------------------- * - * gram.y-- + * gram.y * POSTGRES SQL YACC rules/actions * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/keywords.c b/src/backend/parser/keywords.c index 0327fac5a0..e204a24834 100644 --- a/src/backend/parser/keywords.c +++ b/src/backend/parser/keywords.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keywords.c-- + * keywords.c * lexical token lookup for reserved words in postgres SQL * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/parse_agg.c b/src/backend/parser/parse_agg.c index 897aeb5fb4..c89396faec 100644 --- a/src/backend/parser/parse_agg.c +++ b/src/backend/parser/parse_agg.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parse_agg.c-- + * parse_agg.c * handle aggregates in parser * * Copyright (c) 1994, Regents of the University of California @@ -36,7 +36,7 @@ static bool exprIsAggOrGroupCol(Node *expr, List *groupClause); static bool tleIsAggOrGroupCol(TargetEntry *tle, List *groupClause); /* - * contain_agg_clause-- + * contain_agg_clause * Recursively find aggref nodes from a clause. * * Returns true if any aggregate found. diff --git a/src/backend/parser/parse_clause.c b/src/backend/parser/parse_clause.c index 357b8bf32c..07fb5b97c6 100644 --- a/src/backend/parser/parse_clause.c +++ b/src/backend/parser/parse_clause.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parse_clause.c-- + * parse_clause.c * handle clauses in parser * * Copyright (c) 1994, Regents of the University of California @@ -43,7 +43,7 @@ static void parseFromClause(ParseState *pstate, List *frmList); /* * makeRangeTable - * make a range table with the specified relation (optional) and the - * from-clause. + * from_clause. */ void makeRangeTable(ParseState *pstate, char *relname, List *frmList) diff --git a/src/backend/parser/parse_func.c b/src/backend/parser/parse_func.c index 6729659091..07a3e028be 100644 --- a/src/backend/parser/parse_func.c +++ b/src/backend/parser/parse_func.c @@ -90,7 +90,7 @@ typedef struct _SuperQE } SuperQE; /* - ** ParseNestedFuncOrColumn -- + ** ParseNestedFuncOrColumn ** Given a nested dot expression (i.e. (relation func ... attr), build up ** a tree with of Iter and Func nodes. */ @@ -1306,7 +1306,7 @@ make_arguments(ParseState *pstate, } /* - ** setup_tlist -- + ** setup_tlist ** Build a tlist that says which attribute to project to. ** This routine is called by ParseFuncOrColumn() to set up a target list ** on a tuple parameter or return value. Due to a bug in 4.0, @@ -1344,7 +1344,7 @@ setup_tlist(char *attname, Oid relid) } /* - ** setup_base_tlist -- + ** setup_base_tlist ** Build a tlist that extracts a base type from the tuple ** returned by the executor. */ diff --git a/src/backend/parser/parse_node.c b/src/backend/parser/parse_node.c index b69226e21c..fb722e742b 100644 --- a/src/backend/parser/parse_node.c +++ b/src/backend/parser/parse_node.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parse_node.c-- + * parse_node.c * various routines that make nodes for query plans * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/parse_relation.c b/src/backend/parser/parse_relation.c index e1af326b72..d75b93f6c8 100644 --- a/src/backend/parser/parse_relation.c +++ b/src/backend/parser/parse_relation.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parse_relation.c-- + * parse_relation.c * parser support routines dealing with relations * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/parser.c b/src/backend/parser/parser.c index c7afeb111b..1f775a8eed 100644 --- a/src/backend/parser/parser.c +++ b/src/backend/parser/parser.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parser.c-- + * parser.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/parser/scan.c b/src/backend/parser/scan.c index bc4dbe95a8..c533c6e42a 100644 --- a/src/backend/parser/scan.c +++ b/src/backend/parser/scan.c @@ -549,7 +549,7 @@ char *yytext; #line 2 "scan.l" /*------------------------------------------------------------------------- * - * scan.l-- + * scan.l * lexical scanner for POSTGRES * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/scan.l b/src/backend/parser/scan.l index e5a010c4c0..b9ba29955e 100644 --- a/src/backend/parser/scan.l +++ b/src/backend/parser/scan.l @@ -1,7 +1,7 @@ %{ /*------------------------------------------------------------------------- * - * scan.l-- + * scan.l * lexical scanner for POSTGRES * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/parser/scansup.c b/src/backend/parser/scansup.c index be1600160d..381eb0cd26 100644 --- a/src/backend/parser/scansup.c +++ b/src/backend/parser/scansup.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * scansup.c-- + * scansup.c * support routines for the lex/flex scanner, used by both the normal * backend as well as the bootstrap backend * diff --git a/src/backend/port/dynloader/alpha.h b/src/backend/port/dynloader/alpha.h index 7e4d653839..07313b1f34 100644 --- a/src/backend/port/dynloader/alpha.h +++ b/src/backend/port/dynloader/alpha.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * alpha.h-- + * alpha.h * prototypes for OSF/1-specific routines * * diff --git a/src/backend/port/dynloader/bsd.h b/src/backend/port/dynloader/bsd.h index d8a9dc5cc8..2cd1066d2b 100644 --- a/src/backend/port/dynloader/bsd.h +++ b/src/backend/port/dynloader/bsd.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for NetBSD 1.0 * * diff --git a/src/backend/port/dynloader/bsdi.c b/src/backend/port/dynloader/bsdi.c index 1e62b58ad6..fd1fbd73b8 100644 --- a/src/backend/port/dynloader/bsdi.c +++ b/src/backend/port/dynloader/bsdi.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynloader.c-- + * dynloader.c * Dynamic Loader for Postgres for Linux, generated from those for * Ultrix. * diff --git a/src/backend/port/dynloader/bsdi.h b/src/backend/port/dynloader/bsdi.h index 8f8c5ee563..19a5fccc64 100644 --- a/src/backend/port/dynloader/bsdi.h +++ b/src/backend/port/dynloader/bsdi.h @@ -1,12 +1,12 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for SunOS 4 * * * Copyright (c) 1994, Regents of the University of California * - * port-protos.h,v 1.2 1995/05/25 22:51:03 andrew Exp + * port_protos.h,v 1.2 1995/05/25 22:51:03 andrew Exp * *------------------------------------------------------------------------- */ diff --git a/src/backend/port/dynloader/dgux.h b/src/backend/port/dynloader/dgux.h index 2e067e16ba..f159ae34dd 100644 --- a/src/backend/port/dynloader/dgux.h +++ b/src/backend/port/dynloader/dgux.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dgux.h-- + * dgux.h * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/port/dynloader/freebsd.h b/src/backend/port/dynloader/freebsd.h index d8a9dc5cc8..2cd1066d2b 100644 --- a/src/backend/port/dynloader/freebsd.h +++ b/src/backend/port/dynloader/freebsd.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for NetBSD 1.0 * * diff --git a/src/backend/port/dynloader/hpux.c b/src/backend/port/dynloader/hpux.c index c4de32f26f..d9a28de867 100644 --- a/src/backend/port/dynloader/hpux.c +++ b/src/backend/port/dynloader/hpux.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynloader.c-- + * dynloader.c * dynamic loader for HP-UX using the shared library mechanism * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/port/dynloader/hpux.h b/src/backend/port/dynloader/hpux.h index b20a974c17..d91175717c 100644 --- a/src/backend/port/dynloader/hpux.h +++ b/src/backend/port/dynloader/hpux.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynloader.h-- + * dynloader.h * dynamic loader for HP-UX using the shared library mechanism * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/port/dynloader/irix5.h b/src/backend/port/dynloader/irix5.h index 0f66ea5074..020aa0d88f 100644 --- a/src/backend/port/dynloader/irix5.h +++ b/src/backend/port/dynloader/irix5.h @@ -1,12 +1,12 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for Irix 5 * * * Copyright (c) 1994, Regents of the University of California * - * port-protos.h,v 1.2 1995/03/17 06:40:18 andrew Exp + * port_protos.h,v 1.2 1995/03/17 06:40:18 andrew Exp * *------------------------------------------------------------------------- */ diff --git a/src/backend/port/dynloader/linux.c b/src/backend/port/dynloader/linux.c index 2e18333548..ff32d80f67 100644 --- a/src/backend/port/dynloader/linux.c +++ b/src/backend/port/dynloader/linux.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynloader.c-- + * dynloader.c * Dynamic Loader for Postgres for Linux, generated from those for * Ultrix. * diff --git a/src/backend/port/dynloader/linux.h b/src/backend/port/dynloader/linux.h index 45f725c169..439ec35cd2 100644 --- a/src/backend/port/dynloader/linux.h +++ b/src/backend/port/dynloader/linux.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for Linux * * diff --git a/src/backend/port/dynloader/nextstep.h b/src/backend/port/dynloader/nextstep.h index ecaf48beb2..6867aca294 100644 --- a/src/backend/port/dynloader/nextstep.h +++ b/src/backend/port/dynloader/nextstep.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for NeXT * diff --git a/src/backend/port/dynloader/sco.h b/src/backend/port/dynloader/sco.h index d857612654..26555ebc29 100644 --- a/src/backend/port/dynloader/sco.h +++ b/src/backend/port/dynloader/sco.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for SCO 3.2v5.2 * * diff --git a/src/backend/port/dynloader/solaris_i386.h b/src/backend/port/dynloader/solaris_i386.h index c7f195b760..386aaf2900 100755 --- a/src/backend/port/dynloader/solaris_i386.h +++ b/src/backend/port/dynloader/solaris_i386.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for SunOS 4 * * diff --git a/src/backend/port/dynloader/solaris_sparc.h b/src/backend/port/dynloader/solaris_sparc.h index 723b213558..c509099a21 100755 --- a/src/backend/port/dynloader/solaris_sparc.h +++ b/src/backend/port/dynloader/solaris_sparc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for SunOS 4 * * diff --git a/src/backend/port/dynloader/sunos4.h b/src/backend/port/dynloader/sunos4.h index 42946f954e..65d43c72af 100644 --- a/src/backend/port/dynloader/sunos4.h +++ b/src/backend/port/dynloader/sunos4.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for SunOS 4 * * diff --git a/src/backend/port/dynloader/svr4.h b/src/backend/port/dynloader/svr4.h index 519c9ef2e2..11de7894c1 100644 --- a/src/backend/port/dynloader/svr4.h +++ b/src/backend/port/dynloader/svr4.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynloader.h-- + * dynloader.h * port-specific prototypes for Intel x86/Intel SVR4 * * diff --git a/src/backend/port/dynloader/ultrix4.c b/src/backend/port/dynloader/ultrix4.c index fae749e421..78a406c387 100644 --- a/src/backend/port/dynloader/ultrix4.c +++ b/src/backend/port/dynloader/ultrix4.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynloader.c-- + * dynloader.c * This dynamic loader uses Andrew Yu's libdl-1.0 package for Ultrix 4.x. * (Note that pg_dlsym and pg_dlclose are actually macros defined in * "port-protos.h".) diff --git a/src/backend/port/dynloader/ultrix4.h b/src/backend/port/dynloader/ultrix4.h index d3a2023f68..0a274f076d 100644 --- a/src/backend/port/dynloader/ultrix4.h +++ b/src/backend/port/dynloader/ultrix4.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dl.h-- + * dl.h * * * @@ -13,7 +13,7 @@ /* * Ultrix 4.x Dynamic Loader Library Version 1.0 * - * dl.h-- + * dl.h * header file for the Dynamic Loader Library * * diff --git a/src/backend/port/dynloader/univel.h b/src/backend/port/dynloader/univel.h index c8b2e70b10..9b047448bc 100644 --- a/src/backend/port/dynloader/univel.h +++ b/src/backend/port/dynloader/univel.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * univel.h-- + * univel.h * port-specific prototypes for Intel x86/UNIXWARE * * diff --git a/src/backend/port/dynloader/unixware.h b/src/backend/port/dynloader/unixware.h index 8aed609b67..25470fb2c5 100644 --- a/src/backend/port/dynloader/unixware.h +++ b/src/backend/port/dynloader/unixware.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * unixware.h-- + * unixware.h * port-specific prototypes for Intel x86/UNIXWARE 7 * * diff --git a/src/backend/port/dynloader/win.h b/src/backend/port/dynloader/win.h index e7215e5271..4f83b14ccf 100644 --- a/src/backend/port/dynloader/win.h +++ b/src/backend/port/dynloader/win.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * win.h-- + * win.h * port-specific prototypes for Intel x86/Window NT * * diff --git a/src/backend/port/hpux/fixade.h b/src/backend/port/hpux/fixade.h index f45a103947..27da0e01ec 100644 --- a/src/backend/port/hpux/fixade.h +++ b/src/backend/port/hpux/fixade.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fixade.h-- + * fixade.h * compiler tricks to make things work while POSTGRES does non-native * dereferences on PA-RISC. * diff --git a/src/backend/port/hpux/port-protos.h b/src/backend/port/hpux/port-protos.h index df0aa95f42..33d3662f25 100644 --- a/src/backend/port/hpux/port-protos.h +++ b/src/backend/port/hpux/port-protos.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * port-protos.h-- + * port_protos.h * port-specific prototypes for HP-UX * * diff --git a/src/backend/port/sunos4/float.h b/src/backend/port/sunos4/float.h index 0bca48b735..f8a1eafb36 100644 --- a/src/backend/port/sunos4/float.h +++ b/src/backend/port/sunos4/float.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * float.h-- + * float.h * definitions for ANSI floating point * * diff --git a/src/backend/postmaster/postmaster.c b/src/backend/postmaster/postmaster.c index 510200d2ae..6d42786bf5 100644 --- a/src/backend/postmaster/postmaster.c +++ b/src/backend/postmaster/postmaster.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * postmaster.c-- + * postmaster.c * This program acts as a clearing house for requests to the * POSTGRES system. Frontend programs send a startup message * to the Postmaster and the postmaster uses the info in the diff --git a/src/backend/rewrite/locks.c b/src/backend/rewrite/locks.c index 14ae2dfd16..af17455cac 100644 --- a/src/backend/rewrite/locks.c +++ b/src/backend/rewrite/locks.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * locks.c-- + * locks.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/rewrite/rewriteDefine.c b/src/backend/rewrite/rewriteDefine.c index 539a75fd1f..ce7edf3154 100644 --- a/src/backend/rewrite/rewriteDefine.c +++ b/src/backend/rewrite/rewriteDefine.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteDefine.c-- + * rewriteDefine.c * routines for defining a rewrite rule * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/rewrite/rewriteHandler.c b/src/backend/rewrite/rewriteHandler.c index 9b56bae20e..97d38b5cb0 100644 --- a/src/backend/rewrite/rewriteHandler.c +++ b/src/backend/rewrite/rewriteHandler.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteHandler.c-- + * rewriteHandler.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/rewrite/rewriteManip.c b/src/backend/rewrite/rewriteManip.c index bc4b26ef42..0b8781adaf 100644 --- a/src/backend/rewrite/rewriteManip.c +++ b/src/backend/rewrite/rewriteManip.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteManip.c-- + * rewriteManip.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/rewrite/rewriteRemove.c b/src/backend/rewrite/rewriteRemove.c index de606e9e73..bc3c2e10bf 100644 --- a/src/backend/rewrite/rewriteRemove.c +++ b/src/backend/rewrite/rewriteRemove.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteRemove.c-- + * rewriteRemove.c * routines for removing rewrite rules * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/rewrite/rewriteSupport.c b/src/backend/rewrite/rewriteSupport.c index cabdf64e3d..e8fb5e75f1 100644 --- a/src/backend/rewrite/rewriteSupport.c +++ b/src/backend/rewrite/rewriteSupport.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteSupport.c-- + * rewriteSupport.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/buffer/buf_init.c b/src/backend/storage/buffer/buf_init.c index dd2dd05549..dc8ec22f8e 100644 --- a/src/backend/storage/buffer/buf_init.c +++ b/src/backend/storage/buffer/buf_init.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * buf_init.c-- + * buf_init.c * buffer manager initialization routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/buffer/buf_table.c b/src/backend/storage/buffer/buf_table.c index 16346f5df3..0e32b09756 100644 --- a/src/backend/storage/buffer/buf_table.c +++ b/src/backend/storage/buffer/buf_table.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * buf_table.c-- + * buf_table.c * routines for finding buffers in the buffer pool. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/buffer/bufmgr.c b/src/backend/storage/buffer/bufmgr.c index 25bfb15e98..4a5f9fa641 100644 --- a/src/backend/storage/buffer/bufmgr.c +++ b/src/backend/storage/buffer/bufmgr.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bufmgr.c-- + * bufmgr.c * buffer manager interface routines * * Copyright (c) 1994, Regents of the University of California @@ -161,7 +161,7 @@ extern int ShowPinTrace; * defined */ /* - * ReadBuffer -- + * ReadBuffer * */ Buffer @@ -666,7 +666,7 @@ BufferAlloc(Relation reln, } /* - * WriteBuffer-- + * WriteBuffer * * Pushes buffer contents to disk if WriteMode is BUFFER_FLUSH_WRITE. * Otherwise, marks contents as dirty. @@ -1116,7 +1116,7 @@ WaitIO(BufferDesc *buf, SPINLOCK spinlock) } /* - * SignalIO -- + * SignalIO */ static void SignalIO(BufferDesc *buf) @@ -1245,7 +1245,7 @@ FlushBufferPool(int StableMainMemoryFlag) } /* - * BufferGetBlockNumber -- + * BufferGetBlockNumber * Returns the block number associated with a buffer. * * Note: @@ -1265,7 +1265,7 @@ BufferGetBlockNumber(Buffer buffer) #ifdef NOT_USED /* - * BufferGetRelation -- + * BufferGetRelation * Returns the relation desciptor associated with a buffer. * * Note: @@ -1362,7 +1362,7 @@ BufferReplace(BufferDesc *bufHdr, bool bufferLockHeld) } /* - * RelationGetNumberOfBlocks -- + * RelationGetNumberOfBlocks * Returns the buffer descriptor associated with a page in a relation. * * Note: diff --git a/src/backend/storage/buffer/freelist.c b/src/backend/storage/buffer/freelist.c index f8401d04b6..3700538ae5 100644 --- a/src/backend/storage/buffer/freelist.c +++ b/src/backend/storage/buffer/freelist.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * freelist.c-- + * freelist.c * routines for manipulating the buffer pool's replacement strategy * freelist. * @@ -55,7 +55,7 @@ extern SPINLOCK BufMgrLock; /* - * AddBufferToFreelist -- + * AddBufferToFreelist * * In theory, this is the only routine that needs to be changed * if the buffer replacement strategy changes. Just change diff --git a/src/backend/storage/buffer/localbuf.c b/src/backend/storage/buffer/localbuf.c index 012ed74c0b..219f9b8e35 100644 --- a/src/backend/storage/buffer/localbuf.c +++ b/src/backend/storage/buffer/localbuf.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * localbuf.c-- + * localbuf.c * local buffer manager. Fast buffer manager for temporary tables * or special cases when the operation is not visible to other backends. * diff --git a/src/backend/storage/buffer/s_lock.c b/src/backend/storage/buffer/s_lock.c index c635b617db..25b28dd975 100644 --- a/src/backend/storage/buffer/s_lock.c +++ b/src/backend/storage/buffer/s_lock.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * s_lock.c-- + * s_lock.c * buffer manager interface routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/file/fd.c b/src/backend/storage/file/fd.c index cbee38e2d3..e1e58a0351 100644 --- a/src/backend/storage/file/fd.c +++ b/src/backend/storage/file/fd.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fd.c-- + * fd.c * Virtual file descriptor code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/ipc/ipc.c b/src/backend/storage/ipc/ipc.c index 76bd45d143..83e6eed76d 100644 --- a/src/backend/storage/ipc/ipc.c +++ b/src/backend/storage/ipc/ipc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ipc.c-- + * ipc.c * POSTGRES inter-process communication definitions. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/ipc/ipci.c b/src/backend/storage/ipc/ipci.c index 6e802f8bb6..45647bee6e 100644 --- a/src/backend/storage/ipc/ipci.c +++ b/src/backend/storage/ipc/ipci.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ipci.c-- + * ipci.c * POSTGRES inter-process communication initialization code. * * Copyright (c) 1994, Regents of the University of California @@ -25,7 +25,7 @@ #include "miscadmin.h" /* for DebugLvl */ /* - * SystemPortAddressCreateMemoryKey -- + * SystemPortAddressCreateMemoryKey * Returns a memory key given a port address. */ IPCKey @@ -37,7 +37,7 @@ SystemPortAddressCreateIPCKey(SystemPortAddress address) } /* - * CreateSharedMemoryAndSemaphores -- + * CreateSharedMemoryAndSemaphores * Creates and initializes shared memory and semaphores. */ /************************************************** @@ -106,7 +106,7 @@ CreateSharedMemoryAndSemaphores(IPCKey key) /* - * AttachSharedMemoryAndSemaphores -- + * AttachSharedMemoryAndSemaphores * Attachs existant shared memory and semaphores. */ void diff --git a/src/backend/storage/ipc/shmem.c b/src/backend/storage/ipc/shmem.c index 52c343609b..e08b8749c7 100644 --- a/src/backend/storage/ipc/shmem.c +++ b/src/backend/storage/ipc/shmem.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * shmem.c-- + * shmem.c * create shared memory and initialize shared memory data structures. * * Copyright (c) 1994, Regents of the University of California @@ -107,7 +107,7 @@ ShmemIndexReset(void) } /* - * CreateSharedRegion() -- + * CreateSharedRegion() * * This routine is called once by the postmaster to * initialize the shared buffer pool. Assume there is diff --git a/src/backend/storage/ipc/shmqueue.c b/src/backend/storage/ipc/shmqueue.c index c9db888779..2d6722a004 100644 --- a/src/backend/storage/ipc/shmqueue.c +++ b/src/backend/storage/ipc/shmqueue.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * shmqueue.c-- + * shmqueue.c * shared memory linked lists * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/ipc/sinval.c b/src/backend/storage/ipc/sinval.c index 60ef9b1379..82505ee583 100644 --- a/src/backend/storage/ipc/sinval.c +++ b/src/backend/storage/ipc/sinval.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sinval.c-- + * sinval.c * POSTGRES shared cache invalidation communication code. * * Copyright (c) 1994, Regents of the University of California @@ -87,7 +87,7 @@ InitSharedInvalidationState(void) } /* - * RegisterSharedInvalid -- + * RegisterSharedInvalid * Returns a new local cache invalidation state containing a new entry. * * Note: @@ -147,7 +147,7 @@ RegisterSharedInvalid(int cacheId, /* XXX */ } /* - * InvalidateSharedInvalid -- + * InvalidateSharedInvalid * Processes all entries in a shared cache invalidation state. */ /****************************************************************************/ diff --git a/src/backend/storage/ipc/sinvaladt.c b/src/backend/storage/ipc/sinvaladt.c index 1de29871c8..1396e5aa3d 100644 --- a/src/backend/storage/ipc/sinvaladt.c +++ b/src/backend/storage/ipc/sinvaladt.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sinvaladt.c-- + * sinvaladt.c * POSTGRES shared cache invalidation segment definitions. * * Copyright (c) 1994, Regents of the University of California @@ -193,7 +193,7 @@ SISetDeadProcess(SISeg *segP, int backendId) } /* - * CleanupInvalidationState -- + * CleanupInvalidationState * Note: * This is a temporary hack. ExitBackend should call this instead * of exit (via on_shmem_exit). diff --git a/src/backend/storage/ipc/spin.c b/src/backend/storage/ipc/spin.c index 5dc76c8422..6e012560f4 100644 --- a/src/backend/storage/ipc/spin.c +++ b/src/backend/storage/ipc/spin.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * spin.c-- + * spin.c * routines for managing spin locks * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/large_object/inv_api.c b/src/backend/storage/large_object/inv_api.c index 6253fccff1..1f91afdca4 100644 --- a/src/backend/storage/large_object/inv_api.c +++ b/src/backend/storage/large_object/inv_api.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * inv_api.c-- + * inv_api.c * routines for manipulating inversion fs large objects. This file * contains the user-level large object application interface routines. * @@ -563,7 +563,7 @@ inv_write(LargeObjectDesc *obj_desc, char *buf, int nbytes) } /* - * inv_cleanindex -- + * inv_cleanindex * Clean opened indexes for large objects, and clears current result. * This is necessary on transaction commit in order to prevent buffer * leak. diff --git a/src/backend/storage/lmgr/lmgr.c b/src/backend/storage/lmgr/lmgr.c index 1f46f33bf5..5d9139be16 100644 --- a/src/backend/storage/lmgr/lmgr.c +++ b/src/backend/storage/lmgr/lmgr.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lmgr.c-- + * lmgr.c * POSTGRES lock manager code * * Copyright (c) 1994, Regents of the University of California @@ -129,7 +129,7 @@ InitLockTable() } /* - * RelationInitLockInfo -- + * RelationInitLockInfo * Initializes the lock information in a relation descriptor. */ void diff --git a/src/backend/storage/lmgr/lock.c b/src/backend/storage/lmgr/lock.c index 241d250ae1..ee1e60d434 100644 --- a/src/backend/storage/lmgr/lock.c +++ b/src/backend/storage/lmgr/lock.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lock.c-- + * lock.c * simple lock acquisition * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/lmgr/multi.c b/src/backend/storage/lmgr/multi.c index d80869c9a6..90466bd3f8 100644 --- a/src/backend/storage/lmgr/multi.c +++ b/src/backend/storage/lmgr/multi.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * multi.c-- + * multi.c * multi level lock table manager * * Standard multi-level lock manager as per the Gray paper diff --git a/src/backend/storage/lmgr/proc.c b/src/backend/storage/lmgr/proc.c index 1659bf3c2c..829bd639da 100644 --- a/src/backend/storage/lmgr/proc.c +++ b/src/backend/storage/lmgr/proc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * proc.c-- + * proc.c * routines to manage per-process shared memory data structure * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/lmgr/single.c b/src/backend/storage/lmgr/single.c index edb1fa0ec7..0a3d4706b7 100644 --- a/src/backend/storage/lmgr/single.c +++ b/src/backend/storage/lmgr/single.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * single.c-- + * single.c * set single locks in the multi-level lock hierarchy * * Sometimes we don't want to set all levels of the multi-level diff --git a/src/backend/storage/page/bufpage.c b/src/backend/storage/page/bufpage.c index 5d32347a7f..f9d4da51d5 100644 --- a/src/backend/storage/page/bufpage.c +++ b/src/backend/storage/page/bufpage.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bufpage.c-- + * bufpage.c * POSTGRES standard buffer page code. * * Copyright (c) 1994, Regents of the University of California @@ -35,7 +35,7 @@ static bool PageManagerShuffle = true; /* default is shuffle mode */ */ /* - * PageInit -- + * PageInit * Initializes the contents of a page. */ void @@ -56,7 +56,7 @@ PageInit(Page page, Size pageSize, Size specialSize) } /* - * PageAddItem -- + * PageAddItem * Adds item to the given page. * * Note: @@ -174,7 +174,7 @@ PageAddItem(Page page, } /* - * PageGetTempPage -- + * PageGetTempPage * Get a temporary page in local memory for special processing */ Page @@ -207,7 +207,7 @@ PageGetTempPage(Page page, Size specialSize) } /* - * PageRestoreTempPage -- + * PageRestoreTempPage * Copy temporary page back to permanent page after special processing * and release the temporary page. */ @@ -246,7 +246,7 @@ itemidcompare(const void *itemidp1, const void *itemidp2) } /* - * PageRepairFragmentation -- + * PageRepairFragmentation * Frees fragmented space on a page. */ void @@ -327,7 +327,7 @@ PageRepairFragmentation(Page page) } /* - * PageGetFreeSpace -- + * PageGetFreeSpace * Returns the size of the free (allocatable) space on a page. */ Size @@ -346,7 +346,7 @@ PageGetFreeSpace(Page page) } /* - * PageManagerModeSet -- + * PageManagerModeSet * * Sets mode to either: ShufflePageManagerMode (the default) or * OverwritePageManagerMode. For use by access methods code diff --git a/src/backend/storage/page/itemptr.c b/src/backend/storage/page/itemptr.c index 89c4aea286..49b03f1ed2 100644 --- a/src/backend/storage/page/itemptr.c +++ b/src/backend/storage/page/itemptr.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * itemptr.c-- + * itemptr.c * POSTGRES disk item pointer code. * * Copyright (c) 1994, Regents of the University of California @@ -19,7 +19,7 @@ #include "storage/bufpage.h" /* - * ItemPointerEquals -- + * ItemPointerEquals * Returns true if both item pointers point to the same item, * otherwise returns false. * diff --git a/src/backend/storage/smgr/md.c b/src/backend/storage/smgr/md.c index 5cad1ca197..c397764d3b 100644 --- a/src/backend/storage/smgr/md.c +++ b/src/backend/storage/smgr/md.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * md.c-- + * md.c * This code manages relations that reside on magnetic disk. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/storage/smgr/mm.c b/src/backend/storage/smgr/mm.c index 32793e14d3..3731a61aaf 100644 --- a/src/backend/storage/smgr/mm.c +++ b/src/backend/storage/smgr/mm.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * mm.c-- + * mm.c * main memory storage manager * * This code manages relations that reside in (presumably stable) diff --git a/src/backend/storage/smgr/smgr.c b/src/backend/storage/smgr/smgr.c index 882184de00..30369c1788 100644 --- a/src/backend/storage/smgr/smgr.c +++ b/src/backend/storage/smgr/smgr.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * smgr.c-- + * smgr.c * public interface routines to storage manager switch. * * All file system operations in POSTGRES dispatch through these diff --git a/src/backend/storage/smgr/smgrtype.c b/src/backend/storage/smgr/smgrtype.c index a6b7c753ef..5b1efbfa3d 100644 --- a/src/backend/storage/smgr/smgrtype.c +++ b/src/backend/storage/smgr/smgrtype.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * smgrtype.c-- + * smgrtype.c * storage manager type * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/tcop/dest.c b/src/backend/tcop/dest.c index 0ddf8e6806..9be1cb2336 100644 --- a/src/backend/tcop/dest.c +++ b/src/backend/tcop/dest.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dest.c-- + * dest.c * support for various communication destinations - see include/tcop/dest.h * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/tcop/fastpath.c b/src/backend/tcop/fastpath.c index a69c1c32d0..49a7b46c5c 100644 --- a/src/backend/tcop/fastpath.c +++ b/src/backend/tcop/fastpath.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fastpath.c-- + * fastpath.c * routines to handle function requests from the frontend * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/tcop/postgres.c b/src/backend/tcop/postgres.c index 943c6b1610..4f7e5a0cbd 100644 --- a/src/backend/tcop/postgres.c +++ b/src/backend/tcop/postgres.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * postgres.c-- + * postgres.c * POSTGRES C Backend Interface * * Copyright (c) 1994, Regents of the University of California @@ -1538,7 +1538,7 @@ PostgresMain(int argc, char *argv[], int real_argc, char *real_argv[]) if (!IsUnderPostmaster) { puts("\nPOSTGRES backend interactive interface "); - puts("$Revision: 1.98 $ $Date: 1999/02/02 03:44:51 $\n"); + puts("$Revision: 1.99 $ $Date: 1999/02/13 23:18:45 $\n"); } /* ---------------- diff --git a/src/backend/tcop/pquery.c b/src/backend/tcop/pquery.c index ba7782c313..433a693fd5 100644 --- a/src/backend/tcop/pquery.c +++ b/src/backend/tcop/pquery.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pquery.c-- + * pquery.c * POSTGRES process query command code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/tcop/utility.c b/src/backend/tcop/utility.c index 7ef61008f7..1bb1a471b4 100644 --- a/src/backend/tcop/utility.c +++ b/src/backend/tcop/utility.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * utility.c-- + * utility.c * Contains functions which control the execution of the POSTGRES utility * commands. At one time acted as an interface between the Lisp and C * systems. diff --git a/src/backend/tioga/Varray.c b/src/backend/tioga/Varray.c index 3a8ca43462..944b7766d8 100644 --- a/src/backend/tioga/Varray.c +++ b/src/backend/tioga/Varray.c @@ -1,6 +1,6 @@ /* ************************************************************************ * - * Varray.c -- + * Varray.c * * routines to provide a generic set of functions to handle variable sized * arrays. originally by Jiang Wu diff --git a/src/backend/tioga/tgRecipe.c b/src/backend/tioga/tgRecipe.c index f19dd63807..7a16b1a9ba 100644 --- a/src/backend/tioga/tgRecipe.c +++ b/src/backend/tioga/tgRecipe.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tgRecipe.c-- + * tgRecipe.c * Tioga recipe-related definitions * these functions can be used in both the frontend and the * backend diff --git a/src/backend/tioga/tgRecipe.h b/src/backend/tioga/tgRecipe.h index d7e48687de..7abbcabdde 100644 --- a/src/backend/tioga/tgRecipe.h +++ b/src/backend/tioga/tgRecipe.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tgRecipe.h-- + * tgRecipe.h * Tioga recipe-related definitions and declarations * these functions can be used in both the frontend and the * backend @@ -114,7 +114,7 @@ typedef struct _tgrecipe { TgElement elmValue; /* "inherits" TgElement attributes. */ Arr_TgNodePtr *allNodes; /* array of all nodes for this recipe. */ - Arr_TgNodePtr *rootNodes; /* array of root nodes for this recipe. -- + Arr_TgNodePtr *rootNodes; /* array of root nodes for this recipe. * root nodes are nodes with no parents */ Arr_TgNodePtr *eyes; /* array of pointers for the browser nodes * recipe, execution of recipe starts by diff --git a/src/backend/utils/adt/acl.c b/src/backend/utils/adt/acl.c index 2476b5ea21..f54d2e217c 100644 --- a/src/backend/utils/adt/acl.c +++ b/src/backend/utils/adt/acl.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * acl.c-- + * acl.c * Basic access control list data structures manipulation routines. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/arrayfuncs.c b/src/backend/utils/adt/arrayfuncs.c index 6bb7f4808a..da6e7cce5b 100644 --- a/src/backend/utils/adt/arrayfuncs.c +++ b/src/backend/utils/adt/arrayfuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * arrayfuncs.c-- + * arrayfuncs.c * Special functions for arrays. * * Copyright (c) 1994, Regents of the University of California @@ -244,7 +244,7 @@ array_in(char *string, /* input array in external form */ } /*----------------------------------------------------------------------------- - * _ArrayCount -- + * _ArrayCount * Counts the number of dimensions and the *dim array for an array string. * The syntax for array input is C-like nested curly braces *----------------------------------------------------------------------------- diff --git a/src/backend/utils/adt/arrayutils.c b/src/backend/utils/adt/arrayutils.c index 9e8d5abc73..a049e6b41f 100644 --- a/src/backend/utils/adt/arrayutils.c +++ b/src/backend/utils/adt/arrayutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * arrayutils.c-- + * arrayutils.c * This file contains some support routines required for array functions. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/bool.c b/src/backend/utils/adt/bool.c index 6c5496dd96..0195276f9c 100644 --- a/src/backend/utils/adt/bool.c +++ b/src/backend/utils/adt/bool.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bool.c-- + * bool.c * Functions for the built-in type "bool". * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/char.c b/src/backend/utils/adt/char.c index 57e17b6c6c..2689bb7b11 100644 --- a/src/backend/utils/adt/char.c +++ b/src/backend/utils/adt/char.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * char.c-- + * char.c * Functions for the built-in type "char". * Functions for the built-in type "cid". * diff --git a/src/backend/utils/adt/chunk.c b/src/backend/utils/adt/chunk.c index 2f3b6c9642..4fa25f4169 100644 --- a/src/backend/utils/adt/chunk.c +++ b/src/backend/utils/adt/chunk.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * chunk.c-- + * chunk.c * * Copyright (c) 1994, Regents of the University of California * @@ -115,7 +115,7 @@ _ChunkArray(int fd, } /*-------------------------------------------------------------------------- - * GetChunkSize -- + * GetChunkSize * given an access pattern and array dimensionality etc, this program * returns the dimensions of the chunk in "d" *----------------------------------------------------------------------- @@ -160,7 +160,7 @@ GetChunkSize(FILE *fd, } /*------------------------------------------------------------------------- - * _FindBestChunk -- + * _FindBestChunk * This routine does most of the number crunching to compute the * optimal chunk shape. * Called by GetChunkSize @@ -213,7 +213,7 @@ _FindBestChunk(int size, } /*---------------------------------------------------------------------- - * get_next -- + * get_next * Called by _GetBestChunk to get the next tuple in the lexicographic order *--------------------------------------------------------------------- */ @@ -420,7 +420,7 @@ seek_and_read(int pos, int size, char *buff, int fp, int from) #endif /* LOARRAY */ /*---------------------------------------------------------------------------- - * _ReadChunkArray -- + * _ReadChunkArray * returns the subarray specified bu the range indices "st" and "endp" * from the chunked array stored in file "fp" *--------------------------------------------------------------------------- @@ -620,7 +620,7 @@ _ReadChunkArray(int *st, } /*------------------------------------------------------------------------ - * _ReadChunkArray1El -- + * _ReadChunkArray1El * returns one element of the chunked array as specified by the index "st" * the chunked file descriptor is "fp" *------------------------------------------------------------------------- diff --git a/src/backend/utils/adt/date.c b/src/backend/utils/adt/date.c index e55d1d5eb2..58d14e3eea 100644 --- a/src/backend/utils/adt/date.c +++ b/src/backend/utils/adt/date.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * date.c-- + * date.c * Utilities for the built-in type "AbsoluteTime" (defined in nabstime). * Functions for the built-in type "RelativeTime". * Functions for the built-in type "TimeInterval". diff --git a/src/backend/utils/adt/datetime.c b/src/backend/utils/adt/datetime.c index f55caaf0d9..baed577e78 100644 --- a/src/backend/utils/adt/datetime.c +++ b/src/backend/utils/adt/datetime.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * datetime.c-- + * datetime.c * implements DATE and TIME data types specified in SQL-92 standard * * Copyright (c) 1994-5, Regents of the University of California diff --git a/src/backend/utils/adt/datum.c b/src/backend/utils/adt/datum.c index 9f2e610876..548ed96ca0 100644 --- a/src/backend/utils/adt/datum.c +++ b/src/backend/utils/adt/datum.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * datum.c-- + * datum.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/utils/adt/dt.c b/src/backend/utils/adt/dt.c index e95a25fe3d..4de2443341 100644 --- a/src/backend/utils/adt/dt.c +++ b/src/backend/utils/adt/dt.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dt.c-- + * dt.c * Functions for the built-in type "dt". * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/filename.c b/src/backend/utils/adt/filename.c index a21db007b2..3e37395101 100644 --- a/src/backend/utils/adt/filename.c +++ b/src/backend/utils/adt/filename.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * filename.c-- + * filename.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/float.c b/src/backend/utils/adt/float.c index b00aac76fc..f82f692002 100644 --- a/src/backend/utils/adt/float.c +++ b/src/backend/utils/adt/float.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * float.c-- + * float.c * Functions for the built-in floating-point types. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/geo_ops.c b/src/backend/utils/adt/geo_ops.c index 42519b7ecf..bcc3fa6355 100644 --- a/src/backend/utils/adt/geo_ops.c +++ b/src/backend/utils/adt/geo_ops.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geo_ops.c-- + * geo_ops.c * 2D geometric operations * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/geo_selfuncs.c b/src/backend/utils/adt/geo_selfuncs.c index 057c9df386..382ead896f 100644 --- a/src/backend/utils/adt/geo_selfuncs.c +++ b/src/backend/utils/adt/geo_selfuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geo-selfuncs.c-- + * geo-selfuncs.c * Selectivity routines registered in the operator catalog in the * "oprrest" and "oprjoin" attributes. * diff --git a/src/backend/utils/adt/int.c b/src/backend/utils/adt/int.c index d78b4a5425..08c7cf6402 100644 --- a/src/backend/utils/adt/int.c +++ b/src/backend/utils/adt/int.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * int.c-- + * int.c * Functions for the built-in integer types. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/int8.c b/src/backend/utils/adt/int8.c index 1b02022594..e3506b2d91 100644 --- a/src/backend/utils/adt/int8.c +++ b/src/backend/utils/adt/int8.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * int8.c-- + * int8.c * Internal 64-bit integer operations * *------------------------------------------------------------------------- diff --git a/src/backend/utils/adt/like.c b/src/backend/utils/adt/like.c index eb764e7c01..1b2b9cc1c5 100644 --- a/src/backend/utils/adt/like.c +++ b/src/backend/utils/adt/like.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * like.c-- + * like.c * like expression handling code. * * Copyright (c) 1994, Regents of the University of California @@ -111,7 +111,7 @@ textnlike(struct varlena * s, struct varlena * p) } -/* $Revision: 1.20 $ +/* $Revision: 1.21 $ ** "like.c" A first attempt at a LIKE operator for Postgres95. ** ** Originally written by Rich $alz, mirror!rs, Wed Nov 26 19:03:17 EST 1986. diff --git a/src/backend/utils/adt/misc.c b/src/backend/utils/adt/misc.c index 878136a970..16ba7a6407 100644 --- a/src/backend/utils/adt/misc.c +++ b/src/backend/utils/adt/misc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * misc.c-- + * misc.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/nabstime.c b/src/backend/utils/adt/nabstime.c index 69d7284b80..2875213ac8 100644 --- a/src/backend/utils/adt/nabstime.c +++ b/src/backend/utils/adt/nabstime.c @@ -1,5 +1,5 @@ /* - * nabstime.c-- + * nabstime.c * parse almost any absolute date getdate(3) can (& some it can't) * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/name.c b/src/backend/utils/adt/name.c index afc8a1000b..3cefa7b484 100644 --- a/src/backend/utils/adt/name.c +++ b/src/backend/utils/adt/name.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * name.c-- + * name.c * Functions for the built-in type "name". * name replaces char16 and is carefully implemented so that it * is a string of length NAMEDATALEN. DO NOT use hard-coded constants anywhere diff --git a/src/backend/utils/adt/not_in.c b/src/backend/utils/adt/not_in.c index 3c38533c39..4ff86afc6a 100644 --- a/src/backend/utils/adt/not_in.c +++ b/src/backend/utils/adt/not_in.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * not_in.c-- + * not_in.c * Executes the "not_in" operator for any data type * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/numeric.c b/src/backend/utils/adt/numeric.c index b056e505b0..dcd32d73c8 100644 --- a/src/backend/utils/adt/numeric.c +++ b/src/backend/utils/adt/numeric.c @@ -1,5 +1,5 @@ /* ---------- - * numeric.c - + * numeric.c * * An exact numeric data type for the Postgres database system * diff --git a/src/backend/utils/adt/numutils.c b/src/backend/utils/adt/numutils.c index 81b1427182..1cbaffcda6 100644 --- a/src/backend/utils/adt/numutils.c +++ b/src/backend/utils/adt/numutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * numutils.c-- + * numutils.c * utility functions for I/O of built-in numeric types. * * integer: itoa, ltoa diff --git a/src/backend/utils/adt/oid.c b/src/backend/utils/adt/oid.c index d93b3c44bf..cc88ba29e6 100644 --- a/src/backend/utils/adt/oid.c +++ b/src/backend/utils/adt/oid.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * oid.c-- + * oid.c * Functions for the built-in type Oid. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/regexp.c b/src/backend/utils/adt/regexp.c index dac92daf4e..eb3d2ec237 100644 --- a/src/backend/utils/adt/regexp.c +++ b/src/backend/utils/adt/regexp.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * regexp.c-- + * regexp.c * regular expression handling code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/regproc.c b/src/backend/utils/adt/regproc.c index 39922fff59..b92085fe11 100644 --- a/src/backend/utils/adt/regproc.c +++ b/src/backend/utils/adt/regproc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * regproc.c-- + * regproc.c * Functions for the built-in type "RegProcedure". * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/selfuncs.c b/src/backend/utils/adt/selfuncs.c index e7114b7f44..03aac0d4f4 100644 --- a/src/backend/utils/adt/selfuncs.c +++ b/src/backend/utils/adt/selfuncs.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * selfuncs.c-- + * selfuncs.c * Selectivity functions for system catalogs and builtin types * * These routines are registered in the operator catalog in the diff --git a/src/backend/utils/adt/sets.c b/src/backend/utils/adt/sets.c index 8acb54df37..7f56ff1898 100644 --- a/src/backend/utils/adt/sets.c +++ b/src/backend/utils/adt/sets.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sets.c-- + * sets.c * Functions for sets, which are defined by queries. * Example: a set is defined as being the result of the query * retrieve (X.all) diff --git a/src/backend/utils/adt/tid.c b/src/backend/utils/adt/tid.c index fdc05390e7..741a844ef5 100644 --- a/src/backend/utils/adt/tid.c +++ b/src/backend/utils/adt/tid.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tid.c-- + * tid.c * Functions for the built-in type tuple id * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/varchar.c b/src/backend/utils/adt/varchar.c index b2d0e1b27d..1a62cebde0 100644 --- a/src/backend/utils/adt/varchar.c +++ b/src/backend/utils/adt/varchar.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * varchar.c-- + * varchar.c * Functions for the built-in type char() and varchar(). * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/varlena.c b/src/backend/utils/adt/varlena.c index 4bd661a429..ab0422263f 100644 --- a/src/backend/utils/adt/varlena.c +++ b/src/backend/utils/adt/varlena.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * varlena.c-- + * varlena.c * Functions for the variable-length built-in types. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/adt/version.c b/src/backend/utils/adt/version.c index 9288bfa68e..16c691d83a 100644 --- a/src/backend/utils/adt/version.c +++ b/src/backend/utils/adt/version.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * version.c-- + * version.c * Returns the version string * * IDENTIFICATION diff --git a/src/backend/utils/cache/catcache.c b/src/backend/utils/cache/catcache.c index 373c3fd7e5..8f880bdf00 100644 --- a/src/backend/utils/cache/catcache.c +++ b/src/backend/utils/cache/catcache.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * catcache.c-- + * catcache.c * System catalog cache for tuples matching a key. * * Copyright (c) 1994, Regents of the University of California @@ -277,7 +277,7 @@ CatalogCacheSetId(CatCache *cacheInOutP, int id) #endif /* ---------------- - * comphash -- + * comphash * Compute a hash value, somehow. * * XXX explain algorithm here. diff --git a/src/backend/utils/cache/fcache.c b/src/backend/utils/cache/fcache.c index c3da0c9391..56a065acab 100644 --- a/src/backend/utils/cache/fcache.c +++ b/src/backend/utils/cache/fcache.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fcache.c-- + * fcache.c * Code for the 'function cache' used in Oper and Func nodes.... * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/cache/inval.c b/src/backend/utils/cache/inval.c index 086faaa42f..c1c91135ac 100644 --- a/src/backend/utils/cache/inval.c +++ b/src/backend/utils/cache/inval.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * inval.c-- + * inval.c * POSTGRES cache invalidation dispatcher code. * * Copyright (c) 1994, Regents of the University of California @@ -90,7 +90,7 @@ Oid MyAMOPRelationId = InvalidOid; */ /* -------------------------------- - * InvalidationEntryAllocate-- + * InvalidationEntryAllocate * Allocates an invalidation entry. * -------------------------------- */ @@ -106,7 +106,7 @@ InvalidationEntryAllocate(uint16 size) } /* -------------------------------- - * LocalInvalidRegister -- + * LocalInvalidRegister * Returns a new local cache invalidation state containing a new entry. * -------------------------------- */ @@ -123,7 +123,7 @@ LocalInvalidRegister(LocalInvalid invalid, } /* -------------------------------- - * LocalInvalidInvalidate-- + * LocalInvalidInvalidate * Processes, then frees all entries in a local cache * invalidation state. * -------------------------------- @@ -504,7 +504,7 @@ InitLocalInvalidateData() /* - * DiscardInvalid -- + * DiscardInvalid * Causes the invalidated cache state to be discarded. * * Note: @@ -527,7 +527,7 @@ DiscardInvalid() } /* - * RegisterInvalid -- + * RegisterInvalid * Causes registration of invalidated state with other backends iff true. * * Note: @@ -559,7 +559,7 @@ RegisterInvalid(bool send) } /* - * RelationIdInvalidateHeapTuple -- + * RelationIdInvalidateHeapTuple * Causes the given tuple in a relation to be invalidated. * * Note: diff --git a/src/backend/utils/cache/lsyscache.c b/src/backend/utils/cache/lsyscache.c index ad396c935e..63b9c128d1 100644 --- a/src/backend/utils/cache/lsyscache.c +++ b/src/backend/utils/cache/lsyscache.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lsyscache.c-- + * lsyscache.c * Routines to access information within system caches * * Copyright (c) 1994, Regents of the University of California @@ -253,7 +253,7 @@ op_mergejoinable(Oid opno, Oid ltype, Oid rtype, Oid *leftOp, Oid *rightOp) } /* - * op_hashjoinable-- + * op_hashjoinable * * Returns the hash operator corresponding to a hashjoinable operator, * or nil if the operator is not hashjoinable. diff --git a/src/backend/utils/cache/rel.c b/src/backend/utils/cache/rel.c index f7e836c65c..1994cb7c6d 100644 --- a/src/backend/utils/cache/rel.c +++ b/src/backend/utils/cache/rel.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rel.c-- + * rel.c * POSTGRES relation descriptor code. * * Copyright (c) 1994, Regents of the University of California @@ -29,7 +29,7 @@ */ /* - * RelationGetIndexStrategy -- + * RelationGetIndexStrategy * Returns index strategy for a relation. * * Note: @@ -43,7 +43,7 @@ RelationGetIndexStrategy(Relation relation) } /* - * RelationSetIndexSupport -- + * RelationSetIndexSupport * Sets index strategy and support info for a relation. * * Note: diff --git a/src/backend/utils/cache/relcache.c b/src/backend/utils/cache/relcache.c index 977d6ffb23..3830c3b426 100644 --- a/src/backend/utils/cache/relcache.c +++ b/src/backend/utils/cache/relcache.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * relcache.c-- + * relcache.c * POSTGRES relation descriptor cache code * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/cache/syscache.c b/src/backend/utils/cache/syscache.c index abe76024c1..2a6047ae91 100644 --- a/src/backend/utils/cache/syscache.c +++ b/src/backend/utils/cache/syscache.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * syscache.c-- + * syscache.c * System cache management routines * * Copyright (c) 1994, Regents of the University of California @@ -392,7 +392,7 @@ static int32 SysCacheSize = lengthof(cacheinfo); /* - * zerocaches-- + * zerocaches * * Make sure the SysCache structure is zero'd. */ @@ -439,7 +439,7 @@ InitCatalogCache() } /* - * SearchSysCacheTupleCopy-- + * SearchSysCacheTupleCopy * * THis is like SearchSysCacheTuple, except it returns a copy of the tuple * that the user is required to pfree(). @@ -462,7 +462,7 @@ SearchSysCacheTupleCopy(int cacheId, /* cache selection code */ /* - * SearchSysCacheTuple-- + * SearchSysCacheTuple * * A layer on top of SearchSysCache that does the initialization and * key-setting for you. @@ -519,7 +519,7 @@ SearchSysCacheTuple(int cacheId,/* cache selection code */ } /* - * SearchSysCacheStruct-- + * SearchSysCacheStruct * Fills 's' with the information retrieved by calling SearchSysCache() * with arguments key1...key4. Retrieves only the portion of the tuple * which is not variable-length. @@ -553,7 +553,7 @@ SearchSysCacheStruct(int cacheId, /* cache selection code */ /* - * SearchSysCacheGetAttribute-- + * SearchSysCacheGetAttribute * Returns the attribute corresponding to 'attributeNumber' for * a given cached tuple. * @@ -647,7 +647,7 @@ SearchSysCacheGetAttribute(int cacheId, } /* - * TypeDefaultRetrieve-- + * TypeDefaultRetrieve * * Given a type OID, return the typdefault field associated with that * type. The typdefault is returned as the car of a dotted pair which diff --git a/src/backend/utils/cache/temprel.c b/src/backend/utils/cache/temprel.c index c1ceefa704..5fdf59c0fd 100644 --- a/src/backend/utils/cache/temprel.c +++ b/src/backend/utils/cache/temprel.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * temprel.c-- + * temprel.c * POSTGRES temporary relation handling * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/error/assert.c b/src/backend/utils/error/assert.c index d4adefd459..d8baf67ac6 100644 --- a/src/backend/utils/error/assert.c +++ b/src/backend/utils/error/assert.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * assert.c-- + * assert.c * Assert code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/error/elog.c b/src/backend/utils/error/elog.c index 2678082de8..2bb0675b61 100644 --- a/src/backend/utils/error/elog.c +++ b/src/backend/utils/error/elog.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * elog.c-- + * elog.c * error logger * * Copyright (c) 1994, Regents of the University of California @@ -53,7 +53,7 @@ static int Err_file = -1; static int ElogDebugIndentLevel = 0; /* - * elog -- + * elog * Old error logging function. */ void @@ -165,7 +165,7 @@ elog(int lev, const char *fmt,...) * front-end program, write to it first. This is important because * there's a bug in the socket code on ultrix. If the front end has * gone away (so the channel to it has been closed at the other end), - * then writing here can cause this backend to exit without warning -- + * then writing here can cause this backend to exit without warning * that is, write() does an exit(). In this case, our only hope of * finding out what's going on is if Err_file was set to some disk * log. This is a major pain. diff --git a/src/backend/utils/error/exc.c b/src/backend/utils/error/exc.c index 31837ae6c1..3d2300e1fd 100644 --- a/src/backend/utils/error/exc.c +++ b/src/backend/utils/error/exc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * exc.c-- + * exc.c * POSTGRES exception handling code. * * Copyright (c) 1994, Regents of the University of California @@ -48,7 +48,7 @@ extern char *ProgramName; */ /* - * EnableExceptionHandling -- + * EnableExceptionHandling * Enables/disables the exception handling system. * * Note: diff --git a/src/backend/utils/error/excabort.c b/src/backend/utils/error/excabort.c index 55dd7051f2..20e748698b 100644 --- a/src/backend/utils/error/excabort.c +++ b/src/backend/utils/error/excabort.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * excabort.c-- + * excabort.c * Default exception abort code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/error/excid.c b/src/backend/utils/error/excid.c index 16f1be10ba..b3b68afe67 100644 --- a/src/backend/utils/error/excid.c +++ b/src/backend/utils/error/excid.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * excid.c-- + * excid.c * POSTGRES known exception identifier code. * * Copyright (c) 1994, Regents of the University of California @@ -22,19 +22,19 @@ /* - * FailedAssertion -- + * FailedAssertion * Indicates an Assert(...) failed. */ Exception FailedAssertion = {"Failed Assertion"}; /* - * BadState -- + * BadState * Indicates a function call request is inconsistent with module state. */ Exception BadState = {"Bad State for Function Call"}; /* - * BadArg -- + * BadArg * Indicates a function call argument or arguments is out-of-bounds. */ Exception BadArg = {"Bad Argument to Function Call"}; @@ -44,19 +44,19 @@ Exception BadArg = {"Bad Argument to Function Call"}; *****************************************************************************/ /* - * BadAllocSize -- + * BadAllocSize * Indicates that an allocation request is of unreasonable size. */ Exception BadAllocSize = {"Too Large Allocation Request"}; /* - * ExhaustedMemory -- + * ExhaustedMemory * Indicates an dynamic memory allocation failed. */ Exception ExhaustedMemory = {"Memory Allocation Failed"}; /* - * Unimplemented -- + * Unimplemented * Indicates a function call request requires unimplemented code. */ Exception Unimplemented = {"Unimplemented Functionality"}; diff --git a/src/backend/utils/error/format.c b/src/backend/utils/error/format.c index 526b882c31..6e8721f6f4 100644 --- a/src/backend/utils/error/format.c +++ b/src/backend/utils/error/format.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * format.c-- + * format.c * a wrapper around code that does what vsprintf does. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/fmgr/dfmgr.c b/src/backend/utils/fmgr/dfmgr.c index 69ed82770e..0b546f0ca1 100644 --- a/src/backend/utils/fmgr/dfmgr.c +++ b/src/backend/utils/fmgr/dfmgr.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dfmgr.c-- + * dfmgr.c * Dynamic function manager code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/fmgr/fmgr.c b/src/backend/utils/fmgr/fmgr.c index d795b99eef..ec89b8dd44 100644 --- a/src/backend/utils/fmgr/fmgr.c +++ b/src/backend/utils/fmgr/fmgr.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fmgr.c-- + * fmgr.c * Interface routines for the table-driven function manager. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/hash/dynahash.c b/src/backend/utils/hash/dynahash.c index f544879dbf..c3a55fac21 100644 --- a/src/backend/utils/hash/dynahash.c +++ b/src/backend/utils/hash/dynahash.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynahash.c-- + * dynahash.c * dynamic hashing * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/hash/hashfn.c b/src/backend/utils/hash/hashfn.c index c31edea6f5..465b34a8d1 100644 --- a/src/backend/utils/hash/hashfn.c +++ b/src/backend/utils/hash/hashfn.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashfn.c-- + * hashfn.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/init/enbl.c b/src/backend/utils/init/enbl.c index 57700b2d8b..2e146cb1a4 100644 --- a/src/backend/utils/init/enbl.c +++ b/src/backend/utils/init/enbl.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * enbl.c-- + * enbl.c * POSTGRES module enable and disable support code. * * Copyright (c) 1994, Regents of the University of California @@ -15,7 +15,7 @@ #include "utils/module.h" /* where the declarations go */ /* - * BypassEnable -- + * BypassEnable * False iff enable/disable processing is required given on and "*countP." * * Note: diff --git a/src/backend/utils/init/findbe.c b/src/backend/utils/init/findbe.c index e52f0dff92..f7d1ae5124 100644 --- a/src/backend/utils/init/findbe.c +++ b/src/backend/utils/init/findbe.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * findbe.c -- + * findbe.c * * Copyright (c) 1994, Regents of the University of California * diff --git a/src/backend/utils/init/globals.c b/src/backend/utils/init/globals.c index 4a83391688..3a3e82c806 100644 --- a/src/backend/utils/init/globals.c +++ b/src/backend/utils/init/globals.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * globals.c-- + * globals.c * global variable declarations * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/init/miscinit.c b/src/backend/utils/init/miscinit.c index cf9329bce1..facfee69ca 100644 --- a/src/backend/utils/init/miscinit.c +++ b/src/backend/utils/init/miscinit.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * miscinit.c-- + * miscinit.c * miscellanious initialization support stuff * * Copyright (c) 1994, Regents of the University of California @@ -39,7 +39,7 @@ #include "storage/fd.h" /* for O_ */ /* - * EnableAbortEnvVarName -- + * EnableAbortEnvVarName * Enables system abort iff set to a non-empty string in environment. */ #define EnableAbortEnvVarName "POSTGRESABORT" @@ -68,7 +68,7 @@ unsigned char RecodeBackTable[128]; */ /* - * ExitPostgres -- + * ExitPostgres * Exit POSTGRES with a status code. * * Note: @@ -88,7 +88,7 @@ ExitPostgres(ExitStatus status) } /* - * AbortPostgres -- + * AbortPostgres * Abort POSTGRES dumping core. * * Note: @@ -148,7 +148,7 @@ static ProcessingMode Mode = NoProcessing; #ifdef NOT_USED /* - * IsNoProcessingMode -- + * IsNoProcessingMode * True iff processing mode is NoProcessing. */ bool @@ -159,7 +159,7 @@ IsNoProcessingMode() #endif /* - * IsBootstrapProcessingMode -- + * IsBootstrapProcessingMode * True iff processing mode is BootstrapProcessing. */ bool @@ -169,7 +169,7 @@ IsBootstrapProcessingMode() } /* - * IsInitProcessingMode -- + * IsInitProcessingMode * True iff processing mode is InitProcessing. */ bool @@ -179,7 +179,7 @@ IsInitProcessingMode() } /* - * IsNormalProcessingMode -- + * IsNormalProcessingMode * True iff processing mode is NormalProcessing. */ bool @@ -189,7 +189,7 @@ IsNormalProcessingMode() } /* - * SetProcessingMode -- + * SetProcessingMode * Sets mode of processing as specified. * * Exceptions: diff --git a/src/backend/utils/init/postinit.c b/src/backend/utils/init/postinit.c index a9b0ad715c..34fe3c10c9 100644 --- a/src/backend/utils/init/postinit.c +++ b/src/backend/utils/init/postinit.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * postinit.c-- + * postinit.c * postgres initialization utilities * * Copyright (c) 1994, Regents of the University of California @@ -143,7 +143,7 @@ InitMyDatabaseInfo(char *name) /* - * DoChdirAndInitDatabaseNameAndPath -- + * DoChdirAndInitDatabaseNameAndPath * Set current directory to the database directory for the database * named <name>. * Also set global variables DatabasePath and DatabaseName to those @@ -415,7 +415,7 @@ InitStdio() } /* -------------------------------- - * InitPostgres -- + * InitPostgres * Initialize POSTGRES. * * Note: diff --git a/src/backend/utils/misc/database.c b/src/backend/utils/misc/database.c index bc7491458d..9caaef899a 100644 --- a/src/backend/utils/misc/database.c +++ b/src/backend/utils/misc/database.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * database.c-- + * database.c * miscellanious initialization support stuff * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/misc/superuser.c b/src/backend/utils/misc/superuser.c index 9e21d3afc1..dc0c9bbd89 100644 --- a/src/backend/utils/misc/superuser.c +++ b/src/backend/utils/misc/superuser.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * superuser.c-- + * superuser.c * * The superuser() function. Determines if user has superuser privilege. * diff --git a/src/backend/utils/misc/trace.c b/src/backend/utils/misc/trace.c index 5417243a8d..a9c4390a17 100644 --- a/src/backend/utils/misc/trace.c +++ b/src/backend/utils/misc/trace.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * trace.c-- + * trace.c * * Conditional trace ans logging functions. * diff --git a/src/backend/utils/mmgr/aset.c b/src/backend/utils/mmgr/aset.c index be3e150aaa..6f21dad758 100644 --- a/src/backend/utils/mmgr/aset.c +++ b/src/backend/utils/mmgr/aset.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * aset.c-- + * aset.c * Allocation set definitions. * * Copyright (c) 1994, Regents of the University of California @@ -88,7 +88,7 @@ AllocSetFreeIndex(Size size) */ /* - * AllocSetInit -- + * AllocSetInit * Initializes given allocation set. * * Note: @@ -116,7 +116,7 @@ AllocSetInit(AllocSet set, AllocMode mode, Size limit) /* - * AllocSetReset -- + * AllocSetReset * Frees memory which is allocated in the given set. * * Exceptions: @@ -141,7 +141,7 @@ AllocSetReset(AllocSet set) } /* - * AllocSetContains -- + * AllocSetContains * True iff allocation set contains given allocation element. * * Exceptions: @@ -158,7 +158,7 @@ AllocSetContains(AllocSet set, AllocPointer pointer) } /* - * AllocSetAlloc -- + * AllocSetAlloc * Returns pointer to allocated memory of given size; memory is added * to the set. * @@ -273,7 +273,7 @@ AllocSetAlloc(AllocSet set, Size size) } /* - * AllocSetFree -- + * AllocSetFree * Frees allocated memory; memory is removed from the set. * * Exceptions: @@ -299,7 +299,7 @@ AllocSetFree(AllocSet set, AllocPointer pointer) } /* - * AllocSetRealloc -- + * AllocSetRealloc * Returns new pointer to allocated memory of given size; this memory * is added to the set. Memory associated with given pointer is copied * into the new memory, and the old memory is freed. @@ -342,7 +342,7 @@ AllocSetRealloc(AllocSet set, AllocPointer pointer, Size size) } /* - * AllocSetDump -- + * AllocSetDump * Displays allocated set. */ void diff --git a/src/backend/utils/mmgr/mcxt.c b/src/backend/utils/mmgr/mcxt.c index 34295d698c..b7813d11c7 100644 --- a/src/backend/utils/mmgr/mcxt.c +++ b/src/backend/utils/mmgr/mcxt.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * mcxt.c-- + * mcxt.c * POSTGRES memory context code. * * Copyright (c) 1994, Regents of the University of California @@ -54,7 +54,7 @@ static OrderedSetData ActiveGlobalMemorySetData; /* uninitialized */ #define PSIZESPACE(LEN) ((LEN) + sizeof (int32)) /* - * AllocSizeIsValid -- + * AllocSizeIsValid * True iff 0 < size and size <= MaxAllocSize. */ #define AllocSizeIsValid(size) (0 < (size) && (size) <= MaxAllocSize) @@ -64,7 +64,7 @@ static OrderedSetData ActiveGlobalMemorySetData; /* uninitialized */ *****************************************************************************/ /* - * CurrentMemoryContext -- + * CurrentMemoryContext * Memory context for general global allocations. */ MemoryContext CurrentMemoryContext = NULL; @@ -113,7 +113,7 @@ static struct GlobalMemoryData TopGlobalMemoryData = { }; /* - * TopMemoryContext -- + * TopMemoryContext * Memory context for general global allocations. * * Note: @@ -131,7 +131,7 @@ MemoryContext TopMemoryContext = (MemoryContext) &TopGlobalMemoryData; */ /* - * EnableMemoryContext -- + * EnableMemoryContext * Enables/disables memory management and global contexts. * * Note: @@ -207,7 +207,7 @@ EnableMemoryContext(bool on) } /* - * MemoryContextAlloc -- + * MemoryContextAlloc * Returns pointer to aligned allocated memory in the given context. * * Note: @@ -231,7 +231,7 @@ MemoryContextAlloc(MemoryContext context, Size size) } /* - * MemoryContextFree -- + * MemoryContextFree * Frees allocated memory referenced by pointer in the given context. * * Note: @@ -252,7 +252,7 @@ MemoryContextFree(MemoryContext context, Pointer pointer) } /* - * MemoryContextRelloc -- + * MemoryContextRelloc * Returns pointer to aligned allocated memory in the given context. * * Note: @@ -278,7 +278,7 @@ MemoryContextRealloc(MemoryContext context, } /* - * MemoryContextGetName -- + * MemoryContextGetName * Returns pointer to aligned allocated memory in the given context. * * Note: @@ -301,7 +301,7 @@ MemoryContextGetName(MemoryContext context) #endif /* - * PointerGetAllocSize -- + * PointerGetAllocSize * Returns size of aligned allocated memory given pointer to it. * * Note: @@ -324,7 +324,7 @@ PointerGetAllocSize(Pointer pointer) #endif /* - * MemoryContextSwitchTo -- + * MemoryContextSwitchTo * Returns the current context; installs the given context. * * Note: @@ -351,7 +351,7 @@ MemoryContextSwitchTo(MemoryContext context) * External Functions */ /* - * CreateGlobalMemory -- + * CreateGlobalMemory * Returns new global memory context. * * Note: @@ -385,7 +385,7 @@ CreateGlobalMemory(char *name) /* XXX MemoryContextName */ } /* - * GlobalMemoryDestroy -- + * GlobalMemoryDestroy * Destroys given global memory context. * * Exceptions: @@ -413,7 +413,7 @@ GlobalMemoryDestroy(GlobalMemory context) *****************************************************************************/ /* - * GlobalMemoryAlloc -- + * GlobalMemoryAlloc * Returns pointer to aligned space in the global context. * * Exceptions: @@ -426,7 +426,7 @@ GlobalMemoryAlloc(GlobalMemory this, Size size) } /* - * GlobalMemoryFree -- + * GlobalMemoryFree * Frees allocated memory in the global context. * * Exceptions: @@ -441,7 +441,7 @@ GlobalMemoryFree(GlobalMemory this, } /* - * GlobalMemoryRealloc -- + * GlobalMemoryRealloc * Returns pointer to aligned space in the global context. * * Note: @@ -461,7 +461,7 @@ GlobalMemoryRealloc(GlobalMemory this, } /* - * GlobalMemoryGetName -- + * GlobalMemoryGetName * Returns name string for context. * * Exceptions: @@ -474,7 +474,7 @@ GlobalMemoryGetName(GlobalMemory this) } /* - * GlobalMemoryDump -- + * GlobalMemoryDump * Dumps global memory context for debugging. * * Exceptions: @@ -499,7 +499,7 @@ GlobalMemoryDump(GlobalMemory this) } /* - * DumpGlobalMemories -- + * DumpGlobalMemories * Dumps all global memory contexts for debugging. * * Exceptions: diff --git a/src/backend/utils/mmgr/oset.c b/src/backend/utils/mmgr/oset.c index f3245616a9..b2f0403870 100644 --- a/src/backend/utils/mmgr/oset.c +++ b/src/backend/utils/mmgr/oset.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * oset.c-- + * oset.c * Fixed format ordered set definitions. * * Copyright (c) 1994, Regents of the University of California @@ -24,7 +24,7 @@ static void OrderedElemPush(OrderedElem elem); static void OrderedElemPushHead(OrderedElem elem); /* - * OrderedElemGetBase -- + * OrderedElemGetBase * Returns base of enclosing structure. */ static Pointer @@ -37,7 +37,7 @@ OrderedElemGetBase(OrderedElem elem) } /* - * OrderedSetInit -- + * OrderedSetInit */ void OrderedSetInit(OrderedSet set, Offset offset) @@ -49,7 +49,7 @@ OrderedSetInit(OrderedSet set, Offset offset) } /* - * OrderedSetContains -- + * OrderedSetContains * True iff ordered set contains given element. */ bool @@ -59,7 +59,7 @@ OrderedSetContains(OrderedSet set, OrderedElem elem) } /* - * OrderedSetGetHead -- + * OrderedSetGetHead */ Pointer OrderedSetGetHead(OrderedSet set) @@ -73,7 +73,7 @@ OrderedSetGetHead(OrderedSet set) } /* - * OrderedSetGetTail -- + * OrderedSetGetTail */ #ifdef NOT_USED Pointer @@ -90,7 +90,7 @@ OrderedSetGetTail(OrderedSet set) #endif /* - * OrderedElemGetPredecessor -- + * OrderedElemGetPredecessor */ Pointer OrderedElemGetPredecessor(OrderedElem elem) @@ -102,7 +102,7 @@ OrderedElemGetPredecessor(OrderedElem elem) } /* - * OrderedElemGetSuccessor -- + * OrderedElemGetSuccessor */ Pointer OrderedElemGetSuccessor(OrderedElem elem) @@ -114,7 +114,7 @@ OrderedElemGetSuccessor(OrderedElem elem) } /* - * OrderedElemPop -- + * OrderedElemPop */ void OrderedElemPop(OrderedElem elem) @@ -127,7 +127,7 @@ OrderedElemPop(OrderedElem elem) } /* - * OrderedElemPushInto -- + * OrderedElemPushInto */ void OrderedElemPushInto(OrderedElem elem, OrderedSet set) @@ -140,7 +140,7 @@ OrderedElemPushInto(OrderedElem elem, OrderedSet set) } /* - * OrderedElemPush -- + * OrderedElemPush */ static void OrderedElemPush(OrderedElem elem) @@ -149,7 +149,7 @@ OrderedElemPush(OrderedElem elem) } /* - * OrderedElemPushHead -- + * OrderedElemPushHead */ static void OrderedElemPushHead(OrderedElem elem) diff --git a/src/backend/utils/mmgr/palloc.c b/src/backend/utils/mmgr/palloc.c index 0bdc23f677..ceff313f86 100644 --- a/src/backend/utils/mmgr/palloc.c +++ b/src/backend/utils/mmgr/palloc.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * palloc.c-- + * palloc.c * POSTGRES memory allocator code. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/mmgr/portalmem.c b/src/backend/utils/mmgr/portalmem.c index c22eb7230f..7b1a38e3e5 100644 --- a/src/backend/utils/mmgr/portalmem.c +++ b/src/backend/utils/mmgr/portalmem.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * portalmem.c-- + * portalmem.c * backend portal memory context management stuff * * Copyright (c) 1994, Regents of the University of California @@ -50,7 +50,7 @@ * * Here is an old comment taken from nodes/memnodes.h * - * MemoryContext -- + * MemoryContext * A logical context in which memory allocations occur. * * The types of memory contexts can be thought of as members of the @@ -517,7 +517,7 @@ DumpPortals() * ---------------------------------------------------------------- */ /* - * EnablePortalManager -- + * EnablePortalManager * Enables/disables the portal management module. */ void @@ -579,7 +579,7 @@ EnablePortalManager(bool on) } /* - * GetPortalByName -- + * GetPortalByName * Returns a portal given a portal name; returns blank portal given * NULL; returns invalid portal if portal not found. * @@ -606,7 +606,7 @@ GetPortalByName(char *name) } /* - * BlankPortalAssignName -- + * BlankPortalAssignName * Returns former blank portal as portal with given name. * * Side effect: @@ -659,7 +659,7 @@ BlankPortalAssignName(char *name) /* XXX PortalName */ } /* - * PortalSetQuery -- + * PortalSetQuery * Attaches a "query" to portal. * * Exceptions: @@ -686,7 +686,7 @@ PortalSetQuery(Portal portal, } /* - * PortalGetQueryDesc -- + * PortalGetQueryDesc * Returns query attached to portal. * * Exceptions: @@ -703,7 +703,7 @@ PortalGetQueryDesc(Portal portal) } /* - * PortalGetState -- + * PortalGetState * Returns state attached to portal. * * Exceptions: @@ -720,7 +720,7 @@ PortalGetState(Portal portal) } /* - * CreatePortal -- + * CreatePortal * Returns a new portal given a name. * * Note: @@ -784,7 +784,7 @@ CreatePortal(char *name) /* XXX PortalName */ } /* - * PortalDestroy -- + * PortalDestroy * Destroys portal. * * Exceptions: @@ -836,7 +836,7 @@ PortalDestroy(Portal *portalP) } /* ---------------- - * PortalResetHeapMemory -- + * PortalResetHeapMemory * Resets portal's heap memory context. * * Someday, Reset, Start, and End can be optimized by keeping a global @@ -873,7 +873,7 @@ PortalResetHeapMemory(Portal portal) } /* - * StartPortalAllocMode -- + * StartPortalAllocMode * Starts a new block of portal heap allocation using mode and limit; * the current block is disabled until EndPortalAllocMode is called. * @@ -912,7 +912,7 @@ StartPortalAllocMode(AllocMode mode, Size limit) } /* - * EndPortalAllocMode -- + * EndPortalAllocMode * Ends current block of portal heap allocation; previous block is * reenabled. * @@ -944,7 +944,7 @@ EndPortalAllocMode() } /* - * PortalGetVariableMemory -- + * PortalGetVariableMemory * Returns variable memory context for a given portal. * * Exceptions: @@ -958,7 +958,7 @@ PortalGetVariableMemory(Portal portal) } /* - * PortalGetHeapMemory -- + * PortalGetHeapMemory * Returns heap memory context for a given portal. * * Exceptions: @@ -972,7 +972,7 @@ PortalGetHeapMemory(Portal portal) } /* - * PortalVariableMemoryGetPortal -- + * PortalVariableMemoryGetPortal * Returns portal containing given variable memory context. * * Exceptions: @@ -986,7 +986,7 @@ PortalVariableMemoryGetPortal(PortalVariableMemory context) } /* - * PortalHeapMemoryGetPortal -- + * PortalHeapMemoryGetPortal * Returns portal containing given heap memory context. * * Exceptions: @@ -1000,7 +1000,7 @@ PortalHeapMemoryGetPortal(PortalHeapMemory context) } /* - * PortalVariableMemoryGetHeapMemory -- + * PortalVariableMemoryGetHeapMemory * Returns heap memory context associated with given variable memory. * * Exceptions: @@ -1019,7 +1019,7 @@ PortalVariableMemoryGetHeapMemory(PortalVariableMemory context) #endif /* - * PortalHeapMemoryGetVariableMemory -- + * PortalHeapMemoryGetVariableMemory * Returns variable memory context associated with given heap memory. * * Exceptions: diff --git a/src/backend/utils/sort/lselect.c b/src/backend/utils/sort/lselect.c index 0cfcfd3f96..76c1b8158c 100644 --- a/src/backend/utils/sort/lselect.c +++ b/src/backend/utils/sort/lselect.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lselect.c-- + * lselect.c * leftist tree selection algorithm (linked priority queue--Knuth, Vol.3, * pp.150-52) * diff --git a/src/backend/utils/sort/psort.c b/src/backend/utils/sort/psort.c index 845c6b91c7..c77ca9a2f5 100644 --- a/src/backend/utils/sort/psort.c +++ b/src/backend/utils/sort/psort.c @@ -1,5 +1,5 @@ /* - * psort.c-- + * psort.c * Polyphase merge sort. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/backend/utils/time/tqual.c b/src/backend/utils/time/tqual.c index b29ed8c65d..51c102c1b2 100644 --- a/src/backend/utils/time/tqual.c +++ b/src/backend/utils/time/tqual.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tqual.c-- + * tqual.c * POSTGRES "time" qualification code. * * Copyright (c) 1994, Regents of the University of California @@ -59,7 +59,7 @@ setheapoverride(bool on) */ /* - * HeapTupleSatisfiesItself -- + * HeapTupleSatisfiesItself * True iff heap tuple is valid for "itself." * "{it}self" means valid as of everything that's happened * in the current transaction, _including_ the current command. @@ -144,7 +144,7 @@ HeapTupleSatisfiesItself(HeapTupleHeader tuple) } /* - * HeapTupleSatisfiesNow -- + * HeapTupleSatisfiesNow * True iff heap tuple is valid "now." * "now" means valid including everything that's happened * in the current transaction _up to, but not including,_ diff --git a/src/bin/pg_dump/common.c b/src/bin/pg_dump/common.c index 202915ff1a..0a4740e067 100644 --- a/src/bin/pg_dump/common.c +++ b/src/bin/pg_dump/common.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * common.c-- + * common.c * common routines between pg_dump and pg4_dump * * Copyright (c) 1994, Regents of the University of California @@ -101,7 +101,7 @@ findOprByOid(OprInfo *oprinfo, int numOprs, const char *oid) /* - * findParentsByOid -- + * findParentsByOid * given the oid of a class, return the names of its parent classes * and assign the number of parents to the last argument. * diff --git a/src/bin/pg_dump/pg_dump.c b/src/bin/pg_dump/pg_dump.c index 0e6c0720d8..eb0abf58b7 100644 --- a/src/bin/pg_dump/pg_dump.c +++ b/src/bin/pg_dump/pg_dump.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_dump.c-- + * pg_dump.c * pg_dump is an utility for dumping out a postgres database * into a script file. * @@ -2952,7 +2952,7 @@ dumpIndices(FILE *fout, IndInfo *indinfo, int numIndices, } /* - * dumpTuples -- + * dumpTuples * prints out the tuples in ASCII representation. The output is a valid * input to COPY FROM stdin. * diff --git a/src/bin/pg_encoding/pg_encoding.c b/src/bin/pg_encoding/pg_encoding.c index 31c7f1271b..710bbedb83 100644 --- a/src/bin/pg_encoding/pg_encoding.c +++ b/src/bin/pg_encoding/pg_encoding.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_encoding.c-- + * pg_encoding.c * * * Copyright (c) 1998, PostgreSQL development group diff --git a/src/bin/pg_id/pg_id.c b/src/bin/pg_id/pg_id.c index e4dab94f19..f24e71b5ac 100644 --- a/src/bin/pg_id/pg_id.c +++ b/src/bin/pg_id/pg_id.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_id.c-- + * pg_id.c * Print the user ID for the login name passed as argument, * or the real user ID of the caller if no argument. If the * login name doesn't exist, print "NOUSER" and exit 1. diff --git a/src/bin/pg_version/pg_version.c b/src/bin/pg_version/pg_version.c index 3692871413..35d554d650 100644 --- a/src/bin/pg_version/pg_version.c +++ b/src/bin/pg_version/pg_version.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_version.c-- + * pg_version.c * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/bin/pgtclsh/pgtclAppInit.c b/src/bin/pgtclsh/pgtclAppInit.c index d121d28a14..57b4158941 100644 --- a/src/bin/pgtclsh/pgtclAppInit.c +++ b/src/bin/pgtclsh/pgtclAppInit.c @@ -1,5 +1,5 @@ /* - * pgtclAppInit.c -- + * pgtclAppInit.c * * a skeletal Tcl_AppInit that provides pgtcl initialization * to create a tclsh that can talk to pglite backends @@ -30,7 +30,7 @@ int *tclDummyMathPtr = (int *) matherr; /* *---------------------------------------------------------------------- * - * main -- + * main * * This is the main program for the application. * @@ -56,7 +56,7 @@ main(int argc, char **argv) /* *---------------------------------------------------------------------- * - * Tcl_AppInit -- + * Tcl_AppInit * * This procedure performs application-specific initialization. * Most applications, especially those that incorporate additional diff --git a/src/bin/pgtclsh/pgtkAppInit.c b/src/bin/pgtclsh/pgtkAppInit.c index 0bf685bd1a..46af3ffaa9 100644 --- a/src/bin/pgtclsh/pgtkAppInit.c +++ b/src/bin/pgtclsh/pgtkAppInit.c @@ -1,5 +1,5 @@ /* - * pgtkAppInit.c -- + * pgtkAppInit.c * * a skeletal Tcl_AppInit that provides pgtcl initialization * to create a tclsh that can talk to pglite backends @@ -29,7 +29,7 @@ int *tclDummyMathPtr = (int *) matherr; /* *---------------------------------------------------------------------- * - * main -- + * main * * This is the main program for the application. * @@ -55,7 +55,7 @@ main(int argc, char **argv) /* *---------------------------------------------------------------------- * - * Tcl_AppInit -- + * Tcl_AppInit * * This procedure performs application-specific initialization. * Most applications, especially those that incorporate additional diff --git a/src/bin/psql/psql.c b/src/bin/psql/psql.c index 293ff8f1da..90cc873fd5 100644 --- a/src/bin/psql/psql.c +++ b/src/bin/psql/psql.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * psql.c-- + * psql.c * an interactive front-end to postgreSQL * * Copyright (c) 1996, Regents of the University of California diff --git a/src/bin/psql/psqlHelp.h b/src/bin/psql/psqlHelp.h index 8405446df1..02a26f51a2 100644 --- a/src/bin/psql/psqlHelp.h +++ b/src/bin/psql/psqlHelp.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * psqlHelp.h-- + * psqlHelp.h * Help for query language syntax * * Copyright (c) 1994, Regents of the University of California diff --git a/src/bin/psql/stringutils.c b/src/bin/psql/stringutils.c index f6f1b1eaac..b1612d93c7 100644 --- a/src/bin/psql/stringutils.c +++ b/src/bin/psql/stringutils.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * stringutils.c-- + * stringutils.c * simple string manipulation routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/bin/psql/stringutils.h b/src/bin/psql/stringutils.h index 9c7513659f..4ceeabb4d9 100644 --- a/src/bin/psql/stringutils.h +++ b/src/bin/psql/stringutils.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * stringutils.h-- + * stringutils.h * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/access/attnum.h b/src/include/access/attnum.h index 0a25ca9750..9ac040d3b7 100644 --- a/src/include/access/attnum.h +++ b/src/include/access/attnum.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * attnum.h-- + * attnum.h * POSTGRES attribute number definitions. * * @@ -26,21 +26,21 @@ typedef int16 AttrNumber; * ---------------- */ /* - * AttributeNumberIsValid -- + * AttributeNumberIsValid * True iff the attribute number is valid. */ #define AttributeNumberIsValid(attributeNumber) \ ((bool) ((attributeNumber) != InvalidAttrNumber)) /* - * AttrNumberIsForUserDefinedAttr -- + * AttrNumberIsForUserDefinedAttr * True iff the attribute number corresponds to an user defined attribute. */ #define AttrNumberIsForUserDefinedAttr(attributeNumber) \ ((bool) ((attributeNumber) > 0)) /* - * AttrNumberGetAttrOffset -- + * AttrNumberGetAttrOffset * Returns the attribute offset for an attribute number. * * Note: @@ -53,7 +53,7 @@ typedef int16 AttrNumber; ) /* - * AttributeOffsetGetAttributeNumber -- + * AttributeOffsetGetAttributeNumber * Returns the attribute number for an attribute offset. */ #define AttrOffsetGetAttrNumber(attributeOffset) \ diff --git a/src/include/access/funcindex.h b/src/include/access/funcindex.h index 981a2480e5..43d4566945 100644 --- a/src/include/access/funcindex.h +++ b/src/include/access/funcindex.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * funcindex.h-- + * funcindex.h * * * diff --git a/src/include/access/genam.h b/src/include/access/genam.h index 126568850d..a0f3a30795 100644 --- a/src/include/access/genam.h +++ b/src/include/access/genam.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * genam.h-- + * genam.h * POSTGRES general access method definitions. * * diff --git a/src/include/access/gist.h b/src/include/access/gist.h index 8bcf24ae7f..383877e9ad 100644 --- a/src/include/access/gist.h +++ b/src/include/access/gist.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * gist.h-- + * gist.h * common declarations for the GiST access method code. * * diff --git a/src/include/access/gistscan.h b/src/include/access/gistscan.h index 553705f139..4be3b676ca 100644 --- a/src/include/access/gistscan.h +++ b/src/include/access/gistscan.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * gistscan.h-- + * gistscan.h * routines defined in access/gisr/gistscan.c * * diff --git a/src/include/access/giststrat.h b/src/include/access/giststrat.h index 9fb0a10da6..20ad45863f 100644 --- a/src/include/access/giststrat.h +++ b/src/include/access/giststrat.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * giststrat.h-- + * giststrat.h * routines defined in access/gist/giststrat.c * * diff --git a/src/include/access/hash.h b/src/include/access/hash.h index 6c30910570..fdbd098cbd 100644 --- a/src/include/access/hash.h +++ b/src/include/access/hash.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hash.h-- + * hash.h * header file for postgres hash access method implementation * * diff --git a/src/include/access/heapam.h b/src/include/access/heapam.h index 6bd6bafbe6..fc5c5a5f6a 100644 --- a/src/include/access/heapam.h +++ b/src/include/access/heapam.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * heapam.h-- + * heapam.h * POSTGRES heap access method definitions. * * diff --git a/src/include/access/hio.h b/src/include/access/hio.h index 91e5e226d1..d415e2c724 100644 --- a/src/include/access/hio.h +++ b/src/include/access/hio.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hio.h-- + * hio.h * POSTGRES heap access method input/output definitions. * * diff --git a/src/include/access/htup.h b/src/include/access/htup.h index 7b251ed14d..51d63d0ea9 100644 --- a/src/include/access/htup.h +++ b/src/include/access/htup.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * htup.h-- + * htup.h * POSTGRES heap tuple definitions. * * diff --git a/src/include/access/ibit.h b/src/include/access/ibit.h index e0d9f6b600..43b7a1e328 100644 --- a/src/include/access/ibit.h +++ b/src/include/access/ibit.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ibit.h-- + * ibit.h * POSTGRES index valid attribute bit map definitions. * * @@ -26,7 +26,7 @@ typedef IndexAttributeBitMapData *IndexAttributeBitMap; #define IndexAttributeBitMapSize sizeof(IndexAttributeBitMapData) /* - * IndexAttributeBitMapIsValid -- + * IndexAttributeBitMapIsValid * True iff attribute bit map is valid. */ #define IndexAttributeBitMapIsValid(bits) PointerIsValid(bits) diff --git a/src/include/access/iqual.h b/src/include/access/iqual.h index df0001dc6a..632e455dd1 100644 --- a/src/include/access/iqual.h +++ b/src/include/access/iqual.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * iqual.h-- + * iqual.h * Index scan key qualification definitions. * * diff --git a/src/include/access/istrat.h b/src/include/access/istrat.h index a1e826c111..fdf4fe8f68 100644 --- a/src/include/access/istrat.h +++ b/src/include/access/istrat.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * istrat.h-- + * istrat.h * POSTGRES index strategy definitions. * * @@ -17,14 +17,14 @@ #include <access/strat.h> /* - * StrategyNumberIsValid -- + * StrategyNumberIsValid * True iff the strategy number is valid. */ #define StrategyNumberIsValid(strategyNumber) \ ((bool) ((strategyNumber) != InvalidStrategy)) /* - * StrategyNumberIsInBounds -- + * StrategyNumberIsInBounds * True iff strategy number is within given bounds. * * Note: @@ -36,13 +36,13 @@ (strategyNumber) <= (maxStrategyNumber))) /* - * StrategyMapIsValid -- + * StrategyMapIsValid * True iff the index strategy mapping is valid. */ #define StrategyMapIsValid(map) PointerIsValid(map) /* - * IndexStrategyIsValid -- + * IndexStrategyIsValid * True iff the index strategy is valid. */ #define IndexStrategyIsValid(s) PointerIsValid(s) diff --git a/src/include/access/itup.h b/src/include/access/itup.h index dd54b3db0a..d4a71951e7 100644 --- a/src/include/access/itup.h +++ b/src/include/access/itup.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * itup.h-- + * itup.h * POSTGRES index tuple definitions. * * diff --git a/src/include/access/nbtree.h b/src/include/access/nbtree.h index f1f1ca10e6..0efa31683d 100644 --- a/src/include/access/nbtree.h +++ b/src/include/access/nbtree.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nbtree.h-- + * nbtree.h * header file for postgres btree access method implementation. * * diff --git a/src/include/access/printtup.h b/src/include/access/printtup.h index fbe9ba00d2..213d24ff94 100644 --- a/src/include/access/printtup.h +++ b/src/include/access/printtup.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * printtup.h-- + * printtup.h * * * diff --git a/src/include/access/relscan.h b/src/include/access/relscan.h index 1f3f615b4f..b742813743 100644 --- a/src/include/access/relscan.h +++ b/src/include/access/relscan.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * relscan.h-- + * relscan.h * POSTGRES internal relation scan descriptor definitions. * * @@ -69,13 +69,13 @@ typedef IndexScanDescData *IndexScanDesc; typedef IndexScanDesc *IndexScanDescPtr; /* - * HeapScanIsValid -- + * HeapScanIsValid * True iff the heap scan is valid. */ #define HeapScanIsValid(scan) PointerIsValid(scan) /* - * IndexScanIsValid -- + * IndexScanIsValid * True iff the index scan is valid. */ #define IndexScanIsValid(scan) PointerIsValid(scan) diff --git a/src/include/access/rtree.h b/src/include/access/rtree.h index f598881f79..9a49cc812a 100644 --- a/src/include/access/rtree.h +++ b/src/include/access/rtree.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtree.h-- + * rtree.h * common declarations for the rtree access method code. * * diff --git a/src/include/access/rtscan.h b/src/include/access/rtscan.h index ca5b346eb5..bc857bf6fa 100644 --- a/src/include/access/rtscan.h +++ b/src/include/access/rtscan.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtscan.h-- + * rtscan.h * routines defined in access/rtree/rtscan.c * * diff --git a/src/include/access/rtstrat.h b/src/include/access/rtstrat.h index 110e0b2d9e..6653e5cf6e 100644 --- a/src/include/access/rtstrat.h +++ b/src/include/access/rtstrat.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rtstrat.h-- + * rtstrat.h * routines defined in access/rtree/rtstrat.c * * diff --git a/src/include/access/sdir.h b/src/include/access/sdir.h index 3c54b05ca0..d10eb21c55 100644 --- a/src/include/access/sdir.h +++ b/src/include/access/sdir.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sdir.h-- + * sdir.h * POSTGRES scan direction definitions. * * @@ -26,7 +26,7 @@ typedef enum ScanDirection } ScanDirection; /* - * ScanDirectionIsValid -- + * ScanDirectionIsValid * True iff scan direction is valid. */ #define ScanDirectionIsValid(direction) \ @@ -34,21 +34,21 @@ typedef enum ScanDirection direction <= ForwardScanDirection)) /* - * ScanDirectionIsBackward -- + * ScanDirectionIsBackward * True iff scan direction is backward. */ #define ScanDirectionIsBackward(direction) \ ((bool) (direction == BackwardScanDirection)) /* - * ScanDirectionIsNoMovement -- + * ScanDirectionIsNoMovement * True iff scan direction indicates no movement. */ #define ScanDirectionIsNoMovement(direction) \ ((bool) (direction == NoMovementScanDirection)) /* - * ScanDirectionIsForward -- + * ScanDirectionIsForward * True iff scan direction is forward. */ #define ScanDirectionIsForward(direction) \ diff --git a/src/include/access/skey.h b/src/include/access/skey.h index 4fbe20dc9c..a47ea5666f 100644 --- a/src/include/access/skey.h +++ b/src/include/access/skey.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * skey.h-- + * skey.h * POSTGRES scan key definitions. * * diff --git a/src/include/access/strat.h b/src/include/access/strat.h index 2268ec39eb..adae0f09a4 100644 --- a/src/include/access/strat.h +++ b/src/include/access/strat.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * strat.h-- + * strat.h * index strategy type definitions * (separated out from original istrat.h to avoid circular refs) * @@ -70,7 +70,7 @@ typedef struct StrategyEvaluationData typedef StrategyEvaluationData *StrategyEvaluation; /* - * StrategyTransformMapIsValid -- + * StrategyTransformMapIsValid * Returns true iff strategy transformation map is valid. */ #define StrategyTransformMapIsValid(transform) PointerIsValid(transform) diff --git a/src/include/access/transam.h b/src/include/access/transam.h index e20b115781..f7dd7fc5e9 100644 --- a/src/include/access/transam.h +++ b/src/include/access/transam.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * transam.h-- + * transam.h * postgres transaction access method support code header * * diff --git a/src/include/access/tupdesc.h b/src/include/access/tupdesc.h index 6d5f07b44c..4b136da8ca 100644 --- a/src/include/access/tupdesc.h +++ b/src/include/access/tupdesc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tupdesc.h-- + * tupdesc.h * POSTGRES tuple descriptor definitions. * * diff --git a/src/include/access/tupmacs.h b/src/include/access/tupmacs.h index 7137d6dfec..2e3fa456bb 100644 --- a/src/include/access/tupmacs.h +++ b/src/include/access/tupmacs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tupmacs.h-- + * tupmacs.h * Tuple macros used by both index tuples and heap tuples. * * diff --git a/src/include/access/valid.h b/src/include/access/valid.h index d943734bee..856c41aab0 100644 --- a/src/include/access/valid.h +++ b/src/include/access/valid.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * valid.h-- + * valid.h * POSTGRES tuple qualification validity definitions. * * diff --git a/src/include/access/xact.h b/src/include/access/xact.h index 8f1c603653..0735f7274e 100644 --- a/src/include/access/xact.h +++ b/src/include/access/xact.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * xact.h-- + * xact.h * postgres transaction system header * * diff --git a/src/include/bootstrap/bootstrap.h b/src/include/bootstrap/bootstrap.h index 5184bcba28..7e377c7653 100644 --- a/src/include/bootstrap/bootstrap.h +++ b/src/include/bootstrap/bootstrap.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bootstrap.h-- + * bootstrap.h * include file for the bootstrapping code * * diff --git a/src/include/c.h b/src/include/c.h index e2fbee150f..64e4370366 100644 --- a/src/include/c.h +++ b/src/include/c.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * c.h-- + * c.h * Fundamental C definitions. This is included by every .c file in * postgres. * @@ -62,7 +62,7 @@ * ---------------------------------------------------------------- */ /* - * bool -- + * bool * Boolean value, either true or false. * */ @@ -95,7 +95,7 @@ typedef bool *BoolPtr; #ifdef __STDC__ /* ANSI C */ /* - * Pointer -- + * Pointer * Variable holding address of any memory resident object. */ @@ -107,7 +107,7 @@ typedef char *Pointer; #ifndef NULL /* - * NULL -- + * NULL * Null pointer. */ #define NULL ((void *) 0) @@ -122,21 +122,21 @@ typedef char *Pointer; #else /* !defined(__STDC__) *//* NOT ANSI C */ /* - * Pointer -- + * Pointer * Variable containing address of any memory resident object. */ typedef char *Pointer; #ifndef NULL /* - * NULL -- + * NULL * Null pointer. */ #define NULL 0 #endif /* !defined(NULL) */ /* - * const -- + * const * Type modifier. Identifies read only variables. * * Example: @@ -147,13 +147,13 @@ typedef char *Pointer; #endif /* - * signed -- + * signed * Type modifier. Identifies signed integral types. */ #define signed /* signed */ /* - * volatile -- + * volatile * Type modifier. Identifies variables which may change in ways not * noticeable by the compiler, e.g. via asynchronous interrupts. * @@ -165,9 +165,9 @@ typedef char *Pointer; #endif /* !defined(__STDC__) */ /* NOT ANSI C */ /* - * CppAsString -- + * CppAsString * Convert the argument to a string, using the C preprocessor. - * CppConcat -- + * CppConcat * Concatenate two arguments together, using the C preprocessor. */ #if defined(HAVE_ANSI_CPP) @@ -224,7 +224,7 @@ typedef char *Pointer; */ /* - * intN -- + * intN * Signed integer, EXACTLY N BITS IN SIZE, * used for numerical computations and the * frontend/backend protocol. @@ -234,7 +234,7 @@ typedef signed short int16; /* == 16 bits */ typedef signed int int32; /* == 32 bits */ /* - * uintN -- + * uintN * Unsigned integer, EXACTLY N BITS IN SIZE, * used for numerical computations and the * frontend/backend protocol. @@ -244,7 +244,7 @@ typedef unsigned short uint16; /* == 16 bits */ typedef unsigned int uint32; /* == 32 bits */ /* - * floatN -- + * floatN * Floating point number, AT LEAST N BITS IN SIZE, * used for numerical computations. * @@ -257,7 +257,7 @@ typedef float *float32; typedef double *float64; /* - * boolN -- + * boolN * Boolean value, AT LEAST N BITS IN SIZE. */ typedef uint8 bool8; /* >= 8 bits */ @@ -265,7 +265,7 @@ typedef uint16 bool16; /* >= 16 bits */ typedef uint32 bool32; /* >= 32 bits */ /* - * bitsN -- + * bitsN * Unit of bitwise operation, AT LEAST N BITS IN SIZE. */ typedef uint8 bits8; /* >= 8 bits */ @@ -273,7 +273,7 @@ typedef uint16 bits16; /* >= 16 bits */ typedef uint32 bits32; /* >= 32 bits */ /* - * wordN -- + * wordN * Unit of storage, AT LEAST N BITS IN SIZE, * used to fetch/store data. */ @@ -282,13 +282,13 @@ typedef uint16 word16; /* >= 16 bits */ typedef uint32 word32; /* >= 32 bits */ /* - * Size -- + * Size * Size of any memory resident object, as returned by sizeof. */ typedef size_t Size; /* - * Index -- + * Index * Index into any memory resident array. * * Note: @@ -303,7 +303,7 @@ typedef struct } IntArray; /* - * Offset -- + * Offset * Offset into any memory resident array. * * Note: @@ -317,7 +317,7 @@ typedef signed int Offset; * ---------------------------------------------------------------- */ /* - * datum.h -- + * datum.h * POSTGRES abstract data type datum representation definitions. * * Note: @@ -352,133 +352,133 @@ typedef Datum *DatumPtr; #define SET_4_BYTES(value) (((Datum) (value)) & 0xffffffff) /* - * DatumGetChar -- + * DatumGetChar * Returns character value of a datum. */ #define DatumGetChar(X) ((char) GET_1_BYTE(X)) /* - * CharGetDatum -- + * CharGetDatum * Returns datum representation for a character. */ #define CharGetDatum(X) ((Datum) SET_1_BYTE(X)) /* - * Int8GetDatum -- + * Int8GetDatum * Returns datum representation for an 8-bit integer. */ #define Int8GetDatum(X) ((Datum) SET_1_BYTE(X)) /* - * DatumGetUInt8 -- + * DatumGetUInt8 * Returns 8-bit unsigned integer value of a datum. */ #define DatumGetUInt8(X) ((uint8) GET_1_BYTE(X)) /* - * UInt8GetDatum -- + * UInt8GetDatum * Returns datum representation for an 8-bit unsigned integer. */ #define UInt8GetDatum(X) ((Datum) SET_1_BYTE(X)) /* - * DatumGetInt16 -- + * DatumGetInt16 * Returns 16-bit integer value of a datum. */ #define DatumGetInt16(X) ((int16) GET_2_BYTES(X)) /* - * Int16GetDatum -- + * Int16GetDatum * Returns datum representation for a 16-bit integer. */ #define Int16GetDatum(X) ((Datum) SET_2_BYTES(X)) /* - * DatumGetUInt16 -- + * DatumGetUInt16 * Returns 16-bit unsigned integer value of a datum. */ #define DatumGetUInt16(X) ((uint16) GET_2_BYTES(X)) /* - * UInt16GetDatum -- + * UInt16GetDatum * Returns datum representation for a 16-bit unsigned integer. */ #define UInt16GetDatum(X) ((Datum) SET_2_BYTES(X)) /* - * DatumGetInt32 -- + * DatumGetInt32 * Returns 32-bit integer value of a datum. */ #define DatumGetInt32(X) ((int32) GET_4_BYTES(X)) /* - * Int32GetDatum -- + * Int32GetDatum * Returns datum representation for a 32-bit integer. */ #define Int32GetDatum(X) ((Datum) SET_4_BYTES(X)) /* - * DatumGetUInt32 -- + * DatumGetUInt32 * Returns 32-bit unsigned integer value of a datum. */ #define DatumGetUInt32(X) ((uint32) GET_4_BYTES(X)) /* - * UInt32GetDatum -- + * UInt32GetDatum * Returns datum representation for a 32-bit unsigned integer. */ #define UInt32GetDatum(X) ((Datum) SET_4_BYTES(X)) /* - * DatumGetObjectId -- + * DatumGetObjectId * Returns object identifier value of a datum. */ #define DatumGetObjectId(X) ((Oid) GET_4_BYTES(X)) /* - * ObjectIdGetDatum -- + * ObjectIdGetDatum * Returns datum representation for an object identifier. */ #define ObjectIdGetDatum(X) ((Datum) SET_4_BYTES(X)) /* - * DatumGetPointer -- + * DatumGetPointer * Returns pointer value of a datum. */ #define DatumGetPointer(X) ((Pointer) X) /* - * PointerGetDatum -- + * PointerGetDatum * Returns datum representation for a pointer. */ #define PointerGetDatum(X) ((Datum) X) /* - * DatumGetName -- + * DatumGetName * Returns name value of a datum. */ #define DatumGetName(X) ((Name) DatumGetPointer((Datum) X)) /* - * NameGetDatum -- + * NameGetDatum * Returns datum representation for a name. */ @@ -486,7 +486,7 @@ typedef Datum *DatumPtr; /* - * DatumGetFloat32 -- + * DatumGetFloat32 * Returns 32-bit floating point value of a datum. * This is really a pointer, of course. */ @@ -494,7 +494,7 @@ typedef Datum *DatumPtr; #define DatumGetFloat32(X) ((float32) DatumGetPointer((Datum) X)) /* - * Float32GetDatum -- + * Float32GetDatum * Returns datum representation for a 32-bit floating point number. * This is really a pointer, of course. */ @@ -502,7 +502,7 @@ typedef Datum *DatumPtr; #define Float32GetDatum(X) PointerGetDatum((Pointer) X) /* - * DatumGetFloat64 -- + * DatumGetFloat64 * Returns 64-bit floating point value of a datum. * This is really a pointer, of course. */ @@ -510,7 +510,7 @@ typedef Datum *DatumPtr; #define DatumGetFloat64(X) ((float64) DatumGetPointer(X)) /* - * Float64GetDatum -- + * Float64GetDatum * Returns datum representation for a 64-bit floating point number. * This is really a pointer, of course. */ @@ -522,19 +522,19 @@ typedef Datum *DatumPtr; * ---------------------------------------------------------------- */ /* - * BoolIsValid -- + * BoolIsValid * True iff bool is valid. */ #define BoolIsValid(boolean) ((boolean) == false || (boolean) == true) /* - * PointerIsValid -- + * PointerIsValid * True iff pointer is valid. */ #define PointerIsValid(pointer) (bool)((void*)(pointer) != NULL) /* - * PointerIsInBounds -- + * PointerIsInBounds * True iff pointer is within given bounds. * * Note: @@ -545,7 +545,7 @@ typedef Datum *DatumPtr; ((min) <= (pointer) && (pointer) < (max)) /* - * PointerIsAligned -- + * PointerIsAligned * True iff pointer is properly aligned to point to the given type. */ #define PointerIsAligned(pointer, type) \ @@ -556,7 +556,7 @@ typedef Datum *DatumPtr; * ---------------------------------------------------------------- */ /* - * offsetof -- + * offsetof * Offset of a structure/union field within that structure/union. * * XXX This is supposed to be part of stddef.h, but isn't on @@ -567,13 +567,13 @@ typedef Datum *DatumPtr; #endif /* offsetof */ /* - * lengthof -- + * lengthof * Number of elements in an array. */ #define lengthof(array) (sizeof (array) / sizeof ((array)[0])) /* - * endof -- + * endof * Address of the element one past the last in an array. */ #define endof(array) (&array[lengthof(array)]) @@ -601,7 +601,7 @@ typedef struct Exception */ /* - * Trap -- + * Trap * Generates an exception if the given condition is true. * */ @@ -647,7 +647,7 @@ extern int assert_enabled; #endif /* USE_ASSERT_CHECKING */ /* - * LogTrap -- + * LogTrap * Generates an exception with a message if the given condition is true. * */ @@ -698,25 +698,25 @@ extern int assertTest(int val); * ---------------------------------------------------------------- */ /* - * Max -- + * Max * Return the maximum of two numbers. */ #define Max(x, y) ((x) > (y) ? (x) : (y)) /* - * Min -- + * Min * Return the minimum of two numbers. */ #define Min(x, y) ((x) < (y) ? (x) : (y)) /* - * Abs -- + * Abs * Return the absolute value of the argument. */ #define Abs(x) ((x) >= 0 ? (x) : -(x)) /* - * StrNCpy -- + * StrNCpy * Does string copy, and forces terminating NULL */ /* we do this so if the macro is used in an if action, it will work */ diff --git a/src/include/catalog/catalog.h b/src/include/catalog/catalog.h index 6cff1db8dd..b9ef67b7f0 100644 --- a/src/include/catalog/catalog.h +++ b/src/include/catalog/catalog.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * catalog.h-- + * catalog.h * prototypes for functions in lib/catalog/catalog.c * * diff --git a/src/include/catalog/catname.h b/src/include/catalog/catname.h index cc36b3764f..265d3354ce 100644 --- a/src/include/catalog/catname.h +++ b/src/include/catalog/catname.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * catname.h-- + * catname.h * POSTGRES system catalog relation name definitions. * * diff --git a/src/include/catalog/heap.h b/src/include/catalog/heap.h index 89002005db..efe3e594d5 100644 --- a/src/include/catalog/heap.h +++ b/src/include/catalog/heap.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * heap.h-- + * heap.h * prototypes for functions in lib/catalog/heap.c * * diff --git a/src/include/catalog/index.h b/src/include/catalog/index.h index 75cafca747..55f47ab0c3 100644 --- a/src/include/catalog/index.h +++ b/src/include/catalog/index.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * index.h-- + * index.h * prototypes for index.c. * * diff --git a/src/include/catalog/indexing.h b/src/include/catalog/indexing.h index ed55597844..c8dc8200f6 100644 --- a/src/include/catalog/indexing.h +++ b/src/include/catalog/indexing.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * indexing.h-- + * indexing.h * This include provides some definitions to support indexing * on system catalogs * diff --git a/src/include/catalog/pg_aggregate.h b/src/include/catalog/pg_aggregate.h index 8f8620e91a..8efb70a51e 100644 --- a/src/include/catalog/pg_aggregate.h +++ b/src/include/catalog/pg_aggregate.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_aggregate.h-- + * pg_aggregate.h * definition of the system "aggregate" relation (pg_aggregate) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_am.h b/src/include/catalog/pg_am.h index 469fc6af77..5ce4387571 100644 --- a/src/include/catalog/pg_am.h +++ b/src/include/catalog/pg_am.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_am.h-- + * pg_am.h * definition of the system "am" relation (pg_am) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_amop.h b/src/include/catalog/pg_amop.h index 242347fbeb..f28ed92e70 100644 --- a/src/include/catalog/pg_amop.h +++ b/src/include/catalog/pg_amop.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_amop.h-- + * pg_amop.h * definition of the system "amop" relation (pg_amop) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_amproc.h b/src/include/catalog/pg_amproc.h index c869b63cfc..88f35c2cc7 100644 --- a/src/include/catalog/pg_amproc.h +++ b/src/include/catalog/pg_amproc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_amproc.h-- + * pg_amproc.h * definition of the system "amproc" relation (pg_amproce) * along with the relation's initial contents. The amproc * catalog is used to store procedures used by indexed access diff --git a/src/include/catalog/pg_attrdef.h b/src/include/catalog/pg_attrdef.h index 22e89c17c1..3705b26862 100644 --- a/src/include/catalog/pg_attrdef.h +++ b/src/include/catalog/pg_attrdef.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_attrdef.h-- + * pg_attrdef.h * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/catalog/pg_attribute.h b/src/include/catalog/pg_attribute.h index 39d4e47a89..9f3916ece4 100644 --- a/src/include/catalog/pg_attribute.h +++ b/src/include/catalog/pg_attribute.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_attribute.h-- + * pg_attribute.h * definition of the system "attribute" relation (pg_attribute) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_class.h b/src/include/catalog/pg_class.h index 4b161325db..9b223332fe 100644 --- a/src/include/catalog/pg_class.h +++ b/src/include/catalog/pg_class.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_class.h-- + * pg_class.h * definition of the system "relation" relation (pg_class) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_database.h b/src/include/catalog/pg_database.h index 7a195b260f..ca21eeb9c3 100644 --- a/src/include/catalog/pg_database.h +++ b/src/include/catalog/pg_database.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_database.h-- + * pg_database.h * definition of the system "database" relation (pg_database) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_description.h b/src/include/catalog/pg_description.h index ef62d08362..e5da0fe701 100644 --- a/src/include/catalog/pg_description.h +++ b/src/include/catalog/pg_description.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_description.h-- + * pg_description.h * definition of the system "description" relation (pg_description) * * diff --git a/src/include/catalog/pg_group.h b/src/include/catalog/pg_group.h index 0d82a1997c..6dead07406 100644 --- a/src/include/catalog/pg_group.h +++ b/src/include/catalog/pg_group.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_group.h-- + * pg_group.h * * * diff --git a/src/include/catalog/pg_index.h b/src/include/catalog/pg_index.h index 16892f1b83..913b614c5d 100644 --- a/src/include/catalog/pg_index.h +++ b/src/include/catalog/pg_index.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_index.h-- + * pg_index.h * definition of the system "index" relation (pg_index) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_inheritproc.h b/src/include/catalog/pg_inheritproc.h index f848b4df93..b30662da9c 100644 --- a/src/include/catalog/pg_inheritproc.h +++ b/src/include/catalog/pg_inheritproc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_inheritproc.h-- + * pg_inheritproc.h * definition of the system "inheritproc" relation (pg_inheritproc) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_inherits.h b/src/include/catalog/pg_inherits.h index 8525284d0a..5ffce93798 100644 --- a/src/include/catalog/pg_inherits.h +++ b/src/include/catalog/pg_inherits.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_inherits.h-- + * pg_inherits.h * definition of the system "inherits" relation (pg_inherits) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_ipl.h b/src/include/catalog/pg_ipl.h index f38deb3eb0..bae10343e3 100644 --- a/src/include/catalog/pg_ipl.h +++ b/src/include/catalog/pg_ipl.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_ipl.h-- + * pg_ipl.h * definition of the system "ipl" relation (pg_ipl) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_language.h b/src/include/catalog/pg_language.h index 531d915615..4b3a9c5741 100644 --- a/src/include/catalog/pg_language.h +++ b/src/include/catalog/pg_language.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_language.h-- + * pg_language.h * definition of the system "language" relation (pg_language) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_listener.h b/src/include/catalog/pg_listener.h index 662584ecab..8ee3ed73d0 100644 --- a/src/include/catalog/pg_listener.h +++ b/src/include/catalog/pg_listener.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_listener.h-- + * pg_listener.h * Asynchronous notification * * diff --git a/src/include/catalog/pg_log.h b/src/include/catalog/pg_log.h index 72e04bd402..42891e06e9 100644 --- a/src/include/catalog/pg_log.h +++ b/src/include/catalog/pg_log.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_log.h-- + * pg_log.h * the system log relation "pg_log" is not a "heap" relation. * it is automatically created by the transam/ code and the * information here is all bogus and is just here to make the diff --git a/src/include/catalog/pg_opclass.h b/src/include/catalog/pg_opclass.h index 347d1b117e..0f057e527b 100644 --- a/src/include/catalog/pg_opclass.h +++ b/src/include/catalog/pg_opclass.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_opclass.h-- + * pg_opclass.h * definition of the system "opclass" relation (pg_opclass) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_operator.h b/src/include/catalog/pg_operator.h index 97d1f6bd37..9027b093f0 100644 --- a/src/include/catalog/pg_operator.h +++ b/src/include/catalog/pg_operator.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_operator.h-- + * pg_operator.h * definition of the system "operator" relation (pg_operator) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_parg.h b/src/include/catalog/pg_parg.h index c7a716dec3..18c3160948 100644 --- a/src/include/catalog/pg_parg.h +++ b/src/include/catalog/pg_parg.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_parg.h-- + * pg_parg.h * definition of the system "parg" relation (pg_parg) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_proc.h b/src/include/catalog/pg_proc.h index 9a9cae93e9..f2ffeb97be 100644 --- a/src/include/catalog/pg_proc.h +++ b/src/include/catalog/pg_proc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_proc.h-- + * pg_proc.h * definition of the system "procedure" relation (pg_proc) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_relcheck.h b/src/include/catalog/pg_relcheck.h index 1c02734855..0c0c259156 100644 --- a/src/include/catalog/pg_relcheck.h +++ b/src/include/catalog/pg_relcheck.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_relcheck.h-- + * pg_relcheck.h * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/catalog/pg_rewrite.h b/src/include/catalog/pg_rewrite.h index 145362c280..a1fa6edc41 100644 --- a/src/include/catalog/pg_rewrite.h +++ b/src/include/catalog/pg_rewrite.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_rewrite.h-- + * pg_rewrite.h * definition of the system "rewrite-rule" relation (pg_rewrite) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_shadow.h b/src/include/catalog/pg_shadow.h index e2b9844ddb..c36b1e536e 100644 --- a/src/include/catalog/pg_shadow.h +++ b/src/include/catalog/pg_shadow.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_shadow.h-- + * pg_shadow.h * definition of the system "shadow" relation (pg_shadow) * along with the relation's initial contents. * pg_user is now a public accessible view on pg_shadow. diff --git a/src/include/catalog/pg_statistic.h b/src/include/catalog/pg_statistic.h index aa0cb47426..0ed03161b0 100644 --- a/src/include/catalog/pg_statistic.h +++ b/src/include/catalog/pg_statistic.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_statistic.h-- + * pg_statistic.h * definition of the system "statistic" relation (pg_statistic) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_trigger.h b/src/include/catalog/pg_trigger.h index 9b25508dd7..2d12e73da5 100644 --- a/src/include/catalog/pg_trigger.h +++ b/src/include/catalog/pg_trigger.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_trigger.h-- + * pg_trigger.h * * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/catalog/pg_type.h b/src/include/catalog/pg_type.h index fe9945e098..29162f24b0 100644 --- a/src/include/catalog/pg_type.h +++ b/src/include/catalog/pg_type.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_type.h-- + * pg_type.h * definition of the system "type" relation (pg_type) * along with the relation's initial contents. * diff --git a/src/include/catalog/pg_variable.h b/src/include/catalog/pg_variable.h index b850646411..819b9818ec 100644 --- a/src/include/catalog/pg_variable.h +++ b/src/include/catalog/pg_variable.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_variable.h-- + * pg_variable.h * the system variable relation "pg_variable" is not a "heap" relation. * it is automatically created by the transam/ code and the * information here is all bogus and is just here to make the diff --git a/src/include/catalog/pg_version.h b/src/include/catalog/pg_version.h index f09b0fd68f..e2e07f0561 100644 --- a/src/include/catalog/pg_version.h +++ b/src/include/catalog/pg_version.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_version.h-- + * pg_version.h * definition of the system "version" relation (pg_version) * along with the relation's initial contents. * diff --git a/src/include/commands/async.h b/src/include/commands/async.h index e45f65b3ec..5364d34bb4 100644 --- a/src/include/commands/async.h +++ b/src/include/commands/async.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * async.h-- + * async.h * Asynchronous notification: NOTIFY, LISTEN, UNLISTEN * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/commands/cluster.h b/src/include/commands/cluster.h index b67deb9ad3..73f1e1cf31 100644 --- a/src/include/commands/cluster.h +++ b/src/include/commands/cluster.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * cluster.h-- + * cluster.h * header file for postgres cluster command stuff * * Copyright (c) 1994-5, Regents of the University of California diff --git a/src/include/commands/command.h b/src/include/commands/command.h index cc02d4854e..46737c0c64 100644 --- a/src/include/commands/command.h +++ b/src/include/commands/command.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * command.h-- + * command.h * prototypes for command.c. * * @@ -18,7 +18,7 @@ extern MemoryContext PortalExecutorHeapMemory; /* - * PerformPortalFetch -- + * PerformPortalFetch * Performs the POSTQUEL function FETCH. Fetches count (or all if 0) * tuples in portal with name in the forward direction iff goForward. * @@ -30,7 +30,7 @@ extern void PerformPortalFetch(char *name, bool forward, int count, char *tag, CommandDest dest); /* - * PerformPortalClose -- + * PerformPortalClose * Performs the POSTQUEL function CLOSE. */ extern void PerformPortalClose(char *name, CommandDest dest); @@ -38,7 +38,7 @@ extern void PerformPortalClose(char *name, CommandDest dest); extern void PortalCleanup(Portal portal); /* - * PerformAddAttribute -- + * PerformAddAttribute * Performs the POSTQUEL function ADD. */ extern void PerformAddAttribute(char *relationName, char *userName, diff --git a/src/include/commands/copy.h b/src/include/commands/copy.h index 9865757cae..ac6e1efa88 100644 --- a/src/include/commands/copy.h +++ b/src/include/commands/copy.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * copy.h-- + * copy.h * Definitions for using the POSTGRES copy command. * * diff --git a/src/include/commands/creatinh.h b/src/include/commands/creatinh.h index 85175f3ab0..a9f875b5be 100644 --- a/src/include/commands/creatinh.h +++ b/src/include/commands/creatinh.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * creatinh.h-- + * creatinh.h * prototypes for creatinh.c. * * diff --git a/src/include/commands/dbcommands.h b/src/include/commands/dbcommands.h index 4e4b04f91c..33b63f72e9 100644 --- a/src/include/commands/dbcommands.h +++ b/src/include/commands/dbcommands.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dbcommands.h-- + * dbcommands.h * * * diff --git a/src/include/commands/defrem.h b/src/include/commands/defrem.h index 0a5e8579ae..2ae412c63d 100644 --- a/src/include/commands/defrem.h +++ b/src/include/commands/defrem.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * defrem.h-- + * defrem.h * POSTGRES define and remove utility definitions. * * diff --git a/src/include/commands/explain.h b/src/include/commands/explain.h index 99910d7ff3..808cb17587 100644 --- a/src/include/commands/explain.h +++ b/src/include/commands/explain.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * explain.h-- + * explain.h * prototypes for explain.c * * Copyright (c) 1994-5, Regents of the University of California diff --git a/src/include/commands/proclang.h b/src/include/commands/proclang.h index b1ad0f8493..f39a6498fb 100644 --- a/src/include/commands/proclang.h +++ b/src/include/commands/proclang.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * proclang.h-- + * proclang.h * prototypes for proclang.c. * * diff --git a/src/include/commands/recipe.h b/src/include/commands/recipe.h index b989658e5a..dfc8b6b31a 100644 --- a/src/include/commands/recipe.h +++ b/src/include/commands/recipe.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * recipe.h-- + * recipe.h * recipe handling routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/commands/rename.h b/src/include/commands/rename.h index 143ea3656c..12723f4e3f 100644 --- a/src/include/commands/rename.h +++ b/src/include/commands/rename.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rename.h-- + * rename.h * * * diff --git a/src/include/commands/sequence.h b/src/include/commands/sequence.h index 89b628b437..f602a6cb39 100644 --- a/src/include/commands/sequence.h +++ b/src/include/commands/sequence.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sequence.h-- + * sequence.h * prototypes for sequence.c. * * diff --git a/src/include/commands/trigger.h b/src/include/commands/trigger.h index b52c81dc72..f96221f6e6 100644 --- a/src/include/commands/trigger.h +++ b/src/include/commands/trigger.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * trigger.h-- + * trigger.h * prototypes for trigger.c. * * diff --git a/src/include/commands/user.h b/src/include/commands/user.h index a81c6617e8..3849339947 100644 --- a/src/include/commands/user.h +++ b/src/include/commands/user.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * user.h-- + * user.h * * * diff --git a/src/include/commands/vacuum.h b/src/include/commands/vacuum.h index bb76793211..9ea78268e5 100644 --- a/src/include/commands/vacuum.h +++ b/src/include/commands/vacuum.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * vacuum.h-- + * vacuum.h * header file for postgres vacuum cleaner * * diff --git a/src/include/commands/version.h b/src/include/commands/version.h index 7e677f1987..55b2d97e52 100644 --- a/src/include/commands/version.h +++ b/src/include/commands/version.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * version.h-- + * version.h * Header file for versions. * * diff --git a/src/include/commands/view.h b/src/include/commands/view.h index ad9f2baa98..82bfc1cc99 100644 --- a/src/include/commands/view.h +++ b/src/include/commands/view.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * view.h-- + * view.h * * * diff --git a/src/include/executor/execFlatten.h b/src/include/executor/execFlatten.h index e122258359..52edd7c877 100644 --- a/src/include/executor/execFlatten.h +++ b/src/include/executor/execFlatten.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execFlatten.h-- + * execFlatten.h * prototypes for execFlatten.c. * * diff --git a/src/include/executor/execdebug.h b/src/include/executor/execdebug.h index 719cfa14e2..80e0d736cd 100644 --- a/src/include/executor/execdebug.h +++ b/src/include/executor/execdebug.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execdebug.h-- + * execdebug.h * #defines governing debugging behaviour in the executor * * diff --git a/src/include/executor/execdefs.h b/src/include/executor/execdefs.h index 9514267a4f..588c12b4c5 100644 --- a/src/include/executor/execdefs.h +++ b/src/include/executor/execdefs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execdefs.h-- + * execdefs.h * * * diff --git a/src/include/executor/execdesc.h b/src/include/executor/execdesc.h index 59d7300fde..9d7569db11 100644 --- a/src/include/executor/execdesc.h +++ b/src/include/executor/execdesc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execdesc.h-- + * execdesc.h * plan and query descriptor accessor macros used by the executor * and related modules. * diff --git a/src/include/executor/executor.h b/src/include/executor/executor.h index 02aed9e643..e86399c0a6 100644 --- a/src/include/executor/executor.h +++ b/src/include/executor/executor.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * executor.h-- + * executor.h * support for the POSTGRES executor module * * diff --git a/src/include/executor/functions.h b/src/include/executor/functions.h index cf43da6fd7..0fd7449d34 100644 --- a/src/include/executor/functions.h +++ b/src/include/executor/functions.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * functions.h-- + * functions.h * * * diff --git a/src/include/executor/hashjoin.h b/src/include/executor/hashjoin.h index 3d5bffd350..f5050dcfb4 100644 --- a/src/include/executor/hashjoin.h +++ b/src/include/executor/hashjoin.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hashjoin.h-- + * hashjoin.h * internal structures for hash table and buckets * * diff --git a/src/include/executor/nodeAgg.h b/src/include/executor/nodeAgg.h index 3dd0eadff0..5c9d5c31ae 100644 --- a/src/include/executor/nodeAgg.h +++ b/src/include/executor/nodeAgg.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeAgg.h-- + * nodeAgg.h * * * diff --git a/src/include/executor/nodeAppend.h b/src/include/executor/nodeAppend.h index 5f7f0d9708..44d869fdbc 100644 --- a/src/include/executor/nodeAppend.h +++ b/src/include/executor/nodeAppend.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeAppend.h-- + * nodeAppend.h * * * diff --git a/src/include/executor/nodeGroup.h b/src/include/executor/nodeGroup.h index 23b08ce1a9..a63a38785a 100644 --- a/src/include/executor/nodeGroup.h +++ b/src/include/executor/nodeGroup.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeGroup.h-- + * nodeGroup.h * prototypes for nodeGroup.c * * diff --git a/src/include/executor/nodeHash.h b/src/include/executor/nodeHash.h index b476c82e6c..8384b2d2ec 100644 --- a/src/include/executor/nodeHash.h +++ b/src/include/executor/nodeHash.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeHash.h-- + * nodeHash.h * * * diff --git a/src/include/executor/nodeHashjoin.h b/src/include/executor/nodeHashjoin.h index 96fe2bc8bf..4cf1befffe 100644 --- a/src/include/executor/nodeHashjoin.h +++ b/src/include/executor/nodeHashjoin.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeHashjoin.h-- + * nodeHashjoin.h * * * diff --git a/src/include/executor/nodeIndexscan.h b/src/include/executor/nodeIndexscan.h index 6a34208729..0aad6fdcd1 100644 --- a/src/include/executor/nodeIndexscan.h +++ b/src/include/executor/nodeIndexscan.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeIndexscan.h-- + * nodeIndexscan.h * * * diff --git a/src/include/executor/nodeMaterial.h b/src/include/executor/nodeMaterial.h index 8896138b53..b6ed5ac8b9 100644 --- a/src/include/executor/nodeMaterial.h +++ b/src/include/executor/nodeMaterial.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeMaterial.h-- + * nodeMaterial.h * * * diff --git a/src/include/executor/nodeMergejoin.h b/src/include/executor/nodeMergejoin.h index c4bb596354..6a0b4a6524 100644 --- a/src/include/executor/nodeMergejoin.h +++ b/src/include/executor/nodeMergejoin.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeMergejoin.h-- + * nodeMergejoin.h * * * diff --git a/src/include/executor/nodeNestloop.h b/src/include/executor/nodeNestloop.h index 5c776f520e..864de9ada9 100644 --- a/src/include/executor/nodeNestloop.h +++ b/src/include/executor/nodeNestloop.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeNestloop.h-- + * nodeNestloop.h * * * diff --git a/src/include/executor/nodeResult.h b/src/include/executor/nodeResult.h index 5ea2ac13db..02b4173eff 100644 --- a/src/include/executor/nodeResult.h +++ b/src/include/executor/nodeResult.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeResult.h-- + * nodeResult.h * * * diff --git a/src/include/executor/nodeSeqscan.h b/src/include/executor/nodeSeqscan.h index 514c2c3691..ae478d2718 100644 --- a/src/include/executor/nodeSeqscan.h +++ b/src/include/executor/nodeSeqscan.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeSeqscan.h-- + * nodeSeqscan.h * * * diff --git a/src/include/executor/nodeSort.h b/src/include/executor/nodeSort.h index e99e55019f..b3a342fc0e 100644 --- a/src/include/executor/nodeSort.h +++ b/src/include/executor/nodeSort.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeSort.h-- + * nodeSort.h * * * diff --git a/src/include/executor/nodeSubplan.h b/src/include/executor/nodeSubplan.h index a28cd2c485..b74fbc00af 100644 --- a/src/include/executor/nodeSubplan.h +++ b/src/include/executor/nodeSubplan.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeSubplan.h-- + * nodeSubplan.h * *------------------------------------------------------------------------- */ diff --git a/src/include/executor/nodeTee.h b/src/include/executor/nodeTee.h index eb70f86779..c9f92c6004 100644 --- a/src/include/executor/nodeTee.h +++ b/src/include/executor/nodeTee.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeTee.h-- + * nodeTee.h * support functions for a Tee executor node * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/executor/nodeUnique.h b/src/include/executor/nodeUnique.h index 94fab98b57..61d053c412 100644 --- a/src/include/executor/nodeUnique.h +++ b/src/include/executor/nodeUnique.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeUnique.h-- + * nodeUnique.h * * * diff --git a/src/include/executor/spi.h b/src/include/executor/spi.h index cc0ac6c4b7..cc72cddc90 100644 --- a/src/include/executor/spi.h +++ b/src/include/executor/spi.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * spi.h-- + * spi.h * * *------------------------------------------------------------------------- diff --git a/src/include/executor/spi_priv.h b/src/include/executor/spi_priv.h index d6c2b996f2..16e0440e66 100644 --- a/src/include/executor/spi_priv.h +++ b/src/include/executor/spi_priv.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * spi.c-- + * spi.c * Server Programming Interface private declarations * * $Header$ diff --git a/src/include/executor/tuptable.h b/src/include/executor/tuptable.h index 70ea8dd51e..bcdb52a66c 100644 --- a/src/include/executor/tuptable.h +++ b/src/include/executor/tuptable.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tuptable.h-- + * tuptable.h * tuple table support stuff * * diff --git a/src/include/lib/dllist.h b/src/include/lib/dllist.h index a2ecb4bfc5..13926a0c5a 100644 --- a/src/include/lib/dllist.h +++ b/src/include/lib/dllist.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dllist.h-- + * dllist.h * simple doubly linked list primitives * the elements of the list are void* so the lists can contain * anything diff --git a/src/include/lib/fstack.h b/src/include/lib/fstack.h index a623ddc60a..f067ba65bb 100644 --- a/src/include/lib/fstack.h +++ b/src/include/lib/fstack.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fstack.h-- + * fstack.h * Fixed format stack definitions. * * @@ -27,7 +27,7 @@ /* - * FixedItem -- + * FixedItem * Fixed format stackable item chain component. * * Note: @@ -43,7 +43,7 @@ struct FixedItemData }; /* - * FixedStack -- + * FixedStack * Fixed format stack. */ typedef struct FixedStackData @@ -56,7 +56,7 @@ typedef struct FixedStackData typedef FixedStackData *FixedStack; /* - * FixedStackInit -- + * FixedStackInit * Iniitializes stack for structures with given fixed component offset. * * Exceptions: @@ -65,7 +65,7 @@ typedef FixedStackData *FixedStack; extern void FixedStackInit(FixedStack stack, Offset offset); /* - * FixedStackPop -- + * FixedStackPop * Returns pointer to top structure on stack or NULL if empty stack. * * Exceptions: @@ -74,7 +74,7 @@ extern void FixedStackInit(FixedStack stack, Offset offset); Pointer FixedStackPop(FixedStack stack); /* - * FixedStackPush -- + * FixedStackPush * Places structure associated with pointer onto top of stack. * * Exceptions: @@ -84,7 +84,7 @@ Pointer FixedStackPop(FixedStack stack); extern void FixedStackPush(FixedStack stack, Pointer pointer); /* - * FixedStackGetTop -- + * FixedStackGetTop * Returns pointer to top structure of a stack. This item is not poped. * * Note: @@ -97,7 +97,7 @@ extern void FixedStackPush(FixedStack stack, Pointer pointer); extern Pointer FixedStackGetTop(FixedStack stack); /* - * FixedStackGetNext -- + * FixedStackGetNext * Returns pointer to next structure after pointer of a stack. * * Note: diff --git a/src/include/lib/hasht.h b/src/include/lib/hasht.h index b5fab43809..60e8f2fa72 100644 --- a/src/include/lib/hasht.h +++ b/src/include/lib/hasht.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hasht.h-- + * hasht.h * hash table related functions that are not directly supported * under utils/hash. * diff --git a/src/include/lib/lispsort.h b/src/include/lib/lispsort.h index 72603e59c5..1838ca4514 100644 --- a/src/include/lib/lispsort.h +++ b/src/include/lib/lispsort.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lispsort.h-- + * lispsort.h * * * diff --git a/src/include/lib/qsort.h b/src/include/lib/qsort.h index b9f85837cf..0675d1b88b 100644 --- a/src/include/lib/qsort.h +++ b/src/include/lib/qsort.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * qsort.h-- + * qsort.h * * * diff --git a/src/include/lib/stringinfo.h b/src/include/lib/stringinfo.h index 0858566306..126826391a 100644 --- a/src/include/lib/stringinfo.h +++ b/src/include/lib/stringinfo.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * stringinfo.h-- + * stringinfo.h * Declarations/definitons for "string" functions. * * diff --git a/src/include/libpq/auth.h b/src/include/libpq/auth.h index 4911833fa6..57b01f2db7 100644 --- a/src/include/libpq/auth.h +++ b/src/include/libpq/auth.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * auth.h-- + * auth.h * Definitions for network authentication routines * * diff --git a/src/include/libpq/be-fsstubs.h b/src/include/libpq/be-fsstubs.h index b51fc1e2d1..affee11238 100644 --- a/src/include/libpq/be-fsstubs.h +++ b/src/include/libpq/be-fsstubs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * be-fsstubs.h-- + * be-fsstubs.h * * * diff --git a/src/include/libpq/crypt.h b/src/include/libpq/crypt.h index 4c0117d616..b60b4b8404 100644 --- a/src/include/libpq/crypt.h +++ b/src/include/libpq/crypt.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * crypt.h-- + * crypt.h * Interface to hba.c * * diff --git a/src/include/libpq/hba.h b/src/include/libpq/hba.h index 19628340e7..0aba2aefed 100644 --- a/src/include/libpq/hba.h +++ b/src/include/libpq/hba.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hba.h-- + * hba.h * Interface to hba.c * * diff --git a/src/include/libpq/libpq-be.h b/src/include/libpq/libpq-be.h index 629ba35de1..834e51858e 100644 --- a/src/include/libpq/libpq-be.h +++ b/src/include/libpq/libpq-be.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * libpq-be.h-- + * libpq_be.h * This file contains definitions for structures and * externs for functions used by the POSTGRES backend. * diff --git a/src/include/libpq/libpq-fs.h b/src/include/libpq/libpq-fs.h index 8c47ea6d68..7e67ebd741 100644 --- a/src/include/libpq/libpq-fs.h +++ b/src/include/libpq/libpq-fs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * libpq-fs.h-- + * libpq-fs.h * definitions for using Inversion file system routines * * diff --git a/src/include/libpq/libpq.h b/src/include/libpq/libpq.h index 03fe64ed84..5e1fd3e688 100644 --- a/src/include/libpq/libpq.h +++ b/src/include/libpq/libpq.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * libpq.h-- + * libpq.h * POSTGRES LIBPQ buffer structure definitions. * * @@ -22,7 +22,7 @@ /* ---------------- - * PQArgBlock -- + * PQArgBlock * Information (pointer to array of this structure) required * for the PQfn() call. * ---------------- @@ -39,7 +39,7 @@ typedef struct } PQArgBlock; /* ---------------- - * TypeBlock -- + * TypeBlock * Information about an attribute. * ---------------- */ @@ -53,7 +53,7 @@ typedef struct TypeBlock } TypeBlock; /* ---------------- - * TupleBlock -- + * TupleBlock * Data of a tuple. * ---------------- */ @@ -69,7 +69,7 @@ typedef struct TupleBlock } TupleBlock; /* ---------------- - * GroupBuffer -- + * GroupBuffer * A group of tuples with the same attributes. * ---------------- */ @@ -83,7 +83,7 @@ typedef struct GroupBuffer } GroupBuffer; /* ---------------- - * PortalBuffer -- + * PortalBuffer * Data structure of a portal buffer. * ---------------- */ @@ -96,7 +96,7 @@ typedef struct PortalBuffer } PortalBuffer; /* ---------------- - * PortalEntry -- + * PortalEntry * an entry in the global portal table * * Note: the portalcxt is only meaningful for PQcalls made from diff --git a/src/include/libpq/pqcomm.h b/src/include/libpq/pqcomm.h index a59ff565af..3214a9e941 100644 --- a/src/include/libpq/pqcomm.h +++ b/src/include/libpq/pqcomm.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqcomm.h-- + * pqcomm.h * Definitions common to frontends and backends. * * diff --git a/src/include/libpq/pqsignal.h b/src/include/libpq/pqsignal.h index 18e9245442..3948ff6437 100644 --- a/src/include/libpq/pqsignal.h +++ b/src/include/libpq/pqsignal.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqsignal.h-- + * pqsignal.h * prototypes for the reliable BSD-style signal(2) routine. * * diff --git a/src/include/miscadmin.h b/src/include/miscadmin.h index 9988ed919c..1486145df2 100644 --- a/src/include/miscadmin.h +++ b/src/include/miscadmin.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * miscadmin.h-- + * miscadmin.h * this file contains general postgres administration and initialization * stuff that used to be spread out between the following files: * globals.h global variables diff --git a/src/include/nodes/execnodes.h b/src/include/nodes/execnodes.h index 9eb5ee30f8..8b0913493f 100644 --- a/src/include/nodes/execnodes.h +++ b/src/include/nodes/execnodes.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execnodes.h-- + * execnodes.h * definitions for executor state nodes * * diff --git a/src/include/nodes/makefuncs.h b/src/include/nodes/makefuncs.h index 8b9db589d3..7ca8fbf77d 100644 --- a/src/include/nodes/makefuncs.h +++ b/src/include/nodes/makefuncs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * makefuncs.h-- + * makefuncs.h * prototypes for the creator functions (for primitive nodes) * * diff --git a/src/include/nodes/memnodes.h b/src/include/nodes/memnodes.h index 6584c5eef7..e65fff3a10 100644 --- a/src/include/nodes/memnodes.h +++ b/src/include/nodes/memnodes.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * memnodes.h-- + * memnodes.h * POSTGRES memory context node definitions. * * @@ -23,7 +23,7 @@ #include <nodes/nodes.h> /* - * MemoryContext -- + * MemoryContext * A logical context in which memory allocations occur. * * The types of memory contexts can be thought of as members of the @@ -91,7 +91,7 @@ typedef struct PortalHeapMemoryData } *PortalHeapMemory; /* - * MemoryContextIsValid -- + * MemoryContextIsValid * True iff memory context is valid. */ #define MemoryContextIsValid(context) \ diff --git a/src/include/nodes/nodeFuncs.h b/src/include/nodes/nodeFuncs.h index 654df87adc..1f35fa2e25 100644 --- a/src/include/nodes/nodeFuncs.h +++ b/src/include/nodes/nodeFuncs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodeFuncs.h-- + * nodeFuncs.h * * * diff --git a/src/include/nodes/nodes.h b/src/include/nodes/nodes.h index fe11fd6554..4f4186c582 100644 --- a/src/include/nodes/nodes.h +++ b/src/include/nodes/nodes.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nodes.h-- + * nodes.h * Definitions for tagged nodes. * * diff --git a/src/include/nodes/params.h b/src/include/nodes/params.h index 800aec3bd3..56047e86c7 100644 --- a/src/include/nodes/params.h +++ b/src/include/nodes/params.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * params.h-- + * params.h * Declarations/definitions of stuff needed to handle parameterized plans. * * diff --git a/src/include/nodes/parsenodes.h b/src/include/nodes/parsenodes.h index 4767cb3838..1ffa96b3ef 100644 --- a/src/include/nodes/parsenodes.h +++ b/src/include/nodes/parsenodes.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parsenodes.h-- + * parsenodes.h * definitions for parse tree nodes * * diff --git a/src/include/nodes/pg_list.h b/src/include/nodes/pg_list.h index 56e64a03fd..dbf5c48f77 100644 --- a/src/include/nodes/pg_list.h +++ b/src/include/nodes/pg_list.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pg_list.h-- + * pg_list.h * POSTGRES generic list package * * diff --git a/src/include/nodes/plannodes.h b/src/include/nodes/plannodes.h index 191aa5778e..bed77152ec 100644 --- a/src/include/nodes/plannodes.h +++ b/src/include/nodes/plannodes.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * plannodes.h-- + * plannodes.h * definitions for query plan nodes * * diff --git a/src/include/nodes/primnodes.h b/src/include/nodes/primnodes.h index 06b2830aff..8bdc9409df 100644 --- a/src/include/nodes/primnodes.h +++ b/src/include/nodes/primnodes.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * primnodes.h-- + * primnodes.h * Definitions for parse tree/query tree ("primitive") nodes. * * diff --git a/src/include/nodes/print.h b/src/include/nodes/print.h index a41c57d136..2462e5bf1d 100644 --- a/src/include/nodes/print.h +++ b/src/include/nodes/print.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * execnodes.h-- + * execnodes.h * definitions for executor state nodes * * diff --git a/src/include/nodes/readfuncs.h b/src/include/nodes/readfuncs.h index 85653b8c4c..3a4df2c316 100644 --- a/src/include/nodes/readfuncs.h +++ b/src/include/nodes/readfuncs.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * readfuncs.h-- + * readfuncs.h * header file for read.c and readfuncs.c. These functions are internal * to the stringToNode interface and should not be used by anyone else. * diff --git a/src/include/nodes/relation.h b/src/include/nodes/relation.h index 6123718e34..54283283af 100644 --- a/src/include/nodes/relation.h +++ b/src/include/nodes/relation.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * relation.h-- + * relation.h * Definitions for internal planner nodes. * * diff --git a/src/include/optimizer/clauses.h b/src/include/optimizer/clauses.h index 31897314fb..ed165ff5ec 100644 --- a/src/include/optimizer/clauses.h +++ b/src/include/optimizer/clauses.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * clauses.h-- + * clauses.h * prototypes for clauses.c. * * diff --git a/src/include/optimizer/cost.h b/src/include/optimizer/cost.h index b218d56b73..102769c896 100644 --- a/src/include/optimizer/cost.h +++ b/src/include/optimizer/cost.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * cost.h-- + * cost.h * prototypes for costsize.c and clausesel.c. * * @@ -19,7 +19,7 @@ #include "nodes/relation.h" /* - * prototypes for costsize.c-- + * prototypes for costsize.c * routines to compute costs and sizes */ extern bool _enable_seqscan_; @@ -49,7 +49,7 @@ extern int compute_joinrel_size(JoinPath *joinpath); extern int page_size(int tuples, int width); /* - * prototypes for fuctions in clausesel.h-- + * prototypes for fuctions in clausesel.h * routines to compute clause selectivities */ extern void set_clause_selectivities(List *restrictinfo_list, Cost new_selectivity); diff --git a/src/include/optimizer/geqo.h b/src/include/optimizer/geqo.h index 54728b474d..02e2a1975b 100644 --- a/src/include/optimizer/geqo.h +++ b/src/include/optimizer/geqo.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo.h-- + * geqo.h * prototypes for various files in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_copy.h b/src/include/optimizer/geqo_copy.h index 61e7914d2a..eb8a0dd997 100644 --- a/src/include/optimizer/geqo_copy.h +++ b/src/include/optimizer/geqo_copy.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_copy.h-- + * geqo_copy.h * prototypes for copy functions in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_gene.h b/src/include/optimizer/geqo_gene.h index 23493861ec..f032667811 100644 --- a/src/include/optimizer/geqo_gene.h +++ b/src/include/optimizer/geqo_gene.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_gene.h-- + * geqo_gene.h * genome representation in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_misc.h b/src/include/optimizer/geqo_misc.h index e58f5b1d12..19cedca16c 100644 --- a/src/include/optimizer/geqo_misc.h +++ b/src/include/optimizer/geqo_misc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_misc.h-- + * geqo_misc.h * prototypes for printout routines in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_mutation.h b/src/include/optimizer/geqo_mutation.h index 385bea9aaa..dd445a8a9c 100644 --- a/src/include/optimizer/geqo_mutation.h +++ b/src/include/optimizer/geqo_mutation.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_mutation.h-- + * geqo_mutation.h * prototypes for mutation functions in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_paths.h b/src/include/optimizer/geqo_paths.h index 746146fcfe..b947ed3d71 100644 --- a/src/include/optimizer/geqo_paths.h +++ b/src/include/optimizer/geqo_paths.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_paths.h-- + * geqo_paths.h * prototypes for various subroutines in geqo_path.c * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_pool.h b/src/include/optimizer/geqo_pool.h index 1e3933466e..052a2ee2d6 100644 --- a/src/include/optimizer/geqo_pool.h +++ b/src/include/optimizer/geqo_pool.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_pool.h-- + * geqo_pool.h * pool representation in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_random.h b/src/include/optimizer/geqo_random.h index 0a96b56972..c20f8a0b43 100644 --- a/src/include/optimizer/geqo_random.h +++ b/src/include/optimizer/geqo_random.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_random.h-- + * geqo_random.h * random number generator * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_recombination.h b/src/include/optimizer/geqo_recombination.h index 6294656786..b4a200d54c 100644 --- a/src/include/optimizer/geqo_recombination.h +++ b/src/include/optimizer/geqo_recombination.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_recombination.h-- + * geqo_recombination.h * prototypes for recombination in the genetic query optimizer * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/geqo_selection.h b/src/include/optimizer/geqo_selection.h index e73cc7e1cc..dfe5861684 100644 --- a/src/include/optimizer/geqo_selection.h +++ b/src/include/optimizer/geqo_selection.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * geqo_selection.h-- + * geqo_selection.h * prototypes for selection routines in optimizer/geqo * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/optimizer/internal.h b/src/include/optimizer/internal.h index 96172fa88e..f1d6c79b3f 100644 --- a/src/include/optimizer/internal.h +++ b/src/include/optimizer/internal.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * internal.h-- + * internal.h * Definitions required throughout the query optimizer. * * diff --git a/src/include/optimizer/joininfo.h b/src/include/optimizer/joininfo.h index 98abd3cae4..f72f46d342 100644 --- a/src/include/optimizer/joininfo.h +++ b/src/include/optimizer/joininfo.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * joininfo.h-- + * joininfo.h * prototypes for joininfo.c. * * diff --git a/src/include/optimizer/keys.h b/src/include/optimizer/keys.h index 7e91070569..7581dc857f 100644 --- a/src/include/optimizer/keys.h +++ b/src/include/optimizer/keys.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keys.h-- + * keys.h * prototypes for keys.c. * * diff --git a/src/include/optimizer/ordering.h b/src/include/optimizer/ordering.h index 954b88c8fe..2fe201315d 100644 --- a/src/include/optimizer/ordering.h +++ b/src/include/optimizer/ordering.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ordering.h-- + * ordering.h * prototypes for ordering.c. * * diff --git a/src/include/optimizer/pathnode.h b/src/include/optimizer/pathnode.h index 57871f07e9..bcde754eba 100644 --- a/src/include/optimizer/pathnode.h +++ b/src/include/optimizer/pathnode.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pathnode.h-- + * pathnode.h * prototypes for pathnode.c, indexnode.c, relnode.c. * * diff --git a/src/include/optimizer/paths.h b/src/include/optimizer/paths.h index 17476a4a45..65c9e93e92 100644 --- a/src/include/optimizer/paths.h +++ b/src/include/optimizer/paths.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * paths.h-- + * paths.h * prototypes for various files in optimizer/paths (were separate * header files * diff --git a/src/include/optimizer/plancat.h b/src/include/optimizer/plancat.h index 2683e95483..0ce97a6926 100644 --- a/src/include/optimizer/plancat.h +++ b/src/include/optimizer/plancat.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * plancat.h-- + * plancat.h * prototypes for plancat.c. * * diff --git a/src/include/optimizer/planmain.h b/src/include/optimizer/planmain.h index aea069e19c..990b4ce080 100644 --- a/src/include/optimizer/planmain.h +++ b/src/include/optimizer/planmain.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * planmain.h-- + * planmain.h * prototypes for various files in optimizer/plan * * @@ -41,8 +41,8 @@ extern Unique *make_unique(List *tlist, Plan *lefttree, char *uniqueAttr); /* * prototypes for plan/initsplan.c */ -extern void init_base_rels_tlist(Query *root, List *tlist); -extern void init_base_rels_qual(Query *root, List *clauses); +extern void make_var_only_tlist(Query *root, List *tlist); +extern void add_restrict_and_join_to_rels(Query *root, List *clauses); extern void init_join_info(List *rel_list); extern void add_missing_vars_to_tlist(Query *root, List *tlist); diff --git a/src/include/optimizer/planner.h b/src/include/optimizer/planner.h index 51292f86e1..dfd046eaac 100644 --- a/src/include/optimizer/planner.h +++ b/src/include/optimizer/planner.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * planner.h-- + * planner.h * prototypes for planner.c. * * diff --git a/src/include/optimizer/prep.h b/src/include/optimizer/prep.h index 7076a4c52d..f48f915291 100644 --- a/src/include/optimizer/prep.h +++ b/src/include/optimizer/prep.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * prep.h-- + * prep.h * prototypes for files in prep.c * * diff --git a/src/include/optimizer/restrictinfo.h b/src/include/optimizer/restrictinfo.h index 655281edd5..e20a6f7f73 100644 --- a/src/include/optimizer/restrictinfo.h +++ b/src/include/optimizer/restrictinfo.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * restrictinfo.h-- + * restrictinfo.h * prototypes for restrictinfo.c. * * @@ -16,7 +16,7 @@ #include "nodes/pg_list.h" #include "nodes/relation.h" -extern bool valid_or_clause(RestrictInfo * restrictinfo); +extern bool valid_or_clause(RestrictInfo *restrictinfo); extern List *get_actual_clauses(List *restrictinfo_list); extern void get_relattvals(List *restrictinfo_list, List **attnos, List **values, List **flags); diff --git a/src/include/optimizer/subselect.h b/src/include/optimizer/subselect.h index 66ad302b8b..2394694907 100644 --- a/src/include/optimizer/subselect.h +++ b/src/include/optimizer/subselect.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * subselect.h-- + * subselect.h * *------------------------------------------------------------------------- */ diff --git a/src/include/optimizer/tlist.h b/src/include/optimizer/tlist.h index c1ffd07c0d..235d9eb3a3 100644 --- a/src/include/optimizer/tlist.h +++ b/src/include/optimizer/tlist.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tlist.h-- + * tlist.h * prototypes for tlist.c. * * @@ -19,7 +19,7 @@ extern TargetEntry *tlistentry_member(Var *var, List *targetlist); extern Expr *matching_tlvar(Var *var, List *targetlist); -extern void add_tl_element(RelOptInfo *rel, Var *var); +extern void add_var_to_tlist(RelOptInfo *rel, Var *var); extern TargetEntry *create_tl_element(Var *var, int resdomno); extern List *get_actual_tlist(List *tlist); extern Resdom *tlist_member(Var *var, List *tlist); diff --git a/src/include/optimizer/var.h b/src/include/optimizer/var.h index 3d9e04a600..3651ee4b03 100644 --- a/src/include/optimizer/var.h +++ b/src/include/optimizer/var.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * var.h-- + * var.h * prototypes for var.c. * * diff --git a/src/include/optimizer/xfunc.h b/src/include/optimizer/xfunc.h index cd43a480ca..c2e03e20d6 100644 --- a/src/include/optimizer/xfunc.h +++ b/src/include/optimizer/xfunc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * xfunc.h-- + * xfunc.h * prototypes for xfunc.c and predmig.c. * * @@ -51,8 +51,8 @@ extern int XfuncMode; /* defined in tcop/postgres.c */ /* function prototypes from planner/path/xfunc.c */ extern void xfunc_trypullup(RelOptInfo *rel); extern int xfunc_shouldpull(Path *childpath, JoinPath *parentpath, - int whichchild, RestrictInfo * maxcinfopt); -extern RestrictInfo *xfunc_pullup(Path *childpath, JoinPath *parentpath, RestrictInfo * cinfo, + int whichchild, RestrictInfo *maxcinfopt); +extern RestrictInfo *xfunc_pullup(Path *childpath, JoinPath *parentpath, RestrictInfo *cinfo, int whichchild, int clausetype); extern Cost xfunc_rank(Expr *clause); extern Cost xfunc_expense(Query *queryInfo, Expr *clause); diff --git a/src/include/parser/gramparse.h b/src/include/parser/gramparse.h index c1cd238d40..2a0e7d34bb 100644 --- a/src/include/parser/gramparse.h +++ b/src/include/parser/gramparse.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * gramparse.h-- + * gramparse.h * scanner support routines. used by both the bootstrap lexer * as well as the normal lexer * diff --git a/src/include/parser/keywords.h b/src/include/parser/keywords.h index acc8ac4444..75f13b1e98 100644 --- a/src/include/parser/keywords.h +++ b/src/include/parser/keywords.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keywords.h-- + * keywords.h * string,atom lookup thingy, reduces strcmp traffic greatly * in the bowels of the system. Look for actual defs in lib/C/atoms.c * diff --git a/src/include/parser/parse_func.h b/src/include/parser/parse_func.h index e031953d58..5e28b0ae4a 100644 --- a/src/include/parser/parse_func.h +++ b/src/include/parser/parse_func.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parse_func.h-- + * parse_func.h * * * diff --git a/src/include/parser/parse_oper.h b/src/include/parser/parse_oper.h index e759eaa958..678150701a 100644 --- a/src/include/parser/parse_oper.h +++ b/src/include/parser/parse_oper.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * catalog_utils.h-- + * catalog_utils.h * * * diff --git a/src/include/parser/parse_relation.h b/src/include/parser/parse_relation.h index 73b48625a5..3b97700024 100644 --- a/src/include/parser/parse_relation.h +++ b/src/include/parser/parse_relation.h @@ -1,6 +1,6 @@ - /*------------------------------------------------------------------------- +/*------------------------------------------------------------------------- * - * parse_query.h-- + * parse_query.h * prototypes for parse_query.c. * * diff --git a/src/include/parser/parsetree.h b/src/include/parser/parsetree.h index 65638b8740..eee2b9ea03 100644 --- a/src/include/parser/parsetree.h +++ b/src/include/parser/parsetree.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * parsetree.h-- + * parsetree.h * Routines to access various components and subcomponents of * parse trees. * diff --git a/src/include/parser/scansup.h b/src/include/parser/scansup.h index 3a356bf5de..ab6c42633c 100644 --- a/src/include/parser/scansup.h +++ b/src/include/parser/scansup.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * scansup.h-- + * scansup.h * scanner support routines. used by both the bootstrap lexer * as well as the normal lexer * diff --git a/src/include/postgres.h b/src/include/postgres.h index 0ade569e80..3db3e30a34 100644 --- a/src/include/postgres.h +++ b/src/include/postgres.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * postgres.h-- + * postgres.h * definition of (and support for) postgres system types. * this file is included by almost every .c in the system * diff --git a/src/include/postgres_ext.h b/src/include/postgres_ext.h index 91748c704c..c2b1a9f52f 100644 --- a/src/include/postgres_ext.h +++ b/src/include/postgres_ext.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * postgres_ext.h-- + * postgres_ext.h * * This file contains declarations of things that are visible * external to Postgres. For example, the Oid type is part of a diff --git a/src/include/regex/cdefs.h b/src/include/regex/cdefs.h index 7c188df342..1dd631ea03 100644 --- a/src/include/regex/cdefs.h +++ b/src/include/regex/cdefs.h @@ -50,7 +50,7 @@ * ACTION, ARISING OUT OF OR IN CONNECTION WITH THE USE OR PERFORMANCE OF THIS * SOFTWARE. * - - * --Copyright-- + * --Copyright */ /* diff --git a/src/include/rewrite/locks.h b/src/include/rewrite/locks.h index 24471219e9..f07f47bf1b 100644 --- a/src/include/rewrite/locks.h +++ b/src/include/rewrite/locks.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * locks.h-- + * locks.h * * * diff --git a/src/include/rewrite/prs2lock.h b/src/include/rewrite/prs2lock.h index 9a4945b1df..6c23bc4ad8 100644 --- a/src/include/rewrite/prs2lock.h +++ b/src/include/rewrite/prs2lock.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * prs2lock.h-- + * prs2lock.h * data structures for POSTGRES Rule System II (rewrite rules only) * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/rewrite/rewriteDefine.h b/src/include/rewrite/rewriteDefine.h index 6513505ef5..dce8110779 100644 --- a/src/include/rewrite/rewriteDefine.h +++ b/src/include/rewrite/rewriteDefine.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteDefine.h-- + * rewriteDefine.h * * * diff --git a/src/include/rewrite/rewriteHandler.h b/src/include/rewrite/rewriteHandler.h index 8d63b879dc..d4988ec258 100644 --- a/src/include/rewrite/rewriteHandler.h +++ b/src/include/rewrite/rewriteHandler.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteHandler.h-- + * rewriteHandler.h * * * diff --git a/src/include/rewrite/rewriteManip.h b/src/include/rewrite/rewriteManip.h index e1e3848599..22a08dc2e7 100644 --- a/src/include/rewrite/rewriteManip.h +++ b/src/include/rewrite/rewriteManip.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteManip.h-- + * rewriteManip.h * * * diff --git a/src/include/rewrite/rewriteRemove.h b/src/include/rewrite/rewriteRemove.h index b44e335cf5..9f593d21d6 100644 --- a/src/include/rewrite/rewriteRemove.h +++ b/src/include/rewrite/rewriteRemove.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteRemove.h-- + * rewriteRemove.h * * * diff --git a/src/include/rewrite/rewriteSupport.h b/src/include/rewrite/rewriteSupport.h index 08f3bafb51..2864174780 100644 --- a/src/include/rewrite/rewriteSupport.h +++ b/src/include/rewrite/rewriteSupport.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rewriteSupport.h-- + * rewriteSupport.h * * * diff --git a/src/include/rusagestub.h b/src/include/rusagestub.h index 4f0e5d4683..5b4e31f809 100644 --- a/src/include/rusagestub.h +++ b/src/include/rusagestub.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rusagestub.h-- + * rusagestub.h * Stubs for getrusage(3). * * diff --git a/src/include/storage/backendid.h b/src/include/storage/backendid.h index b5adba8f7d..db8ab27e80 100644 --- a/src/include/storage/backendid.h +++ b/src/include/storage/backendid.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * backendid.h-- + * backendid.h * POSTGRES backend id communication definitions * * diff --git a/src/include/storage/block.h b/src/include/storage/block.h index f0ceadbccb..f9e86d60e3 100644 --- a/src/include/storage/block.h +++ b/src/include/storage/block.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * block.h-- + * block.h * POSTGRES disk block definitions. * * @@ -61,21 +61,21 @@ typedef BlockIdData *BlockId; /* block identifier */ */ /* - * BlockNumberIsValid -- + * BlockNumberIsValid * True iff blockNumber is valid. */ #define BlockNumberIsValid(blockNumber) \ ((bool) ((int32) (blockNumber) != InvalidBlockNumber)) /* - * BlockIdIsValid -- + * BlockIdIsValid * True iff the block identifier is valid. */ #define BlockIdIsValid(blockId) \ ((bool) PointerIsValid(blockId)) /* - * BlockIdSet -- + * BlockIdSet * Sets a block identifier to the specified value. */ #define BlockIdSet(blockId, blockNumber) \ @@ -86,7 +86,7 @@ typedef BlockIdData *BlockId; /* block identifier */ ) /* - * BlockIdCopy -- + * BlockIdCopy * Copy a block identifier. */ #define BlockIdCopy(toBlockId, fromBlockId) \ @@ -98,7 +98,7 @@ typedef BlockIdData *BlockId; /* block identifier */ ) /* - * BlockIdEquals -- + * BlockIdEquals * Check for block number equality. */ #define BlockIdEquals(blockId1, blockId2) \ @@ -106,7 +106,7 @@ typedef BlockIdData *BlockId; /* block identifier */ (blockId1)->bi_lo == (blockId2)->bi_lo) /* - * BlockIdGetBlockNumber -- + * BlockIdGetBlockNumber * Retrieve the block number from a block identifier. */ #define BlockIdGetBlockNumber(blockId) \ diff --git a/src/include/storage/buf.h b/src/include/storage/buf.h index 19fa8d5bb7..0685bdd432 100644 --- a/src/include/storage/buf.h +++ b/src/include/storage/buf.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * buf.h-- + * buf.h * Basic buffer manager data types. * * @@ -19,19 +19,19 @@ typedef long Buffer; /* - * BufferIsInvalid -- + * BufferIsInvalid * True iff the buffer is invalid. */ #define BufferIsInvalid(buffer) ((buffer) == InvalidBuffer) /* - * BufferIsUnknown -- + * BufferIsUnknown * True iff the buffer is unknown. */ #define BufferIsUnknown(buffer) ((buffer) == UnknownBuffer) /* - * BufferIsLocal -- + * BufferIsLocal * True iff the buffer is local (not visible to other servers). */ #define BufferIsLocal(buffer) ((buffer) < 0) diff --git a/src/include/storage/buf_internals.h b/src/include/storage/buf_internals.h index ec824c9504..1a37ac4edd 100644 --- a/src/include/storage/buf_internals.h +++ b/src/include/storage/buf_internals.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * buf_internals.h-- + * buf_internals.h * Internal definitions. * * diff --git a/src/include/storage/bufmgr.h b/src/include/storage/bufmgr.h index 8cd1d45d1a..7af63c3a52 100644 --- a/src/include/storage/bufmgr.h +++ b/src/include/storage/bufmgr.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bufmgr.h-- + * bufmgr.h * POSTGRES buffer manager definitions. * * @@ -55,7 +55,7 @@ typedef bits16 BufferLock; #define BufferDescriptorGetBuffer(bdesc) ((bdesc)->buf_id + 1) /* - * BufferIsPinned -- + * BufferIsPinned * True iff the buffer is pinned (and therefore valid) * * Note: @@ -82,7 +82,7 @@ extern int ShowPinTrace; /* - * BufferIsValid -- + * BufferIsValid * True iff the refcnt of the local buffer is > 0 * Note: * BufferIsValid(InvalidBuffer) is False. @@ -117,7 +117,7 @@ extern int ShowPinTrace; ) /* - * BufferGetBlock -- + * BufferGetBlock * Returns a reference to a disk page image associated with a buffer. * * Note: diff --git a/src/include/storage/bufpage.h b/src/include/storage/bufpage.h index c70243cead..182a48dc88 100644 --- a/src/include/storage/bufpage.h +++ b/src/include/storage/bufpage.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bufpage.h-- + * bufpage.h * Standard POSTGRES buffer page definitions. * * @@ -75,7 +75,7 @@ */ /* - * PageIsValid -- + * PageIsValid * True iff page is valid. */ #define PageIsValid(page) PointerIsValid(page) @@ -154,7 +154,7 @@ typedef enum */ /* - * PageIsUsed -- + * PageIsUsed * True iff the page size is used. * * Note: @@ -167,7 +167,7 @@ typedef enum ) /* - * PageIsEmpty -- + * PageIsEmpty * returns true iff no itemid has been allocated on the page */ #define PageIsEmpty(page) \ @@ -175,14 +175,14 @@ typedef enum (sizeof(PageHeaderData) - sizeof(ItemIdData)) ? true : false) /* - * PageIsNew -- + * PageIsNew * returns true iff page is not initialized (by PageInit) */ #define PageIsNew(page) (((PageHeader) (page))->pd_upper == 0) /* - * PageGetItemId -- + * PageGetItemId * Returns an item identifier of a page. */ #define PageGetItemId(page, offsetNumber) \ @@ -194,7 +194,7 @@ typedef enum */ /* - * PageSizeIsValid -- + * PageSizeIsValid * True iff the page size is valid. * * XXX currently all page sizes are "valid" but we only actually @@ -206,7 +206,7 @@ typedef enum #define PageSizeIsValid(pageSize) ((pageSize) == BLCKSZ) /* - * PageGetPageSize -- + * PageGetPageSize * Returns the page size of a page. * * this can only be called on a formatted page (unlike @@ -217,7 +217,7 @@ typedef enum ((Size) ((PageHeader) (page))->pd_opaque.od_pagesize) /* - * PageSetPageSize -- + * PageSetPageSize * Sets the page size of a page. */ #define PageSetPageSize(page, size) \ @@ -228,7 +228,7 @@ typedef enum * ---------------- */ /* - * PageGetSpecialSize -- + * PageGetSpecialSize * Returns size of special space on a page. * * Note: @@ -238,7 +238,7 @@ typedef enum ((uint16) (PageGetPageSize(page) - ((PageHeader)(page))->pd_special)) /* - * PageGetSpecialPointer -- + * PageGetSpecialPointer * Returns pointer to special space on a page. * * Note: @@ -251,7 +251,7 @@ typedef enum ) /* - * PageGetItem -- + * PageGetItem * Retrieves an item on the given page. * * Note: @@ -266,7 +266,7 @@ typedef enum ) /* - * BufferGetPageSize -- + * BufferGetPageSize * Returns the page size within a buffer. * * Notes: @@ -283,13 +283,13 @@ typedef enum ) /* - * BufferGetPage -- + * BufferGetPage * Returns the page associated with a buffer. */ #define BufferGetPage(buffer) ((Page)BufferGetBlock(buffer)) /* - * PageGetMaxOffsetNumber -- + * PageGetMaxOffsetNumber * Returns the maximum offset number used by the given page. * * NOTE: The offset is invalid if the page is non-empty. diff --git a/src/include/storage/fd.h b/src/include/storage/fd.h index 37efeacab5..d3eafd5f1e 100644 --- a/src/include/storage/fd.h +++ b/src/include/storage/fd.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fd.h-- + * fd.h * Virtual file descriptor definitions. * * diff --git a/src/include/storage/ipc.h b/src/include/storage/ipc.h index c3175cb0e3..24e932c3ca 100644 --- a/src/include/storage/ipc.h +++ b/src/include/storage/ipc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ipc.h-- + * ipc.h * POSTGRES inter-process communication definitions. * * diff --git a/src/include/storage/item.h b/src/include/storage/item.h index 074b03d988..bbefceb8fb 100644 --- a/src/include/storage/item.h +++ b/src/include/storage/item.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * item.h-- + * item.h * POSTGRES disk item definitions. * * diff --git a/src/include/storage/itemid.h b/src/include/storage/itemid.h index a994f8d8b6..be547fe5e5 100644 --- a/src/include/storage/itemid.h +++ b/src/include/storage/itemid.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * itemid.h-- + * itemid.h * Standard POSTGRES buffer page item identifier definitions. * * @@ -57,13 +57,13 @@ typedef struct ItemIdData *ItemId; ((itemId)->lp_flags) /* - * ItemIdIsValid -- + * ItemIdIsValid * True iff disk item identifier is valid. */ #define ItemIdIsValid(itemId) PointerIsValid(itemId) /* - * ItemIdIsUsed -- + * ItemIdIsUsed * True iff disk item identifier is in use. * * Note: diff --git a/src/include/storage/itempos.h b/src/include/storage/itempos.h index 9d43bffef4..55effe49de 100644 --- a/src/include/storage/itempos.h +++ b/src/include/storage/itempos.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * itempos.h-- + * itempos.h * Standard POSTGRES buffer page long item subposition definitions. * * diff --git a/src/include/storage/itemptr.h b/src/include/storage/itemptr.h index f64ec4f1ee..5377a116db 100644 --- a/src/include/storage/itemptr.h +++ b/src/include/storage/itemptr.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * itemptr.h-- + * itemptr.h * POSTGRES disk item pointer definitions. * * @@ -37,14 +37,14 @@ typedef ItemPointerData *ItemPointer; */ /* - * ItemPointerIsValid -- + * ItemPointerIsValid * True iff the disk item pointer is not NULL. */ #define ItemPointerIsValid(pointer) \ ((bool) (PointerIsValid(pointer) && ((pointer)->ip_posid != 0))) /* - * ItemPointerGetBlockNumber -- + * ItemPointerGetBlockNumber * Returns the block number of a disk item pointer. */ #define ItemPointerGetBlockNumber(pointer) \ @@ -54,7 +54,7 @@ typedef ItemPointerData *ItemPointer; ) /* - * ItemPointerGetOffsetNumber -- + * ItemPointerGetOffsetNumber * Returns the offset number of a disk item pointer. */ #define ItemPointerGetOffsetNumber(pointer) \ @@ -64,7 +64,7 @@ typedef ItemPointerData *ItemPointer; ) /* - * ItemPointerSet -- + * ItemPointerSet * Sets a disk item pointer to the specified block and offset. */ #define ItemPointerSet(pointer, blockNumber, offNum) \ @@ -75,7 +75,7 @@ typedef ItemPointerData *ItemPointer; ) /* - * ItemPointerSetBlockNumber -- + * ItemPointerSetBlockNumber * Sets a disk item pointer to the specified block. */ #define ItemPointerSetBlockNumber(pointer, blockNumber) \ @@ -85,7 +85,7 @@ typedef ItemPointerData *ItemPointer; ) /* - * ItemPointerSetOffsetNumber -- + * ItemPointerSetOffsetNumber * Sets a disk item pointer to the specified offset. */ #define ItemPointerSetOffsetNumber(pointer, offsetNumber) \ @@ -95,7 +95,7 @@ typedef ItemPointerData *ItemPointer; ) /* - * ItemPointerCopy -- + * ItemPointerCopy * Copies the contents of one disk item pointer to another. */ #define ItemPointerCopy(fromPointer, toPointer) \ @@ -106,7 +106,7 @@ typedef ItemPointerData *ItemPointer; ) /* - * ItemPointerSetInvalid -- + * ItemPointerSetInvalid * Sets a disk item pointer to be invalid. */ #define ItemPointerSetInvalid(pointer) \ diff --git a/src/include/storage/large_object.h b/src/include/storage/large_object.h index 11cc3340cd..0fffbdce9c 100644 --- a/src/include/storage/large_object.h +++ b/src/include/storage/large_object.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * large_object.h-- + * large_object.h * file of info for Postgres large objects. POSTGRES 4.2 supports * zillions of large objects (internal, external, jaquith, inversion). * Now we only support inversion. diff --git a/src/include/storage/lmgr.h b/src/include/storage/lmgr.h index 580d420c7f..ed34f9e5a2 100644 --- a/src/include/storage/lmgr.h +++ b/src/include/storage/lmgr.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lmgr.h-- + * lmgr.h * POSTGRES lock manager definitions. * * diff --git a/src/include/storage/lock.h b/src/include/storage/lock.h index e210b3eb19..9cfb57ebf4 100644 --- a/src/include/storage/lock.h +++ b/src/include/storage/lock.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lock.h-- + * lock.h * * * @@ -127,7 +127,7 @@ typedef struct LOCKMETHODTABLE * we store is the number of locks of each type (holders) and the * total number of locks (nHolding) held by the transaction. * - * NOTE: -- + * NOTE: * There were some problems with the fact that currently TransactionIdData * is a 5 byte entity and compilers long word aligning of structure fields. * If the 3 byte padding is put in front of the actual xid data then the diff --git a/src/include/storage/multilev.h b/src/include/storage/multilev.h index 10532ddfc2..8da2ecedf7 100644 --- a/src/include/storage/multilev.h +++ b/src/include/storage/multilev.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * multilev.h-- + * multilev.h * multi level lock table consts/defs for single.c and multi.c and their * clients * diff --git a/src/include/storage/off.h b/src/include/storage/off.h index fcae7e0abe..e9fb12579a 100644 --- a/src/include/storage/off.h +++ b/src/include/storage/off.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * off.h-- + * off.h * POSTGRES disk "offset" definitions. * * @@ -32,7 +32,7 @@ typedef uint16 OffsetNumber; */ /* - * OffsetNumberIsValid -- + * OffsetNumberIsValid * True iff the offset number is valid. */ #define OffsetNumberIsValid(offsetNumber) \ @@ -40,8 +40,8 @@ typedef uint16 OffsetNumber; (offsetNumber <= MaxOffsetNumber))) /* - * OffsetNumberNext -- - * OffsetNumberPrev -- + * OffsetNumberNext + * OffsetNumberPrev * Increments/decrements the argument. These macros look pointless * but they help us disambiguate the different manipulations on * OffsetNumbers (e.g., sometimes we substract one from an diff --git a/src/include/storage/page.h b/src/include/storage/page.h index 13c380d8a3..9f29bcaaaa 100644 --- a/src/include/storage/page.h +++ b/src/include/storage/page.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * page.h-- + * page.h * POSTGRES buffer page abstraction definitions. * * @@ -16,7 +16,7 @@ typedef Pointer Page; /* - * PageIsValid -- + * PageIsValid * True iff page is valid. */ #define PageIsValid(page) PointerIsValid(page) diff --git a/src/include/storage/pagenum.h b/src/include/storage/pagenum.h index 4a8abfb861..28b94391fa 100644 --- a/src/include/storage/pagenum.h +++ b/src/include/storage/pagenum.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pagenum.h-- + * pagenum.h * POSTGRES page number definitions. * * @@ -21,7 +21,7 @@ typedef uint32 LogicalPageNumber; #define InvalidLogicalPageNumber 0 /* - * LogicalPageNumberIsValid -- + * LogicalPageNumberIsValid * True iff the logical page number is valid. */ #define LogicalPageNumberIsValid(pageNumber) \ diff --git a/src/include/storage/pos.h b/src/include/storage/pos.h index fcfaa594f9..7ebe538629 100644 --- a/src/include/storage/pos.h +++ b/src/include/storage/pos.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pos.h-- + * pos.h * POSTGRES "position" definitions. * * @@ -32,28 +32,28 @@ typedef PositionIdData *PositionId; */ /* - * PositionIdIsValid -- + * PositionIdIsValid * True iff the position identifier is valid. */ #define PositionIdIsValid(positionId) \ PointerIsValid(positionId) /* - * PositionIdSetInvalid -- + * PositionIdSetInvalid * Make an invalid position. */ #define PositionIdSetInvalid(positionId) \ *(positionId) = (bits16) 0 /* - * PositionIdSet -- + * PositionIdSet * Sets a position identifier to the specified value. */ #define PositionIdSet(positionId, offsetNumber) \ *(positionId) = (offsetNumber) /* - * PositionIdGetOffsetNumber -- + * PositionIdGetOffsetNumber * Retrieve the offset number from a position identifier. */ #define PositionIdGetOffsetNumber(positionId) \ diff --git a/src/include/storage/proc.h b/src/include/storage/proc.h index 49bcf00a94..be12937321 100644 --- a/src/include/storage/proc.h +++ b/src/include/storage/proc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * proc.h-- + * proc.h * * * @@ -75,8 +75,8 @@ typedef struct procglobal extern PROC *MyProc; -#define PROC_INCR_SLOCK(lock) if (MyProc) (MyProc->sLocks[(lock)])++ -#define PROC_DECR_SLOCK(lock) if (MyProc) (MyProc->sLocks[(lock)])-- +#define PROC_INCR_SLOCK(lock) if (MyProc) ((MyProc->sLocks[(lock)])++) +#define PROC_DECR_SLOCK(lock) if (MyProc) ((MyProc->sLocks[(lock)])--) /* * flags explaining why process woke up diff --git a/src/include/storage/s_lock.h b/src/include/storage/s_lock.h index 02f37ff51e..ba1bd721b1 100644 --- a/src/include/storage/s_lock.h +++ b/src/include/storage/s_lock.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * s_lock.h-- + * s_lock.h * This file contains the implementation (if any) for spinlocks. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/include/storage/shmem.h b/src/include/storage/shmem.h index 5025c4cec2..a58247334a 100644 --- a/src/include/storage/shmem.h +++ b/src/include/storage/shmem.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * shmem.h-- + * shmem.h * shared memory management structures * * diff --git a/src/include/storage/sinval.h b/src/include/storage/sinval.h index ccd4794c15..2d8f1369ba 100644 --- a/src/include/storage/sinval.h +++ b/src/include/storage/sinval.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sinval.h-- + * sinval.h * POSTGRES shared cache invalidation communication definitions. * * diff --git a/src/include/storage/sinvaladt.h b/src/include/storage/sinvaladt.h index d1c35173a4..0e9047db80 100644 --- a/src/include/storage/sinvaladt.h +++ b/src/include/storage/sinvaladt.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sinvaladt.h-- + * sinvaladt.h * POSTGRES shared cache invalidation segment definitions. * * diff --git a/src/include/storage/smgr.h b/src/include/storage/smgr.h index 479e9cb16e..249f8f4c59 100644 --- a/src/include/storage/smgr.h +++ b/src/include/storage/smgr.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * smgr.h-- + * smgr.h * storage manager switch public interface declarations. * * diff --git a/src/include/storage/spin.h b/src/include/storage/spin.h index a543dc4519..9cc9876cc7 100644 --- a/src/include/storage/spin.h +++ b/src/include/storage/spin.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * spin.h-- + * spin.h * synchronization routines * * diff --git a/src/include/tcop/dest.h b/src/include/tcop/dest.h index 026e25a255..434a711962 100644 --- a/src/include/tcop/dest.h +++ b/src/include/tcop/dest.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dest.h-- + * dest.h * Whenever the backend executes a query, the results * have to go someplace - either to the standard output, * to a local portal buffer or to a remote portal buffer. diff --git a/src/include/tcop/fastpath.h b/src/include/tcop/fastpath.h index 3e2effaf6d..8a32436f16 100644 --- a/src/include/tcop/fastpath.h +++ b/src/include/tcop/fastpath.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fastpath.h-- + * fastpath.h * * * diff --git a/src/include/tcop/pquery.h b/src/include/tcop/pquery.h index 24ff9dfb6b..66d45ea688 100644 --- a/src/include/tcop/pquery.h +++ b/src/include/tcop/pquery.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pquery.h-- + * pquery.h * prototypes for pquery.c. * * diff --git a/src/include/tcop/tcopdebug.h b/src/include/tcop/tcopdebug.h index 55f1f7671a..1ff5616d0f 100644 --- a/src/include/tcop/tcopdebug.h +++ b/src/include/tcop/tcopdebug.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tcopdebug.h-- + * tcopdebug.h * #defines governing debugging behaviour in the traffic cop * * diff --git a/src/include/tcop/tcopprot.h b/src/include/tcop/tcopprot.h index 6f20bda771..5e3a8ff8c7 100644 --- a/src/include/tcop/tcopprot.h +++ b/src/include/tcop/tcopprot.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tcopprot.h-- + * tcopprot.h * prototypes for postgres.c. * * diff --git a/src/include/tcop/utility.h b/src/include/tcop/utility.h index e8058f801f..d5d60e7080 100644 --- a/src/include/tcop/utility.h +++ b/src/include/tcop/utility.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * utility.h-- + * utility.h * prototypes for utility.c. * * diff --git a/src/include/utils/acl.h b/src/include/utils/acl.h index 8dad82877d..e750419f2b 100644 --- a/src/include/utils/acl.h +++ b/src/include/utils/acl.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * acl.h-- + * acl.h * Definition of (and support for) access control list data structures. * * diff --git a/src/include/utils/array.h b/src/include/utils/array.h index ef0953cb93..d4d01a240a 100644 --- a/src/include/utils/array.h +++ b/src/include/utils/array.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * array.h-- + * array.h * Utilities for the new array code. Contain prototypes from the * following files: * utils/adt/arrayfuncs.c diff --git a/src/include/utils/bit.h b/src/include/utils/bit.h index cb06b4239d..bb0b5653da 100644 --- a/src/include/utils/bit.h +++ b/src/include/utils/bit.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * bit.h-- + * bit.h * Standard bit array definitions. * * @@ -19,19 +19,19 @@ typedef uint32 BitIndex; #define BitsPerByte 8 /* - * BitArraySetBit -- + * BitArraySetBit * Sets (to 1) the value of a bit in a bit array. */ extern void BitArraySetBit(BitArray bitArray, BitIndex bitIndex); /* - * BitArrayClearBit -- + * BitArrayClearBit * Clears (to 0) the value of a bit in a bit array. */ extern void BitArrayClearBit(BitArray bitArray, BitIndex bitIndex); /* - * BitArrayBitIsSet -- + * BitArrayBitIsSet * True iff the bit is set (1) in a bit array. */ extern bool BitArrayBitIsSet(BitArray bitArray, BitIndex bitIndex); diff --git a/src/include/utils/builtins.h b/src/include/utils/builtins.h index 9ec9099be7..4ce3d5a8f1 100644 --- a/src/include/utils/builtins.h +++ b/src/include/utils/builtins.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * builtins.h-- + * builtins.h * Declarations for operations on built-in types. * * diff --git a/src/include/utils/catcache.h b/src/include/utils/catcache.h index b1ebf5ac59..531d52d915 100644 --- a/src/include/utils/catcache.h +++ b/src/include/utils/catcache.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * catcache.h-- + * catcache.h * Low-level catalog cache definitions. * * diff --git a/src/include/utils/datetime.h b/src/include/utils/datetime.h index d273e6db2e..a759d353ec 100644 --- a/src/include/utils/datetime.h +++ b/src/include/utils/datetime.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * datetime.h-- + * datetime.h * Definitions for the datetime * * diff --git a/src/include/utils/datum.h b/src/include/utils/datum.h index 1c0b48e1e0..3949785666 100644 --- a/src/include/utils/datum.h +++ b/src/include/utils/datum.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * datum.h-- + * datum.h * POSTGRES abstract data type datum representation definitions. * * diff --git a/src/include/utils/dt.h b/src/include/utils/dt.h index 4a726b1df8..1f6f73a7a6 100644 --- a/src/include/utils/dt.h +++ b/src/include/utils/dt.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dt.h-- + * dt.h * Definitions for the date/time and other date/time support code. * The support code is shared with other date data types, * including abstime, reltime, date, and time. diff --git a/src/include/utils/dynahash.h b/src/include/utils/dynahash.h index bf0dce1396..5d56c217a9 100644 --- a/src/include/utils/dynahash.h +++ b/src/include/utils/dynahash.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynahash-- + * dynahash * POSTGRES dynahash.h file definitions * * diff --git a/src/include/utils/dynamic_loader.h b/src/include/utils/dynamic_loader.h index 8124ee04e3..0395e54918 100644 --- a/src/include/utils/dynamic_loader.h +++ b/src/include/utils/dynamic_loader.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * dynamic_loader.h-- + * dynamic_loader.h * * * diff --git a/src/include/utils/elog.h b/src/include/utils/elog.h index 5adf62f75d..db09dca63e 100644 --- a/src/include/utils/elog.h +++ b/src/include/utils/elog.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * elog.h-- + * elog.h * POSTGRES error logging definitions. * * diff --git a/src/include/utils/exc.h b/src/include/utils/exc.h index 8444a4de63..5c0d5c4453 100644 --- a/src/include/utils/exc.h +++ b/src/include/utils/exc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * exc.h-- + * exc.h * POSTGRES exception handling definitions. * * diff --git a/src/include/utils/excid.h b/src/include/utils/excid.h index 2324fbe451..05c3f1ceec 100644 --- a/src/include/utils/excid.h +++ b/src/include/utils/excid.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * excid.h-- + * excid.h * POSTGRES known exception identifier definitions. * * diff --git a/src/include/utils/fcache.h b/src/include/utils/fcache.h index 5f4886af6c..753ed316bd 100644 --- a/src/include/utils/fcache.h +++ b/src/include/utils/fcache.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fcache.h-- + * fcache.h * * * diff --git a/src/include/utils/fcache2.h b/src/include/utils/fcache2.h index 93b35ab27d..9e78964ac3 100644 --- a/src/include/utils/fcache2.h +++ b/src/include/utils/fcache2.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fcache2.h-- + * fcache2.h * * * diff --git a/src/include/utils/fmgrtab.h b/src/include/utils/fmgrtab.h index 73a827a8ae..f21d63b2df 100644 --- a/src/include/utils/fmgrtab.h +++ b/src/include/utils/fmgrtab.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fmgrtab.h-- + * fmgrtab.h * * * diff --git a/src/include/utils/hsearch.h b/src/include/utils/hsearch.h index b6b474ff11..c60672d635 100644 --- a/src/include/utils/hsearch.h +++ b/src/include/utils/hsearch.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * hsearch.h-- + * hsearch.h * for hashing in the new buffer manager * * diff --git a/src/include/utils/inet.h b/src/include/utils/inet.h index eb30f62051..fe46100c4d 100644 --- a/src/include/utils/inet.h +++ b/src/include/utils/inet.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * builtins.h-- + * builtins.h * Declarations for operations on built-in types. * * diff --git a/src/include/utils/int8.h b/src/include/utils/int8.h index 6d48d5152a..c5bfb635d8 100644 --- a/src/include/utils/int8.h +++ b/src/include/utils/int8.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * int8.h-- + * int8.h * Declarations for operations on 64-bit integers. * * diff --git a/src/include/utils/inval.h b/src/include/utils/inval.h index 9593caa6f7..79f4f581da 100644 --- a/src/include/utils/inval.h +++ b/src/include/utils/inval.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * inval.h-- + * inval.h * POSTGRES cache invalidation dispatcher definitions. * * diff --git a/src/include/utils/lselect.h b/src/include/utils/lselect.h index e1cbba6200..7f5f85c914 100644 --- a/src/include/utils/lselect.h +++ b/src/include/utils/lselect.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lselect.h-- + * lselect.h * definitions for the replacement selection algorithm. * * diff --git a/src/include/utils/lsyscache.h b/src/include/utils/lsyscache.h index ce095ce85a..dc782bcf8d 100644 --- a/src/include/utils/lsyscache.h +++ b/src/include/utils/lsyscache.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lsyscache.h-- + * lsyscache.h * * * diff --git a/src/include/utils/mcxt.h b/src/include/utils/mcxt.h index 6d8f4fdb54..823538979b 100644 --- a/src/include/utils/mcxt.h +++ b/src/include/utils/mcxt.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * mcxt.h-- + * mcxt.h * POSTGRES memory context definitions. * * @@ -20,7 +20,7 @@ extern MemoryContext TopMemoryContext; /* - * MaxAllocSize -- + * MaxAllocSize * Arbitrary limit on size of allocations. * * Note: diff --git a/src/include/utils/memutils.h b/src/include/utils/memutils.h index 5afe7edaa1..829fe1461a 100644 --- a/src/include/utils/memutils.h +++ b/src/include/utils/memutils.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * memutils.h-- + * memutils.h * this file contains general memory alignment, allocation * and manipulation stuff that used to be spread out * between the following files: @@ -186,13 +186,13 @@ extern void OrderedElemPushInto(OrderedElem elem, OrderedSet Set); */ /* - * AllocPointer -- + * AllocPointer * Aligned pointer which may be a member of an allocation set. */ typedef Pointer AllocPointer; /* - * AllocMode -- + * AllocMode * Mode of allocation for an allocation set. * * Note: @@ -209,7 +209,7 @@ typedef enum AllocMode #define DefaultAllocMode DynamicAllocMode /* - * AllocBlock -- + * AllocBlock * Small pieces of memory are taken from bigger blocks of * memory with a size aligned to a power of two. These * pieces are not free's separately, instead they are reused @@ -225,7 +225,7 @@ typedef struct AllocBlockData { typedef AllocBlockData *AllocBlock; /* - * AllocChunk -- + * AllocChunk * The prefix of each piece of memory in an AllocBlock */ typedef struct AllocChunkData { @@ -236,7 +236,7 @@ typedef struct AllocChunkData { typedef AllocChunkData *AllocChunk; /* - * AllocSet -- + * AllocSet * Allocation set. */ typedef struct AllocSetData @@ -249,13 +249,13 @@ typedef struct AllocSetData typedef AllocSetData *AllocSet; /* - * AllocPointerIsValid -- + * AllocPointerIsValid * True iff pointer is valid allocation pointer. */ #define AllocPointerIsValid(pointer) PointerIsValid(pointer) /* - * AllocSetIsValid -- + * AllocSetIsValid * True iff set is valid allocation set. */ #define AllocSetIsValid(set) PointerIsValid(set) @@ -288,7 +288,7 @@ extern void AllocSetDump(AllocSet set); typedef int LibCCopyLength; /* - * MemoryCopy -- + * MemoryCopy * Copies fixed length block of memory to another. */ #define MemoryCopy(toBuffer, fromBuffer, length)\ diff --git a/src/include/utils/module.h b/src/include/utils/module.h index 74dd1dcdfc..064cdd815d 100644 --- a/src/include/utils/module.h +++ b/src/include/utils/module.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * module.h-- + * module.h * this file contains general "module" stuff that used to be * spread out between the following files: * diff --git a/src/include/utils/nabstime.h b/src/include/utils/nabstime.h index 1e7181dcac..89874718a6 100644 --- a/src/include/utils/nabstime.h +++ b/src/include/utils/nabstime.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * nabstime.h-- + * nabstime.h * Definitions for the "new" abstime code. * * @@ -91,7 +91,7 @@ typedef TimeIntervalData *TimeInterval; extern AbsoluteTime GetCurrentAbsoluteTime(void); /* - * getSystemTime -- + * getSystemTime * Returns system time. */ #define getSystemTime() \ diff --git a/src/include/utils/numeric.h b/src/include/utils/numeric.h index f9652379dc..af23e698bf 100644 --- a/src/include/utils/numeric.h +++ b/src/include/utils/numeric.h @@ -1,5 +1,5 @@ /* ---------- - * numeric.h - + * numeric.h * * Definitions for the exact numeric data type of Postgres * diff --git a/src/include/utils/palloc.h b/src/include/utils/palloc.h index aba4531e6d..84074553c9 100644 --- a/src/include/utils/palloc.h +++ b/src/include/utils/palloc.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * palloc.h-- + * palloc.h * POSTGRES memory allocator definitions. * * diff --git a/src/include/utils/portal.h b/src/include/utils/portal.h index ecfb268f1b..aaa6d16b4b 100644 --- a/src/include/utils/portal.h +++ b/src/include/utils/portal.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * portal.h-- + * portal.h * POSTGRES portal definitions. * * @@ -53,7 +53,7 @@ struct PortalD }; /* - * PortalIsValid -- + * PortalIsValid * True iff portal is valid. */ #define PortalIsValid(p) PointerIsValid(p) diff --git a/src/include/utils/ps_status.h b/src/include/utils/ps_status.h index 28a90170fe..9a74d2c350 100644 --- a/src/include/utils/ps_status.h +++ b/src/include/utils/ps_status.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * ps_status.h-- + * ps_status.h * * Defines macros to show backend status on the ps status line. * Unfortunately this is system dpendent. diff --git a/src/include/utils/psort.h b/src/include/utils/psort.h index 06a3ed9324..976310bfb7 100644 --- a/src/include/utils/psort.h +++ b/src/include/utils/psort.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * psort.h-- + * psort.h * * * diff --git a/src/include/utils/rel.h b/src/include/utils/rel.h index af21b7ce27..676c883b28 100644 --- a/src/include/utils/rel.h +++ b/src/include/utils/rel.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rel.h-- + * rel.h * POSTGRES relation descriptor definitions. * * @@ -77,13 +77,13 @@ typedef Relation *RelationPtr; #define InvalidRelation ((Relation)NULL) /* - * RelationIsValid -- + * RelationIsValid * True iff relation descriptor is valid. */ #define RelationIsValid(relation) PointerIsValid(relation) /* - * RelationGetSystemPort -- + * RelationGetSystemPort * Returns system port of a relation. * * Note: @@ -92,14 +92,14 @@ typedef Relation *RelationPtr; #define RelationGetSystemPort(relation) ((relation)->rd_fd) /* - * RelationGetLockInfo -- + * RelationGetLockInfo * Returns the lock information structure in the reldesc * */ #define RelationGetLockInfo(relation) ((relation)->lockInfo) /* - * RelationHasReferenceCountZero -- + * RelationHasReferenceCountZero * True iff relation reference count is zero. * * Note: @@ -109,25 +109,25 @@ typedef Relation *RelationPtr; ((bool)((relation)->rd_refcnt == 0)) /* - * RelationSetReferenceCount -- + * RelationSetReferenceCount * Sets relation reference count. */ #define RelationSetReferenceCount(relation,count) ((relation)->rd_refcnt = count) /* - * RelationIncrementReferenceCount -- + * RelationIncrementReferenceCount * Increments relation reference count. */ #define RelationIncrementReferenceCount(relation) ((relation)->rd_refcnt += 1); /* - * RelationDecrementReferenceCount -- + * RelationDecrementReferenceCount * Decrements relation reference count. */ #define RelationDecrementReferenceCount(relation) ((relation)->rd_refcnt -= 1) /* - * RelationGetForm -- + * RelationGetForm * Returns relation attribute values for a relation. * * Note: @@ -137,7 +137,7 @@ typedef Relation *RelationPtr; /* - * RelationGetRelid -- + * RelationGetRelid * * returns the object id of the relation * @@ -145,7 +145,7 @@ typedef Relation *RelationPtr; #define RelationGetRelid(relation) ((relation)->rd_id) /* - * RelationGetFile -- + * RelationGetFile * * Returns the open File decscriptor */ @@ -153,21 +153,21 @@ typedef Relation *RelationPtr; /* - * RelationGetRelationName -- + * RelationGetRelationName * * Returns a Relation Name */ #define RelationGetRelationName(relation) (&(relation)->rd_rel->relname) /* - * RelationGetRelationName -- + * RelationGetRelationName * * Returns a the number of attributes. */ #define RelationGetNumberOfAttributes(relation) ((relation)->rd_rel->relnatts) /* - * RelationGetDescr -- + * RelationGetDescr * Returns tuple descriptor for a relation. * * Note: diff --git a/src/include/utils/rel2.h b/src/include/utils/rel2.h index 852fa6c277..ee979acba8 100644 --- a/src/include/utils/rel2.h +++ b/src/include/utils/rel2.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * rel2.h-- + * rel2.h * * * diff --git a/src/include/utils/relcache.h b/src/include/utils/relcache.h index ff2aad9339..a7509d3732 100644 --- a/src/include/utils/relcache.h +++ b/src/include/utils/relcache.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * relcache.h-- + * relcache.h * Relation descriptor cache definitions. * * diff --git a/src/include/utils/sets.h b/src/include/utils/sets.h index 40748dda56..542810b773 100644 --- a/src/include/utils/sets.h +++ b/src/include/utils/sets.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * sets.h-- + * sets.h * * * diff --git a/src/include/utils/syscache.h b/src/include/utils/syscache.h index a991466339..2c6226fc56 100644 --- a/src/include/utils/syscache.h +++ b/src/include/utils/syscache.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * syscache.h-- + * syscache.h * System catalog cache definitions. * * diff --git a/src/include/utils/temprel.h b/src/include/utils/temprel.h index 913bf10f16..fecb5f8fc9 100644 --- a/src/include/utils/temprel.h +++ b/src/include/utils/temprel.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * temprel.h-- + * temprel.h * Temporary relation functions * * diff --git a/src/include/utils/tqual.h b/src/include/utils/tqual.h index 2ac8da8b2a..3f6ca31800 100644 --- a/src/include/utils/tqual.h +++ b/src/include/utils/tqual.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * tqual.h-- + * tqual.h * POSTGRES "time" qualification definitions. * * Should be moved/renamed... - vadim 07/28/98 @@ -42,7 +42,7 @@ extern TransactionId HeapSpecialTransactionId; extern CommandId HeapSpecialCommandId; /* - * HeapTupleSatisfiesVisibility -- + * HeapTupleSatisfiesVisibility * True iff heap tuple satsifies a time qual. * * Note: diff --git a/src/include/utils/trace.h b/src/include/utils/trace.h index d978f16ab4..52bc301a0a 100644 --- a/src/include/utils/trace.h +++ b/src/include/utils/trace.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * trace.h-- + * trace.h * * Conditional trace definitions. * diff --git a/src/interfaces/ecpg/preproc/c_keywords.c b/src/interfaces/ecpg/preproc/c_keywords.c index d208a406e3..8629b0d133 100644 --- a/src/interfaces/ecpg/preproc/c_keywords.c +++ b/src/interfaces/ecpg/preproc/c_keywords.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keywords.c-- + * keywords.c * lexical token lookup for reserved words in postgres embedded SQL * *------------------------------------------------------------------------- diff --git a/src/interfaces/ecpg/preproc/ecpg_keywords.c b/src/interfaces/ecpg/preproc/ecpg_keywords.c index 04e0d6165d..5a1bfb8ee0 100644 --- a/src/interfaces/ecpg/preproc/ecpg_keywords.c +++ b/src/interfaces/ecpg/preproc/ecpg_keywords.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keywords.c-- + * keywords.c * lexical token lookup for reserved words in postgres embedded SQL * *------------------------------------------------------------------------- diff --git a/src/interfaces/ecpg/preproc/keywords.c b/src/interfaces/ecpg/preproc/keywords.c index 91d993c9ce..f1fe84e4c0 100644 --- a/src/interfaces/ecpg/preproc/keywords.c +++ b/src/interfaces/ecpg/preproc/keywords.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * keywords.c-- + * keywords.c * lexical token lookup for reserved words in postgres SQL * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpgtcl/libpgtcl.h b/src/interfaces/libpgtcl/libpgtcl.h index d0061d9167..36d01724c1 100644 --- a/src/interfaces/libpgtcl/libpgtcl.h +++ b/src/interfaces/libpgtcl/libpgtcl.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * libpgtcl.h-- + * libpgtcl.h * * libpgtcl is a tcl package for front-ends to interface with PostgreSQL. * It's a Tcl wrapper for libpq. diff --git a/src/interfaces/libpgtcl/pgtcl.c b/src/interfaces/libpgtcl/pgtcl.c index f424a96454..82e497542c 100644 --- a/src/interfaces/libpgtcl/pgtcl.c +++ b/src/interfaces/libpgtcl/pgtcl.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pgtcl.c-- + * pgtcl.c * * libpgtcl is a tcl package for front-ends to interface with PostgreSQL. * It's a Tcl wrapper for libpq. diff --git a/src/interfaces/libpgtcl/pgtclCmds.c b/src/interfaces/libpgtcl/pgtclCmds.c index 647c60eecd..066d986147 100644 --- a/src/interfaces/libpgtcl/pgtclCmds.c +++ b/src/interfaces/libpgtcl/pgtclCmds.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pgtclCmds.c-- + * pgtclCmds.c * C functions which implement pg_* tcl commands * * Copyright (c) 1994, Regents of the University of California @@ -28,7 +28,7 @@ #define DIGIT(c) ((c) - '0') /* - * translate_escape() -- + * translate_escape() * * This function performs in-place translation of a single C-style * escape sequence pointed by p. Curly braces { } and double-quote @@ -132,7 +132,7 @@ translate_escape(char *p, int isArray) } /* - * tcl_value() -- + * tcl_value() * * This function does in-line conversion of a value returned by libpq * into a tcl string or into a tcl list if the value looks like the diff --git a/src/interfaces/libpgtcl/pgtclCmds.h b/src/interfaces/libpgtcl/pgtclCmds.h index ce494861ca..e9a53fc220 100644 --- a/src/interfaces/libpgtcl/pgtclCmds.h +++ b/src/interfaces/libpgtcl/pgtclCmds.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pgtclCmds.h-- + * pgtclCmds.h * declarations for the C functions which implement pg_* tcl commands * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpgtcl/pgtclId.c b/src/interfaces/libpgtcl/pgtclId.c index 5f8850fa86..cdccc7d841 100644 --- a/src/interfaces/libpgtcl/pgtclId.c +++ b/src/interfaces/libpgtcl/pgtclId.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pgtclId.c-- + * pgtclId.c * * Contains Tcl "channel" interface routines, plus useful routines * to convert between strings and pointers. These are needed because diff --git a/src/interfaces/libpgtcl/pgtclId.h b/src/interfaces/libpgtcl/pgtclId.h index a145445514..6c9c64a42e 100644 --- a/src/interfaces/libpgtcl/pgtclId.h +++ b/src/interfaces/libpgtcl/pgtclId.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pgtclId.h-- + * pgtclId.h * * Contains Tcl "channel" interface routines, plus useful routines * to convert between strings and pointers. These are needed because diff --git a/src/interfaces/libpq/fe-auth.c b/src/interfaces/libpq/fe-auth.c index e0c043087b..2a4b1383b1 100644 --- a/src/interfaces/libpq/fe-auth.c +++ b/src/interfaces/libpq/fe-auth.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fe-auth.c-- + * fe-auth.c * The front-end (client) authorization routines * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpq/fe-connect.c b/src/interfaces/libpq/fe-connect.c index b06e991c90..f28848c79e 100644 --- a/src/interfaces/libpq/fe-connect.c +++ b/src/interfaces/libpq/fe-connect.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fe-connect.c-- + * fe-connect.c * functions related to setting up a connection to the backend * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpq/fe-exec.c b/src/interfaces/libpq/fe-exec.c index 29d50cfaca..6570e2b774 100644 --- a/src/interfaces/libpq/fe-exec.c +++ b/src/interfaces/libpq/fe-exec.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fe-exec.c-- + * fe-exec.c * functions related to sending a query down to the backend * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpq/fe-lobj.c b/src/interfaces/libpq/fe-lobj.c index 85a9c2f6bf..b40c08aacf 100644 --- a/src/interfaces/libpq/fe-lobj.c +++ b/src/interfaces/libpq/fe-lobj.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fe-lobj.c-- + * fe-lobj.c * Front-end large object interface * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpq/fe-print.c b/src/interfaces/libpq/fe-print.c index 897c17a78b..44c10dbef9 100644 --- a/src/interfaces/libpq/fe-print.c +++ b/src/interfaces/libpq/fe-print.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * fe-print.c-- + * fe-print.c * functions for pretty-printing query results * * Copyright (c) 1994, Regents of the University of California diff --git a/src/interfaces/libpq/libpq-fe.h b/src/interfaces/libpq/libpq-fe.h index fabc3d40be..2e3bb45567 100644 --- a/src/interfaces/libpq/libpq-fe.h +++ b/src/interfaces/libpq/libpq-fe.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * libpq-fe.h-- + * libpq-fe.h * This file contains definitions for structures and * externs for functions used by frontend postgres applications. * diff --git a/src/interfaces/libpq/libpq-int.h b/src/interfaces/libpq/libpq-int.h index 07e9593a4d..6985031881 100644 --- a/src/interfaces/libpq/libpq-int.h +++ b/src/interfaces/libpq/libpq-int.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * libpq-int.h-- + * libpq-int.h * This file contains internal definitions meant to be used only by * the frontend libpq library, not by applications that call it. * diff --git a/src/interfaces/libpq/pqsignal.c b/src/interfaces/libpq/pqsignal.c index 729b495e28..a786cec054 100644 --- a/src/interfaces/libpq/pqsignal.c +++ b/src/interfaces/libpq/pqsignal.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqsignal.c-- + * pqsignal.c * reliable BSD-style signal(2) routine stolen from RWW who stole it * from Stevens... * diff --git a/src/interfaces/libpq/pqsignal.h b/src/interfaces/libpq/pqsignal.h index b70edfdb57..464b50f474 100644 --- a/src/interfaces/libpq/pqsignal.h +++ b/src/interfaces/libpq/pqsignal.h @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * pqsignal.h-- + * pqsignal.h * prototypes for the reliable BSD-style signal(2) routine. * * diff --git a/src/interfaces/odbc/options.c b/src/interfaces/odbc/options.c index f16ec4bc4a..ed34a1ca02 100644 --- a/src/interfaces/odbc/options.c +++ b/src/interfaces/odbc/options.c @@ -270,7 +270,7 @@ int i; switch (fOption) { - /* Statement Options -- + /* Statement Options (apply to all stmts on the connection and become defaults for new stmts) */ case SQL_ASYNC_ENABLE: diff --git a/src/test/examples/testlo.c b/src/test/examples/testlo.c index dae2e7fd1b..849bc7ed3f 100644 --- a/src/test/examples/testlo.c +++ b/src/test/examples/testlo.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * testlo.c-- + * testlo.c * test using large objects with libpq * * Copyright (c) 1994, Regents of the University of California diff --git a/src/test/examples/testlo2.c b/src/test/examples/testlo2.c index 098fac5856..1d571d54d4 100644 --- a/src/test/examples/testlo2.c +++ b/src/test/examples/testlo2.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * lotest.c-- + * lotest.c * test using large objects with libpq * * Copyright (c) 1994, Regents of the University of California diff --git a/src/tutorial/beard.c b/src/tutorial/beard.c index 7296bc606e..d94dc6efe3 100644 --- a/src/tutorial/beard.c +++ b/src/tutorial/beard.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * beard.c-- + * beard.c * sample routines to use large objects * * Copyright (c) 1994, Regents of the University of California diff --git a/src/utils/dllinit.c b/src/utils/dllinit.c index 76a20abdeb..c86a5274ae 100644 --- a/src/utils/dllinit.c +++ b/src/utils/dllinit.c @@ -59,7 +59,7 @@ extern struct _reent *__imp_reent_data; /* *---------------------------------------------------------------------- * - * DllMain -- + * DllMain * * This routine is called by the Mingw32, Cygwin32 or VC++ C run * time library init code, or the Borland DllEntryPoint routine. It diff --git a/src/utils/getopt.c b/src/utils/getopt.c index f81b35503b..c36550422d 100644 --- a/src/utils/getopt.c +++ b/src/utils/getopt.c @@ -51,7 +51,7 @@ char *optarg; /* argument associated with option */ #define EMSG "" /* - * getopt -- + * getopt * Parse argc/argv argument vector. */ int diff --git a/src/utils/strdup.c b/src/utils/strdup.c index d5eef1fdd4..cc0f81758b 100644 --- a/src/utils/strdup.c +++ b/src/utils/strdup.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * strdup.c-- + * strdup.c * copies a null-terminated string. * * Copyright (c) 1994, Regents of the University of California diff --git a/src/utils/version.c b/src/utils/version.c index dd8036c9ef..18e0b1c032 100644 --- a/src/utils/version.c +++ b/src/utils/version.c @@ -1,6 +1,6 @@ /*------------------------------------------------------------------------- * - * version.c-- + * version.c * Routines to handle Postgres version number. * * Copyright (c) 1994, Regents of the University of California |