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,
140 entry->offset, res->len, FALSE);
141 } else if ( !ISALLTRUE(DatumGetPointer(entry->key)) ) {
144 BITVECP sign = GETSIGN(DatumGetPointer(entry->key));
147 if ((sign[i] & 0xff) != 0xff)
148 PG_RETURN_POINTER(retval);
151 res = (GISTTYPE *) palloc(CALCGTSIZE(ALLISTRUE));
152 res->len = CALCGTSIZE(ALLISTRUE);
153 res->flag = ALLISTRUE;
155 retval = (GISTENTRY *) palloc(sizeof(GISTENTRY));
156 gistentryinit(*retval, PointerGetDatum(res),
157 entry->rel, entry->page,
158 entry->offset, res->len, FALSE);
161 PG_RETURN_POINTER(retval);
165 ghstore_decompress(PG_FUNCTION_ARGS) {
166 PG_RETURN_DATUM(PG_GETARG_DATUM(0));
170 ghstore_same(PG_FUNCTION_ARGS) {
171 GISTTYPE *a = (GISTTYPE *) PG_GETARG_POINTER(0);
172 GISTTYPE *b = (GISTTYPE *) PG_GETARG_POINTER(1);
173 bool *result = (bool *) PG_GETARG_POINTER(2);
175 if (ISALLTRUE(a) && ISALLTRUE(b))
177 else if (ISALLTRUE(a))
179 else if (ISALLTRUE(b))
183 BITVECP sa = GETSIGN(a),
187 if (sa[i] != sb[i]) {
193 PG_RETURN_POINTER(result);
197 sizebitvec(BITVECP sign) {
200 size += SUMBIT(sign);
201 sign = (BITVECP) (((char *) sign) + 1);
207 hemdistsign(BITVECP a, BITVECP b) {
211 if ( GETBIT(a,i) != GETBIT(b,i) )
218 hemdist(GISTTYPE *a, GISTTYPE *b) {
219 if ( ISALLTRUE(a) ) {
223 return SIGLENBIT-sizebitvec(GETSIGN(b));
224 } else if (ISALLTRUE(b))
225 return SIGLENBIT-sizebitvec(GETSIGN(a));
227 return hemdistsign( GETSIGN(a), GETSIGN(b) );
231 unionkey(BITVECP sbase, GISTTYPE * add)
234 BITVECP sadd = GETSIGN(add);
245 ghstore_union(PG_FUNCTION_ARGS) {
247 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
248 int4 len = entryvec->n;
250 bytea *entryvec = (bytea *) PG_GETARG_POINTER(0);
251 int4 len = (VARSIZE(entryvec) - VARHDRSZ) / sizeof(GISTENTRY);
253 int *size = (int *) PG_GETARG_POINTER(1);
259 MemSet((void *) base, 0, sizeof(BITVEC));
260 for (i = 0; i < len; i++) {
261 if (unionkey(base, GETENTRY(entryvec, i))) {
267 len = CALCGTSIZE(flag);
268 result = (GISTTYPE *) palloc(len);
269 *size = result->len = len;
271 if (!ISALLTRUE(result))
272 memcpy((void *) GETSIGN(result), (void *) base, sizeof(BITVEC));
274 PG_RETURN_POINTER(result);
278 ghstore_penalty(PG_FUNCTION_ARGS) {
279 GISTENTRY *origentry = (GISTENTRY *) PG_GETARG_POINTER(0); /* always ISSIGNKEY */
280 GISTENTRY *newentry = (GISTENTRY *) PG_GETARG_POINTER(1);
281 float *penalty = (float *) PG_GETARG_POINTER(2);
282 GISTTYPE *origval = (GISTTYPE *) DatumGetPointer(origentry->key);
283 GISTTYPE *newval = (GISTTYPE *) DatumGetPointer(newentry->key);
285 *penalty=hemdist(origval,newval);
286 PG_RETURN_POINTER(penalty);
296 comparecost(const void *a, const void *b) {
297 return ((SPLITCOST *) a)->cost - ((SPLITCOST *) b)->cost;
302 ghstore_picksplit(PG_FUNCTION_ARGS) {
304 GistEntryVector *entryvec = (GistEntryVector *) PG_GETARG_POINTER(0);
305 OffsetNumber maxoff = entryvec->n - 2;
307 bytea *entryvec = (bytea *) PG_GETARG_POINTER(0);
308 OffsetNumber maxoff = ((VARSIZE(entryvec) - VARHDRSZ) / sizeof(GISTENTRY)) - 2;
310 GIST_SPLITVEC *v = (GIST_SPLITVEC *) PG_GETARG_POINTER(1);
317 int4 size_alpha, size_beta;
321 OffsetNumber seed_1 = 0,
327 SPLITCOST *costvector;
331 nbytes = (maxoff + 2) * sizeof(OffsetNumber);
332 v->spl_left = (OffsetNumber *) palloc(nbytes);
333 v->spl_right = (OffsetNumber *) palloc(nbytes);
335 for (k = FirstOffsetNumber; k < maxoff; k = OffsetNumberNext(k)) {
336 _k = GETENTRY(entryvec, k);
337 for (j = OffsetNumberNext(k); j <= maxoff; j = OffsetNumberNext(j)) {
338 size_waste=hemdist(_k, GETENTRY(entryvec, j));
339 if (size_waste > waste ) {
349 right = v->spl_right;
352 if (seed_1 == 0 || seed_2 == 0)
358 /* form initial .. */
359 if (ISALLTRUE(GETENTRY(entryvec, seed_1))) {
360 datum_l = (GISTTYPE *) palloc(GTHDRSIZE);
361 datum_l->len = GTHDRSIZE;
362 datum_l->flag = ALLISTRUE;
364 datum_l = (GISTTYPE *) palloc(GTHDRSIZE + SIGLEN);
365 datum_l->len = GTHDRSIZE + SIGLEN;
367 memcpy((void *) GETSIGN(datum_l), (void *) GETSIGN(GETENTRY(entryvec, seed_1)), sizeof(BITVEC))
370 if (ISALLTRUE(GETENTRY(entryvec, seed_2))) {
371 datum_r = (GISTTYPE *) palloc(GTHDRSIZE);
372 datum_r->len = GTHDRSIZE;
373 datum_r->flag = ALLISTRUE;
375 datum_r = (GISTTYPE *) palloc(GTHDRSIZE + SIGLEN);
376 datum_r->len = GTHDRSIZE + SIGLEN;
378 memcpy((void *) GETSIGN(datum_r), (void *) GETSIGN(GETENTRY(entryvec, seed_2)), sizeof(BITVEC)) ;
381 maxoff = OffsetNumberNext(maxoff);
382 /* sort before ... */
383 costvector = (SPLITCOST *) palloc(sizeof(SPLITCOST) * maxoff);
384 for (j = FirstOffsetNumber; j <= maxoff; j = OffsetNumberNext(j))
386 costvector[j - 1].pos = j;
387 _j = GETENTRY(entryvec, j);
388 size_alpha = hemdist(datum_l,_j);
389 size_beta = hemdist(datum_r,_j);
390 costvector[j - 1].cost = abs(size_alpha - size_beta);
392 qsort((void *) costvector, maxoff, sizeof(SPLITCOST), comparecost);
394 union_l=GETSIGN(datum_l);
395 union_r=GETSIGN(datum_r);
397 for (k = 0; k < maxoff; k++) {
398 j = costvector[k].pos;
403 } else if (j == seed_2) {
408 _j = GETENTRY(entryvec, j);
409 size_alpha = hemdist(datum_l,_j);
410 size_beta = hemdist(datum_r,_j);
412 if (size_alpha < size_beta + WISH_F(v->spl_nleft, v->spl_nright, 0.0001)) {
413 if (ISALLTRUE(datum_l) || ISALLTRUE(_j) ) {
414 if (!ISALLTRUE(datum_l))
415 MemSet((void *) union_l, 0xff, sizeof(BITVEC));
419 union_l[i] |= ptr[i];
425 if (ISALLTRUE(datum_r) || ISALLTRUE(_j) ) {
426 if (!ISALLTRUE(datum_r))
427 MemSet((void *) union_r, 0xff, sizeof(BITVEC));
431 union_r[i] |= ptr[i];
439 *right = *left = FirstOffsetNumber;
442 v->spl_ldatum = PointerGetDatum(datum_l);
443 v->spl_rdatum = PointerGetDatum(datum_r);
445 PG_RETURN_POINTER(v);
450 ghstore_consistent(PG_FUNCTION_ARGS) {
451 GISTTYPE *entry = (GISTTYPE*) DatumGetPointer( ((GISTENTRY *) PG_GETARG_POINTER(0))->key );
452 HStore *query=PG_GETARG_HS(1);
454 HEntry *qe = ARRPTR(query);
455 char *qv = STRPTR(query);
458 if ( ISALLTRUE(entry) ) {
459 PG_FREE_IF_COPY(query,1);
460 PG_RETURN_BOOL(true);
464 while(res && qe-ARRPTR(query) < query->size) {
465 int crc = crc32_sz((char *)(qv + qe->pos), qe->keylen);
466 if (GETBIT(sign,HASHVAL(crc))) {
467 if ( !qe->valisnull ) {
468 crc = crc32_sz((char *)(qv + qe->pos + qe->keylen), qe->vallen);
469 if ( !GETBIT(sign,HASHVAL(crc)) )
477 PG_FREE_IF_COPY(query,1);