setrefs.c File Reference

#include "postgres.h"
#include "access/transam.h"
#include "catalog/pg_type.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/optimizer.h"
#include "optimizer/pathnode.h"
#include "optimizer/planmain.h"
#include "optimizer/planner.h"
#include "optimizer/subselect.h"
#include "optimizer/tlist.h"
#include "parser/parse_relation.h"
#include "rewrite/rewriteManip.h"
#include "tcop/utility.h"
#include "utils/syscache.h"

Include dependency graph for setrefs.c:

Go to the source code of this file.

Data Structures
struct	tlist_vinfo
struct	indexed_tlist
struct	fix_scan_expr_context
struct	fix_join_expr_context
struct	fix_upper_expr_context
struct	fix_windowagg_cond_context
struct	flatten_rtes_walker_context

Macros
#define	NUM_EXEC_TLIST(parentplan)   ((parentplan)->plan_rows)
#define	NUM_EXEC_QUAL(parentplan)   ((parentplan)->plan_rows * 2.0)
#define	ISREGCLASSCONST(con)
#define	fix_scan_list(root, lst, rtoffset, num_exec)    ((List *) fix_scan_expr(root, (Node *) (lst), rtoffset, num_exec))

Enumerations
enum	NullingRelsMatch { NRM_EQUAL , NRM_SUBSET , NRM_SUPERSET }

Functions
static void	add_rtes_to_flat_rtable (PlannerInfo *root, bool recursing)
static void	flatten_unplanned_rtes (PlannerGlobal *glob, RangeTblEntry *rte)
static bool	flatten_rtes_walker (Node *node, flatten_rtes_walker_context *cxt)
static void	add_rte_to_flat_rtable (PlannerGlobal *glob, List *rteperminfos, RangeTblEntry *rte)
static Plan *	set_plan_refs (PlannerInfo *root, Plan *plan, int rtoffset)
static Plan *	set_indexonlyscan_references (PlannerInfo *root, IndexOnlyScan *plan, int rtoffset)
static Plan *	set_subqueryscan_references (PlannerInfo *root, SubqueryScan *plan, int rtoffset)
static Plan *	clean_up_removed_plan_level (Plan *parent, Plan *child)
static void	set_foreignscan_references (PlannerInfo *root, ForeignScan *fscan, int rtoffset)
static void	set_customscan_references (PlannerInfo *root, CustomScan *cscan, int rtoffset)
static Plan *	set_append_references (PlannerInfo *root, Append *aplan, int rtoffset)
static Plan *	set_mergeappend_references (PlannerInfo *root, MergeAppend *mplan, int rtoffset)
static void	set_hash_references (PlannerInfo *root, Plan *plan, int rtoffset)
static Relids	offset_relid_set (Relids relids, int rtoffset)
static Node *	fix_scan_expr (PlannerInfo *root, Node *node, int rtoffset, double num_exec)
static Node *	fix_scan_expr_mutator (Node *node, fix_scan_expr_context *context)
static bool	fix_scan_expr_walker (Node *node, fix_scan_expr_context *context)
static void	set_join_references (PlannerInfo *root, Join *join, int rtoffset)
static void	set_upper_references (PlannerInfo *root, Plan *plan, int rtoffset)
static void	set_param_references (PlannerInfo *root, Plan *plan)
static Node *	convert_combining_aggrefs (Node *node, void *context)
static void	set_dummy_tlist_references (Plan *plan, int rtoffset)
static indexed_tlist *	build_tlist_index (List *tlist)
static Var *	search_indexed_tlist_for_var (Var *var, indexed_tlist *itlist, int newvarno, int rtoffset, NullingRelsMatch nrm_match)
static Var *	search_indexed_tlist_for_phv (PlaceHolderVar *phv, indexed_tlist *itlist, int newvarno, NullingRelsMatch nrm_match)
static Var *	search_indexed_tlist_for_non_var (Expr *node, indexed_tlist *itlist, int newvarno)
static Var *	search_indexed_tlist_for_sortgroupref (Expr *node, Index sortgroupref, indexed_tlist *itlist, int newvarno)
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 *	fix_join_expr_mutator (Node *node, fix_join_expr_context *context)
static Node *	fix_upper_expr (PlannerInfo *root, Node *node, indexed_tlist *subplan_itlist, int newvarno, int rtoffset, NullingRelsMatch nrm_match, double num_exec)
static Node *	fix_upper_expr_mutator (Node *node, fix_upper_expr_context *context)
static List *	set_returning_clause_references (PlannerInfo *root, List *rlist, Plan *topplan, Index resultRelation, int rtoffset)
static List *	set_windowagg_runcondition_references (PlannerInfo *root, List *runcondition, Plan *plan)
Plan *	set_plan_references (PlannerInfo *root, Plan *plan)
bool	trivial_subqueryscan (SubqueryScan *plan)
static int	register_partpruneinfo (PlannerInfo *root, int part_prune_index, int rtoffset)
static Var *	copyVar (Var *var)
static void	fix_expr_common (PlannerInfo *root, Node *node)
static Node *	fix_param_node (PlannerInfo *root, Param *p)
static Node *	fix_alternative_subplan (PlannerInfo *root, AlternativeSubPlan *asplan, double num_exec)
static indexed_tlist *	build_tlist_index_other_vars (List *tlist, int ignore_rel)
static Node *	fix_windowagg_condition_expr_mutator (Node *node, fix_windowagg_cond_context *context)
static List *	fix_windowagg_condition_expr (PlannerInfo *root, List *runcondition, indexed_tlist *subplan_itlist)
Param *	find_minmax_agg_replacement_param (PlannerInfo *root, Aggref *aggref)
void	record_plan_function_dependency (PlannerInfo *root, Oid funcid)
void	record_plan_type_dependency (PlannerInfo *root, Oid typid)
void	extract_query_dependencies (Node *query, List **relationOids, List **invalItems, bool *hasRowSecurity)
bool	extract_query_dependencies_walker (Node *node, PlannerInfo *context)

Macro Definition Documentation

fix_scan_list

#define fix_scan_list	(		root,
			lst,
			rtoffset,
			num_exec
	)		((List *) fix_scan_expr(root, (Node *) (lst), rtoffset, num_exec))

Definition at line 130 of file setrefs.c.

ISREGCLASSCONST

#define ISREGCLASSCONST

(

con

)

Value:

    (((con)->consttype == REGCLASSOID || (con)->consttype == OIDOID) && \
     !(con)->constisnull)

Definition at line 126 of file setrefs.c.

NUM_EXEC_QUAL

#define NUM_EXEC_QUAL

(

parentplan

)

((parentplan)->plan_rows * 2.0)

Definition at line 117 of file setrefs.c.

NUM_EXEC_TLIST

#define NUM_EXEC_TLIST

(

parentplan

)

((parentplan)->plan_rows)

Definition at line 116 of file setrefs.c.

Enumeration Type Documentation

NullingRelsMatch

enum NullingRelsMatch

Enumerator
NRM_EQUAL
NRM_SUBSET
NRM_SUPERSET

Definition at line 34 of file setrefs.c.

{
    NRM_EQUAL,                  /* expect exact match of nullingrels */
    NRM_SUBSET,                 /* actual Var may have a subset of input */
    NRM_SUPERSET,               /* actual Var may have a superset of input */
} NullingRelsMatch;

Function Documentation

add_rte_to_flat_rtable()

static void add_rte_to_flat_rtable ( PlannerGlobal *  glob, List *  rteperminfos, RangeTblEntry *  rte  )

static

Definition at line 538 of file setrefs.c.

{
    RangeTblEntry *newrte;
 
    /* flat copy to duplicate all the scalar fields */
    newrte = (RangeTblEntry *) palloc(sizeof(RangeTblEntry));
    memcpy(newrte, rte, sizeof(RangeTblEntry));
 
    /* zap unneeded sub-structure */
    newrte->tablesample = NULL;
    newrte->subquery = NULL;
    newrte->joinaliasvars = NIL;
    newrte->joinleftcols = NIL;
    newrte->joinrightcols = NIL;
    newrte->join_using_alias = NULL;
    newrte->functions = NIL;
    newrte->tablefunc = NULL;
    newrte->values_lists = NIL;
    newrte->coltypes = NIL;
    newrte->coltypmods = NIL;
    newrte->colcollations = NIL;
    newrte->groupexprs = NIL;
    newrte->securityQuals = NIL;
 
    glob->finalrtable = lappend(glob->finalrtable, newrte);
 
    /*
     * If it's a plain relation RTE (or a subquery that was once a view
     * reference), add the relation OID to relationOids.  Also add its new RT
     * index to the set of relations to be potentially accessed during
     * execution.
     *
     * We do this even though the RTE might be unreferenced in the plan tree;
     * this would correspond to cases such as views that were expanded, child
     * tables that were eliminated by constraint exclusion, etc. Schema
     * invalidation on such a rel must still force rebuilding of the plan.
     *
     * Note we don't bother to avoid making duplicate list entries.  We could,
     * but it would probably cost more cycles than it would save.
     */
    if (newrte->rtekind == RTE_RELATION ||
        (newrte->rtekind == RTE_SUBQUERY && OidIsValid(newrte->relid)))
    {
        glob->relationOids = lappend_oid(glob->relationOids, newrte->relid);
        glob->allRelids = bms_add_member(glob->allRelids,
                                         list_length(glob->finalrtable));
    }
 
    /*
     * Add a copy of the RTEPermissionInfo, if any, corresponding to this RTE
     * to the flattened global list.
     */
    if (rte->perminfoindex > 0)
    {
        RTEPermissionInfo *perminfo;
        RTEPermissionInfo *newperminfo;
 
        /* Get the existing one from this query's rteperminfos. */
        perminfo = getRTEPermissionInfo(rteperminfos, newrte);
 
        /*
         * Add a new one to finalrteperminfos and copy the contents of the
         * existing one into it.  Note that addRTEPermissionInfo() also
         * updates newrte->perminfoindex to point to newperminfo in
         * finalrteperminfos.
         */
        newrte->perminfoindex = 0;  /* expected by addRTEPermissionInfo() */
        newperminfo = addRTEPermissionInfo(&glob->finalrteperminfos, newrte);
        memcpy(newperminfo, perminfo, sizeof(RTEPermissionInfo));
    }
}

References addRTEPermissionInfo(), PlannerGlobal::allRelids, bms_add_member(), PlannerGlobal::finalrtable, PlannerGlobal::finalrteperminfos, RangeTblEntry::functions, getRTEPermissionInfo(), lappend(), lappend_oid(), list_length(), NIL, OidIsValid, palloc(), PlannerGlobal::relationOids, RTE_RELATION, RTE_SUBQUERY, RangeTblEntry::rtekind, RangeTblEntry::subquery, RangeTblEntry::tablefunc, RangeTblEntry::tablesample, and RangeTblEntry::values_lists.

Referenced by add_rtes_to_flat_rtable(), and flatten_rtes_walker().

add_rtes_to_flat_rtable()

static void add_rtes_to_flat_rtable ( PlannerInfo *  root, bool  recursing  )

static

Definition at line 392 of file setrefs.c.

{
    PlannerGlobal *glob = root->glob;
    Index       rti;
    ListCell   *lc;
 
    /*
     * Add the query's own RTEs to the flattened rangetable.
     *
     * At top level, we must add all RTEs so that their indexes in the
     * flattened rangetable match up with their original indexes.  When
     * recursing, we only care about extracting relation RTEs (and subquery
     * RTEs that were once relation RTEs).
     */
    foreach(lc, root->parse->rtable)
    {
        RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
 
        if (!recursing || rte->rtekind == RTE_RELATION ||
            (rte->rtekind == RTE_SUBQUERY && OidIsValid(rte->relid)))
            add_rte_to_flat_rtable(glob, root->parse->rteperminfos, rte);
    }
 
    /*
     * If there are any dead subqueries, they are not referenced in the Plan
     * tree, so we must add RTEs contained in them to the flattened rtable
     * separately.  (If we failed to do this, the executor would not perform
     * expected permission checks for tables mentioned in such subqueries.)
     *
     * Note: this pass over the rangetable can't be combined with the previous
     * one, because that would mess up the numbering of the live RTEs in the
     * flattened rangetable.
     */
    rti = 1;
    foreach(lc, root->parse->rtable)
    {
        RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
 
        /*
         * We should ignore inheritance-parent RTEs: their contents have been
         * pulled up into our rangetable already.  Also ignore any subquery
         * RTEs without matching RelOptInfos, as they likewise have been
         * pulled up.
         */
        if (rte->rtekind == RTE_SUBQUERY && !rte->inh &&
            rti < root->simple_rel_array_size)
        {
            RelOptInfo *rel = root->simple_rel_array[rti];
 
            if (rel != NULL)
            {
                Assert(rel->relid == rti);  /* sanity check on array */
 
                /*
                 * The subquery might never have been planned at all, if it
                 * was excluded on the basis of self-contradictory constraints
                 * in our query level.  In this case apply
                 * flatten_unplanned_rtes.
                 *
                 * If it was planned but the result rel is dummy, we assume
                 * that it has been omitted from our plan tree (see
                 * set_subquery_pathlist), and recurse to pull up its RTEs.
                 *
                 * Otherwise, it should be represented by a SubqueryScan node
                 * somewhere in our plan tree, and we'll pull up its RTEs when
                 * we process that plan node.
                 *
                 * However, if we're recursing, then we should pull up RTEs
                 * whether the subquery is dummy or not, because we've found
                 * that some upper query level is treating this one as dummy,
                 * and so we won't scan this level's plan tree at all.
                 */
                if (rel->subroot == NULL)
                    flatten_unplanned_rtes(glob, rte);
                else if (recursing ||
                         IS_DUMMY_REL(fetch_upper_rel(rel->subroot,
                                                      UPPERREL_FINAL, NULL)))
                    add_rtes_to_flat_rtable(rel->subroot, true);
            }
        }
        rti++;
    }
}

References add_rte_to_flat_rtable(), add_rtes_to_flat_rtable(), Assert(), fetch_upper_rel(), flatten_unplanned_rtes(), RangeTblEntry::inh, IS_DUMMY_REL, lfirst, OidIsValid, RelOptInfo::relid, root, RTE_RELATION, RTE_SUBQUERY, RangeTblEntry::rtekind, RelOptInfo::subroot, and UPPERREL_FINAL.

Referenced by add_rtes_to_flat_rtable(), and set_plan_references().

build_tlist_index()

static indexed_tlist * build_tlist_index ( List *  tlist )

static

Definition at line 2754 of file setrefs.c.

{
    indexed_tlist *itlist;
    tlist_vinfo *vinfo;
    ListCell   *l;
 
    /* Create data structure with enough slots for all tlist entries */
    itlist = (indexed_tlist *)
        palloc(offsetof(indexed_tlist, vars) +
               list_length(tlist) * sizeof(tlist_vinfo));
 
    itlist->tlist = tlist;
    itlist->has_ph_vars = false;
    itlist->has_non_vars = false;
 
    /* Find the Vars and fill in the index array */
    vinfo = itlist->vars;
    foreach(l, tlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(l);
 
        if (tle->expr && IsA(tle->expr, Var))
        {
            Var        *var = (Var *) tle->expr;
 
            vinfo->varno = var->varno;
            vinfo->varattno = var->varattno;
            vinfo->resno = tle->resno;
            vinfo->varnullingrels = var->varnullingrels;
            vinfo++;
        }
        else if (tle->expr && IsA(tle->expr, PlaceHolderVar))
            itlist->has_ph_vars = true;
        else
            itlist->has_non_vars = true;
    }
 
    itlist->num_vars = (vinfo - itlist->vars);
 
    return itlist;
}

