PostgreSQL Source Code git master
Data Structures | Functions
ltxtquery_op.c File Reference
#include "postgres.h"
#include <ctype.h>
#include "ltree.h"
#include "miscadmin.h"
Include dependency graph for ltxtquery_op.c:

Go to the source code of this file.

Data Structures

struct   CHKVAL
 

Functions

  PG_FUNCTION_INFO_V1 (ltxtq_exec)
 
  PG_FUNCTION_INFO_V1 (ltxtq_rexec)
 
bool  ltree_execute (ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *val))
 
static bool  checkcondition_str (void *checkval, ITEM *val)
 
Datum  ltxtq_exec (PG_FUNCTION_ARGS)
 
Datum  ltxtq_rexec (PG_FUNCTION_ARGS)
 

Function Documentation

◆ checkcondition_str()

static bool checkcondition_str ( void *  checkval,
ITEM *  val 
)
static

Definition at line 56 of file ltxtquery_op.c.

57{
58 ltree_level *level = LTREE_FIRST(((CHKVAL *) checkval)->node);
59 int tlen = ((CHKVAL *) checkval)->node->numlevel;
60 char *op = ((CHKVAL *) checkval)->operand + val->distance;
61 int (*cmpptr) (const char *, const char *, size_t);
62
63 cmpptr = (val->flag & LVAR_INCASE) ? ltree_strncasecmp : strncmp;
64 while (tlen > 0)
65 {
66 if (val->flag & LVAR_SUBLEXEME)
67 {
68 if (compare_subnode(level, op, val->length, cmpptr, (val->flag & LVAR_ANYEND)))
69 return true;
70 }
71 else if ((val->length == level->len ||
72 (level->len > val->length && (val->flag & LVAR_ANYEND))) &&
73 (*cmpptr) (op, level->name, val->length) == 0)
74 return true;
75
76 tlen--;
77 level = LEVEL_NEXT(level);
78 }
79
80 return false;
81}
long val
Definition: informix.c:689
bool compare_subnode(ltree_level *t, char *qn, int len, int(*cmpptr)(const char *, const char *, size_t), bool anyend)
Definition: lquery_op.c:44
int ltree_strncasecmp(const char *a, const char *b, size_t s)
Definition: lquery_op.c:78
#define LTREE_FIRST(x)
Definition: ltree.h:51
#define LVAR_INCASE
Definition: ltree.h:75
#define LEVEL_NEXT(x)
Definition: ltree.h:40
#define LVAR_ANYEND
Definition: ltree.h:74
#define LVAR_SUBLEXEME
Definition: ltree.h:76
Definition: _int_bool.c:224
Definition: ltree.h:34
char name[FLEXIBLE_ARRAY_MEMBER]
Definition: ltree.h:36
uint16 len
Definition: ltree.h:35

References compare_subnode(), ltree_level::len, LEVEL_NEXT, LTREE_FIRST, ltree_strncasecmp(), LVAR_ANYEND, LVAR_INCASE, LVAR_SUBLEXEME, ltree_level::name, and val.

Referenced by ltxtq_exec().

◆ 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 */
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}
#define VAL
Definition: _int.h:162
int32_t int32
Definition: c.h:534
return true
Definition: isn.c:130
bool ltree_execute(ITEM *curitem, void *checkval, bool calcnot, bool(*chkcond)(void *checkval, ITEM *val))
Definition: ltxtquery_op.c:20
void check_stack_depth(void)
Definition: stack_depth.c:95
int16 left
Definition: _int.h:143
int32 val
Definition: _int.h:144
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().

◆ ltxtq_exec()

Datum ltxtq_exec ( PG_FUNCTION_ARGS  )

Definition at line 84 of file ltxtquery_op.c.

85{
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,
98
100 PG_FREE_IF_COPY(query, 1);
101 PG_RETURN_BOOL(result);
102}
#define GETQUERY(x)
Definition: _int.h:157
#define PG_FREE_IF_COPY(ptr, n)
Definition: fmgr.h:260
#define PG_RETURN_BOOL(x)
Definition: fmgr.h:359
#define PG_GETARG_LTXTQUERY_P(n)
Definition: ltree.h:228
#define GETOPERAND(x)
Definition: ltree.h:165
#define PG_GETARG_LTREE_P(n)
Definition: ltree.h:218
static bool checkcondition_str(void *checkval, ITEM *val)
Definition: ltxtquery_op.c:56
char * operand
Definition: ltxtquery_op.c:52
ltree * node
Definition: ltxtquery_op.c:51
Definition: ltree.h:43
Definition: ltree.h:154

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

Datum ltxtq_rexec ( PG_FUNCTION_ARGS  )

Definition at line 105 of file ltxtquery_op.c.

106{
110 ));
111}
#define DirectFunctionCall2(func, arg1, arg2)
Definition: fmgr.h:684
#define PG_GETARG_DATUM(n)
Definition: fmgr.h:268
#define PG_RETURN_DATUM(x)
Definition: fmgr.h:353
Datum ltxtq_exec(PG_FUNCTION_ARGS)
Definition: ltxtquery_op.c:84

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

◆ PG_FUNCTION_INFO_V1() [1/2]

PG_FUNCTION_INFO_V1 ( ltxtq_exec  )

◆ PG_FUNCTION_INFO_V1() [2/2]

PG_FUNCTION_INFO_V1 ( ltxtq_rexec  )

AltStyle によって変換されたページ (->オリジナル) /