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/pathnode.h"
#include "optimizer/planmain.h"
#include "optimizer/planner.h"
#include "optimizer/tlist.h"
#include "tcop/utility.h"
#include "utils/lsyscache.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

Macros
#define	ISREGCLASSCONST(con)
#define	fix_scan_list(root, lst, rtoffset)   ((List *) fix_scan_expr(root, (Node *) (lst), rtoffset))

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, PlannerGlobal *glob)
static void	add_rte_to_flat_rtable (PlannerGlobal *glob, 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 bool	trivial_subqueryscan (SubqueryScan *plan)
static void	set_foreignscan_references (PlannerInfo *root, ForeignScan *fscan, int rtoffset)
static void	set_customscan_references (PlannerInfo *root, CustomScan *cscan, int rtoffset)
static Node *	fix_scan_expr (PlannerInfo *root, Node *node, int rtoffset)
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 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, Index newvarno, int rtoffset)
static Var *	search_indexed_tlist_for_non_var (Expr *node, indexed_tlist *itlist, Index newvarno)
static Var *	search_indexed_tlist_for_sortgroupref (Expr *node, Index sortgroupref, indexed_tlist *itlist, Index newvarno)
static List *	fix_join_expr (PlannerInfo *root, List *clauses, indexed_tlist *outer_itlist, indexed_tlist *inner_itlist, Index acceptable_rel, int rtoffset)
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, Index newvarno, int rtoffset)
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 bool	extract_query_dependencies_walker (Node *node, PlannerInfo *context)
Plan *	set_plan_references (PlannerInfo *root, Plan *plan)
static Var *	copyVar (Var *var)
static void	fix_expr_common (PlannerInfo *root, Node *node)
static Node *	fix_param_node (PlannerInfo *root, Param *p)
static indexed_tlist *	build_tlist_index_other_vars (List *tlist, Index ignore_rel)
void	record_plan_function_dependency (PlannerInfo *root, Oid funcid)
void	extract_query_dependencies (Node *query, List **relationOids, List **invalItems, bool *hasRowSecurity)

Macro Definition Documentation

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

Definition at line 81 of file setrefs.c.

Referenced by set_customscan_references(), set_foreignscan_references(), set_indexonlyscan_references(), set_plan_refs(), and set_subqueryscan_references().

#define ISREGCLASSCONST

(

con

)

Value:

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

Definition at line 77 of file setrefs.c.

Referenced by fix_expr_common().

Function Documentation

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

static

Definition at line 383 of file setrefs.c.

References RangeTblEntry::colcollations, RangeTblEntry::coltypes, RangeTblEntry::coltypmods, ereport, errcode(), errmsg(), ERROR, PlannerGlobal::finalrtable, RangeTblEntry::functions, IS_SPECIAL_VARNO, RangeTblEntry::joinaliasvars, lappend(), lappend_oid(), list_length(), NIL, NULL, palloc(), PlannerGlobal::relationOids, RangeTblEntry::relid, RTE_RELATION, RangeTblEntry::rtekind, RangeTblEntry::securityQuals, RangeTblEntry::subquery, RangeTblEntry::tablefunc, RangeTblEntry::tablesample, and RangeTblEntry::values_lists.

Referenced by add_rtes_to_flat_rtable(), and flatten_rtes_walker().

{
    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->functions = NIL;
    newrte->tablefunc = NULL;
    newrte->values_lists = NIL;
    newrte->coltypes = NIL;
    newrte->coltypmods = NIL;
    newrte->colcollations = NIL;
    newrte->securityQuals = NIL;

    glob->finalrtable = lappend(glob->finalrtable, newrte);

    /*
     * Check for RT index overflow; it's very unlikely, but if it did happen,
     * the executor would get confused by varnos that match the special varno
     * values.
     */
    if (IS_SPECIAL_VARNO(list_length(glob->finalrtable)))
        ereport(ERROR,
                (errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED),
                 errmsg("too many range table entries")));

    /*
     * If it's a plain relation RTE, add the table to relationOids.
     *
     * 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)
        glob->relationOids = lappend_oid(glob->relationOids, newrte->relid);
}

static void add_rtes_to_flat_rtable ( PlannerInfo *  root, bool  recursing  )

static

Definition at line 251 of file setrefs.c.

References add_rte_to_flat_rtable(), Assert, fetch_upper_rel(), flatten_unplanned_rtes(), PlannerInfo::glob, RangeTblEntry::inh, IS_DUMMY_REL, lfirst, NULL, PlannerInfo::parse, RelOptInfo::relid, Query::rtable, RTE_RELATION, RTE_SUBQUERY, RangeTblEntry::rtekind, PlannerInfo::simple_rel_array, RelOptInfo::subroot, and UPPERREL_FINAL.

Referenced by set_plan_references().

{
    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.
     */
    foreach(lc, root->parse->rtable)
    {
        RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);

        if (!recursing || rte->rtekind == RTE_RELATION)
            add_rte_to_flat_rtable(glob, 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++;
    }
}

static indexed_tlist * build_tlist_index ( List *  tlist )

static

Definition at line 1939 of file setrefs.c.

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

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

{
    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++;
        }
        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;
}

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

static

Definition at line 1989 of file setrefs.c.

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

Referenced by set_returning_clause_references().

{
    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++;
            }
        }
        else if (tle->expr && IsA(tle->expr, PlaceHolderVar))
            itlist->has_ph_vars = true;
    }

    itlist->num_vars = (vinfo - itlist->vars);

    return itlist;
}

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

