PostgreSQL Source Code git master
Data Structures | Macros | Typedefs | Functions
_ltree_gist.c File Reference
#include "postgres.h"
#include <math.h>
#include "access/gist.h"
#include "access/reloptions.h"
#include "access/stratnum.h"
#include "crc32.h"
#include "ltree.h"
#include "port/pg_bitutils.h"
#include "utils/array.h"
Include dependency graph for _ltree_gist.c:

Go to the source code of this file.

Data Structures

struct   SPLITCOST
 
struct   LtreeSignature
 

Macros

#define  GETENTRY(vec, pos)   ((ltree_gist *) DatumGetPointer((vec)->vector[(pos)].key))
 
#define  NEXTVAL(x)   ( (ltree*)( (char*)(x) + INTALIGN( VARSIZE(x) ) ) )
 
#define  WISH_F(a, b, c)   (double)( -(double)(((a)-(b))*((a)-(b))*((a)-(b)))*(c) )
 

Typedefs

typedef struct LtreeSignature  LtreeSignature
 

Functions

  PG_FUNCTION_INFO_V1 (_ltree_compress)
 
  PG_FUNCTION_INFO_V1 (_ltree_same)
 
  PG_FUNCTION_INFO_V1 (_ltree_union)
 
  PG_FUNCTION_INFO_V1 (_ltree_penalty)
 
  PG_FUNCTION_INFO_V1 (_ltree_picksplit)
 
  PG_FUNCTION_INFO_V1 (_ltree_consistent)
 
  PG_FUNCTION_INFO_V1 (_ltree_gist_options)
 
static void  hashing (BITVECP sign, ltree *t, int siglen)
 
Datum  _ltree_compress (PG_FUNCTION_ARGS)
 
Datum  _ltree_same (PG_FUNCTION_ARGS)
 
static int32  unionkey (BITVECP sbase, ltree_gist *add, int siglen)
 
Datum  _ltree_union (PG_FUNCTION_ARGS)
 
static int32  sizebitvec (BITVECP sign, int siglen)
 
static int  hemdistsign (BITVECP a, BITVECP b, int siglen)
 
static int  hemdist (ltree_gist *a, ltree_gist *b, int siglen)
 
Datum  _ltree_penalty (PG_FUNCTION_ARGS)
 
static int  comparecost (const void *a, const void *b)
 
Datum  _ltree_picksplit (PG_FUNCTION_ARGS)
 
static bool  gist_te (ltree_gist *key, ltree *query, int siglen)
 
static bool  checkcondition_bit (void *cxt, ITEM *val)
 
static bool  gist_qtxt (ltree_gist *key, ltxtquery *query, int siglen)
 
static bool  gist_qe (ltree_gist *key, lquery *query, int siglen)
 
static bool  _arrq_cons (ltree_gist *key, ArrayType *_query, int siglen)
 
Datum  _ltree_consistent (PG_FUNCTION_ARGS)
 
Datum  _ltree_gist_options (PG_FUNCTION_ARGS)
 

Macro Definition Documentation

◆ GETENTRY

#define GETENTRY (   vec,
  pos 
)    ((ltree_gist *) DatumGetPointer((vec)->vector[(pos)].key))

Definition at line 28 of file _ltree_gist.c.

◆ NEXTVAL

#define NEXTVAL (   x )    ( (ltree*)( (char*)(x) + INTALIGN( VARSIZE(x) ) ) )

Definition at line 29 of file _ltree_gist.c.

◆ WISH_F

#define WISH_F (   a,
  b,
  c 
)    (double)( -(double)(((a)-(b))*((a)-(b))*((a)-(b)))*(c) )

Definition at line 31 of file _ltree_gist.c.

Typedef Documentation

◆ LtreeSignature

typedef struct LtreeSignature LtreeSignature

Function Documentation

◆ _arrq_cons()

static bool _arrq_cons ( ltree_gist *  key,
ArrayType *  _query,
int  siglen 
)
static

Definition at line 481 of file _ltree_gist.c.

