PostgreSQL Source Code git master
•All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
Data Structures | Macros | Typedefs | Functions
ltree.h File Reference
#include "fmgr.h"
#include "tsearch/ts_locale.h"
#include "utils/memutils.h"
Include dependency graph for ltree.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Data Structures

struct  ltree_level
 
struct  ltree
 
struct  lquery_variant
 
struct  lquery_level
 
struct  lquery
 
struct  ITEM
 
struct  ltxtquery
 
struct  ltree_gist
 
struct  LtreeGistOptions
 

Macros

#define LTREE_LABEL_MAX_CHARS   1000
 
#define LOWER_NODE
 
#define LEVEL_HDRSIZE   (offsetof(ltree_level,name))
 
#define LEVEL_NEXT(x)   ( (ltree_level*)( ((char*)(x)) + MAXALIGN(((ltree_level*)(x))->len + LEVEL_HDRSIZE) ) )
 
#define LTREE_HDRSIZE   MAXALIGN( offsetof(ltree, data) )
 
#define LTREE_FIRST(x)   ( (ltree_level*)( ((char*)(x))+LTREE_HDRSIZE ) )
 
#define LTREE_MAX_LEVELS   PG_UINT16_MAX /* ltree.numlevel is uint16 */
 
#define LVAR_HDRSIZE   MAXALIGN(offsetof(lquery_variant, name))
 
#define LVAR_NEXT(x)   ( (lquery_variant*)( ((char*)(x)) + MAXALIGN(((lquery_variant*)(x))->len) + LVAR_HDRSIZE ) )
 
#define LVAR_ANYEND   0x01 /* '*' flag: prefix match */
 
#define LVAR_INCASE   0x02 /* '@' flag: case-insensitive match */
 
#define LVAR_SUBLEXEME   0x04 /* '%' flag: word-wise match */
 
#define LQL_HDRSIZE   MAXALIGN( offsetof(lquery_level,variants) )
 
#define LQL_NEXT(x)   ( (lquery_level*)( ((char*)(x)) + MAXALIGN(((lquery_level*)(x))->totallen) ) )
 
#define LQL_FIRST(x)   ( (lquery_variant*)( ((char*)(x))+LQL_HDRSIZE ) )
 
#define LQL_NOT   0x10 /* level has '!' (NOT) prefix */
 
#define LQL_COUNT   0x20 /* level is non-'*' and has repeat counts */
 
#define FLG_CANLOOKSIGN(x)   ( ( (x) & ( LQL_NOT | LVAR_ANYEND | LVAR_SUBLEXEME ) ) == 0 )
 
#define LQL_CANLOOKSIGN(x)   FLG_CANLOOKSIGN( ((lquery_level*)(x))->flag )
 
#define LQUERY_HDRSIZE   MAXALIGN( offsetof(lquery, data) )
 
#define LQUERY_FIRST(x)   ( (lquery_level*)( ((char*)(x))+LQUERY_HDRSIZE ) )
 
#define LQUERY_MAX_LEVELS   PG_UINT16_MAX /* lquery.numlevel is uint16 */
 
#define LQUERY_HASNOT   0x01
 
#define ISLABEL(x)   ( t_isalnum(x) || t_iseq(x, '_') || t_iseq(x, '-') )
 
#define HDRSIZEQT   MAXALIGN(VARHDRSZ + sizeof(int32))
 
#define COMPUTESIZE(size, lenofoperand)   ( HDRSIZEQT + (size) * sizeof(ITEM) + (lenofoperand) )
 
#define LTXTQUERY_TOO_BIG(size, lenofoperand)    ((size) > (MaxAllocSize - HDRSIZEQT - (lenofoperand)) / sizeof(ITEM))
 
#define GETQUERY(x)   (ITEM*)( (char*)(x)+HDRSIZEQT )
 
#define GETOPERAND(x)   ( (char*)GETQUERY(x) + ((ltxtquery*)x)->size * sizeof(ITEM) )
 
#define ISOPERATOR(x)   ( (x)=='!' || (x)=='&' || (x)=='|' || (x)=='(' || (x)==')' )
 
#define END   0
 
#define ERR   1
 
#define VAL   2
 
#define OPR   3
 
#define OPEN   4
 
#define CLOSE   5
 
#define VALTRUE   6 /* for stop words */
 
#define VALFALSE   7
 
#define DatumGetLtreeP(X)   ((ltree *) PG_DETOAST_DATUM(X))
 
#define DatumGetLtreePCopy(X)   ((ltree *) PG_DETOAST_DATUM_COPY(X))
 
#define PG_GETARG_LTREE_P(n)   DatumGetLtreeP(PG_GETARG_DATUM(n))
 
#define PG_GETARG_LTREE_P_COPY(n)   DatumGetLtreePCopy(PG_GETARG_DATUM(n))
 
#define DatumGetLqueryP(X)   ((lquery *) PG_DETOAST_DATUM(X))
 
#define DatumGetLqueryPCopy(X)   ((lquery *) PG_DETOAST_DATUM_COPY(X))
 
#define PG_GETARG_LQUERY_P(n)   DatumGetLqueryP(PG_GETARG_DATUM(n))
 
#define PG_GETARG_LQUERY_P_COPY(n)   DatumGetLqueryPCopy(PG_GETARG_DATUM(n))
 
#define DatumGetLtxtqueryP(X)   ((ltxtquery *) PG_DETOAST_DATUM(X))
 
#define DatumGetLtxtqueryPCopy(X)   ((ltxtquery *) PG_DETOAST_DATUM_COPY(X))
 
#define PG_GETARG_LTXTQUERY_P(n)   DatumGetLtxtqueryP(PG_GETARG_DATUM(n))
 
#define PG_GETARG_LTXTQUERY_P_COPY(n)   DatumGetLtxtqueryPCopy(PG_GETARG_DATUM(n))
 
#define BITBYTE   8
 
#define SIGLENBIT(siglen)   ((siglen) * BITBYTE)
 
#define LTREE_SIGLEN_DEFAULT   (2 * sizeof(int32))
 
#define LTREE_SIGLEN_MAX   GISTMaxIndexKeySize
 
#define LTREE_GET_SIGLEN()
 
#define LOOPBYTE(siglen)    for(i = 0; i < (siglen); i++)
 
#define GETBYTE(x, i)   ( *( (BITVECP)(x) + (int)( (i) / BITBYTE ) ) )
 
#define GETBITBYTE(x, i)   ( ((unsigned char)(x)) >> i & 0x01 )
 
#define CLRBIT(x, i)   GETBYTE(x,i) &= ~( 0x01 << ( (i) % BITBYTE ) )
 
#define SETBIT(x, i)   GETBYTE(x,i) |= ( 0x01 << ( (i) % BITBYTE ) )
 
#define GETBIT(x, i)   ( (GETBYTE(x,i) >> ( (i) % BITBYTE )) & 0x01 )
 
#define HASHVAL(val, siglen)   (((unsigned int)(val)) % SIGLENBIT(siglen))
 