static

Definition at line 1804 of file setrefs.c.

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

Referenced by set_plan_refs().

{
    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,
                                   (void *) context);
}

static Var* copyVar ( Var *  var )

inlinestatic

Definition at line 1334 of file setrefs.c.

References palloc().

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

{
    Var        *newvar = (Var *) palloc(sizeof(Var));

    *newvar = *var;
    return newvar;
}

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

Definition at line 2534 of file setrefs.c.

References PlannerGlobal::dependsOnRole, extract_query_dependencies_walker(), PlannerInfo::glob, PlannerGlobal::invalItems, MemSet, NIL, PlannerGlobal::relationOids, T_PlannerGlobal, T_PlannerInfo, PlannerGlobal::type, and PlannerInfo::type.

Referenced by CompleteCachedPlan(), and RevalidateCachedQuery().

{
    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;
}

static bool extract_query_dependencies_walker ( Node *  node, PlannerInfo *  context  )

static

Definition at line 2562 of file setrefs.c.

References Assert, CMD_UTILITY, Query::commandType, PlannerGlobal::dependsOnRole, expression_tree_walker(), fix_expr_common(), PlannerInfo::glob, Query::hasRowSecurity, IsA, lappend_oid(), lfirst, NULL, OidIsValid, query_tree_walker(), PlannerGlobal::relationOids, RangeTblEntry::relid, Query::rtable, RTE_NAMEDTUPLESTORE, RTE_RELATION, RangeTblEntry::rtekind, UtilityContainsQuery(), and Query::utilityStmt.

Referenced by extract_query_dependencies().

{
    if (node == NULL)
        return false;
    Assert(!IsA(node, PlaceHolderVar));
    /* Extract function dependencies and check for regclass Consts */
    fix_expr_common(context, node);
    if (IsA(node, Query))
    {
        Query      *query = (Query *) node;
        ListCell   *lc;

        if (query->commandType == CMD_UTILITY)
        {
            /*
             * Ignore utility statements, except those (such as EXPLAIN) that
             * contain a parsed-but-not-planned 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)
                context->glob->relationOids =
                    lappend_oid(context->glob->relationOids, rte->relid);
            else if (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,
                                 (void *) context, 0);
    }
    return expression_tree_walker(node, extract_query_dependencies_walker,
                                  (void *) context);
}

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

static

Definition at line 1356 of file setrefs.c.

References Assert, GroupingFunc::cols, Const::constvalue, DatumGetObjectId, equal(), PlannerInfo::glob, PlannerInfo::grouping_map, IsA, ISREGCLASSCONST, lappend_int(), lappend_oid(), lfirst_int, NIL, OidIsValid, record_plan_function_dependency(), GroupingFunc::refs, PlannerGlobal::relationOids, 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().

{
    /* 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))
    {
        set_sa_opfuncid((ScalarArrayOpExpr *) node);
        record_plan_function_dependency(root,
                                        ((ScalarArrayOpExpr *) node)->opfuncid);
    }
    else if (IsA(node, ArrayCoerceExpr))
    {
        if (OidIsValid(((ArrayCoerceExpr *) node)->elemfuncid))
            record_plan_function_dependency(root,
                                            ((ArrayCoerceExpr *) node)->elemfuncid);
    }
    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;
        }
    }
}

static List * fix_join_expr ( PlannerInfo *  root, List *  clauses, indexed_tlist *  outer_itlist, indexed_tlist *  inner_itlist, Index  acceptable_rel, int  rtoffset  )

static

Definition at line 2185 of file setrefs.c.

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

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

{
    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;
    return (List *) fix_join_expr_mutator((Node *) clauses, &context);
}

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

static

Definition at line 2203 of file setrefs.c.

References fix_join_expr_context::acceptable_rel, copyVar(), elog, ERROR, expression_tree_mutator(), fix_expr_common(), fix_param_node(), indexed_tlist::has_non_vars, indexed_tlist::has_ph_vars, fix_join_expr_context::inner_itlist, INNER_VAR, IsA, NULL, fix_join_expr_context::outer_itlist, OUTER_VAR, PlaceHolderVar::phexpr, fix_join_expr_context::root, fix_join_expr_context::rtoffset, search_indexed_tlist_for_non_var(), search_indexed_tlist_for_var(), Var::varno, and Var::varnoold.

Referenced by fix_join_expr().

{
    Var        *newvar;

    if (node == NULL)
        return NULL;
    if (IsA(node, Var))
    {
        Var        *var = (Var *) node;

        /* 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);
            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);
            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->varnoold > 0)
                var->varnoold += 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_non_var((Expr *) phv,
                                                      context->outer_itlist,
                                                      OUTER_VAR);
            if (newvar)
                return (Node *) newvar;
        }
        if (context->inner_itlist && context->inner_itlist->has_ph_vars)
        {
            newvar = search_indexed_tlist_for_non_var((Expr *) phv,
                                                      context->inner_itlist,
                                                      INNER_VAR);
            if (newvar)
                return (Node *) newvar;
        }

        /* If not supplied by input plans, evaluate the contained expr */
        return fix_join_expr_mutator((Node *) phv->phexpr, context);
    }
    if (IsA(node, Param))
        return fix_param_node(context->root, (Param *) node);
    /* 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;
    }
    fix_expr_common(context->root, node);
    return expression_tree_mutator(node,
                                   fix_join_expr_mutator,
                                   (void *) context);
}

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

static

Definition at line 1450 of file setrefs.c.

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

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

{
    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);
}

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

static

Definition at line 1480 of file setrefs.c.

References fix_scan_expr_mutator(), fix_scan_expr_walker(), PlannerInfo::glob, PlannerGlobal::lastPHId, PlannerInfo::minmax_aggs, PlannerInfo::multiexpr_params, NIL, fix_scan_expr_context::root, and fix_scan_expr_context::rtoffset.

Referenced by set_plan_refs().

{
    fix_scan_expr_context context;

    context.root = root;
    context.rtoffset = rtoffset;

    if (rtoffset != 0 ||
        root->multiexpr_params != NIL ||
        root->glob->lastPHId != 0 ||
        root->minmax_aggs != NIL)
    {
        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.  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;
    }
}

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

static

Definition at line 1512 of file setrefs.c.

References Aggref::aggfnoid, MinMaxAggInfo::aggfnoid, Aggref::args, Assert, copyObject, copyVar(), CurrentOfExpr::cvarno, equal(), TargetEntry::expr, expression_tree_mutator(), fix_expr_common(), fix_param_node(), INNER_VAR, IS_SPECIAL_VARNO, IsA, lfirst, linitial, list_length(), PlannerInfo::minmax_aggs, NIL, NULL, OUTER_VAR, MinMaxAggInfo::param, PlaceHolderVar::phexpr, fix_scan_expr_context::root, fix_scan_expr_context::rtoffset, MinMaxAggInfo::target, Var::varlevelsup, Var::varno, and Var::varnoold.

Referenced by fix_scan_expr().

{
    if (node == NULL)
        return NULL;
    if (IsA(node, Var))
    {
        Var        *var = copyVar((Var *) node);

        Assert(var->varlevelsup == 0);

        /*
         * We should not see any Vars marked INNER_VAR or OUTER_VAR.  But an
         * indexqual expression could contain INDEX_VAR Vars.
         */
        Assert(var->varno != INNER_VAR);
        Assert(var->varno != OUTER_VAR);
        if (!IS_SPECIAL_VARNO(var->varno))
            var->varno += context->rtoffset;
        if (var->varnoold > 0)
            var->varnoold += 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;

        /* See if the Aggref should be replaced by a Param */
        if (context->root->minmax_aggs != NIL &&
            list_length(aggref->args) == 1)
        {
            TargetEntry *curTarget = (TargetEntry *) linitial(aggref->args);
            ListCell   *lc;

            foreach(lc, context->root->minmax_aggs)
            {
                MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);

                if (mminfo->aggfnoid == aggref->aggfnoid &&
                    equal(mminfo->target, curTarget->expr))
                    return (Node *) copyObject(mminfo->param);
            }
        }
        /* If no match, just fall through to process it normally */
    }
    if (IsA(node, CurrentOfExpr))
    {
        CurrentOfExpr *cexpr = (CurrentOfExpr *) copyObject(node);

        Assert(cexpr->cvarno != INNER_VAR);
        Assert(cexpr->cvarno != OUTER_VAR);
        if (!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;

        return fix_scan_expr_mutator((Node *) phv->phexpr, context);
    }
    fix_expr_common(context->root, node);
    return expression_tree_mutator(node, fix_scan_expr_mutator,
                                   (void *) context);
}

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

