115 #define NUM_EXEC_TLIST(parentplan) ((parentplan)->plan_rows)
116 #define NUM_EXEC_QUAL(parentplan) ((parentplan)->plan_rows * 2.0)
125 #define ISREGCLASSCONST(con) \
126 (((con)->consttype == REGCLASSOID || (con)->consttype == OIDOID) && \
129 #define fix_scan_list(root, lst, rtoffset, num_exec) \
130 ((List *) fix_scan_expr(root, (Node *) (lst), rtoffset, num_exec))
160 int rtoffset,
double num_exec);
189 Index acceptable_rel,
207 Index resultRelation,
304 foreach(lc,
root->rowMarks)
314 newrc->
rti += rtoffset;
315 newrc->
prti += rtoffset;
325 foreach(lc,
root->append_rel_list)
343 if (
root->hasAlternativeSubPlans)
345 root->isAltSubplan = (
bool *)
347 root->isUsedSubplan = (
bool *)
362 if (
root->hasAlternativeSubPlans)
374 if (
root->isAltSubplan[ndx] && !
root->isUsedSubplan[ndx])
405 foreach(lc,
root->parse->rtable)
425 foreach(lc,
root->parse->rtable)
436 rti < root->simple_rel_array_size)
465 else if (recursing ||
520 cxt->query = save_query;
550 newrte->joinaliasvars =
NIL;
551 newrte->joinleftcols =
NIL;
552 newrte->joinrightcols =
NIL;
553 newrte->join_using_alias = NULL;
557 newrte->coltypes =
NIL;
558 newrte->coltypmods =
NIL;
559 newrte->colcollations =
NIL;
560 newrte->securityQuals =
NIL;
584 if (rte->perminfoindex > 0)
598 newrte->perminfoindex = 0;
616 plan->plan_node_id =
root->glob->lastPlanNodeId++;
627 splan->scan.scanrelid += rtoffset;
628 splan->scan.plan.targetlist =
631 splan->scan.plan.qual =
640 splan->scan.scanrelid += rtoffset;
641 splan->scan.plan.targetlist =
644 splan->scan.plan.qual =
656 splan->scan.scanrelid += rtoffset;
657 splan->scan.plan.targetlist =
660 splan->scan.plan.qual =
666 splan->indexqualorig =
669 splan->indexorderby =
672 splan->indexorderbyorig =
677 case T_IndexOnlyScan:
684 case T_BitmapIndexScan:
688 splan->scan.scanrelid += rtoffset;
694 splan->indexqualorig =
699 case T_BitmapHeapScan:
703 splan->scan.scanrelid += rtoffset;
704 splan->scan.plan.targetlist =
707 splan->scan.plan.qual =
710 splan->bitmapqualorig =
719 splan->scan.scanrelid += rtoffset;
720 splan->scan.plan.targetlist =
723 splan->scan.plan.qual =
735 splan->scan.scanrelid += rtoffset;
736 splan->scan.plan.targetlist =
739 splan->scan.plan.qual =
742 splan->tidrangequals =
756 splan->scan.scanrelid += rtoffset;
757 splan->scan.plan.targetlist =
760 splan->scan.plan.qual =
767 case T_TableFuncScan:
771 splan->scan.scanrelid += rtoffset;
772 splan->scan.plan.targetlist =
775 splan->scan.plan.qual =
787 splan->scan.scanrelid += rtoffset;
788 splan->scan.plan.targetlist =
791 splan->scan.plan.qual =
794 splan->values_lists =
803 splan->scan.scanrelid += rtoffset;
804 splan->scan.plan.targetlist =
807 splan->scan.plan.qual =
812 case T_NamedTuplestoreScan:
816 splan->scan.scanrelid += rtoffset;
817 splan->scan.plan.targetlist =
820 splan->scan.plan.qual =
825 case T_WorkTableScan:
829 splan->scan.scanrelid += rtoffset;
830 splan->scan.plan.targetlist =
833 splan->scan.plan.qual =
881 case T_IncrementalSort:
912 foreach(l,
splan->rowMarks)
917 rc->
prti += rtoffset;
1011 if (
splan->plan.lefttree != NULL)
1027 foreach(l,
splan->plan.targetlist)
1038 splan->plan.targetlist =
1046 splan->resconstantqual =
1061 splan->withCheckOptionLists =
1065 if (
splan->returningLists)
1077 lcrr,
splan->resultRelations)
1087 newRL =
lappend(newRL, rlist);
1089 splan->returningLists = newRL;
1110 if (
splan->onConflictSet)
1116 splan->onConflictSet =
1130 splan->exclRelTlist =
1144 if (
splan->mergeActionLists !=
NIL)
1170 lcj,
splan->mergeJoinConditions,
1171 lcr,
splan->resultRelations)
1177 foreach(l, mergeActionList)
1201 mergeJoinCondition = (
Node *)
1203 (
List *) mergeJoinCondition,
1209 newMJC =
lappend(newMJC, mergeJoinCondition);
1211 splan->mergeJoinConditions = newMJC;
1214 splan->nominalRelation += rtoffset;
1215 if (
splan->rootRelation)
1216 splan->rootRelation += rtoffset;
1217 splan->exclRelRTI += rtoffset;
1219 foreach(l,
splan->resultRelations)
1223 foreach(l,
splan->rowMarks)
1227 rc->
rti += rtoffset;
1228 rc->
prti += rtoffset;
1235 root->glob->resultRelations =
1237 splan->resultRelations);
1238 if (
splan->rootRelation)
1240 root->glob->resultRelations =
1242 splan->rootRelation);
1256 case T_RecursiveUnion:
1268 foreach(l,
splan->bitmapplans)
1283 foreach(l,
splan->bitmapplans)
1292 elog(
ERROR,
"unrecognized node type: %d",
1326 List *stripped_indextlist;
1336 stripped_indextlist =
NIL;
1337 foreach(lc,
plan->indextlist)
1341 if (!indextle->resjunk)
1342 stripped_indextlist =
lappend(stripped_indextlist, indextle);
1347 plan->scan.scanrelid += rtoffset;
1348 plan->scan.plan.targetlist = (
List *)
1350 (
Node *)
plan->scan.plan.targetlist,
1382 pfree(index_itlist);
1424 plan->scan.scanrelid += rtoffset;
1425 plan->scan.plan.targetlist =
1428 plan->scan.plan.qual =
1479 if (
plan->scan.plan.qual !=
NIL)
1487 forboth(lp,
plan->scan.plan.targetlist, lc,
plan->subplan->targetlist)
1492 if (ptle->resjunk != ctle->resjunk)
1545 bool unsafe_initplans;
1548 &initplan_cost, &unsafe_initplans);
1551 if (unsafe_initplans)
1594 fscan->
scan.plan.targetlist = (
List *)
1596 (
Node *) fscan->
scan.plan.targetlist,
1610 fscan->fdw_exprs = (
List *)
1612 (
Node *) fscan->fdw_exprs,
1618 fscan->fdw_recheck_quals = (
List *)
1620 (
Node *) fscan->fdw_recheck_quals,
1628 fscan->fdw_scan_tlist =
1638 fscan->
scan.plan.targetlist =
1641 fscan->scan.plan.
qual =
1647 fscan->fdw_recheck_quals =
1680 cscan->
scan.plan.targetlist = (
List *)
1682 (
Node *) cscan->
scan.plan.targetlist,
1696 cscan->custom_exprs = (
List *)
1698 (
Node *) cscan->custom_exprs,
1706 cscan->custom_scan_tlist =
1713 cscan->
scan.plan.targetlist =
1716 cscan->scan.plan.
qual =
1719 cscan->custom_exprs =
1792 foreach(l2, prune_infos)
1805 return (
Plan *) aplan;
1868 foreach(l2, prune_infos)
1881 return (
Plan *) mplan;
1972 ((
Aggref *) node)->aggfnoid);
1988 ((
OpExpr *) node)->opfuncid);
2021 root->glob->relationOids =
2039 foreach(lc, g->refs)
2065 int subqueryid = p->
paramid >> 16;
2066 int colno = p->
paramid & 0xFFFF;
2069 if (subqueryid <= 0 ||
2113 if (bestplan == NULL || curcost <= bestcost)
2124 root->isUsedSubplan[bestplan->
plan_id - 1] =
true;
2126 return (
Node *) bestplan;
2156 if (rtoffset != 0 ||
2157 root->multiexpr_params !=
NIL ||
2158 root->glob->lastPHId != 0 ||
2160 root->hasAlternativeSubPlans)
2202 if (var->varnosyn > 0)
2203 var->varnosyn +=
context->rtoffset;
2204 return (
Node *) var;
2215 if (aggparam != NULL)
2228 return (
Node *) cexpr;
2272 Plan *outer_plan = join->plan.lefttree;
2273 Plan *inner_plan = join->plan.righttree;
2327 elog(
ERROR,
"NestLoopParam was not reduced to a simple Var");
2380 join->plan.targetlist,
2396 pfree(outer_itlist);
2397 pfree(inner_itlist);
2423 List *output_targetlist;
2428 output_targetlist =
NIL;
2429 foreach(l,
plan->targetlist)
2461 output_targetlist =
lappend(output_targetlist, tle);
2463 plan->targetlist = output_targetlist;
2474 pfree(subplan_itlist);
2489 if (
plan->lefttree->extParam)
2495 for (proot =
root; proot != NULL; proot = proot->parent_root)
2560 memcpy(child_agg, orig_agg,
sizeof(
Aggref));
2589 return (
Node *) parent_agg;
2611 List *output_targetlist;
2614 output_targetlist =
NIL;
2615 foreach(l,
plan->targetlist)
2630 output_targetlist =
lappend(output_targetlist, tle);
2641 oldvar->varnosyn > 0)
2643 newvar->varnosyn = oldvar->varnosyn + rtoffset;
2644 newvar->varattnosyn = oldvar->varattnosyn;
2648 newvar->varnosyn = 0;
2649 newvar->varattnosyn = 0;
2654 output_targetlist =
lappend(output_targetlist, tle);
2656 plan->targetlist = output_targetlist;
2687 itlist->
tlist = tlist;
2692 vinfo = itlist->
vars;
2738 itlist->
tlist = tlist;
2743 vinfo = itlist->
vars;
2786 int newvarno,
int rtoffset,
2789 int varno = var->
varno;
2794 vinfo = itlist->
vars;
2817 if (!(varattno <= 0 ||
2823 elog(
ERROR,
"wrong varnullingrels %s (expected %s) for Var %d/%d",
2828 newvar->
varno = newvarno;
2830 if (newvar->varnosyn > 0)
2831 newvar->varnosyn += rtoffset;
2856 foreach(lc, itlist->
tlist)
2879 elog(
ERROR,
"wrong phnullingrels %s (expected %s) for PlaceHolderVar %d",
2886 newvar->varnosyn = 0;
2887 newvar->varattnosyn = 0;
2925 newvar->varnosyn = 0;
2926 newvar->varattnosyn = 0;
2950 foreach(lc, itlist->
tlist)
2969 newvar->varnosyn = 0;
2970 newvar->varattnosyn = 0;
3025 Index acceptable_rel,
3033 context.outer_itlist = outer_itlist;
3034 context.inner_itlist = inner_itlist;
3035 context.acceptable_rel = acceptable_rel;
3037 context.nrm_match = nrm_match;
3062 return (
Node *) newvar;
3074 return (
Node *) newvar;
3082 if (var->varnosyn > 0)
3083 var->varnosyn +=
context->rtoffset;
3084 return (
Node *) var;
3088 elog(
ERROR,
"variable not found in subplan target lists");
3102 return (
Node *) newvar;
3111 return (
Node *) newvar;
3119 if (
context->outer_itlist &&
context->outer_itlist->has_non_vars)
3125 return (
Node *) newvar;
3127 if (
context->inner_itlist &&
context->inner_itlist->has_non_vars)
3133 return (
Node *) newvar;
3193 context.subplan_itlist = subplan_itlist;
3196 context.nrm_match = nrm_match;
3218 elog(
ERROR,
"variable not found in subplan target list");
3219 return (
Node *) newvar;
3226 if (
context->subplan_itlist->has_ph_vars)
3233 return (
Node *) newvar;
3240 if (
context->subplan_itlist->has_non_vars)
3246 return (
Node *) newvar;
3258 if (aggparam != NULL)
3308 Index resultRelation,
3363 return (
Node *) newvar;
3364 elog(
ERROR,
"WindowFunc not found in subplan target lists");
3386 context.subplan_itlist = subplan_itlist;
3429 if (
root->minmax_aggs !=
NIL &&
3435 foreach(lc,
root->minmax_aggs)
3441 return mminfo->
param;
3479 inval_item->
cacheId = PROCOID;
3515 inval_item->
cacheId = TYPEOID;
3542 List **relationOids,
3544 bool *hasRowSecurity)
3550 MemSet(&glob, 0,
sizeof(glob));
3551 glob.type = T_PlannerGlobal;
3558 root.type = T_PlannerInfo;
3618 if (query->hasRowSecurity)
3619 context->glob->dependsOnRole =
true;
3622 foreach(lc, query->
rtable)
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)
Bitmapset * bms_add_member(Bitmapset *a, int x)
Bitmapset * bms_intersect(const Bitmapset *a, const Bitmapset *b)
#define Assert(condition)
#define FLEXIBLE_ARRAY_MEMBER
#define MemSet(start, val, len)
#define OidIsValid(objectId)
bool equal(const void *a, const void *b)
if(TABLE==NULL||TABLE_index==NULL)
List * lappend(List *list, void *datum)
List * lappend_int(List *list, int datum)
List * lappend_oid(List *list, Oid datum)
List * list_concat(List *list1, const List *list2)
Datum lca(PG_FUNCTION_ARGS)
Var * makeVarFromTargetEntry(int varno, TargetEntry *tle)
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Const * makeNullConst(Oid consttype, int32 consttypmod, Oid constcollid)
Var * makeVar(int varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
TargetEntry * flatCopyTargetEntry(TargetEntry *src_tle)
void pfree(void *pointer)
void * palloc0(Size size)
Oid exprType(const Node *expr)
int32 exprTypmod(const Node *expr)
Oid exprCollation(const Node *expr)
void set_sa_opfuncid(ScalarArrayOpExpr *opexpr)
void set_opfuncid(OpExpr *opexpr)
#define expression_tree_mutator(n, m, c)
#define query_tree_walker(q, w, c, f)
#define expression_tree_walker(n, w, c)
#define QTW_EXAMINE_RTES_BEFORE
#define IsA(nodeptr, _type_)
#define DO_AGGSPLIT_COMBINE(as)
@ AGGSPLIT_FINAL_DESERIAL
@ AGGSPLIT_INITIAL_SERIAL
char * bmsToString(const Bitmapset *bms)
RTEPermissionInfo * addRTEPermissionInfo(List **rteperminfos, RangeTblEntry *rte)
RTEPermissionInfo * getRTEPermissionInfo(List *rteperminfos, RangeTblEntry *rte)
#define lfirst_node(type, lc)
static int list_length(const List *l)
#define forboth(cell1, list1, cell2, list2)
#define foreach_current_index(var_or_cell)
#define forthree(cell1, list1, cell2, list2, cell3, list3)
static void * list_nth(const List *list, int n)
void mark_partial_aggref(Aggref *agg, AggSplit aggsplit)
@ SUBQUERY_SCAN_NONTRIVIAL
static Oid DatumGetObjectId(Datum X)
static Datum ObjectIdGetDatum(Oid X)
#define IS_SPECIAL_VARNO(varno)
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
void record_plan_type_dependency(PlannerInfo *root, Oid typid)
#define NUM_EXEC_QUAL(parentplan)
static void set_hash_references(PlannerInfo *root, Plan *plan, int rtoffset)
static void fix_expr_common(PlannerInfo *root, Node *node)
static void add_rtes_to_flat_rtable(PlannerInfo *root, bool recursing)
static Node * fix_join_expr_mutator(Node *node, fix_join_expr_context *context)
static void add_rte_to_flat_rtable(PlannerGlobal *glob, List *rteperminfos, RangeTblEntry *rte)
static Plan * set_append_references(PlannerInfo *root, Append *aplan, int rtoffset)
static Node * fix_param_node(PlannerInfo *root, Param *p)
static Plan * set_mergeappend_references(PlannerInfo *root, MergeAppend *mplan, int rtoffset)
static indexed_tlist * build_tlist_index_other_vars(List *tlist, int ignore_rel)
static List * set_returning_clause_references(PlannerInfo *root, List *rlist, Plan *topplan, Index resultRelation, int rtoffset)
void record_plan_function_dependency(PlannerInfo *root, Oid funcid)
static Relids offset_relid_set(Relids relids, int rtoffset)
static bool flatten_rtes_walker(Node *node, flatten_rtes_walker_context *cxt)
static indexed_tlist * build_tlist_index(List *tlist)
static List * set_windowagg_runcondition_references(PlannerInfo *root, List *runcondition, Plan *plan)
bool trivial_subqueryscan(SubqueryScan *plan)
static void set_upper_references(PlannerInfo *root, Plan *plan, int rtoffset)
static Node * fix_alternative_subplan(PlannerInfo *root, AlternativeSubPlan *asplan, double num_exec)
static Var * search_indexed_tlist_for_sortgroupref(Expr *node, Index sortgroupref, indexed_tlist *itlist, int newvarno)
static void flatten_unplanned_rtes(PlannerGlobal *glob, RangeTblEntry *rte)
static Node * fix_upper_expr(PlannerInfo *root, Node *node, indexed_tlist *subplan_itlist, int newvarno, int rtoffset, NullingRelsMatch nrm_match, double num_exec)
static void set_param_references(PlannerInfo *root, Plan *plan)
static Var * search_indexed_tlist_for_non_var(Expr *node, indexed_tlist *itlist, int newvarno)
static Node * fix_upper_expr_mutator(Node *node, fix_upper_expr_context *context)
static Node * fix_scan_expr_mutator(Node *node, fix_scan_expr_context *context)
static void set_foreignscan_references(PlannerInfo *root, ForeignScan *fscan, int rtoffset)
static Plan * set_subqueryscan_references(PlannerInfo *root, SubqueryScan *plan, int rtoffset)
static Var * search_indexed_tlist_for_phv(PlaceHolderVar *phv, indexed_tlist *itlist, int newvarno, NullingRelsMatch nrm_match)
static Plan * set_indexonlyscan_references(PlannerInfo *root, IndexOnlyScan *plan, int rtoffset)
static List * fix_join_expr(PlannerInfo *root, List *clauses, indexed_tlist *outer_itlist, indexed_tlist *inner_itlist, Index acceptable_rel, int rtoffset, NullingRelsMatch nrm_match, double num_exec)
static Node * convert_combining_aggrefs(Node *node, void *context)
static void set_dummy_tlist_references(Plan *plan, int rtoffset)
static void set_customscan_references(PlannerInfo *root, CustomScan *cscan, int rtoffset)
static Node * fix_windowagg_condition_expr_mutator(Node *node, fix_windowagg_cond_context *context)
#define ISREGCLASSCONST(con)
Plan * set_plan_references(PlannerInfo *root, Plan *plan)
void extract_query_dependencies(Node *query, List **relationOids, List **invalItems, bool *hasRowSecurity)
bool extract_query_dependencies_walker(Node *node, PlannerInfo *context)
static Var * copyVar(Var *var)
#define NUM_EXEC_TLIST(parentplan)
Param * find_minmax_agg_replacement_param(PlannerInfo *root, Aggref *aggref)
static void set_join_references(PlannerInfo *root, Join *join, int rtoffset)
static List * fix_windowagg_condition_expr(PlannerInfo *root, List *runcondition, indexed_tlist *subplan_itlist)
static Plan * clean_up_removed_plan_level(Plan *parent, Plan *child)
static Node * fix_scan_expr(PlannerInfo *root, Node *node, int rtoffset, double num_exec)
static Plan * set_plan_refs(PlannerInfo *root, Plan *plan, int rtoffset)
static bool fix_scan_expr_walker(Node *node, fix_scan_expr_context *context)
static Var * search_indexed_tlist_for_var(Var *var, indexed_tlist *itlist, int newvarno, int rtoffset, NullingRelsMatch nrm_match)
#define fix_scan_list(root, lst, rtoffset, num_exec)
struct PartitionPruneInfo * part_prune_info
Bitmapset * custom_relids
Bitmapset * fs_base_relids
struct PartitionPruneInfo * part_prune_info
struct TableSampleClause * tablesample
NullingRelsMatch nrm_match
indexed_tlist * outer_itlist
indexed_tlist * inner_itlist
indexed_tlist * subplan_itlist
NullingRelsMatch nrm_match
indexed_tlist * subplan_itlist
tlist_vinfo vars[FLEXIBLE_ARRAY_MEMBER]
Bitmapset * varnullingrels
void SS_compute_initplan_cost(List *init_plans, Cost *initplan_cost_p, bool *unsafe_initplans_p)
#define GetSysCacheHashValue1(cacheId, key1)
void apply_tlist_labeling(List *dest_tlist, List *src_tlist)
TargetEntry * tlist_member(Expr *node, List *targetlist)
#define FirstUnpinnedObjectId
Query * UtilityContainsQuery(Node *parsetree)