#define HASH(sign, val, siglen)   SETBIT((sign), HASHVAL(val, siglen))
 
#define LTG_ONENODE   0x01
 
#define LTG_ALLTRUE   0x02
 
#define LTG_NORIGHT   0x04
 
#define LTG_HDRSIZE   MAXALIGN(VARHDRSZ + sizeof(uint32))
 
#define LTG_SIGN(x)   ( (BITVECP)( ((char*)(x))+LTG_HDRSIZE ) )
 
#define LTG_NODE(x)   ( (ltree*)( ((char*)(x))+LTG_HDRSIZE ) )
 
#define LTG_ISONENODE(x)   ( ((ltree_gist*)(x))->flag & LTG_ONENODE )
 
#define LTG_ISALLTRUE(x)   ( ((ltree_gist*)(x))->flag & LTG_ALLTRUE )
 
#define LTG_ISNORIGHT(x)   ( ((ltree_gist*)(x))->flag & LTG_NORIGHT )
 
#define LTG_LNODE(x, siglen)   ( (ltree*)( ( ((char*)(x))+LTG_HDRSIZE ) + ( LTG_ISALLTRUE(x) ? 0 : (siglen) ) ) )
 
#define LTG_RENODE(x, siglen)   ( (ltree*)( ((char*)LTG_LNODE(x, siglen)) + VARSIZE(LTG_LNODE(x, siglen))) )
 
#define LTG_RNODE(x, siglen)   ( LTG_ISNORIGHT(x) ? LTG_LNODE(x, siglen) : LTG_RENODE(x, siglen) )
 
#define LTG_GETLNODE(x, siglen)   ( LTG_ISONENODE(x) ? LTG_NODE(x) : LTG_LNODE(x, siglen) )
 
#define LTG_GETRNODE(x, siglen)   ( LTG_ISONENODE(x) ? LTG_NODE(x) : LTG_RNODE(x, siglen) )
 
#define LTREE_ASIGLEN_DEFAULT   (7 * sizeof(int32))
 
#define LTREE_ASIGLEN_MAX   GISTMaxIndexKeySize
 
#define LTREE_GET_ASIGLEN()
 
#define ASIGLENBIT(siglen)   ((siglen) * BITBYTE)
 
#define ALOOPBYTE(siglen)    for (i = 0; i < (siglen); i++)
 
#define AHASHVAL(val, siglen)   (((unsigned int)(val)) % ASIGLENBIT(siglen))
 
#define AHASH(sign, val, siglen)   SETBIT((sign), AHASHVAL(val, siglen))
 

Typedefs

typedef struct ITEM ITEM
 
typedef unsigned char * BITVECP
 

Functions