References TargetEntry::expr, indexed_tlist::has_non_vars, indexed_tlist::has_ph_vars, IsA, lfirst, list_length(), indexed_tlist::num_vars, palloc(), tlist_vinfo::resno, TargetEntry::resno, indexed_tlist::tlist, tlist_vinfo::varattno, Var::varattno, tlist_vinfo::varno, Var::varno, tlist_vinfo::varnullingrels, and indexed_tlist::vars.

Referenced by set_customscan_references(), set_foreignscan_references(), set_hash_references(), set_indexonlyscan_references(), set_join_references(), set_plan_refs(), set_upper_references(), and set_windowagg_runcondition_references().

build_tlist_index_other_vars()

static indexed_tlist * build_tlist_index_other_vars ( List *  tlist, int  ignore_rel  )

static

Definition at line 2805 of file setrefs.c.

{
    indexed_tlist *itlist;
    tlist_vinfo *vinfo;
    ListCell   *l;
 
    /* Create data structure with enough slots for all tlist entries */
    itlist = (indexed_tlist *)
        palloc(offsetof(indexed_tlist, vars) +
               list_length(tlist) * sizeof(tlist_vinfo));
 
    itlist->tlist = tlist;
    itlist->has_ph_vars = false;
    itlist->has_non_vars = false;
 
    /* Find the desired Vars and fill in the index array */
    vinfo = itlist->vars;
    foreach(l, tlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(l);
 
        if (tle->expr && IsA(tle->expr, Var))
        {
            Var        *var = (Var *) tle->expr;
 
            if (var->varno != ignore_rel)
            {
                vinfo->varno = var->varno;
                vinfo->varattno = var->varattno;
                vinfo->resno = tle->resno;
                vinfo->varnullingrels = var->varnullingrels;
                vinfo++;
            }
        }
        else if (tle->expr && IsA(tle->expr, PlaceHolderVar))
            itlist->has_ph_vars = true;
    }
 
    itlist->num_vars = (vinfo - itlist->vars);
 
    return itlist;
}

References TargetEntry::expr, indexed_tlist::has_non_vars, indexed_tlist::has_ph_vars, if(), IsA, lfirst, list_length(), indexed_tlist::num_vars, palloc(), tlist_vinfo::resno, TargetEntry::resno, indexed_tlist::tlist, tlist_vinfo::varattno, Var::varattno, tlist_vinfo::varno, Var::varno, tlist_vinfo::varnullingrels, and indexed_tlist::vars.

Referenced by set_returning_clause_references().

clean_up_removed_plan_level()

static Plan * clean_up_removed_plan_level ( Plan *  parent, Plan *  child  )

static

Definition at line 1541 of file setrefs.c.

{
    /*
     * We have to be sure we don't lose any initplans, so move any that were
     * attached to the parent plan to the child.  If any are parallel-unsafe,
     * the child is no longer parallel-safe.  As a cosmetic matter, also add
     * the initplans' run costs to the child's costs.
     */
    if (parent->initPlan)
    {
        Cost        initplan_cost;
        bool        unsafe_initplans;
 
        SS_compute_initplan_cost(parent->initPlan,
                                 &initplan_cost, &unsafe_initplans);
        child->startup_cost += initplan_cost;
        child->total_cost += initplan_cost;
        if (unsafe_initplans)
            child->parallel_safe = false;
 
        /*
         * Attach plans this way so that parent's initplans are processed
         * before any pre-existing initplans of the child.  Probably doesn't
         * matter, but let's preserve the ordering just in case.
         */
        child->initPlan = list_concat(parent->initPlan,
                                      child->initPlan);
    }
 
    /*
     * We also have to transfer the parent's column labeling info into the
     * child, else columns sent to client will be improperly labeled if this
     * is the topmost plan level.  resjunk and so on may be important too.
     */
    apply_tlist_labeling(child->targetlist, parent->targetlist);
 
    return child;
}

References apply_tlist_labeling(), Plan::initPlan, list_concat(), Plan::parallel_safe, SS_compute_initplan_cost(), Plan::startup_cost, Plan::targetlist, and Plan::total_cost.

Referenced by set_append_references(), set_mergeappend_references(), and set_subqueryscan_references().

convert_combining_aggrefs()

static Node * convert_combining_aggrefs ( Node *  node, void *  context  )

static

Definition at line 2619 of file setrefs.c.

{
    if (node == NULL)
        return NULL;
    if (IsA(node, Aggref))
    {
        Aggref     *orig_agg = (Aggref *) node;
        Aggref     *child_agg;
        Aggref     *parent_agg;
 
        /* Assert we've not chosen to partial-ize any unsupported cases */
        Assert(orig_agg->aggorder == NIL);
        Assert(orig_agg->aggdistinct == NIL);
 
        /*
         * Since aggregate calls can't be nested, we needn't recurse into the
         * arguments.  But for safety, flat-copy the Aggref node itself rather
         * than modifying it in-place.
         */
        child_agg = makeNode(Aggref);
        memcpy(child_agg, orig_agg, sizeof(Aggref));
 
        /*
         * For the parent Aggref, we want to copy all the fields of the
         * original aggregate *except* the args list, which we'll replace
         * below, and the aggfilter expression, which should be applied only
         * by the child not the parent.  Rather than explicitly knowing about
         * all the other fields here, we can momentarily modify child_agg to
         * provide a suitable source for copyObject.
         */
        child_agg->args = NIL;
        child_agg->aggfilter = NULL;
        parent_agg = copyObject(child_agg);
        child_agg->args = orig_agg->args;
        child_agg->aggfilter = orig_agg->aggfilter;
 
        /*
         * Now, set up child_agg to represent the first phase of partial
         * aggregation.  For now, assume serialization is required.
         */
        mark_partial_aggref(child_agg, AGGSPLIT_INITIAL_SERIAL);
 
        /*
         * And set up parent_agg to represent the second phase.
         */
        parent_agg->args = list_make1(makeTargetEntry((Expr *) child_agg,
                                                      1, NULL, false));
        mark_partial_aggref(parent_agg, AGGSPLIT_FINAL_DESERIAL);
 
        return (Node *) parent_agg;
    }
    return expression_tree_mutator(node, convert_combining_aggrefs, context);
}

References Aggref::aggdistinct, Aggref::aggfilter, Aggref::aggorder, AGGSPLIT_FINAL_DESERIAL, AGGSPLIT_INITIAL_SERIAL, Aggref::args, Assert(), convert_combining_aggrefs(), copyObject, expression_tree_mutator, IsA, list_make1, makeNode, makeTargetEntry(), mark_partial_aggref(), and NIL.

Referenced by convert_combining_aggrefs(), and set_plan_refs().

copyVar()

static Var * copyVar ( Var *  var )

inlinestatic

Definition at line 2003 of file setrefs.c.

{
    Var        *newvar = (Var *) palloc(sizeof(Var));
 
    *newvar = *var;
    return newvar;
}

References palloc().

Referenced by fix_join_expr_mutator(), fix_scan_expr_mutator(), and search_indexed_tlist_for_var().

extract_query_dependencies()

void extract_query_dependencies	(	Node *	query,
		List **	relationOids,
		List **	invalItems,
		bool *	hasRowSecurity
	)

Definition at line 3630 of file setrefs.c.

{
    PlannerGlobal glob;
    PlannerInfo root;
 
    /* Make up dummy planner state so we can use this module's machinery */
    MemSet(&glob, 0, sizeof(glob));
    glob.type = T_PlannerGlobal;
    glob.relationOids = NIL;
    glob.invalItems = NIL;
    /* Hack: we use glob.dependsOnRole to collect hasRowSecurity flags */
    glob.dependsOnRole = false;
 
    MemSet(&root, 0, sizeof(root));
    root.type = T_PlannerInfo;
    root.glob = &glob;
 
    (void) extract_query_dependencies_walker(query, &root);
 
    *relationOids = glob.relationOids;
    *invalItems = glob.invalItems;
    *hasRowSecurity = glob.dependsOnRole;
}

References PlannerGlobal::dependsOnRole, extract_query_dependencies_walker(), PlannerGlobal::invalItems, MemSet, NIL, PlannerGlobal::relationOids, and root.

Referenced by CompleteCachedPlan(), and RevalidateCachedQuery().

extract_query_dependencies_walker()

bool extract_query_dependencies_walker	(	Node *	node,
		PlannerInfo *	context
	)

Definition at line 3666 of file setrefs.c.

{
    if (node == NULL)
        return false;
    Assert(!IsA(node, PlaceHolderVar));
    if (IsA(node, Query))
    {
        Query      *query = (Query *) node;
        ListCell   *lc;
 
        if (query->commandType == CMD_UTILITY)
        {
            /*
             * This logic must handle any utility command for which parse
             * analysis was nontrivial (cf. stmt_requires_parse_analysis).
             *
             * Notably, CALL requires its own processing.
             */
            if (IsA(query->utilityStmt, CallStmt))
            {
                CallStmt   *callstmt = (CallStmt *) query->utilityStmt;
 
                /* We need not examine funccall, just the transformed exprs */
                (void) extract_query_dependencies_walker((Node *) callstmt->funcexpr,
                                                         context);
                (void) extract_query_dependencies_walker((Node *) callstmt->outargs,
                                                         context);
                return false;
            }
 
            /*
             * Ignore other utility statements, except those (such as EXPLAIN)
             * that contain a parsed-but-not-planned query.  For those, we
             * just need to transfer our attention to the contained query.
             */
            query = UtilityContainsQuery(query->utilityStmt);
            if (query == NULL)
                return false;
        }
 
        /* Remember if any Query has RLS quals applied by rewriter */
        if (query->hasRowSecurity)
            context->glob->dependsOnRole = true;
 
        /* Collect relation OIDs in this Query's rtable */
        foreach(lc, query->rtable)
        {
            RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
 
            if (rte->rtekind == RTE_RELATION ||
                (rte->rtekind == RTE_SUBQUERY && OidIsValid(rte->relid)) ||
                (rte->rtekind == RTE_NAMEDTUPLESTORE && OidIsValid(rte->relid)))
                context->glob->relationOids =
                    lappend_oid(context->glob->relationOids, rte->relid);
        }
 
        /* And recurse into the query's subexpressions */
        return query_tree_walker(query, extract_query_dependencies_walker,
                                 context, 0);
    }
    /* Extract function dependencies and check for regclass Consts */
    fix_expr_common(context, node);
    return expression_tree_walker(node, extract_query_dependencies_walker,
                                  context);
}

References Assert(), CMD_UTILITY, Query::commandType, PlannerGlobal::dependsOnRole, expression_tree_walker, extract_query_dependencies_walker(), fix_expr_common(), CallStmt::funcexpr, PlannerInfo::glob, IsA, lappend_oid(), lfirst, OidIsValid, CallStmt::outargs, query_tree_walker, PlannerGlobal::relationOids, Query::rtable, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_SUBQUERY, RangeTblEntry::rtekind, UtilityContainsQuery(), and Query::utilityStmt.

Referenced by expression_planner_with_deps(), extract_query_dependencies(), and extract_query_dependencies_walker().

find_minmax_agg_replacement_param()

Param * find_minmax_agg_replacement_param	(	PlannerInfo *	root,
		Aggref *	aggref
	)

Definition at line 3516 of file setrefs.c.

{
    if (root->minmax_aggs != NIL &&
        list_length(aggref->args) == 1)
    {
        TargetEntry *curTarget = (TargetEntry *) linitial(aggref->args);
        ListCell   *lc;
 
        foreach(lc, root->minmax_aggs)
        {
            MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);
 
            if (mminfo->aggfnoid == aggref->aggfnoid &&
                equal(mminfo->target, curTarget->expr))
                return mminfo->param;
        }
    }
    return NULL;
}

References MinMaxAggInfo::aggfnoid, Aggref::aggfnoid, Aggref::args, equal(), TargetEntry::expr, lfirst, linitial, list_length(), NIL, MinMaxAggInfo::param, root, and MinMaxAggInfo::target.

Referenced by finalize_primnode(), fix_scan_expr_mutator(), and fix_upper_expr_mutator().

fix_alternative_subplan()

static Node * fix_alternative_subplan ( PlannerInfo *  root, AlternativeSubPlan *  asplan, double  num_exec  )

static

Definition at line 2151 of file setrefs.c.

{
    SubPlan    *bestplan = NULL;
    Cost        bestcost = 0;
    ListCell   *lc;
 
    /*
     * Compute the estimated cost of each subplan assuming num_exec
     * executions, and keep the cheapest one.  In event of exact equality of
     * estimates, we prefer the later plan; this is a bit arbitrary, but in
     * current usage it biases us to break ties against fast-start subplans.
     */
    Assert(asplan->subplans != NIL);
 
    foreach(lc, asplan->subplans)
    {
        SubPlan    *curplan = (SubPlan *) lfirst(lc);
        Cost        curcost;
 
        curcost = curplan->startup_cost + num_exec * curplan->per_call_cost;
        if (bestplan == NULL || curcost <= bestcost)
        {
            bestplan = curplan;
            bestcost = curcost;
        }
 
        /* Also mark all subplans that are in AlternativeSubPlans */
        root->isAltSubplan[curplan->plan_id - 1] = true;
    }
 
    /* Mark the subplan we selected */
    root->isUsedSubplan[bestplan->plan_id - 1] = true;
 
    return (Node *) bestplan;
}

References Assert(), lfirst, NIL, SubPlan::per_call_cost, SubPlan::plan_id, root, SubPlan::startup_cost, and AlternativeSubPlan::subplans.

Referenced by fix_join_expr_mutator(), fix_scan_expr_mutator(), and fix_upper_expr_mutator().

fix_expr_common()

static void fix_expr_common ( PlannerInfo *  root, Node *  node  )

static

Definition at line 2025 of file setrefs.c.

{
    /* We assume callers won't call us on a NULL pointer */
    if (IsA(node, Aggref))
    {
        record_plan_function_dependency(root,
                                        ((Aggref *) node)->aggfnoid);
    }
    else if (IsA(node, WindowFunc))
    {
        record_plan_function_dependency(root,
                                        ((WindowFunc *) node)->winfnoid);
    }
    else if (IsA(node, FuncExpr))
    {
        record_plan_function_dependency(root,
                                        ((FuncExpr *) node)->funcid);
    }
    else if (IsA(node, OpExpr))
    {
        set_opfuncid((OpExpr *) node);
        record_plan_function_dependency(root,
                                        ((OpExpr *) node)->opfuncid);
    }
    else if (IsA(node, DistinctExpr))
    {
        set_opfuncid((OpExpr *) node);  /* rely on struct equivalence */
        record_plan_function_dependency(root,
                                        ((DistinctExpr *) node)->opfuncid);
    }
    else if (IsA(node, NullIfExpr))
    {
        set_opfuncid((OpExpr *) node);  /* rely on struct equivalence */
        record_plan_function_dependency(root,
                                        ((NullIfExpr *) node)->opfuncid);
    }
    else if (IsA(node, ScalarArrayOpExpr))
    {
        ScalarArrayOpExpr *saop = (ScalarArrayOpExpr *) node;
 
        set_sa_opfuncid(saop);
        record_plan_function_dependency(root, saop->opfuncid);
 
        if (OidIsValid(saop->hashfuncid))
            record_plan_function_dependency(root, saop->hashfuncid);
 
        if (OidIsValid(saop->negfuncid))
            record_plan_function_dependency(root, saop->negfuncid);
    }
    else if (IsA(node, Const))
    {
        Const      *con = (Const *) node;
 
        /* Check for regclass reference */
        if (ISREGCLASSCONST(con))
            root->glob->relationOids =
                lappend_oid(root->glob->relationOids,
                            DatumGetObjectId(con->constvalue));
    }
    else if (IsA(node, GroupingFunc))
    {
        GroupingFunc *g = (GroupingFunc *) node;
        AttrNumber *grouping_map = root->grouping_map;
 
        /* If there are no grouping sets, we don't need this. */
 
        Assert(grouping_map || g->cols == NIL);
 
        if (grouping_map)
        {
            ListCell   *lc;
            List       *cols = NIL;
 
            foreach(lc, g->refs)
            {
                cols = lappend_int(cols, grouping_map[lfirst_int(lc)]);
            }
 
            Assert(!g->cols || equal(cols, g->cols));
 
            if (!g->cols)
                g->cols = cols;
        }
    }
}