static

Definition at line 1581 of file setrefs.c.

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

Referenced by fix_scan_expr().

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

static Node * fix_upper_expr ( PlannerInfo *  root, Node *  node, indexed_tlist *  subplan_itlist, Index  newvarno, int  rtoffset  )

static

Definition at line 2329 of file setrefs.c.

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

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

{
    fix_upper_expr_context context;

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

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

static

Definition at line 2345 of file setrefs.c.

References Aggref::aggfnoid, MinMaxAggInfo::aggfnoid, Aggref::args, copyObject, elog, equal(), ERROR, TargetEntry::expr, expression_tree_mutator(), fix_expr_common(), fix_param_node(), indexed_tlist::has_non_vars, indexed_tlist::has_ph_vars, IsA, lfirst, linitial, list_length(), PlannerInfo::minmax_aggs, fix_upper_expr_context::newvarno, NIL, NULL, MinMaxAggInfo::param, PlaceHolderVar::phexpr, fix_upper_expr_context::root, fix_upper_expr_context::rtoffset, search_indexed_tlist_for_non_var(), search_indexed_tlist_for_var(), fix_upper_expr_context::subplan_itlist, and MinMaxAggInfo::target.

Referenced by fix_upper_expr().

{
    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);
        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_non_var((Expr *) phv,
                                                      context->subplan_itlist,
                                                      context->newvarno);
            if (newvar)
                return (Node *) newvar;
        }
        /* If not supplied by input plan, evaluate the contained expr */
        return fix_upper_expr_mutator((Node *) phv->phexpr, context);
    }
    if (IsA(node, Param))
        return fix_param_node(context->root, (Param *) node);
    if (IsA(node, Aggref))
    {
        Aggref     *aggref = (Aggref *) node;

        /* See if the Aggref should be replaced by a Param */
        if (context->root->minmax_aggs != NIL &&
            list_length(aggref->args) == 1)
        {
            TargetEntry *curTarget = (TargetEntry *) linitial(aggref->args);
            ListCell   *lc;

            foreach(lc, context->root->minmax_aggs)
            {
                MinMaxAggInfo *mminfo = (MinMaxAggInfo *) lfirst(lc);

                if (mminfo->aggfnoid == aggref->aggfnoid &&
                    equal(mminfo->target, curTarget->expr))
                    return (Node *) copyObject(mminfo->param);
            }
        }
        /* If no match, just fall through to process it normally */
    }
    /* 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;
    }
    fix_expr_common(context->root, node);
    return expression_tree_mutator(node,
                                   fix_upper_expr_mutator,
                                   (void *) context);
}

static bool flatten_rtes_walker ( Node *  node, PlannerGlobal *  glob  )

static

Definition at line 347 of file setrefs.c.

References add_rte_to_flat_rtable(), expression_tree_walker(), IsA, NULL, QTW_EXAMINE_RTES, query_tree_walker(), RTE_RELATION, and RangeTblEntry::rtekind.

Referenced by flatten_unplanned_rtes().

{
    if (node == NULL)
        return false;
    if (IsA(node, RangeTblEntry))
    {
        RangeTblEntry *rte = (RangeTblEntry *) node;

        /* As above, we need only save relation RTEs */
        if (rte->rtekind == RTE_RELATION)
            add_rte_to_flat_rtable(glob, rte);
        return false;
    }
    if (IsA(node, Query))
    {
        /* Recurse into subselects */
        return query_tree_walker((Query *) node,
                                 flatten_rtes_walker,
                                 (void *) glob,
                                 QTW_EXAMINE_RTES);
    }
    return expression_tree_walker(node, flatten_rtes_walker,
                                  (void *) glob);
}

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

