3 #include "access/gist.h"
4 #include "access/itup.h"
5 /*#include "access/rtree.h"*/
10 #define SIGLENINT 4 /* >122 => key will toast, so very slow!!! */
11 #define SIGLEN ( sizeof(int)*SIGLENINT )
12 #define SIGLENBIT (SIGLEN*BITBYTE)
14 typedef char BITVEC[SIGLEN];
15 typedef char *BITVECP;
17 #define SIGPTR(x) ( (BITVECP) ARR_DATA_PTR(x) )
21 for(i=0;i<SIGLEN;i++) {\
26 for(i=0;i<SIGLENBIT;i++) {\
30 /* beware of multiple evaluation of arguments to these macros! */
31 #define GETBYTE(x,i) ( *( (BITVECP)(x) + (int)( (i) / BITBYTE ) ) )
32 #define GETBITBYTE(x,i) ( (*((char*)(x)) >> (i)) & 0x01 )
33 #define CLRBIT(x,i) GETBYTE(x,i) &= ~( 0x01 << ( (i) % BITBYTE ) )
34 #define SETBIT(x,i) GETBYTE(x,i) |= ( 0x01 << ( (i) % BITBYTE ) )
35 #define GETBIT(x,i) ( (GETBYTE(x,i) >> ( (i) % BITBYTE )) & 0x01 )
36 #define HASHVAL(val) (((unsigned int)(val)) % SIGLENBIT)
37 #define HASH(sign, val) SETBIT((sign), HASHVAL(val))
45 #define ALLISTRUE 0x04
47 #define ISALLTRUE(x) ( ((GISTTYPE*)x)->flag & ALLISTRUE )
49 #define GTHDRSIZE ( sizeof(int4)*2 )
50 #define CALCGTSIZE(flag) ( GTHDRSIZE+(((flag) & ALLISTRUE) ? 0 : SIGLEN) )
52 #define GETSIGN(x) ( (BITVECP)( (char*)x+GTHDRSIZE ) )
54 #define SUMBIT(val) ( \
55 GETBITBYTE((val),0) + \
56 GETBITBYTE((val),1) + \
57 GETBITBYTE((val),2) + \
58 GETBITBYTE((val),3) + \
59 GETBITBYTE((val),4) + \
60 GETBITBYTE((val),5) + \
61 GETBITBYTE((val),6) + \
66 #define GETENTRY(vec,pos) ((GISTTYPE *) DatumGetPointer((vec)->vector[(pos)].key))
68 #define GETENTRY(vec,pos) ((GISTTYPE *) DatumGetPointer(((GISTENTRY *) VARDATA(vec))[(pos)].key))
71 #define WISH_F(a,b,c) (double)( -(double)(((a)-(b))*((a)-(b))*((a)-(b)))*(c) )
73 PG_FUNCTION_INFO_V1(ghstore_in);
74 Datum ghstore_in(PG_FUNCTION_ARGS);
76 PG_FUNCTION_INFO_V1(ghstore_out);
77 Datum ghstore_out(PG_FUNCTION_ARGS);
81 ghstore_in(PG_FUNCTION_ARGS) {
82 elog(ERROR, "Not implemented");
87 ghstore_out(PG_FUNCTION_ARGS) {
88 elog(ERROR, "Not implemented");
92 PG_FUNCTION_INFO_V1(ghstore_consistent);
93 PG_FUNCTION_INFO_V1(ghstore_compress);
94 PG_FUNCTION_INFO_V1(ghstore_decompress);
95 PG_FUNCTION_INFO_V1(ghstore_penalty);
96 PG_FUNCTION_INFO_V1(ghstore_picksplit);
97 PG_FUNCTION_INFO_V1(ghstore_union);
98 PG_FUNCTION_INFO_V1(ghstore_same);
100 Datum ghstore_consistent(PG_FUNCTION_ARGS);
101 Datum ghstore_compress(PG_FUNCTION_ARGS);
102 Datum ghstore_decompress(PG_FUNCTION_ARGS);
103 Datum ghstore_penalty(PG_FUNCTION_ARGS);
104 Datum ghstore_picksplit(PG_FUNCTION_ARGS);
105 Datum ghstore_union(PG_FUNCTION_ARGS);
106 Datum ghstore_same(PG_FUNCTION_ARGS);
109 ghstore_compress(PG_FUNCTION_ARGS) {
110 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
111 GISTENTRY *retval = entry;
113 if (entry->leafkey) {
114 GISTTYPE *res = (GISTTYPE*)palloc(CALCGTSIZE(0));
115 HStore *toastedval = (HStore *) DatumGetPointer(entry->key);
116 HStore *val = (HStore *) DatumGetPointer(PG_DETOAST_DATUM(entry->key));
117 HEntry *ptr = ARRPTR(val);
118 char *words = STRPTR(val);
120 memset(res,0,CALCGTSIZE(0));
121 res->len=CALCGTSIZE(0);
123 while(ptr-ARRPTR(val) < val->size) {
125 h = crc32_sz((char*)(words+ptr->pos), ptr->keylen);
126 HASH( GETSIGN(res), h);
127 if ( !ptr->valisnull ) {
128 h = crc32_sz((char *)(words+ptr->pos+ptr->keylen), ptr->vallen);
129 HASH( GETSIGN(res), h);
134 if (val != toastedval)
137 retval = (GISTENTRY *) palloc(sizeof(GISTENTRY));
138 gistentryinit(*retval, PointerGetDatum(res),
139 entry->rel, entry->page,
141 #ifndef PG_MODULE_MAGIC
145 } else if ( !ISALLTRUE(DatumGetPointer(entry->key)) ) {
148 BITVECP sign = GETSIGN(DatumGetPointer(entry->key));
151 if ((sign[i] & 0xff) != 0xff)
152 PG_RETURN_POINTER(retval);
155 res = (GISTTYPE *) palloc(CALCGTSIZE(ALLISTRUE));
156 res->len = CALCGTSIZE(ALLISTRUE);
157 res->flag = ALLISTRUE;
159 retval = (GISTENTRY *) palloc(sizeof(GISTENTRY));
160 gistentryinit(*retval, PointerGetDatum(res),
161 entry->rel, entry->page,
163 #ifndef PG_MODULE_MAGIC
169 PG_RETURN_POINTER(retval);
173 ghstore_decompress(PG_FUNCTION_ARGS) {
174 PG_RETURN_DATUM(PG_GETARG_DATUM(0));
178 ghstore_same(PG_FUNCTION_ARGS) {
179 GISTTYPE *a = (GISTTYPE *) PG_GETARG_POINTER(0);
180 GISTTYPE *b = (GISTTYPE *) PG_GETARG_POINTER(1);
181 bool *result = (bool *) PG_GETARG_POINTER(2);
183 if (ISALLTRUE(a) && ISALLTRUE(b))
185 else if (ISALLTRUE(a))
187 else if (ISALLTRUE(b))
191 BITVECP sa = GETSIGN(a),
195 if (sa[i] != sb[i]) {
201 PG_RETURN_POINTER(result);
205 sizebitvec(BITVECP sign) {
208 size += SUMBIT(sign);
209 sign = (BITVECP) (((char *) sign) + 1);
215 hemdistsign(BITVECP a, BITVECP b) {
219 if ( GETBIT(a,i) != GETBIT(b,i) )
226 hemdist(GISTTYPE *a, GISTTYPE *b) {
227 if ( ISALLTRUE(a) ) {
231 return SIGLENBIT-sizebitvec(GETSIGN(b));
232 } else if (ISALLTRUE(b))
233 return SIGLENBIT-sizebitvec(GETSIGN(a));
235 return hemdistsign( GETSIGN(a), GETSIGN(b) );
239 unionkey(BITVECP sbase, GISTTYPE * add)
242 BITVECP sadd = GETSIGN(add);
253 ghstore_union(PG_FUNCTION_ARGS) {
255 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
256 int4 len = entryvec->n;
258 bytea *entryvec = (bytea *) PG_GETARG_POINTER(0);
259 int4 len = (VARSIZE(entryvec) - VARHDRSZ) / sizeof(GISTENTRY);
261 int *size = (int *) PG_GETARG_POINTER(1);
267 MemSet((void *) base, 0, sizeof(BITVEC));
268 for (i = 0; i < len; i++) {
269 if (unionkey(base, GETENTRY(entryvec, i))) {
275 len = CALCGTSIZE(flag);
276 result = (GISTTYPE *) palloc(len);
277 *size = result->len = len;
279 if (!ISALLTRUE(result))
280 memcpy((void *) GETSIGN(result), (void *) base, sizeof(BITVEC));
282 PG_RETURN_POINTER(result);
286 ghstore_penalty(PG_FUNCTION_ARGS) {
287 GISTENTRY *origentry = (GISTENTRY *) PG_GETARG_POINTER(0); /* always ISSIGNKEY */
288 GISTENTRY *newentry = (GISTENTRY *) PG_GETARG_POINTER(1);
289 float *penalty = (float *) PG_GETARG_POINTER(2);
290 GISTTYPE *origval = (GISTTYPE *) DatumGetPointer(origentry->key);
291 GISTTYPE *newval = (GISTTYPE *) DatumGetPointer(newentry->key);
293 *penalty=hemdist(origval,newval);
294 PG_RETURN_POINTER(penalty);
304 comparecost(const void *a, const void *b) {
305 return ((SPLITCOST *) a)->cost - ((SPLITCOST *) b)->cost;
310 ghstore_picksplit(PG_FUNCTION_ARGS) {
312 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
313 OffsetNumber maxoff = entryvec->n - 2;
315 bytea *entryvec = (bytea *) PG_GETARG_POINTER(0);
316 OffsetNumber maxoff = ((VARSIZE(entryvec) - VARHDRSZ) / sizeof(GISTENTRY)) - 2;
318 GIST_SPLITVEC *v = (GIST_SPLITVEC *) PG_GETARG_POINTER(1);
325 int4 size_alpha, size_beta;
329 OffsetNumber seed_1 = 0,
335 SPLITCOST *costvector;
339 nbytes = (maxoff + 2) * sizeof(OffsetNumber);
340 v->spl_left = (OffsetNumber *) palloc(nbytes);
341 v->spl_right = (OffsetNumber *) palloc(nbytes);
343 for (k = FirstOffsetNumber; k < maxoff; k = OffsetNumberNext(k)) {
344 _k = GETENTRY(entryvec, k);
345 for (j = OffsetNumberNext(k); j <= maxoff; j = OffsetNumberNext(j)) {
346 size_waste=hemdist(_k, GETENTRY(entryvec, j));
347 if (size_waste > waste ) {
357 right = v->spl_right;
360 if (seed_1 == 0 || seed_2 == 0)
366 /* form initial .. */
367 if (ISALLTRUE(GETENTRY(entryvec, seed_1))) {
368 datum_l = (GISTTYPE *) palloc(GTHDRSIZE);
369 datum_l->len = GTHDRSIZE;
370 datum_l->flag = ALLISTRUE;
372 datum_l = (GISTTYPE *) palloc(GTHDRSIZE + SIGLEN);
373 datum_l->len = GTHDRSIZE + SIGLEN;
375 memcpy((void *) GETSIGN(datum_l), (void *) GETSIGN(GETENTRY(entryvec, seed_1)), sizeof(BITVEC))
378 if (ISALLTRUE(GETENTRY(entryvec, seed_2))) {
379 datum_r = (GISTTYPE *) palloc(GTHDRSIZE);
380 datum_r->len = GTHDRSIZE;
381 datum_r->flag = ALLISTRUE;
383 datum_r = (GISTTYPE *) palloc(GTHDRSIZE + SIGLEN);
384 datum_r->len = GTHDRSIZE + SIGLEN;
386 memcpy((void *) GETSIGN(datum_r), (void *) GETSIGN(GETENTRY(entryvec, seed_2)), sizeof(BITVEC)) ;
389 maxoff = OffsetNumberNext(maxoff);
390 /* sort before ... */
391 costvector = (SPLITCOST *) palloc(sizeof(SPLITCOST) * maxoff);
392 for (j = FirstOffsetNumber; j <= maxoff; j = OffsetNumberNext(j))
394 costvector[j - 1].pos = j;
395 _j = GETENTRY(entryvec, j);
396 size_alpha = hemdist(datum_l,_j);
397 size_beta = hemdist(datum_r,_j);
398 costvector[j - 1].cost = abs(size_alpha - size_beta);
400 qsort((void *) costvector, maxoff, sizeof(SPLITCOST), comparecost);
402 union_l=GETSIGN(datum_l);
403 union_r=GETSIGN(datum_r);
405 for (k = 0; k < maxoff; k++) {
406 j = costvector[k].pos;
411 } else if (j == seed_2) {
416 _j = GETENTRY(entryvec, j);
417 size_alpha = hemdist(datum_l,_j);
418 size_beta = hemdist(datum_r,_j);
420 if (size_alpha < size_beta + WISH_F(v->spl_nleft, v->spl_nright, 0.0001)) {
421 if (ISALLTRUE(datum_l) || ISALLTRUE(_j) ) {
422 if (!ISALLTRUE(datum_l))
423 MemSet((void *) union_l, 0xff, sizeof(BITVEC));
427 union_l[i] |= ptr[i];
433 if (ISALLTRUE(datum_r) || ISALLTRUE(_j) ) {
434 if (!ISALLTRUE(datum_r))
435 MemSet((void *) union_r, 0xff, sizeof(BITVEC));
439 union_r[i] |= ptr[i];
447 *right = *left = FirstOffsetNumber;
450 v->spl_ldatum = PointerGetDatum(datum_l);
451 v->spl_rdatum = PointerGetDatum(datum_r);
453 PG_RETURN_POINTER(v);
458 ghstore_consistent(PG_FUNCTION_ARGS) {
459 GISTTYPE *entry = (GISTTYPE*) DatumGetPointer( ((GISTENTRY *) PG_GETARG_POINTER(0))->key );
460 HStore *query=PG_GETARG_HS(1);
462 HEntry *qe = ARRPTR(query);
463 char *qv = STRPTR(query);
466 if ( ISALLTRUE(entry) ) {
467 PG_FREE_IF_COPY(query,1);
468 PG_RETURN_BOOL(true);
472 while(res && qe-ARRPTR(query) < query->size) {
473 int crc = crc32_sz((char *)(qv + qe->pos), qe->keylen);
474 if (GETBIT(sign,HASHVAL(crc))) {
475 if ( !qe->valisnull ) {
476 crc = crc32_sz((char *)(qv + qe->pos + qe->keylen), qe->vallen);
477 if ( !GETBIT(sign,HASHVAL(crc)) )
485 PG_FREE_IF_COPY(query,1);