References Assert(), DatumGetObjectId(), equal(), IsA, ISREGCLASSCONST, lappend_int(), lappend_oid(), lfirst_int, NIL, OidIsValid, record_plan_function_dependency(), root, set_opfuncid(), and set_sa_opfuncid().

Referenced by extract_query_dependencies_walker(), fix_join_expr_mutator(), fix_scan_expr_mutator(), fix_scan_expr_walker(), and fix_upper_expr_mutator().

fix_join_expr()

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

Definition at line 3099 of file setrefs.c.

{
    fix_join_expr_context context;
 
    context.root = root;
    context.outer_itlist = outer_itlist;
    context.inner_itlist = inner_itlist;
    context.acceptable_rel = acceptable_rel;
    context.rtoffset = rtoffset;
    context.nrm_match = nrm_match;
    context.num_exec = num_exec;
    return (List *) fix_join_expr_mutator((Node *) clauses, &context);
}

References fix_join_expr_context::acceptable_rel, fix_join_expr_mutator(), fix_join_expr_context::inner_itlist, fix_join_expr_context::nrm_match, fix_join_expr_context::num_exec, fix_join_expr_context::outer_itlist, fix_join_expr_context::root, root, and fix_join_expr_context::rtoffset.

Referenced by set_join_references(), set_plan_refs(), and set_returning_clause_references().

fix_join_expr_mutator()

static Node * fix_join_expr_mutator ( Node *  node, fix_join_expr_context *  context  )

static

Definition at line 3121 of file setrefs.c.

{
    Var        *newvar;
 
    if (node == NULL)
        return NULL;
    if (IsA(node, Var))
    {
        Var        *var = (Var *) node;
 
        /*
         * Verify that Vars with non-default varreturningtype only appear in
         * the RETURNING list, and refer to the target relation.
         */
        if (var->varreturningtype != VAR_RETURNING_DEFAULT)
        {
            if (context->inner_itlist != NULL ||
                context->outer_itlist == NULL ||
                context->acceptable_rel == 0)
                elog(ERROR, "variable returning old/new found outside RETURNING list");
            if (var->varno != context->acceptable_rel)
                elog(ERROR, "wrong varno %d (expected %d) for variable returning old/new",
                     var->varno, context->acceptable_rel);
        }
 
        /* Look for the var in the input tlists, first in the outer */
        if (context->outer_itlist)
        {
            newvar = search_indexed_tlist_for_var(var,
                                                  context->outer_itlist,
                                                  OUTER_VAR,
                                                  context->rtoffset,
                                                  context->nrm_match);
            if (newvar)
                return (Node *) newvar;
        }
 
        /* then in the inner. */
        if (context->inner_itlist)
        {
            newvar = search_indexed_tlist_for_var(var,
                                                  context->inner_itlist,
                                                  INNER_VAR,
                                                  context->rtoffset,
                                                  context->nrm_match);
            if (newvar)
                return (Node *) newvar;
        }
 
        /* If it's for acceptable_rel, adjust and return it */
        if (var->varno == context->acceptable_rel)
        {
            var = copyVar(var);
            var->varno += context->rtoffset;
            if (var->varnosyn > 0)
                var->varnosyn += context->rtoffset;
            return (Node *) var;
        }
 
        /* No referent found for Var */
        elog(ERROR, "variable not found in subplan target lists");
    }
    if (IsA(node, PlaceHolderVar))
    {
        PlaceHolderVar *phv = (PlaceHolderVar *) node;
 
        /* See if the PlaceHolderVar has bubbled up from a lower plan node */
        if (context->outer_itlist && context->outer_itlist->has_ph_vars)
        {
            newvar = search_indexed_tlist_for_phv(phv,
                                                  context->outer_itlist,
                                                  OUTER_VAR,
                                                  context->nrm_match);
            if (newvar)
                return (Node *) newvar;
        }
        if (context->inner_itlist && context->inner_itlist->has_ph_vars)
        {
            newvar = search_indexed_tlist_for_phv(phv,
                                                  context->inner_itlist,
                                                  INNER_VAR,
                                                  context->nrm_match);
            if (newvar)
                return (Node *) newvar;
        }
 
        /* If not supplied by input plans, evaluate the contained expr */
        /* XXX can we assert something about phnullingrels? */
        return fix_join_expr_mutator((Node *) phv->phexpr, context);
    }
    /* Try matching more complex expressions too, if tlists have any */
    if (context->outer_itlist && context->outer_itlist->has_non_vars)
    {
        newvar = search_indexed_tlist_for_non_var((Expr *) node,
                                                  context->outer_itlist,
                                                  OUTER_VAR);
        if (newvar)
            return (Node *) newvar;
    }
    if (context->inner_itlist && context->inner_itlist->has_non_vars)
    {
        newvar = search_indexed_tlist_for_non_var((Expr *) node,
                                                  context->inner_itlist,
                                                  INNER_VAR);
        if (newvar)
            return (Node *) newvar;
    }
    /* Special cases (apply only AFTER failing to match to lower tlist) */
    if (IsA(node, Param))
        return fix_param_node(context->root, (Param *) node);
    if (IsA(node, AlternativeSubPlan))
        return fix_join_expr_mutator(fix_alternative_subplan(context->root,
                                                             (AlternativeSubPlan *) node,
                                                             context->num_exec),
                                     context);
    fix_expr_common(context->root, node);
    return expression_tree_mutator(node, fix_join_expr_mutator, context);
}

References fix_join_expr_context::acceptable_rel, copyVar(), elog, ERROR, expression_tree_mutator, fix_alternative_subplan(), fix_expr_common(), fix_join_expr_mutator(), fix_param_node(), indexed_tlist::has_non_vars, indexed_tlist::has_ph_vars, fix_join_expr_context::inner_itlist, INNER_VAR, IsA, fix_join_expr_context::nrm_match, fix_join_expr_context::num_exec, fix_join_expr_context::outer_itlist, OUTER_VAR, fix_join_expr_context::root, fix_join_expr_context::rtoffset, search_indexed_tlist_for_non_var(), search_indexed_tlist_for_phv(), search_indexed_tlist_for_var(), VAR_RETURNING_DEFAULT, Var::varno, and Var::varreturningtype.

Referenced by fix_join_expr(), and fix_join_expr_mutator().

fix_param_node()

static Node * fix_param_node ( PlannerInfo *  root, Param *  p  )

static

Definition at line 2120 of file setrefs.c.

{
    if (p->paramkind == PARAM_MULTIEXPR)
    {
        int         subqueryid = p->paramid >> 16;
        int         colno = p->paramid & 0xFFFF;
        List       *params;
 
        if (subqueryid <= 0 ||
            subqueryid > list_length(root->multiexpr_params))
            elog(ERROR, "unexpected PARAM_MULTIEXPR ID: %d", p->paramid);
        params = (List *) list_nth(root->multiexpr_params, subqueryid - 1);
        if (colno <= 0 || colno > list_length(params))
            elog(ERROR, "unexpected PARAM_MULTIEXPR ID: %d", p->paramid);
        return copyObject(list_nth(params, colno - 1));
    }
    return (Node *) copyObject(p);
}

References copyObject, elog, ERROR, list_length(), list_nth(), PARAM_MULTIEXPR, Param::paramid, Param::paramkind, and root.

Referenced by fix_join_expr_mutator(), fix_scan_expr_mutator(), and fix_upper_expr_mutator().

fix_scan_expr()

static Node * fix_scan_expr ( PlannerInfo *  root, Node *  node, int  rtoffset, double  num_exec  )

static

Definition at line 2207 of file setrefs.c.

{
    fix_scan_expr_context context;
 
    context.root = root;
    context.rtoffset = rtoffset;
    context.num_exec = num_exec;
 
    if (rtoffset != 0 ||
        root->multiexpr_params != NIL ||
        root->glob->lastPHId != 0 ||
        root->minmax_aggs != NIL ||
        root->hasAlternativeSubPlans)
    {
        return fix_scan_expr_mutator(node, &context);
    }
    else
    {
        /*
         * If rtoffset == 0, we don't need to change any Vars, and if there
         * are no MULTIEXPR subqueries then we don't need to replace
         * PARAM_MULTIEXPR Params, and if there are no placeholders anywhere
         * we won't need to remove them, and if there are no minmax Aggrefs we
         * won't need to replace them, and if there are no AlternativeSubPlans
         * we won't need to remove them.  Then it's OK to just scribble on the
         * input node tree instead of copying (since the only change, filling
         * in any unset opfuncid fields, is harmless).  This saves just enough
         * cycles to be noticeable on trivial queries.
         */
        (void) fix_scan_expr_walker(node, &context);
        return node;
    }
}

References fix_scan_expr_mutator(), fix_scan_expr_walker(), NIL, fix_scan_expr_context::num_exec, fix_scan_expr_context::root, root, and fix_scan_expr_context::rtoffset.

Referenced by set_plan_refs().

fix_scan_expr_mutator()

static Node * fix_scan_expr_mutator ( Node *  node, fix_scan_expr_context *  context  )

static

Definition at line 2242 of file setrefs.c.

{
    if (node == NULL)
        return NULL;
    if (IsA(node, Var))
    {
        Var        *var = copyVar((Var *) node);
 
        Assert(var->varlevelsup == 0);
 
        /*
         * We should not see Vars marked INNER_VAR, OUTER_VAR, or ROWID_VAR.
         * But an indexqual expression could contain INDEX_VAR Vars.
         */
        Assert(var->varno != INNER_VAR);
        Assert(var->varno != OUTER_VAR);
        Assert(var->varno != ROWID_VAR);
        if (!IS_SPECIAL_VARNO(var->varno))
            var->varno += context->rtoffset;
        if (var->varnosyn > 0)
            var->varnosyn += context->rtoffset;
        return (Node *) var;
    }
    if (IsA(node, Param))
        return fix_param_node(context->root, (Param *) node);
    if (IsA(node, Aggref))
    {
        Aggref     *aggref = (Aggref *) node;
        Param      *aggparam;
 
        /* See if the Aggref should be replaced by a Param */
        aggparam = find_minmax_agg_replacement_param(context->root, aggref);
        if (aggparam != NULL)
        {
            /* Make a copy of the Param for paranoia's sake */
            return (Node *) copyObject(aggparam);
        }
        /* If no match, just fall through to process it normally */
    }
    if (IsA(node, CurrentOfExpr))
    {
        CurrentOfExpr *cexpr = (CurrentOfExpr *) copyObject(node);
 
        Assert(!IS_SPECIAL_VARNO(cexpr->cvarno));
        cexpr->cvarno += context->rtoffset;
        return (Node *) cexpr;
    }
    if (IsA(node, PlaceHolderVar))
    {
        /* At scan level, we should always just evaluate the contained expr */
        PlaceHolderVar *phv = (PlaceHolderVar *) node;
 
        /* XXX can we assert something about phnullingrels? */
        return fix_scan_expr_mutator((Node *) phv->phexpr, context);
    }
    if (IsA(node, AlternativeSubPlan))
        return fix_scan_expr_mutator(fix_alternative_subplan(context->root,
                                                             (AlternativeSubPlan *) node,
                                                             context->num_exec),
                                     context);
    fix_expr_common(context->root, node);
    return expression_tree_mutator(node, fix_scan_expr_mutator, context);
}

References Assert(), copyObject, copyVar(), CurrentOfExpr::cvarno, expression_tree_mutator, find_minmax_agg_replacement_param(), fix_alternative_subplan(), fix_expr_common(), fix_param_node(), fix_scan_expr_mutator(), INNER_VAR, IS_SPECIAL_VARNO, IsA, fix_scan_expr_context::num_exec, OUTER_VAR, fix_scan_expr_context::root, ROWID_VAR, fix_scan_expr_context::rtoffset, Var::varlevelsup, and Var::varno.

Referenced by fix_scan_expr(), and fix_scan_expr_mutator().

fix_scan_expr_walker()

static bool fix_scan_expr_walker ( Node *  node, fix_scan_expr_context *  context  )

static

Definition at line 2307 of file setrefs.c.

{
    if (node == NULL)
        return false;
    Assert(!(IsA(node, Var) && ((Var *) node)->varno == ROWID_VAR));
    Assert(!IsA(node, PlaceHolderVar));
    Assert(!IsA(node, AlternativeSubPlan));
    fix_expr_common(context->root, node);
    return expression_tree_walker(node, fix_scan_expr_walker, context);
}

References Assert(), expression_tree_walker, fix_expr_common(), fix_scan_expr_walker(), IsA, fix_scan_expr_context::root, and ROWID_VAR.

Referenced by fix_scan_expr(), and fix_scan_expr_walker().

fix_upper_expr()

static Node * fix_upper_expr ( PlannerInfo *  root, Node *  node, indexed_tlist *  subplan_itlist, int  newvarno, int  rtoffset, NullingRelsMatch  nrm_match, double  num_exec  )

static

Definition at line 3273 of file setrefs.c.

{
    fix_upper_expr_context context;
 
    context.root = root;
    context.subplan_itlist = subplan_itlist;
    context.newvarno = newvarno;
    context.rtoffset = rtoffset;
    context.nrm_match = nrm_match;
    context.num_exec = num_exec;
    return fix_upper_expr_mutator(node, &context);
}

References fix_upper_expr_mutator(), fix_upper_expr_context::newvarno, fix_upper_expr_context::nrm_match, fix_upper_expr_context::num_exec, fix_upper_expr_context::root, root, fix_upper_expr_context::rtoffset, and fix_upper_expr_context::subplan_itlist.

Referenced by set_customscan_references(), set_foreignscan_references(), set_hash_references(), set_indexonlyscan_references(), set_join_references(), and set_upper_references().

fix_upper_expr_mutator()

static Node * fix_upper_expr_mutator ( Node *  node, fix_upper_expr_context *  context  )

static

Definition at line 3293 of file setrefs.c.

{
    Var        *newvar;
 
    if (node == NULL)
        return NULL;
    if (IsA(node, Var))
    {
        Var        *var = (Var *) node;
 
        newvar = search_indexed_tlist_for_var(var,
                                              context->subplan_itlist,
                                              context->newvarno,
                                              context->rtoffset,
                                              context->nrm_match);
        if (!newvar)
            elog(ERROR, "variable not found in subplan target list");
        return (Node *) newvar;
    }
    if (IsA(node, PlaceHolderVar))
    {
        PlaceHolderVar *phv = (PlaceHolderVar *) node;
 
        /* See if the PlaceHolderVar has bubbled up from a lower plan node */
        if (context->subplan_itlist->has_ph_vars)
        {
            newvar = search_indexed_tlist_for_phv(phv,
                                                  context->subplan_itlist,
                                                  context->newvarno,
                                                  context->nrm_match);
            if (newvar)
                return (Node *) newvar;
        }
        /* If not supplied by input plan, evaluate the contained expr */
        /* XXX can we assert something about phnullingrels? */
        return fix_upper_expr_mutator((Node *) phv->phexpr, context);
    }
    /* Try matching more complex expressions too, if tlist has any */
    if (context->subplan_itlist->has_non_vars)
    {
        newvar = search_indexed_tlist_for_non_var((Expr *) node,
                                                  context->subplan_itlist,
                                                  context->newvarno);
        if (newvar)
            return (Node *) newvar;
    }
    /* Special cases (apply only AFTER failing to match to lower tlist) */
    if (IsA(node, Param))
        return fix_param_node(context->root, (Param *) node);
    if (IsA(node, Aggref))
    {
        Aggref     *aggref = (Aggref *) node;
        Param      *aggparam;
 
        /* See if the Aggref should be replaced by a Param */
        aggparam = find_minmax_agg_replacement_param(context->root, aggref);
        if (aggparam != NULL)
        {
            /* Make a copy of the Param for paranoia's sake */
            return (Node *) copyObject(aggparam);
        }
        /* If no match, just fall through to process it normally */
    }
    if (IsA(node, AlternativeSubPlan))
        return fix_upper_expr_mutator(fix_alternative_subplan(context->root,
                                                              (AlternativeSubPlan *) node,
                                                              context->num_exec),
                                      context);
    fix_expr_common(context->root, node);
    return expression_tree_mutator(node, fix_upper_expr_mutator, context);
}

