#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:

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 255

#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 \| LVAR_INCASE ) ) == 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	ISALNUM(x) ( t_isalpha(x) \|\| t_isdigit(x) \|\| ( pg_mblen(x) == 1 && 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	SIGLEN_MAX GISTMaxIndexKeySize

#define	SIGLEN_DEFAULT (2 * sizeof(int32))

#define	BITBYTE 8

#define	SIGLEN (sizeof(int32) * SIGLENINT)

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

#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
Datum	ltree_isparent (PG_FUNCTION_ARGS)

Datum	ltree_risparent (PG_FUNCTION_ARGS)

Datum	ltq_regex (PG_FUNCTION_ARGS)

Datum	ltq_rregex (PG_FUNCTION_ARGS)

Datum	lt_q_regex (PG_FUNCTION_ARGS)

Datum	lt_q_rregex (PG_FUNCTION_ARGS)

Datum	ltxtq_exec (PG_FUNCTION_ARGS)

Datum	ltxtq_rexec (PG_FUNCTION_ARGS)

Datum	_ltq_regex (PG_FUNCTION_ARGS)

Datum	_ltq_rregex (PG_FUNCTION_ARGS)

Datum	_lt_q_regex (PG_FUNCTION_ARGS)

Datum	_lt_q_rregex (PG_FUNCTION_ARGS)

Datum	_ltxtq_exec (PG_FUNCTION_ARGS)

Datum	_ltxtq_rexec (PG_FUNCTION_ARGS)

Datum	_ltree_isparent (PG_FUNCTION_ARGS)

Datum	_ltree_risparent (PG_FUNCTION_ARGS)

Datum	ltree_addltree (PG_FUNCTION_ARGS)

Datum	ltree_addtext (PG_FUNCTION_ARGS)

Datum	ltree_textadd (PG_FUNCTION_ARGS)

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 q, 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 290 of file ltree.h.

Referenced by hashing().

◆ AHASHVAL

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

Definition at line 289 of file ltree.h.

Referenced by checkcondition_bit(), gist_qe(), and gist_te().

◆ ALOOPBYTE

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

Definition at line 286 of file ltree.h.

Referenced by _ltree_compress(), _ltree_picksplit(), _ltree_same(), hemdistsign(), and unionkey().

◆ ASIGLENBIT

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

Definition at line 284 of file ltree.h.

Referenced by hemdist().

◆ BITBYTE

#define BITBYTE 8

Definition at line 221 of file ltree.h.

◆ CLOSE

#define CLOSE 5

Definition at line 160 of file ltree.h.

◆ CLRBIT

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

Definition at line 232 of file ltree.h.

◆ COMPUTESIZE

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

Definition at line 147 of file ltree.h.

◆ DatumGetLqueryP

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

Definition at line 207 of file ltree.h.

◆ DatumGetLqueryPCopy

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

Definition at line 208 of file ltree.h.

◆ DatumGetLtreeP

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

Definition at line 202 of file ltree.h.

Referenced by ltree_compress().

◆ DatumGetLtreePCopy

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

Definition at line 203 of file ltree.h.

◆ DatumGetLtxtqueryP

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

Definition at line 212 of file ltree.h.

◆ DatumGetLtxtqueryPCopy

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

Definition at line 213 of file ltree.h.

◆ END

#define END 0

Definition at line 155 of file ltree.h.

◆ ERR

#define ERR 1

Definition at line 156 of file ltree.h.

◆ FLG_CANLOOKSIGN

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

Definition at line 96 of file ltree.h.

Referenced by checkcondition_bit().

◆ GETBIT

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

Definition at line 234 of file ltree.h.

◆ GETBITBYTE

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

Definition at line 231 of file ltree.h.

◆ GETBYTE

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

Definition at line 230 of file ltree.h.

◆ GETOPERAND

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

Definition at line 151 of file ltree.h.

Referenced by cleanup_tsquery_stopwords(), collectTSQueryValues(), CompareTSQ(), find_wordentry(), gin_extract_tsquery(), hlfinditem(), join_tsqueries(), ltxtq_exec(), ltxtq_out(), mcelem_tsquery_selec(), parse_tsquery(), QTN2QT(), queryin(), SortAndUniqItems(), ts_match_vq(), tsquery_not(), tsquery_rewrite(), tsquery_rewrite_query(), tsqueryout(), tsqueryrecv(), tsquerysend(), and tsquerytree().

◆ GETQUERY

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

Definition at line 150 of file ltree.h.

◆ HASH

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

Definition at line 237 of file ltree.h.

◆ HASHVAL

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

Definition at line 236 of file ltree.h.

◆ HDRSIZEQT

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

Definition at line 146 of file ltree.h.

◆ ISALNUM

#define ISALNUM ( x ) ( t_isalpha(x) || t_isdigit(x) || ( pg_mblen(x) == 1 && t_iseq((x), '_') ) )

Definition at line 116 of file ltree.h.

Referenced by gettoken_query(), lquery_in(), and ltree_in().

◆ ISOPERATOR

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

Definition at line 153 of file ltree.h.

Referenced by gettoken_query_websearch(), and gettoken_tsvector().

◆ LEVEL_HDRSIZE

#define LEVEL_HDRSIZE (offsetof(ltree_level,name))

Definition at line 26 of file ltree.h.

