database/postgres
1
0
Fork 0
mirror of https://github.com/postgres/postgres.git synced 2025-11-10 17:42:29 +03:00
Code Activity

Commit of a *MAJOR* patch from Dan McGuirk <djm@indirect.com>

Browse Source 
Changes:

        * Unique index capability works using the syntax 'create unique
          index'.

        * Duplicate OID's in the system tables are removed.  I put
          little scripts called 'duplicate_oids' and 'find_oid' in
          include/catalog that help to find and remove duplicate OID's.
          I also moved 'unused_oids' from backend/catalog to
          include/catalog, since it has to be in the same directory
          as the include files in order to work.

        * The backend tries converting the name of a function or aggregate
          to all lowercase if the original name given doesn't work (mostly
          for compatibility with ODBC).

        * You can 'SELECT NULL' to your heart's content.

        * I put my _bt_updateitem fix in instead, which uses
          _bt_insertonpg so that even if the new key is so big that
          the page has to be split, everything still works.

        * All literal references to system catalog OID's have been
          replaced with references to define'd constants from the catalog
          header files.

        * I added a couple of node copy functions.  I think this was a
          preliminary attempt to get rules to work.
This commit is contained in:
Marc G. Fournier
1996-11-13 20:56:15 +00:00
parent 0cec8fe26c
commit 07a65b2255
45 changed files with 861 additions and 588 deletions
Download Patch File Download Diff File Expand all files Collapse all files

14
src/backend/access/nbtree/nbtree.c
View File

@@ -8,7 +8,7 @@
*
*
* IDENTIFICATION
* $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtree.c,v 1.9 1996/11/05 10:35:32 scrappy Exp $
* $Header: /cvsroot/pgsql/src/backend/access/nbtree/nbtree.c,v 1.10 1996/11/13 20:47:18 scrappy Exp $
*
* NOTES
* This file contains only the public interface routines.
@@ -74,6 +74,7 @@ btbuild(Relation heap,
Oid hrelid, irelid;
Node *pred, *oldPred;
void *spool;
bool isunique;
/* note that this is a new btree */
BuildingBtree = true;
@@ -81,6 +82,9 @@ btbuild(Relation heap,
pred = predInfo->pred;
oldPred = predInfo->oldPred;
/* see if index is unique */
isunique = IndexIsUniqueNoCache(RelationGetRelationId(index));
/* initialize the btree index metadata page (if this is a new index) */
if (oldPred == NULL)
_bt_metapinit(index);
@@ -218,7 +222,7 @@ btbuild(Relation heap,
if (FastBuild) {
_bt_spool(index, btitem, spool);
} else {
res = _bt_doinsert(index, btitem);
res = _bt_doinsert(index, btitem, isunique, false);
}
pfree(btitem);
@@ -289,7 +293,7 @@ btbuild(Relation heap,
* return an InsertIndexResult to the caller.
*/
InsertIndexResult
btinsert(Relation rel, Datum *datum, char *nulls, ItemPointer ht_ctid)
btinsert(Relation rel, Datum *datum, char *nulls, ItemPointer ht_ctid, bool is_update)
{
BTItem btitem;
IndexTuple itup;
@@ -304,7 +308,9 @@ btinsert(Relation rel, Datum *datum, char *nulls, ItemPointer ht_ctid)
btitem = _bt_formitem(itup);
res = _bt_doinsert(rel, btitem);
res = _bt_doinsert(rel, btitem,
IndexIsUnique(RelationGetRelationId(rel)), is_update);
pfree(btitem);
pfree(itup);