References copyObject, elog, ERROR, expression_tree_mutator, find_minmax_agg_replacement_param(), fix_alternative_subplan(), fix_expr_common(), fix_param_node(), fix_upper_expr_mutator(), indexed_tlist::has_non_vars, indexed_tlist::has_ph_vars, IsA, fix_upper_expr_context::newvarno, fix_upper_expr_context::nrm_match, fix_upper_expr_context::num_exec, fix_upper_expr_context::root, fix_upper_expr_context::rtoffset, search_indexed_tlist_for_non_var(), search_indexed_tlist_for_phv(), search_indexed_tlist_for_var(), and fix_upper_expr_context::subplan_itlist.

Referenced by fix_upper_expr(), and fix_upper_expr_mutator().

fix_windowagg_condition_expr()

static List * fix_windowagg_condition_expr ( PlannerInfo *  root, List *  runcondition, indexed_tlist *  subplan_itlist  )

static

Definition at line 3468 of file setrefs.c.

{
    fix_windowagg_cond_context context;
 
    context.root = root;
    context.subplan_itlist = subplan_itlist;
    context.newvarno = 0;
 
    return (List *) fix_windowagg_condition_expr_mutator((Node *) runcondition,
                                                         &context);
}

References fix_windowagg_condition_expr_mutator(), fix_windowagg_cond_context::newvarno, fix_windowagg_cond_context::root, root, and fix_windowagg_cond_context::subplan_itlist.

Referenced by set_windowagg_runcondition_references().

fix_windowagg_condition_expr_mutator()

static Node * fix_windowagg_condition_expr_mutator ( Node *  node, fix_windowagg_cond_context *  context  )

static

Definition at line 3438 of file setrefs.c.

{
    if (node == NULL)
        return NULL;
 
    if (IsA(node, WindowFunc))
    {
        Var        *newvar;
 
        newvar = search_indexed_tlist_for_non_var((Expr *) node,
                                                  context->subplan_itlist,
                                                  context->newvarno);
        if (newvar)
            return (Node *) newvar;
        elog(ERROR, "WindowFunc not found in subplan target lists");
    }
 
    return expression_tree_mutator(node,
                                   fix_windowagg_condition_expr_mutator,
                                   context);
}

References elog, ERROR, expression_tree_mutator, fix_windowagg_condition_expr_mutator(), IsA, fix_windowagg_cond_context::newvarno, search_indexed_tlist_for_non_var(), and fix_windowagg_cond_context::subplan_itlist.

Referenced by fix_windowagg_condition_expr(), and fix_windowagg_condition_expr_mutator().

flatten_rtes_walker()

static bool flatten_rtes_walker ( Node *  node, flatten_rtes_walker_context *  cxt  )

static

Definition at line 493 of file setrefs.c.

{
    if (node == NULL)
        return false;
    if (IsA(node, RangeTblEntry))
    {
        RangeTblEntry *rte = (RangeTblEntry *) node;
 
        /* As above, we need only save relation RTEs and former relations */
        if (rte->rtekind == RTE_RELATION ||
            (rte->rtekind == RTE_SUBQUERY && OidIsValid(rte->relid)))
            add_rte_to_flat_rtable(cxt->glob, cxt->query->rteperminfos, rte);
        return false;
    }
    if (IsA(node, Query))
    {
        /*
         * Recurse into subselects.  Must update cxt->query to this query so
         * that the rtable and rteperminfos correspond with each other.
         */
        Query      *save_query = cxt->query;
        bool        result;
 
        cxt->query = (Query *) node;
        result = query_tree_walker((Query *) node,
                                   flatten_rtes_walker,
                                   cxt,
                                   QTW_EXAMINE_RTES_BEFORE);
        cxt->query = save_query;
        return result;
    }
    return expression_tree_walker(node, flatten_rtes_walker, cxt);
}

References add_rte_to_flat_rtable(), expression_tree_walker, flatten_rtes_walker(), flatten_rtes_walker_context::glob, IsA, OidIsValid, QTW_EXAMINE_RTES_BEFORE, flatten_rtes_walker_context::query, query_tree_walker, RTE_RELATION, RTE_SUBQUERY, and RangeTblEntry::rtekind.

Referenced by flatten_rtes_walker(), and flatten_unplanned_rtes().

flatten_unplanned_rtes()

static void flatten_unplanned_rtes ( PlannerGlobal *  glob, RangeTblEntry *  rte  )

static

Definition at line 481 of file setrefs.c.

{
    flatten_rtes_walker_context cxt = {glob, rte->subquery};
 
    /* Use query_tree_walker to find all RTEs in the parse tree */
    (void) query_tree_walker(rte->subquery,
                             flatten_rtes_walker,
                             &cxt,
                             QTW_EXAMINE_RTES_BEFORE);
}

References flatten_rtes_walker(), QTW_EXAMINE_RTES_BEFORE, query_tree_walker, and RangeTblEntry::subquery.

Referenced by add_rtes_to_flat_rtable().

offset_relid_set()

static Relids offset_relid_set ( Relids  relids, int  rtoffset  )

static

Definition at line 1981 of file setrefs.c.

{
    Relids      result = NULL;
    int         rtindex;
 
    /* If there's no offset to apply, we needn't recompute the value */
    if (rtoffset == 0)
        return relids;
    rtindex = -1;
    while ((rtindex = bms_next_member(relids, rtindex)) >= 0)
        result = bms_add_member(result, rtindex + rtoffset);
    return result;
}

References bms_add_member(), and bms_next_member().

Referenced by register_partpruneinfo(), set_append_references(), set_customscan_references(), set_foreignscan_references(), and set_mergeappend_references().

record_plan_function_dependency()

void record_plan_function_dependency	(	PlannerInfo *	root,
		Oid	funcid
	)

Definition at line 3549 of file setrefs.c.

{
    /*
     * For performance reasons, we don't bother to track built-in functions;
     * we just assume they'll never change (or at least not in ways that'd
     * invalidate plans using them).  For this purpose we can consider a
     * built-in function to be one with OID less than FirstUnpinnedObjectId.
     * Note that the OID generator guarantees never to generate such an OID
     * after startup, even at OID wraparound.
     */
    if (funcid >= (Oid) FirstUnpinnedObjectId)
    {
        PlanInvalItem *inval_item = makeNode(PlanInvalItem);
 
        /*
         * It would work to use any syscache on pg_proc, but the easiest is
         * PROCOID since we already have the function's OID at hand.  Note
         * that plancache.c knows we use PROCOID.
         */
        inval_item->cacheId = PROCOID;
        inval_item->hashValue = GetSysCacheHashValue1(PROCOID,
                                                      ObjectIdGetDatum(funcid));
 
        root->glob->invalItems = lappend(root->glob->invalItems, inval_item);
    }
}

References PlanInvalItem::cacheId, FirstUnpinnedObjectId, GetSysCacheHashValue1, PlanInvalItem::hashValue, lappend(), makeNode, ObjectIdGetDatum(), and root.

Referenced by fix_expr_common(), inline_function(), and inline_set_returning_function().

record_plan_type_dependency()

void record_plan_type_dependency	(	PlannerInfo *	root,
		Oid	typid
	)

Definition at line 3589 of file setrefs.c.

{
    /*
     * As in record_plan_function_dependency, ignore the possibility that
     * someone would change a built-in domain.
     */
    if (typid >= (Oid) FirstUnpinnedObjectId)
    {
        PlanInvalItem *inval_item = makeNode(PlanInvalItem);
 
        /*
         * It would work to use any syscache on pg_type, but the easiest is
         * TYPEOID since we already have the type's OID at hand.  Note that
         * plancache.c knows we use TYPEOID.
         */
        inval_item->cacheId = TYPEOID;
        inval_item->hashValue = GetSysCacheHashValue1(TYPEOID,
                                                      ObjectIdGetDatum(typid));
 
        root->glob->invalItems = lappend(root->glob->invalItems, inval_item);
    }
}

References PlanInvalItem::cacheId, FirstUnpinnedObjectId, GetSysCacheHashValue1, PlanInvalItem::hashValue, lappend(), makeNode, ObjectIdGetDatum(), and root.

Referenced by eval_const_expressions_mutator().

register_partpruneinfo()

static int register_partpruneinfo ( PlannerInfo *  root, int  part_prune_index, int  rtoffset  )

static

Definition at line 1755 of file setrefs.c.

{
    PlannerGlobal *glob = root->glob;
    PartitionPruneInfo *pinfo;
    ListCell   *l;
 
    Assert(part_prune_index >= 0 &&
           part_prune_index < list_length(root->partPruneInfos));
    pinfo = list_nth_node(PartitionPruneInfo, root->partPruneInfos,
                          part_prune_index);
 
    pinfo->relids = offset_relid_set(pinfo->relids, rtoffset);
    foreach(l, pinfo->prune_infos)
    {
        List       *prune_infos = lfirst(l);
        ListCell   *l2;
 
        foreach(l2, prune_infos)
        {
            PartitionedRelPruneInfo *prelinfo = lfirst(l2);
            int         i;
 
            prelinfo->rtindex += rtoffset;
            prelinfo->initial_pruning_steps =
                fix_scan_list(root, prelinfo->initial_pruning_steps,
                              rtoffset, 1);
            prelinfo->exec_pruning_steps =
                fix_scan_list(root, prelinfo->exec_pruning_steps,
                              rtoffset, 1);
 
            for (i = 0; i < prelinfo->nparts; i++)
            {
                /*
                 * Non-leaf partitions and partitions that do not have a
                 * subplan are not included in this map as mentioned in
                 * make_partitionedrel_pruneinfo().
                 */
                if (prelinfo->leafpart_rti_map[i])
                {
                    prelinfo->leafpart_rti_map[i] += rtoffset;
                    if (prelinfo->initial_pruning_steps)
                        glob->prunableRelids = bms_add_member(glob->prunableRelids,
                                                              prelinfo->leafpart_rti_map[i]);
                }
            }
        }
    }
 
    glob->partPruneInfos = lappend(glob->partPruneInfos, pinfo);
 
    return list_length(glob->partPruneInfos) - 1;
}

References Assert(), bms_add_member(), PartitionedRelPruneInfo::exec_pruning_steps, fix_scan_list, i, PartitionedRelPruneInfo::initial_pruning_steps, lappend(), lfirst, list_length(), list_nth_node, PartitionedRelPruneInfo::nparts, offset_relid_set(), PlannerGlobal::partPruneInfos, PlannerGlobal::prunableRelids, PartitionPruneInfo::prune_infos, PartitionPruneInfo::relids, root, and PartitionedRelPruneInfo::rtindex.

Referenced by set_append_references(), and set_mergeappend_references().

search_indexed_tlist_for_non_var()

static Var * search_indexed_tlist_for_non_var ( Expr *  node, indexed_tlist *  itlist, int  newvarno  )

static

Definition at line 2981 of file setrefs.c.

{
    TargetEntry *tle;
 
    /*
     * If it's a simple Const, replacing it with a Var is silly, even if there
     * happens to be an identical Const below; a Var is more expensive to
     * execute than a Const.  What's more, replacing it could confuse some
     * places in the executor that expect to see simple Consts for, eg,
     * dropped columns.
     */
    if (IsA(node, Const))
        return NULL;
 
    tle = tlist_member(node, itlist->tlist);
    if (tle)
    {
        /* Found a matching subplan output expression */
        Var        *newvar;
 
        newvar = makeVarFromTargetEntry(newvarno, tle);
        newvar->varnosyn = 0;   /* wasn't ever a plain Var */
        newvar->varattnosyn = 0;
        return newvar;
    }
    return NULL;                /* no match */
}

References IsA, makeVarFromTargetEntry(), indexed_tlist::tlist, and tlist_member().

Referenced by fix_join_expr_mutator(), fix_upper_expr_mutator(), and fix_windowagg_condition_expr_mutator().

search_indexed_tlist_for_phv()

static Var * search_indexed_tlist_for_phv ( PlaceHolderVar *  phv, indexed_tlist *  itlist, int  newvarno, NullingRelsMatch  nrm_match  )

static

Definition at line 2928 of file setrefs.c.

{
    ListCell   *lc;
 
    foreach(lc, itlist->tlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(lc);
 
        if (tle->expr && IsA(tle->expr, PlaceHolderVar))
        {
            PlaceHolderVar *subphv = (PlaceHolderVar *) tle->expr;
            Var        *newvar;
 
            /*
             * Analogously to search_indexed_tlist_for_var, we match on phid
             * only.  We don't use equal(), partially for speed but mostly
             * because phnullingrels might not be exactly equal.
             */
            if (phv->phid != subphv->phid)
                continue;
 
            /* Verify that we kept all the nullingrels machinations straight */
            if (!(nrm_match == NRM_SUBSET ?
                  bms_is_subset(phv->phnullingrels, subphv->phnullingrels) :
                  nrm_match == NRM_SUPERSET ?
                  bms_is_subset(subphv->phnullingrels, phv->phnullingrels) :
                  bms_equal(subphv->phnullingrels, phv->phnullingrels)))
                elog(ERROR, "wrong phnullingrels %s (expected %s) for PlaceHolderVar %d",
                     bmsToString(phv->phnullingrels),
                     bmsToString(subphv->phnullingrels),
                     phv->phid);
 
            /* Found a matching subplan output expression */
            newvar = makeVarFromTargetEntry(newvarno, tle);
            newvar->varnosyn = 0;   /* wasn't ever a plain Var */
            newvar->varattnosyn = 0;
            return newvar;
        }
    }
    return NULL;                /* no match */
}

References bms_equal(), bms_is_subset(), bmsToString(), elog, ERROR, TargetEntry::expr, if(), IsA, lfirst, makeVarFromTargetEntry(), NRM_SUBSET, NRM_SUPERSET, PlaceHolderVar::phid, PlaceHolderVar::phnullingrels, and indexed_tlist::tlist.

Referenced by fix_join_expr_mutator(), and fix_upper_expr_mutator().

search_indexed_tlist_for_sortgroupref()

static Var * search_indexed_tlist_for_sortgroupref ( Expr *  node, Index  sortgroupref, indexed_tlist *  itlist, int  newvarno  )

static

Definition at line 3021 of file setrefs.c.

{
    ListCell   *lc;
 
    foreach(lc, itlist->tlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(lc);
 
        /*
         * Usually the equal() check is redundant, but in setop plans it may
         * not be, since prepunion.c assigns ressortgroupref equal to the
         * column resno without regard to whether that matches the topmost
         * level's sortgrouprefs and without regard to whether any implicit
         * coercions are added in the setop tree.  We might have to clean that
         * up someday; but for now, just ignore any false matches.
         */
        if (tle->ressortgroupref == sortgroupref &&
            equal(node, tle->expr))
        {
            /* Found a matching subplan output expression */
            Var        *newvar;
 
            newvar = makeVarFromTargetEntry(newvarno, tle);
            newvar->varnosyn = 0;   /* wasn't ever a plain Var */
            newvar->varattnosyn = 0;
            return newvar;
        }
    }
    return NULL;                /* no match */
}