PGDLLEXPORT Datum ltree_isparent (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltree_risparent (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltq_regex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltq_rregex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum lt_q_regex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum lt_q_rregex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltxtq_exec (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltxtq_rexec (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _ltq_regex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _ltq_rregex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _lt_q_regex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _lt_q_rregex (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _ltxtq_exec (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _ltxtq_rexec (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _ltree_isparent (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum _ltree_risparent (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltree_addltree (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltree_addtext (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltree_textadd (PG_FUNCTION_ARGS)
 
PGDLLEXPORT Datum ltree_in (PG_FUNCTION_ARGS)
 
bool ltree_execute (ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *val))
 
int ltree_compare (const ltree *a, const ltree *b)
 
bool inner_isparent (const ltree *c, const ltree *p)
 
bool compare_subnode (ltree_level *t, char *qn, int len, int(*cmpptr)(const char *, const char *, size_t), bool anyend)
 
ltree * lca_inner (ltree **a, int len)
 
int ltree_strncasecmp (const char *a, const char *b, size_t s)
 
ltree_gist * ltree_gist_alloc (bool isalltrue, BITVECP sign, int siglen, ltree *left, ltree *right)
 

Macro Definition Documentation

◆ AHASH

#define AHASH (   sign,
  val,
  siglen 
)    SETBIT((sign), AHASHVAL(val, siglen))

Definition at line 306 of file ltree.h.

◆ AHASHVAL

#define AHASHVAL (   val,
  siglen 
)    (((unsigned int)(val)) % ASIGLENBIT(siglen))

Definition at line 305 of file ltree.h.

◆ ALOOPBYTE

#define ALOOPBYTE (   siglen)     for (i = 0; i < (siglen); i++)

Definition at line 302 of file ltree.h.

◆ ASIGLENBIT

#define ASIGLENBIT (   siglen)    ((siglen) * BITBYTE)

Definition at line 300 of file ltree.h.

◆ BITBYTE

#define BITBYTE   8

Definition at line 233 of file ltree.h.

◆ CLOSE

#define CLOSE   5

Definition at line 174 of file ltree.h.

◆ CLRBIT

#define CLRBIT (   x,
  i 
)    GETBYTE(x,i) &= ~( 0x01 << ( (i) % BITBYTE ) )

Definition at line 248 of file ltree.h.

◆ COMPUTESIZE

#define COMPUTESIZE (   size,
  lenofoperand 
)    ( HDRSIZEQT + (size) * sizeof(ITEM) + (lenofoperand) )

Definition at line 161 of file ltree.h.

◆ DatumGetLqueryP

#define DatumGetLqueryP (   X)    ((lquery *) PG_DETOAST_DATUM(X))

Definition at line 221 of file ltree.h.

◆ DatumGetLqueryPCopy

#define DatumGetLqueryPCopy (   X)    ((lquery *) PG_DETOAST_DATUM_COPY(X))

Definition at line 222 of file ltree.h.

◆ DatumGetLtreeP

#define DatumGetLtreeP (   X)    ((ltree *) PG_DETOAST_DATUM(X))

Definition at line 216 of file ltree.h.

◆ DatumGetLtreePCopy

#define DatumGetLtreePCopy (   X)    ((ltree *) PG_DETOAST_DATUM_COPY(X))

Definition at line 217 of file ltree.h.

◆ DatumGetLtxtqueryP

#define DatumGetLtxtqueryP (   X)    ((ltxtquery *) PG_DETOAST_DATUM(X))

Definition at line 226 of file ltree.h.

◆ DatumGetLtxtqueryPCopy

#define DatumGetLtxtqueryPCopy (   X)    ((ltxtquery *) PG_DETOAST_DATUM_COPY(X))

Definition at line 227 of file ltree.h.

◆ END

#define END   0

Definition at line 169 of file ltree.h.

◆ ERR

#define ERR   1

Definition at line 170 of file ltree.h.

◆ FLG_CANLOOKSIGN

#define FLG_CANLOOKSIGN (   x)    ( ( (x) & ( LQL_NOT | LVAR_ANYEND | LVAR_SUBLEXEME ) ) == 0 )

Definition at line 107 of file ltree.h.

◆ GETBIT

#define GETBIT (   x,
  i 
)    ( (GETBYTE(x,i) >> ( (i) % BITBYTE )) & 0x01 )

Definition at line 250 of file ltree.h.

◆ GETBITBYTE

#define GETBITBYTE (   x,
  i 
)    ( ((unsigned char)(x)) >> i & 0x01 )

Definition at line 247 of file ltree.h.

◆ GETBYTE

#define GETBYTE (   x,
  i 
)    ( *( (BITVECP)(x) + (int)( (i) / BITBYTE ) ) )

Definition at line 246 of file ltree.h.

◆ GETOPERAND

#define GETOPERAND (   x)    ( (char*)GETQUERY(x) + ((ltxtquery*)x)->size * sizeof(ITEM) )

Definition at line 165 of file ltree.h.

◆ GETQUERY

#define GETQUERY (   x)    (ITEM*)( (char*)(x)+HDRSIZEQT )

Definition at line 164 of file ltree.h.

◆ HASH

#define HASH (   sign,
  val,
  siglen 
)    SETBIT((sign), HASHVAL(val, siglen))

Definition at line 253 of file ltree.h.

◆ HASHVAL

#define HASHVAL (   val,
  siglen 
)    (((unsigned int)(val)) % SIGLENBIT(siglen))

Definition at line 252 of file ltree.h.

◆ HDRSIZEQT

#define HDRSIZEQT   MAXALIGN(VARHDRSZ + sizeof(int32))

Definition at line 160 of file ltree.h.

◆ ISLABEL

#define ISLABEL (   x)    ( t_isalnum(x) || t_iseq(x, '_') || t_iseq(x, '-') )

Definition at line 130 of file ltree.h.

◆ ISOPERATOR

#define ISOPERATOR (   x)    ( (x)=='!' || (x)=='&' || (x)=='|' || (x)=='(' || (x)==')' )

Definition at line 167 of file ltree.h.

◆ LEVEL_HDRSIZE

#define LEVEL_HDRSIZE   (offsetof(ltree_level,name))

Definition at line 39 of file ltree.h.

◆ LEVEL_NEXT

#define LEVEL_NEXT (   x)    ( (ltree_level*)( ((char*)(x)) + MAXALIGN(((ltree_level*)(x))->len + LEVEL_HDRSIZE) ) )

Definition at line 40 of file ltree.h.

◆ LOOPBYTE

#define LOOPBYTE (   siglen)     for(i = 0; i < (siglen); i++)

Definition at line 243 of file ltree.h.

◆ LOWER_NODE

#define LOWER_NODE

Definition at line 30 of file ltree.h.

◆ LQL_CANLOOKSIGN

#define LQL_CANLOOKSIGN (   x)    FLG_CANLOOKSIGN( ((lquery_level*)(x))->flag )

Definition at line 111 of file ltree.h.

◆ LQL_COUNT

#define LQL_COUNT   0x20 /* level is non-'*' and has repeat counts */

Definition at line 104 of file ltree.h.

◆ LQL_FIRST

#define LQL_FIRST (   x)    ( (lquery_variant*)( ((char*)(x))+LQL_HDRSIZE ) )

Definition at line 101 of file ltree.h.

◆ LQL_HDRSIZE

#define LQL_HDRSIZE   MAXALIGN( offsetof(lquery_level,variants) )

Definition at line 99 of file ltree.h.

◆ LQL_NEXT

#define LQL_NEXT (   x)    ( (lquery_level*)( ((char*)(x)) + MAXALIGN(((lquery_level*)(x))->totallen) ) )

Definition at line 100 of file ltree.h.

◆ LQL_NOT

#define LQL_NOT   0x10 /* level has '!' (NOT) prefix */

Definition at line 103 of file ltree.h.

◆ LQUERY_FIRST

#define LQUERY_FIRST (   x)    ( (lquery_level*)( ((char*)(x))+LQUERY_HDRSIZE ) )

Definition at line 124 of file ltree.h.

◆ LQUERY_HASNOT

#define LQUERY_HASNOT   0x01

Definition at line 127 of file ltree.h.

◆ LQUERY_HDRSIZE

#define LQUERY_HDRSIZE   MAXALIGN( offsetof(lquery, data) )

Definition at line 123 of file ltree.h.

◆ LQUERY_MAX_LEVELS

#define LQUERY_MAX_LEVELS   PG_UINT16_MAX /* lquery.numlevel is uint16 */

Definition at line 125 of file ltree.h.

◆ LTG_ALLTRUE

#define LTG_ALLTRUE   0x02

Definition at line 274 of file ltree.h.

◆ LTG_GETLNODE

#define LTG_GETLNODE (   x,
  siglen 
)    ( LTG_ISONENODE(x) ? LTG_NODE(x) : LTG_LNODE(x, siglen) )

Definition at line 287 of file ltree.h.

◆ LTG_GETRNODE

#define LTG_GETRNODE (   x,
  siglen 
)    ( LTG_ISONENODE(x) ? LTG_NODE(x) : LTG_RNODE(x, siglen) )

Definition at line 288 of file ltree.h.

◆ LTG_HDRSIZE

#define LTG_HDRSIZE   MAXALIGN(VARHDRSZ + sizeof(uint32))

Definition at line 277 of file ltree.h.

◆ LTG_ISALLTRUE

#define LTG_ISALLTRUE (   x)    ( ((ltree_gist*)(x))->flag & LTG_ALLTRUE )

Definition at line 281 of file ltree.h.

◆ LTG_ISNORIGHT

#define LTG_ISNORIGHT (   x)    ( ((ltree_gist*)(x))->flag & LTG_NORIGHT )

Definition at line 282 of file ltree.h.

◆ LTG_ISONENODE

#define LTG_ISONENODE (   x)    ( ((ltree_gist*)(x))->flag & LTG_ONENODE )

Definition at line 280 of file ltree.h.

◆ LTG_LNODE

#define LTG_LNODE (   x,
  siglen 
)    ( (ltree*)( ( ((char*)(x))+LTG_HDRSIZE ) + ( LTG_ISALLTRUE(x) ? 0 : (siglen) ) ) )

Definition at line 283 of file ltree.h.

◆ LTG_NODE

#define LTG_NODE (   x)    ( (ltree*)( ((char*)(x))+LTG_HDRSIZE ) )

Definition at line 279 of file ltree.h.

◆ LTG_NORIGHT

#define LTG_NORIGHT   0x04

Definition at line 275 of file ltree.h.

◆ LTG_ONENODE

#define LTG_ONENODE   0x01

Definition at line 273 of file ltree.h.

◆ LTG_RENODE

#define LTG_RENODE (   x,
  siglen 
)    ( (ltree*)( ((char*)LTG_LNODE(x, siglen)) + VARSIZE(LTG_LNODE(x, siglen))) )

Definition at line 284 of file ltree.h.

◆ LTG_RNODE

#define LTG_RNODE (   x,
  siglen 
)    ( LTG_ISNORIGHT(x) ? LTG_LNODE(x, siglen) : LTG_RENODE(x, siglen) )

Definition at line 285 of file ltree.h.

◆ LTG_SIGN