482{
483 lquery *query = (lquery *) ARR_DATA_PTR(_query);
484 int num = ArrayGetNItems(ARR_NDIM(_query), ARR_DIMS(_query));
485
486 if (ARR_NDIM(_query) > 1)
488 (errcode(ERRCODE_ARRAY_SUBSCRIPT_ERROR),
489 errmsg("array must be one-dimensional")));
490 if (array_contains_nulls(_query))
492 (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
493 errmsg("array must not contain nulls")));
494
495 while (num > 0)
496 {
497 if (gist_qe(key, query, siglen))
498 return true;
499 num--;
500 query = (lquery *) NEXTVAL(query);
501 }
502 return false;
503}
#define NEXTVAL(x)
Definition: _ltree_gist.c:29
static bool gist_qe(ltree_gist *key, lquery *query, int siglen)
Definition: _ltree_gist.c:442
#define ARR_NDIM(a)
Definition: array.h:290
#define ARR_DATA_PTR(a)
Definition: array.h:322
#define ARR_DIMS(a)
Definition: array.h:294
bool array_contains_nulls(ArrayType *array)
Definition: arrayfuncs.c:3767
int ArrayGetNItems(int ndim, const int *dims)
Definition: arrayutils.c:57
int errcode(int sqlerrcode)
Definition: elog.c:854
int errmsg(const char *fmt,...)
Definition: elog.c:1071
#define ERROR
Definition: elog.h:39
#define ereport(elevel,...)
Definition: elog.h:150
Definition: ltree.h:114

References ARR_DATA_PTR, ARR_DIMS, ARR_NDIM, array_contains_nulls(), ArrayGetNItems(), ereport, errcode(), errmsg(), ERROR, gist_qe(), sort-test::key, and NEXTVAL.

Referenced by _ltree_consistent().

◆ _ltree_compress()

Datum _ltree_compress ( PG_FUNCTION_ARGS  )

Definition at line 51 of file _ltree_gist.c.

52{
54 GISTENTRY *retval = entry;
55 int siglen = LTREE_GET_ASIGLEN();
56
57 if (entry->leafkey)
58 { /* ltree */
62 ltree *item = (ltree *) ARR_DATA_PTR(val);
63
64 if (ARR_NDIM(val) > 1)
66 (errcode(ERRCODE_ARRAY_SUBSCRIPT_ERROR),
67 errmsg("array must be one-dimensional")));
70 (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
71 errmsg("array must not contain nulls")));
72
73 key = ltree_gist_alloc(false, NULL, siglen, NULL, NULL);
74
75 while (num > 0)
76 {
77 hashing(LTG_SIGN(key), item, siglen);
78 num--;
79 item = NEXTVAL(item);
80 }
81
82 retval = (GISTENTRY *) palloc(sizeof(GISTENTRY));
84 entry->rel, entry->page,
85 entry->offset, false);
86 }
87 else if (!LTG_ISALLTRUE(DatumGetPointer(entry->key)))
88 {
89 int32 i;
92
93 ALOOPBYTE(siglen)
94 {
95 if ((sign[i] & 0xff) != 0xff)
96 PG_RETURN_POINTER(retval);
97 }
98
99 key = ltree_gist_alloc(true, sign, siglen, NULL, NULL);
100 retval = (GISTENTRY *) palloc(sizeof(GISTENTRY));
102 entry->rel, entry->page,
103 entry->offset, false);
104 }
105 PG_RETURN_POINTER(retval);
106}
static void hashing(BITVECP sign, ltree *t, int siglen)
Definition: _ltree_gist.c:35
#define DatumGetArrayTypeP(X)
Definition: array.h:261
int32_t int32
Definition: c.h:534
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
#define gistentryinit(e, k, r, pg, o, l)
Definition: gist.h:245
char * BITVECP
Definition: hstore_gist.c:31
long val
Definition: informix.c:689
char sign
Definition: informix.c:693
i
int i
Definition: isn.c:77
#define LTREE_GET_ASIGLEN()
Definition: ltree.h:297
#define ALOOPBYTE(siglen)
Definition: ltree.h:302
#define LTG_ISALLTRUE(x)
Definition: ltree.h:281
#define LTG_SIGN(x)
Definition: ltree.h:278
ltree_gist * ltree_gist_alloc(bool isalltrue, BITVECP sign, int siglen, ltree *left, ltree *right)
Definition: ltree_gist.c:42
void * palloc(Size size)
Definition: mcxt.c:1365
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:332
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:322
Definition: array.h:93
Definition: gist.h:160
OffsetNumber offset
Definition: gist.h:164
Datum key
Definition: gist.h:161
Page page
Definition: gist.h:163
Relation rel
Definition: gist.h:162
bool leafkey
Definition: gist.h:165
Definition: ltree.h:267
Definition: ltree.h:43

