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);
171 if (
parse->mergeUseOuterJoin)
186 joinrte->
alias = NULL;
189 joinrte->
inh =
false;
208 joinexpr->usingClause =
NIL;
209 joinexpr->join_using_alias = NULL;
212 joinexpr->alias = NULL;
217 parse->jointree->quals = NULL;
242 if (
parse->jointree->fromlist !=
NIL)
246 if (
parse->setOperations)
355 newfromlist =
lappend(newfromlist, newchild);
356 frelids =
bms_join(frelids, childrelids);
361 jtlink = (
Node *) newf;
437 elog(
ERROR,
"unrecognized join type: %d",
450 *relids =
bms_join(leftrelids, rightrelids);
456 elog(
ERROR,
"unrecognized node type: %d",
493 available_rels1)) != NULL)
497 *jtlink1 = (
Node *)
j;
517 if (available_rels2 != NULL &&
519 available_rels2)) != NULL)
523 *jtlink2 = (
Node *)
j;
547 available_rels1)) != NULL)
551 *jtlink1 = (
Node *)
j;
571 if (available_rels2 != NULL &&
573 available_rels2)) != NULL)
577 *jtlink2 = (
Node *)
j;
613 available_rels1)) != NULL)
617 *jtlink1 = (
Node *)
j;
637 if (available_rels2 != NULL &&
639 available_rels2)) != NULL)
643 *jtlink2 = (
Node *)
j;
686 newclauses =
lappend(newclauses, newclause);
689 if (newclauses ==
NIL)
836 (containing_appendrel == NULL ||
840 containing_appendrel);
862 lowest_outer_join == NULL &&
863 containing_appendrel == NULL &&
872 containing_appendrel);
881 Assert(containing_appendrel == NULL);
894 Assert(containing_appendrel == NULL);
933 elog(
ERROR,
"unrecognized join type: %d",
939 elog(
ERROR,
"unrecognized node type: %d",
984 subroot->
parse = subquery;
987 subroot->parent_root = root->parent_root;
1003 memset(subroot->upper_rels, 0,
sizeof(subroot->upper_rels));
1004 memset(subroot->upper_targets, 0,
sizeof(subroot->upper_targets));
1009 subroot->grouping_map = NULL;
1031 if (subquery->hasSubLinks)
1114 rvcontext.
root = root;
1123 rvcontext.
varno = varno;
1137 if (containing_appendrel != NULL)
1149 if (
parse->groupingSets)
1158 containing_appendrel);
1169 foreach(lc, subquery->
rtable)
1201 subquery->
rtable, subquery->rteperminfos);
1263 parse->hasSubLinks |= subquery->hasSubLinks;
1266 parse->hasRowSecurity |= subquery->hasRowSecurity;
1341 rtable, subquery->rteperminfos);
1380 Query *setOpQuery,
int childRToffset)
1391 childRTindex = childRToffset + rtr->
rtindex;
1435 elog(
ERROR,
"unrecognized node type: %d",
1459 appinfo->parent_colnos = pcolnos =
1515 if (subquery->hasAggs ||
1516 subquery->hasWindowFuncs ||
1517 subquery->hasTargetSRFs ||
1525 subquery->hasForUpdate ||
1543 Relids safe_upper_varnos;
1554 if (lowest_outer_join != NULL)
1563 safe_upper_varnos = NULL;
1568 restricted, safe_upper_varnos))
1584 if (lowest_outer_join != NULL)
1655 foreach(lc, values_list)
1664 rvcontext.
root = root;
1669 rvcontext.
varno = varno;
1805 if (rtf->funccolcount != 1)
1815 rvcontext.
root = root;
1842 if (containing_appendrel != NULL)
1849 if (
parse->groupingSets)
1858 containing_appendrel);
1930 Assert(subquery != NULL);
1950 elog(
ERROR,
"unrecognized node type: %d",
1987 if (jtnode->
quals != NULL)
2012 Relids safe_upper_varnos)
2050 safe_upper_varnos = NULL;
2072 elog(
ERROR,
"unrecognized node type: %d",
2099 if (containing_appendrel)
2125 foreach(lc,
parse->windowClause)
2129 if (wc->runCondition !=
NIL)
2130 wc->runCondition = (
List *)
2133 if (
parse->onConflict)
2135 parse->onConflict->onConflictSet = (
List *)
2138 parse->onConflict->onConflictWhere =
2147 if (
parse->mergeActionList)
2149 foreach(lc,
parse->mergeActionList)
2176 foreach(lc,
parse->rtable)
2209 if (varno != context->
varno)
2288 elog(
ERROR,
"unrecognized node type: %d",
2324 need_phv = (var->varnullingrels != NULL) || rcon->
wrap_non_vars;
2367 (var->vartype != RECORDOID),
2368 &colnames, &fields);
2378 rowexpr->
args = fields;
2379 rowexpr->row_typeid = var->vartype;
2381 rowexpr->colnames = (var->vartype == RECORDOID) ? colnames :
NIL;
2383 newnode = (
Node *) rowexpr;
2408 elog(
ERROR,
"could not find attribute %d in subquery targetlist",
2419 if (newnode &&
IsA(newnode,
Var) &&
2420 ((
Var *) newnode)->varlevelsup == 0)
2474 if (var->varnullingrels != NULL)
2478 Var *newvar = (
Var *) newnode;
2482 var->varnullingrels);
2490 var->varnullingrels);
2493 elog(
ERROR,
"failed to wrap a non-Var");
2538 Node *leftmostjtnode;
2564 leftmostjtnode = topop->
larg;
2568 leftmostRTI = ((
RangeTblRef *) leftmostjtnode)->rtindex;
2584 ((
RangeTblRef *) leftmostjtnode)->rtindex = childRTI;
2587 leftmostRTE->
inh =
true;
2602 parse->setOperations = NULL;
2671 elog(
ERROR,
"so where are the outer joins?");
2781 elog(
ERROR,
"unrecognized node type: %d",
2808 List *forced_null_vars)
2823 Relids pass_nonnullable_rels;
2824 List *pass_forced_null_vars;
2842 pass_nonnullable_rels,
2843 pass_forced_null_vars);
2851 int rtindex =
j->rtindex;
2903 elog(
ERROR,
"unrecognized join type: %d",
2939 List *nonnullable_vars;
2959 if (rtindex && jointype !=
j->jointype)
2970 j->jointype = jointype;
2975 Relids local_nonnullable_rels;
2976 List *local_forced_null_vars;
2977 Relids pass_nonnullable_rels;
2978 List *pass_forced_null_vars;
3017 local_nonnullable_rels = NULL;
3018 local_forced_null_vars =
NIL;
3026 pass_nonnullable_rels = local_nonnullable_rels;
3027 pass_forced_null_vars = local_forced_null_vars;
3032 pass_nonnullable_rels = nonnullable_rels;
3033 pass_forced_null_vars = forced_null_vars;
3038 pass_nonnullable_rels = NULL;
3039 pass_forced_null_vars =
NIL;
3043 pass_nonnullable_rels,
3044 pass_forced_null_vars);
3052 pass_nonnullable_rels = local_nonnullable_rels;
3053 pass_forced_null_vars = local_forced_null_vars;
3058 pass_nonnullable_rels = NULL;
3059 pass_forced_null_vars =
NIL;
3063 pass_nonnullable_rels,
3064 pass_forced_null_vars);
3070 elog(
ERROR,
"unrecognized node type: %d",
3077 int rtindex,
Relids relids)
3147 Relids dropped_outer_joins = NULL;
3157 &dropped_outer_joins);
3174 dropped_outer_joins,
3179 dropped_outer_joins,
3217 Node **parent_quals,
3218 Relids *dropped_outer_joins)
3228 Relids result_relids = NULL;
3248 dropped_outer_joins);
3296 (f->
quals == NULL || parent_quals != NULL))
3304 if (f->
quals != NULL)
3305 *parent_quals = (
Node *)
3324 dropped_outer_joins);
3329 dropped_outer_joins);
3332 switch (
j->jointype)
3356 if (
j->quals != NULL && parent_quals == NULL)
3362 if (
j->quals != NULL)
3363 *parent_quals = (
Node *)
3372 if (
j->quals != NULL && parent_quals == NULL)
3378 if (
j->quals != NULL)
3379 *parent_quals = (
Node *)
3407 (
j->quals == NULL ||
3441 if (
j->quals != NULL && parent_quals == NULL)
3447 if (
j->quals != NULL)
3448 *parent_quals = (
Node *)
3461 elog(
ERROR,
"unrecognized join type: %d",
3467 elog(
ERROR,
"unrecognized node type: %d",
3569 (
void *) context, 0);
3570 context->sublevels_up--;
3701 (
void *) context, 0);
3702 context->sublevels_up--;
3720 context.
varno = varno;
3789 bool include_inner_joins)
3810 include_outer_joins,
3811 include_inner_joins));
3819 include_outer_joins,
3820 include_inner_joins);
3823 include_outer_joins,
3824 include_inner_joins));
3829 if (include_inner_joins)
3834 if (include_outer_joins)
3840 elog(
ERROR,
"unrecognized node type: %d",
3856 elog(
ERROR,
"could not find join node %d", joinrelid);
3893 if (relid ==
j->rtindex)
3903 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)
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)
elog(ERROR, "%s: %s", p2, msg)
TypeFuncClass get_expr_result_type(Node *expr, Oid *resultTypeId, TupleDesc *resultTupleDesc)
Assert(fmt[strlen(fmt) - 1] !='\n')
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, cell)
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)
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)
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)