1 /* contrib/ltree/ltree.h */
7 #include "tsearch/ts_locale.h"
8 #include "utils/memutils.h"
16 #define LEVEL_HDRSIZE (offsetof(ltree_level,name))
17 #define LEVEL_NEXT(x) ( (ltree_level*)( ((char*)(x)) + MAXALIGN(((ltree_level*)(x))->len + LEVEL_HDRSIZE) ) )
21 int32 vl_len_; /* varlena header (do not touch directly!) */
26 #define LTREE_HDRSIZE MAXALIGN( offsetof(ltree, data) )
27 #define LTREE_FIRST(x) ( (ltree_level*)( ((char*)(x))+LTREE_HDRSIZE ) )
40 #define LVAR_HDRSIZE MAXALIGN(offsetof(lquery_variant, name))
41 #define LVAR_NEXT(x) ( (lquery_variant*)( ((char*)(x)) + MAXALIGN(((lquery_variant*)(x))->len) + LVAR_HDRSIZE ) )
43 #define LVAR_ANYEND 0x01
44 #define LVAR_INCASE 0x02
45 #define LVAR_SUBLEXEME 0x04
57 #define LQL_HDRSIZE MAXALIGN( offsetof(lquery_level,variants) )
58 #define LQL_NEXT(x) ( (lquery_level*)( ((char*)(x)) + MAXALIGN(((lquery_level*)(x))->totallen) ) )
59 #define LQL_FIRST(x) ( (lquery_variant*)( ((char*)(x))+LQL_HDRSIZE ) )
63 #define FLG_CANLOOKSIGN(x) ( ( (x) & ( LQL_NOT | LVAR_ANYEND | LVAR_SUBLEXEME ) ) == 0 )
65 #define FLG_CANLOOKSIGN(x) ( ( (x) & ( LQL_NOT | LVAR_ANYEND | LVAR_SUBLEXEME | LVAR_INCASE ) ) == 0 )
67 #define LQL_CANLOOKSIGN(x) FLG_CANLOOKSIGN( ((lquery_level*)(x))->flag )
71 int32 vl_len_; /* varlena header (do not touch directly!) */
78 #define LQUERY_HDRSIZE MAXALIGN( offsetof(lquery, data) )
79 #define LQUERY_FIRST(x) ( (lquery_level*)( ((char*)(x))+LQUERY_HDRSIZE ) )
81 #define LQUERY_HASNOT 0x01
83 #define ISALNUM(x) ( t_isalpha(x) || t_isdigit(x) || ( pg_mblen(x) == 1 && t_iseq((x), '_') ) )
88 * item in polish notation with back link
97 /* user-friendly value */
104 * (len)(size)(array of ITEM)(array of operand in user-friendly form)
108 int32 vl_len_; /* varlena header (do not touch directly!) */
113 #define HDRSIZEQT MAXALIGN(VARHDRSZ + sizeof(int32))
114 #define COMPUTESIZE(size,lenofoperand) ( HDRSIZEQT + (size) * sizeof(ITEM) + (lenofoperand) )
115 #define LTXTQUERY_TOO_BIG(size,lenofoperand) \
116 ((size) > (MaxAllocSize - HDRSIZEQT - (lenofoperand)) / sizeof(ITEM))
117 #define GETQUERY(x) (ITEM*)( (char*)(x)+HDRSIZEQT )
118 #define GETOPERAND(x) ( (char*)GETQUERY(x) + ((ltxtquery*)x)->size * sizeof(ITEM) )
120 #define ISOPERATOR(x) ( (x)=='!' || (x)=='&' || (x)=='|' || (x)=='(' || (x)==')' )
128 #define VALTRUE 6 /* for stop words */
132 /* use in array iterator */
133 Datum ltree_isparent(PG_FUNCTION_ARGS);
134 Datum ltree_risparent(PG_FUNCTION_ARGS);
135 Datum ltq_regex(PG_FUNCTION_ARGS);
136 Datum ltq_rregex(PG_FUNCTION_ARGS);
137 Datum lt_q_regex(PG_FUNCTION_ARGS);
138 Datum lt_q_rregex(PG_FUNCTION_ARGS);
139 Datum ltxtq_exec(PG_FUNCTION_ARGS);
140 Datum ltxtq_rexec(PG_FUNCTION_ARGS);
141 Datum _ltq_regex(PG_FUNCTION_ARGS);
142 Datum _ltq_rregex(PG_FUNCTION_ARGS);
143 Datum _lt_q_regex(PG_FUNCTION_ARGS);
144 Datum _lt_q_rregex(PG_FUNCTION_ARGS);
145 Datum _ltxtq_exec(PG_FUNCTION_ARGS);
146 Datum _ltxtq_rexec(PG_FUNCTION_ARGS);
147 Datum _ltree_isparent(PG_FUNCTION_ARGS);
148 Datum _ltree_risparent(PG_FUNCTION_ARGS);
150 /* Concatenation functions */
151 Datum ltree_addltree(PG_FUNCTION_ARGS);
152 Datum ltree_addtext(PG_FUNCTION_ARGS);
153 Datum ltree_textadd(PG_FUNCTION_ARGS);
156 Datum ltree_in(PG_FUNCTION_ARGS);
158 bool ltree_execute(ITEM *curitem, void *checkval,
159 bool calcnot, bool (*chkcond) (void *checkval, ITEM *val));
161 int ltree_compare(const ltree *a, const ltree *b);
162 bool inner_isparent(const ltree *c, const ltree *p);
163 bool compare_subnode(ltree_level *t, char *q, int len,
164 int (*cmpptr) (const char *, const char *, size_t), bool anyend);
165 ltree *lca_inner(ltree **a, int len);
166 int ltree_strncasecmp(const char *a, const char *b, size_t s);
168 #define PG_GETARG_LTREE(x) ((ltree*)DatumGetPointer(PG_DETOAST_DATUM(PG_GETARG_DATUM(x))))
169 #define PG_GETARG_LTREE_COPY(x) ((ltree*)DatumGetPointer(PG_DETOAST_DATUM_COPY(PG_GETARG_DATUM(x))))
170 #define PG_GETARG_LQUERY(x) ((lquery*)DatumGetPointer(PG_DETOAST_DATUM(PG_GETARG_DATUM(x))))
171 #define PG_GETARG_LQUERY_COPY(x) ((lquery*)DatumGetPointer(PG_DETOAST_DATUM_COPY(PG_GETARG_DATUM(x))))
172 #define PG_GETARG_LTXTQUERY(x) ((ltxtquery*)DatumGetPointer(PG_DETOAST_DATUM(PG_GETARG_DATUM(x))))
173 #define PG_GETARG_LTXTQUERY_COPY(x) ((ltxtquery*)DatumGetPointer(PG_DETOAST_DATUM_COPY(PG_GETARG_DATUM(x))))
175 /* GiST support for ltree */
179 #define SIGLEN ( sizeof(int32)*SIGLENINT )
180 #define SIGLENBIT (SIGLEN*BITBYTE)
181 typedef unsigned char BITVEC[SIGLEN];
182 typedef unsigned char *BITVECP;
185 for(i=0;i<SIGLEN;i++)
187 #define GETBYTE(x,i) ( *( (BITVECP)(x) + (int)( (i) / BITBYTE ) ) )
188 #define GETBITBYTE(x,i) ( ((unsigned char)(x)) >> i & 0x01 )
189 #define CLRBIT(x,i) GETBYTE(x,i) &= ~( 0x01 << ( (i) % BITBYTE ) )
190 #define SETBIT(x,i) GETBYTE(x,i) |= ( 0x01 << ( (i) % BITBYTE ) )
191 #define GETBIT(x,i) ( (GETBYTE(x,i) >> ( (i) % BITBYTE )) & 0x01 )
193 #define HASHVAL(val) (((unsigned int)(val)) % SIGLENBIT)
194 #define HASH(sign, val) SETBIT((sign), HASHVAL(val))
197 * type of index key for ltree. Tree are combined B-Tree and R-Tree
202 * (len)(flag)(sign)(left_ltree)(right_ltree)
203 * ALLTRUE: (len)(flag)(left_ltree)(right_ltree)
209 int32 vl_len_; /* varlena header (do not touch directly!) */
214 #define LTG_ONENODE 0x01
215 #define LTG_ALLTRUE 0x02
216 #define LTG_NORIGHT 0x04
218 #define LTG_HDRSIZE MAXALIGN(VARHDRSZ + sizeof(uint32))
219 #define LTG_SIGN(x) ( (BITVECP)( ((char*)(x))+LTG_HDRSIZE ) )
220 #define LTG_NODE(x) ( (ltree*)( ((char*)(x))+LTG_HDRSIZE ) )
221 #define LTG_ISONENODE(x) ( ((ltree_gist*)(x))->flag & LTG_ONENODE )
222 #define LTG_ISALLTRUE(x) ( ((ltree_gist*)(x))->flag & LTG_ALLTRUE )
223 #define LTG_ISNORIGHT(x) ( ((ltree_gist*)(x))->flag & LTG_NORIGHT )
224 #define LTG_LNODE(x) ( (ltree*)( ( ((char*)(x))+LTG_HDRSIZE ) + ( LTG_ISALLTRUE(x) ? 0 : SIGLEN ) ) )
225 #define LTG_RENODE(x) ( (ltree*)( ((char*)LTG_LNODE(x)) + VARSIZE(LTG_LNODE(x))) )
226 #define LTG_RNODE(x) ( LTG_ISNORIGHT(x) ? LTG_LNODE(x) : LTG_RENODE(x) )
228 #define LTG_GETLNODE(x) ( LTG_ISONENODE(x) ? LTG_NODE(x) : LTG_LNODE(x) )
229 #define LTG_GETRNODE(x) ( LTG_ISONENODE(x) ? LTG_NODE(x) : LTG_RNODE(x) )
232 /* GiST support for ltree[] */
234 #define ASIGLENINT (7)
235 #define ASIGLEN (sizeof(int32)*ASIGLENINT)
236 #define ASIGLENBIT (ASIGLEN*BITBYTE)
237 typedef unsigned char ABITVEC[ASIGLEN];
240 for(i=0;i<ASIGLEN;i++)
242 #define AHASHVAL(val) (((unsigned int)(val)) % ASIGLENBIT)
243 #define AHASH(sign, val) SETBIT((sign), AHASHVAL(val))
245 /* type of key is the same to ltree_gist */