PostgreSQL Source Code git master
ltree_op.c File Reference
#include "postgres.h"
#include <ctype.h>
#include "common/hashfn.h"
#include "ltree.h"
#include "utils/builtins.h"
#include "utils/selfuncs.h"
#include "varatt.h"
Include dependency graph for ltree_op.c:

Go to the source code of this file.

Macros

#define RUNCMP
 

Functions

 PG_FUNCTION_INFO_V1 (ltree_cmp)
 
 PG_FUNCTION_INFO_V1 (ltree_lt)
 
 PG_FUNCTION_INFO_V1 (ltree_le)
 
 PG_FUNCTION_INFO_V1 (ltree_eq)
 
 PG_FUNCTION_INFO_V1 (ltree_ne)
 
 PG_FUNCTION_INFO_V1 (ltree_ge)
 
 PG_FUNCTION_INFO_V1 (ltree_gt)
 
 PG_FUNCTION_INFO_V1 (hash_ltree)
 
 PG_FUNCTION_INFO_V1 (hash_ltree_extended)
 
 PG_FUNCTION_INFO_V1 (nlevel)
 
 PG_FUNCTION_INFO_V1 (ltree_isparent)
 
 PG_FUNCTION_INFO_V1 (ltree_risparent)
 
 PG_FUNCTION_INFO_V1 (subltree)
 
 PG_FUNCTION_INFO_V1 (subpath)
 
 PG_FUNCTION_INFO_V1 (ltree_index)
 
 PG_FUNCTION_INFO_V1 (ltree_addltree)
 
 PG_FUNCTION_INFO_V1 (ltree_addtext)
 
 PG_FUNCTION_INFO_V1 (ltree_textadd)
 
 PG_FUNCTION_INFO_V1 (lca)
 
 PG_FUNCTION_INFO_V1 (ltree2text)
 
 PG_FUNCTION_INFO_V1 (text2ltree)
 
 PG_FUNCTION_INFO_V1 (ltreeparentsel)
 
int ltree_compare (const ltree *a, const ltree *b)
 
Datum ltree_cmp (PG_FUNCTION_ARGS)
 
Datum ltree_lt (PG_FUNCTION_ARGS)
 
Datum ltree_le (PG_FUNCTION_ARGS)
 
Datum ltree_eq (PG_FUNCTION_ARGS)
 
Datum ltree_ge (PG_FUNCTION_ARGS)
 
Datum ltree_gt (PG_FUNCTION_ARGS)
 
Datum ltree_ne (PG_FUNCTION_ARGS)
 
Datum hash_ltree (PG_FUNCTION_ARGS)
 
Datum hash_ltree_extended (PG_FUNCTION_ARGS)
 
Datum nlevel (PG_FUNCTION_ARGS)
 
bool inner_isparent (const ltree *c, const ltree *p)
 
Datum ltree_isparent (PG_FUNCTION_ARGS)
 
Datum ltree_risparent (PG_FUNCTION_ARGS)
 
static ltreeinner_subltree (ltree *t, int32 startpos, int32 endpos)
 
Datum subltree (PG_FUNCTION_ARGS)
 
Datum subpath (PG_FUNCTION_ARGS)
 
static ltreeltree_concat (ltree *a, ltree *b)
 
Datum ltree_addltree (PG_FUNCTION_ARGS)
 
Datum ltree_addtext (PG_FUNCTION_ARGS)
 
Datum ltree_index (PG_FUNCTION_ARGS)
 
Datum ltree_textadd (PG_FUNCTION_ARGS)
 
ltreelca_inner (ltree **a, int len)
 
Datum lca (PG_FUNCTION_ARGS)
 
Datum text2ltree (PG_FUNCTION_ARGS)
 
Datum ltree2text (PG_FUNCTION_ARGS)
 
Datum ltreeparentsel (PG_FUNCTION_ARGS)
 

Variables

 PG_MODULE_MAGIC
 

Macro Definition Documentation

◆ RUNCMP

#define RUNCMP
Value:
ltree *b = PG_GETARG_LTREE_P(1); \
int res = ltree_compare(a,b); \
PG_FREE_IF_COPY(a,0); \
PG_FREE_IF_COPY(b,1)
int b
Definition: isn.c:69
int a
Definition: isn.c:68
#define PG_GETARG_LTREE_P(n)
Definition: ltree.h:218
int ltree_compare(const ltree *a, const ltree *b)
Definition: ltree_op.c:43
Definition: ltree.h:43

