This commit was manufactured by cvs2git to create branch 'ecpg_big_bison'.

Sprout from master 2002-06-20 20:29:54 UTC Bruce Momjian <bruce@momjian.us> 'Update copyright to 2002.'
Delete:
    COPYRIGHT
    GNUmakefile.in
    HISTORY
    INSTALL
    Makefile
    README
    aclocal.m4
    config/ac_func_accept_argtypes.m4
    config/c-compiler.m4
    config/c-library.m4
    config/config.guess
    config/config.sub
    config/cxx.m4
    config/docbook.m4
    config/general.m4
    config/install-sh
    config/java.m4
    config/libtool.m4
    config/missing
    config/mkinstalldirs
    config/perl.m4
    config/prep_buildtree
    config/programs.m4
    config/python.m4
    config/tcl.m4
    configure
    configure.in
    contrib/Makefile
    contrib/README
    contrib/array/Makefile
    contrib/array/README.array_iterator
    contrib/array/array_iterator.c
    contrib/array/array_iterator.h
    contrib/array/array_iterator.sql.in
    contrib/btree_gist/Makefile
    contrib/btree_gist/README.btree_gist
    contrib/btree_gist/btree_gist.c
    contrib/btree_gist/btree_gist.sql.in
    contrib/btree_gist/data/test_btree.data
    contrib/btree_gist/data/test_btree_ts.data
    contrib/btree_gist/expected/btree_gist.out
    contrib/btree_gist/sql/btree_gist.sql
    contrib/chkpass/Makefile
    contrib/chkpass/README.chkpass
    contrib/chkpass/chkpass.c
    contrib/chkpass/chkpass.sql.in
    contrib/contrib-global.mk
    contrib/cube/Makefile
    contrib/cube/README.cube
    contrib/cube/buffer.c
    contrib/cube/buffer.h
    contrib/cube/cube.c
    contrib/cube/cube.sql.in
    contrib/cube/cubedata.h
    contrib/cube/cubeparse.y
    contrib/cube/cubescan.l
    contrib/cube/data/test_cube.data
    contrib/cube/expected/cube.out
    contrib/cube/sql/cube.sql
    contrib/dbase/Makefile
    contrib/dbase/README.dbf2pg
    contrib/dbase/dbf.c
    contrib/dbase/dbf.h
    contrib/dbase/dbf2pg.1
    contrib/dbase/dbf2pg.c
    contrib/dbase/endian.c
    contrib/dblink/Makefile
    contrib/dblink/README.dblink
    contrib/dblink/dblink.c
    contrib/dblink/dblink.h
    contrib/dblink/dblink.sql.in
    contrib/dbsize/Makefile
    contrib/dbsize/README.dbsize
    contrib/dbsize/dbsize.c
    contrib/dbsize/dbsize.sql.in
    contrib/earthdistance/Makefile
    contrib/earthdistance/README.earthdistance
    contrib/earthdistance/earthdistance.c
    contrib/earthdistance/earthdistance.sql.in
    contrib/findoidjoins/Makefile
    contrib/findoidjoins/README.findoidjoins
    contrib/findoidjoins/findoidjoins.c
    contrib/findoidjoins/make_oidjoins_check
    contrib/fulltextindex/Makefile
    contrib/fulltextindex/README.fti
    contrib/fulltextindex/TODO
    contrib/fulltextindex/fti.c
    contrib/fulltextindex/fti.pl
    contrib/fulltextindex/fti.sql.in
    contrib/fulltextindex/timings.sh
    contrib/fuzzystrmatch/Makefile
    contrib/fuzzystrmatch/README.fuzzystrmatch
    contrib/fuzzystrmatch/README.soundex
    contrib/fuzzystrmatch/fuzzystrmatch.c
    contrib/fuzzystrmatch/fuzzystrmatch.h
    contrib/fuzzystrmatch/fuzzystrmatch.sql.in
    contrib/intagg/Makefile
    contrib/intagg/README.int_aggregate
    contrib/intagg/int_aggregate.c
    contrib/intagg/int_aggregate.sql.in
    contrib/intarray/Makefile
    contrib/intarray/README.intarray
    contrib/intarray/_int.c
    contrib/intarray/_int.sql.in
    contrib/intarray/bench/bench.pl
    contrib/intarray/bench/create_test.pl
    contrib/intarray/data/test__int.data
    contrib/intarray/expected/_int.out
    contrib/intarray/sql/_int.sql
    contrib/ipc_check/README
    contrib/ipc_check/ipc_check.pl
    contrib/isbn_issn/Makefile
    contrib/isbn_issn/README.isbn_issn
    contrib/isbn_issn/isbn_issn.c
    contrib/isbn_issn/isbn_issn.sql.in
    contrib/lo/Makefile
    contrib/lo/README.lo
    contrib/lo/lo.c
    contrib/lo/lo.sql.in
    contrib/lo/lo_drop.sql
    contrib/lo/lo_test.sql
    contrib/mSQL-interface/Makefile
    contrib/mSQL-interface/README.mpgsql
    contrib/mSQL-interface/mpgsql.c
    contrib/mac/README.mac
    contrib/mac/createoui
    contrib/mac/dropoui
    contrib/mac/ouiparse.awk
    contrib/mac/updateoui
    contrib/miscutil/Makefile
    contrib/miscutil/README.misc_utils
    contrib/miscutil/misc_utils.c
    contrib/miscutil/misc_utils.h
    contrib/miscutil/misc_utils.sql.in
    contrib/mysql/README
    contrib/mysql/my2pg.pl
    contrib/mysql/mysql2pgsql
    contrib/noupdate/Makefile
    contrib/noupdate/README.noup
    contrib/noupdate/noup.c
    contrib/noupdate/noup.sql.in
    contrib/oid2name/Makefile
    contrib/oid2name/README.oid2name
    contrib/oid2name/oid2name.c
    contrib/oracle/CHANGES
    contrib/oracle/Ora2Pg.pm
    contrib/oracle/README.ora2pg
    contrib/oracle/TODO
    contrib/oracle/ora2pg.html
    contrib/oracle/ora2pg.pl
    contrib/pg_controldata/Makefile
    contrib/pg_controldata/README.pg_controldata
    contrib/pg_controldata/pg_controldata.c
    contrib/pg_dumplo/Makefile
    contrib/pg_dumplo/README.pg_dumplo
    contrib/pg_dumplo/lo_export.c
    contrib/pg_dumplo/lo_import.c
    contrib/pg_dumplo/main.c
    contrib/pg_dumplo/pg_dumplo.h
    contrib/pg_dumplo/utils.c
    contrib/pg_logger/Makefile
    contrib/pg_logger/README.pg_logger
    contrib/pg_logger/pg_logger.c
    contrib/pg_resetxlog/Makefile
    contrib/pg_resetxlog/README.pg_resetxlog
    contrib/pg_resetxlog/pg_resetxlog.c
    contrib/pg_upgrade/README
    contrib/pg_upgrade/pg_upgrade
    contrib/pg_upgrade/pg_upgrade.1
    contrib/pgbench/Makefile
    contrib/pgbench/README.pgbench
    contrib/pgbench/README.pgbench_jis
    contrib/pgbench/pgbench.c
    contrib/pgcrypto/API
    contrib/pgcrypto/Makefile
    contrib/pgcrypto/README.pgcrypto
    contrib/pgcrypto/blf.c
    contrib/pgcrypto/blf.h
    contrib/pgcrypto/crypt-blowfish.c
    contrib/pgcrypto/crypt-des.c
    contrib/pgcrypto/crypt-gensalt.c
    contrib/pgcrypto/crypt-md5.c
    contrib/pgcrypto/expected/blowfish.out
    contrib/pgcrypto/expected/crypt-blowfish.out
    contrib/pgcrypto/expected/crypt-des.out
    contrib/pgcrypto/expected/crypt-md5.out
    contrib/pgcrypto/expected/crypt-xdes.out
    contrib/pgcrypto/expected/hmac-md5.out
    contrib/pgcrypto/expected/hmac-sha1.out
    contrib/pgcrypto/expected/init.out
    contrib/pgcrypto/expected/md5.out
    contrib/pgcrypto/expected/rijndael.out
    contrib/pgcrypto/expected/sha1.out
    contrib/pgcrypto/internal.c
    contrib/pgcrypto/md5.c
    contrib/pgcrypto/md5.h
    contrib/pgcrypto/mhash.c
    contrib/pgcrypto/misc.c
    contrib/pgcrypto/openssl.c
    contrib/pgcrypto/pgcrypto.c
    contrib/pgcrypto/pgcrypto.h
    contrib/pgcrypto/pgcrypto.sql.in
    contrib/pgcrypto/px-crypt.c
    contrib/pgcrypto/px-crypt.h
    contrib/pgcrypto/px-hmac.c
    contrib/pgcrypto/px.c
    contrib/pgcrypto/px.h
    contrib/pgcrypto/random.c
    contrib/pgcrypto/rijndael.c
    contrib/pgcrypto/rijndael.h
    contrib/pgcrypto/rijndael.tbl
    contrib/pgcrypto/sha1.c
    contrib/pgcrypto/sha1.h
    contrib/pgcrypto/sql/blowfish.sql
    contrib/pgcrypto/sql/crypt-blowfish.sql
    contrib/pgcrypto/sql/crypt-des.sql
    contrib/pgcrypto/sql/crypt-md5.sql
    contrib/pgcrypto/sql/crypt-xdes.sql
    contrib/pgcrypto/sql/hmac-md5.sql
    contrib/pgcrypto/sql/hmac-sha1.sql
    contrib/pgcrypto/sql/init.sql
    contrib/pgcrypto/sql/md5.sql
    contrib/pgcrypto/sql/rijndael.sql
    contrib/pgcrypto/sql/sha1.sql
    contrib/pgstattuple/Makefile
    contrib/pgstattuple/README.pgstattuple
    contrib/pgstattuple/README.pgstattuple.euc_jp
    contrib/pgstattuple/pgstattuple.c
    contrib/pgstattuple/pgstattuple.sql.in
    contrib/retep/CHANGELOG
    contrib/retep/Implementation
    contrib/retep/Makefile
    contrib/retep/README
    contrib/retep/build.xml
    contrib/retep/data/cds.dtd
    contrib/retep/data/cds.xml
    contrib/retep/retep.jpx
    contrib/retep/uk/org/retep/dtu/DCollection.java
    contrib/retep/uk/org/retep/dtu/DConstants.java
    contrib/retep/uk/org/retep/dtu/DElement.java
    contrib/retep/uk/org/retep/dtu/DEnvironment.java
    contrib/retep/uk/org/retep/dtu/DModule.java
    contrib/retep/uk/org/retep/dtu/DModuleXML.java
    contrib/retep/uk/org/retep/dtu/DNode.java
    contrib/retep/uk/org/retep/dtu/DProcessor.java
    contrib/retep/uk/org/retep/dtu/DTransform.java
    contrib/retep/uk/org/retep/tools/Tool.java
    contrib/retep/uk/org/retep/tools.properties
    contrib/retep/uk/org/retep/util/ExceptionDialog.java
    contrib/retep/uk/org/retep/util/Globals.java
    contrib/retep/uk/org/retep/util/Logger.java
    contrib/retep/uk/org/retep/util/Main.java
    contrib/retep/uk/org/retep/util/StandaloneApp.java
    contrib/retep/uk/org/retep/util/hba/Editor.java
    contrib/retep/uk/org/retep/util/hba/Main.java
    contrib/retep/uk/org/retep/util/hba/Record.java
    contrib/retep/uk/org/retep/util/misc/IPAddress.java
    contrib/retep/uk/org/retep/util/misc/PropertiesIO.java
    contrib/retep/uk/org/retep/util/misc/WStringTokenizer.java
    contrib/retep/uk/org/retep/util/models/HBATableModel.java
    contrib/retep/uk/org/retep/util/models/PropertiesTableModel.java
    contrib/retep/uk/org/retep/util/proped/Main.java
    contrib/retep/uk/org/retep/util/proped/PropertyEditor.java
    contrib/retep/uk/org/retep/xml/core/XMLFactory.java
    contrib/retep/uk/org/retep/xml/core/XMLFactoryException.java
    contrib/retep/uk/org/retep/xml/jdbc/XMLDatabase.java
    contrib/retep/uk/org/retep/xml/jdbc/XMLResultSet.java
    contrib/retep/uk/org/retep/xml/parser/TagHandler.java
    contrib/retep/uk/org/retep/xml/parser/TagListener.java
    contrib/retep/uk/org/retep/xml/test/XMLExport.java
    contrib/rserv/ApplySnapshot.in
    contrib/rserv/CleanLog.in
    contrib/rserv/GetSyncID.in
    contrib/rserv/InitRservTest.in
    contrib/rserv/Makefile
    contrib/rserv/MasterAddTable.in
    contrib/rserv/MasterInit.in
    contrib/rserv/MasterSync.in
    contrib/rserv/PrepareSnapshot.in
    contrib/rserv/README.rserv
    contrib/rserv/RServ.pm
    contrib/rserv/Replicate.in
    contrib/rserv/RservTest.in
    contrib/rserv/SlaveAddTable.in
    contrib/rserv/SlaveInit.in
    contrib/rserv/master.sql.in
    contrib/rserv/regress.sh
    contrib/rserv/rserv.c
    contrib/rserv/slave.sql.in
    contrib/rtree_gist/Makefile
    contrib/rtree_gist/README.rtree_gist
    contrib/rtree_gist/bench/bench.pl
    contrib/rtree_gist/bench/create_test.pl
    contrib/rtree_gist/data/test_box.data
    contrib/rtree_gist/expected/rtree_gist.out
    contrib/rtree_gist/rtree_gist.c
    contrib/rtree_gist/rtree_gist.sql.in
    contrib/rtree_gist/sql/rtree_gist.sql
    contrib/seg/Makefile
    contrib/seg/README.seg
    contrib/seg/buffer.c
    contrib/seg/buffer.h
    contrib/seg/data/test_seg.data
    contrib/seg/expected/seg.out
    contrib/seg/seg-validate.pl
    contrib/seg/seg.c
    contrib/seg/seg.sql.in
    contrib/seg/segdata.h
    contrib/seg/segparse.y
    contrib/seg/segscan.l
    contrib/seg/sort-segments.pl
    contrib/seg/sql/seg.sql
    contrib/spi/Makefile
    contrib/spi/README.spi
    contrib/spi/autoinc.c
    contrib/spi/autoinc.example
    contrib/spi/autoinc.sql.in
    contrib/spi/insert_username.c
    contrib/spi/insert_username.example
    contrib/spi/insert_username.sql.in
    contrib/spi/moddatetime.c
    contrib/spi/moddatetime.example
    contrib/spi/moddatetime.sql.in
    contrib/spi/preprocessor/README.MAX
    contrib/spi/preprocessor/example.sql
    contrib/spi/preprocessor/step1.c
    contrib/spi/preprocessor/step1.e
    contrib/spi/preprocessor/step2.pl
    contrib/spi/refint.c
    contrib/spi/refint.example
    contrib/spi/refint.sql.in
    contrib/spi/timetravel.c
    contrib/spi/timetravel.example
    contrib/spi/timetravel.sql.in
    contrib/start-scripts/freebsd
    contrib/start-scripts/linux
    contrib/string/Makefile
    contrib/string/README.string_io
    contrib/string/string_io.c
    contrib/string/string_io.h
    contrib/string/string_io.sql.in
    contrib/tips/Makefile
    contrib/tips/README.apachelog
    contrib/tools/add-emacs-variables
    contrib/tools/find-sources
    contrib/tools/make-tags
    contrib/tsearch/Makefile
    contrib/tsearch/README.tsearch
    contrib/tsearch/crc32.c
    contrib/tsearch/crc32.h
    contrib/tsearch/data/test_tsearch.data
    contrib/tsearch/deflex.h
    contrib/tsearch/dict/porter_english.dct
    contrib/tsearch/dict/russian_stemming.dct
    contrib/tsearch/dict.h
    contrib/tsearch/expected/tsearch.out
    contrib/tsearch/gistidx.c
    contrib/tsearch/gistidx.h
    contrib/tsearch/makedict/makedict.pl
    contrib/tsearch/morph.c
    contrib/tsearch/morph.h
    contrib/tsearch/parser.h
    contrib/tsearch/parser.l
    contrib/tsearch/query.c
    contrib/tsearch/query.h
    contrib/tsearch/rewrite.c
    contrib/tsearch/rewrite.h
    contrib/tsearch/sql/tsearch.sql
    contrib/tsearch/tsearch.sql.in
    contrib/tsearch/txtidx.c
    contrib/tsearch/txtidx.h
    contrib/userlock/Makefile
    contrib/userlock/README.user_locks
    contrib/userlock/user_locks.c
    contrib/userlock/user_locks.h
    contrib/userlock/user_locks.sql.in
    contrib/vacuumlo/Makefile
    contrib/vacuumlo/README.vacuumlo
    contrib/vacuumlo/vacuumlo.c
    contrib/xml/Makefile
    contrib/xml/README
    contrib/xml/TODO
    contrib/xml/pgxml.c
    contrib/xml/pgxml.h
    contrib/xml/pgxml.source
    contrib/xml/pgxml_dom.c
    contrib/xml/pgxml_dom.source
    doc/FAQ
    doc/FAQ_AIX
    doc/FAQ_DEV
    doc/FAQ_HPUX
    doc/FAQ_IRIX
    doc/FAQ_MSWIN
    doc/FAQ_QNX4
    doc/FAQ_SCO
    doc/FAQ_Solaris
    doc/FAQ_german
    doc/FAQ_japanese
    doc/FAQ_polish
    doc/FAQ_russian
    doc/KNOWN_BUGS
    doc/MISSING_FEATURES
    doc/Makefile
    doc/README.mb.big5
    doc/README.mb.jp
    doc/TODO
    doc/TODO.detail/README
    doc/TODO.detail/atttypmod
    doc/TODO.detail/crossdb
    doc/TODO.detail/cursor
    doc/TODO.detail/drop
    doc/TODO.detail/exists
    doc/TODO.detail/foreign
    doc/TODO.detail/fsync
    doc/TODO.detail/inheritance
    doc/TODO.detail/java
    doc/TODO.detail/mmap
    doc/TODO.detail/namedatalen
    doc/TODO.detail/optimizer
    doc/TODO.detail/performance
    doc/TODO.detail/persistent
    doc/TODO.detail/pool
    doc/TODO.detail/prepare
    doc/TODO.detail/privileges
    doc/TODO.detail/replication
    doc/TODO.detail/schema
    doc/TODO.detail/tablespaces
    doc/TODO.detail/thread
    doc/TODO.detail/transactions
    doc/TODO.detail/typeconv
    doc/TODO.detail/update
    doc/TODO.detail/vacuum
    doc/TODO.detail/view
    doc/TODO.detail/win32
    doc/TODO.detail/yacc
    doc/bug.template
    doc/src/FAQ/FAQ.html
    doc/src/FAQ/FAQ_DEV.html
    doc/src/FAQ/FAQ_german.html
    doc/src/FAQ/FAQ_japanese.html
    doc/src/FAQ/FAQ_polish.html
    doc/src/FAQ/FAQ_russian.html
    doc/src/Makefile
    doc/src/graphics/catalogs.ag
    doc/src/graphics/catalogs.cgm
    doc/src/graphics/catalogs.gif
    doc/src/graphics/catalogs.ps
    doc/src/graphics/clientserver.ag
    doc/src/graphics/clientserver.gif
    doc/src/graphics/connections.ag
    doc/src/graphics/connections.gif
    doc/src/sgml/Makefile
    doc/src/sgml/admin.sgml
    doc/src/sgml/advanced.sgml
    doc/src/sgml/arch-dev.sgml
    doc/src/sgml/arch-pg.sgml
    doc/src/sgml/array.sgml
    doc/src/sgml/backup.sgml
    doc/src/sgml/biblio.sgml
    doc/src/sgml/bki.sgml
    doc/src/sgml/book-decl.sgml
    doc/src/sgml/catalogs.sgml
    doc/src/sgml/charset.sgml
    doc/src/sgml/client-auth.sgml
    doc/src/sgml/compiler.sgml
    doc/src/sgml/contacts.sgml
    doc/src/sgml/cvs.sgml
    doc/src/sgml/datatype.sgml
    doc/src/sgml/datetime.sgml
    doc/src/sgml/developer.sgml
    doc/src/sgml/dfunc.sgml
    doc/src/sgml/diskusage.sgml
    doc/src/sgml/docguide.sgml
    doc/src/sgml/ecpg.sgml
    doc/src/sgml/extend.sgml
    doc/src/sgml/features.sgml
    doc/src/sgml/filelist.sgml
    doc/src/sgml/fixrtf
    doc/src/sgml/func-ref.sgml
    doc/src/sgml/func.sgml
    doc/src/sgml/geqo.sgml
    doc/src/sgml/gist.sgml
    doc/src/sgml/history.sgml
    doc/src/sgml/indexcost.sgml
    doc/src/sgml/indices.sgml
    doc/src/sgml/info.sgml
    doc/src/sgml/inherit.sgml
    doc/src/sgml/install-win32.sgml
    doc/src/sgml/installation.sgml
    doc/src/sgml/intro.sgml
    doc/src/sgml/jdbc.sgml
    doc/src/sgml/keywords.sgml
    doc/src/sgml/legal.sgml
    doc/src/sgml/libpgeasy.sgml
    doc/src/sgml/libpgtcl.sgml
    doc/src/sgml/libpq++.sgml
    doc/src/sgml/libpq.sgml
    doc/src/sgml/lobj.sgml
    doc/src/sgml/maintenance.sgml
    doc/src/sgml/manage-ag.sgml
    doc/src/sgml/manage.sgml
    doc/src/sgml/monitoring.sgml
    doc/src/sgml/mvcc.sgml
    doc/src/sgml/nls.sgml
    doc/src/sgml/notation.sgml
    doc/src/sgml/odbc.sgml
    doc/src/sgml/page.sgml
    doc/src/sgml/perform.sgml
    doc/src/sgml/plperl.sgml
    doc/src/sgml/plpython.sgml
    doc/src/sgml/plsql.sgml
    doc/src/sgml/pltcl.sgml
    doc/src/sgml/postgres.sgml
    doc/src/sgml/problems.sgml
    doc/src/sgml/programmer.sgml
    doc/src/sgml/protocol.sgml
    doc/src/sgml/pygresql.sgml
    doc/src/sgml/queries.sgml
    doc/src/sgml/query.sgml
    doc/src/sgml/recovery.sgml
    doc/src/sgml/ref/abort.sgml
    doc/src/sgml/ref/allfiles.sgml
    doc/src/sgml/ref/alter_database.sgml
    doc/src/sgml/ref/alter_group.sgml
    doc/src/sgml/ref/alter_table.sgml
    doc/src/sgml/ref/alter_trigger.sgml
    doc/src/sgml/ref/alter_user.sgml
    doc/src/sgml/ref/analyze.sgml
    doc/src/sgml/ref/begin.sgml
    doc/src/sgml/ref/checkpoint.sgml
    doc/src/sgml/ref/close.sgml
    doc/src/sgml/ref/cluster.sgml
    doc/src/sgml/ref/comment.sgml
    doc/src/sgml/ref/commit.sgml
    doc/src/sgml/ref/copy.sgml
    doc/src/sgml/ref/create_aggregate.sgml
    doc/src/sgml/ref/create_constraint.sgml
    doc/src/sgml/ref/create_database.sgml
    doc/src/sgml/ref/create_domain.sgml
    doc/src/sgml/ref/create_function.sgml
    doc/src/sgml/ref/create_group.sgml
    doc/src/sgml/ref/create_index.sgml
    doc/src/sgml/ref/create_language.sgml
    doc/src/sgml/ref/create_operator.sgml
    doc/src/sgml/ref/create_rule.sgml
    doc/src/sgml/ref/create_schema.sgml
    doc/src/sgml/ref/create_sequence.sgml
    doc/src/sgml/ref/create_table.sgml
    doc/src/sgml/ref/create_table_as.sgml
    doc/src/sgml/ref/create_trigger.sgml
    doc/src/sgml/ref/create_type.sgml
    doc/src/sgml/ref/create_user.sgml
    doc/src/sgml/ref/create_view.sgml
    doc/src/sgml/ref/createdb.sgml
    doc/src/sgml/ref/createlang.sgml
    doc/src/sgml/ref/createuser.sgml
    doc/src/sgml/ref/current_date.sgml
    doc/src/sgml/ref/current_time.sgml
    doc/src/sgml/ref/current_timestamp.sgml
    doc/src/sgml/ref/current_user.sgml
    doc/src/sgml/ref/declare.sgml
    doc/src/sgml/ref/delete.sgml
    doc/src/sgml/ref/drop_aggregate.sgml
    doc/src/sgml/ref/drop_database.sgml
    doc/src/sgml/ref/drop_domain.sgml
    doc/src/sgml/ref/drop_function.sgml
    doc/src/sgml/ref/drop_group.sgml
    doc/src/sgml/ref/drop_index.sgml
    doc/src/sgml/ref/drop_language.sgml
    doc/src/sgml/ref/drop_operator.sgml
    doc/src/sgml/ref/drop_rule.sgml
    doc/src/sgml/ref/drop_sequence.sgml
    doc/src/sgml/ref/drop_table.sgml
    doc/src/sgml/ref/drop_trigger.sgml
    doc/src/sgml/ref/drop_type.sgml
    doc/src/sgml/ref/drop_user.sgml
    doc/src/sgml/ref/drop_view.sgml
    doc/src/sgml/ref/dropdb.sgml
    doc/src/sgml/ref/droplang.sgml
    doc/src/sgml/ref/dropuser.sgml
    doc/src/sgml/ref/ecpg-ref.sgml
    doc/src/sgml/ref/end.sgml
    doc/src/sgml/ref/explain.sgml
    doc/src/sgml/ref/fetch.sgml
    doc/src/sgml/ref/grant.sgml
    doc/src/sgml/ref/initdb.sgml
    doc/src/sgml/ref/initlocation.sgml
    doc/src/sgml/ref/insert.sgml
    doc/src/sgml/ref/ipcclean.sgml
    doc/src/sgml/ref/listen.sgml
    doc/src/sgml/ref/load.sgml
    doc/src/sgml/ref/lock.sgml
    doc/src/sgml/ref/move.sgml
    doc/src/sgml/ref/notify.sgml
    doc/src/sgml/ref/pg_config-ref.sgml
    doc/src/sgml/ref/pg_ctl-ref.sgml
    doc/src/sgml/ref/pg_dump.sgml
    doc/src/sgml/ref/pg_dumpall.sgml
    doc/src/sgml/ref/pg_restore.sgml
    doc/src/sgml/ref/pgaccess-ref.sgml
    doc/src/sgml/ref/pgtclsh.sgml
    doc/src/sgml/ref/pgtksh.sgml
    doc/src/sgml/ref/postgres-ref.sgml
    doc/src/sgml/ref/postmaster.sgml
    doc/src/sgml/ref/psql-ref.sgml
    doc/src/sgml/ref/reindex.sgml
    doc/src/sgml/ref/reset.sgml
    doc/src/sgml/ref/revoke.sgml
    doc/src/sgml/ref/rollback.sgml
    doc/src/sgml/ref/select.sgml
    doc/src/sgml/ref/select_into.sgml
    doc/src/sgml/ref/set.sgml
    doc/src/sgml/ref/set_constraints.sgml
    doc/src/sgml/ref/set_session_auth.sgml
    doc/src/sgml/ref/set_transaction.sgml
    doc/src/sgml/ref/show.sgml
    doc/src/sgml/ref/truncate.sgml
    doc/src/sgml/ref/unlisten.sgml
    doc/src/sgml/ref/update.sgml
    doc/src/sgml/ref/vacuum.sgml
    doc/src/sgml/ref/vacuumdb.sgml
    doc/src/sgml/refentry.sgml
    doc/src/sgml/reference.ced
    doc/src/sgml/reference.sgml
    doc/src/sgml/regress.sgml
    doc/src/sgml/release.sgml
    doc/src/sgml/rules.sgml
    doc/src/sgml/runtime.sgml
    doc/src/sgml/sources.sgml
    doc/src/sgml/spi.sgml
    doc/src/sgml/sql.sgml
    doc/src/sgml/standalone-install.sgml
    doc/src/sgml/start.sgml
    doc/src/sgml/stylesheet.css
    doc/src/sgml/stylesheet.dsl
    doc/src/sgml/syntax.sgml
    doc/src/sgml/trigger.sgml
    doc/src/sgml/tutorial.sgml
    doc/src/sgml/typeconv.sgml
    doc/src/sgml/user-manag.sgml
    doc/src/sgml/user.sgml
    doc/src/sgml/version.sgml
    doc/src/sgml/wal.sgml
    doc/src/sgml/xaggr.sgml
    doc/src/sgml/xfunc.sgml
    doc/src/sgml/xindex.sgml
    doc/src/sgml/xoper.sgml
    doc/src/sgml/xplang.sgml
    doc/src/sgml/xtypes.sgml
    doc/src/sgml/y2k.sgml
    register.txt
    src/DEVELOPERS
    src/Makefile
    src/Makefile.global.in
    src/Makefile.shlib
    src/backend/Makefile
    src/backend/access/Makefile
    src/backend/access/common/Makefile
    src/backend/access/common/heaptuple.c
    src/backend/access/common/indextuple.c
    src/backend/access/common/indexvalid.c
    src/backend/access/common/printtup.c
    src/backend/access/common/scankey.c
    src/backend/access/common/tupdesc.c
    src/backend/access/gist/Makefile
    src/backend/access/gist/gist.c
    src/backend/access/gist/gistget.c
    src/backend/access/gist/gistscan.c
    src/backend/access/gist/giststrat.c
    src/backend/access/hash/Makefile
    src/backend/access/hash/hash.c
    src/backend/access/hash/hashfunc.c
    src/backend/access/hash/hashinsert.c
    src/backend/access/hash/hashovfl.c
    src/backend/access/hash/hashpage.c
    src/backend/access/hash/hashscan.c
    src/backend/access/hash/hashsearch.c
    src/backend/access/hash/hashstrat.c
    src/backend/access/hash/hashutil.c
    src/backend/access/heap/Makefile
    src/backend/access/heap/heapam.c
    src/backend/access/heap/hio.c
    src/backend/access/heap/tuptoaster.c
    src/backend/access/index/Makefile
    src/backend/access/index/genam.c
    src/backend/access/index/indexam.c
    src/backend/access/index/istrat.c
    src/backend/access/nbtree/Makefile
    src/backend/access/nbtree/README
    src/backend/access/nbtree/nbtcompare.c
    src/backend/access/nbtree/nbtinsert.c
    src/backend/access/nbtree/nbtpage.c
    src/backend/access/nbtree/nbtree.c
    src/backend/access/nbtree/nbtsearch.c
    src/backend/access/nbtree/nbtsort.c
    src/backend/access/nbtree/nbtstrat.c
    src/backend/access/nbtree/nbtutils.c
    src/backend/access/rtree/Makefile
    src/backend/access/rtree/rtget.c
    src/backend/access/rtree/rtproc.c
    src/backend/access/rtree/rtree.c
    src/backend/access/rtree/rtscan.c
    src/backend/access/rtree/rtstrat.c
    src/backend/access/transam/Makefile
    src/backend/access/transam/clog.c
    src/backend/access/transam/rmgr.c
    src/backend/access/transam/transam.c
    src/backend/access/transam/varsup.c
    src/backend/access/transam/xact.c
    src/backend/access/transam/xid.c
    src/backend/access/transam/xlog.c
    src/backend/access/transam/xlogutils.c
    src/backend/bootstrap/.cvsignore
    src/backend/bootstrap/Makefile
    src/backend/bootstrap/bootparse.y
    src/backend/bootstrap/bootscanner.l
    src/backend/bootstrap/bootstrap.c
    src/backend/catalog/Makefile
    src/backend/catalog/README
    src/backend/catalog/aclchk.c
    src/backend/catalog/catalog.c
    src/backend/catalog/genbki.sh
    src/backend/catalog/heap.c
    src/backend/catalog/index.c
    src/backend/catalog/indexing.c
    src/backend/catalog/namespace.c
    src/backend/catalog/pg_aggregate.c
    src/backend/catalog/pg_largeobject.c
    src/backend/catalog/pg_namespace.c
    src/backend/catalog/pg_operator.c
    src/backend/catalog/pg_proc.c
    src/backend/catalog/pg_type.c
    src/backend/commands/Makefile
    src/backend/commands/_deadcode/recipe.c
    src/backend/commands/_deadcode/recipe.h
    src/backend/commands/_deadcode/version.c
    src/backend/commands/aggregatecmds.c
    src/backend/commands/analyze.c
    src/backend/commands/async.c
    src/backend/commands/cluster.c
    src/backend/commands/comment.c
    src/backend/commands/copy.c
    src/backend/commands/dbcommands.c
    src/backend/commands/define.c
    src/backend/commands/explain.c
    src/backend/commands/functioncmds.c
    src/backend/commands/indexcmds.c
    src/backend/commands/lockcmds.c
    src/backend/commands/operatorcmds.c
    src/backend/commands/portalcmds.c
    src/backend/commands/proclang.c
    src/backend/commands/schemacmds.c
    src/backend/commands/sequence.c
    src/backend/commands/tablecmds.c
    src/backend/commands/trigger.c
    src/backend/commands/typecmds.c
    src/backend/commands/user.c
    src/backend/commands/vacuum.c
    src/backend/commands/vacuumlazy.c
    src/backend/commands/variable.c
    src/backend/commands/view.c
    src/backend/executor/Makefile
    src/backend/executor/README
    src/backend/executor/_deadcode/nodeTee.c
    src/backend/executor/execAmi.c
    src/backend/executor/execJunk.c
    src/backend/executor/execMain.c
    src/backend/executor/execProcnode.c
    src/backend/executor/execQual.c
    src/backend/executor/execScan.c
    src/backend/executor/execTuples.c
    src/backend/executor/execUtils.c
    src/backend/executor/functions.c
    src/backend/executor/instrument.c
    src/backend/executor/nodeAgg.c
    src/backend/executor/nodeAppend.c
    src/backend/executor/nodeFunctionscan.c
    src/backend/executor/nodeGroup.c
    src/backend/executor/nodeHash.c
    src/backend/executor/nodeHashjoin.c
    src/backend/executor/nodeIndexscan.c
    src/backend/executor/nodeLimit.c
    src/backend/executor/nodeMaterial.c
    src/backend/executor/nodeMergejoin.c
    src/backend/executor/nodeNestloop.c
    src/backend/executor/nodeResult.c
    src/backend/executor/nodeSeqscan.c
    src/backend/executor/nodeSetOp.c
    src/backend/executor/nodeSort.c
    src/backend/executor/nodeSubplan.c
    src/backend/executor/nodeSubqueryscan.c
    src/backend/executor/nodeTidscan.c
    src/backend/executor/nodeUnique.c
    src/backend/executor/spi.c
    src/backend/lib/Makefile
    src/backend/lib/bit.c
    src/backend/lib/dllist.c
    src/backend/lib/lispsort.c
    src/backend/lib/stringinfo.c
    src/backend/libpq/Makefile
    src/backend/libpq/README.SSL
    src/backend/libpq/auth.c
    src/backend/libpq/be-fsstubs.c
    src/backend/libpq/be-secure.c
    src/backend/libpq/crypt.c
    src/backend/libpq/hba.c
    src/backend/libpq/md5.c
    src/backend/libpq/pg_hba.conf.sample
    src/backend/libpq/pg_ident.conf.sample
    src/backend/libpq/pqcomm.c
    src/backend/libpq/pqformat.c
    src/backend/libpq/pqsignal.c
    src/backend/main/Makefile
    src/backend/main/main.c
    src/backend/nodes/Makefile
    src/backend/nodes/README
    src/backend/nodes/copyfuncs.c
    src/backend/nodes/equalfuncs.c
    src/backend/nodes/list.c
    src/backend/nodes/makefuncs.c
    src/backend/nodes/nodeFuncs.c
    src/backend/nodes/nodes.c
    src/backend/nodes/outfuncs.c
    src/backend/nodes/print.c
    src/backend/nodes/read.c
    src/backend/nodes/readfuncs.c
    src/backend/optimizer/Makefile
    src/backend/optimizer/README
    src/backend/optimizer/geqo/Makefile
    src/backend/optimizer/geqo/geqo_copy.c
    src/backend/optimizer/geqo/geqo_cx.c
    src/backend/optimizer/geqo/geqo_erx.c
    src/backend/optimizer/geqo/geqo_eval.c
    src/backend/optimizer/geqo/geqo_main.c
    src/backend/optimizer/geqo/geqo_misc.c
    src/backend/optimizer/geqo/geqo_mutation.c
    src/backend/optimizer/geqo/geqo_ox1.c
    src/backend/optimizer/geqo/geqo_ox2.c
    src/backend/optimizer/geqo/geqo_pmx.c
    src/backend/optimizer/geqo/geqo_pool.c
    src/backend/optimizer/geqo/geqo_px.c
    src/backend/optimizer/geqo/geqo_recombination.c
    src/backend/optimizer/geqo/geqo_selection.c
    src/backend/optimizer/path/Makefile
    src/backend/optimizer/path/_deadcode/predmig.c
    src/backend/optimizer/path/_deadcode/xfunc.c
    src/backend/optimizer/path/allpaths.c
    src/backend/optimizer/path/clausesel.c
    src/backend/optimizer/path/costsize.c
    src/backend/optimizer/path/indxpath.c
    src/backend/optimizer/path/joinpath.c
    src/backend/optimizer/path/joinrels.c
    src/backend/optimizer/path/orindxpath.c
    src/backend/optimizer/path/pathkeys.c
    src/backend/optimizer/path/tidpath.c
    src/backend/optimizer/plan/Makefile
    src/backend/optimizer/plan/README
    src/backend/optimizer/plan/createplan.c
    src/backend/optimizer/plan/initsplan.c
    src/backend/optimizer/plan/planmain.c
    src/backend/optimizer/plan/planner.c
    src/backend/optimizer/plan/setrefs.c
    src/backend/optimizer/plan/subselect.c
    src/backend/optimizer/prep/Makefile
    src/backend/optimizer/prep/_deadcode/prepkeyset.c
    src/backend/optimizer/prep/prepqual.c
    src/backend/optimizer/prep/preptlist.c
    src/backend/optimizer/prep/prepunion.c
    src/backend/optimizer/util/Makefile
    src/backend/optimizer/util/clauses.c
    src/backend/optimizer/util/joininfo.c
    src/backend/optimizer/util/pathnode.c
    src/backend/optimizer/util/plancat.c
    src/backend/optimizer/util/relnode.c
    src/backend/optimizer/util/restrictinfo.c
    src/backend/optimizer/util/tlist.c
    src/backend/optimizer/util/var.c
    src/backend/parser/.cvsignore
    src/backend/parser/Makefile
    src/backend/parser/README
    src/backend/parser/analyze.c
    src/backend/parser/gram.y
    src/backend/parser/keywords.c
    src/backend/parser/parse_agg.c
    src/backend/parser/parse_clause.c
    src/backend/parser/parse_coerce.c
    src/backend/parser/parse_expr.c
    src/backend/parser/parse_func.c
    src/backend/parser/parse_node.c
    src/backend/parser/parse_oper.c
    src/backend/parser/parse_relation.c
    src/backend/parser/parse_target.c
    src/backend/parser/parse_type.c
    src/backend/parser/parser.c
    src/backend/parser/scan.l
    src/backend/parser/scansup.c
    src/backend/po/Makefile
    src/backend/po/cs.po
    src/backend/po/de.po
    src/backend/po/hu.po
    src/backend/po/nls.mk
    src/backend/po/ru.po
    src/backend/po/zh_CN.po
    src/backend/po/zh_TW.po
    src/backend/port/Makefile
    src/backend/port/aix/mkldexport.sh
    src/backend/port/beos/Makefile
    src/backend/port/beos/sem.c
    src/backend/port/beos/shm.c
    src/backend/port/beos/support.c
    src/backend/port/darwin/Makefile
    src/backend/port/darwin/README
    src/backend/port/darwin/system.c
    src/backend/port/dynloader/README.dlfcn.aix
    src/backend/port/dynloader/aix.c
    src/backend/port/dynloader/aix.h
    src/backend/port/dynloader/beos.c
    src/backend/port/dynloader/beos.h
    src/backend/port/dynloader/bsdi.c
    src/backend/port/dynloader/bsdi.h
    src/backend/port/dynloader/darwin.c
    src/backend/port/dynloader/darwin.h
    src/backend/port/dynloader/dgux.c
    src/backend/port/dynloader/dgux.h
    src/backend/port/dynloader/freebsd.c
    src/backend/port/dynloader/freebsd.h
    src/backend/port/dynloader/hpux.c
    src/backend/port/dynloader/hpux.h
    src/backend/port/dynloader/irix5.c
    src/backend/port/dynloader/irix5.h
    src/backend/port/dynloader/linux.c
    src/backend/port/dynloader/linux.h
    src/backend/port/dynloader/netbsd.c
    src/backend/port/dynloader/netbsd.h
    src/backend/port/dynloader/nextstep.c
    src/backend/port/dynloader/nextstep.h
    src/backend/port/dynloader/openbsd.c
    src/backend/port/dynloader/openbsd.h
    src/backend/port/dynloader/osf.c
    src/backend/port/dynloader/osf.h
    src/backend/port/dynloader/qnx4.c
    src/backend/port/dynloader/qnx4.h
    src/backend/port/dynloader/sco.c
    src/backend/port/dynloader/sco.h
    src/backend/port/dynloader/solaris.c
    src/backend/port/dynloader/solaris.h
    src/backend/port/dynloader/sunos4.c
    src/backend/port/dynloader/sunos4.h
    src/backend/port/dynloader/svr4.c
    src/backend/port/dynloader/svr4.h
    src/backend/port/dynloader/ultrix4.c
    src/backend/port/dynloader/ultrix4.h
    src/backend/port/dynloader/univel.c
    src/backend/port/dynloader/univel.h
    src/backend/port/dynloader/unixware.c
    src/backend/port/dynloader/unixware.h
    src/backend/port/dynloader/win.c
    src/backend/port/dynloader/win.h
    src/backend/port/gethostname.c
    src/backend/port/getrusage.c
    src/backend/port/hpux/tas.c.template
    src/backend/port/inet_aton.c
    src/backend/port/inet_aton.h
    src/backend/port/ipc_test.c
    src/backend/port/isinf.c
    src/backend/port/memcmp.c
    src/backend/port/nextstep/Makefile
    src/backend/port/nextstep/port.c
    src/backend/port/posix_sema.c
    src/backend/port/qnx4/Makefile
    src/backend/port/qnx4/ipc.h
    src/backend/port/qnx4/isnan.c
    src/backend/port/qnx4/rint.c
    src/backend/port/qnx4/sem.c
    src/backend/port/qnx4/sem.h
    src/backend/port/qnx4/shm.c
    src/backend/port/qnx4/shm.h
    src/backend/port/qnx4/tstrint.c
    src/backend/port/qnx4/tstsem.c
    src/backend/port/qnx4/tstshm.c
    src/backend/port/random.c
    src/backend/port/snprintf.c
    src/backend/port/srandom.c
    src/backend/port/strcasecmp.c
    src/backend/port/strerror.c
    src/backend/port/strtol.c
    src/backend/port/strtoul.c
    src/backend/port/sunos4/Makefile
    src/backend/port/sunos4/float.h
    src/backend/port/sysv_sema.c
    src/backend/port/sysv_shmem.c
    src/backend/port/tas/dummy.s
    src/backend/port/tas/hpux.s
    src/backend/port/tas/solaris_i386.s
    src/backend/port/tas/solaris_sparc.s
    src/backend/postmaster/Makefile
    src/backend/postmaster/pgstat.c
    src/backend/postmaster/postmaster.c
    src/backend/regex/COPYRIGHT
    src/backend/regex/Makefile
    src/backend/regex/WHATSNEW
    src/backend/regex/engine.c
    src/backend/regex/re_format.7
    src/backend/regex/regcomp.c
    src/backend/regex/regerror.c
    src/backend/regex/regex.3
    src/backend/regex/regexec.c
    src/backend/regex/regfree.c
    src/backend/regex/retest.c
    src/backend/rewrite/Makefile
    src/backend/rewrite/rewriteDefine.c
    src/backend/rewrite/rewriteHandler.c
    src/backend/rewrite/rewriteManip.c
    src/backend/rewrite/rewriteRemove.c
    src/backend/rewrite/rewriteSupport.c
    src/backend/storage/Makefile
    src/backend/storage/buffer/Makefile
    src/backend/storage/buffer/README
    src/backend/storage/buffer/buf_init.c
    src/backend/storage/buffer/buf_table.c
    src/backend/storage/buffer/bufmgr.c
    src/backend/storage/buffer/freelist.c
    src/backend/storage/buffer/localbuf.c
    src/backend/storage/file/Makefile
    src/backend/storage/file/buffile.c
    src/backend/storage/file/fd.c
    src/backend/storage/freespace/Makefile
    src/backend/storage/freespace/freespace.c
    src/backend/storage/ipc/Makefile
    src/backend/storage/ipc/README
    src/backend/storage/ipc/ipc.c
    src/backend/storage/ipc/ipci.c
    src/backend/storage/ipc/pmsignal.c
    src/backend/storage/ipc/shmem.c
    src/backend/storage/ipc/shmqueue.c
    src/backend/storage/ipc/sinval.c
    src/backend/storage/ipc/sinvaladt.c
    src/backend/storage/large_object/Makefile
    src/backend/storage/large_object/inv_api.c
    src/backend/storage/lmgr/Makefile
    src/backend/storage/lmgr/README
    src/backend/storage/lmgr/deadlock.c
    src/backend/storage/lmgr/lmgr.c
    src/backend/storage/lmgr/lock.c
    src/backend/storage/lmgr/lwlock.c
    src/backend/storage/lmgr/proc.c
    src/backend/storage/lmgr/s_lock.c
    src/backend/storage/lmgr/spin.c
    src/backend/storage/page/Makefile
    src/backend/storage/page/bufpage.c
    src/backend/storage/page/itemptr.c
    src/backend/storage/smgr/Makefile
    src/backend/storage/smgr/README
    src/backend/storage/smgr/md.c
    src/backend/storage/smgr/mm.c
    src/backend/storage/smgr/smgr.c
    src/backend/storage/smgr/smgrtype.c
    src/backend/tcop/Makefile
    src/backend/tcop/dest.c
    src/backend/tcop/fastpath.c
    src/backend/tcop/postgres.c
    src/backend/tcop/pquery.c
    src/backend/tcop/utility.c
    src/backend/tioga/Arr_TgRecipe.h
    src/backend/tioga/Makefile
    src/backend/tioga/Varray.c
    src/backend/tioga/Varray.h
    src/backend/tioga/tgRecipe.c
    src/backend/tioga/tgRecipe.h
    src/backend/utils/.cvsignore
    src/backend/utils/Gen_fmgrtab.sh
    src/backend/utils/Makefile
    src/backend/utils/adt/Makefile
    src/backend/utils/adt/acl.c
    src/backend/utils/adt/arrayfuncs.c
    src/backend/utils/adt/arrayutils.c
    src/backend/utils/adt/ascii.c
    src/backend/utils/adt/bool.c
    src/backend/utils/adt/cash.c
    src/backend/utils/adt/char.c
    src/backend/utils/adt/date.c
    src/backend/utils/adt/datetime.c
    src/backend/utils/adt/datum.c
    src/backend/utils/adt/encode.c
    src/backend/utils/adt/float.c
    src/backend/utils/adt/format_type.c
    src/backend/utils/adt/formatting.c
    src/backend/utils/adt/geo_ops.c
    src/backend/utils/adt/geo_selfuncs.c
    src/backend/utils/adt/inet_net_ntop.c
    src/backend/utils/adt/inet_net_pton.c
    src/backend/utils/adt/int.c
    src/backend/utils/adt/int8.c
    src/backend/utils/adt/like.c
    src/backend/utils/adt/like_match.c
    src/backend/utils/adt/mac.c
    src/backend/utils/adt/misc.c
    src/backend/utils/adt/nabstime.c
    src/backend/utils/adt/name.c
    src/backend/utils/adt/network.c
    src/backend/utils/adt/not_in.c
    src/backend/utils/adt/numeric.c
    src/backend/utils/adt/numutils.c
    src/backend/utils/adt/oid.c
    src/backend/utils/adt/oracle_compat.c
    src/backend/utils/adt/pg_locale.c
    src/backend/utils/adt/pg_lzcompress.c
    src/backend/utils/adt/pgstatfuncs.c
    src/backend/utils/adt/quote.c
    src/backend/utils/adt/regexp.c
    src/backend/utils/adt/regproc.c
    src/backend/utils/adt/ri_triggers.c
    src/backend/utils/adt/ruleutils.c
    src/backend/utils/adt/selfuncs.c
    src/backend/utils/adt/sets.c
    src/backend/utils/adt/tid.c
    src/backend/utils/adt/timestamp.c
    src/backend/utils/adt/varbit.c
    src/backend/utils/adt/varchar.c
    src/backend/utils/adt/varlena.c
    src/backend/utils/adt/version.c
    src/backend/utils/cache/Makefile
    src/backend/utils/cache/catcache.c
    src/backend/utils/cache/fcache.c
    src/backend/utils/cache/inval.c
    src/backend/utils/cache/lsyscache.c
    src/backend/utils/cache/relcache.c
    src/backend/utils/cache/syscache.c
    src/backend/utils/error/Makefile
    src/backend/utils/error/assert.c
    src/backend/utils/error/elog.c
    src/backend/utils/error/exc.c
    src/backend/utils/error/excabort.c
    src/backend/utils/error/excid.c
    src/backend/utils/error/format.c
    src/backend/utils/fmgr/Makefile
    src/backend/utils/fmgr/README
    src/backend/utils/fmgr/dfmgr.c
    src/backend/utils/fmgr/fmgr.c
    src/backend/utils/hash/Makefile
    src/backend/utils/hash/dynahash.c
    src/backend/utils/hash/hashfn.c
    src/backend/utils/hash/pg_crc.c
    src/backend/utils/init/Makefile
    src/backend/utils/init/findbe.c
    src/backend/utils/init/globals.c
    src/backend/utils/init/miscinit.c
    src/backend/utils/init/postinit.c
    src/backend/utils/mb/Makefile
    src/backend/utils/mb/README
    src/backend/utils/mb/Unicode/ISO10646-GB18030.TXT
    src/backend/utils/mb/Unicode/Makefile
    src/backend/utils/mb/Unicode/UCS_to_8859.pl
    src/backend/utils/mb/Unicode/UCS_to_BIG5.pl
    src/backend/utils/mb/Unicode/UCS_to_EUC_CN.pl
    src/backend/utils/mb/Unicode/UCS_to_EUC_JP.pl
    src/backend/utils/mb/Unicode/UCS_to_EUC_KR.pl
    src/backend/utils/mb/Unicode/UCS_to_EUC_TW.pl
    src/backend/utils/mb/Unicode/UCS_to_GB18030.pl
    src/backend/utils/mb/Unicode/UCS_to_GBK.pl
    src/backend/utils/mb/Unicode/UCS_to_JOHAB.pl
    src/backend/utils/mb/Unicode/UCS_to_SJIS.pl
    src/backend/utils/mb/Unicode/UCS_to_UHC.pl
    src/backend/utils/mb/Unicode/UCS_to_WIN874.pl
    src/backend/utils/mb/Unicode/UCS_to_WINX.pl
    src/backend/utils/mb/Unicode/UCS_to_cyrillic.pl
    src/backend/utils/mb/Unicode/alt_to_utf8.map
    src/backend/utils/mb/Unicode/big5_to_utf8.map
    src/backend/utils/mb/Unicode/euc_cn_to_utf8.map
    src/backend/utils/mb/Unicode/euc_jp_to_utf8.map
    src/backend/utils/mb/Unicode/euc_kr_to_utf8.map
    src/backend/utils/mb/Unicode/euc_tw_to_utf8.map
    src/backend/utils/mb/Unicode/gb18030_to_utf8.map
    src/backend/utils/mb/Unicode/gbk_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_10_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_13_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_14_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_15_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_16_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_2_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_3_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_4_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_5_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_6_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_7_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_8_to_utf8.map
    src/backend/utils/mb/Unicode/iso8859_9_to_utf8.map
    src/backend/utils/mb/Unicode/johab_to_utf8.map
    src/backend/utils/mb/Unicode/koi8r_to_utf8.map
    src/backend/utils/mb/Unicode/sjis_to_utf8.map
    src/backend/utils/mb/Unicode/tcvn_to_utf8.map
    src/backend/utils/mb/Unicode/ucs2utf.pl
    src/backend/utils/mb/Unicode/uhc_to_utf8.map
    src/backend/utils/mb/Unicode/utf8_to_alt.map
    src/backend/utils/mb/Unicode/utf8_to_big5.map
    src/backend/utils/mb/Unicode/utf8_to_euc_cn.map
    src/backend/utils/mb/Unicode/utf8_to_euc_jp.map
    src/backend/utils/mb/Unicode/utf8_to_euc_kr.map
    src/backend/utils/mb/Unicode/utf8_to_euc_tw.map
    src/backend/utils/mb/Unicode/utf8_to_gb18030.map
    src/backend/utils/mb/Unicode/utf8_to_gbk.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_10.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_13.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_14.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_15.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_16.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_2.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_3.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_4.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_5.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_6.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_7.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_8.map
    src/backend/utils/mb/Unicode/utf8_to_iso8859_9.map
    src/backend/utils/mb/Unicode/utf8_to_johab.map
    src/backend/utils/mb/Unicode/utf8_to_koi8r.map
    src/backend/utils/mb/Unicode/utf8_to_sjis.map
    src/backend/utils/mb/Unicode/utf8_to_tcvn.map
    src/backend/utils/mb/Unicode/utf8_to_uhc.map
    src/backend/utils/mb/Unicode/utf8_to_win1250.map
    src/backend/utils/mb/Unicode/utf8_to_win1251.map
    src/backend/utils/mb/Unicode/utf8_to_win1256.map
    src/backend/utils/mb/Unicode/utf8_to_win874.map
    src/backend/utils/mb/Unicode/win1250_to_utf8.map
    src/backend/utils/mb/Unicode/win1251_to_utf8.map
    src/backend/utils/mb/Unicode/win1256_to_utf8.map
    src/backend/utils/mb/Unicode/win874_to_utf8.map
    src/backend/utils/mb/alt.c
    src/backend/utils/mb/big5.c
    src/backend/utils/mb/conv.c
    src/backend/utils/mb/encnames.c
    src/backend/utils/mb/iso.c
    src/backend/utils/mb/mbutils.c
    src/backend/utils/mb/sjis.map
    src/backend/utils/mb/wchar.c
    src/backend/utils/mb/win.c
    src/backend/utils/mb/win1251.c
    src/backend/utils/mb/wstrcmp.c
    src/backend/utils/mb/wstrncmp.c
    src/backend/utils/misc/.cvsignore
    src/backend/utils/misc/Makefile
    src/backend/utils/misc/README
    src/backend/utils/misc/database.c
    src/backend/utils/misc/guc-file.l
    src/backend/utils/misc/guc.c
    src/backend/utils/misc/postgresql.conf.sample
    src/backend/utils/misc/ps_status.c
    src/backend/utils/misc/superuser.c
    src/backend/utils/mmgr/Makefile
    src/backend/utils/mmgr/README
    src/backend/utils/mmgr/aset.c
    src/backend/utils/mmgr/mcxt.c
    src/backend/utils/mmgr/portalmem.c
    src/backend/utils/sort/Makefile
    src/backend/utils/sort/logtape.c
    src/backend/utils/sort/tuplesort.c
    src/backend/utils/sort/tuplestore.c
    src/backend/utils/time/Makefile
    src/backend/utils/time/tqual.c
    src/bin/Makefile
    src/bin/initdb/Makefile
    src/bin/initdb/initdb.sh
    src/bin/initlocation/Makefile
    src/bin/initlocation/initlocation.sh
    src/bin/ipcclean/Makefile
    src/bin/ipcclean/ipcclean.sh
    src/bin/pg_config/Makefile
    src/bin/pg_config/pg_config.sh
    src/bin/pg_ctl/Makefile
    src/bin/pg_ctl/pg_ctl.sh
    src/bin/pg_dump/Makefile
    src/bin/pg_dump/README
    src/bin/pg_dump/common.c
    src/bin/pg_dump/cs.po
    src/bin/pg_dump/de.po
    src/bin/pg_dump/nls.mk
    src/bin/pg_dump/pg_backup.h
    src/bin/pg_dump/pg_backup_archiver.c
    src/bin/pg_dump/pg_backup_archiver.h
    src/bin/pg_dump/pg_backup_custom.c
    src/bin/pg_dump/pg_backup_db.c
    src/bin/pg_dump/pg_backup_db.h
    src/bin/pg_dump/pg_backup_files.c
    src/bin/pg_dump/pg_backup_null.c
    src/bin/pg_dump/pg_backup_tar.c
    src/bin/pg_dump/pg_backup_tar.h
    src/bin/pg_dump/pg_dump.c
    src/bin/pg_dump/pg_dump.h
    src/bin/pg_dump/pg_dumpall.sh
    src/bin/pg_dump/pg_restore.c
    src/bin/pg_dump/ru.po
    src/bin/pg_dump/sv.po
    src/bin/pg_dump/zh_CN.po
    src/bin/pg_dump/zh_TW.po
    src/bin/pg_encoding/Makefile
    src/bin/pg_encoding/pg_encoding.c
    src/bin/pg_id/Makefile
    src/bin/pg_id/pg_id.c
    src/bin/pgaccess/Makefile
    src/bin/pgaccess/README
    src/bin/pgaccess/copyright.html
    src/bin/pgaccess/demo/formdemo.sql
    src/bin/pgaccess/doc/html/a_right.gif
    src/bin/pgaccess/doc/html/addindex.gif
    src/bin/pgaccess/doc/html/api.html
    src/bin/pgaccess/doc/html/ball.gif
    src/bin/pgaccess/doc/html/contents.html
    src/bin/pgaccess/doc/html/copyright.html
    src/bin/pgaccess/doc/html/documentation.html
    src/bin/pgaccess/doc/html/download.html
    src/bin/pgaccess/doc/html/faq.html
    src/bin/pgaccess/doc/html/features.html
    src/bin/pgaccess/doc/html/formdemo.sql
    src/bin/pgaccess/doc/html/forms.gif
    src/bin/pgaccess/doc/html/forms.html
    src/bin/pgaccess/doc/html/function.gif
    src/bin/pgaccess/doc/html/help.gif
    src/bin/pgaccess/doc/html/index.html
    src/bin/pgaccess/doc/html/irix.html
    src/bin/pgaccess/doc/html/linux1.gif
    src/bin/pgaccess/doc/html/maillist.html
    src/bin/pgaccess/doc/html/main.html
    src/bin/pgaccess/doc/html/mainwindow.gif
    src/bin/pgaccess/doc/html/newtable.gif
    src/bin/pgaccess/doc/html/newuser.gif
    src/bin/pgaccess/doc/html/old_index.html
    src/bin/pgaccess/doc/html/permissions.gif
    src/bin/pgaccess/doc/html/pg93patch.html
    src/bin/pgaccess/doc/html/pga-rad.html
    src/bin/pgaccess/doc/html/qbtclet.html
    src/bin/pgaccess/doc/html/qbtclet.tcl
    src/bin/pgaccess/doc/html/screenshots.html
    src/bin/pgaccess/doc/html/specialchars.html
    src/bin/pgaccess/doc/html/todo.html
    src/bin/pgaccess/doc/html/tutorial/addref.jpg
    src/bin/pgaccess/doc/html/tutorial/altern_q.jpg
    src/bin/pgaccess/doc/html/tutorial/altern_v.jpg
    src/bin/pgaccess/doc/html/tutorial/copyright.html
    src/bin/pgaccess/doc/html/tutorial/index.html
    src/bin/pgaccess/doc/html/tutorial/intro.html
    src/bin/pgaccess/doc/html/tutorial/irix.html
    src/bin/pgaccess/doc/html/tutorial/newref.txt
    src/bin/pgaccess/doc/html/tutorial/newtable.jpg
    src/bin/pgaccess/doc/html/tutorial/newtable.tga
    src/bin/pgaccess/doc/html/tutorial/problems.html
    src/bin/pgaccess/doc/html/tutorial/screen1.jpg
    src/bin/pgaccess/doc/html/tutorial/sel_tbl.jpg
    src/bin/pgaccess/doc/html/tutorial/start.html
    src/bin/pgaccess/doc/html/tutorial/tut.html
    src/bin/pgaccess/doc/html/tutorial/tut_edit.html
    src/bin/pgaccess/doc/html/tutorial/tut_new.html
    src/bin/pgaccess/doc/html/tutorial/tut_sel1.html
    src/bin/pgaccess/doc/html/tutorial/tut_user.html
    src/bin/pgaccess/doc/html/vdesigner.gif
    src/bin/pgaccess/doc/html/whatsnew.html
    src/bin/pgaccess/doc/html/win32.html
    src/bin/pgaccess/images/icon_button.gif
    src/bin/pgaccess/images/icon_checkbutton.gif
    src/bin/pgaccess/images/icon_entry.gif
    src/bin/pgaccess/images/icon_frame.gif
    src/bin/pgaccess/images/icon_label.gif
    src/bin/pgaccess/images/icon_listbox.gif
    src/bin/pgaccess/images/icon_query.gif
    src/bin/pgaccess/images/icon_radiobutton.gif
    src/bin/pgaccess/images/icon_text.gif
    src/bin/pgaccess/lib/database.tcl
    src/bin/pgaccess/lib/forms.tcl
    src/bin/pgaccess/lib/functions.tcl
    src/bin/pgaccess/lib/help/abort.hlp
    src/bin/pgaccess/lib/help/add_records.hlp
    src/bin/pgaccess/lib/help/alter_table.hlp
    src/bin/pgaccess/lib/help/alter_user.hlp
    src/bin/pgaccess/lib/help/author.hlp
    src/bin/pgaccess/lib/help/begin.hlp
    src/bin/pgaccess/lib/help/close.hlp
    src/bin/pgaccess/lib/help/cluster.hlp
    src/bin/pgaccess/lib/help/commit.hlp
    src/bin/pgaccess/lib/help/copy.hlp
    src/bin/pgaccess/lib/help/copyrights.hlp
    src/bin/pgaccess/lib/help/create_aggregate.hlp
    src/bin/pgaccess/lib/help/create_database.hlp
    src/bin/pgaccess/lib/help/create_function.hlp
    src/bin/pgaccess/lib/help/create_index.hlp
    src/bin/pgaccess/lib/help/create_language.hlp
    src/bin/pgaccess/lib/help/create_operator.hlp
    src/bin/pgaccess/lib/help/create_rule.hlp
    src/bin/pgaccess/lib/help/create_sequence.hlp
    src/bin/pgaccess/lib/help/create_table.hlp
    src/bin/pgaccess/lib/help/create_table_as.hlp
    src/bin/pgaccess/lib/help/create_trigger.hlp
    src/bin/pgaccess/lib/help/create_type.hlp
    src/bin/pgaccess/lib/help/create_user.hlp
    src/bin/pgaccess/lib/help/create_view.hlp
    src/bin/pgaccess/lib/help/data_types.hlp
    src/bin/pgaccess/lib/help/datefunc.hlp
    src/bin/pgaccess/lib/help/declare.hlp
    src/bin/pgaccess/lib/help/delete.hlp
    src/bin/pgaccess/lib/help/drop_aggregate.hlp
    src/bin/pgaccess/lib/help/drop_database.hlp
    src/bin/pgaccess/lib/help/drop_function.hlp
    src/bin/pgaccess/lib/help/drop_index.hlp
    src/bin/pgaccess/lib/help/drop_language.hlp
    src/bin/pgaccess/lib/help/drop_operator.hlp
    src/bin/pgaccess/lib/help/drop_rule.hlp
    src/bin/pgaccess/lib/help/drop_sequence.hlp
    src/bin/pgaccess/lib/help/drop_table.hlp
    src/bin/pgaccess/lib/help/drop_trigger.hlp
    src/bin/pgaccess/lib/help/drop_type.hlp
    src/bin/pgaccess/lib/help/drop_user.hlp
    src/bin/pgaccess/lib/help/drop_view.hlp
    src/bin/pgaccess/lib/help/explain.hlp
    src/bin/pgaccess/lib/help/fetch.hlp
    src/bin/pgaccess/lib/help/form_design.hlp
    src/bin/pgaccess/lib/help/forms.hlp
    src/bin/pgaccess/lib/help/functions.hlp
    src/bin/pgaccess/lib/help/geomfunc.hlp
    src/bin/pgaccess/lib/help/grant.hlp
    src/bin/pgaccess/lib/help/history.hlp
    src/bin/pgaccess/lib/help/index.hlp
    src/bin/pgaccess/lib/help/inheritance.hlp
    src/bin/pgaccess/lib/help/insert.hlp
    src/bin/pgaccess/lib/help/ipv4func.hlp
    src/bin/pgaccess/lib/help/isolation.hlp
    src/bin/pgaccess/lib/help/keywords.hlp
    src/bin/pgaccess/lib/help/listen.hlp
    src/bin/pgaccess/lib/help/load.hlp
    src/bin/pgaccess/lib/help/lock.hlp
    src/bin/pgaccess/lib/help/mathfunc.hlp
    src/bin/pgaccess/lib/help/move.hlp
    src/bin/pgaccess/lib/help/mvcc.hlp
    src/bin/pgaccess/lib/help/new_query.hlp
    src/bin/pgaccess/lib/help/new_table.hlp
    src/bin/pgaccess/lib/help/notify.hlp
    src/bin/pgaccess/lib/help/open_query.hlp
    src/bin/pgaccess/lib/help/open_table.hlp
    src/bin/pgaccess/lib/help/pgfunctions.hlp
    src/bin/pgaccess/lib/help/postgresql.hlp
    src/bin/pgaccess/lib/help/queries.hlp
    src/bin/pgaccess/lib/help/reports.hlp
    src/bin/pgaccess/lib/help/reset.hlp
    src/bin/pgaccess/lib/help/revoke.hlp
    src/bin/pgaccess/lib/help/rollback.hlp
    src/bin/pgaccess/lib/help/schema.hlp
    src/bin/pgaccess/lib/help/scripts.hlp
    src/bin/pgaccess/lib/help/select.hlp
    src/bin/pgaccess/lib/help/select_into.hlp
    src/bin/pgaccess/lib/help/sequences.hlp
    src/bin/pgaccess/lib/help/set.hlp
    src/bin/pgaccess/lib/help/show.hlp
    src/bin/pgaccess/lib/help/sql_guide.hlp
    src/bin/pgaccess/lib/help/sqlfunc.hlp
    src/bin/pgaccess/lib/help/stringfunc.hlp
    src/bin/pgaccess/lib/help/tables.hlp
    src/bin/pgaccess/lib/help/unlisten.hlp
    src/bin/pgaccess/lib/help/update.hlp
    src/bin/pgaccess/lib/help/users.hlp
    src/bin/pgaccess/lib/help/vacuum.hlp
    src/bin/pgaccess/lib/help/view_table_structure.hlp
    src/bin/pgaccess/lib/help/views.hlp
    src/bin/pgaccess/lib/help/visual_designer.hlp
    src/bin/pgaccess/lib/help/y2k.hlp
    src/bin/pgaccess/lib/help.tcl
    src/bin/pgaccess/lib/languages/chinese_big5
    src/bin/pgaccess/lib/languages/chinese_gb
    src/bin/pgaccess/lib/languages/czech
    src/bin/pgaccess/lib/languages/deutsch
    src/bin/pgaccess/lib/languages/euskara
    src/bin/pgaccess/lib/languages/francais
    src/bin/pgaccess/lib/languages/italiano
    src/bin/pgaccess/lib/languages/japanese
    src/bin/pgaccess/lib/languages/magyar
    src/bin/pgaccess/lib/languages/nederlands
    src/bin/pgaccess/lib/languages/portugues
    src/bin/pgaccess/lib/languages/romana
    src/bin/pgaccess/lib/languages/russian.koi8r
    src/bin/pgaccess/lib/languages/russian_win
    src/bin/pgaccess/lib/languages/spanish
    src/bin/pgaccess/lib/mainlib.tcl
    src/bin/pgaccess/lib/preferences.tcl
    src/bin/pgaccess/lib/queries.tcl
    src/bin/pgaccess/lib/reports.tcl
    src/bin/pgaccess/lib/schema.tcl
    src/bin/pgaccess/lib/scripts.tcl
    src/bin/pgaccess/lib/sequences.tcl
    src/bin/pgaccess/lib/tables.tcl
    src/bin/pgaccess/lib/users.tcl
    src/bin/pgaccess/lib/views.tcl
    src/bin/pgaccess/lib/visualqb.tcl
    src/bin/pgaccess/main.tcl
    src/bin/pgaccess/pgaccess.sh
    src/bin/pgtclsh/Makefile
    src/bin/pgtclsh/README
    src/bin/pgtclsh/pgtclAppInit.c
    src/bin/pgtclsh/pgtclUtils.tcl
    src/bin/pgtclsh/pgtkAppInit.c
    src/bin/pgtclsh/updateStats.tcl
    src/bin/psql/.cvsignore
    src/bin/psql/Makefile
    src/bin/psql/command.c
    src/bin/psql/command.h
    src/bin/psql/common.c
    src/bin/psql/common.h
    src/bin/psql/copy.c
    src/bin/psql/copy.h
    src/bin/psql/create_help.pl
    src/bin/psql/cs.po
    src/bin/psql/de.po
    src/bin/psql/describe.c
    src/bin/psql/describe.h
    src/bin/psql/fr.po
    src/bin/psql/help.c
    src/bin/psql/help.h
    src/bin/psql/input.c
    src/bin/psql/input.h
    src/bin/psql/large_obj.c
    src/bin/psql/large_obj.h
    src/bin/psql/mainloop.c
    src/bin/psql/mainloop.h
    src/bin/psql/mbprint.c
    src/bin/psql/mbprint.h
    src/bin/psql/nls.mk
    src/bin/psql/print.c
    src/bin/psql/print.h
    src/bin/psql/prompt.c
    src/bin/psql/prompt.h
    src/bin/psql/ru.po
    src/bin/psql/settings.h
    src/bin/psql/startup.c
    src/bin/psql/stringutils.c
    src/bin/psql/stringutils.h
    src/bin/psql/sv.po
    src/bin/psql/tab-complete.c
    src/bin/psql/tab-complete.h
    src/bin/psql/variables.c
    src/bin/psql/variables.h
    src/bin/psql/win32.mak
    src/bin/psql/zh_CN.po
    src/bin/psql/zh_TW.po
    src/bin/scripts/Makefile
    src/bin/scripts/createdb
    src/bin/scripts/createlang.sh
    src/bin/scripts/createuser
    src/bin/scripts/dropdb
    src/bin/scripts/droplang
    src/bin/scripts/dropuser
    src/bin/scripts/vacuumdb
    src/corba/CosQuery.idl
    src/corba/CosQueryCollection.idl
    src/corba/pgsql.idl
    src/corba/pgsql_int.idl
    src/corba/server.cc
    src/data/charset.conf
    src/data/isocz-wincz.tab
    src/data/koi-alt.tab
    src/data/koi-iso.tab
    src/data/koi-koi.tab
    src/data/koi-mac.tab
    src/data/koi-win.tab
    src/include/Makefile
    src/include/access/attnum.h
    src/include/access/clog.h
    src/include/access/genam.h
    src/include/access/gist.h
    src/include/access/gistscan.h
    src/include/access/hash.h
    src/include/access/heapam.h
    src/include/access/hio.h
    src/include/access/htup.h
    src/include/access/ibit.h
    src/include/access/iqual.h
    src/include/access/istrat.h
    src/include/access/itup.h
    src/include/access/nbtree.h
    src/include/access/printtup.h
    src/include/access/relscan.h
    src/include/access/rmgr.h
    src/include/access/rtree.h
    src/include/access/rtscan.h
    src/include/access/sdir.h
    src/include/access/skey.h
    src/include/access/strat.h
    src/include/access/transam.h
    src/include/access/tupdesc.h
    src/include/access/tupmacs.h
    src/include/access/tuptoaster.h
    src/include/access/valid.h
    src/include/access/xact.h
    src/include/access/xlog.h
    src/include/access/xlogdefs.h
    src/include/access/xlogutils.h
    src/include/bootstrap/bootstrap.h
    src/include/c.h
    src/include/catalog/catalog.h
    src/include/catalog/catname.h
    src/include/catalog/catversion.h
    src/include/catalog/duplicate_oids
    src/include/catalog/heap.h
    src/include/catalog/index.h
    src/include/catalog/indexing.h
    src/include/catalog/namespace.h
    src/include/catalog/pg_aggregate.h
    src/include/catalog/pg_am.h
    src/include/catalog/pg_amop.h
    src/include/catalog/pg_amproc.h
    src/include/catalog/pg_attrdef.h
    src/include/catalog/pg_attribute.h
    src/include/catalog/pg_class.h
    src/include/catalog/pg_control.h
    src/include/catalog/pg_database.h
    src/include/catalog/pg_description.h
    src/include/catalog/pg_group.h
    src/include/catalog/pg_index.h
    src/include/catalog/pg_inherits.h
    src/include/catalog/pg_language.h
    src/include/catalog/pg_largeobject.h
    src/include/catalog/pg_listener.h
    src/include/catalog/pg_namespace.h
    src/include/catalog/pg_opclass.h
    src/include/catalog/pg_operator.h
    src/include/catalog/pg_proc.h
    src/include/catalog/pg_relcheck.h
    src/include/catalog/pg_rewrite.h
    src/include/catalog/pg_shadow.h
    src/include/catalog/pg_statistic.h
    src/include/catalog/pg_trigger.h
    src/include/catalog/pg_type.h
    src/include/catalog/pg_version.h
    src/include/catalog/unused_oids
    src/include/commands/async.h
    src/include/commands/cluster.h
    src/include/commands/comment.h
    src/include/commands/copy.h
    src/include/commands/dbcommands.h
    src/include/commands/defrem.h
    src/include/commands/explain.h
    src/include/commands/lockcmds.h
    src/include/commands/portalcmds.h
    src/include/commands/proclang.h
    src/include/commands/schemacmds.h
    src/include/commands/sequence.h
    src/include/commands/tablecmds.h
    src/include/commands/trigger.h
    src/include/commands/user.h
    src/include/commands/vacuum.h
    src/include/commands/variable.h
    src/include/commands/version.h
    src/include/commands/view.h
    src/include/executor/execdebug.h
    src/include/executor/execdefs.h
    src/include/executor/execdesc.h
    src/include/executor/executor.h
    src/include/executor/functions.h
    src/include/executor/hashjoin.h
    src/include/executor/instrument.h
    src/include/executor/nodeAgg.h
    src/include/executor/nodeAppend.h
    src/include/executor/nodeFunctionscan.h
    src/include/executor/nodeGroup.h
    src/include/executor/nodeHash.h
    src/include/executor/nodeHashjoin.h
    src/include/executor/nodeIndexscan.h
    src/include/executor/nodeLimit.h
    src/include/executor/nodeMaterial.h
    src/include/executor/nodeMergejoin.h
    src/include/executor/nodeNestloop.h
    src/include/executor/nodeResult.h
    src/include/executor/nodeSeqscan.h
    src/include/executor/nodeSetOp.h
    src/include/executor/nodeSort.h
    src/include/executor/nodeSubplan.h
    src/include/executor/nodeSubqueryscan.h
    src/include/executor/nodeTidscan.h
    src/include/executor/nodeUnique.h
    src/include/executor/spi.h
    src/include/executor/spi_priv.h
    src/include/executor/tuptable.h
    src/include/fmgr.h
    src/include/lib/dllist.h
    src/include/lib/lispsort.h
    src/include/lib/stringinfo.h
    src/include/libpq/auth.h
    src/include/libpq/be-fsstubs.h
    src/include/libpq/crypt.h
    src/include/libpq/hba.h
    src/include/libpq/libpq-be.h
    src/include/libpq/libpq-fs.h
    src/include/libpq/libpq.h
    src/include/libpq/password.h
    src/include/libpq/pqcomm.h
    src/include/libpq/pqformat.h
    src/include/libpq/pqsignal.h
    src/include/mb/pg_wchar.h
    src/include/miscadmin.h
    src/include/nodes/execnodes.h
    src/include/nodes/makefuncs.h
    src/include/nodes/memnodes.h
    src/include/nodes/nodeFuncs.h
    src/include/nodes/nodes.h
    src/include/nodes/params.h
    src/include/nodes/parsenodes.h
    src/include/nodes/pg_list.h
    src/include/nodes/plannodes.h
    src/include/nodes/primnodes.h
    src/include/nodes/print.h
    src/include/nodes/readfuncs.h
    src/include/nodes/relation.h
    src/include/optimizer/_deadcode/xfunc.h
    src/include/optimizer/clauses.h
    src/include/optimizer/cost.h
    src/include/optimizer/geqo.h
    src/include/optimizer/geqo_copy.h
    src/include/optimizer/geqo_gene.h
    src/include/optimizer/geqo_misc.h
    src/include/optimizer/geqo_mutation.h
    src/include/optimizer/geqo_pool.h
    src/include/optimizer/geqo_random.h
    src/include/optimizer/geqo_recombination.h
    src/include/optimizer/geqo_selection.h
    src/include/optimizer/joininfo.h
    src/include/optimizer/pathnode.h
    src/include/optimizer/paths.h
    src/include/optimizer/plancat.h
    src/include/optimizer/planmain.h
    src/include/optimizer/planner.h
    src/include/optimizer/prep.h
    src/include/optimizer/restrictinfo.h
    src/include/optimizer/subselect.h
    src/include/optimizer/tlist.h
    src/include/optimizer/var.h
    src/include/parser/analyze.h
    src/include/parser/gramparse.h
    src/include/parser/keywords.h
    src/include/parser/parse_agg.h
    src/include/parser/parse_clause.h
    src/include/parser/parse_coerce.h
    src/include/parser/parse_expr.h
    src/include/parser/parse_func.h
    src/include/parser/parse_node.h
    src/include/parser/parse_oper.h
    src/include/parser/parse_relation.h
    src/include/parser/parse_target.h
    src/include/parser/parse_type.h
    src/include/parser/parser.h
    src/include/parser/parsetree.h
    src/include/parser/scansup.h
    src/include/pg_config.h.in
    src/include/pg_config.h.win32
    src/include/pgstat.h
    src/include/port/aix.h
    src/include/port/beos.h
    src/include/port/bsdi.h
    src/include/port/darwin.h
    src/include/port/dgux.h
    src/include/port/freebsd.h
    src/include/port/hpux.h
    src/include/port/irix5.h
    src/include/port/linux.h
    src/include/port/netbsd.h
    src/include/port/nextstep.h
    src/include/port/openbsd.h
    src/include/port/osf.h
    src/include/port/qnx4.h
    src/include/port/sco.h
    src/include/port/solaris.h
    src/include/port/sunos4.h
    src/include/port/svr4.h
    src/include/port/ultrix4.h
    src/include/port/univel.h
    src/include/port/unixware.h
    src/include/port/win.h
    src/include/port/win32.h
    src/include/postgres.h
    src/include/postgres_ext.h
    src/include/postgres_fe.h
    src/include/regex/cclass.h
    src/include/regex/cname.h
    src/include/regex/regex.h
    src/include/regex/regex2.h
    src/include/regex/utils.h
    src/include/rewrite/prs2lock.h
    src/include/rewrite/rewriteDefine.h
    src/include/rewrite/rewriteHandler.h
    src/include/rewrite/rewriteManip.h
    src/include/rewrite/rewriteRemove.h
    src/include/rewrite/rewriteSupport.h
    src/include/rusagestub.h
    src/include/storage/backendid.h
    src/include/storage/block.h
    src/include/storage/buf.h
    src/include/storage/buf_internals.h
    src/include/storage/buffile.h
    src/include/storage/bufmgr.h
    src/include/storage/bufpage.h
    src/include/storage/fd.h
    src/include/storage/freespace.h
    src/include/storage/ipc.h
    src/include/storage/item.h
    src/include/storage/itemid.h
    src/include/storage/itempos.h
    src/include/storage/itemptr.h
    src/include/storage/large_object.h
    src/include/storage/lmgr.h
    src/include/storage/lock.h
    src/include/storage/lwlock.h
    src/include/storage/off.h
    src/include/storage/page.h
    src/include/storage/pg_sema.h
    src/include/storage/pg_shmem.h
    src/include/storage/pmsignal.h
    src/include/storage/pos.h
    src/include/storage/proc.h
    src/include/storage/relfilenode.h
    src/include/storage/s_lock.h
    src/include/storage/shmem.h
    src/include/storage/sinval.h
    src/include/storage/sinvaladt.h
    src/include/storage/smgr.h
    src/include/storage/spin.h
    src/include/strdup.h
    src/include/tcop/dest.h
    src/include/tcop/fastpath.h
    src/include/tcop/pquery.h
    src/include/tcop/tcopdebug.h
    src/include/tcop/tcopprot.h
    src/include/tcop/utility.h
    src/include/utils/acl.h
    src/include/utils/array.h
    src/include/utils/ascii.h
    src/include/utils/bit.h
    src/include/utils/builtins.h
    src/include/utils/cash.h
    src/include/utils/catcache.h
    src/include/utils/date.h
    src/include/utils/datetime.h
    src/include/utils/datum.h
    src/include/utils/dynahash.h
    src/include/utils/dynamic_loader.h
    src/include/utils/elog.h
    src/include/utils/exc.h
    src/include/utils/excid.h
    src/include/utils/fcache.h
    src/include/utils/fmgrtab.h
    src/include/utils/formatting.h
    src/include/utils/geo_decls.h
    src/include/utils/guc.h
    src/include/utils/hsearch.h
    src/include/utils/inet.h
    src/include/utils/int8.h
    src/include/utils/inval.h
    src/include/utils/logtape.h
    src/include/utils/lsyscache.h
    src/include/utils/memutils.h
    src/include/utils/nabstime.h
    src/include/utils/numeric.h
    src/include/utils/palloc.h
    src/include/utils/pg_crc.h
    src/include/utils/pg_locale.h
    src/include/utils/pg_lzcompress.h
    src/include/utils/portal.h
    src/include/utils/ps_status.h
    src/include/utils/rel.h
    src/include/utils/relcache.h
    src/include/utils/selfuncs.h
    src/include/utils/sets.h
    src/include/utils/syscache.h
    src/include/utils/timestamp.h
    src/include/utils/tqual.h
    src/include/utils/tuplesort.h
    src/include/utils/tuplestore.h
    src/include/utils/varbit.h
    src/interfaces/Makefile
    src/interfaces/cli/example1.c
    src/interfaces/cli/example2.c
    src/interfaces/cli/sqlcli.h
    src/interfaces/jdbc/CHANGELOG
    src/interfaces/jdbc/Implementation
    src/interfaces/jdbc/Makefile
    src/interfaces/jdbc/README
    src/interfaces/jdbc/build.xml
    src/interfaces/jdbc/example/ImageViewer.java
    src/interfaces/jdbc/example/Unicode.java
    src/interfaces/jdbc/example/basic.java
    src/interfaces/jdbc/example/blobtest.java
    src/interfaces/jdbc/example/corba/StockClient.java
    src/interfaces/jdbc/example/corba/StockDB.java
    src/interfaces/jdbc/example/corba/StockDispenserImpl.java
    src/interfaces/jdbc/example/corba/StockItemImpl.java
    src/interfaces/jdbc/example/corba/StockServer.java
    src/interfaces/jdbc/example/corba/readme
    src/interfaces/jdbc/example/corba/stock.idl
    src/interfaces/jdbc/example/corba/stock.sql
    src/interfaces/jdbc/example/datestyle.java
    src/interfaces/jdbc/example/metadata.java
    src/interfaces/jdbc/example/psql.java
    src/interfaces/jdbc/example/threadsafe.java
    src/interfaces/jdbc/jdbc.jpx
    src/interfaces/jdbc/org/postgresql/Connection.java
    src/interfaces/jdbc/org/postgresql/Driver.java.in
    src/interfaces/jdbc/org/postgresql/Field.java
    src/interfaces/jdbc/org/postgresql/PG_Stream.java
    src/interfaces/jdbc/org/postgresql/PostgresqlDataSource.java
    src/interfaces/jdbc/org/postgresql/ResultSet.java
    src/interfaces/jdbc/org/postgresql/Statement.java
    src/interfaces/jdbc/org/postgresql/core/BytePoolDim1.java
    src/interfaces/jdbc/org/postgresql/core/BytePoolDim2.java
    src/interfaces/jdbc/org/postgresql/core/Encoding.java
    src/interfaces/jdbc/org/postgresql/core/MemoryPool.java
    src/interfaces/jdbc/org/postgresql/core/ObjectPool.java
    src/interfaces/jdbc/org/postgresql/core/QueryExecutor.java
    src/interfaces/jdbc/org/postgresql/core/SimpleObjectPool.java
    src/interfaces/jdbc/org/postgresql/core/StartupPacket.java
    src/interfaces/jdbc/org/postgresql/errors.properties
    src/interfaces/jdbc/org/postgresql/errors_de.properties
    src/interfaces/jdbc/org/postgresql/errors_fr.properties
    src/interfaces/jdbc/org/postgresql/errors_it.properties
    src/interfaces/jdbc/org/postgresql/errors_nl.properties
    src/interfaces/jdbc/org/postgresql/errors_zh_TW.properties
    src/interfaces/jdbc/org/postgresql/fastpath/Fastpath.java
    src/interfaces/jdbc/org/postgresql/fastpath/FastpathArg.java
    src/interfaces/jdbc/org/postgresql/geometric/PGbox.java
    src/interfaces/jdbc/org/postgresql/geometric/PGcircle.java
    src/interfaces/jdbc/org/postgresql/geometric/PGline.java
    src/interfaces/jdbc/org/postgresql/geometric/PGlseg.java
    src/interfaces/jdbc/org/postgresql/geometric/PGpath.java
    src/interfaces/jdbc/org/postgresql/geometric/PGpoint.java
    src/interfaces/jdbc/org/postgresql/geometric/PGpolygon.java
    src/interfaces/jdbc/org/postgresql/jdbc1/CallableStatement.java
    src/interfaces/jdbc/org/postgresql/jdbc1/Connection.java
    src/interfaces/jdbc/org/postgresql/jdbc1/DatabaseMetaData.java
    src/interfaces/jdbc/org/postgresql/jdbc1/PreparedStatement.java
    src/interfaces/jdbc/org/postgresql/jdbc1/ResultSet.java
    src/interfaces/jdbc/org/postgresql/jdbc1/ResultSetMetaData.java
    src/interfaces/jdbc/org/postgresql/jdbc1/Statement.java
    src/interfaces/jdbc/org/postgresql/jdbc2/Array.java
    src/interfaces/jdbc/org/postgresql/jdbc2/CallableStatement.java
    src/interfaces/jdbc/org/postgresql/jdbc2/Connection.java
    src/interfaces/jdbc/org/postgresql/jdbc2/DatabaseMetaData.java
    src/interfaces/jdbc/org/postgresql/jdbc2/PBatchUpdateException.java
    src/interfaces/jdbc/org/postgresql/jdbc2/PreparedStatement.java
    src/interfaces/jdbc/org/postgresql/jdbc2/ResultSet.java
    src/interfaces/jdbc/org/postgresql/jdbc2/ResultSetMetaData.java
    src/interfaces/jdbc/org/postgresql/jdbc2/Statement.java
    src/interfaces/jdbc/org/postgresql/jdbc2/UpdateableResultSet.java
    src/interfaces/jdbc/org/postgresql/largeobject/BlobInputStream.java
    src/interfaces/jdbc/org/postgresql/largeobject/BlobOutputStream.java
    src/interfaces/jdbc/org/postgresql/largeobject/LargeObject.java
    src/interfaces/jdbc/org/postgresql/largeobject/LargeObjectManager.java
    src/interfaces/jdbc/org/postgresql/largeobject/PGblob.java
    src/interfaces/jdbc/org/postgresql/largeobject/PGclob.java
    src/interfaces/jdbc/org/postgresql/test/JDBC2Tests.java
    src/interfaces/jdbc/org/postgresql/test/README
    src/interfaces/jdbc/org/postgresql/test/jdbc2/ANTTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/BatchExecuteTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/BlobTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/ConnectionTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/DatabaseMetaDataTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/DateTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/DriverTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/EncodingTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/JBuilderTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/MiscTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/ResultSetTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/TimeTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/TimestampTest.java
    src/interfaces/jdbc/org/postgresql/test/jdbc2/UpdateableResultTest.java
    src/interfaces/jdbc/org/postgresql/util/MD5Digest.java
    src/interfaces/jdbc/org/postgresql/util/MessageTranslator.java
    src/interfaces/jdbc/org/postgresql/util/PGbytea.java
    src/interfaces/jdbc/org/postgresql/util/PGmoney.java
    src/interfaces/jdbc/org/postgresql/util/PGobject.java
    src/interfaces/jdbc/org/postgresql/util/PGtokenizer.java
    src/interfaces/jdbc/org/postgresql/util/PSQLException.java
    src/interfaces/jdbc/org/postgresql/util/Serialize.java
    src/interfaces/jdbc/org/postgresql/util/UnixCrypt.java
    src/interfaces/jdbc/org/postgresql/xa/ClientConnection.java
    src/interfaces/jdbc/org/postgresql/xa/TwoPhaseConnection.java
    src/interfaces/jdbc/org/postgresql/xa/TxConnection.java
    src/interfaces/jdbc/org/postgresql/xa/XAConnectionImpl.java
    src/interfaces/jdbc/org/postgresql/xa/XADataSourceImpl.java
    src/interfaces/jdbc/utils/CheckVersion.java
    src/interfaces/jdbc/utils/buildDriver
    src/interfaces/jdbc/utils/changelog.pl
    src/interfaces/libpgeasy/Makefile
    src/interfaces/libpgeasy/README
    src/interfaces/libpgeasy/examples/Makefile
    src/interfaces/libpgeasy/examples/pginsert.c
    src/interfaces/libpgeasy/examples/pgmultiresult.c
    src/interfaces/libpgeasy/examples/pgnulltest.c
    src/interfaces/libpgeasy/examples/pgwordcount.c
    src/interfaces/libpgeasy/halt.c
    src/interfaces/libpgeasy/halt.h
    src/interfaces/libpgeasy/libpgeasy.c
    src/interfaces/libpgeasy/libpgeasy.h
    src/interfaces/libpgtcl/Makefile
    src/interfaces/libpgtcl/README
    src/interfaces/libpgtcl/libpgtcl.def
    src/interfaces/libpgtcl/libpgtcl.h
    src/interfaces/libpgtcl/pgtcl.c
    src/interfaces/libpgtcl/pgtclCmds.c
    src/interfaces/libpgtcl/pgtclCmds.h
    src/interfaces/libpgtcl/pgtclId.c
    src/interfaces/libpgtcl/pgtclId.h
    src/interfaces/libpgtcl/win32.mak
    src/interfaces/libpq/Makefile
    src/interfaces/libpq/README
    src/interfaces/libpq/cs.po
    src/interfaces/libpq/de.po
    src/interfaces/libpq/fe-auth.c
    src/interfaces/libpq/fe-auth.h
    src/interfaces/libpq/fe-connect.c
    src/interfaces/libpq/fe-exec.c
    src/interfaces/libpq/fe-lobj.c
    src/interfaces/libpq/fe-misc.c
    src/interfaces/libpq/fe-print.c
    src/interfaces/libpq/fe-secure.c
    src/interfaces/libpq/fr.po
    src/interfaces/libpq/libpq-fe.h
    src/interfaces/libpq/libpq-int.h
    src/interfaces/libpq/libpq.rc
    src/interfaces/libpq/libpqdll.c
    src/interfaces/libpq/libpqdll.def
    src/interfaces/libpq/nls.mk
    src/interfaces/libpq/pqexpbuffer.c
    src/interfaces/libpq/pqexpbuffer.h
    src/interfaces/libpq/pqsignal.c
    src/interfaces/libpq/pqsignal.h
    src/interfaces/libpq/ru.po
    src/interfaces/libpq/sv.po
    src/interfaces/libpq/win32.c
    src/interfaces/libpq/win32.h
    src/interfaces/libpq/win32.mak
    src/interfaces/libpq/zh_CN.po
    src/interfaces/libpq/zh_TW.po
    src/interfaces/libpq++/CHANGES
    src/interfaces/libpq++/Makefile
    src/interfaces/libpq++/README
    src/interfaces/libpq++/TODO
    src/interfaces/libpq++/examples/Makefile
    src/interfaces/libpq++/examples/testlibpq0.cc
    src/interfaces/libpq++/examples/testlibpq1.cc
    src/interfaces/libpq++/examples/testlibpq2.cc
    src/interfaces/libpq++/examples/testlibpq2.sql
    src/interfaces/libpq++/examples/testlibpq3.cc
    src/interfaces/libpq++/examples/testlibpq3.sql
    src/interfaces/libpq++/examples/testlibpq4.cc
    src/interfaces/libpq++/examples/testlibpq4.sql
    src/interfaces/libpq++/examples/testlibpq5.cc
    src/interfaces/libpq++/examples/testlibpq5.sql
    src/interfaces/libpq++/examples/testlibpq6.cc
    src/interfaces/libpq++/examples/testlo.cc
    src/interfaces/libpq++/libpq++.h
    src/interfaces/libpq++/libpq++dll.rc
    src/interfaces/libpq++/pgconnection.cc
    src/interfaces/libpq++/pgconnection.h
    src/interfaces/libpq++/pgcursordb.cc
    src/interfaces/libpq++/pgcursordb.h
    src/interfaces/libpq++/pgdatabase.cc
    src/interfaces/libpq++/pgdatabase.h
    src/interfaces/libpq++/pglobject.cc
    src/interfaces/libpq++/pglobject.h
    src/interfaces/libpq++/pgtransdb.cc
    src/interfaces/libpq++/pgtransdb.h
    src/interfaces/libpq++/win32.mak
    src/interfaces/odbc/GNUmakefile
    src/interfaces/odbc/bind.c
    src/interfaces/odbc/bind.h
    src/interfaces/odbc/columninfo.c
    src/interfaces/odbc/columninfo.h
    src/interfaces/odbc/connection.c
    src/interfaces/odbc/connection.h
    src/interfaces/odbc/convert.c
    src/interfaces/odbc/convert.h
    src/interfaces/odbc/descriptor.h
    src/interfaces/odbc/dlg_specific.c
    src/interfaces/odbc/dlg_specific.h
    src/interfaces/odbc/dlg_wingui.c
    src/interfaces/odbc/drvconn.c
    src/interfaces/odbc/environ.c
    src/interfaces/odbc/environ.h
    src/interfaces/odbc/execute.c
    src/interfaces/odbc/gpps.c
    src/interfaces/odbc/gpps.h
    src/interfaces/odbc/info.c
    src/interfaces/odbc/info30.c
    src/interfaces/odbc/iodbc.h
    src/interfaces/odbc/isql.h
    src/interfaces/odbc/isqlext.h
    src/interfaces/odbc/license.txt
    src/interfaces/odbc/lobj.c
    src/interfaces/odbc/lobj.h
    src/interfaces/odbc/md5.c
    src/interfaces/odbc/md5.h
    src/interfaces/odbc/misc.c
    src/interfaces/odbc/misc.h
    src/interfaces/odbc/multibyte.c
    src/interfaces/odbc/multibyte.h
    src/interfaces/odbc/notice.txt
    src/interfaces/odbc/odbc.sql
    src/interfaces/odbc/odbcapi.c
    src/interfaces/odbc/odbcapi25w.c
    src/interfaces/odbc/odbcapi30.c
    src/interfaces/odbc/odbcapi30w.c
    src/interfaces/odbc/odbcapiw.c
    src/interfaces/odbc/odbcinst.ini
    src/interfaces/odbc/options.c
    src/interfaces/odbc/parse.c
    src/interfaces/odbc/pgapi30.c
    src/interfaces/odbc/pgapifunc.h
    src/interfaces/odbc/pgtypes.c
    src/interfaces/odbc/pgtypes.h
    src/interfaces/odbc/psqlodbc.c
    src/interfaces/odbc/psqlodbc.h
    src/interfaces/odbc/psqlodbc.rc
    src/interfaces/odbc/psqlodbc.reg
    src/interfaces/odbc/psqlodbc30.reg
    src/interfaces/odbc/psqlodbc30w.reg
    src/interfaces/odbc/psqlodbc_api30.def
    src/interfaces/odbc/psqlodbc_api30w.def
    src/interfaces/odbc/psqlodbc_apiw.def
    src/interfaces/odbc/psqlodbc_win32.def
    src/interfaces/odbc/qresult.c
    src/interfaces/odbc/qresult.h
    src/interfaces/odbc/readme.txt
    src/interfaces/odbc/resource.h
    src/interfaces/odbc/results.c
    src/interfaces/odbc/setup.c
    src/interfaces/odbc/setup.rul
    src/interfaces/odbc/socket.c
    src/interfaces/odbc/socket.h
    src/interfaces/odbc/statement.c
    src/interfaces/odbc/statement.h
    src/interfaces/odbc/tuple.c
    src/interfaces/odbc/tuple.h
    src/interfaces/odbc/tuplelist.c
    src/interfaces/odbc/tuplelist.h
    src/interfaces/odbc/version.h
    src/interfaces/odbc/win32.mak
    src/interfaces/odbc/win32_30.mak
    src/interfaces/odbc/win32_30w.mak
    src/interfaces/odbc/win32w.mak
    src/interfaces/odbc/win_md5.c
    src/interfaces/odbc/win_setup.h
    src/interfaces/odbc/win_unicode.c
    src/interfaces/perl5/Changes
    src/interfaces/perl5/GNUmakefile
    src/interfaces/perl5/MANIFEST
    src/interfaces/perl5/Makefile.PL
    src/interfaces/perl5/Pg.pm
    src/interfaces/perl5/Pg.xs
    src/interfaces/perl5/README
    src/interfaces/perl5/examples/ApachePg.pl
    src/interfaces/perl5/examples/example.newstyle
    src/interfaces/perl5/examples/example.oldstyle
    src/interfaces/perl5/ppport.h
    src/interfaces/perl5/test.pl
    src/interfaces/perl5/typemap
    src/interfaces/python/Announce
    src/interfaces/python/ChangeLog
    src/interfaces/python/GNUmakefile
    src/interfaces/python/PyGreSQL.spec
    src/interfaces/python/README
    src/interfaces/python/README.linux
    src/interfaces/python/Setup.in.raw
    src/interfaces/python/pg.py
    src/interfaces/python/pgdb.py
    src/interfaces/python/pgmodule.c
    src/interfaces/python/setup.py
    src/interfaces/python/tutorial/advanced.py
    src/interfaces/python/tutorial/basics.py
    src/interfaces/python/tutorial/func.py
    src/interfaces/python/tutorial/syscat.py
    src/interfaces/ssl/client.conf
    src/interfaces/ssl/mkcert.sh
    src/interfaces/ssl/pgkeygen.sh
    src/interfaces/ssl/root.conf
    src/interfaces/ssl/server.conf
    src/makefiles/Makefile.aix
    src/makefiles/Makefile.beos
    src/makefiles/Makefile.bsdi
    src/makefiles/Makefile.darwin
    src/makefiles/Makefile.dgux
    src/makefiles/Makefile.freebsd
    src/makefiles/Makefile.hpux
    src/makefiles/Makefile.irix5
    src/makefiles/Makefile.linux
    src/makefiles/Makefile.netbsd
    src/makefiles/Makefile.openbsd
    src/makefiles/Makefile.osf
    src/makefiles/Makefile.qnx4
    src/makefiles/Makefile.sco
    src/makefiles/Makefile.solaris
    src/makefiles/Makefile.sunos4
    src/makefiles/Makefile.svr4
    src/makefiles/Makefile.ultrix4
    src/makefiles/Makefile.univel
    src/makefiles/Makefile.unixware
    src/makefiles/Makefile.win
    src/nls-global.mk
    src/pl/Makefile
    src/pl/plperl/GNUmakefile
    src/pl/plperl/README
    src/pl/plperl/SPI.xs
    src/pl/plperl/eloglvl.c
    src/pl/plperl/eloglvl.h
    src/pl/plperl/plperl.c
    src/pl/plperl/ppport.h
    src/pl/plpgsql/Makefile
    src/pl/plpgsql/src/.cvsignore
    src/pl/plpgsql/src/INSTALL
    src/pl/plpgsql/src/Makefile
    src/pl/plpgsql/src/gram.y
    src/pl/plpgsql/src/pl_comp.c
    src/pl/plpgsql/src/pl_exec.c
    src/pl/plpgsql/src/pl_funcs.c
    src/pl/plpgsql/src/pl_handler.c
    src/pl/plpgsql/src/plpgsql.h
    src/pl/plpgsql/src/scan.l
    src/pl/plpgsql/test/README
    src/pl/plpgsql/test/expected/tables.out
    src/pl/plpgsql/test/expected/test.out
    src/pl/plpgsql/test/expected/triggers.out
    src/pl/plpgsql/test/expected/views.out
    src/pl/plpgsql/test/runtest
    src/pl/plpgsql/test/tables.sql
    src/pl/plpgsql/test/test.sql
    src/pl/plpgsql/test/triggers.sql
    src/pl/plpgsql/test/views.sql
    src/pl/plpython/Makefile
    src/pl/plpython/README
    src/pl/plpython/TODO
    src/pl/plpython/error.expected
    src/pl/plpython/feature.expected
    src/pl/plpython/plpython.c
    src/pl/plpython/plpython.h
    src/pl/plpython/plpython_depopulate.sql
    src/pl/plpython/plpython_deschema.sql
    src/pl/plpython/plpython_drop.sql
    src/pl/plpython/plpython_error.sql
    src/pl/plpython/plpython_function.sql
    src/pl/plpython/plpython_populate.sql
    src/pl/plpython/plpython_schema.sql
    src/pl/plpython/plpython_setof.sql
    src/pl/plpython/plpython_test.sql
    src/pl/plpython/test.sh
    src/pl/tcl/Makefile
    src/pl/tcl/license.terms
    src/pl/tcl/modules/Makefile
    src/pl/tcl/modules/README
    src/pl/tcl/modules/pltcl_delmod.in
    src/pl/tcl/modules/pltcl_listmod.in
    src/pl/tcl/modules/pltcl_loadmod.in
    src/pl/tcl/modules/unknown.pltcl
    src/pl/tcl/pltcl.c
    src/pl/tcl/test/README
    src/pl/tcl/test/runtest
    src/pl/tcl/test/test.expected
    src/pl/tcl/test/test_queries.sql
    src/pl/tcl/test/test_setup.sql
    src/template/aix
    src/template/beos
    src/template/bsdi
    src/template/darwin
    src/template/dgux
    src/template/freebsd
    src/template/hpux
    src/template/irix5
    src/template/linux
    src/template/netbsd
    src/template/nextstep
    src/template/openbsd
    src/template/osf
    src/template/qnx4
    src/template/sco
    src/template/solaris
    src/template/sunos4
    src/template/svr4
    src/template/ultrix4
    src/template/univel
    src/template/unixware
    src/template/win
    src/test/Makefile
    src/test/bench/Makefile
    src/test/bench/WISC-README
    src/test/bench/create.sh
    src/test/bench/create.source
    src/test/bench/perquery
    src/test/bench/query01
    src/test/bench/query02
    src/test/bench/query03
    src/test/bench/query04
    src/test/bench/query05
    src/test/bench/query06
    src/test/bench/query07
    src/test/bench/query08
    src/test/bench/query09
    src/test/bench/query10
    src/test/bench/query11
    src/test/bench/query12
    src/test/bench/query13
    src/test/bench/query14
    src/test/bench/query15
    src/test/bench/query16
    src/test/bench/query17
    src/test/bench/query18
    src/test/bench/query19
    src/test/bench/query20
    src/test/bench/query21
    src/test/bench/query22
    src/test/bench/query23
    src/test/bench/query24
    src/test/bench/query25
    src/test/bench/query26
    src/test/bench/query27
    src/test/bench/query28
    src/test/bench/query29
    src/test/bench/query30
    src/test/bench/query31
    src/test/bench/query32
    src/test/bench/runwisc.sh
    src/test/bench/wholebench.sh
    src/test/examples/Makefile
    src/test/examples/testlibpq.c
    src/test/examples/testlibpq2.c
    src/test/examples/testlibpq2.sql
    src/test/examples/testlibpq3.c
    src/test/examples/testlibpq3.sql
    src/test/examples/testlibpq4.c
    src/test/examples/testlo.c
    src/test/locale/Makefile
    src/test/locale/README
    src/test/locale/de_DE.ISO8859-1/Makefile
    src/test/locale/de_DE.ISO8859-1/README
    src/test/locale/de_DE.ISO8859-1/expected/de-ctype.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-char.sql.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-select.sql.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-sort.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-text.sql.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-upper-char.sql.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-upper-text.sql.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-upper-varchar.sql.out
    src/test/locale/de_DE.ISO8859-1/expected/test-de-varchar.sql.out
    src/test/locale/de_DE.ISO8859-1/runall
    src/test/locale/de_DE.ISO8859-1/test-de-select.sql.in
    src/test/locale/de_DE.ISO8859-1/test-de-sort.in
    src/test/locale/de_DE.ISO8859-1/test-de-upper.sql.in
    src/test/locale/de_DE.ISO8859-1/test-de.sql.in
    src/test/locale/gr_GR.ISO8859-7/Makefile
    src/test/locale/gr_GR.ISO8859-7/README
    src/test/locale/gr_GR.ISO8859-7/expected/gr-ctype.out
    src/test/locale/gr_GR.ISO8859-7/expected/test-gr-char.sql.out
    src/test/locale/gr_GR.ISO8859-7/expected/test-gr-select.sql.out
    src/test/locale/gr_GR.ISO8859-7/expected/test-gr-sort.out
    src/test/locale/gr_GR.ISO8859-7/expected/test-gr-text.sql.out
    src/test/locale/gr_GR.ISO8859-7/expected/test-gr-varchar.sql.out
    src/test/locale/gr_GR.ISO8859-7/runall
    src/test/locale/gr_GR.ISO8859-7/test-gr-select.sql.in
    src/test/locale/gr_GR.ISO8859-7/test-gr-sort.in
    src/test/locale/gr_GR.ISO8859-7/test-gr.sql.in
    src/test/locale/koi8-r/Makefile
    src/test/locale/koi8-r/expected/koi8-ctype.out
    src/test/locale/koi8-r/expected/test-koi8-char.sql.out
    src/test/locale/koi8-r/expected/test-koi8-select.sql.out
    src/test/locale/koi8-r/expected/test-koi8-sort.out
    src/test/locale/koi8-r/expected/test-koi8-text.sql.out
    src/test/locale/koi8-r/expected/test-koi8-varchar.sql.out
    src/test/locale/koi8-r/runall
    src/test/locale/koi8-r/test-koi8-select.sql.in
    src/test/locale/koi8-r/test-koi8-sort.in
    src/test/locale/koi8-r/test-koi8.sql.in
    src/test/locale/koi8-to-win1251/Makefile
    src/test/locale/koi8-to-win1251/README
    src/test/locale/koi8-to-win1251/expected/test-koi8-char.sql.out
    src/test/locale/koi8-to-win1251/expected/test-koi8-select.sql.out
    src/test/locale/koi8-to-win1251/expected/test-koi8-sort.out
    src/test/locale/koi8-to-win1251/expected/test-koi8-text.sql.out
    src/test/locale/koi8-to-win1251/expected/test-koi8-varchar.sql.out
    src/test/locale/koi8-to-win1251/runall
    src/test/locale/koi8-to-win1251/test-koi8-select.sql.in
    src/test/locale/koi8-to-win1251/test-koi8-sort.in
    src/test/locale/koi8-to-win1251/test-koi8.sql.in
    src/test/locale/sort-test.pl
    src/test/locale/sort-test.py
    src/test/locale/test-ctype.c
    src/test/locale/test-pgsql-locale.c
    src/test/mb/README
    src/test/mb/expected/big5.out
    src/test/mb/expected/euc_cn.out
    src/test/mb/expected/euc_jp.out
    src/test/mb/expected/euc_kr.out
    src/test/mb/expected/euc_tw.out
    src/test/mb/expected/mule_internal.out
    src/test/mb/expected/sjis.out
    src/test/mb/expected/unicode.out
    src/test/mb/mbregress.sh
    src/test/mb/sql/big5.sql
    src/test/mb/sql/euc_cn.sql
    src/test/mb/sql/euc_jp.sql
    src/test/mb/sql/euc_kr.sql
    src/test/mb/sql/euc_tw.sql
    src/test/mb/sql/mule_internal.sql
    src/test/mb/sql/sjis.sql
    src/test/mb/sql/unicode.sql
    src/test/performance/results/PgSQL.970926
    src/test/performance/runtests.pl
    src/test/performance/sqls/connection
    src/test/performance/sqls/crtsimple
    src/test/performance/sqls/crtsimpleidx
    src/test/performance/sqls/drpsimple
    src/test/performance/sqls/inssimple
    src/test/performance/sqls/inssimple.data
    src/test/performance/sqls/orbsimple
    src/test/performance/sqls/slcsimple
    src/test/performance/sqls/slcsimple.data
    src/test/performance/sqls/vacuum
    src/test/performance/start-pgsql.sh
    src/test/regress/GNUmakefile
    src/test/regress/Makefile
    src/test/regress/README
    src/test/regress/data/agg.data
    src/test/regress/data/constrf.data
    src/test/regress/data/constro.data
    src/test/regress/data/dept.data
    src/test/regress/data/desc.data
    src/test/regress/data/emp.data
    src/test/regress/data/hash.data
    src/test/regress/data/onek.data
    src/test/regress/data/person.data
    src/test/regress/data/real_city.data
    src/test/regress/data/rect.data
    src/test/regress/data/streets.data
    src/test/regress/data/stud_emp.data
    src/test/regress/data/student.data
    src/test/regress/data/tenk.data
    src/test/regress/expected/abstime-solaris-1947.out
    src/test/regress/expected/abstime.out
    src/test/regress/expected/aggregates.out
    src/test/regress/expected/alter_table.out
    src/test/regress/expected/arrays.out
    src/test/regress/expected/bit.out
    src/test/regress/expected/boolean.out
    src/test/regress/expected/box.out
    src/test/regress/expected/btree_index.out
    src/test/regress/expected/case.out
    src/test/regress/expected/char.out
    src/test/regress/expected/char_1.out
    src/test/regress/expected/circle.out
    src/test/regress/expected/comments.out
    src/test/regress/expected/create_aggregate.out
    src/test/regress/expected/create_index.out
    src/test/regress/expected/create_misc.out
    src/test/regress/expected/create_operator.out
    src/test/regress/expected/create_table.out
    src/test/regress/expected/create_type.out
    src/test/regress/expected/create_view.out
    src/test/regress/expected/date.out
    src/test/regress/expected/domain.out
    src/test/regress/expected/errors.out
    src/test/regress/expected/euc_cn.out
    src/test/regress/expected/euc_jp.out
    src/test/regress/expected/euc_kr.out
    src/test/regress/expected/euc_tw.out
    src/test/regress/expected/float4-exp-three-digits.out
    src/test/regress/expected/float4.out
    src/test/regress/expected/float8-exp-three-digits.out
    src/test/regress/expected/float8-fp-exception.out
    src/test/regress/expected/float8-small-is-zero.out
    src/test/regress/expected/float8.out
    src/test/regress/expected/foreign_key.out
    src/test/regress/expected/geometry-alpha-precision.out
    src/test/regress/expected/geometry-bsdi-precision.out
    src/test/regress/expected/geometry-i86-gnulibc.out
    src/test/regress/expected/geometry-intel-beos.out
    src/test/regress/expected/geometry-irix.out
    src/test/regress/expected/geometry-positive-zeros-bsd.out
    src/test/regress/expected/geometry-positive-zeros.out
    src/test/regress/expected/geometry-powerpc-aix4.out
    src/test/regress/expected/geometry-powerpc-darwin.out
    src/test/regress/expected/geometry-powerpc-linux-gnulibc1.out
    src/test/regress/expected/geometry-solaris-i386-pc.out
    src/test/regress/expected/geometry-solaris-precision.out
    src/test/regress/expected/geometry-uw7-cc.out
    src/test/regress/expected/geometry-uw7-gcc.out
    src/test/regress/expected/geometry.out
    src/test/regress/expected/hash_index.out
    src/test/regress/expected/horology-no-DST-before-1970.out
    src/test/regress/expected/horology-solaris-1947.out
    src/test/regress/expected/horology.out
    src/test/regress/expected/inet.out
    src/test/regress/expected/inherit.out
    src/test/regress/expected/insert.out
    src/test/regress/expected/int2.out
    src/test/regress/expected/int4.out
    src/test/regress/expected/int8-exp-three-digits.out
    src/test/regress/expected/int8.out
    src/test/regress/expected/interval.out
    src/test/regress/expected/join.out
    src/test/regress/expected/limit.out
    src/test/regress/expected/lseg.out
    src/test/regress/expected/mule_internal.out
    src/test/regress/expected/name.out
    src/test/regress/expected/numeric.out
    src/test/regress/expected/numeric_big.out
    src/test/regress/expected/numerology.out
    src/test/regress/expected/oid.out
    src/test/regress/expected/oidjoins.out
    src/test/regress/expected/opr_sanity.out
    src/test/regress/expected/path.out
    src/test/regress/expected/plpgsql.out
    src/test/regress/expected/point.out
    src/test/regress/expected/polygon.out
    src/test/regress/expected/portals.out
    src/test/regress/expected/portals_p2.out
    src/test/regress/expected/privileges.out
    src/test/regress/expected/random.out
    src/test/regress/expected/reltime.out
    src/test/regress/expected/rules.out
    src/test/regress/expected/sanity_check.out
    src/test/regress/expected/select.out
    src/test/regress/expected/select_distinct.out
    src/test/regress/expected/select_distinct_on.out
    src/test/regress/expected/select_having.out
    src/test/regress/expected/select_having_1.out
    src/test/regress/expected/select_implicit.out
    src/test/regress/expected/select_implicit_1.out
    src/test/regress/expected/select_into.out
    src/test/regress/expected/select_views.out
    src/test/regress/expected/select_views_1.out
    src/test/regress/expected/sql_ascii.out
    src/test/regress/expected/strings.out
    src/test/regress/expected/subselect.out
    src/test/regress/expected/temp.out
    src/test/regress/expected/text.out
    src/test/regress/expected/time.out
    src/test/regress/expected/timestamp.out
    src/test/regress/expected/timestamptz.out
    src/test/regress/expected/timetz.out
    src/test/regress/expected/tinterval-solaris-1947.out
    src/test/regress/expected/tinterval.out
    src/test/regress/expected/transactions.out
    src/test/regress/expected/triggers.out
    src/test/regress/expected/type_sanity.out
    src/test/regress/expected/union.out
    src/test/regress/expected/varchar.out
    src/test/regress/expected/varchar_1.out
    src/test/regress/input/constraints.source
    src/test/regress/input/copy.source
    src/test/regress/input/create_function_1.source
    src/test/regress/input/create_function_2.source
    src/test/regress/input/misc.source
    src/test/regress/output/constraints.source
    src/test/regress/output/copy.source
    src/test/regress/output/create_function_1.source
    src/test/regress/output/create_function_2.source
    src/test/regress/output/misc.source
    src/test/regress/parallel_schedule
    src/test/regress/pg_regress.sh
    src/test/regress/regress.c
    src/test/regress/regressplans.sh
    src/test/regress/resultmap
    src/test/regress/serial_schedule
    src/test/regress/sql/abstime.sql
    src/test/regress/sql/aggregates.sql
    src/test/regress/sql/alter_table.sql
    src/test/regress/sql/arrays.sql
    src/test/regress/sql/bit.sql
    src/test/regress/sql/boolean.sql
    src/test/regress/sql/box.sql
    src/test/regress/sql/btree_index.sql
    src/test/regress/sql/case.sql
    src/test/regress/sql/char.sql
    src/test/regress/sql/circle.sql
    src/test/regress/sql/comments.sql
    src/test/regress/sql/create_aggregate.sql
    src/test/regress/sql/create_index.sql
    src/test/regress/sql/create_misc.sql
    src/test/regress/sql/create_operator.sql
    src/test/regress/sql/create_table.sql
    src/test/regress/sql/create_type.sql
    src/test/regress/sql/create_view.sql
    src/test/regress/sql/date.sql
    src/test/regress/sql/domain.sql
    src/test/regress/sql/drop.sql
    src/test/regress/sql/errors.sql
    src/test/regress/sql/euc_cn.sql
    src/test/regress/sql/euc_jp.sql
    src/test/regress/sql/euc_kr.sql
    src/test/regress/sql/euc_tw.sql
    src/test/regress/sql/float4.sql
    src/test/regress/sql/float8.sql
    src/test/regress/sql/foreign_key.sql
    src/test/regress/sql/geometry.sql
    src/test/regress/sql/hash_index.sql
    src/test/regress/sql/horology.sql
    src/test/regress/sql/inet.sql
    src/test/regress/sql/inherit.sql
    src/test/regress/sql/insert.sql
    src/test/regress/sql/int2.sql
    src/test/regress/sql/int4.sql
    src/test/regress/sql/int8.sql
    src/test/regress/sql/interval.sql
    src/test/regress/sql/join.sql
    src/test/regress/sql/limit.sql
    src/test/regress/sql/lseg.sql
    src/test/regress/sql/mule_internal.sql
    src/test/regress/sql/name.sql
    src/test/regress/sql/numeric.sql
    src/test/regress/sql/numeric_big.sql
    src/test/regress/sql/numerology.sql
    src/test/regress/sql/oid.sql
    src/test/regress/sql/oidjoins.sql
    src/test/regress/sql/opr_sanity.sql
    src/test/regress/sql/path.sql
    src/test/regress/sql/plpgsql.sql
    src/test/regress/sql/point.sql
    src/test/regress/sql/polygon.sql
    src/test/regress/sql/portals.sql
    src/test/regress/sql/portals_p2.sql
    src/test/regress/sql/privileges.sql
    src/test/regress/sql/random.sql
    src/test/regress/sql/reltime.sql
    src/test/regress/sql/rules.sql
    src/test/regress/sql/sanity_check.sql
    src/test/regress/sql/select.sql
    src/test/regress/sql/select_distinct.sql
    src/test/regress/sql/select_distinct_on.sql
    src/test/regress/sql/select_having.sql
    src/test/regress/sql/select_implicit.sql
    src/test/regress/sql/select_into.sql
    src/test/regress/sql/select_views.sql
    src/test/regress/sql/sql_ascii.sql
    src/test/regress/sql/strings.sql
    src/test/regress/sql/subselect.sql
    src/test/regress/sql/temp.sql
    src/test/regress/sql/text.sql
    src/test/regress/sql/time.sql
    src/test/regress/sql/timestamp.sql
    src/test/regress/sql/timestamptz.sql
    src/test/regress/sql/timetz.sql
    src/test/regress/sql/tinterval.sql
    src/test/regress/sql/transactions.sql
    src/test/regress/sql/triggers.sql
    src/test/regress/sql/type_sanity.sql
    src/test/regress/sql/union.sql
    src/test/regress/sql/varchar.sql
    src/tools/RELEASE_CHANGES
    src/tools/backend/README
    src/tools/backend/backend_dirs.html
    src/tools/backend/flow.fig
    src/tools/backend/flow.gif
    src/tools/backend/index.html
    src/tools/ccsym
    src/tools/copyright
    src/tools/entab/Makefile
    src/tools/entab/entab.c
    src/tools/entab/entab.man
    src/tools/entab/halt.c
    src/tools/find_badmacros
    src/tools/find_static
    src/tools/find_typedef
    src/tools/make_ctags
    src/tools/make_diff/README
    src/tools/make_diff/cporig
    src/tools/make_diff/difforig
    src/tools/make_diff/rmorig
    src/tools/make_etags
    src/tools/make_keywords
    src/tools/make_mkid
    src/tools/pgcvslog
    src/tools/pginclude/README
    src/tools/pginclude/pgcompinclude
    src/tools/pginclude/pgdefine
    src/tools/pginclude/pgfixinclude
    src/tools/pginclude/pgrminclude
    src/tools/pgindent/README
    src/tools/pgindent/indent.bsd.patch
    src/tools/pgindent/pgcppindent
    src/tools/pgindent/pgindent
    src/tools/pgindent/pgjindent
    src/tutorial/Makefile
    src/tutorial/README
    src/tutorial/advanced.source
    src/tutorial/basics.source
    src/tutorial/beard.c
    src/tutorial/complex.c
    src/tutorial/complex.source
    src/tutorial/funcs.c
    src/tutorial/funcs.source
    src/tutorial/funcs_new.c
    src/tutorial/syscat.source
    src/utils/Makefile
    src/utils/README
    src/utils/dllinit.c
    src/utils/getopt.c
    src/utils/strdup.c
    src/win32.mak