#define LTG_SIGN (   x)    ( (BITVECP)( ((char*)(x))+LTG_HDRSIZE ) )

Definition at line 278 of file ltree.h.

◆ LTREE_ASIGLEN_DEFAULT

#define LTREE_ASIGLEN_DEFAULT   (7 * sizeof(int32))

Definition at line 295 of file ltree.h.

◆ LTREE_ASIGLEN_MAX

#define LTREE_ASIGLEN_MAX   GISTMaxIndexKeySize

Definition at line 296 of file ltree.h.

◆ LTREE_FIRST

#define LTREE_FIRST (   x)    ( (ltree_level*)( ((char*)(x))+LTREE_HDRSIZE ) )

Definition at line 51 of file ltree.h.

◆ LTREE_GET_ASIGLEN

#define LTREE_GET_ASIGLEN ( )
Value:
(PG_HAS_OPCLASS_OPTIONS() ? \
((LtreeGistOptions *) PG_GET_OPCLASS_OPTIONS())->siglen : \
LTREE_ASIGLEN_DEFAULT)
PG_GET_OPCLASS_OPTIONS
#define PG_GET_OPCLASS_OPTIONS()
Definition: fmgr.h:342
PG_HAS_OPCLASS_OPTIONS
#define PG_HAS_OPCLASS_OPTIONS()
Definition: fmgr.h:341
LTREE_ASIGLEN_DEFAULT
#define LTREE_ASIGLEN_DEFAULT
Definition: ltree.h:295

Definition at line 297 of file ltree.h.

◆ LTREE_GET_SIGLEN

#define LTREE_GET_SIGLEN ( )
Value:
(PG_HAS_OPCLASS_OPTIONS() ? \
((LtreeGistOptions *) PG_GET_OPCLASS_OPTIONS())->siglen : \
LTREE_SIGLEN_DEFAULT)
LTREE_SIGLEN_DEFAULT
#define LTREE_SIGLEN_DEFAULT
Definition: ltree.h:235

Definition at line 237 of file ltree.h.

◆ LTREE_HDRSIZE

#define LTREE_HDRSIZE   MAXALIGN( offsetof(ltree, data) )

Definition at line 50 of file ltree.h.

◆ LTREE_LABEL_MAX_CHARS

#define LTREE_LABEL_MAX_CHARS   1000

Definition at line 18 of file ltree.h.

◆ LTREE_MAX_LEVELS

#define LTREE_MAX_LEVELS   PG_UINT16_MAX /* ltree.numlevel is uint16 */

Definition at line 52 of file ltree.h.

◆ LTREE_SIGLEN_DEFAULT

#define LTREE_SIGLEN_DEFAULT   (2 * sizeof(int32))

Definition at line 235 of file ltree.h.

◆ LTREE_SIGLEN_MAX

#define LTREE_SIGLEN_MAX   GISTMaxIndexKeySize

Definition at line 236 of file ltree.h.

◆ LTXTQUERY_TOO_BIG

#define LTXTQUERY_TOO_BIG (   size,
  lenofoperand 
)     ((size) > (MaxAllocSize - HDRSIZEQT - (lenofoperand)) / sizeof(ITEM))

Definition at line 162 of file ltree.h.

◆ LVAR_ANYEND

#define LVAR_ANYEND   0x01 /* '*' flag: prefix match */

Definition at line 74 of file ltree.h.

◆ LVAR_HDRSIZE

#define LVAR_HDRSIZE   MAXALIGN(offsetof(lquery_variant, name))

Definition at line 71 of file ltree.h.

◆ LVAR_INCASE

#define LVAR_INCASE   0x02 /* '@' flag: case-insensitive match */

Definition at line 75 of file ltree.h.

◆ LVAR_NEXT

#define LVAR_NEXT (   x)    ( (lquery_variant*)( ((char*)(x)) + MAXALIGN(((lquery_variant*)(x))->len) + LVAR_HDRSIZE ) )

Definition at line 72 of file ltree.h.

◆ LVAR_SUBLEXEME

#define LVAR_SUBLEXEME   0x04 /* '%' flag: word-wise match */

Definition at line 76 of file ltree.h.

◆ OPEN

#define OPEN   4

Definition at line 173 of file ltree.h.

◆ OPR

#define OPR   3

Definition at line 172 of file ltree.h.

◆ PG_GETARG_LQUERY_P

#define PG_GETARG_LQUERY_P (   n)    DatumGetLqueryP(PG_GETARG_DATUM(n))

Definition at line 223 of file ltree.h.

◆ PG_GETARG_LQUERY_P_COPY

#define PG_GETARG_LQUERY_P_COPY (   n)    DatumGetLqueryPCopy(PG_GETARG_DATUM(n))

Definition at line 224 of file ltree.h.

◆ PG_GETARG_LTREE_P

#define PG_GETARG_LTREE_P (   n)    DatumGetLtreeP(PG_GETARG_DATUM(n))

Definition at line 218 of file ltree.h.

◆ PG_GETARG_LTREE_P_COPY

#define PG_GETARG_LTREE_P_COPY (   n)    DatumGetLtreePCopy(PG_GETARG_DATUM(n))

Definition at line 219 of file ltree.h.

◆ PG_GETARG_LTXTQUERY_P

#define PG_GETARG_LTXTQUERY_P (   n)    DatumGetLtxtqueryP(PG_GETARG_DATUM(n))

Definition at line 228 of file ltree.h.

◆ PG_GETARG_LTXTQUERY_P_COPY

#define PG_GETARG_LTXTQUERY_P_COPY (   n)    DatumGetLtxtqueryPCopy(PG_GETARG_DATUM(n))

Definition at line 229 of file ltree.h.

◆ SETBIT

#define SETBIT (   x,
  i 
)    GETBYTE(x,i) |= ( 0x01 << ( (i) % BITBYTE ) )

Definition at line 249 of file ltree.h.

◆ SIGLENBIT

#define SIGLENBIT (   siglen)    ((siglen) * BITBYTE)

Definition at line 234 of file ltree.h.

◆ VAL

#define VAL   2

Definition at line 171 of file ltree.h.

◆ VALFALSE

#define VALFALSE   7

Definition at line 176 of file ltree.h.

◆ VALTRUE

#define VALTRUE   6 /* for stop words */

Definition at line 175 of file ltree.h.

Typedef Documentation

◆ BITVECP

typedef unsigned char* BITVECP

Definition at line 241 of file ltree.h.

◆ ITEM

typedef struct ITEM ITEM

Function Documentation

◆ _lt_q_regex()

PGDLLEXPORT Datum _lt_q_regex ( PG_FUNCTION_ARGS  )

Definition at line 135 of file _ltree_op.c.