Referenced by lca_inner(), and ltree_in().

◆ LEVEL_NEXT

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

Definition at line 27 of file ltree.h.

Referenced by checkCond(), checkcondition_str(), gist_te(), gist_tqcmp(), hashing(), inner_isparent(), inner_subltree(), lca_inner(), ltree2text(), ltree_compare(), ltree_in(), ltree_index(), ltree_out(), and ltree_to_plpython().

◆ LOOPBYTE

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

Definition at line 227 of file ltree.h.

◆ LQL_CANLOOKSIGN

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

Definition at line 98 of file ltree.h.

Referenced by gist_qe().

◆ LQL_COUNT

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

Definition at line 91 of file ltree.h.

Referenced by checkCond(), lquery_in(), and lquery_out().

◆ LQL_FIRST

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

Definition at line 88 of file ltree.h.

Referenced by checkLevel(), gist_qe(), gist_tqcmp(), lquery_in(), and lquery_out().

◆ LQL_HDRSIZE

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

Definition at line 86 of file ltree.h.

Referenced by lquery_in().

◆ LQL_NEXT

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

Definition at line 87 of file ltree.h.

Referenced by checkCond(), gist_qe(), gist_tqcmp(), lquery_in(), and lquery_out().

◆ LQL_NOT

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

Definition at line 90 of file ltree.h.

Referenced by checkLevel(), lquery_in(), and lquery_out().

◆ LQUERY_FIRST

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

Definition at line 111 of file ltree.h.

Referenced by gist_qe(), gist_tqcmp(), lquery_in(), lquery_out(), and ltq_regex().

◆ LQUERY_HASNOT

#define LQUERY_HASNOT 0x01

Definition at line 114 of file ltree.h.

Referenced by lquery_in().

◆ LQUERY_HDRSIZE

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

Definition at line 110 of file ltree.h.

Referenced by lquery_in().

◆ LQUERY_MAX_LEVELS

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

Definition at line 112 of file ltree.h.

Referenced by lquery_in().

◆ LTG_ALLTRUE

#define LTG_ALLTRUE 0x02

Definition at line 258 of file ltree.h.

Referenced by _ltree_union(), and ltree_gist_alloc().

◆ LTG_GETLNODE

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

Definition at line 271 of file ltree.h.

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

◆ LTG_GETRNODE

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

Definition at line 272 of file ltree.h.

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

◆ LTG_HDRSIZE

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

Definition at line 261 of file ltree.h.

Referenced by _ltree_union(), and ltree_gist_alloc().

◆ LTG_ISALLTRUE

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

Definition at line 265 of file ltree.h.

Referenced by _ltree_compress(), _ltree_picksplit(), _ltree_same(), gist_qe(), gist_qtxt(), gist_te(), hemdist(), ltree_picksplit(), ltree_same(), ltree_union(), and unionkey().

◆ LTG_ISNORIGHT

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

Definition at line 266 of file ltree.h.

◆ LTG_ISONENODE

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

Definition at line 264 of file ltree.h.

Referenced by ltree_picksplit(), ltree_same(), and ltree_union().

◆ LTG_LNODE

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

Definition at line 267 of file ltree.h.

Referenced by ltree_gist_alloc(), ltree_same(), and ltree_union().

◆ LTG_NODE

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

Definition at line 263 of file ltree.h.

Referenced by ltree_consistent(), ltree_gist_alloc(), ltree_picksplit(), ltree_same(), and ltree_union().

◆ LTG_NORIGHT

#define LTG_NORIGHT 0x04

Definition at line 259 of file ltree.h.

Referenced by ltree_gist_alloc().

◆ LTG_ONENODE

#define LTG_ONENODE 0x01

Definition at line 257 of file ltree.h.

Referenced by ltree_gist_alloc().

◆ LTG_RENODE

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

Definition at line 268 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 269 of file ltree.h.

Referenced by ltree_gist_alloc(), ltree_same(), and ltree_union().

◆ LTG_SIGN

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

Definition at line 262 of file ltree.h.

Referenced by _ltree_compress(), _ltree_picksplit(), _ltree_same(), _ltree_union(), gist_qe(), gist_qtxt(), gist_te(), hemdist(), ltree_gist_alloc(), ltree_picksplit(), ltree_same(), ltree_union(), and unionkey().

◆ LTREE_ASIGLEN_DEFAULT

#define LTREE_ASIGLEN_DEFAULT (7 * sizeof(int32))

Definition at line 279 of file ltree.h.

Referenced by _ltree_gist_options().

◆ LTREE_ASIGLEN_MAX

#define LTREE_ASIGLEN_MAX GISTMaxIndexKeySize

Definition at line 280 of file ltree.h.

Referenced by _ltree_gist_options().

◆ LTREE_FIRST

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

Definition at line 38 of file ltree.h.

Referenced by checkcondition_str(), gist_te(), gist_tqcmp(), hashing(), inner_isparent(), inner_subltree(), lca_inner(), ltq_regex(), ltree2text(), ltree_compare(), ltree_concat(), ltree_in(), ltree_index(), ltree_out(), and ltree_to_plpython().

◆ LTREE_GET_ASIGLEN

#define LTREE_GET_ASIGLEN ( )

Value:

