108 Index security_level,
111 Relids outerjoin_nonnullable,
112 Relids incompatible_relids,
113 bool allow_equivalence,
116 List **postponed_oj_qual_list);
120 Index security_level,
123 Relids outerjoin_nonnullable,
124 Relids incompatible_relids,
125 bool allow_equivalence,
128 List **postponed_oj_qual_list);
184 elog(
ERROR,
"unrecognized node type: %d",
202 RelOptInfo *rel = root->simple_rel_array[rti];
242 if (tlist_vars !=
NIL)
258 if (having_vars !=
NIL)
301 if (rel->attr_needed[attno] == NULL)
311 var->varnullingrels = NULL;
372 RelOptInfo *brel = root->simple_rel_array[rti];
472 newvars =
lappend(newvars, node);
504 bool found_laterals =
false;
520 RelOptInfo *brel = root->simple_rel_array[rti];
533 lateral_relids = NULL;
544 found_laterals =
true;
553 found_laterals =
true;
589 found_laterals =
true;
651 RelOptInfo *brel = root->simple_rel_array[rti];
652 Relids outer_lateral_relids;
660 if (outer_lateral_relids == NULL)
666 RelOptInfo *brel2 = root->simple_rel_array[rti2];
674 outer_lateral_relids);
685 RelOptInfo *brel = root->simple_rel_array[rti];
704 RelOptInfo *brel2 = root->simple_rel_array[rti2];
779 foreach(lc, item_list)
792 foreach(lc, item_list)
845 jtitem->
jdomain = parent_domain;
861 jtitem->
jdomain = parent_domain;
890 if (sub_members <= 1 ||
894 joinlist =
lappend(joinlist, sub_joinlist);
921 jtitem->
jdomain = parent_domain;
948 jtitem->
jdomain = child_domain;
987 jtitem->
jdomain = parent_domain;
1061 elog(
ERROR,
"unrecognized join type: %d",
1063 leftjoinlist = rightjoinlist =
NIL;
1080 joinlist =
list_concat(leftjoinlist, rightjoinlist);
1092 leftpart = (
Node *) leftjoinlist;
1096 rightpart = (
Node *) rightjoinlist;
1102 elog(
ERROR,
"unrecognized node type: %d",
1108 *item_list =
lappend(*item_list, jtitem);
1170 List **postponed_oj_qual_list;
1234 postponed_oj_qual_list = NULL;
1246 postponed_oj_qual_list);
1254 elog(
ERROR,
"unrecognized node type: %d",
1277 Index security_level = 0;
1311 Assert(security_level <= root->qual_security_level);
1330 RelOptInfo *rel = root->simple_rel_array[relid];
1405 (
errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
1408 errmsg(
"%s cannot be applied to the nullable side of an outer join",
1469 commute_below_l = commute_below_r = NULL;
1473 bool have_unsafe_phvs;
1517 have_unsafe_phvs =
false;
1540 (have_unsafe_phvs ||
1672 if (commute_below_l || commute_below_r)
1703 List *semi_operators;
1704 List *semi_rhs_exprs;
1745 semi_operators =
NIL;
1746 semi_rhs_exprs =
NIL;
1788 all_varnos =
bms_union(left_varnos, right_varnos);
1819 right_expr = left_expr;
1841 if (!(all_btree || all_hash))
1845 semi_operators =
lappend_oid(semi_operators, opno);
1850 if (semi_rhs_exprs ==
NIL)
1906 Relids incompatible_joins;
1909 int save_last_rinfo_serial;
1945 incompatible_joins =
bms_union(joins_below, joins_above);
1959 joins_so_far = NULL;
1960 foreach(lc, jtitems)
1964 bool below_sjinfo =
false;
1965 bool above_sjinfo =
false;
1968 bool allow_equivalence,
1972 if (othersj == NULL)
1978 below_sjinfo =
true;
1980 else if (othersj ==
sjinfo)
1988 above_sjinfo =
true;
2024 this_ojscope =
bms_union(ojscope, joins_so_far);
2052 allow_equivalence = (joins_so_far == NULL);
2053 has_clone = allow_equivalence;
2054 is_clone = !has_clone;
2123 Index security_level,
2126 Relids outerjoin_nonnullable,
2127 Relids incompatible_relids,
2128 bool allow_equivalence,
2131 List **postponed_oj_qual_list)
2135 foreach(lc, clauses)
2145 outerjoin_nonnullable,
2146 incompatible_relids,
2150 postponed_oj_qual_list);
2201 Index security_level,
2204 Relids outerjoin_nonnullable,
2205 Relids incompatible_relids,
2206 bool allow_equivalence,
2209 List **postponed_oj_qual_list)
2212 bool is_pushed_down;
2213 bool pseudoconstant =
false;
2214 bool maybe_equivalence;
2215 bool maybe_outer_join;
2256 elog(
ERROR,
"failed to postpone qual containing lateral reference");
2264 elog(
ERROR,
"JOIN qualification cannot refer to other relations");
2316 pseudoconstant =
true;
2363 if (postponed_oj_qual_list != NULL)
2365 *postponed_oj_qual_list =
lappend(*postponed_oj_qual_list, clause);
2376 is_pushed_down =
false;
2377 maybe_equivalence =
false;
2378 maybe_outer_join =
true;
2397 is_pushed_down =
true;
2409 maybe_equivalence = allow_equivalence;
2415 maybe_outer_join =
false;
2429 incompatible_relids,
2430 outerjoin_nonnullable);
2461 where_needed = relids;
2505 if (restrictinfo->mergeopfamilies)
2507 if (maybe_equivalence)
2512 if (restrictinfo->mergeopfamilies)
2516 else if (maybe_outer_join && restrictinfo->can_join)
2523 outerjoin_nonnullable) &&
2525 outerjoin_nonnullable))
2530 ojcinfo->
rinfo = restrictinfo;
2537 outerjoin_nonnullable) &&
2539 outerjoin_nonnullable))
2544 ojcinfo->
rinfo = restrictinfo;
2555 ojcinfo->
rinfo = restrictinfo;
2587 Var *forced_null_var;
2592 if (forced_null_var == NULL)
2601 if (forced_null_var->varnullingrels == NULL)
2685 elog(
ERROR,
"cannot cope with variable-free clause");
2728 Index security_level,
2734 bool pseudoconstant =
false;
2759 if (!cclause->constisnull &&
DatumGetBool(cclause->constvalue))
2785 pseudoconstant =
true;
2844 return restrictinfo;
2867 Index security_level)
2903 return restrictinfo;
2991 con_rel = root->simple_rel_array[fkinfo->
con_relid];
2992 if (con_rel == NULL)
2994 ref_rel = root->simple_rel_array[fkinfo->
ref_relid];
2995 if (ref_rel == NULL)
3014 for (colno = 0; colno < fkinfo->
nkeys; colno++)
3036 con_attno = fkinfo->conkey[colno];
3037 ref_attno = fkinfo->confkey[colno];
3057 if (!(leftvar &&
IsA(leftvar,
Var)))
3061 if (!(rightvar &&
IsA(rightvar,
Var)))
3065 if (fkinfo->
ref_relid == leftvar->varno &&
3066 ref_attno == leftvar->varattno &&
3068 con_attno == rightvar->varattno)
3071 if (clause->
opno == fkinfo->conpfeqop[colno])
3078 else if (fkinfo->
ref_relid == rightvar->varno &&
3079 ref_attno == rightvar->varattno &&
3081 con_attno == leftvar->varattno)
3092 if (clause->
opno == fpeqop)
3101 if (fkinfo->
rinfos[colno])
3112 newlist =
lappend(newlist, fkinfo);
3141 if (restrictinfo->pseudoconstant)
3148 opno = ((
OpExpr *) clause)->opno;
3178 if (restrictinfo->pseudoconstant)
3185 opno = ((
OpExpr *) clause)->opno;
3190 restrictinfo->hashjoinoperator = opno;
3207 if (restrictinfo->pseudoconstant)
3220 restrictinfo->left_hasheqoperator = typentry->
eq_opr;
3228 if (lefttype != righttype)
3233 restrictinfo->right_hasheqoperator = typentry->
eq_opr;
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
int bms_next_member(const Bitmapset *a, int prevbit)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
int bms_singleton_member(const Bitmapset *a)
bool bms_is_member(int x, const Bitmapset *a)
Bitmapset * bms_make_singleton(int x)
Bitmapset * bms_add_member(Bitmapset *a, int x)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_intersect(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_int_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_del_member(Bitmapset *a, int x)
BMS_Membership bms_membership(const Bitmapset *a)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_copy(const Bitmapset *a)
bool bms_get_singleton_member(const Bitmapset *a, int *member)
#define OidIsValid(objectId)
Var * find_forced_null_var(Node *node)
Relids find_nonnullable_rels(Node *clause)
Node * eval_const_expressions(PlannerInfo *root, Node *node)
bool contain_volatile_functions(Node *clause)
elog(ERROR, "%s: %s", p2, msg)
int errcode(int sqlerrcode)
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
bool process_equivalence(PlannerInfo *root, RestrictInfo **p_restrictinfo, JoinDomain *jdomain)
EquivalenceClass * match_eclasses_to_foreign_key_col(PlannerInfo *root, ForeignKeyOptInfo *fkinfo, int colno)
#define palloc0_object(type)
void expand_inherited_rtentry(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte, Index rti)
static void check_hashjoinable(RestrictInfo *restrictinfo)
static void extract_lateral_references(PlannerInfo *root, RelOptInfo *brel, Index rtindex)
List * deconstruct_jointree(PlannerInfo *root)
static void check_mergejoinable(RestrictInfo *restrictinfo)
void distribute_restrictinfo_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo)
static List * deconstruct_recurse(PlannerInfo *root, Node *jtnode, JoinDomain *parent_domain, JoinTreeItem *parent_jtitem, List **item_list)
static void compute_semijoin_info(PlannerInfo *root, SpecialJoinInfo *sjinfo, List *clause)
struct JoinTreeItem JoinTreeItem
void match_foreign_keys_to_quals(PlannerInfo *root)
void find_lateral_references(PlannerInfo *root)
void add_base_rels_to_query(PlannerInfo *root, Node *jtnode)
void build_base_rel_tlists(PlannerInfo *root, List *final_tlist)
static void deconstruct_distribute_oj_quals(PlannerInfo *root, List *jtitems, JoinTreeItem *jtitem)
static void distribute_quals_to_rels(PlannerInfo *root, List *clauses, JoinTreeItem *jtitem, SpecialJoinInfo *sjinfo, Index security_level, Relids qualscope, Relids ojscope, Relids outerjoin_nonnullable, Relids incompatible_relids, bool allow_equivalence, bool has_clone, bool is_clone, List **postponed_oj_qual_list)
static SpecialJoinInfo * make_outerjoininfo(PlannerInfo *root, Relids left_rels, Relids right_rels, Relids inner_join_rels, JoinType jointype, Index ojrelid, List *clause)
void add_vars_to_targetlist(PlannerInfo *root, List *vars, Relids where_needed)
static void distribute_qual_to_rels(PlannerInfo *root, Node *clause, JoinTreeItem *jtitem, SpecialJoinInfo *sjinfo, Index security_level, Relids qualscope, Relids ojscope, Relids outerjoin_nonnullable, Relids incompatible_relids, bool allow_equivalence, bool has_clone, bool is_clone, List **postponed_oj_qual_list)
static bool check_redundant_nullability_qual(PlannerInfo *root, Node *clause)
RestrictInfo * build_implied_join_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level)
void add_other_rels_to_query(PlannerInfo *root)
static void mark_rels_nulled_by_join(PlannerInfo *root, Index ojrelid, Relids lower_rels)
void create_lateral_join_info(PlannerInfo *root)
static void process_security_barrier_quals(PlannerInfo *root, int rti, JoinTreeItem *jtitem)
RestrictInfo * process_implied_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level, bool both_const)
static void deconstruct_distribute(PlannerInfo *root, JoinTreeItem *jtitem)
static void check_memoizable(RestrictInfo *restrictinfo)
static Relids get_join_domain_min_rels(PlannerInfo *root, Relids domain_relids)
if(TABLE==NULL||TABLE_index==NULL)
void add_join_clause_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo, Relids join_relids)
Assert(fmt[strlen(fmt) - 1] !='\n')
List * lappend(List *list, void *datum)
List * lappend_oid(List *list, Oid datum)
void list_free(List *list)
List * list_concat(List *list1, const List *list2)
void list_free_deep(List *list)
List * get_mergejoin_opfamilies(Oid opno)
bool op_hashjoinable(Oid opno, Oid inputtype)
bool op_mergejoinable(Oid opno, Oid inputtype)
Oid get_commutator(Oid opno)
Expr * make_opclause(Oid opno, Oid opresulttype, bool opretset, Expr *leftop, Expr *rightop, Oid opcollid, Oid inputcollid)
Oid exprType(const Node *expr)
static bool is_opclause(const void *clause)
static Node * get_rightop(const void *clause)
static Node * get_leftop(const void *clause)
#define IsA(nodeptr, _type_)
#define PVC_RECURSE_AGGREGATES
#define PVC_RECURSE_WINDOWFUNCS
#define PVC_INCLUDE_PLACEHOLDERS
const char * LCS_asString(LockClauseStrength strength)
void initialize_mergeclause_eclasses(PlannerInfo *root, RestrictInfo *restrictinfo)
static int list_length(const List *l)
#define linitial_node(type, l)
#define list_make2(x1, x2)
bool contain_placeholder_references_to(PlannerInfo *root, Node *clause, int relid)
PlaceHolderInfo * find_placeholder_info(PlannerInfo *root, PlaceHolderVar *phv)
Expr * preprocess_phv_expression(PlannerInfo *root, Expr *expr)
static bool DatumGetBool(Datum X)
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
RelOptInfo * build_simple_rel(PlannerInfo *root, int relid, RelOptInfo *parent)
RelOptInfo * find_base_rel_ignore_join(PlannerInfo *root, int relid)
RestrictInfo * make_restrictinfo(PlannerInfo *root, Expr *clause, bool is_pushed_down, bool has_clone, bool is_clone, bool pseudoconstant, Index security_level, Relids required_relids, Relids incompatible_relids, Relids outer_relids)
Node * remove_nulling_relids(Node *node, const Bitmapset *removable_relids, const Bitmapset *except_relids)
Node * add_nulling_relids(Node *node, const Bitmapset *target_relids, const Bitmapset *added_relids)
void IncrementVarSublevelsUp(Node *node, int delta_sublevels_up, int min_sublevels_up)
List * rinfos[INDEX_MAX_KEYS]
struct JoinTreeItem * jti_parent
int simple_rel_array_size
Index qual_security_level
List * right_join_clauses
bool hasPseudoConstantQuals
struct TableSampleClause * tablesample
struct PathTarget * reltarget
Relids lateral_referencers
Relids direct_lateral_relids
Index baserestrict_min_security
LockClauseStrength strength
TypeCacheEntry * lookup_type_cache(Oid type_id, int flags)
#define TYPECACHE_HASH_PROC
List * pull_vars_of_level(Node *node, int levelsup)
List * pull_var_clause(Node *node, int flags)
Relids pull_varnos(PlannerInfo *root, Node *node)