136{
137 ArrayType *_tree = PG_GETARG_ARRAYTYPE_P(0);
138 ArrayType *_query = PG_GETARG_ARRAYTYPE_P(1);
139 lquery *query = (lquery *) ARR_DATA_PTR(_query);
140 bool res = false;
141 int num = ArrayGetNItems(ARR_NDIM(_query), ARR_DIMS(_query));
142
143 if (ARR_NDIM(_query) > 1)
144 ereport(ERROR,
145 (errcode(ERRCODE_ARRAY_SUBSCRIPT_ERROR),
146 errmsg("array must be one-dimensional")));
147 if (array_contains_nulls(_query))
148 ereport(ERROR,
149 (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
150 errmsg("array must not contain nulls")));
151
152 while (num > 0)
153 {
154 if (array_iterator(_tree, ltq_regex, query, NULL))
155 {
156 res = true;
157 break;
158 }
159 num--;
160 query = (lquery *) NEXTVAL(query);
161 }
162
163 PG_FREE_IF_COPY(_tree, 0);
164 PG_FREE_IF_COPY(_query, 1);
165 PG_RETURN_BOOL(res);
166}
NEXTVAL
#define NEXTVAL(x)
Definition: _ltree_op.c:35
array_iterator
static bool array_iterator(ArrayType *la, PGCALL2 callback, void *param, ltree **found)
Definition: _ltree_op.c:38
ARR_NDIM
#define ARR_NDIM(a)
Definition: array.h:290
PG_GETARG_ARRAYTYPE_P
#define PG_GETARG_ARRAYTYPE_P(n)
Definition: array.h:263
ARR_DATA_PTR
#define ARR_DATA_PTR(a)
Definition: array.h:322
ARR_DIMS
#define ARR_DIMS(a)
Definition: array.h:294
array_contains_nulls
bool array_contains_nulls(ArrayType *array)
Definition: arrayfuncs.c:3767
ArrayGetNItems
int ArrayGetNItems(int ndim, const int *dims)
Definition: arrayutils.c:57
errcode
int errcode(int sqlerrcode)
Definition: elog.c:854
errmsg
int errmsg(const char *fmt,...)
Definition: elog.c:1071
ERROR
#define ERROR
Definition: elog.h:39
ereport
#define ereport(elevel,...)
Definition: elog.h:149
PG_FREE_IF_COPY
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:260
PG_RETURN_BOOL
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
ltq_regex
Datum ltq_regex(PG_FUNCTION_ARGS)
Definition: lquery_op.c:215
lquery
Definition: ltree.h:114

References ARR_DATA_PTR, ARR_DIMS, ARR_NDIM, array_contains_nulls(), array_iterator(), ArrayGetNItems(), ereport, errcode(), errmsg(), ERROR, ltq_regex(), NEXTVAL, PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, and PG_RETURN_BOOL.

Referenced by _lt_q_rregex().

◆ _lt_q_rregex()

PGDLLEXPORT Datum _lt_q_rregex ( PG_FUNCTION_ARGS  )

Definition at line 169 of file _ltree_op.c.

170{
171 PG_RETURN_DATUM(DirectFunctionCall2(_lt_q_regex,
172 PG_GETARG_DATUM(1),
173 PG_GETARG_DATUM(0)
174 ));
175}
_lt_q_regex
Datum _lt_q_regex(PG_FUNCTION_ARGS)
Definition: _ltree_op.c:135
DirectFunctionCall2
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:684
PG_GETARG_DATUM
#define PG_GETARG_DATUM(n)
Definition: fmgr.h:268
PG_RETURN_DATUM
#define PG_RETURN_DATUM(x)
Definition: fmgr.h:353

References _lt_q_regex(), DirectFunctionCall2, PG_GETARG_DATUM, and PG_RETURN_DATUM.

◆ _ltq_regex()

PGDLLEXPORT Datum _ltq_regex ( PG_FUNCTION_ARGS  )

Definition at line 114 of file _ltree_op.c.

115{
116 ArrayType *la = PG_GETARG_ARRAYTYPE_P(0);
117 lquery *query = PG_GETARG_LQUERY_P(1);
118 bool res = array_iterator(la, ltq_regex, query, NULL);
119
120 PG_FREE_IF_COPY(la, 0);
121 PG_FREE_IF_COPY(query, 1);
122 PG_RETURN_BOOL(res);
123}
PG_GETARG_LQUERY_P
#define PG_GETARG_LQUERY_P(n)
Definition: ltree.h:223

