|
|
|
|
/*-------------------------------------------------------------------------
|
|
|
|
|
*
|
|
|
|
|
* execCurrent.c
|
|
|
|
|
* executor support for WHERE CURRENT OF cursor
|
|
|
|
|
*
|
|
|
|
|
* Portions Copyright (c) 1996-2018, PostgreSQL Global Development Group
|
|
|
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
|
|
|
*
|
|
|
|
|
* src/backend/executor/execCurrent.c
|
|
|
|
|
*
|
|
|
|
|
*-------------------------------------------------------------------------
|
|
|
|
|
*/
|
|
|
|
|
#include "postgres.h"
|
|
|
|
|
|
|
|
|
|
#include "access/sysattr.h"
|
|
|
|
|
#include "catalog/pg_type.h"
|
|
|
|
|
#include "executor/executor.h"
|
|
|
|
|
#include "utils/builtins.h"
|
|
|
|
|
#include "utils/lsyscache.h"
|
|
|
|
|
#include "utils/portal.h"
|
|
|
|
|
#include "utils/rel.h"
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
static char *fetch_cursor_param_value(ExprContext *econtext, int paramId);
|
|
|
|
|
static ScanState *search_plan_tree(PlanState *node, Oid table_oid);
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* execCurrentOf
|
|
|
|
|
*
|
|
|
|
|
* Given a CURRENT OF expression and the OID of a table, determine which row
|
|
|
|
|
* of the table is currently being scanned by the cursor named by CURRENT OF,
|
|
|
|
|
* and return the row's TID into *current_tid.
|
|
|
|
|
*
|
|
|
|
|
* Returns true if a row was identified. Returns false if the cursor is valid
|
|
|
|
|
* for the table but is not currently scanning a row of the table (this is a
|
|
|
|
|
* legal situation in inheritance cases). Raises error if cursor is not a
|
|
|
|
|
* valid updatable scan of the specified table.
|
|
|
|
|
*/
|
|
|
|
|
bool
|
|
|
|
|
execCurrentOf(CurrentOfExpr *cexpr,
|
|
|
|
|
ExprContext *econtext,
|
|
|
|
|
Oid table_oid,
|
|
|
|
|
ItemPointer current_tid)
|
|
|
|
|
{
|
|
|
|
|
char *cursor_name;
|
|
|
|
|
char *table_name;
|
|
|
|
|
Portal portal;
|
|
|
|
|
QueryDesc *queryDesc;
|
|
|
|
|
|
|
|
|
|
/* Get the cursor name --- may have to look up a parameter reference */
|
|
|
|
|
if (cexpr->cursor_name)
|
|
|
|
|
cursor_name = cexpr->cursor_name;
|
|
|
|
|
else
|
|
|
|
|
cursor_name = fetch_cursor_param_value(econtext, cexpr->cursor_param);
|
|
|
|
|
|
|
|
|
|
/* Fetch table name for possible use in error messages */
|
|
|
|
|
table_name = get_rel_name(table_oid);
|
|
|
|
|
if (table_name == NULL)
|
|
|
|
|
elog(ERROR, "cache lookup failed for relation %u", table_oid);
|
|
|
|
|
|
|
|
|
|
/* Find the cursor's portal */
|
|
|
|
|
portal = GetPortalByName(cursor_name);
|
|
|
|
|
if (!PortalIsValid(portal))
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_UNDEFINED_CURSOR),
|
|
|
|
|
errmsg("cursor \"%s\" does not exist", cursor_name)));
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We have to watch out for non-SELECT queries as well as held cursors,
|
|
|
|
|
* both of which may have null queryDesc.
|
|
|
|
|
*/
|
|
|
|
|
if (portal->strategy != PORTAL_ONE_SELECT)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" is not a SELECT query",
|
|
|
|
|
cursor_name)));
|
|
|
|
|
queryDesc = PortalGetQueryDesc(portal);
|
|
|
|
|
if (queryDesc == NULL || queryDesc->estate == NULL)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" is held from a previous transaction",
|
|
|
|
|
cursor_name)));
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* We have two different strategies depending on whether the cursor uses
|
|
|
|
|
* FOR UPDATE/SHARE or not. The reason for supporting both is that the
|
|
|
|
|
* FOR UPDATE code is able to identify a target table in many cases where
|
|
|
|
|
* the other code can't, while the non-FOR-UPDATE case allows use of WHERE
|
|
|
|
|
* CURRENT OF with an insensitive cursor.
|
|
|
|
|
*/
|
|
|
|
|
if (queryDesc->estate->es_rowMarks)
|
|
|
|
|
{
|
|
|
|
|
ExecRowMark *erm;
|
|
|
|
|
ListCell *lc;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Here, the query must have exactly one FOR UPDATE/SHARE reference to
|
|
|
|
|
* the target table, and we dig the ctid info out of that.
|
|
|
|
|
*/
|
|
|
|
|
erm = NULL;
|
|
|
|
|
foreach(lc, queryDesc->estate->es_rowMarks)
|
|
|
|
|
{
|
|
|
|
|
ExecRowMark *thiserm = (ExecRowMark *) lfirst(lc);
|
|
|
|
|
|
Re-implement EvalPlanQual processing to improve its performance and eliminate
a lot of strange behaviors that occurred in join cases. We now identify the
"current" row for every joined relation in UPDATE, DELETE, and SELECT FOR
UPDATE/SHARE queries. If an EvalPlanQual recheck is necessary, we jam the
appropriate row into each scan node in the rechecking plan, forcing it to emit
only that one row. The former behavior could rescan the whole of each joined
relation for each recheck, which was terrible for performance, and what's much
worse could result in duplicated output tuples.
Also, the original implementation of EvalPlanQual could not re-use the recheck
execution tree --- it had to go through a full executor init and shutdown for
every row to be tested. To avoid this overhead, I've associated a special
runtime Param with each LockRows or ModifyTable plan node, and arranged to
make every scan node below such a node depend on that Param. Thus, by
signaling a change in that Param, the EPQ machinery can just rescan the
already-built test plan.
This patch also adds a prohibition on set-returning functions in the
targetlist of SELECT FOR UPDATE/SHARE. This is needed to avoid the
duplicate-output-tuple problem. It seems fairly reasonable since the
other restrictions on SELECT FOR UPDATE are meant to ensure that there
is a unique correspondence between source tuples and result tuples,
which an output SRF destroys as much as anything else does.
16 years ago
|
|
|
if (!RowMarkRequiresRowShareLock(thiserm->markType))
|
|
|
|
|
continue; /* ignore non-FOR UPDATE/SHARE items */
|
|
|
|
|
|
Allow foreign tables to participate in inheritance.
Foreign tables can now be inheritance children, or parents. Much of the
system was already ready for this, but we had to fix a few things of
course, mostly in the area of planner and executor handling of row locks.
As side effects of this, allow foreign tables to have NOT VALID CHECK
constraints (and hence to accept ALTER ... VALIDATE CONSTRAINT), and to
accept ALTER SET STORAGE and ALTER SET WITH/WITHOUT OIDS. Continuing to
disallow these things would've required bizarre and inconsistent special
cases in inheritance behavior. Since foreign tables don't enforce CHECK
constraints anyway, a NOT VALID one is a complete no-op, but that doesn't
mean we shouldn't allow it. And it's possible that some FDWs might have
use for SET STORAGE or SET WITH OIDS, though doubtless they will be no-ops
for most.
An additional change in support of this is that when a ModifyTable node
has multiple target tables, they will all now be explicitly identified
in EXPLAIN output, for example:
Update on pt1 (cost=0.00..321.05 rows=3541 width=46)
Update on pt1
Foreign Update on ft1
Foreign Update on ft2
Update on child3
-> Seq Scan on pt1 (cost=0.00..0.00 rows=1 width=46)
-> Foreign Scan on ft1 (cost=100.00..148.03 rows=1170 width=46)
-> Foreign Scan on ft2 (cost=100.00..148.03 rows=1170 width=46)
-> Seq Scan on child3 (cost=0.00..25.00 rows=1200 width=46)
This was done mainly to provide an unambiguous place to attach "Remote SQL"
fields, but it is useful for inherited updates even when no foreign tables
are involved.
Shigeru Hanada and Etsuro Fujita, reviewed by Ashutosh Bapat and Kyotaro
Horiguchi, some additional hacking by me
11 years ago
|
|
|
if (thiserm->relid == table_oid)
|
|
|
|
|
{
|
|
|
|
|
if (erm)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" has multiple FOR UPDATE/SHARE references to table \"%s\"",
|
|
|
|
|
cursor_name, table_name)));
|
|
|
|
|
erm = thiserm;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
if (erm == NULL)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" does not have a FOR UPDATE/SHARE reference to table \"%s\"",
|
|
|
|
|
cursor_name, table_name)));
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The cursor must have a current result row: per the SQL spec, it's
|
|
|
|
|
* an error if not.
|
|
|
|
|
*/
|
|
|
|
|
if (portal->atStart || portal->atEnd)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" is not positioned on a row",
|
|
|
|
|
cursor_name)));
|
|
|
|
|
|
|
|
|
|
/* Return the currently scanned TID, if there is one */
|
|
|
|
|
if (ItemPointerIsValid(&(erm->curCtid)))
|
|
|
|
|
{
|
|
|
|
|
*current_tid = erm->curCtid;
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* This table didn't produce the cursor's current row; some other
|
|
|
|
|
* inheritance child of the same parent must have. Signal caller to
|
|
|
|
|
* do nothing on this table.
|
|
|
|
|
*/
|
|
|
|
|
return false;
|
|
|
|
|
}
|
|
|
|
|
else
|
|
|
|
|
{
|
|
|
|
|
ScanState *scanstate;
|
|
|
|
|
bool lisnull;
|
|
|
|
|
Oid tuple_tableoid PG_USED_FOR_ASSERTS_ONLY;
|
|
|
|
|
ItemPointer tuple_tid;
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Without FOR UPDATE, we dig through the cursor's plan to find the
|
|
|
|
|
* scan node. Fail if it's not there or buried underneath
|
|
|
|
|
* aggregation.
|
|
|
|
|
*/
|
|
|
|
|
scanstate = search_plan_tree(queryDesc->planstate, table_oid);
|
|
|
|
|
if (!scanstate)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" is not a simply updatable scan of table \"%s\"",
|
|
|
|
|
cursor_name, table_name)));
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* The cursor must have a current result row: per the SQL spec, it's
|
|
|
|
|
* an error if not. We test this at the top level, rather than at the
|
|
|
|
|
* scan node level, because in inheritance cases any one table scan
|
|
|
|
|
* could easily not be on a row. We want to return false, not raise
|
|
|
|
|
* error, if the passed-in table OID is for one of the inactive scans.
|
|
|
|
|
*/
|
|
|
|
|
if (portal->atStart || portal->atEnd)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_INVALID_CURSOR_STATE),
|
|
|
|
|
errmsg("cursor \"%s\" is not positioned on a row",
|
|
|
|
|
cursor_name)));
|
|
|
|
|
|
|
|
|
|
/* Now OK to return false if we found an inactive scan */
|
|
|
|
|
if (TupIsNull(scanstate->ss_ScanTupleSlot))
|
|
|
|
|
return false;
|
|
|
|
|
|
|
|
|
|
/* Use slot_getattr to catch any possible mistakes */
|
|
|
|
|
tuple_tableoid =
|
|
|
|
|
DatumGetObjectId(slot_getattr(scanstate->ss_ScanTupleSlot,
|
|
|
|
|
TableOidAttributeNumber,
|
|
|
|
|
&lisnull));
|
|
|
|
|
Assert(!lisnull);
|
|
|
|
|
tuple_tid = (ItemPointer)
|
|
|
|
|
DatumGetPointer(slot_getattr(scanstate->ss_ScanTupleSlot,
|
|
|
|
|
SelfItemPointerAttributeNumber,
|
|
|
|
|
&lisnull));
|
|
|
|
|
Assert(!lisnull);
|
|
|
|
|
|
|
|
|
|
Assert(tuple_tableoid == table_oid);
|
|
|
|
|
|
|
|
|
|
*current_tid = *tuple_tid;
|
|
|
|
|
|
|
|
|
|
return true;
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* fetch_cursor_param_value
|
|
|
|
|
*
|
|
|
|
|
* Fetch the string value of a param, verifying it is of type REFCURSOR.
|
|
|
|
|
*/
|
|
|
|
|
static char *
|
|
|
|
|
fetch_cursor_param_value(ExprContext *econtext, int paramId)
|
|
|
|
|
{
|
|
|
|
|
ParamListInfo paramInfo = econtext->ecxt_param_list_info;
|
|
|
|
|
|
|
|
|
|
if (paramInfo &&
|
|
|
|
|
paramId > 0 && paramId <= paramInfo->numParams)
|
|
|
|
|
{
|
Rearrange execution of PARAM_EXTERN Params for plpgsql's benefit.
This patch does three interrelated things:
* Create a new expression execution step type EEOP_PARAM_CALLBACK
and add the infrastructure needed for add-on modules to generate that.
As discussed, the best control mechanism for that seems to be to add
another hook function to ParamListInfo, which will be called by
ExecInitExpr if it's supplied and a PARAM_EXTERN Param is found.
For stand-alone expressions, we add a new entry point to allow the
ParamListInfo to be specified directly, since it can't be retrieved
from the parent plan node's EState.
* Redesign the API for the ParamListInfo paramFetch hook so that the
ParamExternData array can be entirely virtual. This also lets us get rid
of ParamListInfo.paramMask, instead leaving it to the paramFetch hook to
decide which param IDs should be accessible or not. plpgsql_param_fetch
was already doing the identical masking check, so having callers do it too
seemed redundant. While I was at it, I added a "speculative" flag to
paramFetch that the planner can specify as TRUE to avoid unwanted failures.
This solves an ancient problem for plpgsql that it couldn't provide values
of non-DTYPE_VAR variables to the planner for fear of triggering premature
"record not assigned yet" or "field not found" errors during planning.
* Rework plpgsql to get rid of the need for "unshared" parameter lists,
by dint of turning the single ParamListInfo per estate into a nearly
read-only data structure that doesn't instantiate any per-variable data.
Instead, the paramFetch hook controls access to per-variable data and can
make the right decisions on the fly, replacing the cases that we used to
need multiple ParamListInfos for. This might perhaps have been a
performance loss on its own, but by using a paramCompile hook we can
bypass plpgsql_param_fetch entirely during normal query execution.
(It's now only called when, eg, we copy the ParamListInfo into a cursor
portal. copyParamList() or SerializeParamList() effectively instantiate
the virtual parameter array as a simple physical array without a
paramFetch hook, which is what we want in those cases.) This allows
reverting most of commit 6c82d8d1f, though I kept the cosmetic
code-consolidation aspects of that (eg the assign_simple_var function).
Performance testing shows this to be at worst a break-even change,
and it can provide wins ranging up to 20% in test cases involving
accesses to fields of "record" variables. The fact that values of
such variables can now be exposed to the planner might produce wins
in some situations, too, but I've not pursued that angle.
In passing, remove the "parent" pointer from the arguments to
ExecInitExprRec and related functions, instead storing that pointer in a
transient field in ExprState. The ParamListInfo pointer for a stand-alone
expression is handled the same way; we'd otherwise have had to add
yet another recursively-passed-down argument in expression compilation.
Discussion: https://postgr.es/m/32589.1513706441@sss.pgh.pa.us
8 years ago
|
|
|
ParamExternData *prm;
|
|
|
|
|
ParamExternData prmdata;
|
|
|
|
|
|
|
|
|
|
/* give hook a chance in case parameter is dynamic */
|
Rearrange execution of PARAM_EXTERN Params for plpgsql's benefit.
This patch does three interrelated things:
* Create a new expression execution step type EEOP_PARAM_CALLBACK
and add the infrastructure needed for add-on modules to generate that.
As discussed, the best control mechanism for that seems to be to add
another hook function to ParamListInfo, which will be called by
ExecInitExpr if it's supplied and a PARAM_EXTERN Param is found.
For stand-alone expressions, we add a new entry point to allow the
ParamListInfo to be specified directly, since it can't be retrieved
from the parent plan node's EState.
* Redesign the API for the ParamListInfo paramFetch hook so that the
ParamExternData array can be entirely virtual. This also lets us get rid
of ParamListInfo.paramMask, instead leaving it to the paramFetch hook to
decide which param IDs should be accessible or not. plpgsql_param_fetch
was already doing the identical masking check, so having callers do it too
seemed redundant. While I was at it, I added a "speculative" flag to
paramFetch that the planner can specify as TRUE to avoid unwanted failures.
This solves an ancient problem for plpgsql that it couldn't provide values
of non-DTYPE_VAR variables to the planner for fear of triggering premature
"record not assigned yet" or "field not found" errors during planning.
* Rework plpgsql to get rid of the need for "unshared" parameter lists,
by dint of turning the single ParamListInfo per estate into a nearly
read-only data structure that doesn't instantiate any per-variable data.
Instead, the paramFetch hook controls access to per-variable data and can
make the right decisions on the fly, replacing the cases that we used to
need multiple ParamListInfos for. This might perhaps have been a
performance loss on its own, but by using a paramCompile hook we can
bypass plpgsql_param_fetch entirely during normal query execution.
(It's now only called when, eg, we copy the ParamListInfo into a cursor
portal. copyParamList() or SerializeParamList() effectively instantiate
the virtual parameter array as a simple physical array without a
paramFetch hook, which is what we want in those cases.) This allows
reverting most of commit 6c82d8d1f, though I kept the cosmetic
code-consolidation aspects of that (eg the assign_simple_var function).
Performance testing shows this to be at worst a break-even change,
and it can provide wins ranging up to 20% in test cases involving
accesses to fields of "record" variables. The fact that values of
such variables can now be exposed to the planner might produce wins
in some situations, too, but I've not pursued that angle.
In passing, remove the "parent" pointer from the arguments to
ExecInitExprRec and related functions, instead storing that pointer in a
transient field in ExprState. The ParamListInfo pointer for a stand-alone
expression is handled the same way; we'd otherwise have had to add
yet another recursively-passed-down argument in expression compilation.
Discussion: https://postgr.es/m/32589.1513706441@sss.pgh.pa.us
8 years ago
|
|
|
if (paramInfo->paramFetch != NULL)
|
|
|
|
|
prm = paramInfo->paramFetch(paramInfo, paramId, false, &prmdata);
|
|
|
|
|
else
|
|
|
|
|
prm = ¶mInfo->params[paramId - 1];
|
|
|
|
|
|
|
|
|
|
if (OidIsValid(prm->ptype) && !prm->isnull)
|
|
|
|
|
{
|
|
|
|
|
/* safety check in case hook did something unexpected */
|
|
|
|
|
if (prm->ptype != REFCURSOROID)
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_DATATYPE_MISMATCH),
|
|
|
|
|
errmsg("type of parameter %d (%s) does not match that when preparing the plan (%s)",
|
|
|
|
|
paramId,
|
|
|
|
|
format_type_be(prm->ptype),
|
|
|
|
|
format_type_be(REFCURSOROID))));
|
|
|
|
|
|
|
|
|
|
/* We know that refcursor uses text's I/O routines */
|
|
|
|
|
return TextDatumGetCString(prm->value);
|
|
|
|
|
}
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
ereport(ERROR,
|
|
|
|
|
(errcode(ERRCODE_UNDEFINED_OBJECT),
|
|
|
|
|
errmsg("no value found for parameter %d", paramId)));
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* search_plan_tree
|
|
|
|
|
*
|
|
|
|
|
* Search through a PlanState tree for a scan node on the specified table.
|
|
|
|
|
* Return NULL if not found or multiple candidates.
|
|
|
|
|
*/
|
|
|
|
|
static ScanState *
|
|
|
|
|
search_plan_tree(PlanState *node, Oid table_oid)
|
|
|
|
|
{
|
|
|
|
|
if (node == NULL)
|
|
|
|
|
return NULL;
|
|
|
|
|
switch (nodeTag(node))
|
|
|
|
|
{
|
|
|
|
|
/*
|
|
|
|
|
* Relation scan nodes can all be treated alike
|
|
|
|
|
*/
|
|
|
|
|
case T_SeqScanState:
|
|
|
|
|
case T_SampleScanState:
|
|
|
|
|
case T_IndexScanState:
|
|
|
|
|
case T_IndexOnlyScanState:
|
|
|
|
|
case T_BitmapHeapScanState:
|
|
|
|
|
case T_TidScanState:
|
|
|
|
|
case T_ForeignScanState:
|
|
|
|
|
case T_CustomScanState:
|
|
|
|
|
{
|
|
|
|
|
ScanState *sstate = (ScanState *) node;
|
|
|
|
|
|
|
|
|
|
if (RelationGetRelid(sstate->ss_currentRelation) == table_oid)
|
|
|
|
|
return sstate;
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* For Append, we must look through the members; watch out for
|
|
|
|
|
* multiple matches (possible if it was from UNION ALL)
|
|
|
|
|
*/
|
|
|
|
|
case T_AppendState:
|
|
|
|
|
{
|
|
|
|
|
AppendState *astate = (AppendState *) node;
|
|
|
|
|
ScanState *result = NULL;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < astate->as_nplans; i++)
|
|
|
|
|
{
|
|
|
|
|
ScanState *elem = search_plan_tree(astate->appendplans[i],
|
|
|
|
|
table_oid);
|
|
|
|
|
|
|
|
|
|
if (!elem)
|
|
|
|
|
continue;
|
|
|
|
|
if (result)
|
|
|
|
|
return NULL; /* multiple matches */
|
|
|
|
|
result = elem;
|
|
|
|
|
}
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Similarly for MergeAppend
|
|
|
|
|
*/
|
|
|
|
|
case T_MergeAppendState:
|
|
|
|
|
{
|
|
|
|
|
MergeAppendState *mstate = (MergeAppendState *) node;
|
|
|
|
|
ScanState *result = NULL;
|
|
|
|
|
int i;
|
|
|
|
|
|
|
|
|
|
for (i = 0; i < mstate->ms_nplans; i++)
|
|
|
|
|
{
|
|
|
|
|
ScanState *elem = search_plan_tree(mstate->mergeplans[i],
|
|
|
|
|
table_oid);
|
|
|
|
|
|
|
|
|
|
if (!elem)
|
|
|
|
|
continue;
|
|
|
|
|
if (result)
|
|
|
|
|
return NULL; /* multiple matches */
|
|
|
|
|
result = elem;
|
|
|
|
|
}
|
|
|
|
|
return result;
|
|
|
|
|
}
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* Result and Limit can be descended through (these are safe
|
|
|
|
|
* because they always return their input's current row)
|
|
|
|
|
*/
|
|
|
|
|
case T_ResultState:
|
|
|
|
|
case T_LimitState:
|
|
|
|
|
return search_plan_tree(node->lefttree, table_oid);
|
|
|
|
|
|
|
|
|
|
/*
|
|
|
|
|
* SubqueryScan too, but it keeps the child in a different place
|
|
|
|
|
*/
|
|
|
|
|
case T_SubqueryScanState:
|
|
|
|
|
return search_plan_tree(((SubqueryScanState *) node)->subplan,
|
|
|
|
|
table_oid);
|
|
|
|
|
|
|
|
|
|
default:
|
|
|
|
|
/* Otherwise, assume we can't descend through it */
|
|
|
|
|
break;
|
|
|
|
|
}
|
|
|
|
|
return NULL;
|
|
|
|
|
}
|