References ALOOPBYTE, ARR_DATA_PTR, ARR_DIMS, ARR_NDIM, array_contains_nulls(), ArrayGetNItems(), DatumGetArrayTypeP, DatumGetPointer(), ereport, errcode(), errmsg(), ERROR, gistentryinit, hashing(), i, GISTENTRY::key, sort-test::key, GISTENTRY::leafkey, LTG_ISALLTRUE, LTG_SIGN, LTREE_GET_ASIGLEN, ltree_gist_alloc(), NEXTVAL, GISTENTRY::offset, GISTENTRY::page, palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum(), GISTENTRY::rel, sign, and val.

◆ _ltree_consistent()

Datum _ltree_consistent ( PG_FUNCTION_ARGS  )

Definition at line 506 of file _ltree_gist.c.

507{
508 GISTENTRY *entry = (GISTENTRY *) PG_GETARG_POINTER(0);
509 void *query = PG_DETOAST_DATUM(PG_GETARG_DATUM(1));
511
512 /* Oid subtype = PG_GETARG_OID(3); */
513 bool *recheck = (bool *) PG_GETARG_POINTER(4);
514 int siglen = LTREE_GET_ASIGLEN();
516 bool res = false;
517
518 /* All cases served by this function are inexact */
519 *recheck = true;
520
521 switch (strategy)
522 {
523 case 10:
524 case 11:
525 res = gist_te(key, (ltree *) query, siglen);
526 break;
527 case 12:
528 case 13:
529 res = gist_qe(key, (lquery *) query, siglen);
530 break;
531 case 14:
532 case 15:
533 res = gist_qtxt(key, (ltxtquery *) query, siglen);
534 break;
535 case 16:
536 case 17:
537 res = _arrq_cons(key, (ArrayType *) query, siglen);
538 break;
539 default:
540 /* internal error */
541 elog(ERROR, "unrecognized StrategyNumber: %d", strategy);
542 }
543 PG_FREE_IF_COPY(query, 1);
544 PG_RETURN_BOOL(res);
545}
static bool _arrq_cons(ltree_gist *key, ArrayType *_query, int siglen)
Definition: _ltree_gist.c:481
static bool gist_te(ltree_gist *key, ltree *query, int siglen)
Definition: _ltree_gist.c:389
static bool gist_qtxt(ltree_gist *key, ltxtquery *query, int siglen)
Definition: _ltree_gist.c:426
#define elog(elevel,...)
Definition: elog.h:226
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:260
#define PG_GETARG_DATUM(n)
Definition: fmgr.h:268
#define PG_GETARG_UINT16(n)
Definition: fmgr.h:272
#define PG_DETOAST_DATUM(datum)
Definition: fmgr.h:240
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
uint16 StrategyNumber
Definition: stratnum.h:22
Definition: ltree.h:154

References _arrq_cons(), DatumGetPointer(), elog, ERROR, gist_qe(), gist_qtxt(), gist_te(), GISTENTRY::key, sort-test::key, LTREE_GET_ASIGLEN, PG_DETOAST_DATUM, PG_FREE_IF_COPY, PG_GETARG_DATUM, PG_GETARG_POINTER, PG_GETARG_UINT16, and PG_RETURN_BOOL.

◆ _ltree_gist_options()

Datum _ltree_gist_options ( PG_FUNCTION_ARGS  )

Definition at line 548 of file _ltree_gist.c.

549{
551
552 init_local_reloptions(relopts, sizeof(LtreeGistOptions));
553 add_local_int_reloption(relopts, "siglen", "signature length",
555 offsetof(LtreeGistOptions, siglen));
556
558}
#define PG_RETURN_VOID()
Definition: fmgr.h:349
#define LTREE_ASIGLEN_MAX
Definition: ltree.h:296
#define LTREE_ASIGLEN_DEFAULT
Definition: ltree.h:295
void init_local_reloptions(local_relopts *relopts, Size relopt_struct_size)
Definition: reloptions.c:745
void add_local_int_reloption(local_relopts *relopts, const char *name, const char *desc, int default_val, int min_val, int max_val, int offset)
Definition: reloptions.c:929
Definition: reloptions.h:179