(PG_HAS_OPCLASS_OPTIONS() ? \
                                 ((LtreeGistOptions *) PG_GET_OPCLASS_OPTIONS())->siglen : \
                                 LTREE_ASIGLEN_DEFAULT)

Definition at line 281 of file ltree.h.

Referenced by _ltree_compress(), _ltree_consistent(), _ltree_penalty(), _ltree_picksplit(), _ltree_same(), _ltree_union(), ltree_consistent(), ltree_penalty(), ltree_picksplit(), ltree_same(), and ltree_union().

◆ LTREE_HDRSIZE

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

Definition at line 37 of file ltree.h.

Referenced by inner_subltree(), lca_inner(), ltree_concat(), and ltree_in().

◆ LTREE_LABEL_MAX_CHARS

#define LTREE_LABEL_MAX_CHARS 255

Definition at line 18 of file ltree.h.

Referenced by lquery_in(), and ltree_in().

◆ LTREE_MAX_LEVELS

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

Definition at line 39 of file ltree.h.

Referenced by lquery_in(), lquery_out(), ltree_concat(), and ltree_in().

◆ LTXTQUERY_TOO_BIG

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

Definition at line 148 of file ltree.h.

Referenced by queryin().

◆ LVAR_ANYEND

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

Definition at line 61 of file ltree.h.

Referenced by checkcondition_str(), checkLevel(), gettoken_query(), infix(), lquery_in(), and lquery_out().

◆ LVAR_HDRSIZE

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

Definition at line 58 of file ltree.h.

Referenced by lquery_in().

◆ LVAR_INCASE

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

Definition at line 62 of file ltree.h.

Referenced by checkcondition_str(), checkLevel(), gettoken_query(), infix(), lquery_in(), and lquery_out().

◆ LVAR_NEXT

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

Definition at line 59 of file ltree.h.

Referenced by checkLevel(), gist_qe(), lquery_in(), and lquery_out().

◆ LVAR_SUBLEXEME

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

Definition at line 63 of file ltree.h.

Referenced by checkcondition_str(), checkLevel(), gettoken_query(), infix(), lquery_in(), and lquery_out().

◆ OPEN

#define OPEN 4

Definition at line 159 of file ltree.h.

◆ OPR

#define OPR 3

Definition at line 158 of file ltree.h.

◆ PG_GETARG_LQUERY_P

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

Definition at line 209 of file ltree.h.

Referenced by _ltq_extract_regex(), _ltq_regex(), lquery_out(), ltq_regex(), and ltree_consistent().

◆ PG_GETARG_LQUERY_P_COPY

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

Definition at line 210 of file ltree.h.

◆ PG_GETARG_LTREE_P

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

Definition at line 204 of file ltree.h.

Referenced by _ltree_extract_isparent(), _ltree_extract_risparent(), _ltree_isparent(), _ltree_risparent(), lca(), lt_q_regex(), ltq_regex(), ltree2text(), ltree_addltree(), ltree_addtext(), ltree_consistent(), ltree_index(), ltree_isparent(), ltree_out(), ltree_risparent(), ltree_textadd(), ltree_to_plpython(), ltxtq_exec(), nlevel(), subltree(), and subpath().

◆ PG_GETARG_LTREE_P_COPY

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

Definition at line 205 of file ltree.h.

Referenced by ltree_consistent().

◆ PG_GETARG_LTXTQUERY_P

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

Definition at line 214 of file ltree.h.

Referenced by _ltxtq_exec(), _ltxtq_extract_exec(), ltree_consistent(), ltxtq_exec(), and ltxtq_out().

◆ PG_GETARG_LTXTQUERY_P_COPY

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

Definition at line 215 of file ltree.h.

◆ SETBIT

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

Definition at line 233 of file ltree.h.

◆ SIGLEN

#define SIGLEN (sizeof(int32) * SIGLENINT)

Definition at line 222 of file ltree.h.

◆ SIGLEN_DEFAULT

#define SIGLEN_DEFAULT (2 * sizeof(int32))

Definition at line 220 of file ltree.h.

◆ SIGLEN_MAX

#define SIGLEN_MAX GISTMaxIndexKeySize

Definition at line 219 of file ltree.h.

◆ SIGLENBIT

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

Definition at line 223 of file ltree.h.

◆ VAL

#define VAL 2

Definition at line 157 of file ltree.h.

◆ VALFALSE

#define VALFALSE 7

Definition at line 162 of file ltree.h.

◆ VALTRUE

#define VALTRUE 6 /* for stop words */

Definition at line 161 of file ltree.h.

Referenced by findoprnd().

Typedef Documentation

◆ BITVECP

typedef unsigned char* BITVECP

Definition at line 225 of file ltree.h.

◆ ITEM

typedef struct ITEM ITEM

Function Documentation

◆ _lt_q_regex()

Datum _lt_q_regex ( PG_FUNCTION_ARGS )