References equal(), TargetEntry::expr, lfirst, makeVarFromTargetEntry(), TargetEntry::ressortgroupref, and indexed_tlist::tlist.

Referenced by set_upper_references().

search_indexed_tlist_for_var()

static Var * search_indexed_tlist_for_var ( Var *  var, indexed_tlist *  itlist, int  newvarno, int  rtoffset, NullingRelsMatch  nrm_match  )

static

Definition at line 2863 of file setrefs.c.

{
    int         varno = var->varno;
    AttrNumber  varattno = var->varattno;
    tlist_vinfo *vinfo;
    int         i;
 
    vinfo = itlist->vars;
    i = itlist->num_vars;
    while (i-- > 0)
    {
        if (vinfo->varno == varno && vinfo->varattno == varattno)
        {
            /* Found a match */
            Var        *newvar = copyVar(var);
 
            /*
             * Verify that we kept all the nullingrels machinations straight.
             *
             * XXX we skip the check for system columns and whole-row Vars.
             * That's because such Vars might be row identity Vars, which are
             * generated without any varnullingrels.  It'd be hard to do
             * otherwise, since they're normally made very early in planning,
             * when we haven't looked at the jointree yet and don't know which
             * joins might null such Vars.  Doesn't seem worth the expense to
             * make them fully valid.  (While it's slightly annoying that we
             * thereby lose checking for user-written references to such
             * columns, it seems unlikely that a bug in nullingrels logic
             * would affect only system columns.)
             */
            if (!(varattno <= 0 ||
                  (nrm_match == NRM_SUBSET ?
                   bms_is_subset(var->varnullingrels, vinfo->varnullingrels) :
                   nrm_match == NRM_SUPERSET ?
                   bms_is_subset(vinfo->varnullingrels, var->varnullingrels) :
                   bms_equal(vinfo->varnullingrels, var->varnullingrels))))
                elog(ERROR, "wrong varnullingrels %s (expected %s) for Var %d/%d",
                     bmsToString(var->varnullingrels),
                     bmsToString(vinfo->varnullingrels),
                     varno, varattno);
 
            newvar->varno = newvarno;
            newvar->varattno = vinfo->resno;
            if (newvar->varnosyn > 0)
                newvar->varnosyn += rtoffset;
            return newvar;
        }
        vinfo++;
    }
    return NULL;                /* no match */
}

References bms_equal(), bms_is_subset(), bmsToString(), copyVar(), elog, ERROR, i, NRM_SUBSET, NRM_SUPERSET, indexed_tlist::num_vars, tlist_vinfo::resno, tlist_vinfo::varattno, Var::varattno, tlist_vinfo::varno, Var::varno, tlist_vinfo::varnullingrels, and indexed_tlist::vars.

Referenced by fix_join_expr_mutator(), and fix_upper_expr_mutator().

set_append_references()

static Plan * set_append_references ( PlannerInfo *  root, Append *  aplan, int  rtoffset  )

static

Definition at line 1816 of file setrefs.c.

{
    ListCell   *l;
 
    /*
     * Append, like Sort et al, doesn't actually evaluate its targetlist or
     * check quals.  If it's got exactly one child plan, then it's not doing
     * anything useful at all, and we can strip it out.
     */
    Assert(aplan->plan.qual == NIL);
 
    /* First, we gotta recurse on the children */
    foreach(l, aplan->appendplans)
    {
        lfirst(l) = set_plan_refs(root, (Plan *) lfirst(l), rtoffset);
    }
 
    /*
     * See if it's safe to get rid of the Append entirely.  For this to be
     * safe, there must be only one child plan and that child plan's parallel
     * awareness must match the Append's.  The reason for the latter is that
     * if the Append is parallel aware and the child is not, then the calling
     * plan may execute the non-parallel aware child multiple times.  (If you
     * change these rules, update create_append_path to match.)
     */
    if (list_length(aplan->appendplans) == 1)
    {
        Plan       *p = (Plan *) linitial(aplan->appendplans);
 
        if (p->parallel_aware == aplan->plan.parallel_aware)
            return clean_up_removed_plan_level((Plan *) aplan, p);
    }
 
    /*
     * Otherwise, clean up the Append as needed.  It's okay to do this after
     * recursing to the children, because set_dummy_tlist_references doesn't
     * look at those.
     */
    set_dummy_tlist_references((Plan *) aplan, rtoffset);
 
    aplan->apprelids = offset_relid_set(aplan->apprelids, rtoffset);
 
    /*
     * Add PartitionPruneInfo, if any, to PlannerGlobal and update the index.
     * Also update the RT indexes present in it to add the offset.
     */
    if (aplan->part_prune_index >= 0)
        aplan->part_prune_index =
            register_partpruneinfo(root, aplan->part_prune_index, rtoffset);
 
    /* We don't need to recurse to lefttree or righttree ... */
    Assert(aplan->plan.lefttree == NULL);
    Assert(aplan->plan.righttree == NULL);
 
    return (Plan *) aplan;
}

References Append::appendplans, Append::apprelids, Assert(), clean_up_removed_plan_level(), Plan::lefttree, lfirst, linitial, list_length(), NIL, offset_relid_set(), Plan::parallel_aware, Append::part_prune_index, Append::plan, Plan::qual, register_partpruneinfo(), Plan::righttree, root, set_dummy_tlist_references(), and set_plan_refs().

Referenced by set_plan_refs().

set_customscan_references()

static void set_customscan_references ( PlannerInfo *  root, CustomScan *  cscan, int  rtoffset  )

static

Definition at line 1672 of file setrefs.c.

{
    ListCell   *lc;
 
    /* Adjust scanrelid if it's valid */
    if (cscan->scan.scanrelid > 0)
        cscan->scan.scanrelid += rtoffset;
 
    if (cscan->custom_scan_tlist != NIL || cscan->scan.scanrelid == 0)
    {
        /* Adjust tlist, qual, custom_exprs to reference custom scan tuple */
        indexed_tlist *itlist = build_tlist_index(cscan->custom_scan_tlist);
 
        cscan->scan.plan.targetlist = (List *)
            fix_upper_expr(root,
                           (Node *) cscan->scan.plan.targetlist,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_TLIST((Plan *) cscan));
        cscan->scan.plan.qual = (List *)
            fix_upper_expr(root,
                           (Node *) cscan->scan.plan.qual,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_QUAL((Plan *) cscan));
        cscan->custom_exprs = (List *)
            fix_upper_expr(root,
                           (Node *) cscan->custom_exprs,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_QUAL((Plan *) cscan));
        pfree(itlist);
        /* custom_scan_tlist itself just needs fix_scan_list() adjustments */
        cscan->custom_scan_tlist =
            fix_scan_list(root, cscan->custom_scan_tlist,
                          rtoffset, NUM_EXEC_TLIST((Plan *) cscan));
    }
    else
    {
        /* Adjust tlist, qual, custom_exprs in the standard way */
        cscan->scan.plan.targetlist =
            fix_scan_list(root, cscan->scan.plan.targetlist,
                          rtoffset, NUM_EXEC_TLIST((Plan *) cscan));
        cscan->scan.plan.qual =
            fix_scan_list(root, cscan->scan.plan.qual,
                          rtoffset, NUM_EXEC_QUAL((Plan *) cscan));
        cscan->custom_exprs =
            fix_scan_list(root, cscan->custom_exprs,
                          rtoffset, NUM_EXEC_QUAL((Plan *) cscan));
    }
 
    /* Adjust child plan-nodes recursively, if needed */
    foreach(lc, cscan->custom_plans)
    {
        lfirst(lc) = set_plan_refs(root, (Plan *) lfirst(lc), rtoffset);
    }
 
    cscan->custom_relids = offset_relid_set(cscan->custom_relids, rtoffset);
}

References build_tlist_index(), CustomScan::custom_plans, CustomScan::custom_relids, CustomScan::custom_scan_tlist, fix_scan_list, fix_upper_expr(), INDEX_VAR, lfirst, NIL, NRM_EQUAL, NUM_EXEC_QUAL, NUM_EXEC_TLIST, offset_relid_set(), pfree(), Plan::qual, root, CustomScan::scan, Scan::scanrelid, and set_plan_refs().

Referenced by set_plan_refs().

set_dummy_tlist_references()

static void set_dummy_tlist_references ( Plan *  plan, int  rtoffset  )

static

Definition at line 2687 of file setrefs.c.

{
    List       *output_targetlist;
    ListCell   *l;
 
    output_targetlist = NIL;
    foreach(l, plan->targetlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(l);
        Var        *oldvar = (Var *) tle->expr;
        Var        *newvar;
 
        /*
         * As in search_indexed_tlist_for_non_var(), we prefer to keep Consts
         * as Consts, not Vars referencing Consts.  Here, there's no speed
         * advantage to be had, but it makes EXPLAIN output look cleaner, and
         * again it avoids confusing the executor.
         */
        if (IsA(oldvar, Const))
        {
            /* just reuse the existing TLE node */
            output_targetlist = lappend(output_targetlist, tle);
            continue;
        }
 
        newvar = makeVar(OUTER_VAR,
                         tle->resno,
                         exprType((Node *) oldvar),
                         exprTypmod((Node *) oldvar),
                         exprCollation((Node *) oldvar),
                         0);
        if (IsA(oldvar, Var) &&
            oldvar->varnosyn > 0)
        {
            newvar->varnosyn = oldvar->varnosyn + rtoffset;
            newvar->varattnosyn = oldvar->varattnosyn;
        }
        else
        {
            newvar->varnosyn = 0;   /* wasn't ever a plain Var */
            newvar->varattnosyn = 0;
        }
 
        tle = flatCopyTargetEntry(tle);
        tle->expr = (Expr *) newvar;
        output_targetlist = lappend(output_targetlist, tle);
    }
    plan->targetlist = output_targetlist;
 
    /* We don't touch plan->qual here */
}

References TargetEntry::expr, exprCollation(), exprType(), exprTypmod(), flatCopyTargetEntry(), if(), IsA, lappend(), lfirst, makeVar(), NIL, OUTER_VAR, plan, and TargetEntry::resno.

Referenced by set_append_references(), set_hash_references(), set_mergeappend_references(), and set_plan_refs().

set_foreignscan_references()

static void set_foreignscan_references ( PlannerInfo *  root, ForeignScan *  fscan, int  rtoffset  )

static

Definition at line 1585 of file setrefs.c.

{
    /* Adjust scanrelid if it's valid */
    if (fscan->scan.scanrelid > 0)
        fscan->scan.scanrelid += rtoffset;
 
    if (fscan->fdw_scan_tlist != NIL || fscan->scan.scanrelid == 0)
    {
        /*
         * Adjust tlist, qual, fdw_exprs, fdw_recheck_quals to reference
         * foreign scan tuple
         */
        indexed_tlist *itlist = build_tlist_index(fscan->fdw_scan_tlist);
 
        fscan->scan.plan.targetlist = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->scan.plan.targetlist,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_TLIST((Plan *) fscan));
        fscan->scan.plan.qual = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->scan.plan.qual,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_QUAL((Plan *) fscan));
        fscan->fdw_exprs = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->fdw_exprs,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_QUAL((Plan *) fscan));
        fscan->fdw_recheck_quals = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->fdw_recheck_quals,
                           itlist,
                           INDEX_VAR,
                           rtoffset,
                           NRM_EQUAL,
                           NUM_EXEC_QUAL((Plan *) fscan));
        pfree(itlist);
        /* fdw_scan_tlist itself just needs fix_scan_list() adjustments */
        fscan->fdw_scan_tlist =
            fix_scan_list(root, fscan->fdw_scan_tlist,
                          rtoffset, NUM_EXEC_TLIST((Plan *) fscan));
    }
    else
    {
        /*
         * Adjust tlist, qual, fdw_exprs, fdw_recheck_quals in the standard
         * way
         */
        fscan->scan.plan.targetlist =
            fix_scan_list(root, fscan->scan.plan.targetlist,
                          rtoffset, NUM_EXEC_TLIST((Plan *) fscan));
        fscan->scan.plan.qual =
            fix_scan_list(root, fscan->scan.plan.qual,
                          rtoffset, NUM_EXEC_QUAL((Plan *) fscan));
        fscan->fdw_exprs =
            fix_scan_list(root, fscan->fdw_exprs,
                          rtoffset, NUM_EXEC_QUAL((Plan *) fscan));
        fscan->fdw_recheck_quals =
            fix_scan_list(root, fscan->fdw_recheck_quals,
                          rtoffset, NUM_EXEC_QUAL((Plan *) fscan));
    }
 
    fscan->fs_relids = offset_relid_set(fscan->fs_relids, rtoffset);
    fscan->fs_base_relids = offset_relid_set(fscan->fs_base_relids, rtoffset);
 
    /* Adjust resultRelation if it's valid */
    if (fscan->resultRelation > 0)
        fscan->resultRelation += rtoffset;
}

References build_tlist_index(), ForeignScan::fdw_scan_tlist, fix_scan_list, fix_upper_expr(), ForeignScan::fs_base_relids, ForeignScan::fs_relids, INDEX_VAR, NIL, NRM_EQUAL, NUM_EXEC_QUAL, NUM_EXEC_TLIST, offset_relid_set(), pfree(), Plan::qual, ForeignScan::resultRelation, root, ForeignScan::scan, and Scan::scanrelid.

Referenced by set_plan_refs().

set_hash_references()

static void set_hash_references ( PlannerInfo *  root, Plan *  plan, int  rtoffset  )

static

Definition at line 1948 of file setrefs.c.

{
    Hash       *hplan = (Hash *) plan;
    Plan       *outer_plan = plan->lefttree;
    indexed_tlist *outer_itlist;
 
    /*
     * Hash's hashkeys are used when feeding tuples into the hashtable,
     * therefore have them reference Hash's outer plan (which itself is the
     * inner plan of the HashJoin).
     */
    outer_itlist = build_tlist_index(outer_plan->targetlist);
    hplan->hashkeys = (List *)
        fix_upper_expr(root,
                       (Node *) hplan->hashkeys,
                       outer_itlist,
                       OUTER_VAR,
                       rtoffset,
                       NRM_EQUAL,
                       NUM_EXEC_QUAL(plan));
 
    /* Hash doesn't project */
    set_dummy_tlist_references(plan, rtoffset);
 
    /* Hash nodes don't have their own quals */
    Assert(plan->qual == NIL);
}

References Assert(), build_tlist_index(), fix_upper_expr(), Hash::hashkeys, NIL, NRM_EQUAL, NUM_EXEC_QUAL, OUTER_VAR, plan, root, set_dummy_tlist_references(), and Plan::targetlist.

Referenced by set_plan_refs().

set_indexonlyscan_references()

static Plan * set_indexonlyscan_references ( PlannerInfo *  root, IndexOnlyScan *  plan, int  rtoffset  )

static

Definition at line 1328 of file setrefs.c.

