diff options
author | CVS to git conversion script <webmaster@postgresql.org> | 2002-06-20 20:29:55 +0000 |
---|---|---|
committer | CVS to git conversion script <webmaster@postgresql.org> | 2002-06-20 20:29:55 +0000 |
commit | 05dedace84ef8c93fea5309c3ac55f889011429b (patch) | |
tree | 4c7f513afbbc03060039a165d1770e11be711773 /src/backend/optimizer/path/indxpath.c | |
parent | d84fe82230c593f3dc5d7f427849b99d1efa8a0a (diff) |
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
Diffstat (limited to 'src/backend/optimizer/path/indxpath.c')
-rw-r--r-- | src/backend/optimizer/path/indxpath.c | 2188 |
1 files changed, 0 insertions, 2188 deletions
diff --git a/src/backend/optimizer/path/indxpath.c b/src/backend/optimizer/path/indxpath.c deleted file mode 100644 index baeed1f34b2..00000000000 --- a/src/backend/optimizer/path/indxpath.c +++ /dev/null @@ -1,2188 +0,0 @@ -/*------------------------------------------------------------------------- - * - * indxpath.c - * Routines to determine which indices are usable for scanning a - * given relation, and create IndexPaths accordingly. - * - * 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/indxpath.c,v 1.119 2002/06/20 20:29:29 momjian Exp $ - * - *------------------------------------------------------------------------- - */ -#include "postgres.h" - -#include <math.h> - -#include "access/heapam.h" -#include "access/nbtree.h" -#include "catalog/catname.h" -#include "catalog/pg_amop.h" -#include "catalog/pg_namespace.h" -#include "catalog/pg_operator.h" -#include "executor/executor.h" -#include "nodes/makefuncs.h" -#include "nodes/nodeFuncs.h" -#include "optimizer/clauses.h" -#include "optimizer/cost.h" -#include "optimizer/pathnode.h" -#include "optimizer/paths.h" -#include "optimizer/restrictinfo.h" -#include "optimizer/var.h" -#include "parser/parse_coerce.h" -#include "parser/parse_expr.h" -#include "parser/parse_oper.h" -#include "utils/builtins.h" -#include "utils/fmgroids.h" -#include "utils/lsyscache.h" -#include "utils/selfuncs.h" -#include "utils/syscache.h" - - -/* - * DoneMatchingIndexKeys() - MACRO - * - * Determine whether we should continue matching index keys in a clause. - * Depends on if there are more to match or if this is a functional index. - * In the latter case we stop after the first match since there can - * be only 1 key (i.e. the function's return value) and the attributes in - * keys list represent the arguments to the function. -mer 3 Oct. 1991 - */ -#define DoneMatchingIndexKeys(indexkeys, index) \ - (indexkeys[0] == 0 || \ - (index->indproc != InvalidOid)) - -#define is_indexable_operator(clause,opclass,indexkey_on_left) \ - (indexable_operator(clause,opclass,indexkey_on_left) != InvalidOid) - - -static void match_index_orclauses(RelOptInfo *rel, IndexOptInfo *index, - List *restrictinfo_list); -static List *match_index_orclause(RelOptInfo *rel, IndexOptInfo *index, - List *or_clauses, - List *other_matching_indices); -static bool match_or_subclause_to_indexkey(RelOptInfo *rel, - IndexOptInfo *index, - Expr *clause); -static List *group_clauses_by_indexkey(RelOptInfo *rel, IndexOptInfo *index, - int *indexkeys, Oid *classes, - List *restrictinfo_list); -static List *group_clauses_by_ikey_for_joins(RelOptInfo *rel, - IndexOptInfo *index, - int *indexkeys, Oid *classes, - List *join_cinfo_list, - List *restr_cinfo_list); -static bool match_clause_to_indexkey(RelOptInfo *rel, IndexOptInfo *index, - int indexkey, Oid opclass, - Expr *clause, bool join); -static bool pred_test(List *predicate_list, List *restrictinfo_list, - List *joininfo_list); -static bool pred_test_restrict_list(Expr *predicate, List *restrictinfo_list); -static bool pred_test_recurse_clause(Expr *predicate, Node *clause); -static bool pred_test_recurse_pred(Expr *predicate, Node *clause); -static bool pred_test_simple_clause(Expr *predicate, Node *clause); -static void indexable_joinclauses(RelOptInfo *rel, IndexOptInfo *index, - List *joininfo_list, List *restrictinfo_list, - List **clausegroups, List **outerrelids); -static List *index_innerjoin(Query *root, RelOptInfo *rel, IndexOptInfo *index, - List *clausegroup_list, List *outerrelids_list); -static bool match_index_to_operand(int indexkey, Var *operand, - RelOptInfo *rel, IndexOptInfo *index); -static bool function_index_operand(Expr *funcOpnd, RelOptInfo *rel, - IndexOptInfo *index); -static bool match_special_index_operator(Expr *clause, Oid opclass, - bool indexkey_on_left); -static List *prefix_quals(Var *leftop, Oid expr_op, - char *prefix, Pattern_Prefix_Status pstatus); -static List *network_prefix_quals(Var *leftop, Oid expr_op, Datum rightop); -static Oid find_operator(const char *opname, Oid datatype); -static Datum string_to_datum(const char *str, Oid datatype); -static Const *string_to_const(const char *str, Oid datatype); - - -/* - * create_index_paths() - * Generate all interesting index paths for the given relation. - * Candidate paths are added to the rel's pathlist (using add_path). - * Additional IndexPath nodes may also be added to rel's innerjoin list. - * - * To be considered for an index scan, an index must match one or more - * restriction clauses or join clauses from the query's qual condition, - * or match the query's ORDER BY condition. - * - * There are two basic kinds of index scans. A "plain" index scan uses - * only restriction clauses (possibly none at all) in its indexqual, - * so it can be applied in any context. An "innerjoin" index scan uses - * join clauses (plus restriction clauses, if available) in its indexqual. - * Therefore it can only be used as the inner relation of a nestloop - * join against an outer rel that includes all the other rels mentioned - * in its join clauses. In that context, values for the other rels' - * attributes are available and fixed during any one scan of the indexpath. - * - * An IndexPath is generated and submitted to add_path() for each index - * this routine deems potentially interesting for the current query. - * An innerjoin path is also generated for each interesting combination of - * outer join relations. The innerjoin paths are *not* passed to add_path(), - * but are appended to the "innerjoin" list of the relation for later - * consideration in nested-loop joins. - * - * 'rel' is the relation for which we want to generate index paths - */ -void -create_index_paths(Query *root, RelOptInfo *rel) -{ - List *restrictinfo_list = rel->baserestrictinfo; - List *joininfo_list = rel->joininfo; - List *ilist; - - foreach(ilist, rel->indexlist) - { - IndexOptInfo *index = (IndexOptInfo *) lfirst(ilist); - List *restrictclauses; - List *index_pathkeys; - List *useful_pathkeys; - bool index_is_ordered; - List *joinclausegroups; - List *joinouterrelids; - - /* - * If this is a partial index, we can only use it if it passes the - * predicate test. - */ - if (index->indpred != NIL) - if (!pred_test(index->indpred, restrictinfo_list, joininfo_list)) - continue; - - /* - * 1. Try matching the index against subclauses of restriction - * 'or' clauses (ie, 'or' clauses that reference only this - * relation). The restrictinfo nodes for the 'or' clauses are - * marked with lists of the matching indices. No paths are - * actually created now; that will be done in orindxpath.c after - * all indexes for the rel have been examined. (We need to do it - * that way because we can potentially use a different index for - * each subclause of an 'or', so we can't build a path for an 'or' - * clause until all indexes have been matched against it.) - * - * We don't even think about special handling of 'or' clauses that - * involve more than one relation (ie, are join clauses). Can we - * do anything useful with those? - */ - match_index_orclauses(rel, index, restrictinfo_list); - - /* - * 2. Match the index against non-'or' restriction clauses. - */ - restrictclauses = group_clauses_by_indexkey(rel, - index, - index->indexkeys, - index->classlist, - restrictinfo_list); - - /* - * 3. Compute pathkeys describing index's ordering, if any, then - * see how many of them are actually useful for this query. - */ - index_pathkeys = build_index_pathkeys(root, rel, index, - ForwardScanDirection); - index_is_ordered = (index_pathkeys != NIL); - useful_pathkeys = truncate_useless_pathkeys(root, rel, - index_pathkeys); - - /* - * 4. Generate an indexscan path if there are relevant restriction - * clauses OR the index ordering is potentially useful for later - * merging or final output ordering. - * - * If there is a predicate, consider it anyway since the index - * predicate has already been found to match the query. The - * selectivity of the predicate might alone make the index useful. - */ - if (restrictclauses != NIL || - useful_pathkeys != NIL || - index->indpred != NIL) - add_path(rel, (Path *) - create_index_path(root, rel, index, - restrictclauses, - useful_pathkeys, - index_is_ordered ? - ForwardScanDirection : - NoMovementScanDirection)); - - /* - * 5. If the index is ordered, a backwards scan might be - * interesting. Currently this is only possible for a DESC query - * result ordering. - */ - if (index_is_ordered) - { - index_pathkeys = build_index_pathkeys(root, rel, index, - BackwardScanDirection); - useful_pathkeys = truncate_useless_pathkeys(root, rel, - index_pathkeys); - if (useful_pathkeys != NIL) - add_path(rel, (Path *) - create_index_path(root, rel, index, - restrictclauses, - useful_pathkeys, - BackwardScanDirection)); - } - - /* - * 6. Create an innerjoin index path for each combination of other - * rels used in available join clauses. These paths will be - * considered as the inner side of nestloop joins against those - * sets of other rels. indexable_joinclauses() finds sets of - * clauses that can be used with each combination of outer rels, - * and index_innerjoin builds the paths themselves. We add the - * paths to the rel's innerjoin list, NOT to the result list. - */ - indexable_joinclauses(rel, index, - joininfo_list, restrictinfo_list, - &joinclausegroups, - &joinouterrelids); - if (joinclausegroups != NIL) - { - rel->innerjoin = nconc(rel->innerjoin, - index_innerjoin(root, rel, index, - joinclausegroups, - joinouterrelids)); - } - } -} - - -/**************************************************************************** - * ---- ROUTINES TO PROCESS 'OR' CLAUSES ---- - ****************************************************************************/ - - -/* - * match_index_orclauses - * Attempt to match an index against subclauses within 'or' clauses. - * Each subclause that does match is marked with the index's node. - * - * Essentially, this adds 'index' to the list of subclause indices in - * the RestrictInfo field of each of the 'or' clauses where it matches. - * NOTE: we can use storage in the RestrictInfo for this purpose because - * this processing is only done on single-relation restriction clauses. - * Therefore, we will never have indexes for more than one relation - * mentioned in the same RestrictInfo node's list. - * - * 'rel' is the node of the relation on which the index is defined. - * 'index' is the index node. - * 'restrictinfo_list' is the list of available restriction clauses. - */ -static void -match_index_orclauses(RelOptInfo *rel, - IndexOptInfo *index, - List *restrictinfo_list) -{ - List *i; - - foreach(i, restrictinfo_list) - { - RestrictInfo *restrictinfo = (RestrictInfo *) lfirst(i); - - if (restriction_is_or_clause(restrictinfo)) - { - /* - * Add this index to the subclause index list for each - * subclause that it matches. - */ - restrictinfo->subclauseindices = - match_index_orclause(rel, index, - restrictinfo->clause->args, - restrictinfo->subclauseindices); - } - } -} - -/* - * match_index_orclause - * Attempts to match an index against the subclauses of an 'or' clause. - * - * A match means that: - * (1) the operator within the subclause can be used with the - * index's specified operator class, and - * (2) one operand of the subclause matches the index key. - * - * If a subclause is an 'and' clause, then it matches if any of its - * subclauses is an opclause that matches. - * - * 'or_clauses' is the list of subclauses within the 'or' clause - * 'other_matching_indices' is the list of information on other indices - * that have already been matched to subclauses within this - * particular 'or' clause (i.e., a list previously generated by - * this routine), or NIL if this routine has not previously been - * run for this 'or' clause. - * - * Returns a list of the form ((a b c) (d e f) nil (g h) ...) where - * a,b,c are nodes of indices that match the first subclause in - * 'or-clauses', d,e,f match the second subclause, no indices - * match the third, g,h match the fourth, etc. - */ -static List * -match_index_orclause(RelOptInfo *rel, - IndexOptInfo *index, - List *or_clauses, - List *other_matching_indices) -{ - List *matching_indices; - List *index_list; - List *clist; - - /* - * first time through, we create list of same length as OR clause, - * containing an empty sublist for each subclause. - */ - if (!other_matching_indices) - { - matching_indices = NIL; - foreach(clist, or_clauses) - matching_indices = lcons(NIL, matching_indices); - } - else - matching_indices = other_matching_indices; - - index_list = matching_indices; - - foreach(clist, or_clauses) - { - Expr *clause = lfirst(clist); - - if (match_or_subclause_to_indexkey(rel, index, clause)) - { - /* OK to add this index to sublist for this subclause */ - lfirst(matching_indices) = lcons(index, - lfirst(matching_indices)); - } - - matching_indices = lnext(matching_indices); - } - - return index_list; -} - -/* - * See if a subclause of an OR clause matches an index. - * - * We accept the subclause if it is an operator clause that matches the - * index, or if it is an AND clause any of whose members is an opclause - * that matches the index. - * - * For multi-key indexes, we only look for matches to the first key; - * without such a match the index is useless. If the clause is an AND - * then we may be able to extract additional subclauses to use with the - * later indexkeys, but we need not worry about that until - * extract_or_indexqual_conditions() is called (if it ever is). - */ -static bool -match_or_subclause_to_indexkey(RelOptInfo *rel, - IndexOptInfo *index, - Expr *clause) -{ - int indexkey = index->indexkeys[0]; - Oid opclass = index->classlist[0]; - - if (and_clause((Node *) clause)) - { - List *item; - - foreach(item, clause->args) - { - if (match_clause_to_indexkey(rel, index, indexkey, opclass, - lfirst(item), false)) - return true; - } - return false; - } - else - return match_clause_to_indexkey(rel, index, indexkey, opclass, - clause, false); -} - -/*---------- - * Given an OR subclause that has previously been determined to match - * the specified index, extract a list of specific opclauses that can be - * used as indexquals. - * - * In the simplest case this just means making a one-element list of the - * given opclause. However, if the OR subclause is an AND, we have to - * scan it to find the opclause(s) that match the index. (There should - * be at least one, if match_or_subclause_to_indexkey succeeded, but there - * could be more.) - * - * Also, we can look at other restriction clauses of the rel to discover - * additional candidate indexquals: for example, consider - * ... where (a = 11 or a = 12) and b = 42; - * If we are dealing with an index on (a,b) then we can include the clause - * b = 42 in the indexqual list generated for each of the OR subclauses. - * Essentially, we are making an index-specific transformation from CNF to - * DNF. (NOTE: when we do this, we end up with a slightly inefficient plan - * because create_indexscan_plan is not very bright about figuring out which - * restriction clauses are implied by the generated indexqual condition. - * Currently we'll end up rechecking both the OR clause and the transferred - * restriction clause as qpquals. FIXME someday.) - * - * Also, we apply expand_indexqual_conditions() to convert any special - * matching opclauses to indexable operators. - * - * The passed-in clause is not changed. - *---------- - */ -List * -extract_or_indexqual_conditions(RelOptInfo *rel, - IndexOptInfo *index, - Expr *orsubclause) -{ - List *quals = NIL; - int *indexkeys = index->indexkeys; - Oid *classes = index->classlist; - - /* - * Extract relevant indexclauses in indexkey order. This is - * essentially just like group_clauses_by_indexkey() except that the - * input and output are lists of bare clauses, not of RestrictInfo - * nodes. - */ - do - { - int curIndxKey = indexkeys[0]; - Oid curClass = classes[0]; - List *clausegroup = NIL; - List *item; - - if (and_clause((Node *) orsubclause)) - { - foreach(item, orsubclause->args) - { - Expr *subsubclause = (Expr *) lfirst(item); - - if (match_clause_to_indexkey(rel, index, - curIndxKey, curClass, - subsubclause, false)) - clausegroup = lappend(clausegroup, subsubclause); - } - } - else if (match_clause_to_indexkey(rel, index, - curIndxKey, curClass, - orsubclause, false)) - clausegroup = makeList1(orsubclause); - - /* - * If we found no clauses for this indexkey in the OR subclause - * itself, try looking in the rel's top-level restriction list. - */ - if (clausegroup == NIL) - { - foreach(item, rel->baserestrictinfo) - { - RestrictInfo *rinfo = (RestrictInfo *) lfirst(item); - - if (match_clause_to_indexkey(rel, index, - curIndxKey, curClass, - rinfo->clause, false)) - clausegroup = lappend(clausegroup, rinfo->clause); - } - } - - /* - * If still no clauses match this key, we're done; we don't want - * to look at keys to its right. - */ - if (clausegroup == NIL) - break; - - quals = nconc(quals, clausegroup); - - indexkeys++; - classes++; - } while (!DoneMatchingIndexKeys(indexkeys, index)); - - if (quals == NIL) - elog(ERROR, "extract_or_indexqual_conditions: no matching clause"); - - return expand_indexqual_conditions(quals); -} - - -/**************************************************************************** - * ---- ROUTINES TO CHECK RESTRICTIONS ---- - ****************************************************************************/ - - -/* - * group_clauses_by_indexkey - * Generates a list of restriction clauses that can be used with an index. - * - * 'rel' is the node of the relation itself. - * 'index' is a index on 'rel'. - * 'indexkeys' are the index keys to be matched. - * 'classes' are the classes of the index operators on those keys. - * 'restrictinfo_list' is the list of available restriction clauses for 'rel'. - * - * Returns a list of all the RestrictInfo nodes for clauses that can be - * used with this index. - * - * The list is ordered by index key. (This is not depended on by any part - * of the planner, as far as I can tell; but some parts of the executor - * do assume that the indxqual list ultimately delivered to the executor - * is so ordered. One such place is _bt_orderkeys() in the btree support. - * Perhaps that ought to be fixed someday --- tgl 7/00) - * - * Note that in a multi-key index, we stop if we find a key that cannot be - * used with any clause. For example, given an index on (A,B,C), we might - * return (C1 C2 C3 C4) if we find that clauses C1 and C2 use column A, - * clauses C3 and C4 use column B, and no clauses use column C. But if - * no clauses match B we will return (C1 C2), whether or not there are - * clauses matching column C, because the executor couldn't use them anyway. - */ -static List * -group_clauses_by_indexkey(RelOptInfo *rel, - IndexOptInfo *index, - int *indexkeys, - Oid *classes, - List *restrictinfo_list) -{ - List *clausegroup_list = NIL; - - if (restrictinfo_list == NIL || indexkeys[0] == 0) - return NIL; - - do - { - int curIndxKey = indexkeys[0]; - Oid curClass = classes[0]; - List *clausegroup = NIL; - List *curCinfo; - - foreach(curCinfo, restrictinfo_list) - { - RestrictInfo *rinfo = (RestrictInfo *) lfirst(curCinfo); - - if (match_clause_to_indexkey(rel, - index, - curIndxKey, - curClass, - rinfo->clause, - false)) - clausegroup = lappend(clausegroup, rinfo); - } - - /* - * If no clauses match this key, we're done; we don't want to look - * at keys to its right. - */ - if (clausegroup == NIL) - break; - - clausegroup_list = nconc(clausegroup_list, clausegroup); - - indexkeys++; - classes++; - - } while (!DoneMatchingIndexKeys(indexkeys, index)); - - /* clausegroup_list holds all matched clauses ordered by indexkeys */ - return clausegroup_list; -} - -/* - * group_clauses_by_ikey_for_joins - * Generates a list of join clauses that can be used with an index - * to scan the inner side of a nestloop join. - * - * This is much like group_clauses_by_indexkey(), but we consider both - * join and restriction clauses. For each indexkey in the index, we - * accept both join and restriction clauses that match it, since both - * will make useful indexquals if the index is being used to scan the - * inner side of a nestloop join. But there must be at least one matching - * join clause, or we return NIL indicating that this index isn't useful - * for nestloop joining. - */ -static List * -group_clauses_by_ikey_for_joins(RelOptInfo *rel, - IndexOptInfo *index, - int *indexkeys, - Oid *classes, - List *join_cinfo_list, - List *restr_cinfo_list) -{ - List *clausegroup_list = NIL; - bool jfound = false; - - if (join_cinfo_list == NIL || indexkeys[0] == 0) - return NIL; - - do - { - int curIndxKey = indexkeys[0]; - Oid curClass = classes[0]; - List *clausegroup = NIL; - List *curCinfo; - - foreach(curCinfo, join_cinfo_list) - { - RestrictInfo *rinfo = (RestrictInfo *) lfirst(curCinfo); - - if (match_clause_to_indexkey(rel, - index, - curIndxKey, - curClass, - rinfo->clause, - true)) - { - clausegroup = lappend(clausegroup, rinfo); - jfound = true; - } - } - foreach(curCinfo, restr_cinfo_list) - { - RestrictInfo *rinfo = (RestrictInfo *) lfirst(curCinfo); - - if (match_clause_to_indexkey(rel, - index, - curIndxKey, - curClass, - rinfo->clause, - false)) - clausegroup = lappend(clausegroup, rinfo); - } - - /* - * If no clauses match this key, we're done; we don't want to look - * at keys to its right. - */ - if (clausegroup == NIL) - break; - - clausegroup_list = nconc(clausegroup_list, clausegroup); - - indexkeys++; - classes++; - - } while (!DoneMatchingIndexKeys(indexkeys, index)); - - /* - * if no join clause was matched then there ain't clauses for joins at - * all. - */ - if (!jfound) - { - freeList(clausegroup_list); - return NIL; - } - - /* clausegroup_list holds all matched clauses ordered by indexkeys */ - return clausegroup_list; -} - - -/* - * match_clause_to_indexkey() - * Determines whether a restriction or join clause matches - * a key of an index. - * - * To match, the clause: - * - * (1a) for a restriction clause: must be in the form (indexkey op const) - * or (const op indexkey), or - * (1b) for a join clause: must be in the form (indexkey op others) - * or (others op indexkey), where others is an expression involving - * only vars of the other relation(s); and - * (2) must contain an operator which is in the same class as the index - * operator for this key, or is a "special" operator as recognized - * by match_special_index_operator(). - * - * Presently, the executor can only deal with indexquals that have the - * indexkey on the left, so we can only use clauses that have the indexkey - * on the right if we can commute the clause to put the key on the left. - * We do not actually do the commuting here, but we check whether a - * suitable commutator operator is available. - * - * Note that in the join case, we already know that the clause as a - * whole uses vars from the interesting set of relations. But we need - * to defend against expressions like (a.f1 OP (b.f2 OP a.f3)); that's - * not processable by an indexscan nestloop join, whereas - * (a.f1 OP (b.f2 OP c.f3)) is. - * - * 'rel' is the relation of interest. - * 'index' is an index on 'rel'. - * 'indexkey' is a key of 'index'. - * 'opclass' is the corresponding operator class. - * 'clause' is the clause to be tested. - * 'join' is true if we are considering this clause for joins. - * - * Returns true if the clause can be used with this index key. - * - * NOTE: returns false if clause is an OR or AND clause; it is the - * responsibility of higher-level routines to cope with those. - */ -static bool -match_clause_to_indexkey(RelOptInfo *rel, - IndexOptInfo *index, - int indexkey, - Oid opclass, - Expr *clause, - bool join) -{ - Var *leftop, - *rightop; - - /* Clause must be a binary opclause. */ - if (!is_opclause((Node *) clause)) - return false; - leftop = get_leftop(clause); - rightop = get_rightop(clause); - if (!leftop || !rightop) - return false; - - if (!join) - { - /* - * Not considering joins, so check for clauses of the form: - * (indexkey operator constant) or (constant operator indexkey). - * Anything that is a "pseudo constant" expression will do. - */ - - if (match_index_to_operand(indexkey, leftop, rel, index) && - is_pseudo_constant_clause((Node *) rightop)) - { - if (is_indexable_operator(clause, opclass, true)) - return true; - - /* - * If we didn't find a member of the index's opclass, see - * whether it is a "special" indexable operator. - */ - if (match_special_index_operator(clause, opclass, true)) - return true; - return false; - } - if (match_index_to_operand(indexkey, rightop, rel, index) && - is_pseudo_constant_clause((Node *) leftop)) - { - if (is_indexable_operator(clause, opclass, false)) - return true; - - /* - * If we didn't find a member of the index's opclass, see - * whether it is a "special" indexable operator. - */ - if (match_special_index_operator(clause, opclass, false)) - return true; - return false; - } - } - else - { - /* - * Check for an indexqual that could be handled by a nestloop - * join. We need the index key to be compared against an - * expression that uses none of the indexed relation's vars and - * contains no volatile functions. - */ - if (match_index_to_operand(indexkey, leftop, rel, index)) - { - List *othervarnos = pull_varnos((Node *) rightop); - bool isIndexable; - - isIndexable = - !intMember(lfirsti(rel->relids), othervarnos) && - !contain_volatile_functions((Node *) rightop) && - is_indexable_operator(clause, opclass, true); - freeList(othervarnos); - return isIndexable; - } - else if (match_index_to_operand(indexkey, rightop, rel, index)) - { - List *othervarnos = pull_varnos((Node *) leftop); - bool isIndexable; - - isIndexable = - !intMember(lfirsti(rel->relids), othervarnos) && - !contain_volatile_functions((Node *) leftop) && - is_indexable_operator(clause, opclass, false); - freeList(othervarnos); - return isIndexable; - } - } - - return false; -} - -/* - * indexable_operator - * Does a binary opclause contain an operator matching the index opclass? - * - * If the indexkey is on the right, what we actually want to know - * is whether the operator has a commutator operator that matches - * the index's opclass. - * - * We try both the straightforward match and matches that rely on - * recognizing binary-compatible datatypes. For example, if we have - * an expression like "oid = 123", the operator will be oideqint4, - * which we need to replace with oideq in order to recognize it as - * matching an oid_ops index on the oid field. A variant case is where - * the expression is like "oid::int4 = 123", where the given operator - * will be int4eq and again we need to intuit that we want to use oideq. - * - * Returns the OID of the matching operator, or InvalidOid if no match. - * Note that the returned OID will be different from the one in the given - * expression if we used a binary-compatible substitution. Also note that - * if indexkey_on_left is FALSE (meaning we need to commute), the returned - * OID is *not* commuted; it can be plugged directly into the given clause. - */ -Oid -indexable_operator(Expr *clause, Oid opclass, bool indexkey_on_left) -{ - Oid expr_op = ((Oper *) clause->oper)->opno; - Oid commuted_op, - new_op; - Operator oldoptup; - Form_pg_operator oldopform; - char *opname; - Oid ltype, - rtype, - indexkeytype; - - /* Get the commuted operator if necessary */ - if (indexkey_on_left) - commuted_op = expr_op; - else - commuted_op = get_commutator(expr_op); - if (commuted_op == InvalidOid) - return InvalidOid; - - /* Done if the (commuted) operator is a member of the index's opclass */ - if (op_in_opclass(commuted_op, opclass)) - return expr_op; - - /* - * Maybe the index uses a binary-compatible operator set. - * - * Get the nominal input types of the given operator and the actual type - * (before binary-compatible relabeling) of the index key. - */ - oldoptup = SearchSysCache(OPEROID, - ObjectIdGetDatum(expr_op), - 0, 0, 0); - if (!HeapTupleIsValid(oldoptup)) - return InvalidOid; /* probably can't happen */ - oldopform = (Form_pg_operator) GETSTRUCT(oldoptup); - opname = pstrdup(NameStr(oldopform->oprname)); - ltype = oldopform->oprleft; - rtype = oldopform->oprright; - ReleaseSysCache(oldoptup); - - if (indexkey_on_left) - { - Node *leftop = (Node *) get_leftop(clause); - - if (leftop && IsA(leftop, RelabelType)) - leftop = ((RelabelType *) leftop)->arg; - indexkeytype = exprType(leftop); - } - else - { - Node *rightop = (Node *) get_rightop(clause); - - if (rightop && IsA(rightop, RelabelType)) - rightop = ((RelabelType *) rightop)->arg; - indexkeytype = exprType(rightop); - } - - /* - * Make sure we have different but binary-compatible types. - */ - if (ltype == indexkeytype && rtype == indexkeytype) - return InvalidOid; /* no chance for a different operator */ - if (!IsBinaryCompatible(ltype, indexkeytype)) - return InvalidOid; - if (!IsBinaryCompatible(rtype, indexkeytype)) - return InvalidOid; - - /* - * OK, look for operator of the same name with the indexkey's data - * type. (In theory this might find a non-semantically-comparable - * operator, but in practice that seems pretty unlikely for - * binary-compatible types.) - */ - new_op = compatible_oper_opid(makeList1(makeString(opname)), - indexkeytype, indexkeytype, true); - - if (OidIsValid(new_op)) - { - if (new_op != expr_op) - { - /* - * OK, we found a binary-compatible operator of the same name; - * now does it match the index? - */ - if (indexkey_on_left) - commuted_op = new_op; - else - commuted_op = get_commutator(new_op); - if (commuted_op == InvalidOid) - return InvalidOid; - - if (op_in_opclass(commuted_op, opclass)) - return new_op; - } - } - - return InvalidOid; -} - -/**************************************************************************** - * ---- ROUTINES TO DO PARTIAL INDEX PREDICATE TESTS ---- - ****************************************************************************/ - -/* - * pred_test - * Does the "predicate inclusion test" for partial indexes. - * - * Recursively checks whether the clauses in restrictinfo_list imply - * that the given predicate is true. - * - * This routine (together with the routines it calls) iterates over - * ANDs in the predicate first, then reduces the qualification - * clauses down to their constituent terms, and iterates over ORs - * in the predicate last. This order is important to make the test - * succeed whenever possible (assuming the predicate has been converted - * to CNF format). --Nels, Jan '93 - */ -static bool -pred_test(List *predicate_list, List *restrictinfo_list, List *joininfo_list) -{ - List *pred; - - /* - * Note: if Postgres tried to optimize queries by forming equivalence - * classes over equi-joined attributes (i.e., if it recognized that a - * qualification such as "where a.b=c.d and a.b=5" could make use of - * an index on c.d), then we could use that equivalence class info - * here with joininfo_list to do more complete tests for the usability - * of a partial index. For now, the test only uses restriction - * clauses (those in restrictinfo_list). --Nels, Dec '92 - * - * XXX as of 7.1, equivalence class info *is* available. Consider - * improving this code as foreseen by Nels. - */ - - if (predicate_list == NIL) - return true; /* no predicate: the index is usable */ - if (restrictinfo_list == NIL) - return false; /* no restriction clauses: the test must - * fail */ - - foreach(pred, predicate_list) - { - /* - * if any clause is not implied, the whole predicate is not - * implied. Note we assume that any sub-ANDs have been flattened - * when the predicate was fed through canonicalize_qual(). - */ - if (!pred_test_restrict_list(lfirst(pred), restrictinfo_list)) - return false; - } - return true; -} - - -/* - * pred_test_restrict_list - * Does the "predicate inclusion test" for one conjunct of a predicate - * expression. - */ -static bool -pred_test_restrict_list(Expr *predicate, List *restrictinfo_list) -{ - List *item; - - foreach(item, restrictinfo_list) - { - RestrictInfo *restrictinfo = (RestrictInfo *) lfirst(item); - - /* if any clause implies the predicate, return true */ - if (pred_test_recurse_clause(predicate, - (Node *) restrictinfo->clause)) - return true; - } - return false; -} - - -/* - * pred_test_recurse_clause - * Does the "predicate inclusion test" for a general restriction-clause - * expression. Here we recursively deal with the possibility that the - * restriction clause is itself an AND or OR structure. - */ -static bool -pred_test_recurse_clause(Expr *predicate, Node *clause) -{ - List *items, - *item; - - Assert(clause != NULL); - if (or_clause(clause)) - { - items = ((Expr *) clause)->args; - foreach(item, items) - { - /* if any OR item doesn't imply the predicate, clause doesn't */ - if (!pred_test_recurse_clause(predicate, lfirst(item))) - return false; - } - return true; - } - else if (and_clause(clause)) - { - items = ((Expr *) clause)->args; - foreach(item, items) - { - /* - * if any AND item implies the predicate, the whole clause - * does - */ - if (pred_test_recurse_clause(predicate, lfirst(item))) - return true; - } - return false; - } - else - return pred_test_recurse_pred(predicate, clause); -} - - -/* - * pred_test_recurse_pred - * Does the "predicate inclusion test" for one conjunct of a predicate - * expression for a simple restriction clause. Here we recursively deal - * with the possibility that the predicate conjunct is itself an AND or - * OR structure. - */ -static bool -pred_test_recurse_pred(Expr *predicate, Node *clause) -{ - List *items, - *item; - - Assert(predicate != NULL); - if (or_clause((Node *) predicate)) - { - items = predicate->args; - foreach(item, items) - { - /* if any item is implied, the whole predicate is implied */ - if (pred_test_recurse_pred(lfirst(item), clause)) - return true; - } - return false; - } - else if (and_clause((Node *) predicate)) - { - items = predicate->args; - foreach(item, items) - { - /* - * if any item is not implied, the whole predicate is not - * implied - */ - if (!pred_test_recurse_pred(lfirst(item), clause)) - return false; - } - return true; - } - else - return pred_test_simple_clause(predicate, clause); -} - - -/* - * Define an "operator implication table" for btree operators ("strategies"). - * The "strategy numbers" are: (1) < (2) <= (3) = (4) >= (5) > - * - * The interpretation of: - * - * test_op = BT_implic_table[given_op-1][target_op-1] - * - * where test_op, given_op and target_op are strategy numbers (from 1 to 5) - * of btree operators, is as follows: - * - * If you know, for some ATTR, that "ATTR given_op CONST1" is true, and you - * want to determine whether "ATTR target_op CONST2" must also be true, then - * you can use "CONST1 test_op CONST2" as a test. If this test returns true, - * then the target expression must be true; if the test returns false, then - * the target expression may be false. - * - * An entry where test_op==0 means the implication cannot be determined, i.e., - * this test should always be considered false. - */ - -static const StrategyNumber - BT_implic_table[BTMaxStrategyNumber][BTMaxStrategyNumber] = { - {2, 2, 0, 0, 0}, - {1, 2, 0, 0, 0}, - {1, 2, 3, 4, 5}, - {0, 0, 0, 4, 5}, - {0, 0, 0, 4, 4} -}; - - -/* - * pred_test_simple_clause - * Does the "predicate inclusion test" for a "simple clause" predicate - * and a "simple clause" restriction. - * - * We have two strategies for determining whether one simple clause - * implies another. A simple and general way is to see if they are - * equal(); this works for any kind of expression. (Actually, there - * is an implied assumption that the functions in the expression are - * immutable, ie dependent only on their input arguments --- but this - * was checked for the predicate by CheckPredicate().) - * - * Our other way works only for (binary boolean) operators that are - * in some btree operator class. We use the above operator implication - * table to be able to derive implications between nonidentical clauses. - * - * Eventually, rtree operators could also be handled by defining an - * appropriate "RT_implic_table" array. - */ -static bool -pred_test_simple_clause(Expr *predicate, Node *clause) -{ - Var *pred_var, - *clause_var; - Const *pred_const, - *clause_const; - Oid pred_op, - clause_op, - test_op; - Oid opclass_id = InvalidOid; - StrategyNumber pred_strategy = 0, - clause_strategy, - test_strategy; - Oper *test_oper; - Expr *test_expr; - Datum test_result; - bool isNull; - Relation relation; - HeapScanDesc scan; - HeapTuple tuple; - ScanKeyData entry[1]; - Form_pg_amop aform; - ExprContext *econtext; - - /* First try the equal() test */ - if (equal((Node *) predicate, clause)) - return true; - - /* - * Can't do anything more unless they are both binary opclauses with a - * Var on the left and a Const on the right. - */ - if (!is_opclause((Node *) predicate)) - return false; - pred_var = (Var *) get_leftop(predicate); - pred_const = (Const *) get_rightop(predicate); - - if (!is_opclause(clause)) - return false; - clause_var = (Var *) get_leftop((Expr *) clause); - clause_const = (Const *) get_rightop((Expr *) clause); - - if (!IsA(clause_var, Var) || - clause_const == NULL || - !IsA(clause_const, Const) || - !IsA(pred_var, Var) || - pred_const == NULL || - !IsA(pred_const, Const)) - return false; - - /* - * The implication can't be determined unless the predicate and the - * clause refer to the same attribute. - */ - if (clause_var->varno != pred_var->varno || - clause_var->varattno != pred_var->varattno) - return false; - - /* Get the operators for the two clauses we're comparing */ - pred_op = ((Oper *) ((Expr *) predicate)->oper)->opno; - clause_op = ((Oper *) ((Expr *) clause)->oper)->opno; - - /* - * 1. Find a "btree" strategy number for the pred_op - * - * The following assumes that any given operator will only be in a single - * btree operator class. This is true at least for all the - * pre-defined operator classes. If it isn't true, then whichever - * operator class happens to be returned first for the given operator - * will be used to find the associated strategy numbers for the test. - * --Nels, Jan '93 - */ - ScanKeyEntryInitialize(&entry[0], 0x0, - Anum_pg_amop_amopopr, - F_OIDEQ, - ObjectIdGetDatum(pred_op)); - - relation = heap_openr(AccessMethodOperatorRelationName, AccessShareLock); - scan = heap_beginscan(relation, SnapshotNow, 1, entry); - - while ((tuple = heap_getnext(scan, ForwardScanDirection)) != NULL) - { - aform = (Form_pg_amop) GETSTRUCT(tuple); - if (opclass_is_btree(aform->amopclaid)) - { - /* Get the predicate operator's btree strategy number (1 to 5) */ - pred_strategy = (StrategyNumber) aform->amopstrategy; - Assert(pred_strategy >= 1 && pred_strategy <= 5); - - /* - * Remember which operator class this strategy number came - * from - */ - opclass_id = aform->amopclaid; - break; - } - } - - heap_endscan(scan); - heap_close(relation, AccessShareLock); - - if (!OidIsValid(opclass_id)) - { - /* predicate operator isn't btree-indexable */ - return false; - } - - /* - * 2. From the same opclass, find a strategy num for the clause_op - */ - tuple = SearchSysCache(AMOPOPID, - ObjectIdGetDatum(opclass_id), - ObjectIdGetDatum(clause_op), - 0, 0); - if (!HeapTupleIsValid(tuple)) - { - /* clause operator isn't btree-indexable, or isn't in this opclass */ - return false; - } - aform = (Form_pg_amop) GETSTRUCT(tuple); - - /* Get the restriction clause operator's strategy number (1 to 5) */ - clause_strategy = (StrategyNumber) aform->amopstrategy; - Assert(clause_strategy >= 1 && clause_strategy <= 5); - - ReleaseSysCache(tuple); - - /* - * 3. Look up the "test" strategy number in the implication table - */ - test_strategy = BT_implic_table[clause_strategy - 1][pred_strategy - 1]; - if (test_strategy == 0) - { - return false; /* the implication cannot be determined */ - } - - /* - * 4. From the same opclass, find the operator for the test strategy - */ - tuple = SearchSysCache(AMOPSTRATEGY, - ObjectIdGetDatum(opclass_id), - Int16GetDatum(test_strategy), - 0, 0); - if (!HeapTupleIsValid(tuple)) - { - /* this probably shouldn't fail? */ - elog(LOG, "pred_test_simple_clause: unknown test_op"); - return false; - } - aform = (Form_pg_amop) GETSTRUCT(tuple); - - /* Get the test operator */ - test_op = aform->amopopr; - - ReleaseSysCache(tuple); - - /* - * 5. Evaluate the test - */ - test_oper = makeOper(test_op, /* opno */ - InvalidOid, /* opid */ - BOOLOID, /* opresulttype */ - false); /* opretset */ - replace_opid(test_oper); - test_expr = make_opclause(test_oper, - (Var *) clause_const, - (Var *) pred_const); - - econtext = MakeExprContext(NULL, TransactionCommandContext); - test_result = ExecEvalExprSwitchContext((Node *) test_expr, econtext, - &isNull, NULL); - FreeExprContext(econtext); - - if (isNull) - { - elog(LOG, "pred_test_simple_clause: null test result"); - return false; - } - return DatumGetBool(test_result); -} - - -/**************************************************************************** - * ---- ROUTINES TO CHECK JOIN CLAUSES ---- - ****************************************************************************/ - -/* - * indexable_joinclauses - * Finds all groups of join clauses from among 'joininfo_list' that can - * be used in conjunction with 'index' for the inner scan of a nestjoin. - * - * Each clause group comes from a single joininfo node plus the current - * rel's restrictinfo list. Therefore, every clause in the group references - * the current rel plus the same set of other rels (except for the restrict - * clauses, which only reference the current rel). Therefore, this set - * of clauses could be used as an indexqual if the relation is scanned - * as the inner side of a nestloop join when the outer side contains - * (at least) all those "other rels". - * - * XXX Actually, given that we are considering a join that requires an - * outer rel set (A,B,C), we should use all qual clauses that reference - * any subset of these rels, not just the full set or none. This is - * doable with a doubly nested loop over joininfo_list; is it worth it? - * - * Returns two parallel lists of the same length: the clause groups, - * and the required outer rel set for each one. - * - * 'rel' is the relation for which 'index' is defined - * 'joininfo_list' is the list of JoinInfo nodes for 'rel' - * 'restrictinfo_list' is the list of restriction clauses for 'rel' - * '*clausegroups' receives a list of clause sublists - * '*outerrelids' receives a list of relid lists - */ -static void -indexable_joinclauses(RelOptInfo *rel, IndexOptInfo *index, - List *joininfo_list, List *restrictinfo_list, - List **clausegroups, List **outerrelids) -{ - List *cg_list = NIL; - List *relid_list = NIL; - List *i; - - foreach(i, joininfo_list) - { - JoinInfo *joininfo = (JoinInfo *) lfirst(i); - List *clausegroup; - - clausegroup = group_clauses_by_ikey_for_joins(rel, - index, - index->indexkeys, - index->classlist, - joininfo->jinfo_restrictinfo, - restrictinfo_list); - - if (clausegroup != NIL) - { - cg_list = lappend(cg_list, clausegroup); - relid_list = lappend(relid_list, joininfo->unjoined_relids); - } - } - - *clausegroups = cg_list; - *outerrelids = relid_list; -} - -/**************************************************************************** - * ---- PATH CREATION UTILITIES ---- - ****************************************************************************/ - -/* - * index_innerjoin - * Creates index path nodes corresponding to paths to be used as inner - * relations in nestloop joins. - * - * 'rel' is the relation for which 'index' is defined - * 'clausegroup_list' is a list of lists of restrictinfo nodes which can use - * 'index'. Each sublist refers to the same set of outer rels. - * 'outerrelids_list' is a list of the required outer rels for each sublist - * of join clauses. - * - * Returns a list of index pathnodes. - */ -static List * -index_innerjoin(Query *root, RelOptInfo *rel, IndexOptInfo *index, - List *clausegroup_list, List *outerrelids_list) -{ - List *path_list = NIL; - List *i; - - foreach(i, clausegroup_list) - { - List *clausegroup = lfirst(i); - IndexPath *pathnode = makeNode(IndexPath); - List *indexquals = NIL; - bool alljoinquals = true; - List *temp; - - /* XXX this code ought to be merged with create_index_path? */ - - pathnode->path.pathtype = T_IndexScan; - pathnode->path.parent = rel; - - /* - * There's no point in marking the path with any pathkeys, since - * it will only ever be used as the inner path of a nestloop, and - * so its ordering does not matter. - */ - pathnode->path.pathkeys = NIL; - - /* extract bare indexqual clauses, check whether all from JOIN/ON */ - foreach(temp, clausegroup) - { - RestrictInfo *clause = (RestrictInfo *) lfirst(temp); - - indexquals = lappend(indexquals, clause->clause); - if (clause->ispusheddown) - alljoinquals = false; - } - - /* expand special operators to indexquals the executor can handle */ - indexquals = expand_indexqual_conditions(indexquals); - - /* - * Note that we are making a pathnode for a single-scan indexscan; - * therefore, both indexinfo and indexqual should be - * single-element lists. - */ - pathnode->indexinfo = makeList1(index); - pathnode->indexqual = makeList1(indexquals); - - /* We don't actually care what order the index scans in ... */ - pathnode->indexscandir = NoMovementScanDirection; - - /* joinrelids saves the rels needed on the outer side of the join */ - pathnode->joinrelids = lfirst(outerrelids_list); - - pathnode->alljoinquals = alljoinquals; - - /* - * We must compute the estimated number of output rows for the - * indexscan. This is less than rel->rows because of the - * additional selectivity of the join clauses. Since clausegroup - * may contain both restriction and join clauses, we have to do a - * set union to get the full set of clauses that must be - * considered to compute the correct selectivity. (We can't just - * nconc the two lists; then we might have some restriction - * clauses appearing twice, which'd mislead - * restrictlist_selectivity into double-counting their - * selectivity.) - */ - pathnode->rows = rel->tuples * - restrictlist_selectivity(root, - set_union(rel->baserestrictinfo, - clausegroup), - lfirsti(rel->relids)); - /* Like costsize.c, force estimate to be at least one row */ - if (pathnode->rows < 1.0) - pathnode->rows = 1.0; - - cost_index(&pathnode->path, root, rel, index, indexquals, true); - - path_list = lappend(path_list, pathnode); - outerrelids_list = lnext(outerrelids_list); - } - return path_list; -} - -/**************************************************************************** - * ---- ROUTINES TO CHECK OPERANDS ---- - ****************************************************************************/ - -/* - * match_index_to_operand() - * Generalized test for a match between an index's key - * and the operand on one side of a restriction or join clause. - * Now check for functional indices as well. - */ -static bool -match_index_to_operand(int indexkey, - Var *operand, - RelOptInfo *rel, - IndexOptInfo *index) -{ - /* - * Ignore any RelabelType node above the indexkey. This is needed to - * be able to apply indexscanning in binary-compatible-operator cases. - * Note: we can assume there is at most one RelabelType node; - * eval_const_expressions() will have simplified if more than one. - */ - if (operand && IsA(operand, RelabelType)) - operand = (Var *) ((RelabelType *) operand)->arg; - - if (index->indproc == InvalidOid) - { - /* - * Simple index. - */ - if (operand && IsA(operand, Var) && - lfirsti(rel->relids) == operand->varno && - indexkey == operand->varattno) - return true; - else - return false; - } - - /* - * Functional index. - */ - return function_index_operand((Expr *) operand, rel, index); -} - -static bool -function_index_operand(Expr *funcOpnd, RelOptInfo *rel, IndexOptInfo *index) -{ - int relvarno = lfirsti(rel->relids); - Func *function; - List *funcargs; - int *indexKeys = index->indexkeys; - List *arg; - int i; - - /* - * sanity check, make sure we know what we're dealing with here. - */ - if (funcOpnd == NULL || !IsA(funcOpnd, Expr) || - funcOpnd->opType != FUNC_EXPR || - funcOpnd->oper == NULL || indexKeys == NULL) - return false; - - function = (Func *) funcOpnd->oper; - funcargs = funcOpnd->args; - - if (function->funcid != index->indproc) - return false; - - /*---------- - * Check that the arguments correspond to the same arguments used to - * create the functional index. To do this we must check that - * 1. they refer to the right relation. - * 2. the args have the right attr. numbers in the right order. - * We must ignore RelabelType nodes above the argument Vars in order - * to recognize binary-compatible-function cases correctly. - *---------- - */ - i = 0; - foreach(arg, funcargs) - { - Var *var = (Var *) lfirst(arg); - - if (var && IsA(var, RelabelType)) - var = (Var *) ((RelabelType *) var)->arg; - if (var == NULL || !IsA(var, Var)) - return false; - if (indexKeys[i] == 0) - return false; - if (var->varno != relvarno || var->varattno != indexKeys[i]) - return false; - - i++; - } - - if (indexKeys[i] != 0) - return false; /* not enough arguments */ - - return true; -} - -/**************************************************************************** - * ---- ROUTINES FOR "SPECIAL" INDEXABLE OPERATORS ---- - ****************************************************************************/ - -/*---------- - * These routines handle special optimization of operators that can be - * used with index scans even though they are not known to the executor's - * indexscan machinery. The key idea is that these operators allow us - * to derive approximate indexscan qual clauses, such that any tuples - * that pass the operator clause itself must also satisfy the simpler - * indexscan condition(s). Then we can use the indexscan machinery - * to avoid scanning as much of the table as we'd otherwise have to, - * while applying the original operator as a qpqual condition to ensure - * we deliver only the tuples we want. (In essence, we're using a regular - * index as if it were a lossy index.) - * - * An example of what we're doing is - * textfield LIKE 'abc%' - * from which we can generate the indexscanable conditions - * textfield >= 'abc' AND textfield < 'abd' - * which allow efficient scanning of an index on textfield. - * (In reality, character set and collation issues make the transformation - * from LIKE to indexscan limits rather harder than one might think ... - * but that's the basic idea.) - * - * Two routines are provided here, match_special_index_operator() and - * expand_indexqual_conditions(). match_special_index_operator() is - * just an auxiliary function for match_clause_to_indexkey(); after - * the latter fails to recognize a restriction opclause's operator - * as a member of an index's opclass, it asks match_special_index_operator() - * whether the clause should be considered an indexqual anyway. - * expand_indexqual_conditions() converts a list of "raw" indexqual - * conditions (with implicit AND semantics across list elements) into - * a list that the executor can actually handle. For operators that - * are members of the index's opclass this transformation is a no-op, - * but operators recognized by match_special_index_operator() must be - * converted into one or more "regular" indexqual conditions. - *---------- - */ - -/* - * match_special_index_operator - * Recognize restriction clauses that can be used to generate - * additional indexscanable qualifications. - * - * The given clause is already known to be a binary opclause having - * the form (indexkey OP pseudoconst) or (pseudoconst OP indexkey), - * but the OP proved not to be one of the index's opclass operators. - * Return 'true' if we can do something with it anyway. - */ -static bool -match_special_index_operator(Expr *clause, Oid opclass, - bool indexkey_on_left) -{ - bool isIndexable = false; - Var *leftop, - *rightop; - Oid expr_op; - Datum constvalue; - char *patt; - char *prefix; - char *rest; - - /* - * Currently, all known special operators require the indexkey on the - * left, but this test could be pushed into the switch statement if - * some are added that do not... - */ - if (!indexkey_on_left) - return false; - - /* we know these will succeed */ - leftop = get_leftop(clause); - rightop = get_rightop(clause); - expr_op = ((Oper *) clause->oper)->opno; - - /* again, required for all current special ops: */ - if (!IsA(rightop, Const) || - ((Const *) rightop)->constisnull) - return false; - constvalue = ((Const *) rightop)->constvalue; - - switch (expr_op) - { - case OID_TEXT_LIKE_OP: - case OID_BPCHAR_LIKE_OP: - case OID_VARCHAR_LIKE_OP: - case OID_NAME_LIKE_OP: - if (locale_is_like_safe()) - { - /* the right-hand const is type text for all of these */ - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - isIndexable = pattern_fixed_prefix(patt, Pattern_Type_Like, - &prefix, &rest) != Pattern_Prefix_None; - if (prefix) - pfree(prefix); - pfree(patt); - } - break; - - case OID_TEXT_ICLIKE_OP: - case OID_BPCHAR_ICLIKE_OP: - case OID_VARCHAR_ICLIKE_OP: - case OID_NAME_ICLIKE_OP: - if (locale_is_like_safe()) - { - /* the right-hand const is type text for all of these */ - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - isIndexable = pattern_fixed_prefix(patt, Pattern_Type_Like_IC, - &prefix, &rest) != Pattern_Prefix_None; - if (prefix) - pfree(prefix); - pfree(patt); - } - break; - - case OID_TEXT_REGEXEQ_OP: - case OID_BPCHAR_REGEXEQ_OP: - case OID_VARCHAR_REGEXEQ_OP: - case OID_NAME_REGEXEQ_OP: - if (locale_is_like_safe()) - { - /* the right-hand const is type text for all of these */ - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - isIndexable = pattern_fixed_prefix(patt, Pattern_Type_Regex, - &prefix, &rest) != Pattern_Prefix_None; - if (prefix) - pfree(prefix); - pfree(patt); - } - break; - - case OID_TEXT_ICREGEXEQ_OP: - case OID_BPCHAR_ICREGEXEQ_OP: - case OID_VARCHAR_ICREGEXEQ_OP: - case OID_NAME_ICREGEXEQ_OP: - if (locale_is_like_safe()) - { - /* the right-hand const is type text for all of these */ - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - isIndexable = pattern_fixed_prefix(patt, Pattern_Type_Regex_IC, - &prefix, &rest) != Pattern_Prefix_None; - if (prefix) - pfree(prefix); - pfree(patt); - } - break; - - case OID_INET_SUB_OP: - case OID_INET_SUBEQ_OP: - case OID_CIDR_SUB_OP: - case OID_CIDR_SUBEQ_OP: - isIndexable = true; - break; - } - - /* done if the expression doesn't look indexable */ - if (!isIndexable) - return false; - - /* - * Must also check that index's opclass supports the operators we will - * want to apply. (A hash index, for example, will not support ">=".) - * We cheat a little by not checking for availability of "=" ... any - * index type should support "=", methinks. - */ - switch (expr_op) - { - case OID_TEXT_LIKE_OP: - case OID_TEXT_ICLIKE_OP: - case OID_TEXT_REGEXEQ_OP: - case OID_TEXT_ICREGEXEQ_OP: - if (!op_in_opclass(find_operator(">=", TEXTOID), opclass) || - !op_in_opclass(find_operator("<", TEXTOID), opclass)) - isIndexable = false; - break; - - case OID_BPCHAR_LIKE_OP: - case OID_BPCHAR_ICLIKE_OP: - case OID_BPCHAR_REGEXEQ_OP: - case OID_BPCHAR_ICREGEXEQ_OP: - if (!op_in_opclass(find_operator(">=", BPCHAROID), opclass) || - !op_in_opclass(find_operator("<", BPCHAROID), opclass)) - isIndexable = false; - break; - - case OID_VARCHAR_LIKE_OP: - case OID_VARCHAR_ICLIKE_OP: - case OID_VARCHAR_REGEXEQ_OP: - case OID_VARCHAR_ICREGEXEQ_OP: - if (!op_in_opclass(find_operator(">=", VARCHAROID), opclass) || - !op_in_opclass(find_operator("<", VARCHAROID), opclass)) - isIndexable = false; - break; - - case OID_NAME_LIKE_OP: - case OID_NAME_ICLIKE_OP: - case OID_NAME_REGEXEQ_OP: - case OID_NAME_ICREGEXEQ_OP: - if (!op_in_opclass(find_operator(">=", NAMEOID), opclass) || - !op_in_opclass(find_operator("<", NAMEOID), opclass)) - isIndexable = false; - break; - - case OID_INET_SUB_OP: - case OID_INET_SUBEQ_OP: - /* for SUB we actually need ">" not ">=", but this should do */ - if (!op_in_opclass(find_operator(">=", INETOID), opclass) || - !op_in_opclass(find_operator("<=", INETOID), opclass)) - isIndexable = false; - break; - - case OID_CIDR_SUB_OP: - case OID_CIDR_SUBEQ_OP: - /* for SUB we actually need ">" not ">=", but this should do */ - if (!op_in_opclass(find_operator(">=", CIDROID), opclass) || - !op_in_opclass(find_operator("<=", CIDROID), opclass)) - isIndexable = false; - break; - } - - return isIndexable; -} - -/* - * expand_indexqual_conditions - * Given a list of (implicitly ANDed) indexqual clauses, - * expand any "special" index operators into clauses that the indexscan - * machinery will know what to do with. Clauses that were not - * recognized by match_special_index_operator() must be passed through - * unchanged. - */ -List * -expand_indexqual_conditions(List *indexquals) -{ - List *resultquals = NIL; - List *q; - - foreach(q, indexquals) - { - Expr *clause = (Expr *) lfirst(q); - - /* we know these will succeed */ - Var *leftop = get_leftop(clause); - Var *rightop = get_rightop(clause); - Oid expr_op = ((Oper *) clause->oper)->opno; - Datum constvalue; - char *patt; - char *prefix; - char *rest; - Pattern_Prefix_Status pstatus; - - switch (expr_op) - { - /* - * LIKE and regex operators are not members of any index - * opclass, so if we find one in an indexqual list we can - * assume that it was accepted by - * match_special_index_operator(). - */ - case OID_TEXT_LIKE_OP: - case OID_BPCHAR_LIKE_OP: - case OID_VARCHAR_LIKE_OP: - case OID_NAME_LIKE_OP: - /* the right-hand const is type text for all of these */ - constvalue = ((Const *) rightop)->constvalue; - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - pstatus = pattern_fixed_prefix(patt, Pattern_Type_Like, - &prefix, &rest); - resultquals = nconc(resultquals, - prefix_quals(leftop, expr_op, - prefix, pstatus)); - if (prefix) - pfree(prefix); - pfree(patt); - break; - - case OID_TEXT_ICLIKE_OP: - case OID_BPCHAR_ICLIKE_OP: - case OID_VARCHAR_ICLIKE_OP: - case OID_NAME_ICLIKE_OP: - /* the right-hand const is type text for all of these */ - constvalue = ((Const *) rightop)->constvalue; - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - pstatus = pattern_fixed_prefix(patt, Pattern_Type_Like_IC, - &prefix, &rest); - resultquals = nconc(resultquals, - prefix_quals(leftop, expr_op, - prefix, pstatus)); - if (prefix) - pfree(prefix); - pfree(patt); - break; - - case OID_TEXT_REGEXEQ_OP: - case OID_BPCHAR_REGEXEQ_OP: - case OID_VARCHAR_REGEXEQ_OP: - case OID_NAME_REGEXEQ_OP: - /* the right-hand const is type text for all of these */ - constvalue = ((Const *) rightop)->constvalue; - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - pstatus = pattern_fixed_prefix(patt, Pattern_Type_Regex, - &prefix, &rest); - resultquals = nconc(resultquals, - prefix_quals(leftop, expr_op, - prefix, pstatus)); - if (prefix) - pfree(prefix); - pfree(patt); - break; - - case OID_TEXT_ICREGEXEQ_OP: - case OID_BPCHAR_ICREGEXEQ_OP: - case OID_VARCHAR_ICREGEXEQ_OP: - case OID_NAME_ICREGEXEQ_OP: - /* the right-hand const is type text for all of these */ - constvalue = ((Const *) rightop)->constvalue; - patt = DatumGetCString(DirectFunctionCall1(textout, - constvalue)); - pstatus = pattern_fixed_prefix(patt, Pattern_Type_Regex_IC, - &prefix, &rest); - resultquals = nconc(resultquals, - prefix_quals(leftop, expr_op, - prefix, pstatus)); - if (prefix) - pfree(prefix); - pfree(patt); - break; - - case OID_INET_SUB_OP: - case OID_INET_SUBEQ_OP: - case OID_CIDR_SUB_OP: - case OID_CIDR_SUBEQ_OP: - constvalue = ((Const *) rightop)->constvalue; - resultquals = nconc(resultquals, - network_prefix_quals(leftop, expr_op, - constvalue)); - break; - - default: - resultquals = lappend(resultquals, clause); - break; - } - } - - return resultquals; -} - -/* - * Given a fixed prefix that all the "leftop" values must have, - * generate suitable indexqual condition(s). expr_op is the original - * LIKE or regex operator; we use it to deduce the appropriate comparison - * operators. - */ -static List * -prefix_quals(Var *leftop, Oid expr_op, - char *prefix, Pattern_Prefix_Status pstatus) -{ - List *result; - Oid datatype; - Oid oproid; - Const *con; - Oper *op; - Expr *expr; - char *greaterstr; - - Assert(pstatus != Pattern_Prefix_None); - - switch (expr_op) - { - case OID_TEXT_LIKE_OP: - case OID_TEXT_ICLIKE_OP: - case OID_TEXT_REGEXEQ_OP: - case OID_TEXT_ICREGEXEQ_OP: - datatype = TEXTOID; - break; - - case OID_BPCHAR_LIKE_OP: - case OID_BPCHAR_ICLIKE_OP: - case OID_BPCHAR_REGEXEQ_OP: - case OID_BPCHAR_ICREGEXEQ_OP: - datatype = BPCHAROID; - break; - - case OID_VARCHAR_LIKE_OP: - case OID_VARCHAR_ICLIKE_OP: - case OID_VARCHAR_REGEXEQ_OP: - case OID_VARCHAR_ICREGEXEQ_OP: - datatype = VARCHAROID; - break; - - case OID_NAME_LIKE_OP: - case OID_NAME_ICLIKE_OP: - case OID_NAME_REGEXEQ_OP: - case OID_NAME_ICREGEXEQ_OP: - datatype = NAMEOID; - break; - - default: - elog(ERROR, "prefix_quals: unexpected operator %u", expr_op); - return NIL; - } - - /* - * If we found an exact-match pattern, generate an "=" indexqual. - */ - if (pstatus == Pattern_Prefix_Exact) - { - oproid = find_operator("=", datatype); - if (oproid == InvalidOid) - elog(ERROR, "prefix_quals: no = operator for type %u", datatype); - con = string_to_const(prefix, datatype); - op = makeOper(oproid, InvalidOid, BOOLOID, false); - expr = make_opclause(op, leftop, (Var *) con); - result = makeList1(expr); - return result; - } - - /* - * Otherwise, we have a nonempty required prefix of the values. - * - * We can always say "x >= prefix". - */ - oproid = find_operator(">=", datatype); - if (oproid == InvalidOid) - elog(ERROR, "prefix_quals: no >= operator for type %u", datatype); - con = string_to_const(prefix, datatype); - op = makeOper(oproid, InvalidOid, BOOLOID, false); - expr = make_opclause(op, leftop, (Var *) con); - result = makeList1(expr); - - /*------- - * If we can create a string larger than the prefix, we can say - * "x < greaterstr". - *------- - */ - greaterstr = make_greater_string(prefix, datatype); - if (greaterstr) - { - oproid = find_operator("<", datatype); - if (oproid == InvalidOid) - elog(ERROR, "prefix_quals: no < operator for type %u", datatype); - con = string_to_const(greaterstr, datatype); - op = makeOper(oproid, InvalidOid, BOOLOID, false); - expr = make_opclause(op, leftop, (Var *) con); - result = lappend(result, expr); - pfree(greaterstr); - } - - return result; -} - -/* - * Given a leftop and a rightop, and a inet-class sup/sub operator, - * generate suitable indexqual condition(s). expr_op is the original - * operator. - */ -static List * -network_prefix_quals(Var *leftop, Oid expr_op, Datum rightop) -{ - bool is_eq; - char *opr1name; - Datum opr1right; - Datum opr2right; - Oid opr1oid; - Oid opr2oid; - List *result; - Oid datatype; - Oper *op; - Expr *expr; - - switch (expr_op) - { - case OID_INET_SUB_OP: - datatype = INETOID; - is_eq = false; - break; - case OID_INET_SUBEQ_OP: - datatype = INETOID; - is_eq = true; - break; - case OID_CIDR_SUB_OP: - datatype = CIDROID; - is_eq = false; - break; - case OID_CIDR_SUBEQ_OP: - datatype = CIDROID; - is_eq = true; - break; - default: - elog(ERROR, "network_prefix_quals: unexpected operator %u", - expr_op); - return NIL; - } - - /* - * create clause "key >= network_scan_first( rightop )", or ">" if the - * operator disallows equality. - */ - - opr1name = is_eq ? ">=" : ">"; - opr1oid = find_operator(opr1name, datatype); - if (opr1oid == InvalidOid) - elog(ERROR, "network_prefix_quals: no %s operator for type %u", - opr1name, datatype); - - opr1right = network_scan_first(rightop); - - op = makeOper(opr1oid, InvalidOid, BOOLOID, false); - expr = make_opclause(op, leftop, - (Var *) makeConst(datatype, -1, opr1right, - false, false, false, false)); - result = makeList1(expr); - - /* create clause "key <= network_scan_last( rightop )" */ - - opr2oid = find_operator("<=", datatype); - if (opr2oid == InvalidOid) - elog(ERROR, "network_prefix_quals: no <= operator for type %u", - datatype); - - opr2right = network_scan_last(rightop); - - op = makeOper(opr2oid, InvalidOid, BOOLOID, false); - expr = make_opclause(op, leftop, - (Var *) makeConst(datatype, -1, opr2right, - false, false, false, false)); - result = lappend(result, expr); - - return result; -} - -/* - * Handy subroutines for match_special_index_operator() and friends. - */ - -/* See if there is a binary op of the given name for the given datatype */ -/* NB: we assume that only built-in system operators are searched for */ -static Oid -find_operator(const char *opname, Oid datatype) -{ - return GetSysCacheOid(OPERNAMENSP, - PointerGetDatum(opname), - ObjectIdGetDatum(datatype), - ObjectIdGetDatum(datatype), - ObjectIdGetDatum(PG_CATALOG_NAMESPACE)); -} - -/* - * Generate a Datum of the appropriate type from a C string. - * Note that all of the supported types are pass-by-ref, so the - * returned value should be pfree'd if no longer needed. - */ -static Datum -string_to_datum(const char *str, Oid datatype) -{ - /* - * We cheat a little by assuming that textin() will do for bpchar and - * varchar constants too... - */ - if (datatype == NAMEOID) - return DirectFunctionCall1(namein, CStringGetDatum(str)); - else - return DirectFunctionCall1(textin, CStringGetDatum(str)); -} - -/* - * Generate a Const node of the appropriate type from a C string. - */ -static Const * -string_to_const(const char *str, Oid datatype) -{ - Datum conval = string_to_datum(str, datatype); - - return makeConst(datatype, ((datatype == NAMEOID) ? NAMEDATALEN : -1), - conval, false, false, false, false); -} |