Definition at line 134 of file _ltree_op.c.

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

 {
     ArrayType  *_tree = PG_GETARG_ARRAYTYPE_P(0);
     ArrayType  *_query = PG_GETARG_ARRAYTYPE_P(1);
     lquery     *query = (lquery *) ARR_DATA_PTR(_query);
     bool        res = false;
     int         num = ArrayGetNItems(ARR_NDIM(_query), ARR_DIMS(_query));
 
     if (ARR_NDIM(_query) > 1)
         ereport(ERROR,
                 (errcode(ERRCODE_ARRAY_SUBSCRIPT_ERROR),
                  errmsg("array must be one-dimensional")));
     if (array_contains_nulls(_query))
         ereport(ERROR,
                 (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
                  errmsg("array must not contain nulls")));
 
     while (num > 0)
     {
         if (array_iterator(_tree, ltq_regex, (void *) query, NULL))
         {
             res = true;
             break;
         }
         num--;
         query = (lquery *) NEXTVAL(query);
     }
 
     PG_FREE_IF_COPY(_tree, 0);
     PG_FREE_IF_COPY(_query, 1);
     PG_RETURN_BOOL(res);
 }

◆ _lt_q_rregex()

Datum _lt_q_rregex ( PG_FUNCTION_ARGS )

Definition at line 168 of file _ltree_op.c.

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

 {
     PG_RETURN_DATUM(DirectFunctionCall2(_lt_q_regex,
                                         PG_GETARG_DATUM(1),
                                         PG_GETARG_DATUM(0)
                                         ));
 }

◆ _ltq_regex()

Datum _ltq_regex ( PG_FUNCTION_ARGS )

Definition at line 113 of file _ltree_op.c.

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

 {
     ArrayType  *la = PG_GETARG_ARRAYTYPE_P(0);
     lquery     *query = PG_GETARG_LQUERY_P(1);
     bool        res = array_iterator(la, ltq_regex, (void *) query, NULL);
 
     PG_FREE_IF_COPY(la, 0);
     PG_FREE_IF_COPY(query, 1);
     PG_RETURN_BOOL(res);
 }

◆ _ltq_rregex()

Datum _ltq_rregex ( PG_FUNCTION_ARGS )

Definition at line 125 of file _ltree_op.c.

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

 {
     PG_RETURN_DATUM(DirectFunctionCall2(_ltq_regex,
                                         PG_GETARG_DATUM(1),
                                         PG_GETARG_DATUM(0)
                                         ));
 }

◆ _ltree_isparent()

Datum _ltree_isparent ( PG_FUNCTION_ARGS )

Definition at line 71 of file _ltree_op.c.

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

 {
     ArrayType  *la = PG_GETARG_ARRAYTYPE_P(0);
     ltree      *query = PG_GETARG_LTREE_P(1);
     bool        res = array_iterator(la, ltree_isparent, (void *) query, NULL);
 
     PG_FREE_IF_COPY(la, 0);
     PG_FREE_IF_COPY(query, 1);
     PG_RETURN_BOOL(res);
 }

◆ _ltree_risparent()

Datum _ltree_risparent ( PG_FUNCTION_ARGS )

Definition at line 92 of file _ltree_op.c.

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

 {
     ArrayType  *la = PG_GETARG_ARRAYTYPE_P(0);
     ltree      *query = PG_GETARG_LTREE_P(1);
     bool        res = array_iterator(la, ltree_risparent, (void *) query, NULL);
 
     PG_FREE_IF_COPY(la, 0);
     PG_FREE_IF_COPY(query, 1);
     PG_RETURN_BOOL(res);
 }

◆ _ltxtq_exec()

Datum _ltxtq_exec ( PG_FUNCTION_ARGS )

Definition at line 178 of file _ltree_op.c.

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

 {
     ArrayType  *la = PG_GETARG_ARRAYTYPE_P(0);
     ltxtquery  *query = PG_GETARG_LTXTQUERY_P(1);
     bool        res = array_iterator(la, ltxtq_exec, (void *) query, NULL);
 
     PG_FREE_IF_COPY(la, 0);
     PG_FREE_IF_COPY(query, 1);
     PG_RETURN_BOOL(res);
 }

◆ _ltxtq_rexec()

Datum _ltxtq_rexec ( PG_FUNCTION_ARGS )

Definition at line 190 of file _ltree_op.c.

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

 {
     PG_RETURN_DATUM(DirectFunctionCall2(_ltxtq_exec,
                                         PG_GETARG_DATUM(1),
                                         PG_GETARG_DATUM(0)
                                         ));
 }

◆ compare_subnode()

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

Definition at line 44 of file lquery_op.c.

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

Referenced by checkcondition_str(), and checkLevel().

 {
     char       *endt = t->name + t->len;
     char       *endq = qn + len;
     char       *tn;
     int         lent,
                 lenq;
     bool        isok;
 
     while ((qn = getlexeme(qn, endq, &lenq)) != NULL)
     {
         tn = t->name;
         isok = false;
         while ((tn = getlexeme(tn, endt, &lent)) != NULL)
         {
             if ((lent == lenq || (lent > lenq && anyend)) &&
                 (*cmpptr) (qn, tn, lenq) == 0)
             {
 
                 isok = true;
                 break;
             }
             tn += lent;
         }
 
         if (!isok)
             return false;
         qn += lenq;
     }
 
     return true;
 }

◆ inner_isparent()

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

Definition at line 143 of file ltree_op.c.

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

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

 {
     ltree_level *cl = LTREE_FIRST(c);
     ltree_level *pl = LTREE_FIRST(p);
     int         pn = p->numlevel;
 
     if (pn > c->numlevel)
         return false;
 
     while (pn > 0)
     {
         if (cl->len != pl->len)
             return false;
         if (memcmp(cl->name, pl->name, cl->len) != 0)
             return false;
 
         pn--;
         cl = LEVEL_NEXT(cl);
         pl = LEVEL_NEXT(pl);
     }
     return true;
 }