References add_local_int_reloption(), init_local_reloptions(), LTREE_ASIGLEN_DEFAULT, LTREE_ASIGLEN_MAX, PG_GETARG_POINTER, and PG_RETURN_VOID.

◆ _ltree_penalty()

Datum _ltree_penalty ( PG_FUNCTION_ARGS  )

Definition at line 220 of file _ltree_gist.c.

221{
224 float *penalty = (float *) PG_GETARG_POINTER(2);
225 int siglen = LTREE_GET_ASIGLEN();
226
227 *penalty = hemdist(origval, newval, siglen);
228 PG_RETURN_POINTER(penalty);
229}
static int hemdist(ltree_gist *a, ltree_gist *b, int siglen)
Definition: _ltree_gist.c:203
#define newval

References DatumGetPointer(), hemdist(), sort-test::key, LTREE_GET_ASIGLEN, newval, PG_GETARG_POINTER, and PG_RETURN_POINTER.

◆ _ltree_picksplit()

Datum _ltree_picksplit ( PG_FUNCTION_ARGS  )

Definition at line 244 of file _ltree_gist.c.

245{
248 int siglen = LTREE_GET_ASIGLEN();
249 OffsetNumber k,
250 j;
251 ltree_gist *datum_l,
252 *datum_r;
253 BITVECP union_l,
254 union_r;
255 int32 size_alpha,
256 size_beta;
257 int32 size_waste,
258 waste = -1;
259 int32 nbytes;
260 OffsetNumber seed_1 = 0,
261 seed_2 = 0;
262 OffsetNumber *left,
263 *right;
264 OffsetNumber maxoff;
265 BITVECP ptr;
266 int i;
267 SPLITCOST *costvector;
268 ltree_gist *_k,
269 *_j;
270
271 maxoff = entryvec->n - 2;
272 nbytes = (maxoff + 2) * sizeof(OffsetNumber);
273 v->spl_left = (OffsetNumber *) palloc(nbytes);
274 v->spl_right = (OffsetNumber *) palloc(nbytes);
275
276 for (k = FirstOffsetNumber; k < maxoff; k = OffsetNumberNext(k))
277 {
278 _k = GETENTRY(entryvec, k);
279 for (j = OffsetNumberNext(k); j <= maxoff; j = OffsetNumberNext(j))
280 {
281 size_waste = hemdist(_k, GETENTRY(entryvec, j), siglen);
282 if (size_waste > waste)
283 {
284 waste = size_waste;
285 seed_1 = k;
286 seed_2 = j;
287 }
288 }
289 }
290
291 left = v->spl_left;
292 v->spl_nleft = 0;
293 right = v->spl_right;
294 v->spl_nright = 0;
295
296 if (seed_1 == 0 || seed_2 == 0)
297 {
298 seed_1 = 1;
299 seed_2 = 2;
300 }
301
302 /* form initial .. */
303 datum_l = ltree_gist_alloc(LTG_ISALLTRUE(GETENTRY(entryvec, seed_1)),
304 LTG_SIGN(GETENTRY(entryvec, seed_1)),
305 siglen, NULL, NULL);
306
307 datum_r = ltree_gist_alloc(LTG_ISALLTRUE(GETENTRY(entryvec, seed_2)),
308 LTG_SIGN(GETENTRY(entryvec, seed_2)),
309 siglen, NULL, NULL);
310
311 maxoff = OffsetNumberNext(maxoff);
312 /* sort before ... */
313 costvector = (SPLITCOST *) palloc(sizeof(SPLITCOST) * maxoff);
314 for (j = FirstOffsetNumber; j <= maxoff; j = OffsetNumberNext(j))
315 {
316 costvector[j - 1].pos = j;
317 _j = GETENTRY(entryvec, j);
318 size_alpha = hemdist(datum_l, _j, siglen);
319 size_beta = hemdist(datum_r, _j, siglen);
320 costvector[j - 1].cost = abs(size_alpha - size_beta);
321 }
322 qsort(costvector, maxoff, sizeof(SPLITCOST), comparecost);
323
324 union_l = LTG_SIGN(datum_l);
325 union_r = LTG_SIGN(datum_r);
326
327 for (k = 0; k < maxoff; k++)
328 {
329 j = costvector[k].pos;
330 if (j == seed_1)
331 {
332 *left++ = j;
333 v->spl_nleft++;
334 continue;
335 }
336 else if (j == seed_2)
337 {
338 *right++ = j;
339 v->spl_nright++;
340 continue;
341 }
342 _j = GETENTRY(entryvec, j);
343 size_alpha = hemdist(datum_l, _j, siglen);
344 size_beta = hemdist(datum_r, _j, siglen);
345
346 if (size_alpha < size_beta + WISH_F(v->spl_nleft, v->spl_nright, 0.00001))
347 {
348 if (LTG_ISALLTRUE(datum_l) || LTG_ISALLTRUE(_j))
349 {
350 if (!LTG_ISALLTRUE(datum_l))
351 memset(union_l, 0xff, siglen);
352 }
353 else
354 {
355 ptr = LTG_SIGN(_j);
356 ALOOPBYTE(siglen)
357 union_l[i] |= ptr[i];
358 }
359 *left++ = j;
360 v->spl_nleft++;
361 }
362 else
363 {
364 if (LTG_ISALLTRUE(datum_r) || LTG_ISALLTRUE(_j))
365 {
366 if (!LTG_ISALLTRUE(datum_r))
367 memset(union_r, 0xff, siglen);
368 }
369 else
370 {
371 ptr = LTG_SIGN(_j);
372 ALOOPBYTE(siglen)
373 union_r[i] |= ptr[i];
374 }
375 *right++ = j;
376 v->spl_nright++;
377 }
378 }
379
380 *right = *left = FirstOffsetNumber;
381
382 v->spl_ldatum = PointerGetDatum(datum_l);
383 v->spl_rdatum = PointerGetDatum(datum_r);
384
386}
#define WISH_F(a, b, c)
Definition: _ltree_gist.c:31
#define GETENTRY(vec, pos)
Definition: _ltree_gist.c:28
static int comparecost(const void *a, const void *b)
Definition: _ltree_gist.c:238
j
int j
Definition: isn.c:78
#define OffsetNumberNext(offsetNumber)
Definition: off.h:52
uint16 OffsetNumber
Definition: off.h:24
#define FirstOffsetNumber
Definition: off.h:27
#define qsort(a, b, c, d)
Definition: port.h:479
Definition: gist.h:142
int spl_nleft
Definition: gist.h:144
OffsetNumber * spl_right
Definition: gist.h:148
Datum spl_ldatum
Definition: gist.h:145
Datum spl_rdatum
Definition: gist.h:150
int spl_nright
Definition: gist.h:149
OffsetNumber * spl_left
Definition: gist.h:143
int32 n
Definition: gist.h:236
int32 cost
Definition: hstore_gist.c:354
OffsetNumber pos
Definition: hstore_gist.c:353