static

Definition at line 337 of file setrefs.c.

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

Referenced by add_rtes_to_flat_rtable().

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

void record_plan_function_dependency	(	PlannerInfo *	root,
		Oid	funcid
	)

Definition at line 2496 of file setrefs.c.

References PlanInvalItem::cacheId, FirstBootstrapObjectId, GetSysCacheHashValue1, PlannerInfo::glob, PlanInvalItem::hashValue, PlannerGlobal::invalItems, lappend(), makeNode, ObjectIdGetDatum, and PROCOID.

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

{
    /*
     * 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 FirstBootstrapObjectId.
     * Note that the OID generator guarantees never to generate such an OID
     * after startup, even at OID wraparound.
     */
    if (funcid >= (Oid) FirstBootstrapObjectId)
    {
        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);
    }
}

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

static

Definition at line 2080 of file setrefs.c.

References IsA, makeVarFromTargetEntry(), NULL, indexed_tlist::tlist, tlist_member(), Var::varnoold, and Var::varoattno.

Referenced by fix_join_expr_mutator(), and fix_upper_expr_mutator().

{
    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->varnoold = 0;   /* wasn't ever a plain Var */
        newvar->varoattno = 0;
        return newvar;
    }
    return NULL;                /* no match */
}

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

static

Definition at line 2121 of file setrefs.c.

References equal(), TargetEntry::expr, lfirst, makeVarFromTargetEntry(), NULL, TargetEntry::ressortgroupref, indexed_tlist::tlist, Var::varnoold, and Var::varoattno.

Referenced by set_upper_references().

{
    ListCell   *lc;

    foreach(lc, itlist->tlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(lc);

        /* The equal() check should be redundant, but let's be paranoid */
        if (tle->ressortgroupref == sortgroupref &&
            equal(node, tle->expr))
        {
            /* Found a matching subplan output expression */
            Var        *newvar;

            newvar = makeVarFromTargetEntry(newvarno, tle);
            newvar->varnoold = 0;   /* wasn't ever a plain Var */
            newvar->varoattno = 0;
            return newvar;
        }
    }
    return NULL;                /* no match */
}

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

static

Definition at line 2040 of file setrefs.c.

References copyVar(), i, NULL, indexed_tlist::num_vars, tlist_vinfo::resno, tlist_vinfo::varattno, Var::varattno, tlist_vinfo::varno, Var::varno, Var::varnoold, and indexed_tlist::vars.

Referenced by fix_join_expr_mutator(), and fix_upper_expr_mutator().

{
    Index       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);

            newvar->varno = newvarno;
            newvar->varattno = vinfo->resno;
            if (newvar->varnoold > 0)
                newvar->varnoold += rtoffset;
            return newvar;
        }
        vinfo++;
    }
    return NULL;                /* no match */
}

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

static

Definition at line 1259 of file setrefs.c.

References bms_add_member(), bms_next_member(), build_tlist_index(), CustomScan::custom_exprs, CustomScan::custom_plans, CustomScan::custom_relids, CustomScan::custom_scan_tlist, fix_scan_list, fix_upper_expr(), INDEX_VAR, lfirst, NIL, NULL, pfree(), Scan::plan, Plan::qual, CustomScan::scan, Scan::scanrelid, set_plan_refs(), and Plan::targetlist.

Referenced by set_plan_refs().

