92 int parentRTindex,
Query *setOpQuery,
110 Node *jtnode,
bool restricted,
111 Relids safe_upper_varnos);
129 List *forced_null_vars);
131 int rtindex,
Relids relids);
134 Relids *dropped_outer_joins);
139 Node *node,
int varno);
141 int varno,
Relids subrelids);
181 have_action[
action->matchKind] =
true;
198 joinrte->joinmergedcols = 0;
199 joinrte->joinaliasvars =
vars;
200 joinrte->joinleftcols =
NIL;
201 joinrte->joinrightcols =
NIL;
202 joinrte->join_using_alias = NULL;
204 joinrte->alias = NULL;
206 joinrte->lateral =
false;
207 joinrte->
inh =
false;
208 joinrte->inFromCl =
true;
236 joinexpr->usingClause =
NIL;
237 joinexpr->join_using_alias = NULL;
239 joinexpr->alias = NULL;
244 parse->jointree->quals = NULL;
266 parse->mergeJoinCondition = NULL;
291 if (
parse->jointree->fromlist !=
NIL)
295 if (
parse->setOperations)
404 newfromlist =
lappend(newfromlist, newchild);
405 frelids =
bms_join(frelids, childrelids);
410 jtlink = (
Node *) newf;
486 elog(
ERROR,
"unrecognized join type: %d",
499 *relids =
bms_join(leftrelids, rightrelids);
505 elog(
ERROR,
"unrecognized node type: %d",
542 available_rels1)) != NULL)
546 *jtlink1 = (
Node *)
j;
566 if (available_rels2 != NULL &&
568 available_rels2)) != NULL)
572 *jtlink2 = (
Node *)
j;
596 available_rels1)) != NULL)
600 *jtlink1 = (
Node *)
j;
620 if (available_rels2 != NULL &&
622 available_rels2)) != NULL)
626 *jtlink2 = (
Node *)
j;
662 available_rels1)) != NULL)
666 *jtlink1 = (
Node *)
j;
686 if (available_rels2 != NULL &&
688 available_rels2)) != NULL)
692 *jtlink2 = (
Node *)
j;
735 newclauses =
lappend(newclauses, newclause);
738 if (newclauses ==
NIL)
780 foreach(rt,
root->parse->rtable)
799 rte->security_barrier =
false;
885 (containing_appendrel == NULL ||
889 containing_appendrel);
911 lowest_outer_join == NULL &&
912 containing_appendrel == NULL &&
921 containing_appendrel);
930 Assert(containing_appendrel == NULL);
943 Assert(containing_appendrel == NULL);
982 elog(
ERROR,
"unrecognized join type: %d",
988 elog(
ERROR,
"unrecognized node type: %d",
1033 subroot->
parse = subquery;
1036 subroot->parent_root =
root->parent_root;
1052 memset(subroot->upper_rels, 0,
sizeof(subroot->upper_rels));
1053 memset(subroot->upper_targets, 0,
sizeof(subroot->upper_targets));
1058 subroot->grouping_map = NULL;
1080 if (subquery->hasSubLinks)
1172 rvcontext.
varno = varno;
1186 if (containing_appendrel != NULL)
1198 if (
parse->groupingSets)
1207 containing_appendrel);
1218 foreach(lc, subquery->
rtable)
1226 child_rte->lateral =
true;
1232 child_rte->lateral =
true;
1250 subquery->
rtable, subquery->rteperminfos);
1269 if (
root->glob->lastPHId != 0 ||
root->append_rel_list)
1275 if (
root->glob->lastPHId != 0)
1312 parse->hasSubLinks |= subquery->hasSubLinks;
1315 parse->hasRowSecurity |= subquery->hasRowSecurity;
1382 child_rte->lateral =
true;
1390 rtable, subquery->rteperminfos);
1429 Query *setOpQuery,
int childRToffset)
1440 childRTindex = childRToffset + rtr->
rtindex;
1484 elog(
ERROR,
"unrecognized node type: %d",
1508 appinfo->parent_colnos = pcolnos =
1564 if (subquery->hasAggs ||
1565 subquery->hasWindowFuncs ||
1566 subquery->hasTargetSRFs ||
1574 subquery->hasForUpdate ||
1583 if (rte->security_barrier)
1592 Relids safe_upper_varnos;
1603 if (lowest_outer_join != NULL)
1612 safe_upper_varnos = NULL;
1617 restricted, safe_upper_varnos))
1633 if (lowest_outer_join != NULL)
1704 foreach(lc, values_list)
1718 rvcontext.
varno = varno;
1854 if (rtf->funccolcount != 1)
1858 if (rtf->funccolnames !=
NIL)
1895 if (containing_appendrel != NULL)
1902 if (
parse->groupingSets)
1911 containing_appendrel);
1927 rte->lateral =
false;
1983 Assert(subquery != NULL);
2003 elog(
ERROR,
"unrecognized node type: %d",
2040 if (jtnode->
quals != NULL)
2065 Relids safe_upper_varnos)
2103 safe_upper_varnos = NULL;
2125 elog(
ERROR,
"unrecognized node type: %d",
2152 if (containing_appendrel)
2178 foreach(lc,
parse->windowClause)
2182 if (wc->runCondition !=
NIL)
2183 wc->runCondition = (
List *)
2186 if (
parse->onConflict)
2188 parse->onConflict->onConflictSet = (
List *)
2191 parse->onConflict->onConflictWhere =
2200 if (
parse->mergeActionList)
2202 foreach(lc,
parse->mergeActionList)
2220 foreach(lc,
root->append_rel_list)
2231 foreach(lc,
parse->rtable)
2236 otherrte->joinaliasvars = (
List *)
2323 bool save_wrap_non_vars =
context->wrap_non_vars;
2336 context->wrap_non_vars =
true;
2340 context->wrap_non_vars = save_wrap_non_vars;
2343 elog(
ERROR,
"unrecognized node type: %d",
2379 need_phv = (var->varnullingrels != NULL) || rcon->
wrap_non_vars;
2408 int save_sublevelsup =
context->sublevels_up;
2422 (var->vartype != RECORDOID),
2423 &colnames, &fields);
2430 context->sublevels_up = save_sublevelsup;
2433 rowexpr->
args = fields;
2434 rowexpr->row_typeid = var->vartype;
2436 rowexpr->colnames = (var->vartype == RECORDOID) ? colnames :
NIL;
2438 newnode = (
Node *) rowexpr;
2463 elog(
ERROR,
"could not find attribute %d in subquery targetlist",
2474 if (newnode &&
IsA(newnode,
Var) &&
2475 ((
Var *) newnode)->varlevelsup == 0)
2534 if (var->varnullingrels != NULL)
2538 Var *newvar = (
Var *) newnode;
2542 var->varnullingrels);
2550 var->varnullingrels);
2553 elog(
ERROR,
"failed to wrap a non-Var");
2598 Node *leftmostjtnode;
2610 if (
root->hasRecursion)
2624 leftmostjtnode = topop->
larg;
2628 leftmostRTI = ((
RangeTblRef *) leftmostjtnode)->rtindex;
2644 ((
RangeTblRef *) leftmostjtnode)->rtindex = childRTI;
2647 leftmostRTE->
inh =
true;
2662 parse->setOperations = NULL;
2732 elog(
ERROR,
"so where are the outer joins?");
2842 elog(
ERROR,
"unrecognized node type: %d",
2869 List *forced_null_vars)
2884 Relids pass_nonnullable_rels;
2885 List *pass_forced_null_vars;
2903 pass_nonnullable_rels,
2904 pass_forced_null_vars);
2912 int rtindex =
j->rtindex;
2965 elog(
ERROR,
"unrecognized join type: %d",
3001 List *nonnullable_vars;
3021 if (rtindex && jointype !=
j->jointype)
3032 j->jointype = jointype;
3037 Relids local_nonnullable_rels;
3038 List *local_forced_null_vars;
3039 Relids pass_nonnullable_rels;
3040 List *pass_forced_null_vars;
3079 local_nonnullable_rels = NULL;
3080 local_forced_null_vars =
NIL;
3088 pass_nonnullable_rels = local_nonnullable_rels;
3089 pass_forced_null_vars = local_forced_null_vars;
3094 pass_nonnullable_rels = nonnullable_rels;
3095 pass_forced_null_vars = forced_null_vars;
3100 pass_nonnullable_rels = NULL;
3101 pass_forced_null_vars =
NIL;
3105 pass_nonnullable_rels,
3106 pass_forced_null_vars);
3114 pass_nonnullable_rels = local_nonnullable_rels;
3115 pass_forced_null_vars = local_forced_null_vars;
3120 pass_nonnullable_rels = NULL;
3121 pass_forced_null_vars =
NIL;
3125 pass_nonnullable_rels,
3126 pass_forced_null_vars);
3132 elog(
ERROR,
"unrecognized node type: %d",
3139 int rtindex,
Relids relids)
3209 Relids dropped_outer_joins = NULL;
3219 &dropped_outer_joins);
3236 dropped_outer_joins,
3241 dropped_outer_joins,
3256 foreach(cell,
root->rowMarks)
3281 Node **parent_quals,
3282 Relids *dropped_outer_joins)
3292 Relids result_relids = NULL;
3312 dropped_outer_joins);
3359 f !=
root->parse->jointree &&
3360 (f->
quals == NULL || parent_quals != NULL))
3368 if (f->
quals != NULL)
3369 *parent_quals = (
Node *)
3396 parent_quals : NULL,
3397 dropped_outer_joins);
3402 dropped_outer_joins);
3405 switch (
j->jointype)
3429 if (
j->quals != NULL && parent_quals == NULL)
3435 if (
j->quals != NULL)
3436 *parent_quals = (
Node *)
3445 if (
j->quals != NULL && parent_quals == NULL)
3451 if (
j->quals != NULL)
3452 *parent_quals = (
Node *)
3480 (
j->quals == NULL ||
3514 if (
j->quals != NULL && parent_quals == NULL)
3520 if (
j->quals != NULL)
3521 *parent_quals = (
Node *)
3534 elog(
ERROR,
"unrecognized join type: %d",
3540 elog(
ERROR,
"unrecognized node type: %d",
3585 if (
root->glob->lastPHId != 0)
3661 if (
root->glob->lastPHId == 0)
3688 if (
root->glob->lastPHId == 0)
3795 context.subrelids = subrelids;
3828 foreach(l,
root->append_rel_list)
3843 if (
root->glob->lastPHId != 0)
3862 bool include_inner_joins)
3883 include_outer_joins,
3884 include_inner_joins));
3892 include_outer_joins,
3893 include_inner_joins);
3896 include_outer_joins,
3897 include_inner_joins));
3902 if (include_inner_joins)
3907 if (include_outer_joins)
3913 elog(
ERROR,
"unrecognized node type: %d",
3929 elog(
ERROR,
"could not find join node %d", joinrelid);
3966 if (relid ==
j->rtindex)
3976 elog(
ERROR,
"unrecognized node type: %d",
#define InvalidAttrNumber
Bitmapset * bms_join(Bitmapset *a, Bitmapset *b)
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)
void bms_free(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_add_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_del_member(Bitmapset *a, int x)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
#define Assert(condition)
List * find_forced_null_vars(Node *node)
Query * inline_set_returning_function(PlannerInfo *root, RangeTblEntry *rte)
Relids find_nonnullable_rels(Node *clause)
List * find_nonnullable_vars(Node *clause)
Node * eval_const_expressions(PlannerInfo *root, Node *node)
bool contain_volatile_functions(Node *clause)
TypeFuncClass get_expr_result_type(Node *expr, Oid *resultTypeId, TupleDesc *resultTupleDesc)
List * lappend(List *list, void *datum)
List * list_concat(List *list1, const List *list2)
Alias * makeAlias(const char *aliasname, List *colnames)
Var * makeVarFromTargetEntry(int varno, TargetEntry *tle)
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Expr * make_andclause(List *andclauses)
FromExpr * makeFromExpr(List *fromlist, Node *quals)
void * palloc0(Size size)
MemoryContext CurrentMemoryContext
#define CHECK_FOR_INTERRUPTS()
Bitmapset * mbms_overlap_sets(const List *a, const List *b)
List * mbms_add_members(List *a, const List *b)
bool expression_returns_set(Node *clause)
static bool is_andclause(const void *clause)
static Expr * get_notclausearg(const void *notclause)
#define query_tree_walker(q, w, c, f)
#define query_or_expression_tree_walker(n, w, c, f)
#define range_table_entry_walker(r, w, c, f)
#define expression_tree_walker(n, w, c)
static bool is_notclause(const void *clause)
#define IsA(nodeptr, _type_)
#define IS_OUTER_JOIN(jointype)
#define castNode(_type_, nodeptr)
TargetEntry * get_tle_by_resno(List *tlist, AttrNumber resno)
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
#define rt_fetch(rangetable_index, rangetable)
#define lfirst_node(type, lc)
static int list_length(const List *l)
#define linitial_node(type, l)
#define forboth(cell1, list1, cell2, list2)
#define foreach_delete_current(lst, var_or_cell)
#define foreach_node(type, var, lst)
PlaceHolderVar * make_placeholder_expr(PlannerInfo *root, Expr *expr, Relids phrels)
void check_stack_depth(void)
static Node * pull_up_subqueries_recurse(PlannerInfo *root, Node *jtnode, JoinExpr *lowest_outer_join, AppendRelInfo *containing_appendrel)
static void remove_result_refs(PlannerInfo *root, int varno, Node *newjtloc)
static Node * pull_up_constant_function(PlannerInfo *root, Node *jtnode, RangeTblEntry *rte, AppendRelInfo *containing_appendrel)
void preprocess_function_rtes(PlannerInfo *root)
static bool find_dependent_phvs_walker(Node *node, find_dependent_phvs_context *context)
static Node * find_jointree_node_for_rel(Node *jtnode, int relid)
static Node * pull_up_simple_union_all(PlannerInfo *root, Node *jtnode, RangeTblEntry *rte)
static void reduce_outer_joins_pass2(Node *jtnode, reduce_outer_joins_pass1_state *state1, reduce_outer_joins_pass2_state *state2, PlannerInfo *root, Relids nonnullable_rels, List *forced_null_vars)
static void pull_up_union_leaf_queries(Node *setOp, PlannerInfo *root, int parentRTindex, Query *setOpQuery, int childRToffset)
static bool is_simple_values(PlannerInfo *root, RangeTblEntry *rte)
static void make_setop_translation_list(Query *query, int newvarno, AppendRelInfo *appinfo)
void flatten_simple_union_all(PlannerInfo *root)
void transform_MERGE_to_join(Query *parse)
static void report_reduced_full_join(reduce_outer_joins_pass2_state *state2, int rtindex, Relids relids)
static void perform_pullup_replace_vars(PlannerInfo *root, pullup_replace_vars_context *rvcontext, AppendRelInfo *containing_appendrel)
void remove_useless_result_rtes(PlannerInfo *root)
static Node * pull_up_sublinks_jointree_recurse(PlannerInfo *root, Node *jtnode, Relids *relids)
static reduce_outer_joins_pass1_state * reduce_outer_joins_pass1(Node *jtnode)
static void replace_vars_in_jointree(Node *jtnode, pullup_replace_vars_context *context)
static bool is_simple_subquery(PlannerInfo *root, Query *subquery, RangeTblEntry *rte, JoinExpr *lowest_outer_join)
static void substitute_phv_relids(Node *node, int varno, Relids subrelids)
void pull_up_sublinks(PlannerInfo *root)
static Node * pullup_replace_vars_callback(Var *var, replace_rte_variables_context *context)
static Node * pull_up_simple_subquery(PlannerInfo *root, Node *jtnode, RangeTblEntry *rte, JoinExpr *lowest_outer_join, AppendRelInfo *containing_appendrel)
void replace_empty_jointree(Query *parse)
static bool is_simple_union_all_recurse(Node *setOp, Query *setOpQuery, List *colTypes)
static bool substitute_phv_relids_walker(Node *node, substitute_phv_relids_context *context)
static void fix_append_rel_relids(PlannerInfo *root, int varno, Relids subrelids)
static Node * remove_useless_results_recurse(PlannerInfo *root, Node *jtnode, Node **parent_quals, Relids *dropped_outer_joins)
static Query * pullup_replace_vars_subquery(Query *query, pullup_replace_vars_context *context)
Relids get_relids_for_join(Query *query, int joinrelid)
void pull_up_subqueries(PlannerInfo *root)
Relids get_relids_in_jointree(Node *jtnode, bool include_outer_joins, bool include_inner_joins)
static int get_result_relid(PlannerInfo *root, Node *jtnode)
static Node * pull_up_simple_values(PlannerInfo *root, Node *jtnode, RangeTblEntry *rte)
struct reduce_outer_joins_pass1_state reduce_outer_joins_pass1_state
struct reduce_outer_joins_partial_state reduce_outer_joins_partial_state
static bool is_safe_append_member(Query *subquery)
struct pullup_replace_vars_context pullup_replace_vars_context
static Node * pull_up_sublinks_qual_recurse(PlannerInfo *root, Node *node, Node **jtlink1, Relids available_rels1, Node **jtlink2, Relids available_rels2)
void reduce_outer_joins(PlannerInfo *root)
static bool find_dependent_phvs(PlannerInfo *root, int varno)
static bool jointree_contains_lateral_outer_refs(PlannerInfo *root, Node *jtnode, bool restricted, Relids safe_upper_varnos)
struct reduce_outer_joins_pass2_state reduce_outer_joins_pass2_state
static Node * pullup_replace_vars(Node *expr, pullup_replace_vars_context *context)
static bool is_simple_union_all(Query *subquery)
static bool find_dependent_phvs_in_jointree(PlannerInfo *root, Node *node, int varno)
#define NUM_MERGE_MATCH_KINDS
@ MERGE_WHEN_NOT_MATCHED_BY_TARGET
@ MERGE_WHEN_NOT_MATCHED_BY_SOURCE
static struct subre * parse(struct vars *v, int stopper, int type, struct state *init, struct state *final)
void IncrementVarSublevelsUp_rtable(List *rtable, int delta_sublevels_up, int min_sublevels_up)
Node * replace_rte_variables_mutator(Node *node, replace_rte_variables_context *context)
void OffsetVarNodes(Node *node, int offset, int sublevels_up)
void CombineRangeTables(List **dst_rtable, List **dst_perminfos, List *src_rtable, List *src_perminfos)
Node * remove_nulling_relids(Node *node, const Bitmapset *removable_relids, const Bitmapset *except_relids)
Node * replace_rte_variables(Node *node, int target_varno, int sublevels_up, replace_rte_variables_callback callback, void *callback_arg, bool *outer_hasSubLinks)
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)
Index qual_security_level
struct Path * non_recursive_path
List * processed_groupClause
List * processed_distinctClause
Relids leaf_result_relids
struct TableSampleClause * tablesample
RangeTblEntry * target_rte
JoinExpr * convert_ANY_sublink_to_join(PlannerInfo *root, SubLink *sublink, Relids available_rels)
JoinExpr * convert_EXISTS_sublink_to_join(PlannerInfo *root, SubLink *sublink, bool under_not, Relids available_rels)
bool tlist_same_datatypes(List *tlist, List *colTypes, bool junkOK)
bool contain_vars_of_level(Node *node, int levelsup)
Relids pull_varnos_of_level(PlannerInfo *root, Node *node, int levelsup)
Node * flatten_join_alias_vars(PlannerInfo *root, Query *query, Node *node)