Definition at line 77 of file ltree_op.c.

Function Documentation

◆ hash_ltree()

Datum hash_ltree ( PG_FUNCTION_ARGS  )

Definition at line 135 of file ltree_op.c.

136{
138 uint32 result = 1;
139 int an = a->numlevel;
141
142 while (an > 0)
143 {
144 uint32 levelHash = DatumGetUInt32(hash_any((unsigned char *) al->name, al->len));
145
146 /*
147 * Combine hash values of successive elements by multiplying the
148 * current value by 31 and adding on the new element's hash value.
149 *
150 * This method is borrowed from hash_array(), which see for further
151 * commentary.
152 */
153 result = (result << 5) - result + levelHash;
154
155 an--;
156 al = LEVEL_NEXT(al);
157 }
158
159 PG_FREE_IF_COPY(a, 0);
160 PG_RETURN_UINT32(result);
161}
uint32_t uint32
Definition: c.h:488
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:260
#define PG_RETURN_UINT32(x)
Definition: fmgr.h:355
static Datum hash_any(const unsigned char *k, int keylen)
Definition: hashfn.h:31
#define LTREE_FIRST(x)
Definition: ltree.h:51
#define LEVEL_NEXT(x)
Definition: ltree.h:40
static uint32 DatumGetUInt32(Datum X)
Definition: postgres.h:227
char name[FLEXIBLE_ARRAY_MEMBER]
Definition: ltree.h:36
uint16 len
Definition: ltree.h:35

References a, DatumGetUInt32(), hash_any(), ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, PG_FREE_IF_COPY, PG_GETARG_LTREE_P, and PG_RETURN_UINT32.

◆ hash_ltree_extended()

Datum hash_ltree_extended ( PG_FUNCTION_ARGS  )

Definition at line 165 of file ltree_op.c.

166{
168 const uint64 seed = PG_GETARG_INT64(1);
169 uint64 result = 1;
170 int an = a->numlevel;
172
173 /*
174 * If the path has length zero, return 1 + seed to ensure that the low 32
175 * bits of the result match hash_ltree when the seed is 0, as required by
176 * the hash index support functions, but to also return a different value
177 * when there is a seed.
178 */
179 if (an == 0)
180 {
181 PG_FREE_IF_COPY(a, 0);
182 PG_RETURN_UINT64(result + seed);
183 }
184
185 while (an > 0)
186 {
187 uint64 levelHash = DatumGetUInt64(hash_any_extended((unsigned char *) al->name, al->len, seed));
188
189 result = (result << 5) - result + levelHash;
190
191 an--;
192 al = LEVEL_NEXT(al);
193 }
194
195 PG_FREE_IF_COPY(a, 0);
196 PG_RETURN_UINT64(result);
197}
uint64_t uint64
Definition: c.h:489
#define PG_GETARG_INT64(n)
Definition: fmgr.h:283
#define PG_RETURN_UINT64(x)
Definition: fmgr.h:369
static Datum hash_any_extended(const unsigned char *k, int keylen, uint64 seed)
Definition: hashfn.h:37
static uint64 DatumGetUInt64(Datum X)
Definition: postgres.h:424

References a, DatumGetUInt64(), hash_any_extended(), ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, PG_FREE_IF_COPY, PG_GETARG_INT64, PG_GETARG_LTREE_P, and PG_RETURN_UINT64.

◆ inner_isparent()

bool inner_isparent ( const ltree c,
const ltree p 
)

Definition at line 210 of file ltree_op.c.

211{
213 ltree_level *pl = LTREE_FIRST(p);
214 int pn = p->numlevel;
215
216 if (pn > c->numlevel)
217 return false;
218
219 while (pn > 0)
220 {
221 if (cl->len != pl->len)
222 return false;
223 if (memcmp(cl->name, pl->name, cl->len) != 0)
224 return false;
225
226 pn--;
227 cl = LEVEL_NEXT(cl);
228 pl = LEVEL_NEXT(pl);
229 }
230 return true;
231}
char * c
uint16 numlevel
Definition: ltree.h:45

References ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, and ltree::numlevel.

Referenced by ltree_consistent(), ltree_isparent(), and ltree_risparent().

◆ inner_subltree()

static ltree * inner_subltree ( ltree t,
int32  startpos,
int32  endpos 
)
static

Definition at line 259 of file ltree_op.c.

260{
261 char *start = NULL,
262 *end = NULL;
263 ltree_level *ptr = LTREE_FIRST(t);
264 ltree *res;
265 int i;
266
267 if (startpos < 0 || endpos < 0 || startpos >= t->numlevel || startpos > endpos)
269 (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
270 errmsg("invalid positions")));
271
272 if (endpos > t->numlevel)
273 endpos = t->numlevel;
274
275 start = end = (char *) ptr;
276 for (i = 0; i < endpos; i++)
277 {
278 if (i == startpos)
279 start = (char *) ptr;
280 if (i == endpos - 1)
281 {
282 end = (char *) LEVEL_NEXT(ptr);
283 break;
284 }
285 ptr = LEVEL_NEXT(ptr);
286 }
287
288 res = (ltree *) palloc0(LTREE_HDRSIZE + (end - start));
290 res->numlevel = endpos - startpos;
291
292 memcpy(LTREE_FIRST(res), start, end - start);
293
294 return res;
295}
int errcode(int sqlerrcode)
Definition: elog.c:853
int errmsg(const char *fmt,...)
Definition: elog.c:1070
#define ERROR
Definition: elog.h:39
#define ereport(elevel,...)
Definition: elog.h:149
return str start
int i
Definition: isn.c:72
#define LTREE_HDRSIZE
Definition: ltree.h:50
void * palloc0(Size size)
Definition: mcxt.c:1347
static XLogRecPtr endpos
Definition: pg_receivewal.c:56
static XLogRecPtr startpos
#define SET_VARSIZE(PTR, len)
Definition: varatt.h:305

References endpos, ereport, errcode(), errmsg(), ERROR, i, LEVEL_NEXT, LTREE_FIRST, LTREE_HDRSIZE, ltree::numlevel, palloc0(), res, SET_VARSIZE, start, and startpos.

Referenced by subltree(), and subpath().

◆ lca()

Definition at line 568 of file ltree_op.c.

569{
570 int i;
571 ltree **a,
572 *res;
573
574 a = (ltree **) palloc(sizeof(ltree *) * fcinfo->nargs);
575 for (i = 0; i < fcinfo->nargs; i++)
577 res = lca_inner(a, (int) fcinfo->nargs);
578 for (i = 0; i < fcinfo->nargs; i++)
579 PG_FREE_IF_COPY(a[i], i);
580 pfree(a);
581
582 if (res)
584 else
586}
#define PG_RETURN_NULL()
Definition: fmgr.h:345
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
ltree * lca_inner(ltree **a, int len)
Definition: ltree_op.c:493
void pfree(void *pointer)
Definition: mcxt.c:1521
void * palloc(Size size)
Definition: mcxt.c:1317