References ALOOPBYTE, comparecost(), SPLITCOST::cost, FirstOffsetNumber, GETENTRY, hemdist(), i, j, LTG_ISALLTRUE, LTG_SIGN, LTREE_GET_ASIGLEN, ltree_gist_alloc(), GistEntryVector::n, OffsetNumberNext, palloc(), PG_GETARG_POINTER, PG_RETURN_POINTER, PointerGetDatum(), SPLITCOST::pos, qsort, GIST_SPLITVEC::spl_ldatum, GIST_SPLITVEC::spl_left, GIST_SPLITVEC::spl_nleft, GIST_SPLITVEC::spl_nright, GIST_SPLITVEC::spl_rdatum, GIST_SPLITVEC::spl_right, and WISH_F.

◆ _ltree_same()

Datum _ltree_same ( PG_FUNCTION_ARGS  )

Definition at line 109 of file _ltree_gist.c.

110{
113 bool *result = (bool *) PG_GETARG_POINTER(2);
114 int siglen = LTREE_GET_ASIGLEN();
115
117 *result = true;
118 else if (LTG_ISALLTRUE(a))
119 *result = false;
120 else if (LTG_ISALLTRUE(b))
121 *result = false;
122 else
123 {
124 int32 i;
125 BITVECP sa = LTG_SIGN(a),
126 sb = LTG_SIGN(b);
127
128 *result = true;
129 ALOOPBYTE(siglen)
130 {
131 if (sa[i] != sb[i])
132 {
133 *result = false;
134 break;
135 }
136 }
137 }
138 PG_RETURN_POINTER(result);
139}
b
int b
Definition: isn.c:74
a
int a
Definition: isn.c:73
Definition: preproc-init.c:83