{
    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);
        cscan->scan.plan.qual = (List *)
            fix_upper_expr(root,
                           (Node *) cscan->scan.plan.qual,
                           itlist,
                           INDEX_VAR,
                           rtoffset);
        cscan->custom_exprs = (List *)
            fix_upper_expr(root,
                           (Node *) cscan->custom_exprs,
                           itlist,
                           INDEX_VAR,
                           rtoffset);
        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);
    }
    else
    {
        /* Adjust tlist, qual, custom_exprs in the standard way */
        cscan->scan.plan.targetlist =
            fix_scan_list(root, cscan->scan.plan.targetlist, rtoffset);
        cscan->scan.plan.qual =
            fix_scan_list(root, cscan->scan.plan.qual, rtoffset);
        cscan->custom_exprs =
            fix_scan_list(root, cscan->custom_exprs, rtoffset);
    }

    /* Adjust child plan-nodes recursively, if needed */
    foreach(lc, cscan->custom_plans)
    {
        lfirst(lc) = set_plan_refs(root, (Plan *) lfirst(lc), rtoffset);
    }

    /* Adjust custom_relids if needed */
    if (rtoffset > 0)
    {
        Bitmapset  *tempset = NULL;
        int         x = -1;

        while ((x = bms_next_member(cscan->custom_relids, x)) >= 0)
            tempset = bms_add_member(tempset, x + rtoffset);
        cscan->custom_relids = tempset;
    }
}

static void set_dummy_tlist_references ( Plan *  plan, int  rtoffset  )

static

Definition at line 1873 of file setrefs.c.

References TargetEntry::expr, exprCollation(), exprType(), exprTypmod(), flatCopyTargetEntry(), IsA, lappend(), lfirst, makeVar(), NIL, OUTER_VAR, TargetEntry::resno, Plan::targetlist, Var::varattno, and Var::varno.

Referenced by set_plan_refs().

{
    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))
        {
            newvar->varnoold = oldvar->varno + rtoffset;
            newvar->varoattno = oldvar->varattno;
        }
        else
        {
            newvar->varnoold = 0;   /* wasn't ever a plain Var */
            newvar->varoattno = 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 */
}

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

static

Definition at line 1181 of file setrefs.c.

References bms_add_member(), bms_next_member(), build_tlist_index(), ForeignScan::fdw_exprs, ForeignScan::fdw_recheck_quals, ForeignScan::fdw_scan_tlist, fix_scan_list, fix_upper_expr(), ForeignScan::fs_relids, INDEX_VAR, NIL, NULL, pfree(), Scan::plan, Plan::qual, ForeignScan::scan, Scan::scanrelid, and Plan::targetlist.

Referenced by set_plan_refs().

{
    /* 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);
        fscan->scan.plan.qual = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->scan.plan.qual,
                           itlist,
                           INDEX_VAR,
                           rtoffset);
        fscan->fdw_exprs = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->fdw_exprs,
                           itlist,
                           INDEX_VAR,
                           rtoffset);
        fscan->fdw_recheck_quals = (List *)
            fix_upper_expr(root,
                           (Node *) fscan->fdw_recheck_quals,
                           itlist,
                           INDEX_VAR,
                           rtoffset);
        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);
    }
    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);
        fscan->scan.plan.qual =
            fix_scan_list(root, fscan->scan.plan.qual, rtoffset);
        fscan->fdw_exprs =
            fix_scan_list(root, fscan->fdw_exprs, rtoffset);
        fscan->fdw_recheck_quals =
            fix_scan_list(root, fscan->fdw_recheck_quals, rtoffset);
    }

    /* Adjust fs_relids if needed */
    if (rtoffset > 0)
    {
        Bitmapset  *tempset = NULL;
        int         x = -1;

        while ((x = bms_next_member(fscan->fs_relids, x)) >= 0)
            tempset = bms_add_member(tempset, x + rtoffset);
        fscan->fs_relids = tempset;
    }
}

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

static

Definition at line 1013 of file setrefs.c.

References build_tlist_index(), fix_scan_list, fix_upper_expr(), INDEX_VAR, IndexOnlyScan::indexorderby, IndexOnlyScan::indexqual, IndexOnlyScan::indextlist, pfree(), Scan::plan, Plan::qual, IndexOnlyScan::scan, Scan::scanrelid, and Plan::targetlist.

Referenced by set_plan_refs().

{
    indexed_tlist *index_itlist;

    index_itlist = build_tlist_index(plan->indextlist);

    plan->scan.scanrelid += rtoffset;
    plan->scan.plan.targetlist = (List *)
        fix_upper_expr(root,
                       (Node *) plan->scan.plan.targetlist,
                       index_itlist,
                       INDEX_VAR,
                       rtoffset);
    plan->scan.plan.qual = (List *)
        fix_upper_expr(root,
                       (Node *) plan->scan.plan.qual,
                       index_itlist,
                       INDEX_VAR,
                       rtoffset);
    /* indexqual is already transformed to reference index columns */
    plan->indexqual = fix_scan_list(root, plan->indexqual, rtoffset);
    /* indexorderby is already transformed to reference index columns */
    plan->indexorderby = fix_scan_list(root, plan->indexorderby, rtoffset);
    /* indextlist must NOT be transformed to reference index columns */
    plan->indextlist = fix_scan_list(root, plan->indextlist, rtoffset);

    pfree(index_itlist);

    return (Plan *) plan;
}

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

static

Definition at line 1600 of file setrefs.c.

References build_tlist_index(), elog, ERROR, fix_join_expr(), fix_upper_expr(), indexed_tlist::has_non_vars, HashJoin::hashclauses, IsA, JOIN_ANTI, JOIN_FULL, JOIN_LEFT, JOIN_RIGHT, JOIN_SEMI, Join::joinqual, Join::jointype, Plan::lefttree, lfirst, MergeJoin::mergeclauses, NestLoop::nestParams, OUTER_VAR, NestLoopParam::paramval, pfree(), Join::plan, Plan::qual, Plan::righttree, Plan::targetlist, and Var::varno.