References a, i, lca_inner(), palloc(), pfree(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_NULL, PG_RETURN_POINTER, and res.

Referenced by cmp_list_len_contents_asc(), fix_indexqual_clause(), mbms_add_members(), mbms_int_members(), mbms_overlap_sets(), and set_plan_refs().

◆ lca_inner()

ltree * lca_inner ( ltree **  a,
int  len 
)

Definition at line 493 of file ltree_op.c.

494{
495 int tmp,
496 num,
497 i,
498 reslen;
499 ltree **ptr;
500 ltree_level *l1,
501 *l2;
502 ltree *res;
503
504 if (len <= 0)
505 return NULL; /* no inputs? */
506 if ((*a)->numlevel == 0)
507 return NULL; /* any empty input means NULL result */
508
509 /* num is the length of the longest common ancestor so far */
510 num = (*a)->numlevel - 1;
511
512 /* Compare each additional input to *a */
513 ptr = a + 1;
514 while (ptr - a < len)
515 {
516 if ((*ptr)->numlevel == 0)
517 return NULL;
518 else if ((*ptr)->numlevel == 1)
519 num = 0;
520 else
521 {
522 l1 = LTREE_FIRST(*a);
523 l2 = LTREE_FIRST(*ptr);
524 tmp = Min(num, (*ptr)->numlevel - 1);
525 num = 0;
526 for (i = 0; i < tmp; i++)
527 {
528 if (l1->len == l2->len &&
529 memcmp(l1->name, l2->name, l1->len) == 0)
530 num = i + 1;
531 else
532 break;
533 l1 = LEVEL_NEXT(l1);
534 l2 = LEVEL_NEXT(l2);
535 }
536 }
537 ptr++;
538 }
539
540 /* Now compute size of result ... */
541 reslen = LTREE_HDRSIZE;
542 l1 = LTREE_FIRST(*a);
543 for (i = 0; i < num; i++)
544 {
545 reslen += MAXALIGN(l1->len + LEVEL_HDRSIZE);
546 l1 = LEVEL_NEXT(l1);
547 }
548
549 /* ... and construct it by copying from *a */
550 res = (ltree *) palloc0(reslen);
551 SET_VARSIZE(res, reslen);
552 res->numlevel = num;
553
554 l1 = LTREE_FIRST(*a);
555 l2 = LTREE_FIRST(res);
556
557 for (i = 0; i < num; i++)
558 {
559 memcpy(l2, l1, MAXALIGN(l1->len + LEVEL_HDRSIZE));
560 l1 = LEVEL_NEXT(l1);
561 l2 = LEVEL_NEXT(l2);
562 }
563
564 return res;
565}
#define Min(x, y)
Definition: c.h:961
#define MAXALIGN(LEN)
Definition: c.h:768
#define LEVEL_HDRSIZE
Definition: ltree.h:39
const void size_t len

References a, i, ltree_level::len, len, LEVEL_HDRSIZE, LEVEL_NEXT, LTREE_FIRST, LTREE_HDRSIZE, MAXALIGN, Min, ltree_level::name, palloc0(), res, and SET_VARSIZE.

Referenced by _lca(), and lca().

◆ ltree2text()

Datum ltree2text ( PG_FUNCTION_ARGS  )

Definition at line 606 of file ltree_op.c.

607{
608 ltree *in = PG_GETARG_LTREE_P(0);
609 char *ptr;
610 int i;
611 ltree_level *curlevel;
612 text *out;
613
614 out = (text *) palloc(VARSIZE(in) + VARHDRSZ);
615 ptr = VARDATA(out);
616 curlevel = LTREE_FIRST(in);
617 for (i = 0; i < in->numlevel; i++)
618 {
619 if (i != 0)
620 {
621 *ptr = '.';
622 ptr++;
623 }
624 memcpy(ptr, curlevel->name, curlevel->len);
625 ptr += curlevel->len;
626 curlevel = LEVEL_NEXT(curlevel);
627 }
628
629 SET_VARSIZE(out, ptr - ((char *) out));
630 PG_FREE_IF_COPY(in, 0);
631
633}
#define VARHDRSZ
Definition: c.h:649
Definition: c.h:644
#define VARDATA(PTR)
Definition: varatt.h:278
#define VARSIZE(PTR)
Definition: varatt.h:279

References i, ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, ltree::numlevel, palloc(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_POINTER, SET_VARSIZE, VARDATA, VARHDRSZ, and VARSIZE.

◆ ltree_addltree()

Datum ltree_addltree ( PG_FUNCTION_ARGS  )

Definition at line 364 of file ltree_op.c.

365{
368 ltree *r;
369
370 r = ltree_concat(a, b);
371 PG_FREE_IF_COPY(a, 0);
372 PG_FREE_IF_COPY(b, 1);
374}
static ltree * ltree_concat(ltree *a, ltree *b)
Definition: ltree_op.c:341

References a, b, ltree_concat(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, and PG_RETURN_POINTER.

◆ ltree_addtext()

Datum ltree_addtext ( PG_FUNCTION_ARGS  )

Definition at line 377 of file ltree_op.c.

378{
381 char *s;
382 ltree *r,
383 *tmp;
384
385 s = text_to_cstring(b);
386
388 PointerGetDatum(s)));
389
390 pfree(s);
391
392 r = ltree_concat(a, tmp);
393
394 pfree(tmp);
395
396 PG_FREE_IF_COPY(a, 0);
397 PG_FREE_IF_COPY(b, 1);
399}
#define PG_GETARG_TEXT_PP(n)
Definition: fmgr.h:309
#define DirectFunctionCall1(func, arg1)
Definition: fmgr.h:641
PGDLLEXPORT Datum ltree_in(PG_FUNCTION_ARGS)
Definition: ltree_io.c:174
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:327
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:317
char * text_to_cstring(const text *t)
Definition: varlena.c:217

References a, b, DatumGetPointer(), DirectFunctionCall1, ltree_concat(), ltree_in(), pfree(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, PointerGetDatum(), and text_to_cstring().

◆ ltree_cmp()

Datum ltree_cmp ( PG_FUNCTION_ARGS  )

Definition at line 85 of file ltree_op.c.

86{
87 RUNCMP;
89}
#define PG_RETURN_INT32(x)
Definition: fmgr.h:354
#define RUNCMP
Definition: ltree_op.c:77

References PG_RETURN_INT32, res, and RUNCMP.

◆ ltree_compare()

int ltree_compare ( const ltree a,
const ltree b 
)

Definition at line 43 of file ltree_op.c.

44{
47 int an = a->numlevel;
48 int bn = b->numlevel;
49
50 while (an > 0 && bn > 0)
51 {
52 int res;
53
54 if ((res = memcmp(al->name, bl->name, Min(al->len, bl->len))) == 0)
55 {
56 if (al->len != bl->len)
57 return (al->len - bl->len) * 10 * (an + 1);
58 }
59 else
60 {
61 if (res < 0)
62 res = -1;
63 else
64 res = 1;
65 return res * 10 * (an + 1);
66 }
67
68 an--;
69 bn--;
70 al = LEVEL_NEXT(al);
71 bl = LEVEL_NEXT(bl);
72 }
73
74 return (a->numlevel - b->numlevel) * 10 * (an + 1);
75}

References a, b, ltree_level::len, LEVEL_NEXT, LTREE_FIRST, Min, ltree_level::name, and res.

Referenced by gist_ischild(), gist_isparent(), ltree_consistent(), ltree_penalty(), ltree_picksplit(), ltree_union(), and treekey_cmp().

◆ ltree_concat()

static ltree * ltree_concat ( ltree a,
ltree b 
)
static

Definition at line 341 of file ltree_op.c.

342{
343 ltree *r;
344 int numlevel = (int) a->numlevel + b->numlevel;
345
346 if (numlevel > LTREE_MAX_LEVELS)
348 (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
349 errmsg("number of ltree levels (%d) exceeds the maximum allowed (%d)",
350 numlevel, LTREE_MAX_LEVELS)));
351
354 r->numlevel = (uint16) numlevel;
355
357 memcpy(((char *) LTREE_FIRST(r)) + VARSIZE(a) - LTREE_HDRSIZE,
358 LTREE_FIRST(b),
360 return r;
361}
uint16_t uint16
Definition: c.h:487
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:76
#define LTREE_MAX_LEVELS
Definition: ltree.h:52

References a, b, ereport, errcode(), errmsg(), ERROR, if(), LTREE_FIRST, LTREE_HDRSIZE, LTREE_MAX_LEVELS, ltree::numlevel, palloc0(), SET_VARSIZE, and VARSIZE.

Referenced by ltree_addltree(), ltree_addtext(), and ltree_textadd().

◆ ltree_eq()

Datum ltree_eq ( PG_FUNCTION_ARGS  )

Definition at line 106 of file ltree_op.c.

107{
108 RUNCMP;
109 PG_RETURN_BOOL(res == 0);
110}
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359

References PG_RETURN_BOOL, res, and RUNCMP.

◆ ltree_ge()

Datum ltree_ge ( PG_FUNCTION_ARGS  )

Definition at line 113 of file ltree_op.c.

114{
115 RUNCMP;
116 PG_RETURN_BOOL(res >= 0);
117}

References PG_RETURN_BOOL, res, and RUNCMP.

◆ ltree_gt()

Datum ltree_gt ( PG_FUNCTION_ARGS  )

Definition at line 120 of file ltree_op.c.

121{
122 RUNCMP;
123 PG_RETURN_BOOL(res > 0);
124}

References PG_RETURN_BOOL, res, and RUNCMP.

◆ ltree_index()

Datum ltree_index ( PG_FUNCTION_ARGS  )

Definition at line 402 of file ltree_op.c.

403{
406 int start = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
407 int i,
408 j;
409 ltree_level *startptr,
410 *aptr,
411 *bptr;
412 bool found = false;
413
414 if (start < 0)
415 {
416 if (-start >= a->numlevel)
417 start = 0;
418 else
419 start = (int) (a->numlevel) + start;
420 }
421
422 if (a->numlevel - start < b->numlevel || a->numlevel == 0 || b->numlevel == 0)
423 {
424 PG_FREE_IF_COPY(a, 0);
425 PG_FREE_IF_COPY(b, 1);
426 PG_RETURN_INT32(-1);
427 }
428
429 startptr = LTREE_FIRST(a);
430 for (i = 0; i <= a->numlevel - b->numlevel; i++)
431 {
432 if (i >= start)
433 {
434 aptr = startptr;
435 bptr = LTREE_FIRST(b);
436 for (j = 0; j < b->numlevel; j++)
437 {
438 if (!(aptr->len == bptr->len && memcmp(aptr->name, bptr->name, aptr->len) == 0))
439 break;
440 aptr = LEVEL_NEXT(aptr);
441 bptr = LEVEL_NEXT(bptr);
442 }
443
444 if (j == b->numlevel)
445 {
446 found = true;
447 break;
448 }
449 }
450 startptr = LEVEL_NEXT(startptr);
451 }
452
453 if (!found)
454 i = -1;
455
456 PG_FREE_IF_COPY(a, 0);
457 PG_FREE_IF_COPY(b, 1);
459}
#define PG_GETARG_INT32(n)
Definition: fmgr.h:269
int j
Definition: isn.c:73

References a, b, i, j, ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_level::name, PG_FREE_IF_COPY, PG_GETARG_INT32, PG_GETARG_LTREE_P, PG_RETURN_INT32, and start.

◆ ltree_isparent()

Datum ltree_isparent ( PG_FUNCTION_ARGS  )

Definition at line 234 of file ltree_op.c.

235{
237 ltree *p = PG_GETARG_LTREE_P(0);
238 bool res = inner_isparent(c, p);
239
240 PG_FREE_IF_COPY(c, 1);
241 PG_FREE_IF_COPY(p, 0);
243}
bool inner_isparent(const ltree *c, const ltree *p)
Definition: ltree_op.c:210

References inner_isparent(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_BOOL, and res.

Referenced by _ltree_extract_isparent(), and _ltree_isparent().

◆ ltree_le()

Datum ltree_le ( PG_FUNCTION_ARGS  )

Definition at line 99 of file ltree_op.c.

100{
101 RUNCMP;
102 PG_RETURN_BOOL(res <= 0);
103}

References PG_RETURN_BOOL, res, and RUNCMP.

◆ ltree_lt()

Datum ltree_lt ( PG_FUNCTION_ARGS  )

Definition at line 92 of file ltree_op.c.

93{
94 RUNCMP;
96}

References PG_RETURN_BOOL, res, and RUNCMP.

◆ ltree_ne()

Datum ltree_ne ( PG_FUNCTION_ARGS  )

Definition at line 127 of file ltree_op.c.

128{
129 RUNCMP;
130 PG_RETURN_BOOL(res != 0);
131}

References PG_RETURN_BOOL, res, and RUNCMP.

◆ ltree_risparent()

Datum ltree_risparent ( PG_FUNCTION_ARGS  )

Definition at line 246 of file ltree_op.c.

247{
249 ltree *p = PG_GETARG_LTREE_P(1);
250 bool res = inner_isparent(c, p);
251
252 PG_FREE_IF_COPY(c, 0);
253 PG_FREE_IF_COPY(p, 1);
255}

References inner_isparent(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_BOOL, and res.

Referenced by _ltree_extract_risparent(), and _ltree_risparent().

◆ ltree_textadd()

Datum ltree_textadd ( PG_FUNCTION_ARGS  )

Definition at line 462 of file ltree_op.c.

463{
466 char *s;
467 ltree *r,
468 *tmp;
469
470 s = text_to_cstring(b);
471
473 PointerGetDatum(s)));
474
475 pfree(s);
476
477 r = ltree_concat(tmp, a);
478
479 pfree(tmp);
480
481 PG_FREE_IF_COPY(a, 1);
482 PG_FREE_IF_COPY(b, 0);
484}

References a, b, DatumGetPointer(), DirectFunctionCall1, ltree_concat(), ltree_in(), pfree(), PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, PointerGetDatum(), and text_to_cstring().

◆ ltreeparentsel()

Datum ltreeparentsel ( PG_FUNCTION_ARGS  )

Definition at line 643 of file ltree_op.c.

644{
646 Oid operator = PG_GETARG_OID(1);
648 int varRelid = PG_GETARG_INT32(3);
649 double selec;
650
651 /* Use generic restriction selectivity logic, with default 0.001. */
653 args, varRelid,
654 0.001);
655
656 PG_RETURN_FLOAT8((float8) selec);
657}
double float8
Definition: c.h:587
#define PG_GETARG_OID(n)
Definition: fmgr.h:275
#define PG_RETURN_FLOAT8(x)
Definition: fmgr.h:367
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
#define InvalidOid
Definition: postgres_ext.h:37
unsigned int Oid
Definition: postgres_ext.h:32
tree ctl root
Definition: radixtree.h:1857
double generic_restriction_selectivity(PlannerInfo *root, Oid oproid, Oid collation, List *args, int varRelid, double default_selectivity)
Definition: selfuncs.c:915
Definition: pg_list.h:54

References generate_unaccent_rules::args, generic_restriction_selectivity(), InvalidOid, PG_GETARG_INT32, PG_GETARG_OID, PG_GETARG_POINTER, PG_RETURN_FLOAT8, and root.

◆ nlevel()

Datum nlevel ( PG_FUNCTION_ARGS  )

Definition at line 200 of file ltree_op.c.

201{
203 int res = a->numlevel;
204
205 PG_FREE_IF_COPY(a, 0);
207}

References a, PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_RETURN_INT32, and res.

◆ PG_FUNCTION_INFO_V1() [1/22]

PG_FUNCTION_INFO_V1 ( hash_ltree  )

◆ PG_FUNCTION_INFO_V1() [2/22]

PG_FUNCTION_INFO_V1 ( hash_ltree_extended  )

◆ PG_FUNCTION_INFO_V1() [3/22]

PG_FUNCTION_INFO_V1 ( lca  )

◆ PG_FUNCTION_INFO_V1() [4/22]

PG_FUNCTION_INFO_V1 ( ltree2text  )

◆ PG_FUNCTION_INFO_V1() [5/22]

PG_FUNCTION_INFO_V1 ( ltree_addltree  )

◆ PG_FUNCTION_INFO_V1() [6/22]

PG_FUNCTION_INFO_V1 ( ltree_addtext  )

◆ PG_FUNCTION_INFO_V1() [7/22]

PG_FUNCTION_INFO_V1 ( ltree_cmp  )

◆ PG_FUNCTION_INFO_V1() [8/22]

PG_FUNCTION_INFO_V1 ( ltree_eq  )

◆ PG_FUNCTION_INFO_V1() [9/22]

PG_FUNCTION_INFO_V1 ( ltree_ge  )

◆ PG_FUNCTION_INFO_V1() [10/22]

PG_FUNCTION_INFO_V1 ( ltree_gt  )

◆ PG_FUNCTION_INFO_V1() [11/22]

PG_FUNCTION_INFO_V1 ( ltree_index  )

◆ PG_FUNCTION_INFO_V1() [12/22]

PG_FUNCTION_INFO_V1 ( ltree_isparent  )

◆ PG_FUNCTION_INFO_V1() [13/22]

PG_FUNCTION_INFO_V1 ( ltree_le  )

◆ PG_FUNCTION_INFO_V1() [14/22]

PG_FUNCTION_INFO_V1 ( ltree_lt  )

◆ PG_FUNCTION_INFO_V1() [15/22]

PG_FUNCTION_INFO_V1 ( ltree_ne  )

◆ PG_FUNCTION_INFO_V1() [16/22]

PG_FUNCTION_INFO_V1 ( ltree_risparent  )

◆ PG_FUNCTION_INFO_V1() [17/22]

PG_FUNCTION_INFO_V1 ( ltree_textadd  )

◆ PG_FUNCTION_INFO_V1() [18/22]

PG_FUNCTION_INFO_V1 ( ltreeparentsel  )

◆ PG_FUNCTION_INFO_V1() [19/22]

PG_FUNCTION_INFO_V1 ( nlevel  )

◆ PG_FUNCTION_INFO_V1() [20/22]

PG_FUNCTION_INFO_V1 ( subltree  )

◆ PG_FUNCTION_INFO_V1() [21/22]

PG_FUNCTION_INFO_V1 ( subpath  )

◆ PG_FUNCTION_INFO_V1() [22/22]

PG_FUNCTION_INFO_V1 ( text2ltree  )

◆ subltree()

Datum subltree ( PG_FUNCTION_ARGS  )

Definition at line 298 of file ltree_op.c.

299{
300 ltree *t = PG_GETARG_LTREE_P(0);
302
303 PG_FREE_IF_COPY(t, 0);
305}
static ltree * inner_subltree(ltree *t, int32 startpos, int32 endpos)
Definition: ltree_op.c:259

References inner_subltree(), PG_FREE_IF_COPY, PG_GETARG_INT32, PG_GETARG_LTREE_P, PG_RETURN_POINTER, and res.

◆ subpath()

Datum subpath ( PG_FUNCTION_ARGS  )

Definition at line 308 of file ltree_op.c.

309{
310 ltree *t = PG_GETARG_LTREE_P(0);
312 int32 len = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
313 int32 end;
314 ltree *res;
315
316 end = start + len;
317
318 if (start < 0)
319 {
320 start = t->numlevel + start;
321 end = start + len;
322 }
323 if (start < 0)
324 { /* start > t->numlevel */
325 start = t->numlevel + start;
326 end = start + len;
327 }
328
329 if (len < 0)
330 end = t->numlevel + len;
331 else if (len == 0)
332 end = (fcinfo->nargs == 3) ? start : 0xffff;
333
334 res = inner_subltree(t, start, end);
335
336 PG_FREE_IF_COPY(t, 0);
338}
int32_t int32
Definition: c.h:484

References inner_subltree(), len, ltree::numlevel, PG_FREE_IF_COPY, PG_GETARG_INT32, PG_GETARG_LTREE_P, PG_RETURN_POINTER, res, and start.

Referenced by add_foreign_final_paths(), add_paths_to_append_rel(), adjust_paths_for_srfs(), append_nonpartial_cost(), apply_scanjoin_target_to_paths(), build_setop_child_paths(), cost_append(), cost_bitmap_and_node(), cost_bitmap_or_node(), create_agg_path(), create_append_path(), create_append_plan(), create_gather_merge_path(), create_gather_path(), create_group_path(), create_groupingsets_path(), create_incremental_sort_path(), create_limit_path(), create_lockrows_path(), create_material_path(), create_memoize_path(), create_merge_append_path(), create_merge_append_plan(), create_modifytable_path(), create_modifytable_plan(), create_projection_path(), create_set_projection_path(), create_sort_path(), create_subqueryscan_path(), create_unique_path(), create_upper_unique_path(), create_windowagg_path(), ExecSupportsMarkRestore(), generate_gather_paths(), generate_union_paths(), generate_useful_gather_paths(), get_param_path_clause_serials(), is_dummy_rel(), mark_async_capable_plan(), recurse_set_operations(), reparameterize_path(), set_subquery_pathlist(), and walkdir().

◆ text2ltree()

Datum text2ltree ( PG_FUNCTION_ARGS  )

Definition at line 589 of file ltree_op.c.

590{
591 text *in = PG_GETARG_TEXT_PP(0);
592 char *s;
593 ltree *out;
594
595 s = text_to_cstring(in);
596
598 PointerGetDatum(s)));
599 pfree(s);
600 PG_FREE_IF_COPY(in, 0);
602}

References DatumGetPointer(), DirectFunctionCall1, ltree_in(), pfree(), PG_FREE_IF_COPY, PG_GETARG_TEXT_PP, PG_RETURN_POINTER, PointerGetDatum(), and text_to_cstring().

Variable Documentation

◆ PG_MODULE_MAGIC

PG_MODULE_MAGIC

Definition at line 16 of file ltree_op.c.