116 #define NUM_EXEC_TLIST(parentplan) ((parentplan)->plan_rows)
117 #define NUM_EXEC_QUAL(parentplan) ((parentplan)->plan_rows * 2.0)
126 #define ISREGCLASSCONST(con) \
127 (((con)->consttype == REGCLASSOID || (con)->consttype == OIDOID) && \
130 #define fix_scan_list(root, lst, rtoffset, num_exec) \
131 ((List *) fix_scan_expr(root, (Node *) (lst), rtoffset, num_exec))
161 int rtoffset,
double num_exec);
190 Index acceptable_rel,
208 Index resultRelation,
315 newrc->
rti += rtoffset;
316 newrc->
prti += rtoffset;
346 root->isAltSubplan = (
bool *)
348 root->isUsedSubplan = (
bool *)
375 if (root->isAltSubplan[ndx] && !root->isUsedSubplan[ndx])
437 rti < root->simple_rel_array_size)
439 RelOptInfo *rel = root->simple_rel_array[rti];
466 else if (recursing ||
521 cxt->query = save_query;
628 splan->scan.scanrelid += rtoffset;
629 splan->scan.plan.targetlist =
632 splan->scan.plan.qual =
641 splan->scan.scanrelid += rtoffset;
642 splan->scan.plan.targetlist =
645 splan->scan.plan.qual =
657 splan->scan.scanrelid += rtoffset;
658 splan->scan.plan.targetlist =
661 splan->scan.plan.qual =
667 splan->indexqualorig =
670 splan->indexorderby =
673 splan->indexorderbyorig =
678 case T_IndexOnlyScan:
685 case T_BitmapIndexScan:
689 splan->scan.scanrelid += rtoffset;
695 splan->indexqualorig =
700 case T_BitmapHeapScan:
704 splan->scan.scanrelid += rtoffset;
705 splan->scan.plan.targetlist =
708 splan->scan.plan.qual =
711 splan->bitmapqualorig =
720 splan->scan.scanrelid += rtoffset;
721 splan->scan.plan.targetlist =
724 splan->scan.plan.qual =
736 splan->scan.scanrelid += rtoffset;
737 splan->scan.plan.targetlist =
740 splan->scan.plan.qual =
743 splan->tidrangequals =
757 splan->scan.scanrelid += rtoffset;
758 splan->scan.plan.targetlist =
761 splan->scan.plan.qual =
768 case T_TableFuncScan:
772 splan->scan.scanrelid += rtoffset;
773 splan->scan.plan.targetlist =
776 splan->scan.plan.qual =
788 splan->scan.scanrelid += rtoffset;
789 splan->scan.plan.targetlist =
792 splan->scan.plan.qual =
795 splan->values_lists =
804 splan->scan.scanrelid += rtoffset;
805 splan->scan.plan.targetlist =
808 splan->scan.plan.qual =
813 case T_NamedTuplestoreScan:
817 splan->scan.scanrelid += rtoffset;
818 splan->scan.plan.targetlist =
821 splan->scan.plan.qual =
826 case T_WorkTableScan:
830 splan->scan.scanrelid += rtoffset;
831 splan->scan.plan.targetlist =
834 splan->scan.plan.qual =
882 case T_IncrementalSort:
913 foreach(l,
splan->rowMarks)
918 rc->
prti += rtoffset;
1012 if (
splan->plan.lefttree != NULL)
1028 foreach(l,
splan->plan.targetlist)
1039 splan->plan.targetlist =
1047 splan->resconstantqual =
1062 splan->withCheckOptionLists =
1066 if (
splan->returningLists)
1078 lcrr,
splan->resultRelations)
1088 newRL =
lappend(newRL, rlist);
1090 splan->returningLists = newRL;
1111 if (
splan->onConflictSet)
1117 splan->onConflictSet =
1131 splan->exclRelTlist =
1145 if (
splan->mergeActionLists !=
NIL)
1169 lcr,
splan->resultRelations)
1174 foreach(l, mergeActionList)
1199 splan->nominalRelation += rtoffset;
1200 if (
splan->rootRelation)
1201 splan->rootRelation += rtoffset;
1202 splan->exclRelRTI += rtoffset;
1204 foreach(l,
splan->resultRelations)
1208 foreach(l,
splan->rowMarks)
1212 rc->
rti += rtoffset;
1213 rc->
prti += rtoffset;
1222 splan->resultRelations);
1223 if (
splan->rootRelation)
1227 splan->rootRelation);
1241 case T_RecursiveUnion:
1253 foreach(l,
splan->bitmapplans)
1268 foreach(l,
splan->bitmapplans)
1277 elog(
ERROR,
"unrecognized node type: %d",
1311 List *stripped_indextlist;
1321 stripped_indextlist =
NIL;
1322 foreach(lc,
plan->indextlist)
1326 if (!indextle->resjunk)
1327 stripped_indextlist =
lappend(stripped_indextlist, indextle);
1332 plan->scan.scanrelid += rtoffset;
1333 plan->scan.plan.targetlist = (
List *)
1335 (
Node *)
plan->scan.plan.targetlist,
1367 pfree(index_itlist);
1409 plan->scan.scanrelid += rtoffset;
1410 plan->scan.plan.targetlist =
1413 plan->scan.plan.qual =
1464 if (
plan->scan.plan.qual !=
NIL)
1472 forboth(lp,
plan->scan.plan.targetlist, lc,
plan->subplan->targetlist)
1477 if (ptle->resjunk != ctle->resjunk)
1530 bool unsafe_initplans;
1533 &initplan_cost, &unsafe_initplans);
1536 if (unsafe_initplans)
1579 fscan->
scan.plan.targetlist = (
List *)
1581 (
Node *) fscan->
scan.plan.targetlist,
1595 fscan->fdw_exprs = (
List *)
1597 (
Node *) fscan->fdw_exprs,
1603 fscan->fdw_recheck_quals = (
List *)
1605 (
Node *) fscan->fdw_recheck_quals,
1613 fscan->fdw_scan_tlist =
1623 fscan->
scan.plan.targetlist =
1626 fscan->scan.plan.
qual =
1632 fscan->fdw_recheck_quals =
1665 cscan->
scan.plan.targetlist = (
List *)
1667 (
Node *) cscan->
scan.plan.targetlist,
1681 cscan->custom_exprs = (
List *)
1683 (
Node *) cscan->custom_exprs,
1691 cscan->custom_scan_tlist =
1698 cscan->
scan.plan.targetlist =
1701 cscan->scan.plan.
qual =
1704 cscan->custom_exprs =
1777 foreach(l2, prune_infos)
1790 return (
Plan *) aplan;
1853 foreach(l2, prune_infos)
1866 return (
Plan *) mplan;
1957 ((
Aggref *) node)->aggfnoid);
1973 ((
OpExpr *) node)->opfuncid);
2013 AttrNumber *grouping_map = root->grouping_map;
2024 foreach(lc, g->refs)
2050 int subqueryid = p->
paramid >> 16;
2051 int colno = p->
paramid & 0xFFFF;
2054 if (subqueryid <= 0 ||
2098 if (bestplan == NULL || curcost <= bestcost)
2105 root->isAltSubplan[curplan->
plan_id - 1] =
true;
2109 root->isUsedSubplan[bestplan->
plan_id - 1] =
true;
2111 return (
Node *) bestplan;
2137 context.
root = root;
2141 if (rtoffset != 0 ||
2187 if (var->varnosyn > 0)
2188 var->varnosyn += context->
rtoffset;
2189 return (
Node *) var;
2200 if (aggparam != NULL)
2213 return (
Node *) cexpr;
2257 Plan *outer_plan = join->plan.lefttree;
2258 Plan *inner_plan = join->plan.righttree;
2312 elog(
ERROR,
"NestLoopParam was not reduced to a simple Var");
2365 join->plan.targetlist,
2381 pfree(outer_itlist);
2382 pfree(inner_itlist);
2408 List *output_targetlist;
2413 output_targetlist =
NIL;
2414 foreach(l,
plan->targetlist)
2446 output_targetlist =
lappend(output_targetlist, tle);
2448 plan->targetlist = output_targetlist;
2459 pfree(subplan_itlist);
2474 if (
plan->lefttree->extParam)
2480 for (proot = root; proot != NULL; proot = proot->parent_root)
2545 memcpy(child_agg, orig_agg,
sizeof(
Aggref));
2574 return (
Node *) parent_agg;
2596 List *output_targetlist;
2599 output_targetlist =
NIL;
2600 foreach(l,
plan->targetlist)
2615 output_targetlist =
lappend(output_targetlist, tle);
2626 oldvar->varnosyn > 0)
2628 newvar->varnosyn = oldvar->varnosyn + rtoffset;
2629 newvar->varattnosyn = oldvar->varattnosyn;
2633 newvar->varnosyn = 0;
2634 newvar->varattnosyn = 0;
2639 output_targetlist =
lappend(output_targetlist, tle);
2641 plan->targetlist = output_targetlist;
2672 itlist->
tlist = tlist;
2677 vinfo = itlist->
vars;
2723 itlist->
tlist = tlist;
2728 vinfo = itlist->
vars;
2771 int newvarno,
int rtoffset,
2774 int varno = var->
varno;
2779 vinfo = itlist->
vars;
2802 if (!(varattno <= 0 ||
2808 elog(
ERROR,
"wrong varnullingrels %s (expected %s) for Var %d/%d",
2813 newvar->
varno = newvarno;
2815 if (newvar->varnosyn > 0)
2816 newvar->varnosyn += rtoffset;
2841 foreach(lc, itlist->
tlist)
2864 elog(
ERROR,
"wrong phnullingrels %s (expected %s) for PlaceHolderVar %d",
2871 newvar->varnosyn = 0;
2872 newvar->varattnosyn = 0;
2910 newvar->varnosyn = 0;
2911 newvar->varattnosyn = 0;
2935 foreach(lc, itlist->
tlist)
2947 newvar->varnosyn = 0;
2948 newvar->varattnosyn = 0;
3003 Index acceptable_rel,
3010 context.
root = root;
3040 return (
Node *) newvar;
3052 return (
Node *) newvar;
3060 if (var->varnosyn > 0)
3061 var->varnosyn += context->
rtoffset;
3062 return (
Node *) var;
3066 elog(
ERROR,
"variable not found in subplan target lists");
3080 return (
Node *) newvar;
3089 return (
Node *) newvar;
3103 return (
Node *) newvar;
3111 return (
Node *) newvar;
3170 context.
root = root;
3196 elog(
ERROR,
"variable not found in subplan target list");
3197 return (
Node *) newvar;
3211 return (
Node *) newvar;
3224 return (
Node *) newvar;
3236 if (aggparam != NULL)
3286 Index resultRelation,
3341 return (
Node *) newvar;
3342 elog(
ERROR,
"WindowFunc not found in subplan target lists");
3363 context.
root = root;
3419 return mminfo->
param;
3520 List **relationOids,
3522 bool *hasRowSecurity)
3528 MemSet(&glob, 0,
sizeof(glob));
3529 glob.type = T_PlannerGlobal;
3535 MemSet(&root, 0,
sizeof(root));
3536 root.type = T_PlannerInfo;
3577 if (query->hasRowSecurity)
3581 foreach(lc, query->
rtable)
3594 (
void *) context, 0);
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 FLEXIBLE_ARRAY_MEMBER
#define MemSet(start, val, len)
#define OidIsValid(objectId)
elog(ERROR, "%s: %s", p2, msg)
bool equal(const void *a, const void *b)
if(TABLE==NULL||TABLE_index==NULL)
Assert(fmt[strlen(fmt) - 1] !='\n')
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)
static void * list_nth(const List *list, int n)
#define foreach_current_index(cell)
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
bool hasAlternativeSubPlans
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)