PostgreSQL Source Code  git master
ltree_op.c
Go to the documentation of this file.
1 /*
2  * op function for ltree
3  * Teodor Sigaev <teodor@stack.net>
4  * contrib/ltree/ltree_op.c
5  */
6 #include "postgres.h"
7 
8 #include <ctype.h>
9 
10 #include "access/htup_details.h"
11 #include "catalog/pg_statistic.h"
12 #include "utils/builtins.h"
13 #include "utils/lsyscache.h"
14 #include "utils/selfuncs.h"
15 #include "ltree.h"
16 
18 
19 /* compare functions */
40 
41 int
42 ltree_compare(const ltree *a, const ltree *b)
43 {
44  ltree_level *al = LTREE_FIRST(a);
45  ltree_level *bl = LTREE_FIRST(b);
46  int an = a->numlevel;
47  int bn = b->numlevel;
48 
49  while (an > 0 && bn > 0)
50  {
51  int res;
52 
53  if ((res = memcmp(al->name, bl->name, Min(al->len, bl->len))) == 0)
54  {
55  if (al->len != bl->len)
56  return (al->len - bl->len) * 10 * (an + 1);
57  }
58  else
59  {
60  if (res < 0)
61  res = -1;
62  else
63  res = 1;
64  return res * 10 * (an + 1);
65  }
66 
67  an--;
68  bn--;
69  al = LEVEL_NEXT(al);
70  bl = LEVEL_NEXT(bl);
71  }
72 
73  return (a->numlevel - b->numlevel) * 10 * (an + 1);
74 }
75 
76 #define RUNCMP \
77 ltree *a = PG_GETARG_LTREE_P(0); \
78 ltree *b = PG_GETARG_LTREE_P(1); \
79 int res = ltree_compare(a,b); \
80 PG_FREE_IF_COPY(a,0); \
81 PG_FREE_IF_COPY(b,1)
82 
83 Datum
85 {
86  RUNCMP;
87  PG_RETURN_INT32(res);
88 }
89 
90 Datum
92 {
93  RUNCMP;
94  PG_RETURN_BOOL((res < 0) ? true : false);
95 }
96 
97 Datum
99 {
100  RUNCMP;
101  PG_RETURN_BOOL((res <= 0) ? true : false);
102 }
103 
104 Datum
106 {
107  RUNCMP;
108  PG_RETURN_BOOL((res == 0) ? true : false);
109 }
110 
111 Datum
113 {
114  RUNCMP;
115  PG_RETURN_BOOL((res >= 0) ? true : false);
116 }
117 
118 Datum
120 {
121  RUNCMP;
122  PG_RETURN_BOOL((res > 0) ? true : false);
123 }
124 
125 Datum
127 {
128  RUNCMP;
129  PG_RETURN_BOOL((res != 0) ? true : false);
130 }
131 
132 Datum
134 {
135  ltree *a = PG_GETARG_LTREE_P(0);
136  int res = a->numlevel;
137 
138  PG_FREE_IF_COPY(a, 0);
139  PG_RETURN_INT32(res);
140 }
141 
142 bool
143 inner_isparent(const ltree *c, const ltree *p)
144 {
145  ltree_level *cl = LTREE_FIRST(c);
146  ltree_level *pl = LTREE_FIRST(p);
147  int pn = p->numlevel;
148 
149  if (pn > c->numlevel)
150  return false;
151 
152  while (pn > 0)
153  {
154  if (cl->len != pl->len)
155  return false;
156  if (memcmp(cl->name, pl->name, cl->len) != 0)
157  return false;
158 
159  pn--;
160  cl = LEVEL_NEXT(cl);
161  pl = LEVEL_NEXT(pl);
162  }
163  return true;
164 }
165 
166 Datum
168 {
169  ltree *c = PG_GETARG_LTREE_P(1);
170  ltree *p = PG_GETARG_LTREE_P(0);
171  bool res = inner_isparent(c, p);
172 
173  PG_FREE_IF_COPY(c, 1);
174  PG_FREE_IF_COPY(p, 0);
175  PG_RETURN_BOOL(res);
176 }
177 
178 Datum
180 {
181  ltree *c = PG_GETARG_LTREE_P(0);
182  ltree *p = PG_GETARG_LTREE_P(1);
183  bool res = inner_isparent(c, p);
184 
185  PG_FREE_IF_COPY(c, 0);
186  PG_FREE_IF_COPY(p, 1);
187  PG_RETURN_BOOL(res);
188 }
189 
190 
191 static ltree *
193 {
194  char *start = NULL,
195  *end = NULL;
196  ltree_level *ptr = LTREE_FIRST(t);
197  ltree *res;
198  int i;
199 
200  if (startpos < 0 || endpos < 0 || startpos >= t->numlevel || startpos > endpos)
201  ereport(ERROR,
202  (errcode(ERRCODE_INVALID_PARAMETER_VALUE),
203  errmsg("invalid positions")));
204 
205  if (endpos > t->numlevel)
206  endpos = t->numlevel;
207 
208  start = end = (char *) ptr;
209  for (i = 0; i < endpos; i++)
210  {
211  if (i == startpos)
212  start = (char *) ptr;
213  if (i == endpos - 1)
214  {
215  end = (char *) LEVEL_NEXT(ptr);
216  break;
217  }
218  ptr = LEVEL_NEXT(ptr);
219  }
220 
221  res = (ltree *) palloc0(LTREE_HDRSIZE + (end - start));
222  SET_VARSIZE(res, LTREE_HDRSIZE + (end - start));
223  res->numlevel = endpos - startpos;
224 
225  memcpy(LTREE_FIRST(res), start, end - start);
226 
227  return res;
228 }
229 
230 Datum
232 {
233  ltree *t = PG_GETARG_LTREE_P(0);
235 
236  PG_FREE_IF_COPY(t, 0);
237  PG_RETURN_POINTER(res);
238 }
239 
240 Datum
242 {
243  ltree *t = PG_GETARG_LTREE_P(0);
244  int32 start = PG_GETARG_INT32(1);
245  int32 len = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
246  int32 end;
247  ltree *res;
248 
249  end = start + len;
250 
251  if (start < 0)
252  {
253  start = t->numlevel + start;
254  end = start + len;
255  }
256  if (start < 0)
257  { /* start > t->numlevel */
258  start = t->numlevel + start;
259  end = start + len;
260  }
261 
262  if (len < 0)
263  end = t->numlevel + len;
264  else if (len == 0)
265  end = (fcinfo->nargs == 3) ? start : 0xffff;
266 
267  res = inner_subltree(t, start, end);
268 
269  PG_FREE_IF_COPY(t, 0);
270  PG_RETURN_POINTER(res);
271 }
272 
273 static ltree *
275 {
276  ltree *r;
277 
278  r = (ltree *) palloc0(VARSIZE(a) + VARSIZE(b) - LTREE_HDRSIZE);
280  r->numlevel = a->numlevel + b->numlevel;
281 
282  memcpy(LTREE_FIRST(r), LTREE_FIRST(a), VARSIZE(a) - LTREE_HDRSIZE);
283  memcpy(((char *) LTREE_FIRST(r)) + VARSIZE(a) - LTREE_HDRSIZE,
284  LTREE_FIRST(b),
285  VARSIZE(b) - LTREE_HDRSIZE);
286  return r;
287 }
288 
289 Datum
291 {
292  ltree *a = PG_GETARG_LTREE_P(0);
293  ltree *b = PG_GETARG_LTREE_P(1);
294  ltree *r;
295 
296  r = ltree_concat(a, b);
297  PG_FREE_IF_COPY(a, 0);
298  PG_FREE_IF_COPY(b, 1);
300 }
301 
302 Datum
304 {
305  ltree *a = PG_GETARG_LTREE_P(0);
306  text *b = PG_GETARG_TEXT_PP(1);
307  char *s;
308  ltree *r,
309  *tmp;
310 
311  s = text_to_cstring(b);
312 
314  PointerGetDatum(s)));
315 
316  pfree(s);
317 
318  r = ltree_concat(a, tmp);
319 
320  pfree(tmp);
321 
322  PG_FREE_IF_COPY(a, 0);
323  PG_FREE_IF_COPY(b, 1);
325 }
326 
327 Datum
329 {
330  ltree *a = PG_GETARG_LTREE_P(0);
331  ltree *b = PG_GETARG_LTREE_P(1);
332  int start = (fcinfo->nargs == 3) ? PG_GETARG_INT32(2) : 0;
333  int i,
334  j;
336  *aptr,
337  *bptr;
338  bool found = false;
339 
340  if (start < 0)
341  {
342  if (-start >= a->numlevel)
343  start = 0;
344  else
345  start = (int) (a->numlevel) + start;
346  }
347 
348  if (a->numlevel - start < b->numlevel || a->numlevel == 0 || b->numlevel == 0)
349  {
350  PG_FREE_IF_COPY(a, 0);
351  PG_FREE_IF_COPY(b, 1);
352  PG_RETURN_INT32(-1);
353  }
354 
355  startptr = LTREE_FIRST(a);
356  for (i = 0; i <= a->numlevel - b->numlevel; i++)
357  {
358  if (i >= start)
359  {
360  aptr = startptr;
361  bptr = LTREE_FIRST(b);
362  for (j = 0; j < b->numlevel; j++)
363  {
364  if (!(aptr->len == bptr->len && memcmp(aptr->name, bptr->name, aptr->len) == 0))
365  break;
366  aptr = LEVEL_NEXT(aptr);
367  bptr = LEVEL_NEXT(bptr);
368  }
369 
370  if (j == b->numlevel)
371  {
372  found = true;
373  break;
374  }
375  }
376  startptr = LEVEL_NEXT(startptr);
377  }
378 
379  if (!found)
380  i = -1;
381 
382  PG_FREE_IF_COPY(a, 0);
383  PG_FREE_IF_COPY(b, 1);
384  PG_RETURN_INT32(i);
385 }
386 
387 Datum
389 {
390  ltree *a = PG_GETARG_LTREE_P(1);
391  text *b = PG_GETARG_TEXT_PP(0);
392  char *s;
393  ltree *r,
394  *tmp;
395 
396  s = text_to_cstring(b);
397 
399  PointerGetDatum(s)));
400 
401  pfree(s);
402 
403  r = ltree_concat(tmp, a);
404 
405  pfree(tmp);
406 
407  PG_FREE_IF_COPY(a, 1);
408  PG_FREE_IF_COPY(b, 0);
410 }
411 
412 /*
413  * Common code for variants of lca(), find longest common ancestor of inputs
414  *
415  * Returns NULL if there is no common ancestor, ie, the longest common
416  * prefix is empty.
417  */
418 ltree *
419 lca_inner(ltree **a, int len)
420 {
421  int tmp,
422  num,
423  i,
424  reslen;
425  ltree **ptr;
426  ltree_level *l1,
427  *l2;
428  ltree *res;
429 
430  if (len <= 0)
431  return NULL; /* no inputs? */
432  if ((*a)->numlevel == 0)
433  return NULL; /* any empty input means NULL result */
434 
435  /* num is the length of the longest common ancestor so far */
436  num = (*a)->numlevel - 1;
437 
438  /* Compare each additional input to *a */
439  ptr = a + 1;
440  while (ptr - a < len)
441  {
442  if ((*ptr)->numlevel == 0)
443  return NULL;
444  else if ((*ptr)->numlevel == 1)
445  num = 0;
446  else
447  {
448  l1 = LTREE_FIRST(*a);
449  l2 = LTREE_FIRST(*ptr);
450  tmp = Min(num, (*ptr)->numlevel - 1);
451  num = 0;
452  for (i = 0; i < tmp; i++)
453  {
454  if (l1->len == l2->len &&
455  memcmp(l1->name, l2->name, l1->len) == 0)
456  num = i + 1;
457  else
458  break;
459  l1 = LEVEL_NEXT(l1);
460  l2 = LEVEL_NEXT(l2);
461  }
462  }
463  ptr++;
464  }
465 
466  /* Now compute size of result ... */
467  reslen = LTREE_HDRSIZE;
468  l1 = LTREE_FIRST(*a);
469  for (i = 0; i < num; i++)
470  {
471  reslen += MAXALIGN(l1->len + LEVEL_HDRSIZE);
472  l1 = LEVEL_NEXT(l1);
473  }
474 
475  /* ... and construct it by copying from *a */
476  res = (ltree *) palloc0(reslen);
477  SET_VARSIZE(res, reslen);
478  res->numlevel = num;
479 
480  l1 = LTREE_FIRST(*a);
481  l2 = LTREE_FIRST(res);
482 
483  for (i = 0; i < num; i++)
484  {
485  memcpy(l2, l1, MAXALIGN(l1->len + LEVEL_HDRSIZE));
486  l1 = LEVEL_NEXT(l1);
487  l2 = LEVEL_NEXT(l2);
488  }
489 
490  return res;
491 }
492 
493 Datum
495 {
496  int i;
497  ltree **a,
498  *res;
499 
500  a = (ltree **) palloc(sizeof(ltree *) * fcinfo->nargs);
501  for (i = 0; i < fcinfo->nargs; i++)
502  a[i] = PG_GETARG_LTREE_P(i);
503  res = lca_inner(a, (int) fcinfo->nargs);
504  for (i = 0; i < fcinfo->nargs; i++)
505  PG_FREE_IF_COPY(a[i], i);
506  pfree(a);
507 
508  if (res)
509  PG_RETURN_POINTER(res);
510  else
511  PG_RETURN_NULL();
512 }
513 
514 Datum
516 {
517  text *in = PG_GETARG_TEXT_PP(0);
518  char *s;
519  ltree *out;
520 
521  s = text_to_cstring(in);
522 
524  PointerGetDatum(s)));
525  pfree(s);
526  PG_FREE_IF_COPY(in, 0);
527  PG_RETURN_POINTER(out);
528 }
529 
530 
531 Datum
533 {
534  ltree *in = PG_GETARG_LTREE_P(0);
535  char *ptr;
536  int i;
537  ltree_level *curlevel;
538  text *out;
539 
540  out = (text *) palloc(VARSIZE(in) + VARHDRSZ);
541  ptr = VARDATA(out);
542  curlevel = LTREE_FIRST(in);
543  for (i = 0; i < in->numlevel; i++)
544  {
545  if (i != 0)
546  {
547  *ptr = '.';
548  ptr++;
549  }
550  memcpy(ptr, curlevel->name, curlevel->len);
551  ptr += curlevel->len;
552  curlevel = LEVEL_NEXT(curlevel);
553  }
554 
555  SET_VARSIZE(out, ptr - ((char *) out));
556  PG_FREE_IF_COPY(in, 0);
557 
558  PG_RETURN_POINTER(out);
559 }
560 
561 
562 #define DEFAULT_PARENT_SEL 0.001
563 
564 /*
565  * ltreeparentsel - Selectivity of parent relationship for ltree data types.
566  */
567 Datum
569 {
571  Oid operator = PG_GETARG_OID(1);
572  List *args = (List *) PG_GETARG_POINTER(2);
573  int varRelid = PG_GETARG_INT32(3);
574  VariableStatData vardata;
575  Node *other;
576  bool varonleft;
577  double selec;
578 
579  /*
580  * If expression is not variable <@ something or something <@ variable,
581  * then punt and return a default estimate.
582  */
583  if (!get_restriction_variable(root, args, varRelid,
584  &vardata, &other, &varonleft))
586 
587  /*
588  * If the something is a NULL constant, assume operator is strict and
589  * return zero, ie, operator will never return TRUE.
590  */
591  if (IsA(other, Const) &&
592  ((Const *) other)->constisnull)
593  {
594  ReleaseVariableStats(vardata);
595  PG_RETURN_FLOAT8(0.0);
596  }
597 
598  if (IsA(other, Const))
599  {
600  /* Variable is being compared to a known non-null constant */
601  Datum constval = ((Const *) other)->constvalue;
602  FmgrInfo contproc;
603  double mcvsum;
604  double mcvsel;
605  double nullfrac;
606  int hist_size;
607 
608  fmgr_info(get_opcode(operator), &contproc);
609 
610  /*
611  * Is the constant "<@" to any of the column's most common values?
612  */
613  mcvsel = mcv_selectivity(&vardata, &contproc, constval, varonleft,
614  &mcvsum);
615 
616  /*
617  * If the histogram is large enough, see what fraction of it the
618  * constant is "<@" to, and assume that's representative of the
619  * non-MCV population. Otherwise use the default selectivity for the
620  * non-MCV population.
621  */
622  selec = histogram_selectivity(&vardata, &contproc,
623  constval, varonleft,
624  10, 1, &hist_size);
625  if (selec < 0)
626  {
627  /* Nope, fall back on default */
628  selec = DEFAULT_PARENT_SEL;
629  }
630  else if (hist_size < 100)
631  {
632  /*
633  * For histogram sizes from 10 to 100, we combine the histogram
634  * and default selectivities, putting increasingly more trust in
635  * the histogram for larger sizes.
636  */
637  double hist_weight = hist_size / 100.0;
638 
639  selec = selec * hist_weight +
640  DEFAULT_PARENT_SEL * (1.0 - hist_weight);
641  }
642 
643  /* In any case, don't believe extremely small or large estimates. */
644  if (selec < 0.0001)
645  selec = 0.0001;
646  else if (selec > 0.9999)
647  selec = 0.9999;
648 
649  if (HeapTupleIsValid(vardata.statsTuple))
650  nullfrac = ((Form_pg_statistic) GETSTRUCT(vardata.statsTuple))->stanullfrac;
651  else
652  nullfrac = 0.0;
653 
654  /*
655  * Now merge the results from the MCV and histogram calculations,
656  * realizing that the histogram covers only the non-null values that
657  * are not listed in MCV.
658  */
659  selec *= 1.0 - nullfrac - mcvsum;
660  selec += mcvsel;
661  }
662  else
663  selec = DEFAULT_PARENT_SEL;
664 
665  ReleaseVariableStats(vardata);
666 
667  /* result should be in range, but make sure... */
668  CLAMP_PROBABILITY(selec);
669 
670  PG_RETURN_FLOAT8((float8) selec);
671 }
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:351
char name[FLEXIBLE_ARRAY_MEMBER]
Definition: ltree.h:13
#define PG_GETARG_INT32(n)
Definition: fmgr.h:264
Definition: fmgr.h:56
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
#define VARDATA(PTR)
Definition: postgres.h:302
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
Datum ltree_cmp(PG_FUNCTION_ARGS)
Definition: ltree_op.c:84
uint16 len
Definition: ltree.h:12
HeapTuple statsTuple
Definition: selfuncs.h:71
#define VARSIZE(PTR)
Definition: postgres.h:303
#define PointerGetDatum(X)
Definition: postgres.h:556
#define VARHDRSZ
Definition: c.h:555
Datum nlevel(PG_FUNCTION_ARGS)
Definition: ltree_op.c:133
bool get_restriction_variable(PlannerInfo *root, List *args, int varRelid, VariableStatData *vardata, Node **other, bool *varonleft)
Definition: selfuncs.c:4286
Datum ltree_le(PG_FUNCTION_ARGS)
Definition: ltree_op.c:98
#define PG_RETURN_FLOAT8(x)
Definition: fmgr.h:356
#define Min(x, y)
Definition: c.h:904
Datum ltree_index(PG_FUNCTION_ARGS)
Definition: ltree_op.c:328
#define PG_RETURN_INT32(x)
Definition: fmgr.h:344
ltree * lca_inner(ltree **a, int len)
Definition: ltree_op.c:419
Definition: nodes.h:525
#define LTREE_HDRSIZE
Definition: ltree.h:26
int errcode(int sqlerrcode)
Definition: elog.c:570
#define PG_GETARG_LTREE_P(n)
Definition: ltree.h:171
bool inner_isparent(const ltree *c, const ltree *p)
Definition: ltree_op.c:143
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:271
#define DirectFunctionCall1(func, arg1)
Definition: fmgr.h:617
PG_FUNCTION_INFO_V1(ltree_cmp)
unsigned int Oid
Definition: postgres_ext.h:31
#define DEFAULT_PARENT_SEL
Definition: ltree_op.c:562
FormData_pg_statistic * Form_pg_statistic
Definition: pg_statistic.h:134
Datum ltree_in(PG_FUNCTION_ARGS)
Definition: ltree_io.c:38
signed int int32
Definition: c.h:346
#define PG_GETARG_TEXT_PP(n)
Definition: fmgr.h:303
#define CLAMP_PROBABILITY(p)
Definition: selfuncs.h:57
Datum ltree2text(PG_FUNCTION_ARGS)
Definition: ltree_op.c:532
Datum ltree_risparent(PG_FUNCTION_ARGS)
Definition: ltree_op.c:179
void pfree(void *pointer)
Definition: mcxt.c:1056
PG_MODULE_MAGIC
Definition: ltree_op.c:17
#define ERROR
Definition: elog.h:43
double float8
Definition: c.h:491
static ltree * ltree_concat(ltree *a, ltree *b)
Definition: ltree_op.c:274
void fmgr_info(Oid functionId, FmgrInfo *finfo)
Definition: fmgr.c:124
static XLogRecPtr endpos
Definition: pg_receivewal.c:48
char * c
#define RUNCMP
Definition: ltree_op.c:76
#define PG_GETARG_OID(n)
Definition: fmgr.h:270
#define LEVEL_NEXT(x)
Definition: ltree.h:17
#define ereport(elevel, rest)
Definition: elog.h:141
Definition: ltree.h:19
Datum text2ltree(PG_FUNCTION_ARGS)
Definition: ltree_op.c:515
uint16 numlevel
Definition: ltree.h:22
void * palloc0(Size size)
Definition: mcxt.c:980
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:349
uintptr_t Datum
Definition: postgres.h:367
double histogram_selectivity(VariableStatData *vardata, FmgrInfo *opproc, Datum constval, bool varonleft, int min_hist_size, int n_skip, int *hist_size)
Definition: selfuncs.c:778
Datum ltree_ne(PG_FUNCTION_ARGS)
Definition: ltree_op.c:126
int ltree_compare(const ltree *a, const ltree *b)
Definition: ltree_op.c:42
Datum ltree_eq(PG_FUNCTION_ARGS)
Definition: ltree_op.c:105
double mcv_selectivity(VariableStatData *vardata, FmgrInfo *opproc, Datum constval, bool varonleft, double *sumcommonp)
Definition: selfuncs.c:706
RegProcedure get_opcode(Oid opno)
Definition: lsyscache.c:1092
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
Datum lca(PG_FUNCTION_ARGS)
Definition: ltree_op.c:494
Datum ltree_addtext(PG_FUNCTION_ARGS)
Definition: ltree_op.c:303
#define MAXALIGN(LEN)
Definition: c.h:685
static XLogRecPtr startpos
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:255
Datum ltree_isparent(PG_FUNCTION_ARGS)
Definition: ltree_op.c:167
#define DatumGetPointer(X)
Definition: postgres.h:549
char * text_to_cstring(const text *t)
Definition: varlena.c:204
#define ReleaseVariableStats(vardata)
Definition: selfuncs.h:81
Datum ltree_ge(PG_FUNCTION_ARGS)
Definition: ltree_op.c:112
void * palloc(Size size)
Definition: mcxt.c:949
int errmsg(const char *fmt,...)
Definition: elog.c:784
static ltree * inner_subltree(ltree *t, int32 startpos, int32 endpos)
Definition: ltree_op.c:192
#define LTREE_FIRST(x)
Definition: ltree.h:27
int i
Datum ltree_gt(PG_FUNCTION_ARGS)
Definition: ltree_op.c:119
Definition: c.h:549
#define PG_FUNCTION_ARGS
Definition: fmgr.h:188
#define SET_VARSIZE(PTR, len)
Definition: postgres.h:329
Datum ltree_textadd(PG_FUNCTION_ARGS)
Definition: ltree_op.c:388
Datum ltreeparentsel(PG_FUNCTION_ARGS)
Definition: ltree_op.c:568
Datum subltree(PG_FUNCTION_ARGS)
Definition: ltree_op.c:231
Definition: pg_list.h:50
#define PG_RETURN_NULL()
Definition: fmgr.h:335
Datum ltree_addltree(PG_FUNCTION_ARGS)
Definition: ltree_op.c:290
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
Datum ltree_lt(PG_FUNCTION_ARGS)
Definition: ltree_op.c:91
static XLogRecPtr startptr
Definition: basebackup.c:118
#define LEVEL_HDRSIZE
Definition: ltree.h:16