diff options
Diffstat (limited to 'src/backend/access/gist')
| -rw-r--r-- | src/backend/access/gist/Makefile | 30 | ||||
| -rw-r--r-- | src/backend/access/gist/gist.c | 1966 | ||||
| -rw-r--r-- | src/backend/access/gist/gistget.c | 344 | ||||
| -rw-r--r-- | src/backend/access/gist/gistscan.c | 421 | ||||
| -rw-r--r-- | src/backend/access/gist/giststrat.c | 125 |
5 files changed, 0 insertions, 2886 deletions
diff --git a/src/backend/access/gist/Makefile b/src/backend/access/gist/Makefile deleted file mode 100644 index 7f982d0dfd8..00000000000 --- a/src/backend/access/gist/Makefile +++ /dev/null @@ -1,30 +0,0 @@ -#------------------------------------------------------------------------- -# -# Makefile-- -# Makefile for access/gist -# -# IDENTIFICATION -# $Header: /cvsroot/pgsql/src/backend/access/gist/Makefile,v 1.10 2000/08/31 16:09:31 petere Exp $ -# -#------------------------------------------------------------------------- - -subdir = src/backend/access/gist -top_builddir = ../../../.. -include $(top_builddir)/src/Makefile.global - -OBJS = gist.o gistget.o gistscan.o giststrat.o - -all: SUBSYS.o - -SUBSYS.o: $(OBJS) - $(LD) $(LDREL) $(LDOUT) SUBSYS.o $(OBJS) - -depend dep: - $(CC) -MM $(CFLAGS) *.c >depend - -clean: - rm -f SUBSYS.o $(OBJS) - -ifeq (depend,$(wildcard depend)) -include depend -endif diff --git a/src/backend/access/gist/gist.c b/src/backend/access/gist/gist.c deleted file mode 100644 index 2849ca31ecb..00000000000 --- a/src/backend/access/gist/gist.c +++ /dev/null @@ -1,1966 +0,0 @@ -/*------------------------------------------------------------------------- - * - * gist.c - * interface routines for the postgres GiST index access method. - * - * - * 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/access/gist/gist.c,v 1.95 2002/06/20 20:29:24 momjian Exp $ - * - *------------------------------------------------------------------------- - */ -#include "postgres.h" - -#include "access/genam.h" -#include "access/gist.h" -#include "access/gistscan.h" -#include "access/heapam.h" -#include "catalog/index.h" -#include "miscadmin.h" - - -#undef GIST_PAGEADDITEM - -#define ATTSIZE( datum, TupDesc, i, isnull ) \ - ( \ - ( isnull ) ? 0 : \ - att_addlength(0, (TupDesc)->attrs[(i)-1]->attlen, (datum)) \ - ) - -/* result's status */ -#define INSERTED 0x01 -#define SPLITED 0x02 - -/* group flags ( in gistSplit ) */ -#define LEFT_ADDED 0x01 -#define RIGHT_ADDED 0x02 -#define BOTH_ADDED ( LEFT_ADDED | RIGHT_ADDED ) - -/* - * This defines only for shorter code, used in gistgetadjusted - * and gistadjsubkey only - */ -#define FILLITEM(evp, isnullkey, okey, okeyb, rkey, rkeyb) do { \ - if ( isnullkey ) { \ - gistentryinit((evp), rkey, r, (Page) NULL , \ - (OffsetNumber) 0, rkeyb, FALSE); \ - } else { \ - gistentryinit((evp), okey, r, (Page) NULL, \ - (OffsetNumber) 0, okeyb, FALSE); \ - } \ -} while(0) - -#define FILLEV(isnull1, key1, key1b, isnull2, key2, key2b) do { \ - FILLITEM(*ev0p, isnull1, key1, key1b, key2, key2b); \ - FILLITEM(*ev1p, isnull2, key2, key2b, key1, key1b); \ -} while(0); - -/* Working state for gistbuild and its callback */ -typedef struct -{ - GISTSTATE giststate; - int numindexattrs; - double indtuples; -} GISTBuildState; - - -/* non-export function prototypes */ -static void gistbuildCallback(Relation index, - HeapTuple htup, - Datum *attdata, - char *nulls, - bool tupleIsAlive, - void *state); -static void gistdoinsert(Relation r, - IndexTuple itup, - InsertIndexResult *res, - GISTSTATE *GISTstate); -static int gistlayerinsert(Relation r, BlockNumber blkno, - IndexTuple **itup, - int *len, - InsertIndexResult *res, - GISTSTATE *giststate); -static OffsetNumber gistwritebuffer(Relation r, - Page page, - IndexTuple *itup, - int len, - OffsetNumber off); -static int gistnospace(Page page, - IndexTuple *itvec, int len); -static IndexTuple *gistreadbuffer(Buffer buffer, int *len); -static IndexTuple *gistjoinvector( - IndexTuple *itvec, int *len, - IndexTuple *additvec, int addlen); -static IndexTuple gistunion(Relation r, IndexTuple *itvec, - int len, GISTSTATE *giststate); - -static IndexTuple gistgetadjusted(Relation r, - IndexTuple oldtup, - IndexTuple addtup, - GISTSTATE *giststate); -static int gistfindgroup(GISTSTATE *giststate, - GISTENTRY *valvec, GIST_SPLITVEC *spl); -static void gistadjsubkey(Relation r, - IndexTuple *itup, int *len, - GIST_SPLITVEC *v, - GISTSTATE *giststate); -static IndexTuple gistFormTuple(GISTSTATE *giststate, - Relation r, Datum attdata[], int datumsize[], bool isnull[]); -static IndexTuple *gistSplit(Relation r, - Buffer buffer, - IndexTuple *itup, - int *len, - GISTSTATE *giststate, - InsertIndexResult *res); -static void gistnewroot(Relation r, - IndexTuple *itup, int len); -static void GISTInitBuffer(Buffer b, uint32 f); -static OffsetNumber gistchoose(Relation r, Page p, - IndexTuple it, - GISTSTATE *giststate); -static void gistdelete(Relation r, ItemPointer tid); - -#ifdef GIST_PAGEADDITEM -static IndexTuple gist_tuple_replacekey(Relation r, - GISTENTRY entry, IndexTuple t); -#endif -static void gistcentryinit(GISTSTATE *giststate, int nkey, - GISTENTRY *e, Datum k, - Relation r, Page pg, - OffsetNumber o, int b, bool l, bool isNull); -static void gistDeCompressAtt(GISTSTATE *giststate, Relation r, - IndexTuple tuple, Page p, OffsetNumber o, - GISTENTRY attdata[], bool decompvec[], bool isnull[]); -static void gistFreeAtt(Relation r, GISTENTRY attdata[], bool decompvec[]); -static void gistpenalty(GISTSTATE *giststate, int attno, - GISTENTRY *key1, bool isNull1, - GISTENTRY *key2, bool isNull2, - float *penalty); - -#undef GISTDEBUG - -#ifdef GISTDEBUG -static void gist_dumptree(Relation r, int level, BlockNumber blk, OffsetNumber coff); -#endif - -/* - * routine to build an index. Basically calls insert over and over - */ -Datum -gistbuild(PG_FUNCTION_ARGS) -{ - Relation heap = (Relation) PG_GETARG_POINTER(0); - Relation index = (Relation) PG_GETARG_POINTER(1); - IndexInfo *indexInfo = (IndexInfo *) PG_GETARG_POINTER(2); - double reltuples; - GISTBuildState buildstate; - Buffer buffer; - - /* no locking is needed */ - - initGISTstate(&buildstate.giststate, index); - - /* - * We expect to be called exactly once for any index relation. If - * that's not the case, big trouble's what we have. - */ - if (RelationGetNumberOfBlocks(index) != 0) - elog(ERROR, "%s already contains data", - RelationGetRelationName(index)); - - /* initialize the root page */ - buffer = ReadBuffer(index, P_NEW); - GISTInitBuffer(buffer, F_LEAF); - WriteBuffer(buffer); - - /* build the index */ - buildstate.numindexattrs = indexInfo->ii_NumIndexAttrs; - buildstate.indtuples = 0; - - /* do the heap scan */ - reltuples = IndexBuildHeapScan(heap, index, indexInfo, - gistbuildCallback, (void *) &buildstate); - - /* okay, all heap tuples are indexed */ - - /* - * Since we just counted the tuples in the heap, we update its stats - * in pg_class to guarantee that the planner takes advantage of the - * index we just created. But, only update statistics during normal - * index definitions, not for indices on system catalogs created - * during bootstrap processing. We must close the relations before - * updating statistics to guarantee that the relcache entries are - * flushed when we increment the command counter in UpdateStats(). But - * we do not release any locks on the relations; those will be held - * until end of transaction. - */ - if (IsNormalProcessingMode()) - { - Oid hrelid = RelationGetRelid(heap); - Oid irelid = RelationGetRelid(index); - - heap_close(heap, NoLock); - index_close(index); - UpdateStats(hrelid, reltuples); - UpdateStats(irelid, buildstate.indtuples); - } - - freeGISTstate(&buildstate.giststate); -#ifdef GISTDEBUG - gist_dumptree(index, 0, GISTP_ROOT, 0); -#endif - - PG_RETURN_VOID(); -} - -/* - * Per-tuple callback from IndexBuildHeapScan - */ -static void -gistbuildCallback(Relation index, - HeapTuple htup, - Datum *attdata, - char *nulls, - bool tupleIsAlive, - void *state) -{ - GISTBuildState *buildstate = (GISTBuildState *) state; - IndexTuple itup; - bool compvec[INDEX_MAX_KEYS]; - GISTENTRY tmpcentry; - int i; - - /* GiST cannot index tuples with leading NULLs */ - if (nulls[0] == 'n') - return; - - /* immediately compress keys to normalize */ - for (i = 0; i < buildstate->numindexattrs; i++) - { - if (nulls[i] == 'n') - { - attdata[i] = (Datum) 0; - compvec[i] = FALSE; - } - else - { - gistcentryinit(&buildstate->giststate, i, &tmpcentry, attdata[i], - (Relation) NULL, (Page) NULL, (OffsetNumber) 0, - -1 /* size is currently bogus */ , TRUE, FALSE); - if (attdata[i] != tmpcentry.key && - !(isAttByVal(&buildstate->giststate, i))) - compvec[i] = TRUE; - else - compvec[i] = FALSE; - attdata[i] = tmpcentry.key; - } - } - - /* form an index tuple and point it at the heap tuple */ - itup = index_formtuple(buildstate->giststate.tupdesc, attdata, nulls); - itup->t_tid = htup->t_self; - - /* - * Since we already have the index relation locked, we call - * gistdoinsert directly. Normal access method calls dispatch through - * gistinsert, which locks the relation for write. This is the right - * thing to do if you're inserting single tups, but not when you're - * initializing the whole index at once. - */ - gistdoinsert(index, itup, NULL, &buildstate->giststate); - - buildstate->indtuples += 1; - - for (i = 0; i < buildstate->numindexattrs; i++) - if (compvec[i]) - pfree(DatumGetPointer(attdata[i])); - - pfree(itup); -} - -/* - * gistinsert -- wrapper for GiST tuple insertion. - * - * This is the public interface routine for tuple insertion in GiSTs. - * It doesn't do any work; just locks the relation and passes the buck. - */ -Datum -gistinsert(PG_FUNCTION_ARGS) -{ - Relation r = (Relation) PG_GETARG_POINTER(0); - Datum *datum = (Datum *) PG_GETARG_POINTER(1); - char *nulls = (char *) PG_GETARG_POINTER(2); - ItemPointer ht_ctid = (ItemPointer) PG_GETARG_POINTER(3); -#ifdef NOT_USED - Relation heapRel = (Relation) PG_GETARG_POINTER(4); - bool checkUnique = PG_GETARG_BOOL(5); -#endif - InsertIndexResult res; - IndexTuple itup; - GISTSTATE giststate; - GISTENTRY tmpentry; - int i; - bool compvec[INDEX_MAX_KEYS]; - - /* - * Since GIST is not marked "amconcurrent" in pg_am, caller should - * have acquired exclusive lock on index relation. We need no locking - * here. - */ - - /* GiST cannot index tuples with leading NULLs */ - if (nulls[0] == 'n') - { - res = NULL; - PG_RETURN_POINTER(res); - } - - initGISTstate(&giststate, r); - - /* immediately compress keys to normalize */ - for (i = 0; i < r->rd_att->natts; i++) - { - if (nulls[i] == 'n') - { - datum[i] = (Datum) 0; - compvec[i] = FALSE; - } - else - { - gistcentryinit(&giststate, i, &tmpentry, datum[i], - (Relation) NULL, (Page) NULL, (OffsetNumber) 0, - -1 /* size is currently bogus */ , TRUE, FALSE); - if (datum[i] != tmpentry.key && !(isAttByVal(&giststate, i))) - compvec[i] = TRUE; - else - compvec[i] = FALSE; - datum[i] = tmpentry.key; - } - } - itup = index_formtuple(giststate.tupdesc, datum, nulls); - itup->t_tid = *ht_ctid; - - res = (InsertIndexResult) palloc(sizeof(InsertIndexResultData)); - gistdoinsert(r, itup, &res, &giststate); - - for (i = 0; i < r->rd_att->natts; i++) - if (compvec[i] == TRUE) - pfree(DatumGetPointer(datum[i])); - pfree(itup); - freeGISTstate(&giststate); - - PG_RETURN_POINTER(res); -} - -#ifdef GIST_PAGEADDITEM -/* - * Take a compressed entry, and install it on a page. Since we now know - * where the entry will live, we decompress it and recompress it using - * that knowledge (some compression routines may want to fish around - * on the page, for example, or do something special for leaf nodes.) - */ -static OffsetNumber -gistPageAddItem(GISTSTATE *giststate, - Relation r, - Page page, - Item item, - Size size, - OffsetNumber offsetNumber, - ItemIdFlags flags, - GISTENTRY *dentry, - IndexTuple *newtup) -{ - GISTENTRY tmpcentry; - IndexTuple itup = (IndexTuple) item; - OffsetNumber retval; - Datum datum; - bool IsNull; - - /* - * recompress the item given that we now know the exact page and - * offset for insertion - */ - datum = index_getattr(itup, 1, r->rd_att, &IsNull); - gistdentryinit(giststate, 0, dentry, datum, - (Relation) 0, (Page) 0, - (OffsetNumber) InvalidOffsetNumber, - ATTSIZE(datum, r, 1, IsNull), - FALSE, IsNull); - gistcentryinit(giststate, 0, &tmpcentry, dentry->key, r, page, - offsetNumber, dentry->bytes, FALSE); - *newtup = gist_tuple_replacekey(r, tmpcentry, itup); - retval = PageAddItem(page, (Item) *newtup, IndexTupleSize(*newtup), - offsetNumber, flags); - if (retval == InvalidOffsetNumber) - elog(ERROR, "gist: failed to add index item to %s", - RelationGetRelationName(r)); - /* be tidy */ - if (DatumGetPointer(tmpcentry.key) != NULL && - tmpcentry.key != dentry->key && - tmpcentry.key != datum) - pfree(DatumGetPointer(tmpcentry.key)); - return (retval); -} -#endif - -static void -gistdoinsert(Relation r, - IndexTuple itup, - InsertIndexResult *res, - GISTSTATE *giststate) -{ - IndexTuple *instup; - int i, - ret, - len = 1; - - instup = (IndexTuple *) palloc(sizeof(IndexTuple)); - instup[0] = (IndexTuple) palloc(IndexTupleSize(itup)); - memcpy(instup[0], itup, IndexTupleSize(itup)); - - ret = gistlayerinsert(r, GISTP_ROOT, &instup, &len, res, giststate); - if (ret & SPLITED) - gistnewroot(r, instup, len); - - for (i = 0; i < len; i++) - pfree(instup[i]); - pfree(instup); -} - -static int -gistlayerinsert(Relation r, BlockNumber blkno, - IndexTuple **itup, /* in - out, has compressed entry */ - int *len, /* in - out */ - InsertIndexResult *res, /* out */ - GISTSTATE *giststate) -{ - Buffer buffer; - Page page; - OffsetNumber child; - int ret; - GISTPageOpaque opaque; - - buffer = ReadBuffer(r, blkno); - page = (Page) BufferGetPage(buffer); - opaque = (GISTPageOpaque) PageGetSpecialPointer(page); - - if (!(opaque->flags & F_LEAF)) - { - /* internal page, so we must walk on tree */ - /* len IS equal 1 */ - ItemId iid; - BlockNumber nblkno; - ItemPointerData oldtid; - IndexTuple oldtup; - - child = gistchoose(r, page, *(*itup), giststate); - iid = PageGetItemId(page, child); - oldtup = (IndexTuple) PageGetItem(page, iid); - nblkno = ItemPointerGetBlockNumber(&(oldtup->t_tid)); - - /* - * After this call: 1. if child page was splited, then itup - * contains keys for each page 2. if child page wasn't splited, - * then itup contains additional for adjustement of current key - */ - ret = gistlayerinsert(r, nblkno, itup, len, res, giststate); - - /* nothing inserted in child */ - if (!(ret & INSERTED)) - { - ReleaseBuffer(buffer); - return 0x00; - } - - /* child does not splited */ - if (!(ret & SPLITED)) - { - IndexTuple newtup = gistgetadjusted(r, oldtup, (*itup)[0], giststate); - - if (!newtup) - { - /* not need to update key */ - ReleaseBuffer(buffer); - return 0x00; - } - - pfree((*itup)[0]); /* !!! */ - (*itup)[0] = newtup; - } - - /* key is modified, so old version must be deleted */ - ItemPointerSet(&oldtid, blkno, child); - gistdelete(r, &oldtid); - - /* - * if child was splitted, new key for child will be inserted - * in the end list of child, so we must say to any scans - * that page is changed beginning from 'child' offset - */ - if ( ret & SPLITED ) - gistadjscans(r, GISTOP_SPLIT, blkno, child); - } - - ret = INSERTED; - - if (gistnospace(page, (*itup), *len)) - { - /* no space for insertion */ - IndexTuple *itvec, - *newitup; - int tlen, - oldlen; - - ret |= SPLITED; - itvec = gistreadbuffer(buffer, &tlen); - itvec = gistjoinvector(itvec, &tlen, (*itup), *len); - oldlen = *len; - newitup = gistSplit(r, buffer, itvec, &tlen, giststate, - (opaque->flags & F_LEAF) ? res : NULL); /* res only for - * inserting in leaf */ - ReleaseBuffer(buffer); - do - pfree((*itup)[oldlen - 1]); - while ((--oldlen) > 0); - pfree((*itup)); - pfree(itvec); - *itup = newitup; - *len = tlen; /* now tlen >= 2 */ - } - else - { - /* enogth space */ - OffsetNumber off, - l; - - off = (PageIsEmpty(page)) ? - FirstOffsetNumber - : - OffsetNumberNext(PageGetMaxOffsetNumber(page)); - l = gistwritebuffer(r, page, (*itup), *len, off); - WriteBuffer(buffer); - - /* - * set res if insert into leaf page, in this case, len = 1 always - */ - if (res && (opaque->flags & F_LEAF)) - ItemPointerSet(&((*res)->pointerData), blkno, l); - - if (*len > 1) - { /* previos insert ret & SPLITED != 0 */ - int i; - - /* - * child was splited, so we must form union for insertion in - * parent - */ - IndexTuple newtup = gistunion(r, (*itup), *len, giststate); - - ItemPointerSet(&(newtup->t_tid), blkno, 1); - - for (i = 0; i < *len; i++) - pfree((*itup)[i]); - (*itup)[0] = newtup; - *len = 1; - } - } - - return ret; -} - -/* - * Write itup vector to page, has no control of free space - */ -static OffsetNumber -gistwritebuffer(Relation r, Page page, IndexTuple *itup, - int len, OffsetNumber off) -{ - OffsetNumber l = InvalidOffsetNumber; - int i; - -#ifdef GIST_PAGEADDITEM - GISTENTRY tmpdentry; - IndexTuple newtup; - bool IsNull; -#endif - for (i = 0; i < len; i++) - { -#ifdef GIST_PAGEADDITEM - l = gistPageAddItem(giststate, r, page, - (Item) itup[i], IndexTupleSize(itup[i]), - off, LP_USED, &tmpdentry, &newtup); - off = OffsetNumberNext(off); - if (DatumGetPointer(tmpdentry.key) != NULL && - tmpdentry.key != index_getattr(itup[i], 1, r->rd_att, &IsNull)) - pfree(DatumGetPointer(tmpdentry.key)); - if (itup[i] != newtup) - pfree(newtup); -#else - l = PageAddItem(page, (Item) itup[i], IndexTupleSize(itup[i]), - off, LP_USED); - if (l == InvalidOffsetNumber) - elog(ERROR, "gist: failed to add index item to %s", - RelationGetRelationName(r)); -#endif - } - return l; -} - -/* - * Check space for itup vector on page - */ -static int -gistnospace(Page page, IndexTuple *itvec, int len) -{ - unsigned int size = 0; - int i; - - for (i = 0; i < len; i++) - size += IndexTupleSize(itvec[i]) + sizeof(ItemIdData); - - return (PageGetFreeSpace(page) < size); -} - -/* - * Read buffer into itup vector - */ -static IndexTuple * -gistreadbuffer(Buffer buffer, int *len /* out */ ) -{ - OffsetNumber i, - maxoff; - IndexTuple *itvec; - Page p = (Page) BufferGetPage(buffer); - - maxoff = PageGetMaxOffsetNumber(p); - *len = maxoff; - itvec = palloc(sizeof(IndexTuple) * maxoff); - for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i)) - itvec[i - 1] = (IndexTuple) PageGetItem(p, PageGetItemId(p, i)); - - return itvec; -} - -/* - * join two vectors into one - */ -static IndexTuple * -gistjoinvector(IndexTuple *itvec, int *len, IndexTuple *additvec, int addlen) -{ - itvec = (IndexTuple *) repalloc((void *) itvec, sizeof(IndexTuple) * ((*len) + addlen)); - memmove(&itvec[*len], additvec, sizeof(IndexTuple) * addlen); - *len += addlen; - return itvec; -} - -/* - * return union of itup vector - */ -static IndexTuple -gistunion(Relation r, IndexTuple *itvec, int len, GISTSTATE *giststate) -{ - Datum attr[INDEX_MAX_KEYS]; - bool whatfree[INDEX_MAX_KEYS]; - char isnull[INDEX_MAX_KEYS]; - char *storage; - bytea *evec; - Datum datum; - int datumsize, - i, - j; - GISTENTRY centry[INDEX_MAX_KEYS]; - bool *needfree; - IndexTuple newtup; - bool IsNull; - int reallen; - - needfree = (bool *) palloc(((len == 1) ? 2 : len) * sizeof(bool)); - /* workaround for 64-bit: ensure GISTENTRY array is maxaligned */ - storage = (char*)palloc( ((len == 1) ? 2 : len) * sizeof(GISTENTRY) + MAXALIGN(VARHDRSZ)); - evec = (bytea *) (storage + MAXALIGN(VARHDRSZ) - VARHDRSZ); - - for (j = 0; j < r->rd_att->natts; j++) - { - reallen = 0; - for (i = 0; i < len; i++) - { - datum = index_getattr(itvec[i], j + 1, giststate->tupdesc, &IsNull); - if (IsNull) - continue; - - gistdentryinit(giststate, j, - &((GISTENTRY *) VARDATA(evec))[reallen], - datum, - (Relation) NULL, (Page) NULL, (OffsetNumber) NULL, - ATTSIZE(datum, giststate->tupdesc, j + 1, IsNull), FALSE, IsNull); - if ((!isAttByVal(giststate, j)) && - ((GISTENTRY *) VARDATA(evec))[reallen].key != datum) - needfree[reallen] = TRUE; - else - needfree[reallen] = FALSE; - reallen++; - } - - if (reallen == 0) - { - attr[j] = (Datum) 0; - isnull[j] = 'n'; - whatfree[j] = FALSE; - } - else - { - if (reallen == 1) - { - VARATT_SIZEP(evec) = 2 * sizeof(GISTENTRY) + VARHDRSZ; - gistentryinit(((GISTENTRY *) VARDATA(evec))[1], - ((GISTENTRY *) VARDATA(evec))[0].key, r, (Page) NULL, - (OffsetNumber) 0, ((GISTENTRY *) VARDATA(evec))[0].bytes, FALSE); - - } - else - VARATT_SIZEP(evec) = reallen * sizeof(GISTENTRY) + VARHDRSZ; - datum = FunctionCall2(&giststate->unionFn[j], - PointerGetDatum(evec), - PointerGetDatum(&datumsize)); - - for (i = 0; i < reallen; i++) - if (needfree[i]) - pfree(DatumGetPointer(((GISTENTRY *) VARDATA(evec))[i].key)); - - gistcentryinit(giststate, j, ¢ry[j], datum, - (Relation) NULL, (Page) NULL, (OffsetNumber) NULL, - datumsize, FALSE, FALSE); - isnull[j] = ' '; - attr[j] = centry[j].key; - if (!isAttByVal(giststate, j)) - { - whatfree[j] = TRUE; - if (centry[j].key != datum) - pfree(DatumGetPointer(datum)); - } - else - whatfree[j] = FALSE; - } - } - - pfree(storage); /* pfree(evec); */ - pfree(needfree); - - newtup = (IndexTuple) index_formtuple(giststate->tupdesc, attr, isnull); - for (j = 0; j < r->rd_att->natts; j++) - if (whatfree[j]) - pfree(DatumGetPointer(attr[j])); - - return newtup; -} - - -/* - * Forms union of oldtup and addtup, if union == oldtup then return NULL - */ -static IndexTuple -gistgetadjusted(Relation r, IndexTuple oldtup, IndexTuple addtup, GISTSTATE *giststate) -{ - bytea *evec; - Datum datum; - int datumsize; - bool result, - neednew = false; - char isnull[INDEX_MAX_KEYS], - whatfree[INDEX_MAX_KEYS]; - Datum attr[INDEX_MAX_KEYS]; - GISTENTRY centry[INDEX_MAX_KEYS], - oldatt[INDEX_MAX_KEYS], - addatt[INDEX_MAX_KEYS], - *ev0p, - *ev1p; - bool olddec[INDEX_MAX_KEYS], - adddec[INDEX_MAX_KEYS]; - bool oldisnull[INDEX_MAX_KEYS], - addisnull[INDEX_MAX_KEYS]; - IndexTuple newtup = NULL; - char *storage; - int j; - - /* workaround for 64-bit: ensure GISTENTRY array is maxaligned */ - storage = (char*) palloc( 2 * sizeof(GISTENTRY) + MAXALIGN(VARHDRSZ)); - evec = (bytea *) (storage + MAXALIGN(VARHDRSZ) - VARHDRSZ); - VARATT_SIZEP(evec) = 2 * sizeof(GISTENTRY) + VARHDRSZ; - ev0p = &((GISTENTRY *) VARDATA(evec))[0]; - ev1p = &((GISTENTRY *) VARDATA(evec))[1]; - - gistDeCompressAtt(giststate, r, oldtup, (Page) NULL, - (OffsetNumber) 0, oldatt, olddec, oldisnull); - - gistDeCompressAtt(giststate, r, addtup, (Page) NULL, - (OffsetNumber) 0, addatt, adddec, addisnull); - - - for (j = 0; j < r->rd_att->natts; j++) - { - if (oldisnull[j] && addisnull[j]) - { - isnull[j] = 'n'; - attr[j] = (Datum) 0; - whatfree[j] = FALSE; - } - else - { - FILLEV( - oldisnull[j], oldatt[j].key, oldatt[j].bytes, - addisnull[j], addatt[j].key, addatt[j].bytes - ); - - datum = FunctionCall2(&giststate->unionFn[j], - PointerGetDatum(evec), - PointerGetDatum(&datumsize)); - - if (oldisnull[j] || addisnull[j]) - { - if (oldisnull[j]) - neednew = true; - } - else - { - FunctionCall3(&giststate->equalFn[j], - ev0p->key, - datum, - PointerGetDatum(&result)); - - if (!result) - neednew = true; - } - - if (olddec[j]) - pfree(DatumGetPointer(oldatt[j].key)); - if (adddec[j]) - pfree(DatumGetPointer(addatt[j].key)); - - gistcentryinit(giststate, j, ¢ry[j], datum, - (Relation) NULL, (Page) NULL, (OffsetNumber) NULL, - datumsize, FALSE, FALSE); - - isnull[j] = ' '; - attr[j] = centry[j].key; - if ((!isAttByVal(giststate, j))) - { - whatfree[j] = TRUE; - if (centry[j].key != datum) - pfree(DatumGetPointer(datum)); - } - else - whatfree[j] = FALSE; - } - } - pfree(storage); /* pfree(evec); */ - - if (neednew) - { - /* need to update key */ - newtup = (IndexTuple) index_formtuple(giststate->tupdesc, attr, isnull); - newtup->t_tid = oldtup->t_tid; - } - - for (j = 0; j < r->rd_att->natts; j++) - if (whatfree[j]) - pfree(DatumGetPointer(attr[j])); - - return newtup; -} - -static void -gistunionsubkey(Relation r, GISTSTATE *giststate, IndexTuple *itvec, GIST_SPLITVEC *spl) -{ - int i, - j, - lr; - Datum *attr; - bool *needfree, - IsNull; - int len, - *attrsize; - OffsetNumber *entries; - bytea *evec; - char *storage; - Datum datum; - int datumsize; - int reallen; - bool *isnull; - - for (lr = 0; lr <= 1; lr++) - { - if (lr) - { - attrsize = spl->spl_lattrsize; - attr = spl->spl_lattr; - len = spl->spl_nleft; - entries = spl->spl_left; - isnull = spl->spl_lisnull; - } - else - { - attrsize = spl->spl_rattrsize; - attr = spl->spl_rattr; - len = spl->spl_nright; - entries = spl->spl_right; - isnull = spl->spl_risnull; - } - - needfree = (bool *) palloc(((len == 1) ? 2 : len) * sizeof(bool)); - /* workaround for 64-bit: ensure GISTENTRY array is maxaligned */ - storage = (char*)palloc( ((len == 1) ? 2 : len) * sizeof(GISTENTRY) + MAXALIGN(VARHDRSZ)); - evec = (bytea *) (storage + MAXALIGN(VARHDRSZ) - VARHDRSZ); - - for (j = 1; j < r->rd_att->natts; j++) - { - reallen = 0; - for (i = 0; i < len; i++) - { - if (spl->spl_idgrp[entries[i]]) - continue; - datum = index_getattr(itvec[entries[i] - 1], j + 1, - giststate->tupdesc, &IsNull); - if (IsNull) - continue; - gistdentryinit(giststate, j, - &((GISTENTRY *) VARDATA(evec))[reallen], - datum, - (Relation) NULL, (Page) NULL, - (OffsetNumber) NULL, - ATTSIZE(datum, giststate->tupdesc, j + 1, IsNull), FALSE, IsNull); - if ((!isAttByVal(giststate, j)) && - ((GISTENTRY *) VARDATA(evec))[reallen].key != datum) - needfree[reallen] = TRUE; - else - needfree[reallen] = FALSE; - reallen++; - - } - if (reallen == 0) - { - datum = (Datum) 0; - datumsize = 0; - isnull[j] = true; - } - else - { - /* - * ((GISTENTRY *) VARDATA(evec))[0].bytes may be not - * defined, so form union with itself - */ - if (reallen == 1) - { - VARATT_SIZEP(evec) = 2 * sizeof(GISTENTRY) + VARHDRSZ; - memcpy((void *) &((GISTENTRY *) VARDATA(evec))[1], - (void *) &((GISTENTRY *) VARDATA(evec))[0], - sizeof(GISTENTRY)); - } - else - VARATT_SIZEP(evec) = reallen * sizeof(GISTENTRY) + VARHDRSZ; - datum = FunctionCall2(&giststate->unionFn[j], - PointerGetDatum(evec), - PointerGetDatum(&datumsize)); - isnull[j] = false; - } - - for (i = 0; i < reallen; i++) - if (needfree[i]) - pfree(DatumGetPointer(((GISTENTRY *) VARDATA(evec))[i].key)); - - attr[j] = datum; - attrsize[j] = datumsize; - } - pfree(storage); /* pfree(evec); */ - pfree(needfree); - } -} - -/* - * find group in vector with equial value - */ -static int -gistfindgroup(GISTSTATE *giststate, GISTENTRY *valvec, GIST_SPLITVEC *spl) -{ - int i, - j, - len; - int curid = 1; - bool result; - - /* - * first key is always not null (see gistinsert), so we may not check - * for nulls - */ - - for (i = 0; i < spl->spl_nleft; i++) - { - if (spl->spl_idgrp[spl->spl_left[i]]) - continue; - len = 0; - /* find all equal value in right part */ - for (j = 0; j < spl->spl_nright; j++) - { - if (spl->spl_idgrp[spl->spl_right[j]]) - continue; - FunctionCall3(&giststate->equalFn[0], - valvec[spl->spl_left[i]].key, - valvec[spl->spl_right[j]].key, - PointerGetDatum(&result)); - if (result) - { - spl->spl_idgrp[spl->spl_right[j]] = curid; - len++; - } - } - /* find all other equal value in left part */ - if (len) - { - /* add current val to list of equial values */ - spl->spl_idgrp[spl->spl_left[i]] = curid; - /* searching .. */ - for (j = i + 1; j < spl->spl_nleft; j++) - { - if (spl->spl_idgrp[spl->spl_left[j]]) - continue; - FunctionCall3(&giststate->equalFn[0], - valvec[spl->spl_left[i]].key, - valvec[spl->spl_left[j]].key, - PointerGetDatum(&result)); - if (result) - { - spl->spl_idgrp[spl->spl_left[j]] = curid; - len++; - } - } - spl->spl_ngrp[curid] = len + 1; - curid++; - } - } - - return curid; -} - -/* - * Insert equivalent tuples to left or right page - * with minimize penalty - */ -static void -gistadjsubkey(Relation r, - IndexTuple *itup, /* contains compressed entry */ - int *len, - GIST_SPLITVEC *v, - GISTSTATE *giststate -) -{ - int curlen; - OffsetNumber *curwpos; - bool decfree[INDEX_MAX_KEYS]; - GISTENTRY entry, - identry[INDEX_MAX_KEYS], - *ev0p, - *ev1p; - float lpenalty, - rpenalty; - bytea *evec; - char *storage; - int datumsize; - bool isnull[INDEX_MAX_KEYS]; - int i, - j; - Datum datum; - - /* clear vectors */ - curlen = v->spl_nleft; - curwpos = v->spl_left; - for (i = 0; i < v->spl_nleft; i++) - if (v->spl_idgrp[v->spl_left[i]] == 0) - { - *curwpos = v->spl_left[i]; - curwpos++; - } - else - curlen--; - v->spl_nleft = curlen; - - curlen = v->spl_nright; - curwpos = v->spl_right; - for (i = 0; i < v->spl_nright; i++) - if (v->spl_idgrp[v->spl_right[i]] == 0) - { - *curwpos = v->spl_right[i]; - curwpos++; - } - else - curlen--; - v->spl_nright = curlen; - - /* workaround for 64-bit: ensure GISTENTRY array is maxaligned */ - storage = (char*)palloc( 2 * sizeof(GISTENTRY) + MAXALIGN(VARHDRSZ)); - evec = (bytea *) (storage + MAXALIGN(VARHDRSZ) - VARHDRSZ); - VARATT_SIZEP(evec) = 2 * sizeof(GISTENTRY) + VARHDRSZ; - ev0p = &((GISTENTRY *) VARDATA(evec))[0]; - ev1p = &((GISTENTRY *) VARDATA(evec))[1]; - - /* add equivalent tuple */ - for (i = 0; i < *len; i++) - { - if (v->spl_idgrp[i + 1] == 0) /* already inserted */ - continue; - gistDeCompressAtt(giststate, r, itup[i], (Page) NULL, (OffsetNumber) 0, - identry, decfree, isnull); - - v->spl_ngrp[v->spl_idgrp[i + 1]]--; - if (v->spl_ngrp[v->spl_idgrp[i + 1]] == 0 && - (v->spl_grpflag[v->spl_idgrp[i + 1]] & BOTH_ADDED) != BOTH_ADDED) - { - - /* force last in group */ - rpenalty = 1.0; - lpenalty = (v->spl_grpflag[v->spl_idgrp[i + 1]] & LEFT_ADDED) ? 2.0 : 0.0; - } - else - { - /* where? */ - for (j = 1; j < r->rd_att->natts; j++) - { - gistentryinit(entry, v->spl_lattr[j], r, (Page) NULL, - (OffsetNumber) 0, v->spl_lattrsize[j], FALSE); - gistpenalty(giststate, j, &entry, v->spl_lisnull[j], - &identry[j], isnull[j], &lpenalty); - - gistentryinit(entry, v->spl_rattr[j], r, (Page) NULL, - (OffsetNumber) 0, v->spl_rattrsize[j], FALSE); - gistpenalty(giststate, j, &entry, v->spl_risnull[j], - &identry[j], isnull[j], &rpenalty); - - if (lpenalty != rpenalty) - break; - } - } - /* add */ - if (lpenalty < rpenalty) - { - v->spl_grpflag[v->spl_idgrp[i + 1]] |= LEFT_ADDED; - v->spl_left[v->spl_nleft] = i + 1; - v->spl_nleft++; - for (j = 1; j < r->rd_att->natts; j++) - { - if (isnull[j] && v->spl_lisnull[j]) - { - v->spl_lattr[j] = (Datum) 0; - v->spl_lattrsize[j] = 0; - } - else - { - FILLEV( - v->spl_lisnull[j], v->spl_lattr[j], v->spl_lattrsize[j], - isnull[j], identry[j].key, identry[j].bytes - ); - - datum = FunctionCall2(&giststate->unionFn[j], - PointerGetDatum(evec), - PointerGetDatum(&datumsize)); - - if ((!isAttByVal(giststate, j)) && !v->spl_lisnull[j]) - pfree(DatumGetPointer(v->spl_lattr[j])); - v->spl_lattr[j] = datum; - v->spl_lattrsize[j] = datumsize; - v->spl_lisnull[j] = false; - } - } - } - else - { - v->spl_grpflag[v->spl_idgrp[i + 1]] |= RIGHT_ADDED; - v->spl_right[v->spl_nright] = i + 1; - v->spl_nright++; - for (j = 1; j < r->rd_att->natts; j++) - { - if (isnull[j] && v->spl_risnull[j]) - { - v->spl_rattr[j] = (Datum) 0; - v->spl_rattrsize[j] = 0; - } - else - { - FILLEV( - v->spl_risnull[j], v->spl_rattr[j], v->spl_rattrsize[j], - isnull[j], identry[j].key, identry[j].bytes - ); - - datum = FunctionCall2(&giststate->unionFn[j], - PointerGetDatum(evec), - PointerGetDatum(&datumsize)); - - if ((!isAttByVal(giststate, j)) && !v->spl_risnull[j]) - pfree(DatumGetPointer(v->spl_rattr[j])); - - v->spl_rattr[j] = datum; - v->spl_rattrsize[j] = datumsize; - v->spl_risnull[j] = false; - } - } - - } - gistFreeAtt(r, identry, decfree); - } - pfree(storage); /* pfree(evec); */ -} - -/* - * gistSplit -- split a page in the tree. - */ -static IndexTuple * -gistSplit(Relation r, - Buffer buffer, - IndexTuple *itup, /* contains compressed entry */ - int *len, - GISTSTATE *giststate, - InsertIndexResult *res) -{ - Page p; - Buffer leftbuf, - rightbuf; - Page left, - right; - IndexTuple *lvectup, - *rvectup, - *newtup; - BlockNumber lbknum, - rbknum; - GISTPageOpaque opaque; - GIST_SPLITVEC v; - bytea *entryvec; - char *storage; - bool *decompvec; - int i, - j, - nlen; - int MaxGrpId = 1; - Datum datum; - bool IsNull; - - p = (Page) BufferGetPage(buffer); - opaque = (GISTPageOpaque) PageGetSpecialPointer(p); - - /* - * The root of the tree is the first block in the relation. If we're - * about to split the root, we need to do some hocus-pocus to enforce - * this guarantee. - */ - - if (BufferGetBlockNumber(buffer) == GISTP_ROOT) - { - leftbuf = ReadBuffer(r, P_NEW); - GISTInitBuffer(leftbuf, opaque->flags); - lbknum = BufferGetBlockNumber(leftbuf); - left = (Page) BufferGetPage(leftbuf); - } - else - { - leftbuf = buffer; - IncrBufferRefCount(buffer); - lbknum = BufferGetBlockNumber(buffer); - left = (Page) PageGetTempPage(p, sizeof(GISTPageOpaqueData)); - } - - rightbuf = ReadBuffer(r, P_NEW); - GISTInitBuffer(rightbuf, opaque->flags); - rbknum = BufferGetBlockNumber(rightbuf); - right = (Page) BufferGetPage(rightbuf); - - /* generate the item array */ - /* workaround for 64-bit: ensure GISTENTRY array is maxaligned */ - storage = palloc(MAXALIGN(VARHDRSZ) + (*len + 1) * sizeof(GISTENTRY)); - entryvec = (bytea *) (storage + MAXALIGN(VARHDRSZ) - VARHDRSZ); - decompvec = (bool *) palloc( (*len + 1) * sizeof(bool)); - VARATT_SIZEP(entryvec) = (*len + 1) * sizeof(GISTENTRY) + VARHDRSZ; - for (i = 1; i <= *len; i++) - { - datum = index_getattr(itup[i - 1], 1, giststate->tupdesc, &IsNull); - gistdentryinit(giststate, 0, &((GISTENTRY *) VARDATA(entryvec))[i], - datum, r, p, i, - ATTSIZE(datum, giststate->tupdesc, 1, IsNull), FALSE, IsNull); - if ((!isAttByVal(giststate, 0)) && ((GISTENTRY *) VARDATA(entryvec))[i].key != datum) - decompvec[i] = TRUE; - else - decompvec[i] = FALSE; - } - - /* - * now let the user-defined picksplit function set up the split - * vector; in entryvec have no null value!! - */ - FunctionCall2(&giststate->picksplitFn[0], - PointerGetDatum(entryvec), - PointerGetDatum(&v)); - - /* compatibility with old code */ - if (v.spl_left[v.spl_nleft - 1] == InvalidOffsetNumber) - v.spl_left[v.spl_nleft - 1] = (OffsetNumber) *len; - if (v.spl_right[v.spl_nright - 1] == InvalidOffsetNumber) - v.spl_right[v.spl_nright - 1] = (OffsetNumber) *len; - - v.spl_lattr[0] = v.spl_ldatum; - v.spl_rattr[0] = v.spl_rdatum; - v.spl_lisnull[0] = false; - v.spl_risnull[0] = false; - - /* - * if index is multikey, then we must to try get smaller bounding box - * for subkey(s) - */ - if (r->rd_att->natts > 1) - { - v.spl_idgrp = (int *) palloc(sizeof(int) * (*len + 1)); - MemSet((void *) v.spl_idgrp, 0, sizeof(int) * (*len + 1)); - v.spl_grpflag = (char *) palloc(sizeof(char) * (*len + 1)); - MemSet((void *) v.spl_grpflag, 0, sizeof(char) * (*len + 1)); - v.spl_ngrp = (int *) palloc(sizeof(int) * (*len + 1)); - - MaxGrpId = gistfindgroup(giststate, (GISTENTRY *) VARDATA(entryvec), &v); - - /* form union of sub keys for each page (l,p) */ - gistunionsubkey(r, giststate, itup, &v); - - /* - * if possible, we insert equivalent tuples with control by - * penalty for a subkey(s) - */ - if (MaxGrpId > 1) - gistadjsubkey(r, itup, len, &v, giststate); - - pfree(v.spl_idgrp); - pfree(v.spl_grpflag); - pfree(v.spl_ngrp); - } - - /* clean up the entry vector: its keys need to be deleted, too */ - for (i = 1; i <= *len; i++) - if (decompvec[i]) - pfree(DatumGetPointer(((GISTENTRY *) VARDATA(entryvec))[i].key)); - pfree(storage); /* pfree(entryvec); */ - pfree(decompvec); - - /* form left and right vector */ - lvectup = (IndexTuple *) palloc(sizeof(IndexTuple) * v.spl_nleft); - rvectup = (IndexTuple *) palloc(sizeof(IndexTuple) * v.spl_nright); - - for (i = 0; i < v.spl_nleft; i++) - lvectup[i] = itup[v.spl_left[i] - 1]; - - for (i = 0; i < v.spl_nright; i++) - rvectup[i] = itup[v.spl_right[i] - 1]; - - - /* write on disk (may be need another split) */ - if (gistnospace(right, rvectup, v.spl_nright)) - { - nlen = v.spl_nright; - newtup = gistSplit(r, rightbuf, rvectup, &nlen, giststate, - (res && rvectup[nlen - 1] == itup[*len - 1]) ? res : NULL); - ReleaseBuffer(rightbuf); - for (j = 1; j < r->rd_att->natts; j++) - if ((!isAttByVal(giststate, j)) && !v.spl_risnull[j]) - pfree(DatumGetPointer(v.spl_rattr[j])); - } - else - { - OffsetNumber l; - - l = gistwritebuffer(r, right, rvectup, v.spl_nright, FirstOffsetNumber); - WriteBuffer(rightbuf); - - if (res) - ItemPointerSet(&((*res)->pointerData), rbknum, l); - - nlen = 1; - newtup = (IndexTuple *) palloc(sizeof(IndexTuple) * 1); - newtup[0] = gistFormTuple(giststate, r, v.spl_rattr, v.spl_rattrsize, v.spl_risnull); - ItemPointerSet(&(newtup[0]->t_tid), rbknum, 1); - } - - - if (gistnospace(left, lvectup, v.spl_nleft)) - { - int llen = v.spl_nleft; - IndexTuple *lntup; - - lntup = gistSplit(r, leftbuf, lvectup, &llen, giststate, - (res && lvectup[llen - 1] == itup[*len - 1]) ? res : NULL); - ReleaseBuffer(leftbuf); - - for (j = 1; j < r->rd_att->natts; j++) - if ((!isAttByVal(giststate, j)) && !v.spl_lisnull[j]) - pfree(DatumGetPointer(v.spl_lattr[j])); - - newtup = gistjoinvector(newtup, &nlen, lntup, llen); - pfree(lntup); - } - else - { - OffsetNumber l; - - l = gistwritebuffer(r, left, lvectup, v.spl_nleft, FirstOffsetNumber); - if (BufferGetBlockNumber(buffer) != GISTP_ROOT) - PageRestoreTempPage(left, p); - - WriteBuffer(leftbuf); - - if (res) - ItemPointerSet(&((*res)->pointerData), lbknum, l); - - nlen += 1; - newtup = (IndexTuple *) repalloc((void *) newtup, sizeof(IndexTuple) * nlen); - newtup[nlen - 1] = gistFormTuple(giststate, r, v.spl_lattr, v.spl_lattrsize, v.spl_lisnull); - ItemPointerSet(&(newtup[nlen - 1]->t_tid), lbknum, 1); - } - - /* !!! pfree */ - pfree(rvectup); - pfree(lvectup); - pfree(v.spl_left); - pfree(v.spl_right); - - *len = nlen; - return newtup; -} - -static void -gistnewroot(Relation r, IndexTuple *itup, int len) -{ - Buffer b; - Page p; - - b = ReadBuffer(r, GISTP_ROOT); - GISTInitBuffer(b, 0); - p = BufferGetPage(b); - - gistwritebuffer(r, p, itup, len, FirstOffsetNumber); - WriteBuffer(b); -} - -static void -GISTInitBuffer(Buffer b, uint32 f) -{ - GISTPageOpaque opaque; - Page page; - Size pageSize; - - pageSize = BufferGetPageSize(b); - - page = BufferGetPage(b); - - PageInit(page, pageSize, sizeof(GISTPageOpaqueData)); - - opaque = (GISTPageOpaque) PageGetSpecialPointer(page); - opaque->flags = f; -} - - -/* -** find entry with lowest penalty -*/ -static OffsetNumber -gistchoose(Relation r, Page p, IndexTuple it, /* it has compressed entry */ - GISTSTATE *giststate) -{ - OffsetNumber maxoff; - OffsetNumber i; - Datum datum; - float usize; - OffsetNumber which; - float sum_grow, - which_grow[INDEX_MAX_KEYS]; - GISTENTRY entry, - identry[INDEX_MAX_KEYS]; - bool IsNull, - decompvec[INDEX_MAX_KEYS], - isnull[INDEX_MAX_KEYS]; - int j; - - maxoff = PageGetMaxOffsetNumber(p); - *which_grow = -1.0; - which = -1; - sum_grow = 1; - gistDeCompressAtt(giststate, r, - it, (Page) NULL, (OffsetNumber) 0, - identry, decompvec, isnull); - - for (i = FirstOffsetNumber; i <= maxoff && sum_grow; i = OffsetNumberNext(i)) - { - IndexTuple itup = (IndexTuple) PageGetItem(p, PageGetItemId(p, i)); - - sum_grow = 0; - for (j = 0; j < r->rd_att->natts; j++) - { - datum = index_getattr(itup, j + 1, giststate->tupdesc, &IsNull); - gistdentryinit(giststate, j, &entry, datum, r, p, i, ATTSIZE(datum, giststate->tupdesc, j + 1, IsNull), FALSE, IsNull); - gistpenalty(giststate, j, &entry, IsNull, &identry[j], isnull[j], &usize); - - if ((!isAttByVal(giststate, j)) && entry.key != datum) - pfree(DatumGetPointer(entry.key)); - - if (which_grow[j] < 0 || usize < which_grow[j]) - { - which = i; - which_grow[j] = usize; - if (j < r->rd_att->natts - 1 && i == FirstOffsetNumber) - which_grow[j + 1] = -1; - sum_grow += which_grow[j]; - } - else if (which_grow[j] == usize) - sum_grow += usize; - else - { - sum_grow = 1; - break; - } - } - } - - gistFreeAtt(r, identry, decompvec); - return which; -} - -void -gistfreestack(GISTSTACK *s) -{ - GISTSTACK *p; - - while (s != (GISTSTACK *) NULL) - { - p = s->gs_parent; - pfree(s); - s = p; - } -} - - -/* - * Retail deletion of a single tuple. - * - * NB: this is no longer called externally, but is still needed by - * gistlayerinsert(). That dependency will have to be fixed if GIST - * is ever going to allow concurrent insertions. - */ -static void -gistdelete(Relation r, ItemPointer tid) -{ - BlockNumber blkno; - OffsetNumber offnum; - Buffer buf; - Page page; - - /* - * Since GIST is not marked "amconcurrent" in pg_am, caller should - * have acquired exclusive lock on index relation. We need no locking - * here. - */ - - blkno = ItemPointerGetBlockNumber(tid); - offnum = ItemPointerGetOffsetNumber(tid); - - /* adjust any scans that will be affected by this deletion */ - /* NB: this works only for scans in *this* backend! */ - gistadjscans(r, GISTOP_DEL, blkno, offnum); - - /* delete the index tuple */ - buf = ReadBuffer(r, blkno); - page = BufferGetPage(buf); - - PageIndexTupleDelete(page, offnum); - - WriteBuffer(buf); -} - -/* - * Bulk deletion of all index entries pointing to a set of heap tuples. - * The set of target tuples is specified via a callback routine that tells - * whether any given heap tuple (identified by ItemPointer) is being deleted. - * - * Result: a palloc'd struct containing statistical info for VACUUM displays. - */ -Datum -gistbulkdelete(PG_FUNCTION_ARGS) -{ - Relation rel = (Relation) PG_GETARG_POINTER(0); - IndexBulkDeleteCallback callback = (IndexBulkDeleteCallback) PG_GETARG_POINTER(1); - void *callback_state = (void *) PG_GETARG_POINTER(2); - IndexBulkDeleteResult *result; - BlockNumber num_pages; - double tuples_removed; - double num_index_tuples; - IndexScanDesc iscan; - - tuples_removed = 0; - num_index_tuples = 0; - - /* - * Since GIST is not marked "amconcurrent" in pg_am, caller should - * have acquired exclusive lock on index relation. We need no locking - * here. - */ - - /* - * XXX generic implementation --- should be improved! - */ - - /* walk through the entire index */ - iscan = index_beginscan(NULL, rel, SnapshotAny, 0, (ScanKey) NULL); - /* including killed tuples */ - iscan->ignore_killed_tuples = false; - - while (index_getnext_indexitem(iscan, ForwardScanDirection)) - { - if (callback(&iscan->xs_ctup.t_self, callback_state)) - { - ItemPointerData indextup = iscan->currentItemData; - BlockNumber blkno; - OffsetNumber offnum; - Buffer buf; - Page page; - - blkno = ItemPointerGetBlockNumber(&indextup); - offnum = ItemPointerGetOffsetNumber(&indextup); - - /* adjust any scans that will be affected by this deletion */ - gistadjscans(rel, GISTOP_DEL, blkno, offnum); - - /* delete the index tuple */ - buf = ReadBuffer(rel, blkno); - page = BufferGetPage(buf); - - PageIndexTupleDelete(page, offnum); - - WriteBuffer(buf); - - tuples_removed += 1; - } - else - num_index_tuples += 1; - } - - index_endscan(iscan); - - /* return statistics */ - num_pages = RelationGetNumberOfBlocks(rel); - - result = (IndexBulkDeleteResult *) palloc(sizeof(IndexBulkDeleteResult)); - result->num_pages = num_pages; - result->tuples_removed = tuples_removed; - result->num_index_tuples = num_index_tuples; - - PG_RETURN_POINTER(result); -} - - -void -initGISTstate(GISTSTATE *giststate, Relation index) -{ - int i; - - if (index->rd_att->natts > INDEX_MAX_KEYS) - elog(ERROR, "initGISTstate: numberOfAttributes %d > %d", - index->rd_att->natts, INDEX_MAX_KEYS); - - giststate->tupdesc = index->rd_att; - - for (i = 0; i < index->rd_att->natts; i++) - { - fmgr_info_copy(&(giststate->consistentFn[i]), - index_getprocinfo(index, i + 1, GIST_CONSISTENT_PROC), - CurrentMemoryContext); - fmgr_info_copy(&(giststate->unionFn[i]), - index_getprocinfo(index, i + 1, GIST_UNION_PROC), - CurrentMemoryContext); - fmgr_info_copy(&(giststate->compressFn[i]), - index_getprocinfo(index, i + 1, GIST_COMPRESS_PROC), - CurrentMemoryContext); - fmgr_info_copy(&(giststate->decompressFn[i]), - index_getprocinfo(index, i + 1, GIST_DECOMPRESS_PROC), - CurrentMemoryContext); - fmgr_info_copy(&(giststate->penaltyFn[i]), - index_getprocinfo(index, i + 1, GIST_PENALTY_PROC), - CurrentMemoryContext); - fmgr_info_copy(&(giststate->picksplitFn[i]), - index_getprocinfo(index, i + 1, GIST_PICKSPLIT_PROC), - CurrentMemoryContext); - fmgr_info_copy(&(giststate->equalFn[i]), - index_getprocinfo(index, i + 1, GIST_EQUAL_PROC), - CurrentMemoryContext); - } -} - -void -freeGISTstate(GISTSTATE *giststate) -{ - /* no work */ -} - -#ifdef GIST_PAGEADDITEM -/* -** Given an IndexTuple to be inserted on a page, this routine replaces -** the key with another key, which may involve generating a new IndexTuple -** if the sizes don't match or if the null status changes. -** -** XXX this only works for a single-column index tuple! -*/ -static IndexTuple -gist_tuple_replacekey(Relation r, GISTENTRY entry, IndexTuple t) -{ - bool IsNull; - Datum datum = index_getattr(t, 1, r->rd_att, &IsNull); - - /* - * If new entry fits in index tuple, copy it in. To avoid worrying - * about null-value bitmask, pass it off to the general - * index_formtuple routine if either the previous or new value is - * NULL. - */ - if (!IsNull && DatumGetPointer(entry.key) != NULL && - (Size) entry.bytes <= ATTSIZE(datum, r, 1, IsNull)) - { - memcpy(DatumGetPointer(datum), - DatumGetPointer(entry.key), - entry.bytes); - /* clear out old size */ - t->t_info &= ~INDEX_SIZE_MASK; - /* or in new size */ - t->t_info |= MAXALIGN(entry.bytes + sizeof(IndexTupleData)); - - return t; - } - else - { - /* generate a new index tuple for the compressed entry */ - TupleDesc tupDesc = r->rd_att; - IndexTuple newtup; - char isnull; - - isnull = DatumGetPointer(entry.key) != NULL ? ' ' : 'n'; - newtup = (IndexTuple) index_formtuple(tupDesc, - &(entry.key), - &isnull); - newtup->t_tid = t->t_tid; - return newtup; - } -} -#endif - -/* -** initialize a GiST entry with a decompressed version of key -*/ -void -gistdentryinit(GISTSTATE *giststate, int nkey, GISTENTRY *e, - Datum k, Relation r, Page pg, OffsetNumber o, - int b, bool l, bool isNull) -{ - if (b && !isNull) - { - GISTENTRY *dep; - - gistentryinit(*e, k, r, pg, o, b, l); - dep = (GISTENTRY *) - DatumGetPointer(FunctionCall1(&giststate->decompressFn[nkey], - PointerGetDatum(e))); - /* decompressFn may just return the given pointer */ - if (dep != e) - { - gistentryinit(*e, dep->key, dep->rel, dep->page, dep->offset, - dep->bytes, dep->leafkey); - pfree(dep); - } - } - else - gistentryinit(*e, (Datum) 0, r, pg, o, 0, l); -} - - -/* -** initialize a GiST entry with a compressed version of key -*/ -static void -gistcentryinit(GISTSTATE *giststate, int nkey, - GISTENTRY *e, Datum k, Relation r, - Page pg, OffsetNumber o, int b, bool l, bool isNull) -{ - if (!isNull) - { - GISTENTRY *cep; - - gistentryinit(*e, k, r, pg, o, b, l); - cep = (GISTENTRY *) - DatumGetPointer(FunctionCall1(&giststate->compressFn[nkey], - PointerGetDatum(e))); - /* compressFn may just return the given pointer */ - if (cep != e) - { - gistentryinit(*e, cep->key, cep->rel, cep->page, cep->offset, - cep->bytes, cep->leafkey); - pfree(cep); - } - } - else - gistentryinit(*e, (Datum) 0, r, pg, o, 0, l); -} - -static IndexTuple -gistFormTuple(GISTSTATE *giststate, Relation r, - Datum attdata[], int datumsize[], bool isnull[]) -{ - IndexTuple tup; - char isnullchar[INDEX_MAX_KEYS]; - bool whatfree[INDEX_MAX_KEYS]; - GISTENTRY centry[INDEX_MAX_KEYS]; - Datum compatt[INDEX_MAX_KEYS]; - int j; - - for (j = 0; j < r->rd_att->natts; j++) - { - if (isnull[j]) - { - isnullchar[j] = 'n'; - compatt[j] = (Datum) 0; - whatfree[j] = FALSE; - } - else - { - gistcentryinit(giststate, j, ¢ry[j], attdata[j], - (Relation) NULL, (Page) NULL, (OffsetNumber) NULL, - datumsize[j], FALSE, FALSE); - isnullchar[j] = ' '; - compatt[j] = centry[j].key; - if (!isAttByVal(giststate, j)) - { - whatfree[j] = TRUE; - if (centry[j].key != attdata[j]) - pfree(DatumGetPointer(attdata[j])); - } - else - whatfree[j] = FALSE; - } - } - - tup = (IndexTuple) index_formtuple(giststate->tupdesc, compatt, isnullchar); - for (j = 0; j < r->rd_att->natts; j++) - if (whatfree[j]) - pfree(DatumGetPointer(compatt[j])); - - return tup; -} - -static void -gistDeCompressAtt(GISTSTATE *giststate, Relation r, IndexTuple tuple, Page p, - OffsetNumber o, GISTENTRY attdata[], bool decompvec[], bool isnull[]) -{ - int i; - Datum datum; - - for (i = 0; i < r->rd_att->natts; i++) - { - datum = index_getattr(tuple, i + 1, giststate->tupdesc, &isnull[i]); - gistdentryinit(giststate, i, &attdata[i], - datum, r, p, o, - ATTSIZE(datum, giststate->tupdesc, i + 1, isnull[i]), FALSE, isnull[i]); - if (isAttByVal(giststate, i)) - decompvec[i] = FALSE; - else - { - if (attdata[i].key == datum || isnull[i]) - decompvec[i] = FALSE; - else - decompvec[i] = TRUE; - } - } -} - -static void -gistFreeAtt(Relation r, GISTENTRY attdata[], bool decompvec[]) -{ - int i; - - for (i = 0; i < r->rd_att->natts; i++) - if (decompvec[i]) - pfree(DatumGetPointer(attdata[i].key)); -} - -static void -gistpenalty(GISTSTATE *giststate, int attno, - GISTENTRY *key1, bool isNull1, - GISTENTRY *key2, bool isNull2, float *penalty) -{ - if (giststate->penaltyFn[attno].fn_strict && (isNull1 || isNull2)) - *penalty = 0.0; - else - FunctionCall3(&giststate->penaltyFn[attno], - PointerGetDatum(key1), - PointerGetDatum(key2), - PointerGetDatum(penalty)); -} - -#ifdef GISTDEBUG -static void -gist_dumptree(Relation r, int level, BlockNumber blk, OffsetNumber coff) -{ - Buffer buffer; - Page page; - GISTPageOpaque opaque; - IndexTuple which; - ItemId iid; - OffsetNumber i, - maxoff; - BlockNumber cblk; - char *pred; - - pred = (char *) palloc(sizeof(char) * level + 1); - MemSet(pred, '\t', level); - pred[level] = '\0'; - - buffer = ReadBuffer(r, blk); - page = (Page) BufferGetPage(buffer); - opaque = (GISTPageOpaque) PageGetSpecialPointer(page); - - maxoff = PageGetMaxOffsetNumber(page); - - elog(DEBUG3, "%sPage: %d %s blk: %d maxoff: %d free: %d", pred, - coff, (opaque->flags & F_LEAF) ? "LEAF" : "INTE", (int) blk, - (int) maxoff, PageGetFreeSpace(page)); - - for (i = FirstOffsetNumber; i <= maxoff; i = OffsetNumberNext(i)) - { - iid = PageGetItemId(page, i); - which = (IndexTuple) PageGetItem(page, iid); - cblk = ItemPointerGetBlockNumber(&(which->t_tid)); -#ifdef PRINTTUPLE - elog(DEBUG3, "%s Tuple. blk: %d size: %d", pred, (int) cblk, - IndexTupleSize(which)); -#endif - - if (!(opaque->flags & F_LEAF)) - gist_dumptree(r, level + 1, cblk, i); - } - ReleaseBuffer(buffer); - pfree(pred); -} -#endif /* defined GISTDEBUG */ - -void -gist_redo(XLogRecPtr lsn, XLogRecord *record) -{ - elog(PANIC, "gist_redo: unimplemented"); -} - -void -gist_undo(XLogRecPtr lsn, XLogRecord *record) -{ - elog(PANIC, "gist_undo: unimplemented"); -} - -void -gist_desc(char *buf, uint8 xl_info, char *rec) -{ -} diff --git a/src/backend/access/gist/gistget.c b/src/backend/access/gist/gistget.c deleted file mode 100644 index aaa26b41d20..00000000000 --- a/src/backend/access/gist/gistget.c +++ /dev/null @@ -1,344 +0,0 @@ -/*------------------------------------------------------------------------- - * - * gistget.c - * fetch tuples from a GiST scan. - * - * - * 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/access/gist/gistget.c,v 1.34 2002/06/20 20:29:24 momjian Exp $ - * - *------------------------------------------------------------------------- - */ -#include "postgres.h" - -#include "access/gist.h" -#include "executor/execdebug.h" - - -static OffsetNumber gistfindnext(IndexScanDesc s, Page p, OffsetNumber n, - ScanDirection dir); -static bool gistscancache(IndexScanDesc s, ScanDirection dir); -static bool gistfirst(IndexScanDesc s, ScanDirection dir); -static bool gistnext(IndexScanDesc s, ScanDirection dir); -static bool gistindex_keytest(IndexTuple tuple, - int scanKeySize, ScanKey key, GISTSTATE *giststate, - Relation r, Page p, OffsetNumber offset); - - -Datum -gistgettuple(PG_FUNCTION_ARGS) -{ - IndexScanDesc s = (IndexScanDesc) PG_GETARG_POINTER(0); - ScanDirection dir = (ScanDirection) PG_GETARG_INT32(1); - bool res; - - /* if we have it cached in the scan desc, just return the value */ - if (gistscancache(s, dir)) - PG_RETURN_BOOL(true); - - /* not cached, so we'll have to do some work */ - if (ItemPointerIsValid(&(s->currentItemData))) - res = gistnext(s, dir); - else - res = gistfirst(s, dir); - PG_RETURN_BOOL(res); -} - -static bool -gistfirst(IndexScanDesc s, ScanDirection dir) -{ - Buffer b; - Page p; - OffsetNumber n; - OffsetNumber maxoff; - GISTPageOpaque po; - GISTScanOpaque so; - GISTSTACK *stk; - BlockNumber blk; - IndexTuple it; - - b = ReadBuffer(s->indexRelation, GISTP_ROOT); - p = BufferGetPage(b); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - so = (GISTScanOpaque) s->opaque; - - for (;;) - { - maxoff = PageGetMaxOffsetNumber(p); - if (ScanDirectionIsBackward(dir)) - n = gistfindnext(s, p, maxoff, dir); - else - n = gistfindnext(s, p, FirstOffsetNumber, dir); - - while (n < FirstOffsetNumber || n > maxoff) - { - ReleaseBuffer(b); - if (so->s_stack == (GISTSTACK *) NULL) - return false; - - stk = so->s_stack; - b = ReadBuffer(s->indexRelation, stk->gs_blk); - p = BufferGetPage(b); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - maxoff = PageGetMaxOffsetNumber(p); - - if (ScanDirectionIsBackward(dir)) - n = OffsetNumberPrev(stk->gs_child); - else - n = OffsetNumberNext(stk->gs_child); - so->s_stack = stk->gs_parent; - pfree(stk); - - n = gistfindnext(s, p, n, dir); - } - if (po->flags & F_LEAF) - { - ItemPointerSet(&(s->currentItemData), BufferGetBlockNumber(b), n); - - it = (IndexTuple) PageGetItem(p, PageGetItemId(p, n)); - - s->xs_ctup.t_self = it->t_tid; - - ReleaseBuffer(b); - return true; - } - else - { - stk = (GISTSTACK *) palloc(sizeof(GISTSTACK)); - stk->gs_child = n; - stk->gs_blk = BufferGetBlockNumber(b); - stk->gs_parent = so->s_stack; - so->s_stack = stk; - - it = (IndexTuple) PageGetItem(p, PageGetItemId(p, n)); - blk = ItemPointerGetBlockNumber(&(it->t_tid)); - - ReleaseBuffer(b); - b = ReadBuffer(s->indexRelation, blk); - p = BufferGetPage(b); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - } - } -} - -static bool -gistnext(IndexScanDesc s, ScanDirection dir) -{ - Buffer b; - Page p; - OffsetNumber n; - OffsetNumber maxoff; - GISTPageOpaque po; - GISTScanOpaque so; - GISTSTACK *stk; - BlockNumber blk; - IndexTuple it; - - blk = ItemPointerGetBlockNumber(&(s->currentItemData)); - n = ItemPointerGetOffsetNumber(&(s->currentItemData)); - - if (ScanDirectionIsForward(dir)) - n = OffsetNumberNext(n); - else - n = OffsetNumberPrev(n); - - b = ReadBuffer(s->indexRelation, blk); - p = BufferGetPage(b); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - so = (GISTScanOpaque) s->opaque; - - for (;;) - { - maxoff = PageGetMaxOffsetNumber(p); - n = gistfindnext(s, p, n, dir); - - while (n < FirstOffsetNumber || n > maxoff) - { - ReleaseBuffer(b); - if (so->s_stack == (GISTSTACK *) NULL) - return false; - - stk = so->s_stack; - b = ReadBuffer(s->indexRelation, stk->gs_blk); - p = BufferGetPage(b); - maxoff = PageGetMaxOffsetNumber(p); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - - if (ScanDirectionIsBackward(dir)) - n = OffsetNumberPrev(stk->gs_child); - else - n = OffsetNumberNext(stk->gs_child); - so->s_stack = stk->gs_parent; - pfree(stk); - - n = gistfindnext(s, p, n, dir); - } - if (po->flags & F_LEAF) - { - ItemPointerSet(&(s->currentItemData), BufferGetBlockNumber(b), n); - - it = (IndexTuple) PageGetItem(p, PageGetItemId(p, n)); - - s->xs_ctup.t_self = it->t_tid; - - ReleaseBuffer(b); - return true; - } - else - { - stk = (GISTSTACK *) palloc(sizeof(GISTSTACK)); - stk->gs_child = n; - stk->gs_blk = BufferGetBlockNumber(b); - stk->gs_parent = so->s_stack; - so->s_stack = stk; - - it = (IndexTuple) PageGetItem(p, PageGetItemId(p, n)); - blk = ItemPointerGetBlockNumber(&(it->t_tid)); - - ReleaseBuffer(b); - b = ReadBuffer(s->indexRelation, blk); - p = BufferGetPage(b); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - - if (ScanDirectionIsBackward(dir)) - n = PageGetMaxOffsetNumber(p); - else - n = FirstOffsetNumber; - } - } -} - -/* Similar to index_keytest, but decompresses the key in the IndexTuple */ -static bool -gistindex_keytest(IndexTuple tuple, - int scanKeySize, - ScanKey key, - GISTSTATE *giststate, - Relation r, - Page p, - OffsetNumber offset) -{ - bool isNull; - Datum datum; - Datum test; - GISTENTRY de; - - IncrIndexProcessed(); - - while (scanKeySize > 0) - { - datum = index_getattr(tuple, - key[0].sk_attno, - giststate->tupdesc, - &isNull); - if (isNull) - { - /* XXX eventually should check if SK_ISNULL */ - return false; - } - -/* this code from backend/access/common/indexvalid.c. But why and what??? - if (key[0].sk_flags & SK_ISNULL) - return false; -*/ - gistdentryinit(giststate, key[0].sk_attno - 1, &de, - datum, r, p, offset, - IndexTupleSize(tuple) - sizeof(IndexTupleData), - FALSE, isNull); - - if (key[0].sk_flags & SK_COMMUTE) - { - test = FunctionCall3(&key[0].sk_func, - key[0].sk_argument, - PointerGetDatum(&de), - ObjectIdGetDatum(key[0].sk_procedure)); - } - else - { - test = FunctionCall3(&key[0].sk_func, - PointerGetDatum(&de), - key[0].sk_argument, - ObjectIdGetDatum(key[0].sk_procedure)); - } - - if (de.key != datum && !isAttByVal(giststate, key[0].sk_attno - 1)) - if (DatumGetPointer(de.key) != NULL) - pfree(DatumGetPointer(de.key)); - - if (DatumGetBool(test) == !!(key[0].sk_flags & SK_NEGATE)) - return false; - - scanKeySize--; - key++; - } - return true; -} - - -static OffsetNumber -gistfindnext(IndexScanDesc s, Page p, OffsetNumber n, ScanDirection dir) -{ - OffsetNumber maxoff; - IndexTuple it; - GISTPageOpaque po; - GISTScanOpaque so; - GISTSTATE *giststate; - - maxoff = PageGetMaxOffsetNumber(p); - po = (GISTPageOpaque) PageGetSpecialPointer(p); - so = (GISTScanOpaque) s->opaque; - giststate = so->giststate; - - /* - * If we modified the index during the scan, we may have a pointer to - * a ghost tuple, before the scan. If this is the case, back up one. - */ - - if (so->s_flags & GS_CURBEFORE) - { - so->s_flags &= ~GS_CURBEFORE; - n = OffsetNumberPrev(n); - } - - while (n >= FirstOffsetNumber && n <= maxoff) - { - it = (IndexTuple) PageGetItem(p, PageGetItemId(p, n)); - if (gistindex_keytest(it, - s->numberOfKeys, s->keyData, giststate, - s->indexRelation, p, n)) - break; - - if (ScanDirectionIsBackward(dir)) - n = OffsetNumberPrev(n); - else - n = OffsetNumberNext(n); - } - - return n; -} - -static bool -gistscancache(IndexScanDesc s, ScanDirection dir) -{ - Buffer b; - Page p; - OffsetNumber n; - IndexTuple it; - - if (!(ScanDirectionIsNoMovement(dir) - && ItemPointerIsValid(&(s->currentItemData)))) - return false; - - b = ReadBuffer(s->indexRelation, - ItemPointerGetBlockNumber(&(s->currentItemData))); - p = BufferGetPage(b); - n = ItemPointerGetOffsetNumber(&(s->currentItemData)); - it = (IndexTuple) PageGetItem(p, PageGetItemId(p, n)); - s->xs_ctup.t_self = it->t_tid; - ReleaseBuffer(b); - - return true; -} diff --git a/src/backend/access/gist/gistscan.c b/src/backend/access/gist/gistscan.c deleted file mode 100644 index 9c1c92a880a..00000000000 --- a/src/backend/access/gist/gistscan.c +++ /dev/null @@ -1,421 +0,0 @@ -/*------------------------------------------------------------------------- - * - * gistscan.c - * routines to manage scans on GiST index relations - * - * - * 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/access/gist/gistscan.c,v 1.43 2002/06/20 20:29:24 momjian Exp $ - * - *------------------------------------------------------------------------- - */ -#include "postgres.h" - -#include "access/genam.h" -#include "access/gist.h" -#include "access/gistscan.h" - - -/* routines defined and used here */ -static void gistregscan(IndexScanDesc s); -static void gistdropscan(IndexScanDesc s); -static void gistadjone(IndexScanDesc s, int op, BlockNumber blkno, - OffsetNumber offnum); -static void adjuststack(GISTSTACK *stk, BlockNumber blkno); -static void adjustiptr(IndexScanDesc s, ItemPointer iptr, - int op, BlockNumber blkno, OffsetNumber offnum); - -/* - * Whenever we start a GiST scan in a backend, we register it in private - * space. Then if the GiST index gets updated, we check all registered - * scans and adjust them if the tuple they point at got moved by the - * update. We only need to do this in private space, because when we update - * an GiST we have a write lock on the tree, so no other process can have - * any locks at all on it. A single transaction can have write and read - * locks on the same object, so that's why we need to handle this case. - */ - -typedef struct GISTScanListData -{ - IndexScanDesc gsl_scan; - struct GISTScanListData *gsl_next; -} GISTScanListData; - -typedef GISTScanListData *GISTScanList; - -/* pointer to list of local scans on GiSTs */ -static GISTScanList GISTScans = (GISTScanList) NULL; - -Datum -gistbeginscan(PG_FUNCTION_ARGS) -{ - Relation r = (Relation) PG_GETARG_POINTER(0); - int nkeys = PG_GETARG_INT32(1); - ScanKey key = (ScanKey) PG_GETARG_POINTER(2); - IndexScanDesc s; - - s = RelationGetIndexScan(r, nkeys, key); - - gistregscan(s); - - PG_RETURN_POINTER(s); -} - -Datum -gistrescan(PG_FUNCTION_ARGS) -{ - IndexScanDesc s = (IndexScanDesc) PG_GETARG_POINTER(0); - ScanKey key = (ScanKey) PG_GETARG_POINTER(1); - GISTScanOpaque p; - int i; - - /* - * Clear all the pointers. - */ - ItemPointerSetInvalid(&s->currentItemData); - ItemPointerSetInvalid(&s->currentMarkData); - - if (s->numberOfKeys > 0) - { - memmove(s->keyData, - key, - s->numberOfKeys * sizeof(ScanKeyData)); - } - - p = (GISTScanOpaque) s->opaque; - if (p != (GISTScanOpaque) NULL) - { - gistfreestack(p->s_stack); - gistfreestack(p->s_markstk); - p->s_stack = p->s_markstk = (GISTSTACK *) NULL; - p->s_flags = 0x0; - for (i = 0; i < s->numberOfKeys; i++) - { - s->keyData[i].sk_procedure - = RelationGetGISTStrategy(s->indexRelation, - s->keyData[i].sk_attno, - s->keyData[i].sk_procedure); - s->keyData[i].sk_func = p->giststate->consistentFn[s->keyData[i].sk_attno - 1]; - } - } - else - { - /* initialize opaque data */ - p = (GISTScanOpaque) palloc(sizeof(GISTScanOpaqueData)); - p->s_stack = p->s_markstk = (GISTSTACK *) NULL; - p->s_flags = 0x0; - s->opaque = p; - p->giststate = (GISTSTATE *) palloc(sizeof(GISTSTATE)); - initGISTstate(p->giststate, s->indexRelation); - if (s->numberOfKeys > 0) - - /* - * * Play games here with the scan key to use the Consistent * - * function for all comparisons: * 1) the sk_procedure field - * will now be used to hold the * strategy number * 2) the - * sk_func field will point to the Consistent function - */ - for (i = 0; i < s->numberOfKeys; i++) - { - s->keyData[i].sk_procedure = - RelationGetGISTStrategy(s->indexRelation, - s->keyData[i].sk_attno, - s->keyData[i].sk_procedure); - s->keyData[i].sk_func = p->giststate->consistentFn[s->keyData[i].sk_attno - 1]; - } - } - - PG_RETURN_VOID(); -} - -Datum -gistmarkpos(PG_FUNCTION_ARGS) -{ - IndexScanDesc s = (IndexScanDesc) PG_GETARG_POINTER(0); - GISTScanOpaque p; - GISTSTACK *o, - *n, - *tmp; - - s->currentMarkData = s->currentItemData; - p = (GISTScanOpaque) s->opaque; - if (p->s_flags & GS_CURBEFORE) - p->s_flags |= GS_MRKBEFORE; - else - p->s_flags &= ~GS_MRKBEFORE; - - o = (GISTSTACK *) NULL; - n = p->s_stack; - - /* copy the parent stack from the current item data */ - while (n != (GISTSTACK *) NULL) - { - tmp = (GISTSTACK *) palloc(sizeof(GISTSTACK)); - tmp->gs_child = n->gs_child; - tmp->gs_blk = n->gs_blk; - tmp->gs_parent = o; - o = tmp; - n = n->gs_parent; - } - - gistfreestack(p->s_markstk); - p->s_markstk = o; - - PG_RETURN_VOID(); -} - -Datum -gistrestrpos(PG_FUNCTION_ARGS) -{ - IndexScanDesc s = (IndexScanDesc) PG_GETARG_POINTER(0); - GISTScanOpaque p; - GISTSTACK *o, - *n, - *tmp; - - s->currentItemData = s->currentMarkData; - p = (GISTScanOpaque) s->opaque; - if (p->s_flags & GS_MRKBEFORE) - p->s_flags |= GS_CURBEFORE; - else - p->s_flags &= ~GS_CURBEFORE; - - o = (GISTSTACK *) NULL; - n = p->s_markstk; - - /* copy the parent stack from the current item data */ - while (n != (GISTSTACK *) NULL) - { - tmp = (GISTSTACK *) palloc(sizeof(GISTSTACK)); - tmp->gs_child = n->gs_child; - tmp->gs_blk = n->gs_blk; - tmp->gs_parent = o; - o = tmp; - n = n->gs_parent; - } - - gistfreestack(p->s_stack); - p->s_stack = o; - - PG_RETURN_VOID(); -} - -Datum -gistendscan(PG_FUNCTION_ARGS) -{ - IndexScanDesc s = (IndexScanDesc) PG_GETARG_POINTER(0); - GISTScanOpaque p; - - p = (GISTScanOpaque) s->opaque; - - if (p != (GISTScanOpaque) NULL) - { - gistfreestack(p->s_stack); - gistfreestack(p->s_markstk); - if (p->giststate != NULL) - freeGISTstate(p->giststate); - pfree(s->opaque); - } - - gistdropscan(s); - /* XXX don't unset read lock -- two-phase locking */ - - PG_RETURN_VOID(); -} - -static void -gistregscan(IndexScanDesc s) -{ - GISTScanList l; - - l = (GISTScanList) palloc(sizeof(GISTScanListData)); - l->gsl_scan = s; - l->gsl_next = GISTScans; - GISTScans = l; -} - -static void -gistdropscan(IndexScanDesc s) -{ - GISTScanList l; - GISTScanList prev; - - prev = (GISTScanList) NULL; - - for (l = GISTScans; - l != (GISTScanList) NULL && l->gsl_scan != s; - l = l->gsl_next) - prev = l; - - if (l == (GISTScanList) NULL) - elog(ERROR, "GiST scan list corrupted -- cannot find 0x%p", (void *) s); - - if (prev == (GISTScanList) NULL) - GISTScans = l->gsl_next; - else - prev->gsl_next = l->gsl_next; - - pfree(l); -} - -/* - * AtEOXact_gist() --- clean up gist subsystem at xact abort or commit. - * - * This is here because it needs to touch this module's static var GISTScans. - */ -void -AtEOXact_gist(void) -{ - /* - * Note: these actions should only be necessary during xact abort; but - * they can't hurt during a commit. - */ - - /* - * Reset the active-scans list to empty. We do not need to free the - * list elements, because they're all palloc()'d, so they'll go away - * at end of transaction anyway. - */ - GISTScans = NULL; -} - -void -gistadjscans(Relation rel, int op, BlockNumber blkno, OffsetNumber offnum) -{ - GISTScanList l; - Oid relid; - - relid = RelationGetRelid(rel); - for (l = GISTScans; l != (GISTScanList) NULL; l = l->gsl_next) - { - if (l->gsl_scan->indexRelation->rd_id == relid) - gistadjone(l->gsl_scan, op, blkno, offnum); - } -} - -/* - * gistadjone() -- adjust one scan for update. - * - * By here, the scan passed in is on a modified relation. Op tells - * us what the modification is, and blkno and offind tell us what - * block and offset index were affected. This routine checks the - * current and marked positions, and the current and marked stacks, - * to see if any stored location needs to be changed because of the - * update. If so, we make the change here. - */ -static void -gistadjone(IndexScanDesc s, - int op, - BlockNumber blkno, - OffsetNumber offnum) -{ - GISTScanOpaque so; - - adjustiptr(s, &(s->currentItemData), op, blkno, offnum); - adjustiptr(s, &(s->currentMarkData), op, blkno, offnum); - - so = (GISTScanOpaque) s->opaque; - - if (op == GISTOP_SPLIT) - { - adjuststack(so->s_stack, blkno); - adjuststack(so->s_markstk, blkno); - } -} - -/* - * adjustiptr() -- adjust current and marked item pointers in the scan - * - * Depending on the type of update and the place it happened, we - * need to do nothing, to back up one record, or to start over on - * the same page. - */ -static void -adjustiptr(IndexScanDesc s, - ItemPointer iptr, - int op, - BlockNumber blkno, - OffsetNumber offnum) -{ - OffsetNumber curoff; - GISTScanOpaque so; - - if (ItemPointerIsValid(iptr)) - { - if (ItemPointerGetBlockNumber(iptr) == blkno) - { - curoff = ItemPointerGetOffsetNumber(iptr); - so = (GISTScanOpaque) s->opaque; - - switch (op) - { - case GISTOP_DEL: - /* back up one if we need to */ - if (curoff >= offnum) - { - - if (curoff > FirstOffsetNumber) - { - /* just adjust the item pointer */ - ItemPointerSet(iptr, blkno, OffsetNumberPrev(curoff)); - } - else - { - /* - * remember that we're before the current - * tuple - */ - ItemPointerSet(iptr, blkno, FirstOffsetNumber); - if (iptr == &(s->currentItemData)) - so->s_flags |= GS_CURBEFORE; - else - so->s_flags |= GS_MRKBEFORE; - } - } - break; - - case GISTOP_SPLIT: - /* back to start of page on split */ - ItemPointerSet(iptr, blkno, FirstOffsetNumber); - if (iptr == &(s->currentItemData)) - so->s_flags &= ~GS_CURBEFORE; - else - so->s_flags &= ~GS_MRKBEFORE; - break; - - default: - elog(ERROR, "Bad operation in GiST scan adjust: %d", op); - } - } - } -} - -/* - * adjuststack() -- adjust the supplied stack for a split on a page in - * the index we're scanning. - * - * If a page on our parent stack has split, we need to back up to the - * beginning of the page and rescan it. The reason for this is that - * the split algorithm for GiSTs doesn't order tuples in any useful - * way on a single page. This means on that a split, we may wind up - * looking at some heap tuples more than once. This is handled in the - * access method update code for heaps; if we've modified the tuple we - * are looking at already in this transaction, we ignore the update - * request. - */ -/*ARGSUSED*/ -static void -adjuststack(GISTSTACK *stk, - BlockNumber blkno) -{ - while (stk != (GISTSTACK *) NULL) - { - if (stk->gs_blk == blkno) - stk->gs_child = FirstOffsetNumber; - - stk = stk->gs_parent; - } -} diff --git a/src/backend/access/gist/giststrat.c b/src/backend/access/gist/giststrat.c deleted file mode 100644 index 397e3069746..00000000000 --- a/src/backend/access/gist/giststrat.c +++ /dev/null @@ -1,125 +0,0 @@ -/*------------------------------------------------------------------------- - * - * giststrat.c - * strategy map data for GiSTs. - * - * - * 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/access/gist/Attic/giststrat.c,v 1.20 2002/06/20 20:29:24 momjian Exp $ - * - *------------------------------------------------------------------------- - */ -#include "postgres.h" - -#include "access/gist.h" -#include "access/istrat.h" - - -/* - * Note: negate, commute, and negatecommute all assume that operators are - * ordered as follows in the strategy map: - * - * contains, contained-by - * - * The negate, commute, and negatecommute arrays are used by the planner - * to plan indexed scans over data that appears in the qualificiation in - * a boolean negation, or whose operands appear in the wrong order. For - * example, if the operator "<%" means "contains", and the user says - * - * where not rel.box <% "(10,10,20,20)"::box - * - * the planner can plan an index scan by noting that GiST indices have - * an operator in their operator class for negating <%. - * - * Similarly, if the user says something like - * - * where "(10,10,20,20)"::box <% rel.box - * - * the planner can see that the GiST index on rel.box has an operator in - * its opclass for commuting <%, and plan the scan using that operator. - * This added complexity in the access methods makes the planner a lot easier - * to write. - */ - -/* if a op b, what operator tells us if (not a op b)? */ -static StrategyNumber GISTNegate[GISTNStrategies] = { - InvalidStrategy, - InvalidStrategy, - InvalidStrategy -}; - -/* if a op_1 b, what is the operator op_2 such that b op_2 a? */ -static StrategyNumber GISTCommute[GISTNStrategies] = { - InvalidStrategy, - InvalidStrategy, - InvalidStrategy -}; - -/* if a op_1 b, what is the operator op_2 such that (b !op_2 a)? */ -static StrategyNumber GISTNegateCommute[GISTNStrategies] = { - InvalidStrategy, - InvalidStrategy, - InvalidStrategy -}; - -/* - * GiSTs do not currently support TermData (see rtree/rtstrat.c for - * discussion of - * TermData) -- such logic must be encoded in the user's Consistent function. - */ - -static StrategyExpression GISTEvaluationExpressions[GISTNStrategies] = { - NULL, - NULL, - NULL -}; - -/* - * If you were sufficiently attentive to detail, you would go through - * the ExpressionData pain above for every one of the strategies - * we defined. I am not. Now we declare the StrategyEvaluationData - * structure that gets shipped around to help the planner and the access - * method decide what sort of scan it should do, based on (a) what the - * user asked for, (b) what operators are defined for a particular opclass, - * and (c) the reams of information we supplied above. - * - * The idea of all of this initialized data is to make life easier on the - * user when he defines a new operator class to use this access method. - * By filling in all the data, we let him get away with leaving holes in his - * operator class, and still let him use the index. The added complexity - * in the access methods just isn't worth the trouble, though. - */ - -static StrategyEvaluationData GISTEvaluationData = { - GISTNStrategies, /* # of strategies */ - (StrategyTransformMap) GISTNegate, /* how to do (not qual) */ - (StrategyTransformMap) GISTCommute, /* how to swap operands */ - (StrategyTransformMap) GISTNegateCommute, /* how to do both */ - GISTEvaluationExpressions -}; - - -StrategyNumber -RelationGetGISTStrategy(Relation r, - AttrNumber attnum, - RegProcedure proc) -{ - return RelationGetStrategy(r, attnum, &GISTEvaluationData, proc); -} - -#ifdef NOT_USED -bool -RelationInvokeGISTStrategy(Relation r, - AttrNumber attnum, - StrategyNumber s, - Datum left, - Datum right) -{ - return (RelationInvokeStrategy(r, &GISTEvaluationData, attnum, s, - left, right)); -} - -#endif |