{
    indexed_tlist *index_itlist;
    List       *stripped_indextlist;
    ListCell   *lc;
 
    /*
     * Vars in the plan node's targetlist, qual, and recheckqual must only
     * reference columns that the index AM can actually return.  To ensure
     * this, remove non-returnable columns (which are marked as resjunk) from
     * the indexed tlist.  We can just drop them because the indexed_tlist
     * machinery pays attention to TLE resnos, not physical list position.
     */
    stripped_indextlist = NIL;
    foreach(lc, plan->indextlist)
    {
        TargetEntry *indextle = (TargetEntry *) lfirst(lc);
 
        if (!indextle->resjunk)
            stripped_indextlist = lappend(stripped_indextlist, indextle);
    }
 
    index_itlist = build_tlist_index(stripped_indextlist);
 
    plan->scan.scanrelid += rtoffset;
    plan->scan.plan.targetlist = (List *)
        fix_upper_expr(root,
                       (Node *) plan->scan.plan.targetlist,
                       index_itlist,
                       INDEX_VAR,
                       rtoffset,
                       NRM_EQUAL,
                       NUM_EXEC_TLIST((Plan *) plan));
    plan->scan.plan.qual = (List *)
        fix_upper_expr(root,
                       (Node *) plan->scan.plan.qual,
                       index_itlist,
                       INDEX_VAR,
                       rtoffset,
                       NRM_EQUAL,
                       NUM_EXEC_QUAL((Plan *) plan));
    plan->recheckqual = (List *)
        fix_upper_expr(root,
                       (Node *) plan->recheckqual,
                       index_itlist,
                       INDEX_VAR,
                       rtoffset,
                       NRM_EQUAL,
                       NUM_EXEC_QUAL((Plan *) plan));
    /* indexqual is already transformed to reference index columns */
    plan->indexqual = fix_scan_list(root, plan->indexqual,
                                    rtoffset, 1);
    /* indexorderby is already transformed to reference index columns */
    plan->indexorderby = fix_scan_list(root, plan->indexorderby,
                                       rtoffset, 1);
    /* indextlist must NOT be transformed to reference index columns */
    plan->indextlist = fix_scan_list(root, plan->indextlist,
                                     rtoffset, NUM_EXEC_TLIST((Plan *) plan));
 
    pfree(index_itlist);
 
    return (Plan *) plan;
}

References build_tlist_index(), fix_scan_list, fix_upper_expr(), INDEX_VAR, lappend(), lfirst, NIL, NRM_EQUAL, NUM_EXEC_QUAL, NUM_EXEC_TLIST, pfree(), plan, and root.

Referenced by set_plan_refs().

set_join_references()

static void set_join_references ( PlannerInfo *  root, Join *  join, int  rtoffset  )

static

Definition at line 2327 of file setrefs.c.

{
    Plan       *outer_plan = join->plan.lefttree;
    Plan       *inner_plan = join->plan.righttree;
    indexed_tlist *outer_itlist;
    indexed_tlist *inner_itlist;
 
    outer_itlist = build_tlist_index(outer_plan->targetlist);
    inner_itlist = build_tlist_index(inner_plan->targetlist);
 
    /*
     * First process the joinquals (including merge or hash clauses).  These
     * are logically below the join so they can always use all values
     * available from the input tlists.  It's okay to also handle
     * NestLoopParams now, because those couldn't refer to nullable
     * subexpressions.
     */
    join->joinqual = fix_join_expr(root,
                                   join->joinqual,
                                   outer_itlist,
                                   inner_itlist,
                                   (Index) 0,
                                   rtoffset,
                                   NRM_EQUAL,
                                   NUM_EXEC_QUAL((Plan *) join));
 
    /* Now do join-type-specific stuff */
    if (IsA(join, NestLoop))
    {
        NestLoop   *nl = (NestLoop *) join;
        ListCell   *lc;
 
        foreach(lc, nl->nestParams)
        {
            NestLoopParam *nlp = (NestLoopParam *) lfirst(lc);
 
            /*
             * Because we don't reparameterize parameterized paths to match
             * the outer-join level at which they are used, Vars seen in the
             * NestLoopParam expression may have nullingrels that are just a
             * subset of those in the Vars actually available from the outer
             * side.  (Lateral references can also cause this, as explained in
             * the comments for identify_current_nestloop_params.)  Not
             * checking this exactly is a bit grotty, but the work needed to
             * make things match up perfectly seems well out of proportion to
             * the value.
             */
            nlp->paramval = (Var *) fix_upper_expr(root,
                                                   (Node *) nlp->paramval,
                                                   outer_itlist,
                                                   OUTER_VAR,
                                                   rtoffset,
                                                   NRM_SUBSET,
                                                   NUM_EXEC_TLIST(outer_plan));
            /* Check we replaced any PlaceHolderVar with simple Var */
            if (!(IsA(nlp->paramval, Var) &&
                  nlp->paramval->varno == OUTER_VAR))
                elog(ERROR, "NestLoopParam was not reduced to a simple Var");
        }
    }
    else if (IsA(join, MergeJoin))
    {
        MergeJoin  *mj = (MergeJoin *) join;
 
        mj->mergeclauses = fix_join_expr(root,
                                         mj->mergeclauses,
                                         outer_itlist,
                                         inner_itlist,
                                         (Index) 0,
                                         rtoffset,
                                         NRM_EQUAL,
                                         NUM_EXEC_QUAL((Plan *) join));
    }
    else if (IsA(join, HashJoin))
    {
        HashJoin   *hj = (HashJoin *) join;
 
        hj->hashclauses = fix_join_expr(root,
                                        hj->hashclauses,
                                        outer_itlist,
                                        inner_itlist,
                                        (Index) 0,
                                        rtoffset,
                                        NRM_EQUAL,
                                        NUM_EXEC_QUAL((Plan *) join));
 
        /*
         * HashJoin's hashkeys are used to look for matching tuples from its
         * outer plan (not the Hash node!) in the hashtable.
         */
        hj->hashkeys = (List *) fix_upper_expr(root,
                                               (Node *) hj->hashkeys,
                                               outer_itlist,
                                               OUTER_VAR,
                                               rtoffset,
                                               NRM_EQUAL,
                                               NUM_EXEC_QUAL((Plan *) join));
    }
 
    /*
     * Now we need to fix up the targetlist and qpqual, which are logically
     * above the join.  This means that, if it's not an inner join, any Vars
     * and PHVs appearing here should have nullingrels that include the
     * effects of the outer join, ie they will have nullingrels equal to the
     * input Vars' nullingrels plus the bit added by the outer join.  We don't
     * currently have enough info available here to identify what that should
     * be, so we just tell fix_join_expr to accept superset nullingrels
     * matches instead of exact ones.
     */
    join->plan.targetlist = fix_join_expr(root,
                                          join->plan.targetlist,
                                          outer_itlist,
                                          inner_itlist,
                                          (Index) 0,
                                          rtoffset,
                                          (join->jointype == JOIN_INNER ? NRM_EQUAL : NRM_SUPERSET),
                                          NUM_EXEC_TLIST((Plan *) join));
    join->plan.qual = fix_join_expr(root,
                                    join->plan.qual,
                                    outer_itlist,
                                    inner_itlist,
                                    (Index) 0,
                                    rtoffset,
                                    (join->jointype == JOIN_INNER ? NRM_EQUAL : NRM_SUPERSET),
                                    NUM_EXEC_QUAL((Plan *) join));
 
    pfree(outer_itlist);
    pfree(inner_itlist);
}

References build_tlist_index(), elog, ERROR, fix_join_expr(), fix_upper_expr(), HashJoin::hashclauses, HashJoin::hashkeys, IsA, JOIN_INNER, Join::joinqual, Join::jointype, lfirst, MergeJoin::mergeclauses, NestLoop::nestParams, NRM_EQUAL, NRM_SUBSET, NRM_SUPERSET, NUM_EXEC_QUAL, NUM_EXEC_TLIST, OUTER_VAR, NestLoopParam::paramval, pfree(), root, Plan::targetlist, and Var::varno.

Referenced by set_plan_refs().

set_mergeappend_references()

static Plan * set_mergeappend_references ( PlannerInfo *  root, MergeAppend *  mplan, int  rtoffset  )

static

Definition at line 1883 of file setrefs.c.

{
    ListCell   *l;
 
    /*
     * MergeAppend, like Sort et al, doesn't actually evaluate its targetlist
     * or check quals.  If it's got exactly one child plan, then it's not
     * doing anything useful at all, and we can strip it out.
     */
    Assert(mplan->plan.qual == NIL);
 
    /* First, we gotta recurse on the children */
    foreach(l, mplan->mergeplans)
    {
        lfirst(l) = set_plan_refs(root, (Plan *) lfirst(l), rtoffset);
    }
 
    /*
     * See if it's safe to get rid of the MergeAppend entirely.  For this to
     * be safe, there must be only one child plan and that child plan's
     * parallel awareness must match the MergeAppend's.  The reason for the
     * latter is that if the MergeAppend is parallel aware and the child is
     * not, then the calling plan may execute the non-parallel aware child
     * multiple times.  (If you change these rules, update
     * create_merge_append_path to match.)
     */
    if (list_length(mplan->mergeplans) == 1)
    {
        Plan       *p = (Plan *) linitial(mplan->mergeplans);
 
        if (p->parallel_aware == mplan->plan.parallel_aware)
            return clean_up_removed_plan_level((Plan *) mplan, p);
    }
 
    /*
     * Otherwise, clean up the MergeAppend as needed.  It's okay to do this
     * after recursing to the children, because set_dummy_tlist_references
     * doesn't look at those.
     */
    set_dummy_tlist_references((Plan *) mplan, rtoffset);
 
    mplan->apprelids = offset_relid_set(mplan->apprelids, rtoffset);
 
    /*
     * Add PartitionPruneInfo, if any, to PlannerGlobal and update the index.
     * Also update the RT indexes present in it to add the offset.
     */
    if (mplan->part_prune_index >= 0)
        mplan->part_prune_index =
            register_partpruneinfo(root, mplan->part_prune_index, rtoffset);
 
    /* We don't need to recurse to lefttree or righttree ... */
    Assert(mplan->plan.lefttree == NULL);
    Assert(mplan->plan.righttree == NULL);
 
    return (Plan *) mplan;
}

References MergeAppend::apprelids, Assert(), clean_up_removed_plan_level(), Plan::lefttree, lfirst, linitial, list_length(), MergeAppend::mergeplans, NIL, offset_relid_set(), Plan::parallel_aware, MergeAppend::part_prune_index, MergeAppend::plan, Plan::qual, register_partpruneinfo(), Plan::righttree, root, set_dummy_tlist_references(), and set_plan_refs().

Referenced by set_plan_refs().

set_param_references()

static void set_param_references ( PlannerInfo *  root, Plan *  plan  )

static

Definition at line 2564 of file setrefs.c.

{
    Assert(IsA(plan, Gather) || IsA(plan, GatherMerge));
 
    if (plan->lefttree->extParam)
    {
        PlannerInfo *proot;
        Bitmapset  *initSetParam = NULL;
        ListCell   *l;
 
        for (proot = root; proot != NULL; proot = proot->parent_root)
        {
            foreach(l, proot->init_plans)
            {
                SubPlan    *initsubplan = (SubPlan *) lfirst(l);
                ListCell   *l2;
 
                foreach(l2, initsubplan->setParam)
                {
                    initSetParam = bms_add_member(initSetParam, lfirst_int(l2));
                }
            }
        }
 
        /*
         * Remember the list of all external initplan params that are used by
         * the children of Gather or Gather merge node.
         */
        if (IsA(plan, Gather))
            ((Gather *) plan)->initParam =
                bms_intersect(plan->lefttree->extParam, initSetParam);
        else
            ((GatherMerge *) plan)->initParam =
                bms_intersect(plan->lefttree->extParam, initSetParam);
    }
}

References Assert(), bms_add_member(), bms_intersect(), PlannerInfo::init_plans, IsA, lfirst, lfirst_int, plan, root, and SubPlan::setParam.

Referenced by set_plan_refs().

set_plan_references()

Plan * set_plan_references	(	PlannerInfo *	root,
		Plan *	plan
	)

Definition at line 288 of file setrefs.c.

{
    Plan       *result;
    PlannerGlobal *glob = root->glob;
    int         rtoffset = list_length(glob->finalrtable);
    ListCell   *lc;
 
    /*
     * Add all the query's RTEs to the flattened rangetable.  The live ones
     * will have their rangetable indexes increased by rtoffset.  (Additional
     * RTEs, not referenced by the Plan tree, might get added after those.)
     */
    add_rtes_to_flat_rtable(root, false);
 
    /*
     * Adjust RT indexes of PlanRowMarks and add to final rowmarks list
     */
    foreach(lc, root->rowMarks)
    {
        PlanRowMark *rc = lfirst_node(PlanRowMark, lc);
        PlanRowMark *newrc;
 
        /* flat copy is enough since all fields are scalars */
        newrc = (PlanRowMark *) palloc(sizeof(PlanRowMark));
        memcpy(newrc, rc, sizeof(PlanRowMark));
 
        /* adjust indexes ... but *not* the rowmarkId */
        newrc->rti += rtoffset;
        newrc->prti += rtoffset;
 
        glob->finalrowmarks = lappend(glob->finalrowmarks, newrc);
    }
 
    /*
     * Adjust RT indexes of AppendRelInfos and add to final appendrels list.
     * We assume the AppendRelInfos were built during planning and don't need
     * to be copied.
     */
    foreach(lc, root->append_rel_list)
    {
        AppendRelInfo *appinfo = lfirst_node(AppendRelInfo, lc);
 
        /* adjust RT indexes */
        appinfo->parent_relid += rtoffset;
        appinfo->child_relid += rtoffset;
 
        /*
         * Rather than adjust the translated_vars entries, just drop 'em.
         * Neither the executor nor EXPLAIN currently need that data.
         */
        appinfo->translated_vars = NIL;
 
        glob->appendRelations = lappend(glob->appendRelations, appinfo);
    }
 
    /* If needed, create workspace for processing AlternativeSubPlans */
    if (root->hasAlternativeSubPlans)
    {
        root->isAltSubplan = (bool *)
            palloc0(list_length(glob->subplans) * sizeof(bool));
        root->isUsedSubplan = (bool *)
            palloc0(list_length(glob->subplans) * sizeof(bool));
    }
 
    /* Now fix the Plan tree */
    result = set_plan_refs(root, plan, rtoffset);
 
    /*
     * If we have AlternativeSubPlans, it is likely that we now have some
     * unreferenced subplans in glob->subplans.  To avoid expending cycles on
     * those subplans later, get rid of them by setting those list entries to
     * NULL.  (Note: we can't do this immediately upon processing an
     * AlternativeSubPlan, because there may be multiple copies of the
     * AlternativeSubPlan, and they can get resolved differently.)
     */
    if (root->hasAlternativeSubPlans)
    {
        foreach(lc, glob->subplans)
        {
            int         ndx = foreach_current_index(lc);
 
            /*
             * If it was used by some AlternativeSubPlan in this query level,
             * but wasn't selected as best by any AlternativeSubPlan, then we
             * don't need it.  Do not touch subplans that aren't parts of
             * AlternativeSubPlans.
             */
            if (root->isAltSubplan[ndx] && !root->isUsedSubplan[ndx])
                lfirst(lc) = NULL;
        }
    }
 
    return result;
}

References add_rtes_to_flat_rtable(), PlannerGlobal::appendRelations, AppendRelInfo::child_relid, PlannerGlobal::finalrowmarks, PlannerGlobal::finalrtable, foreach_current_index, lappend(), lfirst, lfirst_node, list_length(), NIL, palloc(), palloc0(), AppendRelInfo::parent_relid, plan, PlanRowMark::prti, root, PlanRowMark::rti, set_plan_refs(), PlannerGlobal::subplans, and AppendRelInfo::translated_vars.

Referenced by set_subqueryscan_references(), and standard_planner().

set_plan_refs()

static Plan * set_plan_refs ( PlannerInfo *  root, Plan *  plan, int  rtoffset  )

static

Definition at line 615 of file setrefs.c.

