20 #define QTW_IGNORE_RT_SUBQUERIES 0x01
21 #define QTW_IGNORE_CTE_SUBQUERIES 0x02
22 #define QTW_IGNORE_RC_SUBQUERIES 0x03
23 #define QTW_IGNORE_JOINALIASES 0x04
24 #define QTW_IGNORE_RANGE_TABLE 0x08
25 #define QTW_EXAMINE_RTES_BEFORE 0x10
27 #define QTW_EXAMINE_RTES_AFTER 0x20
29 #define QTW_DONT_COPY_QUERY 0x40
30 #define QTW_EXAMINE_SORTGROUP 0x80
68 return clause != NULL &&
IsA(clause,
OpExpr);
99 return (clause != NULL &&
108 return (clause != NULL &&
117 return (clause != NULL &&
138 void *context,
int flags);
140 void *context,
int flags);
143 void *context,
int flags);
145 void *context,
int flags);
148 void *context,
int flags);
151 void *context,
int flags);
153 void *context,
int flags);
Datum boolop(PG_FUNCTION_ARGS)
bool query_or_expression_tree_walker(Node *node, bool(*walker)(), void *context, int flags)
static bool is_andclause(const void *clause)
static Expr * get_notclausearg(const void *notclause)
bool query_tree_walker(Query *query, bool(*walker)(), void *context, int flags)
static bool is_orclause(const void *clause)
List * range_table_mutator(List *rtable, Node *(*mutator)(), void *context, int flags)
Oid exprType(const Node *expr)
Query * query_tree_mutator(Query *query, Node *(*mutator)(), void *context, int flags)
bool exprIsLengthCoercion(const Node *expr, int32 *coercedTypmod)
void exprSetCollation(Node *expr, Oid collation)
Oid exprInputCollation(const Node *expr)
static bool is_opclause(const void *clause)
Node * query_or_expression_tree_mutator(Node *node, Node *(*mutator)(), void *context, int flags)
static Node * get_rightop(const void *clause)
int32 exprTypmod(const Node *expr)
bool check_functions_in_node(Node *node, check_function_callback checker, void *context)
Oid exprCollation(const Node *expr)
void exprSetInputCollation(Node *expr, Oid inputcollation)
Node * applyRelabelType(Node *arg, Oid rtype, int32 rtypmod, Oid rcollid, CoercionForm rformat, int rlocation, bool overwrite_ok)
bool expression_tree_walker(Node *node, bool(*walker)(), void *context)
static bool is_funcclause(const void *clause)
static bool is_notclause(const void *clause)
bool(* check_function_callback)(Oid func_id, void *context)
bool range_table_walker(List *rtable, bool(*walker)(), void *context, int flags)
Node * relabel_to_typmod(Node *expr, int32 typmod)
int exprLocation(const Node *expr)
bool planstate_tree_walker(struct PlanState *planstate, bool(*walker)(), void *context)
Node * strip_implicit_coercions(Node *node)
bool expression_returns_set(Node *clause)
Node * expression_tree_mutator(Node *node, Node *(*mutator)(), void *context)
void fix_opfuncids(Node *node)
bool range_table_entry_walker(RangeTblEntry *rte, bool(*walker)(), void *context, int flags)
bool raw_expression_tree_walker(Node *node, bool(*walker)(), void *context)
static Node * get_leftop(const void *clause)
void set_sa_opfuncid(ScalarArrayOpExpr *opexpr)
void set_opfuncid(OpExpr *opexpr)
#define IsA(nodeptr, _type_)
static int list_length(const List *l)