◆ lca_inner()

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

Definition at line 426 of file ltree_op.c.

References i, ltree_level::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().

 {
     int         tmp,
                 num,
                 i,
                 reslen;
     ltree     **ptr;
     ltree_level *l1,
                *l2;
     ltree      *res;
 
     if (len <= 0)
         return NULL;            /* no inputs? */
     if ((*a)->numlevel == 0)
         return NULL;            /* any empty input means NULL result */
 
     /* num is the length of the longest common ancestor so far */
     num = (*a)->numlevel - 1;
 
     /* Compare each additional input to *a */
     ptr = a + 1;
     while (ptr - a < len)
     {
         if ((*ptr)->numlevel == 0)
             return NULL;
         else if ((*ptr)->numlevel == 1)
             num = 0;
         else
         {
             l1 = LTREE_FIRST(*a);
             l2 = LTREE_FIRST(*ptr);
             tmp = Min(num, (*ptr)->numlevel - 1);
             num = 0;
             for (i = 0; i < tmp; i++)
             {
                 if (l1->len == l2->len &&
                     memcmp(l1->name, l2->name, l1->len) == 0)
                     num = i + 1;
                 else
                     break;
                 l1 = LEVEL_NEXT(l1);
                 l2 = LEVEL_NEXT(l2);
             }
         }
         ptr++;
     }
 
     /* Now compute size of result ... */
     reslen = LTREE_HDRSIZE;
     l1 = LTREE_FIRST(*a);
     for (i = 0; i < num; i++)
     {
         reslen += MAXALIGN(l1->len + LEVEL_HDRSIZE);
         l1 = LEVEL_NEXT(l1);
     }
 
     /* ... and construct it by copying from *a */
     res = (ltree *) palloc0(reslen);
     SET_VARSIZE(res, reslen);
     res->numlevel = num;
 
     l1 = LTREE_FIRST(*a);
     l2 = LTREE_FIRST(res);
 
     for (i = 0; i < num; i++)
     {
         memcpy(l2, l1, MAXALIGN(l1->len + LEVEL_HDRSIZE));
         l1 = LEVEL_NEXT(l1);
         l2 = LEVEL_NEXT(l2);
     }
 
     return res;
 }

◆ lt_q_regex()

Datum lt_q_regex ( PG_FUNCTION_ARGS )

Definition at line 239 of file lquery_op.c.

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, and PointerGetDatum.

Referenced by lt_q_rregex(), and ltree_consistent().

 {
     ltree      *tree = PG_GETARG_LTREE_P(0);
     ArrayType  *_query = PG_GETARG_ARRAYTYPE_P(1);
     lquery     *query = (lquery *) ARR_DATA_PTR(_query);
     bool        res = false;
     int         num = ArrayGetNItems(ARR_NDIM(_query), ARR_DIMS(_query));
 
     if (ARR_NDIM(_query) > 1)
         ereport(ERROR,
                 (errcode(ERRCODE_ARRAY_SUBSCRIPT_ERROR),
                  errmsg("array must be one-dimensional")));
     if (array_contains_nulls(_query))
         ereport(ERROR,
                 (errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED),
                  errmsg("array must not contain nulls")));
 
     while (num > 0)
     {
         if (DatumGetBool(DirectFunctionCall2(ltq_regex,
                                              PointerGetDatum(tree), PointerGetDatum(query))))
         {
 
             res = true;
             break;
         }
         num--;
         query = NEXTVAL(query);
     }
 
     PG_FREE_IF_COPY(tree, 0);
     PG_FREE_IF_COPY(_query, 1);
     PG_RETURN_BOOL(res);
 }

◆ lt_q_rregex()

Datum lt_q_rregex ( PG_FUNCTION_ARGS )

Definition at line 275 of file lquery_op.c.

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

 {
     PG_RETURN_DATUM(DirectFunctionCall2(lt_q_regex,
                                         PG_GETARG_DATUM(1),
                                         PG_GETARG_DATUM(0)
                                         ));
 }

◆ ltq_regex()

Datum ltq_regex ( PG_FUNCTION_ARGS )

Definition at line 215 of file lquery_op.c.

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

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

 {
     ltree      *tree = PG_GETARG_LTREE_P(0);
     lquery     *query = PG_GETARG_LQUERY_P(1);
     bool        res;
 
     res = checkCond(LQUERY_FIRST(query), query->numlevel,
                     LTREE_FIRST(tree), tree->numlevel);
 
     PG_FREE_IF_COPY(tree, 0);
     PG_FREE_IF_COPY(query, 1);
     PG_RETURN_BOOL(res);
 }

◆ ltq_rregex()

Datum ltq_rregex ( PG_FUNCTION_ARGS )

Definition at line 230 of file lquery_op.c.

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

 {
     PG_RETURN_DATUM(DirectFunctionCall2(ltq_regex,
                                         PG_GETARG_DATUM(1),
                                         PG_GETARG_DATUM(0)
                                         ));
 }

◆ ltree_addltree()