{
    ListCell   *l;
 
    if (plan == NULL)
        return NULL;
 
    /* Assign this node a unique ID. */
    plan->plan_node_id = root->glob->lastPlanNodeId++;
 
    /*
     * Plan-type-specific fixes
     */
    switch (nodeTag(plan))
    {
        case T_SeqScan:
            {
                SeqScan    *splan = (SeqScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_SampleScan:
            {
                SampleScan *splan = (SampleScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->tablesample = (TableSampleClause *)
                    fix_scan_expr(root, (Node *) splan->tablesample,
                                  rtoffset, 1);
            }
            break;
        case T_IndexScan:
            {
                IndexScan  *splan = (IndexScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->indexqual =
                    fix_scan_list(root, splan->indexqual,
                                  rtoffset, 1);
                splan->indexqualorig =
                    fix_scan_list(root, splan->indexqualorig,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->indexorderby =
                    fix_scan_list(root, splan->indexorderby,
                                  rtoffset, 1);
                splan->indexorderbyorig =
                    fix_scan_list(root, splan->indexorderbyorig,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_IndexOnlyScan:
            {
                IndexOnlyScan *splan = (IndexOnlyScan *) plan;
 
                return set_indexonlyscan_references(root, splan, rtoffset);
            }
            break;
        case T_BitmapIndexScan:
            {
                BitmapIndexScan *splan = (BitmapIndexScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                /* no need to fix targetlist and qual */
                Assert(splan->scan.plan.targetlist == NIL);
                Assert(splan->scan.plan.qual == NIL);
                splan->indexqual =
                    fix_scan_list(root, splan->indexqual, rtoffset, 1);
                splan->indexqualorig =
                    fix_scan_list(root, splan->indexqualorig,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_BitmapHeapScan:
            {
                BitmapHeapScan *splan = (BitmapHeapScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->bitmapqualorig =
                    fix_scan_list(root, splan->bitmapqualorig,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_TidScan:
            {
                TidScan    *splan = (TidScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->tidquals =
                    fix_scan_list(root, splan->tidquals,
                                  rtoffset, 1);
            }
            break;
        case T_TidRangeScan:
            {
                TidRangeScan *splan = (TidRangeScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->tidrangequals =
                    fix_scan_list(root, splan->tidrangequals,
                                  rtoffset, 1);
            }
            break;
        case T_SubqueryScan:
            /* Needs special treatment, see comments below */
            return set_subqueryscan_references(root,
                                               (SubqueryScan *) plan,
                                               rtoffset);
        case T_FunctionScan:
            {
                FunctionScan *splan = (FunctionScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->functions =
                    fix_scan_list(root, splan->functions, rtoffset, 1);
            }
            break;
        case T_TableFuncScan:
            {
                TableFuncScan *splan = (TableFuncScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->tablefunc = (TableFunc *)
                    fix_scan_expr(root, (Node *) splan->tablefunc,
                                  rtoffset, 1);
            }
            break;
        case T_ValuesScan:
            {
                ValuesScan *splan = (ValuesScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
                splan->values_lists =
                    fix_scan_list(root, splan->values_lists,
                                  rtoffset, 1);
            }
            break;
        case T_CteScan:
            {
                CteScan    *splan = (CteScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_NamedTuplestoreScan:
            {
                NamedTuplestoreScan *splan = (NamedTuplestoreScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_WorkTableScan:
            {
                WorkTableScan *splan = (WorkTableScan *) plan;
 
                splan->scan.scanrelid += rtoffset;
                splan->scan.plan.targetlist =
                    fix_scan_list(root, splan->scan.plan.targetlist,
                                  rtoffset, NUM_EXEC_TLIST(plan));
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual,
                                  rtoffset, NUM_EXEC_QUAL(plan));
            }
            break;
        case T_ForeignScan:
            set_foreignscan_references(root, (ForeignScan *) plan, rtoffset);
            break;
        case T_CustomScan:
            set_customscan_references(root, (CustomScan *) plan, rtoffset);
            break;
 
        case T_NestLoop:
        case T_MergeJoin:
        case T_HashJoin:
            set_join_references(root, (Join *) plan, rtoffset);
            break;
 
        case T_Gather:
        case T_GatherMerge:
            {
                set_upper_references(root, plan, rtoffset);
                set_param_references(root, plan);
            }
            break;
 
        case T_Hash:
            set_hash_references(root, plan, rtoffset);
            break;
 
        case T_Memoize:
            {
                Memoize    *mplan = (Memoize *) plan;
 
                /*
                 * Memoize does not evaluate its targetlist.  It just uses the
                 * same targetlist from its outer subnode.
                 */
                set_dummy_tlist_references(plan, rtoffset);
 
                mplan->param_exprs = fix_scan_list(root, mplan->param_exprs,
                                                   rtoffset,
                                                   NUM_EXEC_TLIST(plan));
                break;
            }
 
        case T_Material:
        case T_Sort:
        case T_IncrementalSort:
        case T_Unique:
        case T_SetOp:
 
            /*
             * These plan types don't actually bother to evaluate their
             * targetlists, because they just return their unmodified input
             * tuples.  Even though the targetlist won't be used by the
             * executor, we fix it up for possible use by EXPLAIN (not to
             * mention ease of debugging --- wrong varnos are very confusing).
             */
            set_dummy_tlist_references(plan, rtoffset);
 
            /*
             * Since these plan types don't check quals either, we should not
             * find any qual expression attached to them.
             */
            Assert(plan->qual == NIL);
            break;
        case T_LockRows:
            {
                LockRows   *splan = (LockRows *) plan;
 
                /*
                 * Like the plan types above, LockRows doesn't evaluate its
                 * tlist or quals.  But we have to fix up the RT indexes in
                 * its rowmarks.
                 */
                set_dummy_tlist_references(plan, rtoffset);
                Assert(splan->plan.qual == NIL);
 
                foreach(l, splan->rowMarks)
                {
                    PlanRowMark *rc = (PlanRowMark *) lfirst(l);
 
                    rc->rti += rtoffset;
                    rc->prti += rtoffset;
                }
            }
            break;
        case T_Limit:
            {
                Limit      *splan = (Limit *) plan;
 
                /*
                 * Like the plan types above, Limit doesn't evaluate its tlist
                 * or quals.  It does have live expressions for limit/offset,
                 * however; and those cannot contain subplan variable refs, so
                 * fix_scan_expr works for them.
                 */
                set_dummy_tlist_references(plan, rtoffset);
                Assert(splan->plan.qual == NIL);
 
                splan->limitOffset =
                    fix_scan_expr(root, splan->limitOffset, rtoffset, 1);
                splan->limitCount =
                    fix_scan_expr(root, splan->limitCount, rtoffset, 1);
            }
            break;
        case T_Agg:
            {
                Agg        *agg = (Agg *) plan;
 
                /*
                 * If this node is combining partial-aggregation results, we
                 * must convert its Aggrefs to contain references to the
                 * partial-aggregate subexpressions that will be available
                 * from the child plan node.
                 */
                if (DO_AGGSPLIT_COMBINE(agg->aggsplit))
                {
                    plan->targetlist = (List *)
                        convert_combining_aggrefs((Node *) plan->targetlist,
                                                  NULL);
                    plan->qual = (List *)
                        convert_combining_aggrefs((Node *) plan->qual,
                                                  NULL);
                }
 
                set_upper_references(root, plan, rtoffset);
            }
            break;
        case T_Group:
            set_upper_references(root, plan, rtoffset);
            break;
        case T_WindowAgg:
            {
                WindowAgg  *wplan = (WindowAgg *) plan;
 
                /*
                 * Adjust the WindowAgg's run conditions by swapping the
                 * WindowFuncs references out to instead reference the Var in
                 * the scan slot so that when the executor evaluates the
                 * runCondition, it receives the WindowFunc's value from the
                 * slot that the result has just been stored into rather than
                 * evaluating the WindowFunc all over again.
                 */
                wplan->runCondition = set_windowagg_runcondition_references(root,
                                                                            wplan->runCondition,
                                                                            (Plan *) wplan);
 
                set_upper_references(root, plan, rtoffset);
 
                /*
                 * Like Limit node limit/offset expressions, WindowAgg has
                 * frame offset expressions, which cannot contain subplan
                 * variable refs, so fix_scan_expr works for them.
                 */
                wplan->startOffset =
                    fix_scan_expr(root, wplan->startOffset, rtoffset, 1);
                wplan->endOffset =
                    fix_scan_expr(root, wplan->endOffset, rtoffset, 1);
                wplan->runCondition = fix_scan_list(root,
                                                    wplan->runCondition,
                                                    rtoffset,
                                                    NUM_EXEC_TLIST(plan));
                wplan->runConditionOrig = fix_scan_list(root,
                                                        wplan->runConditionOrig,
                                                        rtoffset,
                                                        NUM_EXEC_TLIST(plan));
            }
            break;
        case T_Result:
            {
                Result     *splan = (Result *) plan;
 
                /*
                 * Result may or may not have a subplan; if not, it's more
                 * like a scan node than an upper node.
                 */
                if (splan->plan.lefttree != NULL)
                    set_upper_references(root, plan, rtoffset);
                else
                {
                    /*
                     * The tlist of a childless Result could contain
                     * unresolved ROWID_VAR Vars, in case it's representing a
                     * target relation which is completely empty because of
                     * constraint exclusion.  Replace any such Vars by null
                     * constants, as though they'd been resolved for a leaf
                     * scan node that doesn't support them.  We could have
                     * fix_scan_expr do this, but since the case is only
                     * expected to occur here, it seems safer to special-case
                     * it here and keep the assertions that ROWID_VARs
                     * shouldn't be seen by fix_scan_expr.
                     */
                    foreach(l, splan->plan.targetlist)
                    {
                        TargetEntry *tle = (TargetEntry *) lfirst(l);
                        Var        *var = (Var *) tle->expr;
 
                        if (var && IsA(var, Var) && var->varno == ROWID_VAR)
                            tle->expr = (Expr *) makeNullConst(var->vartype,
                                                               var->vartypmod,
                                                               var->varcollid);
                    }
 
                    splan->plan.targetlist =
                        fix_scan_list(root, splan->plan.targetlist,
                                      rtoffset, NUM_EXEC_TLIST(plan));
                    splan->plan.qual =
                        fix_scan_list(root, splan->plan.qual,
                                      rtoffset, NUM_EXEC_QUAL(plan));
                }
                /* resconstantqual can't contain any subplan variable refs */
                splan->resconstantqual =
                    fix_scan_expr(root, splan->resconstantqual, rtoffset, 1);
            }
            break;
        case T_ProjectSet:
            set_upper_references(root, plan, rtoffset);
            break;
        case T_ModifyTable:
            {
                ModifyTable *splan = (ModifyTable *) plan;
                Plan       *subplan = outerPlan(splan);
 
                Assert(splan->plan.targetlist == NIL);
                Assert(splan->plan.qual == NIL);
 
                splan->withCheckOptionLists =
                    fix_scan_list(root, splan->withCheckOptionLists,
                                  rtoffset, 1);
 
                if (splan->returningLists)
                {
                    List       *newRL = NIL;
                    ListCell   *lcrl,
                               *lcrr;
 
                    /*
                     * Pass each per-resultrel returningList through
                     * set_returning_clause_references().
                     */
                    Assert(list_length(splan->returningLists) == list_length(splan->resultRelations));
                    forboth(lcrl, splan->returningLists,
                            lcrr, splan->resultRelations)
                    {
                        List       *rlist = (List *) lfirst(lcrl);
                        Index       resultrel = lfirst_int(lcrr);
 
                        rlist = set_returning_clause_references(root,
                                                                rlist,
                                                                subplan,
                                                                resultrel,
                                                                rtoffset);
                        newRL = lappend(newRL, rlist);
                    }
                    splan->returningLists = newRL;
 
                    /*
                     * Set up the visible plan targetlist as being the same as
                     * the first RETURNING list. This is for the use of
                     * EXPLAIN; the executor won't pay any attention to the
                     * targetlist.  We postpone this step until here so that
                     * we don't have to do set_returning_clause_references()
                     * twice on identical targetlists.
                     */
                    splan->plan.targetlist = copyObject(linitial(newRL));
                }
 
                /*
                 * We treat ModifyTable with ON CONFLICT as a form of 'pseudo
                 * join', where the inner side is the EXCLUDED tuple.
                 * Therefore use fix_join_expr to setup the relevant variables
                 * to INNER_VAR. We explicitly don't create any OUTER_VARs as
                 * those are already used by RETURNING and it seems better to
                 * be non-conflicting.
                 */
                if (splan->onConflictSet)
                {
                    indexed_tlist *itlist;
 
                    itlist = build_tlist_index(splan->exclRelTlist);
 
                    splan->onConflictSet =
                        fix_join_expr(root, splan->onConflictSet,
                                      NULL, itlist,
                                      linitial_int(splan->resultRelations),
                                      rtoffset, NRM_EQUAL, NUM_EXEC_QUAL(plan));
 
                    splan->onConflictWhere = (Node *)
                        fix_join_expr(root, (List *) splan->onConflictWhere,
                                      NULL, itlist,
                                      linitial_int(splan->resultRelations),
                                      rtoffset, NRM_EQUAL, NUM_EXEC_QUAL(plan));
 
                    pfree(itlist);
 
                    splan->exclRelTlist =
                        fix_scan_list(root, splan->exclRelTlist, rtoffset, 1);
                }
 
                /*
                 * The MERGE statement produces the target rows by performing
                 * a right join between the target relation and the source
                 * relation (which could be a plain relation or a subquery).
                 * The INSERT and UPDATE actions of the MERGE statement
                 * require access to the columns from the source relation. We
                 * arrange things so that the source relation attributes are
                 * available as INNER_VAR and the target relation attributes
                 * are available from the scan tuple.
                 */
                if (splan->mergeActionLists != NIL)
                {
                    List       *newMJC = NIL;
                    ListCell   *lca,
                               *lcj,
                               *lcr;
 
                    /*
                     * Fix the targetList of individual action nodes so that
                     * the so-called "source relation" Vars are referenced as
                     * INNER_VAR.  Note that for this to work correctly during
                     * execution, the ecxt_innertuple must be set to the tuple
                     * obtained by executing the subplan, which is what
                     * constitutes the "source relation".
                     *
                     * We leave the Vars from the result relation (i.e. the
                     * target relation) unchanged i.e. those Vars would be
                     * picked from the scan slot. So during execution, we must
                     * ensure that ecxt_scantuple is setup correctly to refer
                     * to the tuple from the target relation.
                     */
                    indexed_tlist *itlist;
 
                    itlist = build_tlist_index(subplan->targetlist);
 
                    forthree(lca, splan->mergeActionLists,
                             lcj, splan->mergeJoinConditions,
                             lcr, splan->resultRelations)
                    {
                        List       *mergeActionList = lfirst(lca);
                        Node       *mergeJoinCondition = lfirst(lcj);
                        Index       resultrel = lfirst_int(lcr);
 
                        foreach(l, mergeActionList)
                        {
                            MergeAction *action = (MergeAction *) lfirst(l);
 
                            /* Fix targetList of each action. */
                            action->targetList = fix_join_expr(root,
                                                               action->targetList,
                                                               NULL, itlist,
                                                               resultrel,
                                                               rtoffset,
                                                               NRM_EQUAL,
                                                               NUM_EXEC_TLIST(plan));
 
                            /* Fix quals too. */
                            action->qual = (Node *) fix_join_expr(root,
                                                                  (List *) action->qual,
                                                                  NULL, itlist,
                                                                  resultrel,
                                                                  rtoffset,
                                                                  NRM_EQUAL,
                                                                  NUM_EXEC_QUAL(plan));
                        }
 
                        /* Fix join condition too. */
                        mergeJoinCondition = (Node *)
                            fix_join_expr(root,
                                          (List *) mergeJoinCondition,
                                          NULL, itlist,
                                          resultrel,
                                          rtoffset,
                                          NRM_EQUAL,
                                          NUM_EXEC_QUAL(plan));
                        newMJC = lappend(newMJC, mergeJoinCondition);
                    }
                    splan->mergeJoinConditions = newMJC;
                }
 
                splan->nominalRelation += rtoffset;
                if (splan->rootRelation)
                    splan->rootRelation += rtoffset;
                splan->exclRelRTI += rtoffset;
 
                foreach(l, splan->resultRelations)
                {
                    lfirst_int(l) += rtoffset;
                }
                foreach(l, splan->rowMarks)
                {
                    PlanRowMark *rc = (PlanRowMark *) lfirst(l);
 
                    rc->rti += rtoffset;
                    rc->prti += rtoffset;
                }
 
                /*
                 * Append this ModifyTable node's final result relation RT
                 * index(es) to the global list for the plan.
                 */
                root->glob->resultRelations =
                    list_concat(root->glob->resultRelations,
                                splan->resultRelations);
                if (splan->rootRelation)
                {
                    root->glob->resultRelations =
                        lappend_int(root->glob->resultRelations,
                                    splan->rootRelation);
                }
            }
            break;
        case T_Append:
            /* Needs special treatment, see comments below */
            return set_append_references(root,
                                         (Append *) plan,
                                         rtoffset);
        case T_MergeAppend:
            /* Needs special treatment, see comments below */
            return set_mergeappend_references(root,
                                              (MergeAppend *) plan,
                                              rtoffset);
        case T_RecursiveUnion:
            /* This doesn't evaluate targetlist or check quals either */
            set_dummy_tlist_references(plan, rtoffset);
            Assert(plan->qual == NIL);
            break;
        case T_BitmapAnd:
            {
                BitmapAnd  *splan = (BitmapAnd *) plan;
 
                /* BitmapAnd works like Append, but has no tlist */
                Assert(splan->plan.targetlist == NIL);
                Assert(splan->plan.qual == NIL);
                foreach(l, splan->bitmapplans)
                {
                    lfirst(l) = set_plan_refs(root,
                                              (Plan *) lfirst(l),
                                              rtoffset);
                }
            }
            break;
        case T_BitmapOr:
            {
                BitmapOr   *splan = (BitmapOr *) plan;
 
                /* BitmapOr works like Append, but has no tlist */
                Assert(splan->plan.targetlist == NIL);
                Assert(splan->plan.qual == NIL);
                foreach(l, splan->bitmapplans)
                {
                    lfirst(l) = set_plan_refs(root,
                                              (Plan *) lfirst(l),
                                              rtoffset);
                }
            }
            break;
        default:
            elog(ERROR, "unrecognized node type: %d",
                 (int) nodeTag(plan));
            break;
    }
 
    /*
     * Now recurse into child plans, if any
     *
     * NOTE: it is essential that we recurse into child plans AFTER we set
     * subplan references in this plan's tlist and quals.  If we did the
     * reference-adjustments bottom-up, then we would fail to match this
     * plan's var nodes against the already-modified nodes of the children.
     */
    plan->lefttree = set_plan_refs(root, plan->lefttree, rtoffset);
    plan->righttree = set_plan_refs(root, plan->righttree, rtoffset);
 
    return plan;
}

References generate_unaccent_rules::action, Agg::aggsplit, Assert(), BitmapAnd::bitmapplans, BitmapOr::bitmapplans, BitmapHeapScan::bitmapqualorig, build_tlist_index(), convert_combining_aggrefs(), copyObject, DO_AGGSPLIT_COMBINE, elog, WindowAgg::endOffset, ERROR, ModifyTable::exclRelRTI, ModifyTable::exclRelTlist, TargetEntry::expr, fix_join_expr(), fix_scan_expr(), fix_scan_list, forboth, forthree, FunctionScan::functions, if(), IndexScan::indexorderby, IndexScan::indexorderbyorig, IndexScan::indexqual, BitmapIndexScan::indexqual, IndexScan::indexqualorig, BitmapIndexScan::indexqualorig, IsA, lappend(), lappend_int(), lca(), Plan::lefttree, lfirst, lfirst_int, Limit::limitCount, Limit::limitOffset, linitial, linitial_int, list_concat(), list_length(), makeNullConst(), ModifyTable::mergeActionLists, ModifyTable::mergeJoinConditions, NIL, nodeTag, ModifyTable::nominalRelation, NRM_EQUAL, NUM_EXEC_QUAL, NUM_EXEC_TLIST, ModifyTable::onConflictSet, ModifyTable::onConflictWhere, outerPlan, Memoize::param_exprs, pfree(), Result::plan, ModifyTable::plan, BitmapAnd::plan, BitmapOr::plan, LockRows::plan, Limit::plan, plan, PlanRowMark::prti, Plan::qual, Result::resconstantqual, ModifyTable::resultRelations, ModifyTable::returningLists, root, ModifyTable::rootRelation, ROWID_VAR, ModifyTable::rowMarks, LockRows::rowMarks, PlanRowMark::rti, WindowAgg::runCondition, WindowAgg::runConditionOrig, SeqScan::scan, SampleScan::scan, IndexScan::scan, BitmapIndexScan::scan, BitmapHeapScan::scan, TidScan::scan, TidRangeScan::scan, FunctionScan::scan, ValuesScan::scan, TableFuncScan::scan, CteScan::scan, NamedTuplestoreScan::scan, WorkTableScan::scan, Scan::scanrelid, set_append_references(), set_customscan_references(), set_dummy_tlist_references(), set_foreignscan_references(), set_hash_references(), set_indexonlyscan_references(), set_join_references(), set_mergeappend_references(), set_param_references(), set_plan_refs(), set_returning_clause_references(), set_subqueryscan_references(), set_upper_references(), set_windowagg_runcondition_references(), WindowAgg::startOffset, TableFuncScan::tablefunc, SampleScan::tablesample, Plan::targetlist, TidScan::tidquals, TidRangeScan::tidrangequals, ValuesScan::values_lists, Var::varno, and ModifyTable::withCheckOptionLists.

Referenced by set_append_references(), set_customscan_references(), set_mergeappend_references(), set_plan_references(), and set_plan_refs().

set_returning_clause_references()

static List * set_returning_clause_references ( PlannerInfo *  root, List *  rlist, Plan *  topplan, Index  resultRelation, int  rtoffset  )

static

Definition at line 3394 of file setrefs.c.

{
    indexed_tlist *itlist;
 
    /*
     * We can perform the desired Var fixup by abusing the fix_join_expr
     * machinery that formerly handled inner indexscan fixup.  We search the
     * top plan's targetlist for Vars of non-result relations, and use
     * fix_join_expr to convert RETURNING Vars into references to those tlist
     * entries, while leaving result-rel Vars as-is.
     *
     * PlaceHolderVars will also be sought in the targetlist, but no
     * more-complex expressions will be.  Note that it is not possible for a
     * PlaceHolderVar to refer to the result relation, since the result is
     * never below an outer join.  If that case could happen, we'd have to be
     * prepared to pick apart the PlaceHolderVar and evaluate its contained
     * expression instead.
     */
    itlist = build_tlist_index_other_vars(topplan->targetlist, resultRelation);
 
    rlist = fix_join_expr(root,
                          rlist,
                          itlist,
                          NULL,
                          resultRelation,
                          rtoffset,
                          NRM_EQUAL,
                          NUM_EXEC_TLIST(topplan));
 
    pfree(itlist);
 
    return rlist;
}

References build_tlist_index_other_vars(), fix_join_expr(), NRM_EQUAL, NUM_EXEC_TLIST, pfree(), root, and Plan::targetlist.

Referenced by set_plan_refs().

set_subqueryscan_references()

static Plan * set_subqueryscan_references ( PlannerInfo *  root, SubqueryScan *  plan, int  rtoffset  )

static

Definition at line 1402 of file setrefs.c.

{
    RelOptInfo *rel;
    Plan       *result;
 
    /* Need to look up the subquery's RelOptInfo, since we need its subroot */
    rel = find_base_rel(root, plan->scan.scanrelid);
 
    /* Recursively process the subplan */
    plan->subplan = set_plan_references(rel->subroot, plan->subplan);
 
    if (trivial_subqueryscan(plan))
    {
        /*
         * We can omit the SubqueryScan node and just pull up the subplan.
         */
        result = clean_up_removed_plan_level((Plan *) plan, plan->subplan);
    }
    else
    {
        /*
         * Keep the SubqueryScan node.  We have to do the processing that
         * set_plan_references would otherwise have done on it.  Notice we do
         * not do set_upper_references() here, because a SubqueryScan will
         * always have been created with correct references to its subplan's
         * outputs to begin with.
         */
        plan->scan.scanrelid += rtoffset;
        plan->scan.plan.targetlist =
            fix_scan_list(root, plan->scan.plan.targetlist,
                          rtoffset, NUM_EXEC_TLIST((Plan *) plan));
        plan->scan.plan.qual =
            fix_scan_list(root, plan->scan.plan.qual,
                          rtoffset, NUM_EXEC_QUAL((Plan *) plan));
 
        result = (Plan *) plan;
    }
 
    return result;
}

References clean_up_removed_plan_level(), find_base_rel(), fix_scan_list, NUM_EXEC_QUAL, NUM_EXEC_TLIST, plan, root, set_plan_references(), RelOptInfo::subroot, and trivial_subqueryscan().

Referenced by set_plan_refs().

set_upper_references()

static void set_upper_references ( PlannerInfo *  root, Plan *  plan, int  rtoffset  )

static

Definition at line 2476 of file setrefs.c.

{
    Plan       *subplan = plan->lefttree;
    indexed_tlist *subplan_itlist;
    List       *output_targetlist;
    ListCell   *l;
 
    subplan_itlist = build_tlist_index(subplan->targetlist);
 
    /*
     * If it's a grouping node with grouping sets, any Vars and PHVs appearing
     * in the targetlist and quals should have nullingrels that include the
     * effects of the grouping step, ie they will have nullingrels equal to
     * the input Vars/PHVs' nullingrels plus the RT index of the grouping
     * step.  In order to perform exact nullingrels matches, we remove the RT
     * index of the grouping step first.
     */
    if (IsA(plan, Agg) &&
        root->group_rtindex > 0 &&
        ((Agg *) plan)->groupingSets)
    {
        plan->targetlist = (List *)
            remove_nulling_relids((Node *) plan->targetlist,
                                  bms_make_singleton(root->group_rtindex),
                                  NULL);
        plan->qual = (List *)
            remove_nulling_relids((Node *) plan->qual,
                                  bms_make_singleton(root->group_rtindex),
                                  NULL);
    }
 
    output_targetlist = NIL;
    foreach(l, plan->targetlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(l);
        Node       *newexpr;
 
        /* If it's a sort/group item, first try to match by sortref */
        if (tle->ressortgroupref != 0)
        {
            newexpr = (Node *)
                search_indexed_tlist_for_sortgroupref(tle->expr,
                                                      tle->ressortgroupref,
                                                      subplan_itlist,
                                                      OUTER_VAR);
            if (!newexpr)
                newexpr = fix_upper_expr(root,
                                         (Node *) tle->expr,
                                         subplan_itlist,
                                         OUTER_VAR,
                                         rtoffset,
                                         NRM_EQUAL,
                                         NUM_EXEC_TLIST(plan));
        }
        else
            newexpr = fix_upper_expr(root,
                                     (Node *) tle->expr,
                                     subplan_itlist,
                                     OUTER_VAR,
                                     rtoffset,
                                     NRM_EQUAL,
                                     NUM_EXEC_TLIST(plan));
        tle = flatCopyTargetEntry(tle);
        tle->expr = (Expr *) newexpr;
        output_targetlist = lappend(output_targetlist, tle);
    }
    plan->targetlist = output_targetlist;
 
    plan->qual = (List *)
        fix_upper_expr(root,
                       (Node *) plan->qual,
                       subplan_itlist,
                       OUTER_VAR,
                       rtoffset,
                       NRM_EQUAL,
                       NUM_EXEC_QUAL(plan));
 
    pfree(subplan_itlist);
}

References bms_make_singleton(), build_tlist_index(), TargetEntry::expr, fix_upper_expr(), flatCopyTargetEntry(), IsA, lappend(), lfirst, NIL, NRM_EQUAL, NUM_EXEC_QUAL, NUM_EXEC_TLIST, OUTER_VAR, pfree(), plan, remove_nulling_relids(), TargetEntry::ressortgroupref, root, search_indexed_tlist_for_sortgroupref(), and Plan::targetlist.

Referenced by set_plan_refs().

set_windowagg_runcondition_references()

static List * set_windowagg_runcondition_references ( PlannerInfo *  root, List *  runcondition, Plan *  plan  )

static

Definition at line 3489 of file setrefs.c.

{
    List       *newlist;
    indexed_tlist *itlist;
 
    itlist = build_tlist_index(plan->targetlist);
 
    newlist = fix_windowagg_condition_expr(root, runcondition, itlist);
 
    pfree(itlist);
 
    return newlist;
}

References build_tlist_index(), fix_windowagg_condition_expr(), pfree(), plan, and root.

Referenced by set_plan_refs().

trivial_subqueryscan()

bool trivial_subqueryscan

(

SubqueryScan *

plan

)

Definition at line 1471 of file setrefs.c.

{
    int         attrno;
    ListCell   *lp,
               *lc;
 
    /* We might have detected this already; in which case reuse the result */
    if (plan->scanstatus == SUBQUERY_SCAN_TRIVIAL)
        return true;
    if (plan->scanstatus == SUBQUERY_SCAN_NONTRIVIAL)
        return false;
    Assert(plan->scanstatus == SUBQUERY_SCAN_UNKNOWN);
    /* Initially, mark the SubqueryScan as non-deletable from the plan tree */
    plan->scanstatus = SUBQUERY_SCAN_NONTRIVIAL;
 
    if (plan->scan.plan.qual != NIL)
        return false;
 
    if (list_length(plan->scan.plan.targetlist) !=
        list_length(plan->subplan->targetlist))
        return false;           /* tlists not same length */
 
    attrno = 1;
    forboth(lp, plan->scan.plan.targetlist, lc, plan->subplan->targetlist)
    {
        TargetEntry *ptle = (TargetEntry *) lfirst(lp);
        TargetEntry *ctle = (TargetEntry *) lfirst(lc);
 
        if (ptle->resjunk != ctle->resjunk)
            return false;       /* tlist doesn't match junk status */
 
        /*
         * We accept either a Var referencing the corresponding element of the
         * subplan tlist, or a Const equaling the subplan element. See
         * generate_setop_tlist() for motivation.
         */
        if (ptle->expr && IsA(ptle->expr, Var))
        {
            Var        *var = (Var *) ptle->expr;
 
            Assert(var->varno == plan->scan.scanrelid);
            Assert(var->varlevelsup == 0);
            if (var->varattno != attrno)
                return false;   /* out of order */
        }
        else if (ptle->expr && IsA(ptle->expr, Const))
        {
            if (!equal(ptle->expr, ctle->expr))
                return false;
        }
        else
            return false;
 
        attrno++;
    }
 
    /* Re-mark the SubqueryScan as deletable from the plan tree */
    plan->scanstatus = SUBQUERY_SCAN_TRIVIAL;
 
    return true;
}

References Assert(), equal(), TargetEntry::expr, forboth, IsA, lfirst, list_length(), NIL, plan, SUBQUERY_SCAN_NONTRIVIAL, SUBQUERY_SCAN_TRIVIAL, SUBQUERY_SCAN_UNKNOWN, Var::varattno, Var::varlevelsup, and Var::varno.

Referenced by mark_async_capable_plan(), and set_subqueryscan_references().