Referenced by set_plan_refs().

{
    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);

    /* 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);

            nlp->paramval = (Var *) fix_upper_expr(root,
                                                   (Node *) nlp->paramval,
                                                   outer_itlist,
                                                   OUTER_VAR,
                                                   rtoffset);
            /* 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);
    }
    else if (IsA(join, HashJoin))
    {
        HashJoin   *hj = (HashJoin *) join;

        hj->hashclauses = fix_join_expr(root,
                                        hj->hashclauses,
                                        outer_itlist,
                                        inner_itlist,
                                        (Index) 0,
                                        rtoffset);
    }

    /*
     * Now we need to fix up the targetlist and qpqual, which are logically
     * above the join.  This means they should not re-use any input expression
     * that was computed in the nullable side of an outer join.  Vars and
     * PlaceHolderVars are fine, so we can implement this restriction just by
     * clearing has_non_vars in the indexed_tlist structs.
     *
     * XXX This is a grotty workaround for the fact that we don't clearly
     * distinguish between a Var appearing below an outer join and the "same"
     * Var appearing above it.  If we did, we'd not need to hack the matching
     * rules this way.
     */
    switch (join->jointype)
    {
        case JOIN_LEFT:
        case JOIN_SEMI:
        case JOIN_ANTI:
            inner_itlist->has_non_vars = false;
            break;
        case JOIN_RIGHT:
            outer_itlist->has_non_vars = false;
            break;
        case JOIN_FULL:
            outer_itlist->has_non_vars = false;
            inner_itlist->has_non_vars = false;
            break;
        default:
            break;
    }

    join->plan.targetlist = fix_join_expr(root,
                                          join->plan.targetlist,
                                          outer_itlist,
                                          inner_itlist,
                                          (Index) 0,
                                          rtoffset);
    join->plan.qual = fix_join_expr(root,
                                    join->plan.qual,
                                    outer_itlist,
                                    inner_itlist,
                                    (Index) 0,
                                    rtoffset);

    pfree(outer_itlist);
    pfree(inner_itlist);
}

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

Definition at line 209 of file setrefs.c.

References add_rtes_to_flat_rtable(), PlannerGlobal::finalrowmarks, PlannerGlobal::finalrtable, PlannerInfo::glob, lappend(), lfirst_node, list_length(), palloc(), PlanRowMark::prti, PlannerInfo::rowMarks, PlanRowMark::rti, and set_plan_refs().

Referenced by set_subqueryscan_references(), and standard_planner().

{
    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);
    }

    /* Now fix the Plan tree */
    return set_plan_refs(root, plan, rtoffset);
}

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

static

Definition at line 434 of file setrefs.c.

References Agg::aggsplit, Append::appendplans, 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, fix_join_expr(), fix_scan_expr(), fix_scan_list, forthree, FunctionScan::functions, PlannerInfo::glob, IndexScan::indexorderby, IndexScan::indexorderbyorig, IndexScan::indexqual, BitmapIndexScan::indexqual, IndexScan::indexqualorig, BitmapIndexScan::indexqualorig, lappend(), lappend_int(), PlannerGlobal::lastPlanNodeId, Plan::lefttree, lfirst, lfirst_int, Limit::limitCount, Limit::limitOffset, linitial, linitial_int, list_concat(), list_copy(), list_length(), MergeAppend::mergeplans, NIL, nodeTag, ModifyTable::nominalRelation, PlannerGlobal::nonleafResultRelations, NULL, ModifyTable::onConflictSet, ModifyTable::onConflictWhere, ModifyTable::partitioned_rels, Append::partitioned_rels, MergeAppend::partitioned_rels, pfree(), Result::plan, ModifyTable::plan, Append::plan, MergeAppend::plan, BitmapAnd::plan, BitmapOr::plan, Scan::plan, LockRows::plan, Limit::plan, Plan::plan_node_id, ModifyTable::plans, PlanRowMark::prti, Plan::qual, Result::resconstantqual, PlannerGlobal::resultRelations, ModifyTable::resultRelations, ModifyTable::resultRelIndex, ModifyTable::returningLists, Plan::righttree, PlannerGlobal::rootResultRelations, ModifyTable::rootResultRelIndex, ModifyTable::rowMarks, LockRows::rowMarks, PlanRowMark::rti, SampleScan::scan, IndexScan::scan, BitmapIndexScan::scan, BitmapHeapScan::scan, TidScan::scan, FunctionScan::scan, ValuesScan::scan, TableFuncScan::scan, CteScan::scan, NamedTuplestoreScan::scan, WorkTableScan::scan, Scan::scanrelid, set_customscan_references(), set_dummy_tlist_references(), set_foreignscan_references(), set_indexonlyscan_references(), set_join_references(), set_returning_clause_references(), set_subqueryscan_references(), set_upper_references(), splan, WindowAgg::startOffset, T_Agg, T_Append, T_BitmapAnd, T_BitmapHeapScan, T_BitmapIndexScan, T_BitmapOr, T_CteScan, T_CustomScan, T_ForeignScan, T_FunctionScan, T_Gather, T_GatherMerge, T_Group, T_Hash, T_HashJoin, T_IndexOnlyScan, T_IndexScan, T_Limit, T_LockRows, T_Material, T_MergeAppend, T_MergeJoin, T_ModifyTable, T_NamedTuplestoreScan, T_NestLoop, T_ProjectSet, T_RecursiveUnion, T_Result, T_SampleScan, T_SeqScan, T_SetOp, T_Sort, T_SubqueryScan, T_TableFuncScan, T_TidScan, T_Unique, T_ValuesScan, T_WindowAgg, T_WorkTableScan, TableFuncScan::tablefunc, SampleScan::tablesample, Plan::targetlist, TidScan::tidquals, ValuesScan::values_lists, and ModifyTable::withCheckOptionLists.