Datum ltree_addltree ( PG_FUNCTION_ARGS )

Definition at line 297 of file ltree_op.c.

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

 {
     ltree      *a = PG_GETARG_LTREE_P(0);
     ltree      *b = PG_GETARG_LTREE_P(1);
     ltree      *r;
 
     r = ltree_concat(a, b);
     PG_FREE_IF_COPY(a, 0);
     PG_FREE_IF_COPY(b, 1);
     PG_RETURN_POINTER(r);
 }

◆ ltree_addtext()

Datum ltree_addtext ( PG_FUNCTION_ARGS )

Definition at line 310 of file ltree_op.c.

References 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      *a = PG_GETARG_LTREE_P(0);
     text       *b = PG_GETARG_TEXT_PP(1);
     char       *s;
     ltree      *r,
                *tmp;
 
     s = text_to_cstring(b);
 
     tmp = (ltree *) DatumGetPointer(DirectFunctionCall1(ltree_in,
                                                         PointerGetDatum(s)));
 
     pfree(s);
 
     r = ltree_concat(a, tmp);
 
     pfree(tmp);
 
     PG_FREE_IF_COPY(a, 0);
     PG_FREE_IF_COPY(b, 1);
     PG_RETURN_POINTER(r);
 }

◆ ltree_compare()

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

Definition at line 42 of file ltree_op.c.

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

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

 {
     ltree_level *al = LTREE_FIRST(a);
     ltree_level *bl = LTREE_FIRST(b);
     int         an = a->numlevel;
     int         bn = b->numlevel;
 
     while (an > 0 && bn > 0)
     {
         int         res;
 
         if ((res = memcmp(al->name, bl->name, Min(al->len, bl->len))) == 0)
         {
             if (al->len != bl->len)
                 return (al->len - bl->len) * 10 * (an + 1);
         }
         else
         {
             if (res < 0)
                 res = -1;
             else
                 res = 1;
             return res * 10 * (an + 1);
         }
 
         an--;
         bn--;
         al = LEVEL_NEXT(al);
         bl = LEVEL_NEXT(bl);
     }
 
     return (a->numlevel - b->numlevel) * 10 * (an + 1);
 }

◆ 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.

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

Referenced by gist_qtxt(), and ltxtq_exec().

 {
     /* since this function recurses, it could be driven to stack overflow */
     check_stack_depth();
 
     if (curitem->type == VAL)
         return (*chkcond) (checkval, curitem);
     else if (curitem->val == (int32) '!')
     {
         return calcnot ?
             ((ltree_execute(curitem + 1, checkval, calcnot, chkcond)) ? false : true)
             : true;
     }
     else if (curitem->val == (int32) '&')
     {
         if (ltree_execute(curitem + curitem->left, checkval, calcnot, chkcond))
             return ltree_execute(curitem + 1, checkval, calcnot, chkcond);
         else
             return false;
     }
     else
     {                           /* |-operator */
         if (ltree_execute(curitem + curitem->left, checkval, calcnot, chkcond))
             return true;
         else
             return ltree_execute(curitem + 1, checkval, calcnot, chkcond);
     }
 }

◆ ltree_gist_alloc()

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

Definition at line 39 of file ltree_gist.c.

References Assert, ltree_gist::flag, ISEQ, LTG_ALLTRUE, LTG_HDRSIZE, LTG_LNODE, LTG_NODE, LTG_NORIGHT, LTG_ONENODE, LTG_RNODE, LTG_SIGN, ltree_compress(), ltree_consistent(), ltree_decompress(), ltree_gist_options(), ltree_penalty(), ltree_picksplit(), ltree_same(), ltree_union(), palloc(), PG_FUNCTION_INFO_V1(), SET_VARSIZE, and VARSIZE.

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

 {
     int32       size = LTG_HDRSIZE + (isalltrue ? 0 : siglen) +
         (left ? VARSIZE(left) + (right ? VARSIZE(right) : 0) : 0);
     ltree_gist *result = palloc(size);
 
     SET_VARSIZE(result, size);
 
     if (siglen)
     {
         result->flag = 0;
 
         if (isalltrue)
             result->flag |= LTG_ALLTRUE;
         else if (sign)
             memcpy(LTG_SIGN(result), sign, siglen);
         else
             memset(LTG_SIGN(result), 0, siglen);
 
         if (left)
         {
             memcpy(LTG_LNODE(result, siglen), left, VARSIZE(left));
 
             if (!right || left == right || ISEQ(left, right))
                 result->flag |= LTG_NORIGHT;
             else
                 memcpy(LTG_RNODE(result, siglen), right, VARSIZE(right));
         }
     }
     else
     {
         Assert(left);
         result->flag = LTG_ONENODE;
         memcpy(LTG_NODE(result), left, VARSIZE(left));
     }
 
     return result;
 }

◆ ltree_in()

Datum ltree_in ( PG_FUNCTION_ARGS )

Definition at line 32 of file ltree_io.c.