References a, ALOOPBYTE, b, i, LTG_ISALLTRUE, LTG_SIGN, LTREE_GET_ASIGLEN, PG_GETARG_POINTER, and PG_RETURN_POINTER.

◆ _ltree_union()

Datum _ltree_union ( PG_FUNCTION_ARGS  )

Definition at line 156 of file _ltree_gist.c.

157{
159 int *size = (int *) PG_GETARG_POINTER(1);
160 int siglen = LTREE_GET_ASIGLEN();
161 int32 i;
162 ltree_gist *result = ltree_gist_alloc(false, NULL, siglen, NULL, NULL);
163 BITVECP base = LTG_SIGN(result);
164
165 for (i = 0; i < entryvec->n; i++)
166 {
167 if (unionkey(base, GETENTRY(entryvec, i), siglen))
168 {
169 result->flag |= LTG_ALLTRUE;
170 SET_VARSIZE(result, LTG_HDRSIZE);
171 break;
172 }
173 }
174
175 *size = VARSIZE(result);
176
177 PG_RETURN_POINTER(result);
178}
static int32 unionkey(BITVECP sbase, ltree_gist *add, int siglen)
Definition: _ltree_gist.c:142
#define LTG_HDRSIZE
Definition: ltree.h:277
#define LTG_ALLTRUE
Definition: ltree.h:274
uint32 flag
Definition: ltree.h:269
static Size VARSIZE(const void *PTR)
Definition: varatt.h:298
static void SET_VARSIZE(void *PTR, Size len)
Definition: varatt.h:432

References ltree_gist::flag, GETENTRY, i, LTG_ALLTRUE, LTG_HDRSIZE, LTG_SIGN, LTREE_GET_ASIGLEN, ltree_gist_alloc(), GistEntryVector::n, PG_GETARG_POINTER, PG_RETURN_POINTER, SET_VARSIZE(), unionkey(), and VARSIZE().

◆ checkcondition_bit()

static bool checkcondition_bit ( void *  cxt,
ITEM *  val 
)
static

Definition at line 418 of file _ltree_gist.c.

419{
420 LtreeSignature *sig = cxt;
421
422 return (FLG_CANLOOKSIGN(val->flag)) ? GETBIT(sig->sign, AHASHVAL(val->val, sig->siglen)) : true;
423}
#define GETBIT(x, i)
Definition: blutils.c:30
return true
Definition: isn.c:130
#define FLG_CANLOOKSIGN(x)
Definition: ltree.h:107
#define AHASHVAL(val, siglen)
Definition: ltree.h:305
static int sig
Definition: pg_ctl.c:80

References AHASHVAL, FLG_CANLOOKSIGN, GETBIT, sig, and val.

Referenced by gist_qtxt().

◆ comparecost()

static int comparecost ( const void *  a,
const void *  b 
)
static

Definition at line 238 of file _ltree_gist.c.

239{
240 return ((const SPLITCOST *) a)->cost - ((const SPLITCOST *) b)->cost;
241}

References a, and b.

Referenced by _ltree_picksplit().

◆ gist_qe()

static bool gist_qe ( ltree_gist *  key,
lquery *  query,
int  siglen 
)
static

Definition at line 442 of file _ltree_gist.c.