Referenced by set_customscan_references(), and set_plan_references().

{
    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->scanrelid += rtoffset;
                splan->plan.targetlist =
                    fix_scan_list(root, splan->plan.targetlist, rtoffset);
                splan->plan.qual =
                    fix_scan_list(root, splan->plan.qual, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->tablesample = (TableSampleClause *)
                    fix_scan_expr(root, (Node *) splan->tablesample, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->indexqual =
                    fix_scan_list(root, splan->indexqual, rtoffset);
                splan->indexqualorig =
                    fix_scan_list(root, splan->indexqualorig, rtoffset);
                splan->indexorderby =
                    fix_scan_list(root, splan->indexorderby, rtoffset);
                splan->indexorderbyorig =
                    fix_scan_list(root, splan->indexorderbyorig, rtoffset);
            }
            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);
                splan->indexqualorig =
                    fix_scan_list(root, splan->indexqualorig, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->bitmapqualorig =
                    fix_scan_list(root, splan->bitmapqualorig, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->tidquals =
                    fix_scan_list(root, splan->tidquals, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->functions =
                    fix_scan_list(root, splan->functions, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->tablefunc = (TableFunc *)
                    fix_scan_expr(root, (Node *) splan->tablefunc, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
                splan->values_lists =
                    fix_scan_list(root, splan->values_lists, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
            }
            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);
                splan->scan.plan.qual =
                    fix_scan_list(root, splan->scan.plan.qual, rtoffset);
            }
            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);
            break;

        case T_Hash:
        case T_Material:
        case T_Sort:
        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);
                splan->limitCount =
                    fix_scan_expr(root, splan->limitCount, rtoffset);
            }
            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;

                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);
                wplan->endOffset =
                    fix_scan_expr(root, wplan->endOffset, rtoffset);
            }
            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
                {
                    splan->plan.targetlist =
                        fix_scan_list(root, splan->plan.targetlist, rtoffset);
                    splan->plan.qual =
                        fix_scan_list(root, splan->plan.qual, rtoffset);
                }
                /* resconstantqual can't contain any subplan variable refs */
                splan->resconstantqual =
                    fix_scan_expr(root, splan->resconstantqual, rtoffset);
            }
            break;
        case T_ProjectSet:
            set_upper_references(root, plan, rtoffset);
            break;
        case T_ModifyTable:
            {
                ModifyTable *splan = (ModifyTable *) plan;

                Assert(splan->plan.targetlist == NIL);
                Assert(splan->plan.qual == NIL);

                splan->withCheckOptionLists =
                    fix_scan_list(root, splan->withCheckOptionLists, rtoffset);

                if (splan->returningLists)
                {
                    List       *newRL = NIL;
                    ListCell   *lcrl,
                               *lcrr,
                               *lcp;

                    /*
                     * Pass each per-subplan returningList through
                     * set_returning_clause_references().
                     */
                    Assert(list_length(splan->returningLists) == list_length(splan->resultRelations));
                    Assert(list_length(splan->returningLists) == list_length(splan->plans));
                    forthree(lcrl, splan->returningLists,
                             lcrr, splan->resultRelations,
                             lcp, splan->plans)
                    {
                        List       *rlist = (List *) lfirst(lcrl);
                        Index       resultrel = lfirst_int(lcrr);
                        Plan       *subplan = (Plan *) lfirst(lcp);

                        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);

                    splan->onConflictWhere = (Node *)
                        fix_join_expr(root, (List *) splan->onConflictWhere,
                                      NULL, itlist,
                                      linitial_int(splan->resultRelations),
                                      rtoffset);

                    pfree(itlist);

                    splan->exclRelTlist =
                        fix_scan_list(root, splan->exclRelTlist, rtoffset);
                }

                splan->nominalRelation += rtoffset;
                splan->exclRelRTI += rtoffset;

                foreach(l, splan->partitioned_rels)
                {
                    lfirst_int(l) += rtoffset;
                }
                foreach(l, splan->resultRelations)
                {
                    lfirst_int(l) += rtoffset;
                }
                foreach(l, splan->rowMarks)
                {
                    PlanRowMark *rc = (PlanRowMark *) lfirst(l);

                    rc->rti += rtoffset;
                    rc->prti += rtoffset;
                }
                foreach(l, splan->plans)
                {
                    lfirst(l) = set_plan_refs(root,
                                              (Plan *) lfirst(l),
                                              rtoffset);
                }

                /*
                 * Append this ModifyTable node's final result relation RT
                 * index(es) to the global list for the plan, and set its
                 * resultRelIndex to reflect their starting position in the
                 * global list.
                 */
                splan->resultRelIndex = list_length(root->glob->resultRelations);
                root->glob->resultRelations =
                    list_concat(root->glob->resultRelations,
                                list_copy(splan->resultRelations));

                /*
                 * If the main target relation is a partitioned table, the
                 * following list contains the RT indexes of partitioned child
                 * relations including the root, which are not included in the
                 * above list.  We also keep RT indexes of the roots
                 * separately to be identitied as such during the executor
                 * initialization.
                 */
                if (splan->partitioned_rels != NIL)
                {
                    root->glob->nonleafResultRelations =
                        list_concat(root->glob->nonleafResultRelations,
                                    list_copy(splan->partitioned_rels));
                    /* Remember where this root will be in the global list. */
                    splan->rootResultRelIndex =
                        list_length(root->glob->rootResultRelations);
                    root->glob->rootResultRelations =
                        lappend_int(root->glob->rootResultRelations,
                                    linitial_int(splan->partitioned_rels));
                }
            }
            break;
        case T_Append:
            {
                Append     *splan = (Append *) plan;

                /*
                 * Append, like Sort et al, doesn't actually evaluate its
                 * targetlist or check quals.
                 */
                set_dummy_tlist_references(plan, rtoffset);
                Assert(splan->plan.qual == NIL);
                foreach(l, splan->partitioned_rels)
                {
                    lfirst_int(l) += rtoffset;
                }
                foreach(l, splan->appendplans)
                {
                    lfirst(l) = set_plan_refs(root,
                                              (Plan *) lfirst(l),
                                              rtoffset);
                }
            }
            break;
        case T_MergeAppend:
            {
                MergeAppend *splan = (MergeAppend *) plan;

                /*
                 * MergeAppend, like Sort et al, doesn't actually evaluate its
                 * targetlist or check quals.
                 */
                set_dummy_tlist_references(plan, rtoffset);
                Assert(splan->plan.qual == NIL);
                foreach(l, splan->partitioned_rels)
                {
                    lfirst_int(l) += rtoffset;
                }
                foreach(l, splan->mergeplans)
                {
                    lfirst(l) = set_plan_refs(root,
                                              (Plan *) lfirst(l),
                                              rtoffset);
                }
            }
            break;
        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;
}

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