References buf, elog, ereport, errcode(), errdetail(), errmsg(), ERROR, ISALNUM, ltree_level::len, nodeitem::len, LEVEL_HDRSIZE, LEVEL_NEXT, sort-test::list, LTPRS_WAITDELIM, LTPRS_WAITNAME, LTREE_FIRST, LTREE_HDRSIZE, LTREE_LABEL_MAX_CHARS, LTREE_MAX_LEVELS, MAXALIGN, ltree_level::name, ltree::numlevel, palloc(), palloc0(), pfree(), PG_GETARG_POINTER, pg_mblen(), PG_RETURN_POINTER, SET_VARSIZE, nodeitem::start, t_iseq, UNCHAR, and nodeitem::wlen.

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

 {
     char       *buf = (char *) PG_GETARG_POINTER(0);
     char       *ptr;
     nodeitem   *list,
                *lptr;
     int         num = 0,
                 totallen = 0;
     int         state = LTPRS_WAITNAME;
     ltree      *result;
     ltree_level *curlevel;
     int         charlen;
     int         pos = 1;        /* character position for error messages */
 
 #define UNCHAR ereport(ERROR, \
                        errcode(ERRCODE_SYNTAX_ERROR), \
                        errmsg("ltree syntax error at character %d", \
                               pos))
 
     ptr = buf;
     while (*ptr)
     {
         charlen = pg_mblen(ptr);
         if (charlen == 1 && t_iseq(ptr, '.'))
             num++;
         ptr += charlen;
     }
 
     if (num + 1 > LTREE_MAX_LEVELS)
         ereport(ERROR,
                 (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
                  errmsg("number of ltree labels (%d) exceeds the maximum allowed (%d)",
                         num + 1, LTREE_MAX_LEVELS)));
     list = lptr = (nodeitem *) palloc(sizeof(nodeitem) * (num + 1));
     ptr = buf;
     while (*ptr)
     {
         charlen = pg_mblen(ptr);
 
         if (state == LTPRS_WAITNAME)
         {
             if (ISALNUM(ptr))
             {
                 lptr->start = ptr;
                 lptr->wlen = 0;
                 state = LTPRS_WAITDELIM;
             }
             else
                 UNCHAR;
         }
         else if (state == LTPRS_WAITDELIM)
         {
             if (charlen == 1 && t_iseq(ptr, '.'))
             {
                 lptr->len = ptr - lptr->start;
                 if (lptr->wlen > LTREE_LABEL_MAX_CHARS)
                     ereport(ERROR,
                             (errcode(ERRCODE_NAME_TOO_LONG),
                              errmsg("label string is too long"),
                              errdetail("Label length is %d, must be at most %d, at character %d.",
                                        lptr->wlen, LTREE_LABEL_MAX_CHARS,
                                        pos)));
 
                 totallen += MAXALIGN(lptr->len + LEVEL_HDRSIZE);
                 lptr++;
                 state = LTPRS_WAITNAME;
             }
             else if (!ISALNUM(ptr))
                 UNCHAR;
         }
         else
             /* internal error */
             elog(ERROR, "internal error in parser");
 
         ptr += charlen;
         lptr->wlen++;
         pos++;
     }
 
     if (state == LTPRS_WAITDELIM)
     {
         lptr->len = ptr - lptr->start;
         if (lptr->wlen > LTREE_LABEL_MAX_CHARS)
             ereport(ERROR,
                     (errcode(ERRCODE_NAME_TOO_LONG),
                      errmsg("label string is too long"),
                      errdetail("Label length is %d, must be at most %d, at character %d.",
                                lptr->wlen, LTREE_LABEL_MAX_CHARS, pos)));
 
         totallen += MAXALIGN(lptr->len + LEVEL_HDRSIZE);
         lptr++;
     }
     else if (!(state == LTPRS_WAITNAME && lptr == list))
         ereport(ERROR,
                 (errcode(ERRCODE_SYNTAX_ERROR),
                  errmsg("ltree syntax error"),
                  errdetail("Unexpected end of input.")));
 
     result = (ltree *) palloc0(LTREE_HDRSIZE + totallen);
     SET_VARSIZE(result, LTREE_HDRSIZE + totallen);
     result->numlevel = lptr - list;
     curlevel = LTREE_FIRST(result);
     lptr = list;
     while (lptr - list < result->numlevel)
     {
         curlevel->len = (uint16) lptr->len;
         memcpy(curlevel->name, lptr->start, lptr->len);
         curlevel = LEVEL_NEXT(curlevel);
         lptr++;
     }
 
     pfree(list);
     PG_RETURN_POINTER(result);
 
 #undef UNCHAR
 }

◆ ltree_isparent()

Datum ltree_isparent ( PG_FUNCTION_ARGS )

Definition at line 167 of file ltree_op.c.

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

Referenced by _ltree_extract_isparent(), and _ltree_isparent().

 {
     ltree      *c = PG_GETARG_LTREE_P(1);
     ltree      *p = PG_GETARG_LTREE_P(0);
     bool        res = inner_isparent(c, p);
 
     PG_FREE_IF_COPY(c, 1);
     PG_FREE_IF_COPY(p, 0);
     PG_RETURN_BOOL(res);
 }

◆ ltree_risparent()

Datum ltree_risparent ( PG_FUNCTION_ARGS )

Definition at line 179 of file ltree_op.c.

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

Referenced by _ltree_extract_risparent(), and _ltree_risparent().

 {
     ltree      *c = PG_GETARG_LTREE_P(0);
     ltree      *p = PG_GETARG_LTREE_P(1);
     bool        res = inner_isparent(c, p);
 
     PG_FREE_IF_COPY(c, 0);
     PG_FREE_IF_COPY(p, 1);
     PG_RETURN_BOOL(res);
 }