443{
444 lquery_level *curq = LQUERY_FIRST(query);
446 int qlen = query->numlevel;
447
448 if (LTG_ISALLTRUE(key))
449 return true;
450
451 while (qlen > 0)
452 {
453 if (curq->numvar && LQL_CANLOOKSIGN(curq))
454 {
455 bool isexist = false;
456 int vlen = curq->numvar;
457 lquery_variant *curv = LQL_FIRST(curq);
458
459 while (vlen > 0)
460 {
461 if (GETBIT(sign, AHASHVAL(curv->val, siglen)))
462 {
463 isexist = true;
464 break;
465 }
466 curv = LVAR_NEXT(curv);
467 vlen--;
468 }
469 if (!isexist)
470 return false;
471 }
472
473 curq = LQL_NEXT(curq);
474 qlen--;
475 }
476
477 return true;
478}
#define LQL_CANLOOKSIGN(x)
Definition: ltree.h:111
#define LQL_FIRST(x)
Definition: ltree.h:101
#define LVAR_NEXT(x)
Definition: ltree.h:72
#define LQL_NEXT(x)
Definition: ltree.h:100
#define LQUERY_FIRST(x)
Definition: ltree.h:124
Definition: ltree.h:89
uint16 numvar
Definition: ltree.h:92
Definition: ltree.h:59
int32 val
Definition: ltree.h:60
uint16 numlevel
Definition: ltree.h:116

References AHASHVAL, GETBIT, sort-test::key, LQL_CANLOOKSIGN, LQL_FIRST, LQL_NEXT, LQUERY_FIRST, LTG_ISALLTRUE, LTG_SIGN, LVAR_NEXT, lquery::numlevel, lquery_level::numvar, sign, and lquery_variant::val.

Referenced by _arrq_cons(), and _ltree_consistent().

◆ gist_qtxt()

static bool gist_qtxt ( ltree_gist *  key,
ltxtquery *  query,
int  siglen 
)
static

Definition at line 426 of file _ltree_gist.c.

427{
429
430 if (LTG_ISALLTRUE(key))
431 return true;
432
433 sig.sign = LTG_SIGN(key);
434 sig.siglen = siglen;
435
436 return ltree_execute(GETQUERY(query),
437 &sig, false,
439}
#define GETQUERY(x)
Definition: _int.h:157
static bool checkcondition_bit(void *cxt, ITEM *val)
Definition: _ltree_gist.c:418
bool ltree_execute(ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *val))
Definition: ltxtquery_op.c:20

References checkcondition_bit(), GETQUERY, sort-test::key, LTG_ISALLTRUE, LTG_SIGN, ltree_execute(), and sig.

Referenced by _ltree_consistent().

◆ gist_te()

static bool gist_te ( ltree_gist *  key,
ltree *  query,
int  siglen 
)
static

Definition at line 389 of file _ltree_gist.c.

390{
391 ltree_level *curq = LTREE_FIRST(query);
393 int qlen = query->numlevel;
394 unsigned int hv;
395
396 if (LTG_ISALLTRUE(key))
397 return true;
398
399 while (qlen > 0)
400 {
401 hv = ltree_crc32_sz(curq->name, curq->len);
402 if (!GETBIT(sign, AHASHVAL(hv, siglen)))
403 return false;
404 curq = LEVEL_NEXT(curq);
405 qlen--;
406 }
407
408 return true;
409}
unsigned int ltree_crc32_sz(const char *buf, int size)
Definition: crc32.c:24
#define LTREE_FIRST(x)
Definition: ltree.h:51
#define LEVEL_NEXT(x)
Definition: ltree.h:40
Definition: ltree.h:34
char name[FLEXIBLE_ARRAY_MEMBER]
Definition: ltree.h:36
uint16 len
Definition: ltree.h:35
uint16 numlevel
Definition: ltree.h:45

References AHASHVAL, GETBIT, sort-test::key, ltree_level::len, LEVEL_NEXT, LTG_ISALLTRUE, LTG_SIGN, ltree_crc32_sz(), LTREE_FIRST, ltree_level::name, ltree::numlevel, and sign.

Referenced by _ltree_consistent().

◆ hashing()

static void hashing ( BITVECP  sign,
ltree *  t,
int  siglen 
)
static

Definition at line 35 of file _ltree_gist.c.

36{
37 int tlen = t->numlevel;
39 int hash;
40
41 while (tlen > 0)
42 {
43 hash = ltree_crc32_sz(cur->name, cur->len);
44 AHASH(sign, hash, siglen);
46 tlen--;
47 }
48}
struct cursor * cur
Definition: ecpg.c:29
#define AHASH(sign, val, siglen)
Definition: ltree.h:306
static unsigned hash(unsigned *uv, int n)
Definition: rege_dfa.c:715
char * name
Definition: type.h:139