2 files changed, 0 insertions, 2289 deletions

diff --git a/src/backend/optimizer/path/_deadcode/predmig.c b/src/backend/optimizer/path/_deadcode/predmig.c
deleted file mode 100644
index 5ce4083ab56..00000000000
--- a/src/backend/optimizer/path/_deadcode/predmig.c
+++ /dev/null
@@ -1,810 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * predmig.c
- *
- *
- * Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- *
- * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/optimizer/path/_deadcode/Attic/predmig.c,v 1.15 2002/06/20 20:29:30 momjian Exp $
- *
- *-------------------------------------------------------------------------
- */
-/*
-** DESCRIPTION
-** Main Routines to handle Predicate Migration (i.e. correct optimization
-** of queries with expensive functions.)
-**
-**	  The reasoning behind some of these algorithms is rather detailed.
-** Have a look at Sequoia Tech Report 92/13 for more info.	Also
-** see Monma and Sidney's paper "Sequencing with Series-Parallel
-** Precedence Constraints", in "Mathematics of Operations Research",
-** volume 4 (1979),  pp. 215-224.
-**
-**	  The main thing that this code does that wasn't handled in xfunc.c is
-** it considers the possibility that two joins in a stream may not
-** be ordered by ascending rank -- in such a scenario, it may be optimal
-** to pullup more restrictions than we did via xfunc_try_pullup.
-**
-**	  This code in some sense generalizes xfunc_try_pullup; if you
-** run postgres -x noprune, you'll turn off xfunc_try_pullup, and this
-** code will do everything that xfunc_try_pullup would have, and maybe
-** more.  However, this results in no pruning, which may slow down the
-** optimizer and/or cause the system to run out of memory.
-**										   -- JMH, 11/13/92
-*/
-
-#include "nodes/pg_list.h"
-#include "nodes/nodes.h"
-#include "nodes/primnodes.h"
-#include "nodes/relation.h"
-#include "optimizer/pathnode.h"
-#include "optimizer/internal.h"
-#include "optimizer/cost.h"
-#include "optimizer/keys.h"
-#include "optimizer/tlist.h"
-
-#define is_clause(node) (get_cinfo(node))		/* a stream node
-												 * represents a clause
-												 * (not a join) iff it has
-												 * a non-NULL cinfo field */
-
-static void xfunc_predmig(JoinPath pathnode, Stream streamroot,
-			  Stream laststream, bool *progressp);
-static bool xfunc_series_llel(Stream stream);
-static bool xfunc_llel_chains(Stream root, Stream bottom);
-static Stream xfunc_complete_stream(Stream stream);
-static bool xfunc_prdmig_pullup(Stream origstream, Stream pullme,
-					JoinPath joinpath);
-static void xfunc_form_groups(Stream root, Stream bottom);
-static void xfunc_free_stream(Stream root);
-static Stream xfunc_add_clauses(Stream current);
-static void xfunc_setup_group(Stream node, Stream bottom);
-static Stream xfunc_streaminsert(RestrictInfo restrictinfo, Stream current,
-				   int clausetype);
-static int	xfunc_num_relids(Stream node);
-static StreamPtr xfunc_get_downjoin(Stream node);
-static StreamPtr xfunc_get_upjoin(Stream node);
-static Stream xfunc_stream_qsort(Stream root, Stream bottom);
-static int	xfunc_stream_compare(void *arg1, void *arg2);
-static bool xfunc_check_stream(Stream node);
-static bool xfunc_in_stream(Stream node, Stream stream);
-
-/* -----------------	 MAIN FUNCTIONS ------------------------ */
-/*
-** xfunc_do_predmig
-**	  wrapper for Predicate Migration.	It calls xfunc_predmig until no
-** more progress is made.
-**	  return value says if any changes were ever made.
-*/
-bool
-xfunc_do_predmig(Path root)
-{
-	bool		progress,
-				changed = false;
-
-	if (is_join(root))
-		do
-		{
-			progress = false;
-			Assert(IsA(root, JoinPath));
-			xfunc_predmig((JoinPath) root, (Stream) NULL, (Stream) NULL,
-						  &progress);
-			if (changed && progress)
-				elog(DEBUG, "Needed to do a second round of predmig!\n");
-			if (progress)
-				changed = true;
-		} while (progress);
-	return changed;
-}
-
-
-/*
- ** xfunc_predmig
- **  The main routine for Predicate Migration.	It traverses a join tree,
- ** and for each root-to-leaf path in the plan tree it constructs a
- ** "Stream", which it passes to xfunc_series_llel for optimization.
- ** Destructively modifies the join tree (via predicate pullup).
- */
-static void
-xfunc_predmig(JoinPath pathnode,	/* root of the join tree */
-			  Stream streamroot,
-			  Stream laststream,/* for recursive calls -- these are the
-								 * root of the stream under construction,
-								 * and the lowest node created so far */
-			  bool *progressp)
-{
-	Stream		newstream;
-
-	/*
-	 * * traverse the join tree dfs-style, constructing a stream as you
-	 * go. * When you hit a scan node, pass the stream off to
-	 * xfunc_series_llel.
-	 */
-
-	/* sanity check */
-	if ((!streamroot && laststream) ||
-		(streamroot && !laststream))
-		elog(ERROR, "called xfunc_predmig with bad inputs");
-	if (streamroot)
-		Assert(xfunc_check_stream(streamroot));
-
-	/* add path node to stream */
-	newstream = RMakeStream();
-	if (!streamroot)
-		streamroot = newstream;
-	set_upstream(newstream, (StreamPtr) laststream);
-	if (laststream)
-		set_downstream(laststream, (StreamPtr) newstream);
-	set_downstream(newstream, (StreamPtr) NULL);
-	set_pathptr(newstream, (pathPtr) pathnode);
-	set_cinfo(newstream, (RestrictInfo) NULL);
-	set_clausetype(newstream, XFUNC_UNKNOWN);
-
-	/* base case: we're at a leaf, call xfunc_series_llel */
-	if (!is_join(pathnode))
-	{
-		/* form a fleshed-out copy of the stream */
-		Stream		fullstream = xfunc_complete_stream(streamroot);
-
-		/* sort it via series-llel */
-		if (xfunc_series_llel(fullstream))
-			*progressp = true;
-
-		/* free up the copy */
-		xfunc_free_stream(fullstream);
-	}
-	else
-	{
-		/* visit left child */
-		xfunc_predmig((JoinPath) get_outerjoinpath(pathnode),
-					  streamroot, newstream, progressp);
-
-		/* visit right child */
-		xfunc_predmig((JoinPath) get_innerjoinpath(pathnode),
-					  streamroot, newstream, progressp);
-	}
-
-	/* remove this node */
-	if (get_upstream(newstream))
-		set_downstream((Stream) get_upstream(newstream), (StreamPtr) NULL);
-	pfree(newstream);
-}
-
-/*
- ** xfunc_series_llel
- **    A flavor of Monma and Sidney's Series-Parallel algorithm.
- ** Traverse stream downwards.	When you find a node with restrictions on it,
- ** call xfunc_llel_chains on the substream from root to that node.
- */
-static bool
-xfunc_series_llel(Stream stream)
-{
-	Stream		temp,
-				next;
-	bool		progress = false;
-
-	for (temp = stream; temp != (Stream) NULL; temp = next)
-	{
-		next = (Stream) xfunc_get_downjoin(temp);
-
-		/*
-		 * * if there are restrictions/secondary join clauses above this *
-		 * node, call xfunc_llel_chains
-		 */
-		if (get_upstream(temp) && is_clause((Stream) get_upstream(temp)))
-			if (xfunc_llel_chains(stream, temp))
-				progress = true;
-	}
-	return progress;
-}
-
-/*
- ** xfunc_llel_chains
- **    A flavor of Monma and Sidney's Parallel Chains algorithm.
- ** Given a stream which has been well-ordered except for its lowermost
- ** restrictions/2-ary joins, pull up the restrictions/2-arys as appropriate.
- ** What that means here is to form groups in the chain above the lowest
- ** join node above bottom inclusive, and then take all the restrictions
- ** following bottom, and try to pull them up as far as possible.
- */
-static bool
-xfunc_llel_chains(Stream root, Stream bottom)
-{
-	bool		progress = false;
-	Stream		origstream;
-	Stream		tmpstream,
-				pathstream;
-	Stream		rootcopy = root;
-
-	Assert(xfunc_check_stream(root));
-
-	/* xfunc_prdmig_pullup will need an unmodified copy of the stream */
-	origstream = (Stream) copyObject((Node) root);
-
-	/* form groups among ill-ordered nodes */
-	xfunc_form_groups(root, bottom);
-
-	/* sort chain by rank */
-	Assert(xfunc_in_stream(bottom, root));
-	rootcopy = xfunc_stream_qsort(root, bottom);
-
-	/*
-	 * * traverse sorted stream -- if any restriction has moved above a
-	 * join, * we must pull it up in the plan.	That is, make plan tree *
-	 * reflect order of sorted stream.
-	 */
-	for (tmpstream = rootcopy,
-		 pathstream = (Stream) xfunc_get_downjoin(rootcopy);
-		 tmpstream != (Stream) NULL && pathstream != (Stream) NULL;
-		 tmpstream = (Stream) get_downstream(tmpstream))
-	{
-		if (is_clause(tmpstream)
-			&& get_pathptr(pathstream) != get_pathptr(tmpstream))
-		{
-			/*
-			 * * If restriction moved above a Join after sort, we pull it *
-			 * up in the join plan. *	 If restriction moved down, we
-			 * ignore it. * This is because Joey's Sequoia paper proves
-			 * that * restrictions should never move down.	If this * one
-			 * were moved down, it would violate "semantic correctness", *
-			 * i.e. it would be lower than the attributes it references.
-			 */
-			Assert(xfunc_num_relids(pathstream) > xfunc_num_relids(tmpstream));
-			progress = xfunc_prdmig_pullup(origstream, tmpstream,
-									 (JoinPath) get_pathptr(pathstream));
-		}
-		if (get_downstream(tmpstream))
-			pathstream = (Stream) xfunc_get_downjoin((Stream) get_downstream(tmpstream));
-	}
-
-	/* free up origstream */
-	xfunc_free_stream(origstream);
-	return progress;
-}
-
-/*
- ** xfunc_complete_stream
- **   Given a stream composed of join nodes only, make a copy containing the
- ** join nodes along with the associated restriction nodes.
- */
-static Stream
-xfunc_complete_stream(Stream stream)
-{
-	Stream		tmpstream,
-				copystream,
-				curstream = (Stream) NULL;
-
-	copystream = (Stream) copyObject((Node) stream);
-	Assert(xfunc_check_stream(copystream));
-
-	curstream = copystream;
-	Assert(!is_clause(curstream));
-
-	/* curstream = (Stream)xfunc_get_downjoin(curstream); */
-
-	while (curstream != (Stream) NULL)
-	{
-		xfunc_add_clauses(curstream);
-		curstream = (Stream) xfunc_get_downjoin(curstream);
-	}
-
-	/* find top of stream and return it */
-	for (tmpstream = copystream; get_upstream(tmpstream) != (StreamPtr) NULL;
-		 tmpstream = (Stream) get_upstream(tmpstream))
-		 /* no body in for loop */ ;
-
-	return tmpstream;
-}
-
-/*
- ** xfunc_prdmig_pullup
- **    pullup a clause in a path above joinpath.  Since the JoinPath tree
- ** doesn't have upward pointers, it's difficult to deal with.	Thus we
- ** require the original stream, which maintains pointers to all the path
- ** nodes.	We use the original stream to find out what joins are
- ** above the clause.
- */
-static bool
-xfunc_prdmig_pullup(Stream origstream, Stream pullme, JoinPath joinpath)
-{
-	RestrictInfo restrictinfo = get_cinfo(pullme);
-	bool		progress = false;
-	Stream		upjoin,
-				orignode,
-				temp;
-	int			whichchild;
-
-	/* find node in origstream that contains clause */
-	for (orignode = origstream;
-		 orignode != (Stream) NULL
-		 && get_cinfo(orignode) != restrictinfo;
-		 orignode = (Stream) get_downstream(orignode))
-		 /* empty body in for loop */ ;
-	if (!orignode)
-		elog(ERROR, "Didn't find matching node in original stream");
-
-
-	/* pull up this node as far as it should go */
-	for (upjoin = (Stream) xfunc_get_upjoin(orignode);
-		 upjoin != (Stream) NULL
-		 && (JoinPath) get_pathptr((Stream) xfunc_get_downjoin(upjoin))
-		 != joinpath;
-		 upjoin = (Stream) xfunc_get_upjoin(upjoin))
-	{
-#ifdef DEBUG
-		elog(DEBUG, "pulling up in xfunc_predmig_pullup!");
-#endif
-		/* move clause up in path */
-		if (get_pathptr((Stream) get_downstream(upjoin))
-		  == (pathPtr) get_outerjoinpath((JoinPath) get_pathptr(upjoin)))
-			whichchild = OUTER;
-		else
-			whichchild = INNER;
-		restrictinfo = xfunc_pullup((Path) get_pathptr((Stream) get_downstream(upjoin)),
-									(JoinPath) get_pathptr(upjoin),
-									restrictinfo,
-									whichchild,
-									get_clausetype(orignode));
-		set_pathptr(pullme, get_pathptr(upjoin));
-		/* pullme has been moved into locrestrictinfo */
-		set_clausetype(pullme, XFUNC_LOCPRD);
-
-		/*
-		 * * xfunc_pullup makes new path nodes for children of *
-		 * get_pathptr(current). We must modify the stream nodes to point *
-		 * to these path nodes
-		 */
-		if (whichchild == OUTER)
-		{
-			for (temp = (Stream) get_downstream(upjoin); is_clause(temp);
-				 temp = (Stream) get_downstream(temp))
-				set_pathptr
-					(temp, (pathPtr)
-					 get_outerjoinpath((JoinPath) get_pathptr(upjoin)));
-			set_pathptr
-				(temp,
-			(pathPtr) get_outerjoinpath((JoinPath) get_pathptr(upjoin)));
-		}
-		else
-		{
-			for (temp = (Stream) get_downstream(upjoin); is_clause(temp);
-				 temp = (Stream) get_downstream(temp))
-				set_pathptr
-					(temp, (pathPtr)
-					 get_innerjoinpath((JoinPath) get_pathptr(upjoin)));
-			set_pathptr
-				(temp, (pathPtr)
-				 get_innerjoinpath((JoinPath) get_pathptr(upjoin)));
-		}
-		progress = true;
-	}
-	if (!progress)
-		elog(DEBUG, "didn't succeed in pulling up in xfunc_prdmig_pullup");
-	return progress;
-}
-
-/*
- ** 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
- ** up between a and b, and therefore we may treat them as a group, with
- ** selectivity equal to the product of their selectivities, and cost
- ** equal to the cost of the first plus the selectivity of the first times the
- ** cost of the second.  We define each node to be in a group by itself,
- ** and then repeatedly find adjacent groups which are ordered by descending
- ** rank, and make larger groups.  You know that two adjacent nodes are in a
- ** group together if the lower has groupup set to true.  They will both have
- ** the same groupcost and groupsel (since they're in the same group!)
- */
-static void
-xfunc_form_groups(Query *queryInfo, Stream root, Stream bottom)
-{
-	Stream		temp,
-				parent;
-	int			lowest = xfunc_num_relids((Stream) xfunc_get_upjoin(bottom));
-	bool		progress;
-	LispValue	primjoin;
-	int			whichchild;
-
-	if (!lowest)
-		return;					/* no joins in stream, so no groups */
-
-	/* initialize groups to be single nodes */
-	for (temp = root;
-		 temp != (Stream) NULL && temp != bottom;
-		 temp = (Stream) get_downstream(temp))
-	{
-		/* if a Join node */
-		if (!is_clause(temp))
-		{
-			if (get_pathptr((Stream) get_downstream(temp))
-			== (pathPtr) get_outerjoinpath((JoinPath) get_pathptr(temp)))
-				whichchild = OUTER;
-			else
-				whichchild = INNER;
-			set_groupcost(temp,
-						  xfunc_join_expense((JoinPath) get_pathptr(temp),
-											 whichchild));
-			if (primjoin = xfunc_primary_join((JoinPath) get_pathptr(temp)))
-			{
-				set_groupsel(temp,
-							 compute_clause_selec(queryInfo,
-												  primjoin, NIL));
-			}
-			else
-				set_groupsel(temp, 1.0);
-		}
-		else
-/* a restriction, or 2-ary join pred */
-		{
-			set_groupcost(temp,
-						  xfunc_expense(queryInfo,
-										get_clause(get_cinfo(temp))));
-			set_groupsel(temp,
-						 compute_clause_selec(queryInfo,
-											  get_clause(get_cinfo(temp)),
-											  NIL));
-		}
-		set_groupup(temp, false);
-	}
-
-	/* make passes upwards, forming groups */
-	do
-	{
-		progress = false;
-		for (temp = (Stream) get_upstream(bottom);
-			 temp != (Stream) NULL;
-			 temp = (Stream) get_upstream(temp))
-		{
-			/* check for grouping with node upstream */
-			if (!get_groupup(temp) &&	/* not already grouped */
-				(parent = (Stream) get_upstream(temp)) != (Stream) NULL &&
-			/* temp is a join or temp is the top of a group */
-				(is_join((Path) get_pathptr(temp)) ||
-				 get_downstream(temp) &&
-				 get_groupup((Stream) get_downstream(temp))) &&
-				get_grouprank(parent) < get_grouprank(temp))
-			{
-				progress = true;	/* we formed a new group */
-				set_groupup(temp, true);
-				set_groupcost(temp,
-							  get_groupcost(temp) +
-							  get_groupsel(temp) * get_groupcost(parent));
-				set_groupsel(temp, get_groupsel(temp) * get_groupsel(parent));
-
-				/* fix costs and sels of all members of group */
-				xfunc_setup_group(temp, bottom);
-			}
-		}
-	} while (progress);
-}
-
-
-/* -------------------									   UTILITY FUNCTIONS	 ------------------------- */
-
-/*
- ** xfunc_free_stream
- **   walk down a stream and pfree it
- */
-static void
-xfunc_free_stream(Stream root)
-{
-	Stream		cur,
-				next;
-
-	Assert(xfunc_check_stream(root));
-
-	if (root != (Stream) NULL)
-		for (cur = root; cur != (Stream) NULL; cur = next)
-		{
-			next = (Stream) get_downstream(cur);
-			pfree(cur);
-		}
-}
-
-/*
- ** xfunc_add<_clauses
- **    find any clauses above current, and insert them into stream as
- ** appropriate.  Return uppermost clause inserted, or current if none.
- */
-static Stream
-xfunc_add_clauses(Stream current)
-{
-	Stream		topnode = current;
-	LispValue	temp;
-	LispValue	primjoin;
-
-	/* first add in the local clauses */
-	foreach(temp, get_loc_restrictinfo((Path) get_pathptr(current)))
-	{
-		topnode = xfunc_streaminsert((RestrictInfo) lfirst(temp), topnode,
-									 XFUNC_LOCPRD);
-	}
-
-	/* and add in the join clauses */
-	if (IsA(get_pathptr(current), JoinPath))
-	{
-		primjoin = xfunc_primary_join((JoinPath) get_pathptr(current));
-		foreach(temp, get_pathrestrictinfo((JoinPath) get_pathptr(current)))
-		{
-			if (!equal(get_clause((RestrictInfo) lfirst(temp)), primjoin))
-				topnode = xfunc_streaminsert((RestrictInfo) lfirst(temp), topnode,
-											 XFUNC_JOINPRD);
-		}
-	}
-	return topnode;
-}
-
-
-/*
- ** xfunc_setup_group
- **   find all elements of stream that are grouped with node and are above
- ** bottom, and set their groupcost and groupsel to be the same as node's.
- */
-static void
-xfunc_setup_group(Stream node, Stream bottom)
-{
-	Stream		temp;
-
-	if (node != bottom)
-		/* traverse downwards */
-		for (temp = (Stream) get_downstream(node);
-			 temp != (Stream) NULL && temp != bottom;
-			 temp = (Stream) get_downstream(temp))
-		{
-			if (!get_groupup(temp))
-				break;
-			else
-			{
-				set_groupcost(temp, get_groupcost(node));
-				set_groupsel(temp, get_groupsel(node));
-			}
-		}
-
-	/* traverse upwards */
-	for (temp = (Stream) get_upstream(node); temp != (Stream) NULL;
-		 temp = (Stream) get_upstream(temp))
-	{
-		if (!get_groupup((Stream) get_downstream(temp)))
-			break;
-		else
-		{
-			set_groupcost(temp, get_groupcost(node));
-			set_groupsel(temp, get_groupsel(node));
-		}
-	}
-}
-
-
-/*
- ** xfunc_streaminsert
- **    Make a new Stream node to hold clause, and insert it above current.
- ** Return new node.
- */
-static Stream
-xfunc_streaminsert(RestrictInfo restrictinfo,
-				   Stream current,
-				   int clausetype)		/* XFUNC_LOCPRD or XFUNC_JOINPRD */
-{
-	Stream		newstream = RMakeStream();
-
-	set_upstream(newstream, get_upstream(current));
-	if (get_upstream(current))
-		set_downstream((Stream) (get_upstream(current)), (StreamPtr) newstream);
-	set_upstream(current, (StreamPtr) newstream);
-	set_downstream(newstream, (StreamPtr) current);
-	set_pathptr(newstream, get_pathptr(current));
-	set_cinfo(newstream, restrictinfo);
-	set_clausetype(newstream, clausetype);
-	return newstream;
-}
-
-/*
- ** Given a Stream node, find the number of relids referenced in the pathnode
- ** associated with the stream node.  The number of relids gives a unique
- ** ordering on the joins in a stream, which we use to compare the height of
- ** join nodes.
- */
-static int
-xfunc_num_relids(Stream node)
-{
-	if (!node || !IsA(get_pathptr(node), JoinPath))
-		return 0;
-	else
-		return (length
-				(get_relids(get_parent((JoinPath) get_pathptr(node)))));
-}
-
-/*
- ** xfunc_get_downjoin
- **    Given a stream node, find the next lowest node which points to a
- ** join predicate or a scan node.
- */
-static StreamPtr
-xfunc_get_downjoin(Stream node)
-{
-	Stream		temp;
-
-	if (!is_clause(node))		/* if this is a join */
-		node = (Stream) get_downstream(node);
-	for (temp = node; temp && is_clause(temp);
-		 temp = (Stream) get_downstream(temp))
-		 /* empty body in for loop */ ;
-
-	return (StreamPtr) temp;
-}
-
-/*
- ** xfunc_get_upjoin
- **   same as above, but upwards.
- */
-static StreamPtr
-xfunc_get_upjoin(Stream node)
-{
-	Stream		temp;
-
-	if (!is_clause(node))		/* if this is a join */
-		node = (Stream) get_upstream(node);
-	for (temp = node; temp && is_clause(temp);
-		 temp = (Stream) get_upstream(temp))
-		 /* empty body in for loop */ ;
-
-	return (StreamPtr) temp;
-}
-
-/*
- ** 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.
- */
-static Stream
-xfunc_stream_qsort(Stream root, Stream bottom)
-{
-	int			i;
-	size_t		num;
-	Stream	   *nodearray,
-				output;
-	Stream		tmp;
-
-	/* find size of list */
-	for (num = 0, tmp = root; tmp != bottom;
-		 tmp = (Stream) get_downstream(tmp))
-		num++;
-	if (num <= 1)
-		return root;
-
-	/* copy elements of the list into an array */
-	nodearray = (Stream *) palloc(num * sizeof(Stream));
-
-	for (tmp = root, i = 0; tmp != bottom;
-		 tmp = (Stream) get_downstream(tmp), i++)
-		nodearray[i] = tmp;
-
-	/* sort the array */
-	qsort(nodearray, num, sizeof(LispValue), xfunc_stream_compare);
-
-	/* paste together the array elements */
-	output = nodearray[num - 1];
-	set_upstream(output, (StreamPtr) NULL);
-	for (i = num - 2; i >= 0; i--)
-	{
-		set_downstream(nodearray[i + 1], (StreamPtr) nodearray[i]);
-		set_upstream(nodearray[i], (StreamPtr) nodearray[i + 1]);
-	}
-	set_downstream(nodearray[0], (StreamPtr) bottom);
-	if (bottom)
-		set_upstream(bottom, (StreamPtr) nodearray[0]);
-
-	Assert(xfunc_check_stream(output));
-	return output;
-}
-
-/*
- ** xfunc_stream_compare
- **    comparison function for xfunc_stream_qsort.
- ** Compare nodes by group rank.  If group ranks are equal, ensure that
- ** join nodes appear in same order as in plan tree.
- */
-static int
-xfunc_stream_compare(void *arg1, void *arg2)
-{
-	Stream		stream1 = *(Stream *) arg1;
-	Stream		stream2 = *(Stream *) arg2;
-	Cost		rank1,
-				rank2;
-
-	rank1 = get_grouprank(stream1);
-	rank2 = get_grouprank(stream2);
-
-	if (rank1 > rank2)
-		return 1;
-	else if (rank1 < rank2)
-		return -1;
-	else
-	{
-		if (is_clause(stream1) && is_clause(stream2))
-			return 0;			/* doesn't matter what order if both are
-								 * restrictions */
-		else if (!is_clause(stream1) && !is_clause(stream2))
-		{
-			if (xfunc_num_relids(stream1) < xfunc_num_relids(stream2))
-				return -1;
-			else
-				return 1;
-		}
-		else if (is_clause(stream1) && !is_clause(stream2))
-		{
-			if (xfunc_num_relids(stream1) == xfunc_num_relids(stream2))
-				/* stream1 is a restriction over stream2 */
-				return 1;
-			else
-				return -1;
-		}
-		else if (!is_clause(stream1) && is_clause(stream2))
-		{
-			/* stream2 is a restriction over stream1: never push down */
-			return -1;
-		}
-	}
-}
-
-/* ------------------  DEBUGGING ROUTINES ---------------------------- */
-
-/*
- ** Make sure all pointers in stream make sense.  Make sure no joins are
- ** out of order.
- */
-static bool
-xfunc_check_stream(Stream node)
-{
-	Stream		temp;
-	int			numrelids,
-				tmp;
-
-	/* set numrelids higher than max */
-	if (!is_clause(node))
-		numrelids = xfunc_num_relids(node) + 1;
-	else if (xfunc_get_downjoin(node))
-		numrelids = xfunc_num_relids((Stream) xfunc_get_downjoin(node)) + 1;
-	else
-		numrelids = 1;
-
-	for (temp = node; get_downstream(temp); temp = (Stream) get_downstream(temp))
-	{
-		if ((Stream) get_upstream((Stream) get_downstream(temp)) != temp)
-		{
-			elog(ERROR, "bad pointers in stream");
-			return false;
-		}
-		if (!is_clause(temp))
-		{
-			if ((tmp = xfunc_num_relids(temp)) >= numrelids)
-			{
-				elog(ERROR, "Joins got reordered!");
-				return false;
-			}
-			numrelids = tmp;
-		}
-	}
-
-	return true;
-}
-
-/*
- ** xfunc_in_stream
- **   check if node is in stream
- */
-static bool
-xfunc_in_stream(Stream node, Stream stream)
-{
-	Stream		temp;
-
-	for (temp = stream; temp; temp = (Stream) get_downstream(temp))
-		if (temp == node)
-			return 1;
-	return 0;
-}
diff --git a/src/backend/optimizer/path/_deadcode/xfunc.c b/src/backend/optimizer/path/_deadcode/xfunc.c
deleted file mode 100644
index 80087652c79..00000000000
--- a/src/backend/optimizer/path/_deadcode/xfunc.c
+++ /dev/null
@@ -1,1479 +0,0 @@
-/*-------------------------------------------------------------------------
- *
- * xfunc.c
- *	  Utility routines to handle expensive function optimization.
- *	  Includes xfunc_trypullup(), which attempts early pullup of predicates
- *	  to allow for maximal pruning.
- *
- * Portions Copyright (c) 1996-2002, PostgreSQL Global Development Group
- * Portions Copyright (c) 1994, Regents of the University of California
- *
- *
- * IDENTIFICATION
- *	  $Header: /cvsroot/pgsql/src/backend/optimizer/path/_deadcode/Attic/xfunc.c,v 1.19 2002/06/20 20:29:30 momjian Exp $
- *
- *-------------------------------------------------------------------------
- */
-#include <math.h>
-
-#ifdef HAVE_VALUES_H
-#include <values.h>
-#endif
-
-#include "postgres.h"
-
-#include "access/heapam.h"
-#include "access/htup.h"
-#include "catalog/pg_language.h"
-#include "catalog/pg_proc.h"
-#include "catalog/pg_type.h"
-#include "lib/lispsort.h"
-#include "nodes/nodes.h"
-#include "nodes/pg_list.h"
-#include "nodes/primnodes.h"
-#include "nodes/relation.h"
-#include "optimizer/clauses.h"
-#include "optimizer/cost.h"
-#include "optimizer/internal.h"
-#include "optimizer/keys.h"
-#include "optimizer/pathnode.h"
-#include "optimizer/tlist.h"
-#include "storage/buf_internals.h"
-#include "tcop/dest.h"
-#include "utils/syscache.h"
-
-#define ever ; 1 ;
-
-/* local funcs */
-static int xfunc_card_unreferenced(Query *queryInfo,
-						Expr *clause, Relids referenced);
-
-*/
-
-/*
-** 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.
-*/
-
-void
-xfunc_trypullup(RelOptInfo rel)
-{
-	LispValue	y;				/* list ptr */
-	RestrictInfo maxcinfo;		/* The RestrictInfo to pull up, as
-								 * calculated by xfunc_shouldpull() */
-	JoinPath	curpath;		/* current path in list */
-	int			progress;		/* has progress been made this time
-								 * through? */
-	int			clausetype;
-
-	do
-	{
-		progress = false;		/* no progress yet in this iteration */
-		foreach(y, get_pathlist(rel))
-		{
-			curpath = (JoinPath) lfirst(y);
-
-			/*
-			 * * for each operand, attempt to pullup predicates until
-			 * first * failure.
-			 */
-			for (ever)
-			{
-				/* No, the following should NOT be '=='  !! */
-				if (clausetype = xfunc_shouldpull((Path) get_innerjoinpath(curpath),
-											  curpath, INNER, &maxcinfo))
-				{
-
-					xfunc_pullup((Path) get_innerjoinpath(curpath),
-								 curpath, maxcinfo, INNER, clausetype);
-					progress = true;
-				}
-				else
-					break;
-			}
-			for (ever)
-			{
-
-				/* No, the following should NOT be '=='  !! */
-				if (clausetype = xfunc_shouldpull((Path) get_outerjoinpath(curpath),
-											  curpath, OUTER, &maxcinfo))
-				{
-
-					xfunc_pullup((Path) get_outerjoinpath(curpath),
-								 curpath, maxcinfo, OUTER, clausetype);
-					progress = true;
-				}
-				else
-					break;
-			}
-
-			/*
-			 * * make sure the unpruneable flag bubbles up, i.e. * if
-			 * anywhere below us in the path pruneable is false, * then
-			 * pruneable should be false here
-			 */
-			if (get_pruneable(get_parent(curpath)) &&
-				(!get_pruneable(get_parent
-								((Path) get_innerjoinpath(curpath))) ||
-				 !get_pruneable(get_parent((Path)
-										   get_outerjoinpath(curpath)))))
-			{
-
-				set_pruneable(get_parent(curpath), false);
-				progress = true;
-			}
-		}
-	} while (progress);
-}
-
-/*
- ** 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
- ** left where they are.
- **    If we find an expensive function but decide *not* to pull it up,
- ** we'd better set the unpruneable flag.  -- JMH, 11/11/92
- **
- ** Returns:  0 if nothing left to pullup
- **			  XFUNC_LOCPRD if a local predicate is to be pulled up
- **			  XFUNC_JOINPRD if a secondary join predicate is to be pulled up
- */
-int
-xfunc_shouldpull(Query *queryInfo,
-				 Path childpath,
-				 JoinPath parentpath,
-				 int whichchild,
-				 RestrictInfo *maxcinfopt)		/* Out: pointer to clause
-												 * to pullup */
-{
-	LispValue	clauselist,
-				tmplist;		/* lists of clauses */
-	RestrictInfo maxcinfo;		/* clause to pullup */
-	LispValue	primjoinclause	/* primary join clause */
-	= xfunc_primary_join(parentpath);
-	Cost		tmprank,
-				maxrank = (-1 * MAXFLOAT);		/* ranks of clauses */
-	Cost		joinselec = 0;	/* selectivity of the join predicate */
-	Cost		joincost = 0;	/* join cost + primjoinclause cost */
-	int			retval = XFUNC_LOCPRD;
-
-	clauselist = get_loc_restrictinfo(childpath);
-
-	if (clauselist != LispNil)
-	{
-		/* find local predicate with maximum rank */
-		for (tmplist = clauselist,
-			 maxcinfo = (RestrictInfo) lfirst(tmplist),
-			 maxrank = xfunc_rank(get_clause(maxcinfo));
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-		{
-
-			if ((tmprank = xfunc_rank(get_clause((RestrictInfo) lfirst(tmplist))))
-				> maxrank)
-			{
-				maxcinfo = (RestrictInfo) lfirst(tmplist);
-				maxrank = tmprank;
-			}
-		}
-	}
-
-	/*
-	 * * If child is a join path, and there are multiple join clauses, *
-	 * see if any join clause has even higher rank than the highest *
-	 * local predicate
-	 */
-	if (is_join(childpath) && xfunc_num_join_clauses((JoinPath) childpath) > 1)
-		for (tmplist = get_pathrestrictinfo((JoinPath) childpath);
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-		{
-
-			if (tmplist != LispNil &&
-				(tmprank = xfunc_rank(get_clause((RestrictInfo) lfirst(tmplist))))
-				> maxrank)
-			{
-				maxcinfo = (RestrictInfo) lfirst(tmplist);
-				maxrank = tmprank;
-				retval = XFUNC_JOINPRD;
-			}
-		}
-	if (maxrank == (-1 * MAXFLOAT))		/* no expensive clauses */
-		return 0;
-
-	/*
-	 * * Pullup over join if clause is higher rank than join, or if * join
-	 * is nested loop and current path is inner child (note that *
-	 * restrictions on the inner of a nested loop don't buy you anything
-	 * -- * you still have to scan the entire inner relation each time). *
-	 * Note that the cost of a secondary join clause is only what's *
-	 * calculated by xfunc_expense(), since the actual joining * (i.e. the
-	 * usual path_cost) is paid for by the primary join clause.
-	 */
-	if (primjoinclause != LispNil)
-	{
-		joinselec = compute_clause_selec(queryInfo, primjoinclause, LispNil);
-		joincost = xfunc_join_expense(parentpath, whichchild);
-
-		if (XfuncMode == XFUNC_PULLALL ||
-			(XfuncMode != XFUNC_WAIT &&
-			 ((joincost != 0 &&
-			   (maxrank = xfunc_rank(get_clause(maxcinfo))) >
-			   ((joinselec - 1.0) / joincost))
-			  || (joincost == 0 && joinselec < 1)
-			  || (!is_join(childpath)
-				  && (whichchild == INNER)
-				  && IsA(parentpath, NestPath)
-				  &&!IsA(parentpath, HashPath)
-				  &&!IsA(parentpath, MergePath)))))
-		{
-
-			*maxcinfopt = maxcinfo;
-			return retval;
-
-		}
-		else if (maxrank != -(MAXFLOAT))
-		{
-			/*
-			 * * we've left an expensive restriction below a join.  Since *
-			 * we may pullup this restriction in predmig.c, we'd best *
-			 * set the RelOptInfo of this join to be unpruneable
-			 */
-			set_pruneable(get_parent(parentpath), false);
-			/* and fall through */
-		}
-	}
-	return 0;
-}
-
-
-/*
- ** 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,
- ** although this RelOptInfo will not be added to the list of Rels to be joined up
- ** in the query; it's merely a parent for the new childpath.
- **    We also have to fix up the path costs of the child and parent.
- **
- ** Now returns a pointer to the new pulled-up RestrictInfo. -- JMH, 11/18/92
- */
-RestrictInfo
-xfunc_pullup(Query *queryInfo,
-			 Path childpath,
-			 JoinPath parentpath,
-			 RestrictInfo cinfo,	/* clause to pull up */
-			 int whichchild,	/* whether child is INNER or OUTER of join */
-			 int clausetype)	/* whether clause to pull is join or local */
-{
-	Path		newkid;
-	RelOptInfo	newrel;
-	Cost		pulled_selec;
-	Cost		cost;
-	RestrictInfo newinfo;
-
-	/* remove clause from childpath */
-	newkid = (Path) copyObject((Node) childpath);
-	if (clausetype == XFUNC_LOCPRD)
-	{
-		set_locrestrictinfo(newkid,
-							xfunc_LispRemove((LispValue) cinfo,
-								   (List) get_loc_restrictinfo(newkid)));
-	}
-	else
-	{
-		set_pathrestrictinfo
-			((JoinPath) newkid,
-			 xfunc_LispRemove((LispValue) cinfo,
-						(List) get_pathrestrictinfo((JoinPath) newkid)));
-	}
-
-	/*
-	 * * give the new child path its own RelOptInfo node that reflects the *
-	 * lack of the pulled-up predicate
-	 */
-	pulled_selec = compute_clause_selec(queryInfo,
-										get_clause(cinfo), LispNil);
-	xfunc_copyrel(get_parent(newkid), &newrel);
-	set_parent(newkid, newrel);
-	set_pathlist(newrel, makeList1(newkid));
-	set_unorderedpath(newrel, (PathPtr) newkid);
-	set_cheapestpath(newrel, (PathPtr) newkid);
-	set_size(newrel,
-		(Count) ((Cost) get_size(get_parent(childpath)) / pulled_selec));
-
-	/*
-	 * * fix up path cost of newkid.  To do this we subtract away all the *
-	 * xfunc_costs of childpath, then recompute the xfunc_costs of newkid
-	 */
-	cost = get_path_cost(newkid) - xfunc_get_path_cost(childpath);
-	Assert(cost >= 0);
-	set_path_cost(newkid, cost);
-	cost = get_path_cost(newkid) + xfunc_get_path_cost(newkid);
-	set_path_cost(newkid, cost);
-
-	/*
-	 * * We copy the cinfo, since it may appear in other plans, and we're
-	 * going * to munge it.  -- JMH, 7/22/92
-	 */
-	newinfo = (RestrictInfo) copyObject((Node) cinfo);
-
-	/*
-	 * * Fix all vars in the clause * to point to the right varno and
-	 * varattno in parentpath
-	 */
-	xfunc_fixvars(get_clause(newinfo), newrel, whichchild);
-
-	/* add clause to parentpath, and fix up its cost. */
-	set_locrestrictinfo(parentpath,
-						lispCons((LispValue) newinfo,
-						  (LispValue) get_loc_restrictinfo(parentpath)));
-	/* put new childpath into the path tree */
-	if (whichchild == INNER)
-		set_innerjoinpath(parentpath, (pathPtr) newkid);
-	else
-		set_outerjoinpath(parentpath, (pathPtr) newkid);
-
-	/*
-	 * * recompute parentpath cost from scratch -- the cost * of the join
-	 * method has changed
-	 */
-	cost = xfunc_total_path_cost(parentpath);
-	set_path_cost(parentpath, cost);
-
-	return newinfo;
-}
-
-/*
- ** calculate (selectivity-1)/cost.
- */
-Cost
-xfunc_rank(Query *queryInfo, LispValue clause)
-{
-	Cost		selec = compute_clause_selec(queryInfo, clause, LispNil);
-	Cost		cost = xfunc_expense(queryInfo, clause);
-
-	if (cost == 0)
-		if (selec > 1)
-			return MAXFLOAT;
-		else
-			return -(MAXFLOAT);
-	return (selec - 1) / cost;
-}
-
-/*
- ** Find the "global" expense of a clause; i.e. the local expense divided
- ** by the cardinalities of all the base relations of the query that are *not*
- ** referenced in the clause.
- */
-Cost
-xfunc_expense(Query *queryInfo, clause)
-LispValue	clause;
-{
-	Cost		cost = xfunc_local_expense(clause);
-
-	if (cost)
-	{
-		Count		card = xfunc_card_unreferenced(queryInfo, clause, LispNil);
-
-		if (card)
-			cost /= card;
-	}
-
-	return cost;
-}
-
-/*
- ** xfunc_join_expense
- **    Find global expense of a join clause
- */
-Cost
-xfunc_join_expense(Query *queryInfo, JoinPath path, int whichchild)
-{
-	LispValue	primjoinclause = xfunc_primary_join(path);
-
-	/*
-	 * * the second argument to xfunc_card_unreferenced reflects all the *
-	 * relations involved in the join clause, i.e. all the relids in the
-	 * RelOptInfo * of the join clause
-	 */
-	Count		card = 0;
-	Cost		cost = xfunc_expense_per_tuple(path, whichchild);
-
-	card = xfunc_card_unreferenced(queryInfo,
-								   primjoinclause,
-								   get_relids(get_parent(path)));
-	if (primjoinclause)
-		cost += xfunc_local_expense(primjoinclause);
-
-	if (card)
-		cost /= card;
-
-	return cost;
-}
-
-/*
- ** Recursively find the per-tuple expense of a clause.  See
- ** xfunc_func_expense for more discussion.
- */
-Cost
-xfunc_local_expense(LispValue clause)
-{
-	Cost		cost = 0;		/* running expense */
-	LispValue	tmpclause;
-
-	/* First handle the base case */
-	if (IsA(clause, Const) ||IsA(clause, Var) ||IsA(clause, Param))
-		return 0;
-	/* now other stuff */
-	else if (IsA(clause, Iter))
-		/* Too low. Should multiply by the expected number of iterations. */
-		return xfunc_local_expense(get_iterexpr((Iter) clause));
-	else if (IsA(clause, ArrayRef))
-		return xfunc_local_expense(get_refexpr((ArrayRef) clause));
-	else if (fast_is_clause(clause))
-		return (xfunc_func_expense((LispValue) get_op(clause),
-								   (LispValue) get_opargs(clause)));
-	else if (fast_is_funcclause(clause))
-		return (xfunc_func_expense((LispValue) get_function(clause),
-								   (LispValue) get_funcargs(clause)));
-	else if (fast_not_clause(clause))
-		return xfunc_local_expense(lsecond(clause));
-	else if (fast_or_clause(clause) || fast_and_clause(clause))
-	{
-		/* find cost of evaluating each disjunct */
-		for (tmpclause = lnext(clause); tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-			cost += xfunc_local_expense(lfirst(tmpclause));
-		return cost;
-	}
-	else
-	{
-		elog(ERROR, "Clause node of undetermined type");
-		return -1;
-	}
-}
-
-/*
- ** 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
- ** our calculations; we just need the per-tuple expense.  But he also
- ** proposes components to take into account the costs of accessing disk and
- ** archive.  We didn't adopt that scheme here; eventually the vacuum
- ** cleaner should be able to tell us what percentage of bytes to find on
- ** which storage level, and that should be multiplied in appropriately
- ** in the cost function below.  Right now we don't model the cost of
- ** accessing secondary or tertiary storage, since we don't have sufficient
- ** stats to do it right.
- */
-Cost
-xfunc_func_expense(LispValue node, LispValue args)
-{
-	HeapTuple	tupl;			/* the pg_proc tuple for each function */
-	Form_pg_proc proc;			/* a data structure to hold the pg_proc
-								 * tuple */
-	int			width = 0;		/* byte width of the field referenced by
-								 * each clause */
-	RegProcedure funcid;		/* ID of function associate with node */
-	Cost		cost = 0;		/* running expense */
-	LispValue	tmpclause;
-	LispValue	operand;		/* one operand of an operator */
-
-	if (IsA(node, Oper))
-	{
-		/* don't trust the opid in the Oper node.  Use the opno. */
-		if (!(funcid = get_opcode(get_opno((Oper) node))))
-			elog(ERROR, "Oper's function is undefined");
-	}
-	else
-		funcid = get_funcid((Func) node);
-
-	/* look up tuple in cache */
-	tupl = SearchSysCacheTuple(PROCOID,
-							   ObjectIdGetDatum(funcid),
-							   0, 0, 0);
-	if (!HeapTupleIsValid(tupl))
-		elog(ERROR, "Cache lookup failed for procedure %u", funcid);
-	proc = (Form_pg_proc) GETSTRUCT(tupl);
-
-	/*
-	 * * if it's a Postquel function, its cost is stored in the *
-	 * associated plan.
-	 */
-	if (proc->prolang == SQLlanguageId)
-	{
-		LispValue	tmpplan;
-		List		planlist;
-
-		if (IsA(node, Oper) ||get_func_planlist((Func) node) == LispNil)
-		{
-			Oid		   *argOidVect;		/* vector of argtypes */
-			char	   *pq_src; /* text of PQ function */
-			int			nargs;	/* num args to PQ function */
-			QueryTreeList *queryTree_list;		/* dummy variable */
-
-			/*
-			 * * plan the function, storing it in the Func node for later *
-			 * use by the executor.
-			 */
-			pq_src = (char *) textout(&(proc->prosrc));
-			nargs = proc->pronargs;
-			if (nargs > 0)
-				argOidVect = proc->proargtypes;
-			planlist = (List) pg_parse_and_plan(pq_src, argOidVect, nargs,
-										   &parseTree_list, None, FALSE);
-			if (IsA(node, Func))
-				set_func_planlist((Func) node, planlist);
-
-		}
-		else
-		{						/* plan has been cached inside the Func
-								 * node already */
-			planlist = get_func_planlist((Func) node);
-		}
-
-		/*
-		 * * Return the sum of the costs of the plans (the PQ function *
-		 * may have many queries in its body).
-		 */
-		foreach(tmpplan, planlist)
-			cost += get_cost((Plan) lfirst(tmpplan));
-		return cost;
-	}
-	else
-	{							/* it's a C function */
-
-		/*
-		 * *  find the cost of evaluating the function's arguments *  and
-		 * the width of the operands
-		 */
-		for (tmpclause = args; tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-		{
-
-			if ((operand = lfirst(tmpclause)) != LispNil)
-			{
-				cost += xfunc_local_expense(operand);
-				width += xfunc_width(operand);
-			}
-		}
-
-		/*
-		 * * when stats become available, add in cost of accessing
-		 * secondary * and tertiary storage here.
-		 */
-		return (cost +
-				(Cost) proc->propercall_cpu +
-		(Cost) proc->properbyte_cpu * (Cost) proc->probyte_pct / 100.00 *
-				(Cost) width
-
-		/*
-		 * Pct_of_obj_in_mem DISK_COST * proc->probyte_pct/100.00 * width
-		 * Pct_of_obj_on_disk + ARCH_COST * proc->probyte_pct/100.00 *
-		 * width Pct_of_obj_on_arch
-		 */
-			);
-	}
-}
-
-/*
- ** xfunc_width
- **    recursively find the width of a expression
- */
-
-int
-xfunc_width(LispValue clause)
-{
-	Relation	rd;				/* Relation Descriptor */
-	HeapTuple	tupl;			/* structure to hold a cached tuple */
-	Form_pg_type type;			/* structure to hold a type tuple */
-	int			retval = 0;
-
-	if (IsA(clause, Const))
-	{
-		/* base case: width is the width of this constant */
-		retval = get_constlen((Const) clause);
-		goto exit;
-	}
-	else if (IsA(clause, ArrayRef))
-	{
-		/* base case: width is width of the refelem within the array */
-		retval = get_refelemlength((ArrayRef) clause);
-		goto exit;
-	}
-	else if (IsA(clause, Var))
-	{
-		/* base case: width is width of this attribute */
-		tupl = SearchSysCacheTuple(TYPEOID,
-							 ObjectIdGetDatum(get_vartype((Var) clause)),
-								   0, 0, 0);
-		if (!HeapTupleIsValid(tupl))
-			elog(ERROR, "Cache lookup failed for type %u",
-				 get_vartype((Var) clause));
-		type = (Form_pg_type) GETSTRUCT(tupl);
-		if (get_varattno((Var) clause) == 0)
-		{
-			/* clause is a tuple.  Get its width */
-			rd = heap_open(type->typrelid);
-			retval = xfunc_tuple_width(rd);
-			heap_close(rd);
-		}
-		else
-		{
-			/* attribute is a base type */
-			retval = type->typlen;
-		}
-		goto exit;
-	}
-	else if (IsA(clause, Param))
-	{
-		if (typeidTypeRelids(get_paramtype((Param) clause)))
-		{
-			/* Param node returns a tuple.	Find its width */
-			rd = heap_open(typeidTypeRelids(get_paramtype((Param) clause)));
-			retval = xfunc_tuple_width(rd);
-			heap_close(rd);
-		}
-		else if (get_param_tlist((Param) clause) != LispNil)
-		{
-			/* Param node projects a complex type */
-			Assert(length(get_param_tlist((Param) clause)) == 1);		/* sanity */
-			retval = xfunc_width((LispValue)
-					  get_expr(lfirst(get_param_tlist((Param) clause))));
-		}
-		else
-		{
-			/* Param node returns a base type */
-			retval = typeLen(typeidType(get_paramtype((Param) clause)));
-		}
-		goto exit;
-	}
-	else if (IsA(clause, Iter))
-	{
-		/*
-		 * * An Iter returns a setof things, so return the width of a
-		 * single * thing. * Note:	THIS MAY NOT WORK RIGHT WHEN AGGS GET
-		 * FIXED, * SINCE AGG FUNCTIONS CHEW ON THE WHOLE SETOF THINGS!!!! *
-		 * This whole Iter business is bogus, anyway.
-		 */
-		retval = xfunc_width(get_iterexpr((Iter) clause));
-		goto exit;
-	}
-	else if (fast_is_clause(clause))
-	{
-		/*
-		 * * get function associated with this Oper, and treat this as * a
-		 * Func
-		 */
-		tupl = SearchSysCacheTuple(OPEROID,
-					   ObjectIdGetDatum(get_opno((Oper) get_op(clause))),
-								   0, 0, 0);
-		if (!HeapTupleIsValid(tupl))
-			elog(ERROR, "Cache lookup failed for procedure %u",
-				 get_opno((Oper) get_op(clause)));
-		return (xfunc_func_width
-		((RegProcedure) (((Form_pg_operator) (GETSTRUCT(tupl)))->oprcode),
-		 (LispValue) get_opargs(clause)));
-	}
-	else if (fast_is_funcclause(clause))
-	{
-		Func		func = (Func) get_function(clause);
-
-		if (get_func_tlist(func) != LispNil)
-		{
-			/*
-			 * this function has a projection on it.  Get the length of
-			 * the projected attribute
-			 */
-			Assert(length(get_func_tlist(func)) == 1);	/* sanity */
-			retval = xfunc_width((LispValue)
-								 get_expr(lfirst(get_func_tlist(func))));
-			goto exit;
-		}
-		else
-		{
-			return (xfunc_func_width((RegProcedure) get_funcid(func),
-									 (LispValue) get_funcargs(clause)));
-		}
-	}
-	else
-	{
-		elog(ERROR, "Clause node of undetermined type");
-		return -1;
-	}
-
-exit:
-	if (retval == -1)
-		retval = VARLEN_DEFAULT;
-	return retval;
-}
-
-/*
- ** xfunc_card_unreferenced:
- **   find all relations not referenced in clause, and multiply their
- ** cardinalities.	Ignore relation of cardinality 0.
- ** User may pass in referenced list, if they know it (useful
- ** for joins).
- */
-static Count
-xfunc_card_unreferenced(Query *queryInfo,
-						LispValue clause, Relids referenced)
-{
-	Relids		unreferenced,
-				allrelids = LispNil;
-	LispValue	temp;
-
-	/* find all relids of base relations referenced in query */
-	foreach(temp, queryInfo->base_rel_list)
-	{
-		Assert(lnext(get_relids((RelOptInfo) lfirst(temp))) == LispNil);
-		allrelids = lappend(allrelids,
-						  lfirst(get_relids((RelOptInfo) lfirst(temp))));
-	}
-
-	/* find all relids referenced in query but not in clause */
-	if (!referenced)
-		referenced = xfunc_find_references(clause);
-	unreferenced = set_difference(allrelids, referenced);
-
-	return xfunc_card_product(unreferenced);
-}
-
-/*
- ** xfunc_card_product
- **   multiple together cardinalities of a list relations.
- */
-Count
-xfunc_card_product(Query *queryInfo, Relids relids)
-{
-	LispValue	cinfonode;
-	LispValue	temp;
-	RelOptInfo	currel;
-	Cost		tuples;
-	Count		retval = 0;
-
-	foreach(temp, relids)
-	{
-		currel = get_rel(lfirst(temp));
-		tuples = get_tuples(currel);
-
-		if (tuples)
-		{						/* not of cardinality 0 */
-			/* factor in the selectivity of all zero-cost clauses */
-			foreach(cinfonode, get_restrictinfo(currel))
-			{
-				if (!xfunc_expense(queryInfo, get_clause((RestrictInfo) lfirst(cinfonode))))
-					tuples *= compute_clause_selec(queryInfo,
-							get_clause((RestrictInfo) lfirst(cinfonode)),
-												   LispNil);
-			}
-
-			if (retval == 0)
-				retval = tuples;
-			else
-				retval *= tuples;
-		}
-	}
-	if (retval == 0)
-		retval = 1;				/* saves caller from dividing by zero */
-	return retval;
-}
-
-
-/*
- ** xfunc_find_references:
- **   Traverse a clause and find all relids referenced in the clause.
- */
-List
-xfunc_find_references(LispValue clause)
-{
-	List		retval = (List) LispNil;
-	LispValue	tmpclause;
-
-	/* Base cases */
-	if (IsA(clause, Var))
-		return lispCons(lfirst(get_varid((Var) clause)), LispNil);
-	else if (IsA(clause, Const) ||IsA(clause, Param))
-		return (List) LispNil;
-
-	/* recursion */
-	else if (IsA(clause, Iter))
-
-		/*
-		 * Too low. Should multiply by the expected number of iterations.
-		 * maybe
-		 */
-		return xfunc_find_references(get_iterexpr((Iter) clause));
-	else if (IsA(clause, ArrayRef))
-		return xfunc_find_references(get_refexpr((ArrayRef) clause));
-	else if (fast_is_clause(clause))
-	{
-		/* string together result of all operands of Oper */
-		for (tmpclause = (LispValue) get_opargs(clause); tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-			retval = nconc(retval, xfunc_find_references(lfirst(tmpclause)));
-		return retval;
-	}
-	else if (fast_is_funcclause(clause))
-	{
-		/* string together result of all args of Func */
-		for (tmpclause = (LispValue) get_funcargs(clause);
-			 tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-			retval = nconc(retval, xfunc_find_references(lfirst(tmpclause)));
-		return retval;
-	}
-	else if (fast_not_clause(clause))
-		return xfunc_find_references(lsecond(clause));
-	else if (fast_or_clause(clause) || fast_and_clause(clause))
-	{
-		/* string together result of all operands of OR */
-		for (tmpclause = lnext(clause); tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-			retval = nconc(retval, xfunc_find_references(lfirst(tmpclause)));
-		return retval;
-	}
-	else
-	{
-		elog(ERROR, "Clause node of undetermined type");
-		return (List) LispNil;
-	}
-}
-
-/*
- ** xfunc_primary_join:
- **   Find the primary join clause: for Hash and Merge Joins, this is the
- ** min rank Hash or Merge clause, while for Nested Loop it's the
- ** min rank pathclause
- */
-LispValue
-xfunc_primary_join(JoinPath pathnode)
-{
-	LispValue	joinclauselist = get_pathrestrictinfo(pathnode);
-	RestrictInfo mincinfo;
-	LispValue	tmplist;
-	LispValue	minclause = LispNil;
-	Cost		minrank,
-				tmprank;
-
-	if (IsA(pathnode, MergePath))
-	{
-		for (tmplist = get_path_mergeclauses((MergePath) pathnode),
-			 minclause = lfirst(tmplist),
-			 minrank = xfunc_rank(minclause);
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-			if ((tmprank = xfunc_rank(lfirst(tmplist)))
-				< minrank)
-			{
-				minrank = tmprank;
-				minclause = lfirst(tmplist);
-			}
-		return minclause;
-	}
-	else if (IsA(pathnode, HashPath))
-	{
-		for (tmplist = get_path_hashclauses((HashPath) pathnode),
-			 minclause = lfirst(tmplist),
-			 minrank = xfunc_rank(minclause);
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-			if ((tmprank = xfunc_rank(lfirst(tmplist)))
-				< minrank)
-			{
-				minrank = tmprank;
-				minclause = lfirst(tmplist);
-			}
-		return minclause;
-	}
-
-	/* if we drop through, it's nested loop join */
-	if (joinclauselist == LispNil)
-		return LispNil;
-
-	for (tmplist = joinclauselist, mincinfo = (RestrictInfo) lfirst(joinclauselist),
-		 minrank = xfunc_rank(get_clause((RestrictInfo) lfirst(tmplist)));
-		 tmplist != LispNil;
-		 tmplist = lnext(tmplist))
-		if ((tmprank = xfunc_rank(get_clause((RestrictInfo) lfirst(tmplist))))
-			< minrank)
-		{
-			minrank = tmprank;
-			mincinfo = (RestrictInfo) lfirst(tmplist);
-		}
-	return (LispValue) get_clause(mincinfo);
-}
-
-/*
- ** xfunc_get_path_cost
- **   get the expensive function costs of the path
- */
-Cost
-xfunc_get_path_cost(Query *queryInfo, Path pathnode)
-{
-	Cost		cost = 0;
-	LispValue	tmplist;
-	Cost		selec = 1.0;
-
-	/*
-	 * * first add in the expensive local function costs. * We ensure that
-	 * the clauses are sorted by rank, so that we * know (via
-	 * selectivities) the number of tuples that will be checked * by each
-	 * function.  If we're not doing any optimization of expensive *
-	 * functions, we don't sort.
-	 */
-	if (XfuncMode != XFUNC_OFF)
-		set_locrestrictinfo(pathnode, lisp_qsort(get_loc_restrictinfo(pathnode),
-												 xfunc_cinfo_compare));
-	for (tmplist = get_loc_restrictinfo(pathnode), selec = 1.0;
-		 tmplist != LispNil;
-		 tmplist = lnext(tmplist))
-	{
-		cost += (Cost) (xfunc_local_expense(get_clause((RestrictInfo) lfirst(tmplist)))
-					  * (Cost) get_tuples(get_parent(pathnode)) * selec);
-		selec *= compute_clause_selec(queryInfo,
-							  get_clause((RestrictInfo) lfirst(tmplist)),
-									  LispNil);
-	}
-
-	/*
-	 * * Now add in any node-specific expensive function costs. * Again,
-	 * we must ensure that the clauses are sorted by rank.
-	 */
-	if (IsA(pathnode, JoinPath))
-	{
-		if (XfuncMode != XFUNC_OFF)
-			set_pathrestrictinfo((JoinPath) pathnode, lisp_qsort
-							  (get_pathrestrictinfo((JoinPath) pathnode),
-							   xfunc_cinfo_compare));
-		for (tmplist = get_pathrestrictinfo((JoinPath) pathnode), selec = 1.0;
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-		{
-			cost += (Cost) (xfunc_local_expense(get_clause((RestrictInfo) lfirst(tmplist)))
-					  * (Cost) get_tuples(get_parent(pathnode)) * selec);
-			selec *= compute_clause_selec(queryInfo,
-							  get_clause((RestrictInfo) lfirst(tmplist)),
-										  LispNil);
-		}
-	}
-	if (IsA(pathnode, HashPath))
-	{
-		if (XfuncMode != XFUNC_OFF)
-			set_path_hashclauses
-				((HashPath) pathnode,
-				 lisp_qsort(get_path_hashclauses((HashPath) pathnode),
-							xfunc_clause_compare));
-		for (tmplist = get_path_hashclauses((HashPath) pathnode), selec = 1.0;
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-		{
-			cost += (Cost) (xfunc_local_expense(lfirst(tmplist))
-					  * (Cost) get_tuples(get_parent(pathnode)) * selec);
-			selec *= compute_clause_selec(queryInfo,
-										  lfirst(tmplist), LispNil);
-		}
-	}
-	if (IsA(pathnode, MergePath))
-	{
-		if (XfuncMode != XFUNC_OFF)
-			set_path_mergeclauses
-				((MergePath) pathnode,
-				 lisp_qsort(get_path_mergeclauses((MergePath) pathnode),
-							xfunc_clause_compare));
-		for (tmplist = get_path_mergeclauses((MergePath) pathnode), selec = 1.0;
-			 tmplist != LispNil;
-			 tmplist = lnext(tmplist))
-		{
-			cost += (Cost) (xfunc_local_expense(lfirst(tmplist))
-					  * (Cost) get_tuples(get_parent(pathnode)) * selec);
-			selec *= compute_clause_selec(queryInfo,
-										  lfirst(tmplist), LispNil);
-		}
-	}
-	Assert(cost >= 0);
-	return cost;
-}
-
-/*
- ** Recalculate the cost of a path node.  This includes the basic cost of the
- ** node, as well as the cost of its expensive functions.
- ** We need to do this to the parent after pulling a clause from a child into a
- ** parent.  Thus we should only be calling this function on JoinPaths.
- */
-Cost
-xfunc_total_path_cost(JoinPath pathnode)
-{
-	Cost		cost = xfunc_get_path_cost((Path) pathnode);
-
-	Assert(IsA(pathnode, JoinPath));
-	if (IsA(pathnode, MergePath))
-	{
-		MergePath	mrgnode = (MergePath) pathnode;
-
-		cost += cost_mergejoin(get_path_cost((Path) get_outerjoinpath(mrgnode)),
-						get_path_cost((Path) get_innerjoinpath(mrgnode)),
-							   get_outersortkeys(mrgnode),
-							   get_innersortkeys(mrgnode),
-						   get_tuples(get_parent((Path) get_outerjoinpath
-												 (mrgnode))),
-						   get_tuples(get_parent((Path) get_innerjoinpath
-												 (mrgnode))),
-							get_width(get_parent((Path) get_outerjoinpath
-												 (mrgnode))),
-							get_width(get_parent((Path) get_innerjoinpath
-												 (mrgnode))));
-		Assert(cost >= 0);
-		return cost;
-	}
-	else if (IsA(pathnode, HashPath))
-	{
-		HashPath hashnode = (HashPath) pathnode;
-
-		cost += cost_hashjoin(get_path_cost((Path) get_outerjoinpath(hashnode)),
-					   get_path_cost((Path) get_innerjoinpath(hashnode)),
-							  get_outerhashkeys(hashnode),
-							  get_innerhashkeys(hashnode),
-						   get_tuples(get_parent((Path) get_outerjoinpath
-												 (hashnode))),
-						   get_tuples(get_parent((Path) get_innerjoinpath
-												 (hashnode))),
-							get_width(get_parent((Path) get_outerjoinpath
-												 (hashnode))),
-							get_width(get_parent((Path) get_innerjoinpath
-												 (hashnode))));
-		Assert(cost >= 0);
-		return cost;
-	}
-	else
-/* Nested Loop Join */
-	{
-		cost += cost_nestloop(get_path_cost((Path) get_outerjoinpath(pathnode)),
-					   get_path_cost((Path) get_innerjoinpath(pathnode)),
-						   get_tuples(get_parent((Path) get_outerjoinpath
-												 (pathnode))),
-						   get_tuples(get_parent((Path) get_innerjoinpath
-												 (pathnode))),
-							get_pages(get_parent((Path) get_outerjoinpath
-												 (pathnode))),
-							IsA(get_innerjoinpath(pathnode), IndexPath));
-		Assert(cost >= 0);
-		return cost;
-	}
-}
-
-
-/*
- ** 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
- **
- ** We treat the l and m terms by considering them to be like restrictions
- ** constrained to be right under the join.  Thus the cost per inner and
- ** cost per outer of the join is different, reflecting these virtual nodes.
- **
- ** The cost per tuple of outer is k + l/referenced(inner).  Cost per tuple
- ** of inner is k + m/referenced(outer).
- ** The constants k, l, m and n depend on the join method.	Measures here are
- ** based on the costs in costsize.c, with fudging for HashJoin and Sorts to
- ** make it fit our model (the 'q' in HashJoin results in a
- ** card(outer)/card(inner) term, and sorting results in a log term.
-
- */
-Cost
-xfunc_expense_per_tuple(JoinPath joinnode, int whichchild)
-{
-	RelOptInfo	outerrel = get_parent((Path) get_outerjoinpath(joinnode));
-	RelOptInfo	innerrel = get_parent((Path) get_innerjoinpath(joinnode));
-	Count		outerwidth = get_width(outerrel);
-	Count		outers_per_page = ceil(BLCKSZ / (outerwidth + MinTupleSize));
-
-	if (IsA(joinnode, HashPath))
-	{
-		if (whichchild == INNER)
-			return (1 + cpu_page_weight) * outers_per_page / NBuffers;
-		else
-			return (((1 + cpu_page_weight) * outers_per_page / NBuffers)
-					+ cpu_page_weight
-					/ xfunc_card_product(get_relids(innerrel)));
-	}
-	else if (IsA(joinnode, MergePath))
-	{
-		/* assumes sort exists, and costs one (I/O + CPU) per tuple */
-		if (whichchild == INNER)
-			return ((2 * cpu_page_weight + 1)
-					/ xfunc_card_product(get_relids(outerrel)));
-		else
-			return ((2 * cpu_page_weight + 1)
-					/ xfunc_card_product(get_relids(innerrel)));
-	}
-	else
-/* nestloop */
-	{
-		Assert(IsA(joinnode, JoinPath));
-		return cpu_page_weight;
-	}
-}
-
-/*
- ** 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
- ** target list of the child's former relation.  If the target list of the
- ** child RelOptInfo does not contain the attribute we need, we add it.
- */
-void
-xfunc_fixvars(LispValue clause, /* clause being pulled up */
-			  RelOptInfo rel,	/* rel it's being pulled from */
-			  int varno)		/* whether rel is INNER or OUTER of join */
-{
-	LispValue	tmpclause;		/* temporary variable */
-	TargetEntry *tle;			/* tlist member corresponding to var */
-
-
-	if (IsA(clause, Const) ||IsA(clause, Param))
-		return;
-	else if (IsA(clause, Var))
-	{
-		/* here's the meat */
-		tle = tlistentry_member((Var) clause, get_targetlist(rel));
-		if (tle == LispNil)
-		{
-			/*
-			 * * The attribute we need is not in the target list, * so we
-			 * have to add it. *
-			 *
-			 */
-			add_var_to_tlist(rel, (Var) clause);
-			tle = tlistentry_member((Var) clause, get_targetlist(rel));
-		}
-		set_varno(((Var) clause), varno);
-		set_varattno(((Var) clause), get_resno(get_resdom(get_entry(tle))));
-	}
-	else if (IsA(clause, Iter))
-		xfunc_fixvars(get_iterexpr((Iter) clause), rel, varno);
-	else if (fast_is_clause(clause))
-	{
-		xfunc_fixvars(lfirst(lnext(clause)), rel, varno);
-		xfunc_fixvars(lfirst(lnext(lnext(clause))), rel, varno);
-	}
-	else if (fast_is_funcclause(clause))
-		for (tmpclause = lnext(clause); tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-			xfunc_fixvars(lfirst(tmpclause), rel, varno);
-	else if (fast_not_clause(clause))
-		xfunc_fixvars(lsecond(clause), rel, varno);
-	else if (fast_or_clause(clause) || fast_and_clause(clause))
-		for (tmpclause = lnext(clause); tmpclause != LispNil;
-			 tmpclause = lnext(tmpclause))
-			xfunc_fixvars(lfirst(tmpclause), rel, varno);
-	else
-		elog(ERROR, "Clause node of undetermined type");
-}
-
-
-/*
- ** Comparison function for lisp_qsort() on a list of RestrictInfo's.
- ** arg1 and arg2 should really be of type (RestrictInfo *).
- */
-int
-xfunc_cinfo_compare(void *arg1, void *arg2)
-{
-	RestrictInfo info1 = *(RestrictInfo *) arg1;
-	RestrictInfo info2 = *(RestrictInfo *) arg2;
-
-	LispValue	clause1 = (LispValue) get_clause(info1),
-				clause2 = (LispValue) get_clause(info2);
-
-	return xfunc_clause_compare((void *) &clause1, (void *) &clause2);
-}
-
-/*
- ** xfunc_clause_compare: comparison function for lisp_qsort() that compares two
- ** clauses based on expense/(1 - selectivity)
- ** arg1 and arg2 are really pointers to clauses.
- */
-int
-xfunc_clause_compare(void *arg1, void *arg2)
-{
-	LispValue	clause1 = *(LispValue *) arg1;
-	LispValue	clause2 = *(LispValue *) arg2;
-	Cost		rank1,			/* total xfunc rank of clause1 */
-				rank2;			/* total xfunc rank of clause2 */
-
-	rank1 = xfunc_rank(clause1);
-	rank2 = xfunc_rank(clause2);
-
-	if (rank1 < rank2)
-		return -1;
-	else if (rank1 == rank2)
-		return 0;
-	else
-		return 1;
-}
-
-/*
- ** 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!
- */
-void
-xfunc_disjunct_sort(LispValue clause_list)
-{
-	LispValue	temp;
-
-	foreach(temp, clause_list)
-		if (or_clause(lfirst(temp)))
-		lnext(lfirst(temp)) = lisp_qsort(lnext(lfirst(temp)), xfunc_disjunct_compare);
-}
-
-
-/*
- ** xfunc_disjunct_compare: comparison function for qsort() that compares two
- ** disjuncts based on cost/selec.
- ** arg1 and arg2 are really pointers to disjuncts
- */
-int
-xfunc_disjunct_compare(Query *queryInfo, void *arg1, void *arg2)
-{
-	LispValue	disjunct1 = *(LispValue *) arg1;
-	LispValue	disjunct2 = *(LispValue *) arg2;
-	Cost		cost1,			/* total cost of disjunct1 */
-				cost2,			/* total cost of disjunct2 */
-				selec1,
-				selec2;
-	Cost		rank1,
-				rank2;
-
-	cost1 = xfunc_expense(queryInfo, disjunct1);
-	cost2 = xfunc_expense(queryInfo, disjunct2);
-	selec1 = compute_clause_selec(queryInfo,
-								  disjunct1, LispNil);
-	selec2 = compute_clause_selec(queryInfo,
-								  disjunct2, LispNil);
-
-	if (selec1 == 0)
-		rank1 = MAXFLOAT;
-	else if (cost1 == 0)
-		rank1 = 0;
-	else
-		rank1 = cost1 / selec1;
-
-	if (selec2 == 0)
-		rank2 = MAXFLOAT;
-	else if (cost2 == 0)
-		rank2 = 0;
-	else
-		rank2 = cost2 / selec2;
-
-	if (rank1 < rank2)
-		return -1;
-	else if (rank1 == rank2)
-		return 0;
-	else
-		return 1;
-}
-
-/* ------------------------ UTILITY FUNCTIONS ------------------------------- */
-/*
- ** xfunc_func_width
- **    Given a function OID and operands, find the width of the return value.
- */
-int
-xfunc_func_width(RegProcedure funcid, LispValue args)
-{
-	Relation	rd;				/* Relation Descriptor */
-	HeapTuple	tupl;			/* structure to hold a cached tuple */
-	Form_pg_proc proc;			/* structure to hold the pg_proc tuple */
-	Form_pg_type type;			/* structure to hold the pg_type tuple */
-	LispValue	tmpclause;
-	int			retval;
-
-	/* lookup function and find its return type */
-	Assert(RegProcedureIsValid(funcid));
-	tupl = SearchSysCacheTuple(PROCOID,
-							   ObjectIdGetDatum(funcid),
-							   0, 0, 0);
-	if (!HeapTupleIsValid(tupl))
-		elog(ERROR, "Cache lookup failed for procedure %u", funcid);
-	proc = (Form_pg_proc) GETSTRUCT(tupl);
-
-	/* if function returns a tuple, get the width of that */
-	if (typeidTypeRelids(proc->prorettype))
-	{
-		rd = heap_open(typeidTypeRelids(proc->prorettype));
-		retval = xfunc_tuple_width(rd);
-		heap_close(rd);
-		goto exit;
-	}
-	else
-/* function returns a base type */
-	{
-		tupl = SearchSysCacheTuple(TYPEOID,
-								   ObjectIdGetDatum(proc->prorettype),
-								   0, 0, 0);
-		if (!HeapTupleIsValid(tupl))
-			elog(ERROR, "Cache lookup failed for type %u", proc->prorettype);
-		type = (Form_pg_type) GETSTRUCT(tupl);
-		/* if the type length is known, return that */
-		if (type->typlen != -1)
-		{
-			retval = type->typlen;
-			goto exit;
-		}
-		else
-/* estimate the return size */
-		{
-			/* find width of the function's arguments */
-			for (tmpclause = args; tmpclause != LispNil;
-				 tmpclause = lnext(tmpclause))
-				retval += xfunc_width(lfirst(tmpclause));
-			/* multiply by outin_ratio */
-			retval = (int) (proc->prooutin_ratio / 100.0 * retval);
-			goto exit;
-		}
-	}
-exit:
-	return retval;
-}
-
-/*
- ** xfunc_tuple_width
- **		Return the sum of the lengths of all the attributes of a given relation
- */
-int
-xfunc_tuple_width(Relation rd)
-{
-	int			i;
-	int			retval = 0;
-	TupleDesc	tdesc = RelationGetDescr(rd);
-
-	for (i = 0; i < tdesc->natts; i++)
-	{
-		if (tdesc->attrs[i]->attlen != -1)
-			retval += tdesc->attrs[i]->attlen;
-		else
-			retval += VARLEN_DEFAULT;
-	}
-
-	return retval;
-}
-
-/*
- ** xfunc_num_join_clauses
- **   Find the number of join clauses associated with this join path
- */
-int
-xfunc_num_join_clauses(JoinPath path)
-{
-	int			num = length(get_pathrestrictinfo(path));
-
-	if (IsA(path, MergePath))
-		return num + length(get_path_mergeclauses((MergePath) path));
-	else if (IsA(path, HashPath))
-		return num + length(get_path_hashclauses((HashPath) path));
-	else
-		return num;
-}
-
-/*
- ** xfunc_LispRemove
- **   Just like LispRemove, but it whines if the item to be removed ain't there
- */
-LispValue
-xfunc_LispRemove(LispValue foo, List bar)
-{
-	LispValue	temp = LispNil;
-	LispValue	result = LispNil;
-	int			sanity = false;
-
-	for (temp = bar; !null(temp); temp = lnext(temp))
-		if (!equal((Node) (foo), (Node) (lfirst(temp))))
-			result = lappend(result, lfirst(temp));
-		else
-			sanity = true;		/* found a matching item to remove! */
-
-	if (!sanity)
-		elog(ERROR, "xfunc_LispRemove: didn't find a match!");
-
-	return result;
-}
-
-#define Node_Copy(a, b, c, d) \
-do { \
-	if (NodeCopy((Node)((a)->d), (Node*)&((b)->d), c) != true) \
-	{ \
-		return false; \
-	} \
-} while(0)
-
-/*
- ** xfunc_copyrel
- **   Just like _copyRel, but doesn't copy the paths
- */
-bool
-xfunc_copyrel(RelOptInfo from, RelOptInfo *to)
-{
-	RelOptInfo	newnode;
-
-	Pointer		(*alloc) () = palloc;
-
-	/* COPY_CHECKARGS() */
-	if (to == NULL)
-		return false;
-
-	/* COPY_CHECKNULL() */
-	if (from == NULL)
-	{
-		(*to) = NULL;
-		return true;
-	}
-
-	/* COPY_NEW(c) */
-	newnode = (RelOptInfo) (*alloc) (classSize(RelOptInfo));
-	if (newnode == NULL)
-		return false;
-
-	/*
-	 * copy node superclass fields
-	 */
-	CopyNodeFields((Node) from, (Node) newnode, alloc);
-
-	/*
-	 * copy remainder of node
-	 */
-	Node_Copy(from, newnode, alloc, relids);
-
-	newnode->indexed = from->indexed;
-	newnode->pages = from->pages;
-	newnode->tuples = from->tuples;
-	newnode->size = from->size;
-	newnode->width = from->width;
-
-	Node_Copy(from, newnode, alloc, targetlist);
-
-	/*
-	 * No!!!!	 Node_Copy(from, newnode, alloc, pathlist);
-	 * Node_Copy(from, newnode, alloc, unorderedpath); Node_Copy(from,
-	 * newnode, alloc, cheapestpath);
-	 */
-#if 0							/* can't use Node_copy now. 2/95 -ay */
-	Node_Copy(from, newnode, alloc, classlist);
-	Node_Copy(from, newnode, alloc, indexkeys);
-	Node_Copy(from, newnode, alloc, ordering);
-#endif
-	Node_Copy(from, newnode, alloc, restrictinfo);
-	Node_Copy(from, newnode, alloc, joininfo);
-	Node_Copy(from, newnode, alloc, innerjoin);
-
-	(*to) = newnode;
-	return true;
-}