References array_iterator(), ltq_regex(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_LQUERY_P, and PG_RETURN_BOOL.

Referenced by _ltq_rregex().

◆ _ltq_rregex()

PGDLLEXPORT Datum _ltq_rregex ( PG_FUNCTION_ARGS  )

Definition at line 126 of file _ltree_op.c.

127{
128 PG_RETURN_DATUM(DirectFunctionCall2(_ltq_regex,
129 PG_GETARG_DATUM(1),
130 PG_GETARG_DATUM(0)
131 ));
132}
_ltq_regex
Datum _ltq_regex(PG_FUNCTION_ARGS)
Definition: _ltree_op.c:114

References _ltq_regex(), DirectFunctionCall2, PG_GETARG_DATUM, and PG_RETURN_DATUM.

◆ _ltree_isparent()

PGDLLEXPORT Datum _ltree_isparent ( PG_FUNCTION_ARGS  )

Definition at line 72 of file _ltree_op.c.

73{
74 ArrayType *la = PG_GETARG_ARRAYTYPE_P(0);
75 ltree *query = PG_GETARG_LTREE_P(1);
76 bool res = array_iterator(la, ltree_isparent, query, NULL);
77
78 PG_FREE_IF_COPY(la, 0);
79 PG_FREE_IF_COPY(query, 1);
80 PG_RETURN_BOOL(res);
81}
ltree_isparent
PGDLLEXPORT Datum ltree_isparent(PG_FUNCTION_ARGS)
Definition: ltree_op.c:237
PG_GETARG_LTREE_P
#define PG_GETARG_LTREE_P(n)
Definition: ltree.h:218
ltree
Definition: ltree.h:43

References array_iterator(), ltree_isparent(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_LTREE_P, and PG_RETURN_BOOL.

Referenced by _ltree_r_isparent().

◆ _ltree_risparent()

PGDLLEXPORT Datum _ltree_risparent ( PG_FUNCTION_ARGS  )

Definition at line 93 of file _ltree_op.c.

94{
95 ArrayType *la = PG_GETARG_ARRAYTYPE_P(0);
96 ltree *query = PG_GETARG_LTREE_P(1);
97 bool res = array_iterator(la, ltree_risparent, query, NULL);
98
99 PG_FREE_IF_COPY(la, 0);
100 PG_FREE_IF_COPY(query, 1);
101 PG_RETURN_BOOL(res);
102}
ltree_risparent
PGDLLEXPORT Datum ltree_risparent(PG_FUNCTION_ARGS)
Definition: ltree_op.c:249

References array_iterator(), ltree_risparent(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_LTREE_P, and PG_RETURN_BOOL.

Referenced by _ltree_r_risparent().

◆ _ltxtq_exec()

PGDLLEXPORT Datum _ltxtq_exec ( PG_FUNCTION_ARGS  )

Definition at line 179 of file _ltree_op.c.

180{
181 ArrayType *la = PG_GETARG_ARRAYTYPE_P(0);
182 ltxtquery *query = PG_GETARG_LTXTQUERY_P(1);
183 bool res = array_iterator(la, ltxtq_exec, query, NULL);
184
185 PG_FREE_IF_COPY(la, 0);
186 PG_FREE_IF_COPY(query, 1);
187 PG_RETURN_BOOL(res);
188}
PG_GETARG_LTXTQUERY_P
#define PG_GETARG_LTXTQUERY_P(n)
Definition: ltree.h:228
ltxtq_exec
PGDLLEXPORT Datum ltxtq_exec(PG_FUNCTION_ARGS)
Definition: ltxtquery_op.c:84

References array_iterator(), ltxtq_exec(), PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_LTXTQUERY_P, and PG_RETURN_BOOL.

Referenced by _ltxtq_rexec().

◆ _ltxtq_rexec()

PGDLLEXPORT Datum _ltxtq_rexec ( PG_FUNCTION_ARGS  )

Definition at line 191 of file _ltree_op.c.

192{
193 PG_RETURN_DATUM(DirectFunctionCall2(_ltxtq_exec,
194 PG_GETARG_DATUM(1),
195 PG_GETARG_DATUM(0)
196 ));
197}
_ltxtq_exec
Datum _ltxtq_exec(PG_FUNCTION_ARGS)
Definition: _ltree_op.c:179

References _ltxtq_exec(), DirectFunctionCall2, PG_GETARG_DATUM, and PG_RETURN_DATUM.

◆ compare_subnode()

bool compare_subnode ( ltree_level *  t,
char *  qn,
int  len,
int(*)(const char *, const char *, size_t)  cmpptr,
bool  anyend 
)

Definition at line 44 of file lquery_op.c.

45{
46 char *endt = t->name + t->len;
47 char *endq = qn + len;
48 char *tn;
49 int lent,
50 lenq;
51 bool isok;
52
53 while ((qn = getlexeme(qn, endq, &lenq)) != NULL)
54 {
55 tn = t->name;
56 isok = false;
57 while ((tn = getlexeme(tn, endt, &lent)) != NULL)
58 {
59 if ((lent == lenq || (lent > lenq && anyend)) &&
60 (*cmpptr) (qn, tn, lenq) == 0)
61 {
62
63 isok = true;
64 break;
65 }
66 tn += lent;
67 }
68
69 if (!isok)
70 return false;
71 qn += lenq;
72 }
73
74 return true;
75}
getlexeme
static char * getlexeme(char *start, char *end, int *len)
Definition: lquery_op.c:25
len
const void size_t len
Definition: pg_crc32c_sse42.c:28
ltree_level::name
char name[FLEXIBLE_ARRAY_MEMBER]
Definition: ltree.h:36
ltree_level::len
uint16 len
Definition: ltree.h:35

References getlexeme(), ltree_level::len, len, and ltree_level::name.

Referenced by checkcondition_str(), and checkLevel().

◆ inner_isparent()

bool inner_isparent ( const ltree *  c,
const ltree *  p 
)

Definition at line 213 of file ltree_op.c.

214{
215 ltree_level *cl = LTREE_FIRST(c);
216 ltree_level *pl = LTREE_FIRST(p);
217 int pn = p->numlevel;
218
219 if (pn > c->numlevel)
220 return false;
221
222 while (pn > 0)
223 {
224 if (cl->len != pl->len)
225 return false;
226 if (memcmp(cl->name, pl->name, cl->len) != 0)
227 return false;
228
229 pn--;
230 cl = LEVEL_NEXT(cl);
231 pl = LEVEL_NEXT(pl);
232 }
233 return true;
234}
LTREE_FIRST
#define LTREE_FIRST(x)
Definition: ltree.h:51
LEVEL_NEXT
#define LEVEL_NEXT(x)
Definition: ltree.h:40
c
char * c
Definition: preproc-cursor.c:31
ltree_level
Definition: ltree.h:34
ltree::numlevel
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().

◆ lca_inner()

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

Definition at line 496 of file ltree_op.c.

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

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

Referenced by _lca(), and lca().

◆ lt_q_regex()

PGDLLEXPORT Datum lt_q_regex ( PG_FUNCTION_ARGS  )

Definition at line 239 of file lquery_op.c.

240{
241 ltree *tree = PG_GETARG_LTREE_P(0);
242 ArrayType *_query = PG_GETARG_ARRAYTYPE_P(1);
243 lquery *query = (lquery *) ARR_DATA_PTR(_query);
244 bool res = false;
245 int num = ArrayGetNItems(ARR_NDIM(_query), ARR_DIMS(_query));
246
247 if (ARR_NDIM(_query) > 1)
248 ereport(ERROR,
249 (errcode(ERRCODE_ARRAY_SUBSCRIPT_ERROR),
250 errmsg("array must be one-dimensional")));
251 if (array_contains_nulls(_query))
252 ereport(ERROR,
253 (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
254 errmsg("array must not contain nulls")));
255
256 while (num > 0)
257 {
258 if (DatumGetBool(DirectFunctionCall2(ltq_regex,
259 PointerGetDatum(tree), PointerGetDatum(query))))
260 {
261
262 res = true;
263 break;
264 }
265 num--;
266 query = NEXTVAL(query);
267 }
268
269 PG_FREE_IF_COPY(tree, 0);
270 PG_FREE_IF_COPY(_query, 1);
271 PG_RETURN_BOOL(res);
272}
NEXTVAL
#define NEXTVAL(x)
Definition: lquery_op.c:22
DatumGetBool
static bool DatumGetBool(Datum X)
Definition: postgres.h:95
PointerGetDatum
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:327
tree
tree
Definition: radixtree.h:1828

References ARR_DATA_PTR, ARR_DIMS, ARR_NDIM, array_contains_nulls(), ArrayGetNItems(), DatumGetBool(), DirectFunctionCall2, ereport, errcode(), errmsg(), ERROR, ltq_regex(), NEXTVAL, PG_FREE_IF_COPY, PG_GETARG_ARRAYTYPE_P, PG_GETARG_LTREE_P, PG_RETURN_BOOL, PointerGetDatum(), and tree.

Referenced by lt_q_rregex(), and ltree_consistent().

◆ lt_q_rregex()

PGDLLEXPORT Datum lt_q_rregex ( PG_FUNCTION_ARGS  )

Definition at line 275 of file lquery_op.c.

276{
277 PG_RETURN_DATUM(DirectFunctionCall2(lt_q_regex,
278 PG_GETARG_DATUM(1),
279 PG_GETARG_DATUM(0)
280 ));
281}
lt_q_regex
Datum lt_q_regex(PG_FUNCTION_ARGS)
Definition: lquery_op.c:239

References DirectFunctionCall2, lt_q_regex(), PG_GETARG_DATUM, and PG_RETURN_DATUM.

◆ ltq_regex()

PGDLLEXPORT Datum ltq_regex ( PG_FUNCTION_ARGS  )

Definition at line 215 of file lquery_op.c.

216{
217 ltree *tree = PG_GETARG_LTREE_P(0);
218 lquery *query = PG_GETARG_LQUERY_P(1);
219 bool res;
220
221 res = checkCond(LQUERY_FIRST(query), query->numlevel,
222 LTREE_FIRST(tree), tree->numlevel);
223
224 PG_FREE_IF_COPY(tree, 0);
225 PG_FREE_IF_COPY(query, 1);
226 PG_RETURN_BOOL(res);
227}
checkCond
static bool checkCond(lquery_level *curq, int qlen, ltree_level *curt, int tlen)
Definition: lquery_op.c:136
LQUERY_FIRST
#define LQUERY_FIRST(x)
Definition: ltree.h:124
lquery::numlevel
uint16 numlevel
Definition: ltree.h:116

References checkCond(), LQUERY_FIRST, LTREE_FIRST, lquery::numlevel, PG_FREE_IF_COPY, PG_GETARG_LQUERY_P, PG_GETARG_LTREE_P, PG_RETURN_BOOL, and tree.

Referenced by _lt_q_regex(), _ltq_extract_regex(), _ltq_regex(), lt_q_regex(), ltq_rregex(), and ltree_consistent().

◆ ltq_rregex()

PGDLLEXPORT Datum ltq_rregex ( PG_FUNCTION_ARGS  )

Definition at line 230 of file lquery_op.c.

231{
232 PG_RETURN_DATUM(DirectFunctionCall2(ltq_regex,
233 PG_GETARG_DATUM(1),
234 PG_GETARG_DATUM(0)
235 ));
236}

References DirectFunctionCall2, ltq_regex(), PG_GETARG_DATUM, and PG_RETURN_DATUM.

◆ ltree_addltree()

PGDLLEXPORT Datum ltree_addltree ( PG_FUNCTION_ARGS  )

Definition at line 367 of file ltree_op.c.

368{
369 ltree *a = PG_GETARG_LTREE_P(0);
370 ltree *b = PG_GETARG_LTREE_P(1);
371 ltree *r;
372
373 r = ltree_concat(a, b);
374 PG_FREE_IF_COPY(a, 0);
375 PG_FREE_IF_COPY(b, 1);
376 PG_RETURN_POINTER(r);
377}
PG_RETURN_POINTER
#define PG_RETURN_POINTER(x)
Definition: fmgr.h:361
b
int b
Definition: isn.c:74
ltree_concat
static ltree * ltree_concat(ltree *a, ltree *b)
Definition: ltree_op.c:344

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

◆ ltree_addtext()

PGDLLEXPORT Datum ltree_addtext ( PG_FUNCTION_ARGS  )

Definition at line 380 of file ltree_op.c.

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

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_compare()

int ltree_compare ( const ltree *  a,
const ltree *  b 
)

Definition at line 46 of file ltree_op.c.

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

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

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

◆ ltree_execute()

bool ltree_execute ( ITEM *  curitem,
void *  checkval,
bool  calcnot,
bool(*)(void *checkval, ITEM *val)  chkcond 
)

Definition at line 20 of file ltxtquery_op.c.

21{
22 /* since this function recurses, it could be driven to stack overflow */
23 check_stack_depth();
24
25 if (curitem->type == VAL)
26 return (*chkcond) (checkval, curitem);
27 else if (curitem->val == (int32) '!')
28 {
29 return calcnot ?
30 ((ltree_execute(curitem + 1, checkval, calcnot, chkcond)) ? false : true)
31 : true;
32 }
33 else if (curitem->val == (int32) '&')
34 {
35 if (ltree_execute(curitem + curitem->left, checkval, calcnot, chkcond))
36 return ltree_execute(curitem + 1, checkval, calcnot, chkcond);
37 else
38 return false;
39 }
40 else
41 { /* |-operator */
42 if (ltree_execute(curitem + curitem->left, checkval, calcnot, chkcond))
43 return true;
44 else
45 return ltree_execute(curitem + 1, checkval, calcnot, chkcond);
46 }
47}
VAL
#define VAL
Definition: _int.h:162
int32
int32_t int32
Definition: c.h:498
true
return true
Definition: isn.c:130
ltree_execute
bool ltree_execute(ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *val))
Definition: ltxtquery_op.c:20
check_stack_depth
void check_stack_depth(void)
Definition: stack_depth.c:95
ITEM::left
int16 left
Definition: _int.h:143
ITEM::val
int32 val
Definition: _int.h:144
ITEM::type
int16 type
Definition: _int.h:142

References check_stack_depth(), ITEM::left, ltree_execute(), ITEM::type, ITEM::val, and VAL.

Referenced by gist_qtxt(), ltree_execute(), and ltxtq_exec().

◆ ltree_gist_alloc()

ltree_gist * ltree_gist_alloc ( bool  isalltrue,
BITVECP  sign,
int  siglen,
ltree *  left,
ltree *  right 
)

Definition at line 42 of file ltree_gist.c.

44{
45 int32 size = LTG_HDRSIZE + (isalltrue ? 0 : siglen) +
46 (left ? VARSIZE(left) + (right ? VARSIZE(right) : 0) : 0);
47 ltree_gist *result = palloc(size);
48
49 SET_VARSIZE(result, size);
50
51 if (siglen)
52 {
53 result->flag = 0;
54
55 if (isalltrue)
56 result->flag |= LTG_ALLTRUE;
57 else if (sign)
58 memcpy(LTG_SIGN(result), sign, siglen);
59 else
60 memset(LTG_SIGN(result), 0, siglen);
61
62 if (left)
63 {
64 memcpy(LTG_LNODE(result, siglen), left, VARSIZE(left));
65
66 if (!right || left == right || ISEQ(left, right))
67 result->flag |= LTG_NORIGHT;
68 else
69 memcpy(LTG_RNODE(result, siglen), right, VARSIZE(right));
70 }
71 }
72 else
73 {
74 Assert(left);
75 result->flag = LTG_ONENODE;
76 memcpy(LTG_NODE(result), left, VARSIZE(left));
77 }
78
79 return result;
80}
Assert
Assert(PointerIsAligned(start, uint64))
sign
char sign
Definition: informix.c:693
LTG_HDRSIZE
#define LTG_HDRSIZE
Definition: ltree.h:277
LTG_RNODE
#define LTG_RNODE(x, siglen)
Definition: ltree.h:285
LTG_ONENODE
#define LTG_ONENODE
Definition: ltree.h:273
LTG_ALLTRUE
#define LTG_ALLTRUE
Definition: ltree.h:274
LTG_NORIGHT
#define LTG_NORIGHT
Definition: ltree.h:275
LTG_SIGN
#define LTG_SIGN(x)
Definition: ltree.h:278
LTG_LNODE
#define LTG_LNODE(x, siglen)
Definition: ltree.h:283
LTG_NODE
#define LTG_NODE(x)
Definition: ltree.h:279
ISEQ
#define ISEQ(a, b)
Definition: ltree_gist.c:16
palloc
void * palloc(Size size)
Definition: mcxt.c:1321
ltree_gist
Definition: ltree.h:267
ltree_gist::flag
uint32 flag
Definition: ltree.h:269
VARSIZE
#define VARSIZE(PTR)
Definition: varatt.h:279

References Assert(), ltree_gist::flag, ISEQ, LTG_ALLTRUE, LTG_HDRSIZE, LTG_LNODE, LTG_NODE, LTG_NORIGHT, LTG_ONENODE, LTG_RNODE, LTG_SIGN, palloc(), SET_VARSIZE, sign, and VARSIZE.

Referenced by _ltree_compress(), _ltree_picksplit(), _ltree_union(), ltree_compress(), ltree_picksplit(), and ltree_union().

◆ ltree_in()

PGDLLEXPORT Datum ltree_in ( PG_FUNCTION_ARGS  )

Definition at line 174 of file ltree_io.c.

175{
176 char *buf = (char *) PG_GETARG_POINTER(0);
177 ltree *res;
178
179 if ((res = parse_ltree(buf, fcinfo->context)) == NULL)
180 PG_RETURN_NULL();
181
182 PG_RETURN_POINTER(res);
183}
PG_GETARG_POINTER
#define PG_GETARG_POINTER(n)
Definition: fmgr.h:276
PG_RETURN_NULL
#define PG_RETURN_NULL()
Definition: fmgr.h:345
parse_ltree
static ltree * parse_ltree(const char *buf, struct Node *escontext)
Definition: ltree_io.c:36
buf
static char * buf
Definition: pg_test_fsync.c:72

References buf, parse_ltree(), PG_GETARG_POINTER, PG_RETURN_NULL, and PG_RETURN_POINTER.

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

◆ ltree_isparent()

PGDLLEXPORT Datum ltree_isparent ( PG_FUNCTION_ARGS  )

Definition at line 237 of file ltree_op.c.

238{
239 ltree *c = PG_GETARG_LTREE_P(1);
240 ltree *p = PG_GETARG_LTREE_P(0);
241 bool res = inner_isparent(c, p);
242
243 PG_FREE_IF_COPY(c, 1);
244 PG_FREE_IF_COPY(p, 0);
245 PG_RETURN_BOOL(res);
246}
inner_isparent
bool inner_isparent(const ltree *c, const ltree *p)
Definition: ltree_op.c:213

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

Referenced by _ltree_extract_isparent(), and _ltree_isparent().

◆ ltree_risparent()

PGDLLEXPORT Datum ltree_risparent ( PG_FUNCTION_ARGS  )

Definition at line 249 of file ltree_op.c.

250{
251 ltree *c = PG_GETARG_LTREE_P(0);
252 ltree *p = PG_GETARG_LTREE_P(1);
253 bool res = inner_isparent(c, p);
254
255 PG_FREE_IF_COPY(c, 0);
256 PG_FREE_IF_COPY(p, 1);
257 PG_RETURN_BOOL(res);
258}

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

Referenced by _ltree_extract_risparent(), and _ltree_risparent().

◆ ltree_strncasecmp()

int ltree_strncasecmp ( const char *  a,
const char *  b,
size_t  s 
)

Definition at line 78 of file lquery_op.c.

79{
80 char *al = str_tolower(a, s, DEFAULT_COLLATION_OID);
81 char *bl = str_tolower(b, s, DEFAULT_COLLATION_OID);
82 int res;
83
84 res = strncmp(al, bl, s);
85
86 pfree(al);
87 pfree(bl);
88
89 return res;
90}
str_tolower
char * str_tolower(const char *buff, size_t nbytes, Oid collid)
Definition: formatting.c:1637

References a, b, pfree(), and str_tolower().

Referenced by checkcondition_str(), and checkLevel().

◆ ltree_textadd()

PGDLLEXPORT Datum ltree_textadd ( PG_FUNCTION_ARGS  )

Definition at line 465 of file ltree_op.c.

466{
467 ltree *a = PG_GETARG_LTREE_P(1);
468 text *b = PG_GETARG_TEXT_PP(0);
469 char *s;
470 ltree *r,
471 *tmp;
472
473 s = text_to_cstring(b);
474
475 tmp = (ltree *) DatumGetPointer(DirectFunctionCall1(ltree_in,
476 PointerGetDatum(s)));
477
478 pfree(s);
479
480 r = ltree_concat(tmp, a);
481
482 pfree(tmp);
483
484 PG_FREE_IF_COPY(a, 1);
485 PG_FREE_IF_COPY(b, 0);
486 PG_RETURN_POINTER(r);
487}

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().

◆ ltxtq_exec()

PGDLLEXPORT Datum ltxtq_exec ( PG_FUNCTION_ARGS  )

Definition at line 84 of file ltxtquery_op.c.

85{
86 ltree *val = PG_GETARG_LTREE_P(0);
87 ltxtquery *query = PG_GETARG_LTXTQUERY_P(1);
88 CHKVAL chkval;
89 bool result;
90
91 chkval.node = val;
92 chkval.operand = GETOPERAND(query);
93
94 result = ltree_execute(GETQUERY(query),
95 &chkval,
96 true,
97 checkcondition_str);
98
99 PG_FREE_IF_COPY(val, 0);
100 PG_FREE_IF_COPY(query, 1);
101 PG_RETURN_BOOL(result);
102}
GETQUERY
#define GETQUERY(x)
Definition: _int.h:157
val
long val
Definition: informix.c:689
GETOPERAND
#define GETOPERAND(x)
Definition: ltree.h:165
checkcondition_str
static bool checkcondition_str(void *checkval, ITEM *val)
Definition: ltxtquery_op.c:56
CHKVAL::operand
char * operand
Definition: ltxtquery_op.c:52
CHKVAL::node
ltree * node
Definition: ltxtquery_op.c:51

References checkcondition_str(), GETOPERAND, GETQUERY, ltree_execute(), CHKVAL::node, CHKVAL::operand, PG_FREE_IF_COPY, PG_GETARG_LTREE_P, PG_GETARG_LTXTQUERY_P, PG_RETURN_BOOL, and val.

Referenced by _ltxtq_exec(), _ltxtq_extract_exec(), ltree_consistent(), and ltxtq_rexec().

◆ ltxtq_rexec()

PGDLLEXPORT Datum ltxtq_rexec ( PG_FUNCTION_ARGS  )

Definition at line 105 of file ltxtquery_op.c.

106{
107 PG_RETURN_DATUM(DirectFunctionCall2(ltxtq_exec,
108 PG_GETARG_DATUM(1),
109 PG_GETARG_DATUM(0)
110 ));
111}
ltxtq_exec
Datum ltxtq_exec(PG_FUNCTION_ARGS)
Definition: ltxtquery_op.c:84

References DirectFunctionCall2, ltxtq_exec(), PG_GETARG_DATUM, and PG_RETURN_DATUM.