References AHASH, cur, hash(), LEVEL_NEXT, ltree_crc32_sz(), LTREE_FIRST, cursor::name, ltree::numlevel, and sign.

Referenced by _ltree_compress().

◆ hemdist()

static int hemdist ( ltree_gist *  a,
ltree_gist *  b,
int  siglen 
)
static

Definition at line 203 of file _ltree_gist.c.

204{
205 if (LTG_ISALLTRUE(a))
206 {
207 if (LTG_ISALLTRUE(b))
208 return 0;
209 else
210 return ASIGLENBIT(siglen) - sizebitvec(LTG_SIGN(b), siglen);
211 }
212 else if (LTG_ISALLTRUE(b))
213 return ASIGLENBIT(siglen) - sizebitvec(LTG_SIGN(a), siglen);
214
215 return hemdistsign(LTG_SIGN(a), LTG_SIGN(b), siglen);
216}
static int32 sizebitvec(BITVECP sign, int siglen)
Definition: _ltree_gist.c:181
static int hemdistsign(BITVECP a, BITVECP b, int siglen)
Definition: _ltree_gist.c:187
#define ASIGLENBIT(siglen)
Definition: ltree.h:300

References a, ASIGLENBIT, b, hemdistsign(), LTG_ISALLTRUE, LTG_SIGN, and sizebitvec().

Referenced by _ltree_penalty(), and _ltree_picksplit().

◆ hemdistsign()

static int hemdistsign ( BITVECP  a,
BITVECP  b,
int  siglen 
)
static

Definition at line 187 of file _ltree_gist.c.

188{
189 int i,
190 diff,
191 dist = 0;
192
193 ALOOPBYTE(siglen)
194 {
195 diff = (unsigned char) (a[i] ^ b[i]);
196 /* Using the popcount functions here isn't likely to win */
197 dist += pg_number_of_ones[diff];
198 }
199 return dist;
200}
PGDLLIMPORT const uint8 pg_number_of_ones[256]
Definition: pg_bitutils.c:87

References a, ALOOPBYTE, b, i, and pg_number_of_ones.

Referenced by hemdist().

◆ PG_FUNCTION_INFO_V1() [1/7]

PG_FUNCTION_INFO_V1 ( _ltree_compress  )

◆ PG_FUNCTION_INFO_V1() [2/7]

PG_FUNCTION_INFO_V1 ( _ltree_consistent  )

◆ PG_FUNCTION_INFO_V1() [3/7]

PG_FUNCTION_INFO_V1 ( _ltree_gist_options  )

◆ PG_FUNCTION_INFO_V1() [4/7]

PG_FUNCTION_INFO_V1 ( _ltree_penalty  )

◆ PG_FUNCTION_INFO_V1() [5/7]

PG_FUNCTION_INFO_V1 ( _ltree_picksplit  )

◆ PG_FUNCTION_INFO_V1() [6/7]

PG_FUNCTION_INFO_V1 ( _ltree_same  )

◆ PG_FUNCTION_INFO_V1() [7/7]

PG_FUNCTION_INFO_V1 ( _ltree_union  )

◆ sizebitvec()

static int32 sizebitvec ( BITVECP  sign,
int  siglen 
)
static

Definition at line 181 of file _ltree_gist.c.

182{
183 return pg_popcount((const char *) sign, siglen);
184}
static uint64 pg_popcount(const char *buf, int bytes)
Definition: pg_bitutils.h:363

References pg_popcount(), and sign.

Referenced by hemdist().

◆ unionkey()

static int32 unionkey ( BITVECP  sbase,
ltree_gist *  add,
int  siglen 
)
static

Definition at line 142 of file _ltree_gist.c.

143{
144 int32 i;
145 BITVECP sadd = LTG_SIGN(add);
146
147 if (LTG_ISALLTRUE(add))
148 return 1;
149
150 ALOOPBYTE(siglen)
151 sbase[i] |= sadd[i];
152 return 0;
153}

References ALOOPBYTE, i, LTG_ISALLTRUE, and LTG_SIGN.

Referenced by _ltree_union().

AltStyle によって変換されたページ (->オリジナル) /