static

Definition at line 2447 of file setrefs.c.

References build_tlist_index_other_vars(), fix_join_expr(), NULL, pfree(), and Plan::targetlist.

Referenced by set_plan_refs().

{
    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);

    pfree(itlist);

    return rlist;
}

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

static

Definition at line 1054 of file setrefs.c.

References find_base_rel(), fix_scan_list, forboth, Plan::initPlan, lfirst, list_concat(), Scan::plan, Plan::qual, TargetEntry::resname, TargetEntry::resorigcol, TargetEntry::resorigtbl, result, SubqueryScan::scan, Scan::scanrelid, set_plan_references(), SubqueryScan::subplan, RelOptInfo::subroot, Plan::targetlist, and trivial_subqueryscan().

Referenced by set_plan_refs().

{
    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.
         */
        ListCell   *lp,
                   *lc;

        result = plan->subplan;

        /* We have to be sure we don't lose any initplans */
        result->initPlan = list_concat(plan->scan.plan.initPlan,
                                       result->initPlan);

        /*
         * We also have to transfer the SubqueryScan's result-column names
         * into the subplan, else columns sent to client will be improperly
         * labeled if this is the topmost plan level.  Copy the "source
         * column" information too.
         */
        forboth(lp, plan->scan.plan.targetlist, lc, result->targetlist)
        {
            TargetEntry *ptle = (TargetEntry *) lfirst(lp);
            TargetEntry *ctle = (TargetEntry *) lfirst(lc);

            ctle->resname = ptle->resname;
            ctle->resorigtbl = ptle->resorigtbl;
            ctle->resorigcol = ptle->resorigcol;
        }
    }
    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);
        plan->scan.plan.qual =
            fix_scan_list(root, plan->scan.plan.qual, rtoffset);

        result = (Plan *) plan;
    }

    return result;
}

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

static

Definition at line 1734 of file setrefs.c.

References build_tlist_index(), TargetEntry::expr, fix_upper_expr(), flatCopyTargetEntry(), IsA, lappend(), Plan::lefttree, lfirst, NIL, OUTER_VAR, pfree(), Plan::qual, TargetEntry::ressortgroupref, search_indexed_tlist_for_sortgroupref(), and Plan::targetlist.

Referenced by set_plan_refs().

{
    Plan       *subplan = plan->lefttree;
    indexed_tlist *subplan_itlist;
    List       *output_targetlist;
    ListCell   *l;

    subplan_itlist = build_tlist_index(subplan->targetlist);

    output_targetlist = NIL;
    foreach(l, plan->targetlist)
    {
        TargetEntry *tle = (TargetEntry *) lfirst(l);
        Node       *newexpr;

        /* If it's a non-Var sort/group item, first try to match by sortref */
        if (tle->ressortgroupref != 0 && !IsA(tle->expr, Var))
        {
            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);
        }
        else
            newexpr = fix_upper_expr(root,
                                     (Node *) tle->expr,
                                     subplan_itlist,
                                     OUTER_VAR,
                                     rtoffset);
        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);

    pfree(subplan_itlist);
}

static bool trivial_subqueryscan ( SubqueryScan *  plan )

static

Definition at line 1126 of file setrefs.c.

References Assert, equal(), TargetEntry::expr, forboth, IsA, lfirst, list_length(), NIL, Scan::plan, Plan::qual, TargetEntry::resjunk, SubqueryScan::scan, Scan::scanrelid, SubqueryScan::subplan, Plan::targetlist, Var::varattno, Var::varlevelsup, and Var::varno.

Referenced by set_subqueryscan_references().

{
    int         attrno;
    ListCell   *lp,
               *lc;

    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++;
    }

    return true;
}