◆ ltree_strncasecmp()

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

Definition at line 78 of file lquery_op.c.

References pfree(), and str_tolower().

Referenced by checkcondition_str(), and checkLevel().

 {
     char       *al = str_tolower(a, s, DEFAULT_COLLATION_OID);
     char       *bl = str_tolower(b, s, DEFAULT_COLLATION_OID);
     int         res;
 
     res = strncmp(al, bl, s);
 
     pfree(al);
     pfree(bl);
 
     return res;
 }

◆ ltree_textadd()

Datum ltree_textadd ( PG_FUNCTION_ARGS )

Definition at line 395 of file ltree_op.c.

References 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      *a = PG_GETARG_LTREE_P(1);
     text       *b = PG_GETARG_TEXT_PP(0);
     char       *s;
     ltree      *r,
                *tmp;
 
     s = text_to_cstring(b);
 
     tmp = (ltree *) DatumGetPointer(DirectFunctionCall1(ltree_in,
                                                         PointerGetDatum(s)));
 
     pfree(s);
 
     r = ltree_concat(tmp, a);
 
     pfree(tmp);
 
     PG_FREE_IF_COPY(a, 1);
     PG_FREE_IF_COPY(b, 0);
     PG_RETURN_POINTER(r);
 }

◆ ltxtq_exec()

Datum ltxtq_exec ( PG_FUNCTION_ARGS )

Definition at line 84 of file ltxtquery_op.c.

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

 {
     ltree      *val = PG_GETARG_LTREE_P(0);
     ltxtquery  *query = PG_GETARG_LTXTQUERY_P(1);
     CHKVAL      chkval;
     bool        result;
 
     chkval.node = val;
     chkval.operand = GETOPERAND(query);
 
     result = ltree_execute(GETQUERY(query),
                            &chkval,
                            true,
                            checkcondition_str);
 
     PG_FREE_IF_COPY(val, 0);
     PG_FREE_IF_COPY(query, 1);
     PG_RETURN_BOOL(result);
 }

◆ ltxtq_rexec()

Datum ltxtq_rexec ( PG_FUNCTION_ARGS )

Definition at line 105 of file ltxtquery_op.c.

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

 {
     PG_RETURN_DATUM(DirectFunctionCall2(ltxtq_exec,
                                         PG_GETARG_DATUM(1),
                                         PG_GETARG_DATUM(0)
                                         ));
 }

Data Structures

Macros

Typedefs

Functions

Macro Definition Documentation

◆ AHASH

◆ AHASHVAL

◆ ALOOPBYTE

◆ ASIGLENBIT

◆ BITBYTE

◆ CLOSE

◆ CLRBIT

◆ COMPUTESIZE

◆ DatumGetLqueryP

◆ DatumGetLqueryPCopy

◆ DatumGetLtreeP

◆ DatumGetLtreePCopy

◆ DatumGetLtxtqueryP

◆ DatumGetLtxtqueryPCopy

◆ END

◆ ERR

◆ FLG_CANLOOKSIGN

◆ GETBIT

◆ GETBITBYTE

◆ GETBYTE

◆ GETOPERAND

◆ GETQUERY

◆ HASH

◆ HASHVAL

◆ HDRSIZEQT

◆ ISALNUM

◆ ISOPERATOR

◆ LEVEL_HDRSIZE

◆ LEVEL_NEXT

◆ LOOPBYTE

◆ LQL_CANLOOKSIGN

◆ LQL_COUNT

◆ LQL_FIRST

◆ LQL_HDRSIZE

◆ LQL_NEXT

◆ LQL_NOT

◆ LQUERY_FIRST

◆ LQUERY_HASNOT

◆ LQUERY_HDRSIZE

◆ LQUERY_MAX_LEVELS

◆ LTG_ALLTRUE

◆ LTG_GETLNODE

◆ LTG_GETRNODE

◆ LTG_HDRSIZE

◆ LTG_ISALLTRUE

◆ LTG_ISNORIGHT

◆ LTG_ISONENODE

◆ LTG_LNODE

◆ LTG_NODE

◆ LTG_NORIGHT

◆ LTG_ONENODE

◆ LTG_RENODE

◆ LTG_RNODE

◆ LTG_SIGN

◆ LTREE_ASIGLEN_DEFAULT

◆ LTREE_ASIGLEN_MAX

◆ LTREE_FIRST

◆ LTREE_GET_ASIGLEN

◆ LTREE_HDRSIZE

◆ LTREE_LABEL_MAX_CHARS

◆ LTREE_MAX_LEVELS

◆ LTXTQUERY_TOO_BIG

◆ LVAR_ANYEND

◆ LVAR_HDRSIZE

◆ LVAR_INCASE

◆ LVAR_NEXT

◆ LVAR_SUBLEXEME

◆ OPEN

◆ OPR

◆ PG_GETARG_LQUERY_P

◆ PG_GETARG_LQUERY_P_COPY

◆ PG_GETARG_LTREE_P

◆ PG_GETARG_LTREE_P_COPY

◆ PG_GETARG_LTXTQUERY_P

◆ PG_GETARG_LTXTQUERY_P_COPY