*
* parse_relation.cpp
* parser support routines dealing with relations
*
* Portions Copyright (c) 1996-2012, PostgreSQL Global Development Group
* Portions Copyright (c) 1994, Regents of the University of California
*
*
* IDENTIFICATION
* src/common/backend/parser/parse_relation.cpp
*
* -------------------------------------------------------------------------
*/
#include "postgres.h"
#include "knl/knl_variable.h"
#include <ctype.h>
#include "access/sysattr.h"
#include "access/tableam.h"
#include "catalog/heap.h"
#include "catalog/namespace.h"
#include "catalog/pg_auth_history.h"
#include "catalog/pg_type.h"
#include "catalog/gs_package.h"
#include "funcapi.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "parser/parsetree.h"
#include "parser/parse_hint.h"
#include "parser/parse_relation.h"
#include "parser/parse_type.h"
#include "parser/parse_clause.h"
#include "parser/parse_expr.h"
#ifdef PGXC
#include "access/transam.h"
#include "pgxc/pgxc.h"
#endif
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "utils/partitionkey.h"
#include "utils/rel.h"
#include "utils/rel_gs.h"
#include "utils/syscache.h"
#include "utils/pl_package.h"
#include "catalog/pg_partition_fn.h"
#include "catalog/pg_synonym.h"
#include "parser/parse_utilcmd.h"
#include "parser/parse_expr.h"
#include "commands/tablecmds.h"
#include "catalog/pg_user_status.h"
#include "commands/user.h"
#include "utils/snapmgr.h"
#include "workload/workload.h"
#include "storage/lmgr.h"
#include "tcop/utility.h"
#include "optimizer/bucketinfo.h"
#include "optimizer/planner.h"
#include "storage/tcap.h"
#include "gs_ledger/ledger_utils.h"
#include "catalog/pg_object.h"
#include "catalog/pg_depend.h"
#include "catalog/pg_rewrite.h"
#ifdef ENABLE_MOT
#include "storage/mot/jit_def.h"
#endif
#include "rewrite/rewriteManip.h"
#define MAXSTRLEN ((1 << 11) - 1)
enum ValidateDependResult {
ValidateDependInvalid,
ValidateDependValid,
ValidateDependCircularDepend,
};
static RangeTblEntry* scanNameSpaceForRefname(ParseState* pstate, const char* refname, int location);
static RangeTblEntry* scanNameSpaceForRelid(ParseState* pstate, Oid relid, int location);
static void markRTEForSelectPriv(ParseState* pstate, RangeTblEntry* rte, int rtindex, AttrNumber col);
static void expandRelation(Oid relid, Alias* eref, int rtindex, int sublevels_up, int location, bool include_dropped,
List** colnames, List** colvars);
static void expandTupleDesc(TupleDesc tupdesc, Alias* eref, int rtindex, int sublevels_up, int location,
bool include_dropped, List** colnames, List** colvars);
static void setRteOrientation(Relation rel, RangeTblEntry* rte);
static int32* getValuesTypmods(RangeTblEntry* rte);
static IndexHintType preCheckIndexHints(ParseState* pstate, List* indexhints, Relation relation);
static void change_var_attno(Query* query, Oid rel_oid, int oldAttnum, int newAttnum);
static ValidateDependResult ValidateDependView(Oid view_oid, char objType, List** list, bool force,
StringInfo buf = NULL);
#ifndef PGXC
static int specialAttNum(const char* attname);
#endif
static char *ReplaceSWCTEOutSrting(ParseState *pstate, RangeTblEntry *rte, char *label)
{
ListCell *lc = NULL;
char *result = NULL;
char *relname = NULL;
foreach(lc, rte->origin_index) {
int index = (int)lfirst_int(lc);
RangeTblEntry *old_rte = (RangeTblEntry *)list_nth(pstate->p_rtable, index - 1);
if (old_rte->rtekind == RTE_RELATION || old_rte->rtekind == RTE_CTE) {
relname = old_rte->relname;
} else if (old_rte->rtekind == RTE_SUBQUERY) {
relname = old_rte->alias->aliasname;
}
if (strrchr(label, '@')) {
label = strrchr(label, '@');
label += 1;
}
}
result = pstrdup(label);
return result;
}
* @Description: set the RTE common flags
* @inout rte: pointer to the RTE
* @in: whether it is inherit
* @in inFromCl: whether it is present in FROM clause
* @in perm: required permission such as ACL_SELECT, etc.
*/
static void set_rte_flags(RangeTblEntry* rte, bool inh, bool inFromCl, int perm)
{
* Flags:
* - this RTE should be expanded to include descendant tables,
* - this RTE is in the FROM clause,
* - this RTE should be checked for appropriate access rights.
*
* Joins are never checked for access rights.
* ----------
*/
rte->inh = inh;
rte->inFromCl = inFromCl;
rte->requiredPerms = perm;
rte->checkAsUser = InvalidOid;
rte->selectedCols = NULL;
rte->insertedCols = NULL;
rte->updatedCols = NULL;
rte->extraUpdatedCols = NULL;
}
* @Description: get the valid relation's partition attribute number(s).
* @in rel: relation
* @return: a list of attribute numbers.
*/
static List* get_rte_part_attr_num(Relation rel)
{
if (IS_PGXC_COORDINATOR && rel->rd_id >= FirstNormalObjectId && PointerIsValid(rel->rd_locator_info)) {
return (List*)copyObject(rel->rd_locator_info->partAttrNum);
}
return NULL;
}
* refnameRangeTblEntry
* Given a possibly-qualified refname, look to see if it matches any RTE.
* If so, return a pointer to the RangeTblEntry; else return NULL.
*
* Optionally get RTE's nesting depth (0 = current) into *sublevels_up.
* If sublevels_up is NULL, only consider items at the current nesting
* level.
*
* An unqualified refname (schemaname == NULL) can match any RTE with matching
* alias, or matching unqualified relname in the case of alias-less relation
* RTEs. It is possible that such a refname matches multiple RTEs in the
* nearest nesting level that has a match; if so, we report an error via
* ereport().
*
* A qualified refname (schemaname != NULL) can only match a relation RTE
* that (a) has no alias and (b) is for the same relation identified by
* schemaname.refname. In this case we convert schemaname.refname to a
* relation OID and search by relid, rather than by alias name. This is
* peculiar, but it's what SQL92 says to do.
*/
RangeTblEntry* refnameRangeTblEntry(
ParseState* pstate, const char* schemaname, const char* refname, int location, int* sublevels_up)
{
Oid relId = InvalidOid;
if (sublevels_up != NULL) {
*sublevels_up = 0;
}
if (schemaname != NULL) {
Oid namespaceId;
* We can use LookupNamespaceNoError() here because we are only
* interested in finding existing RTEs. Checking USAGE permission on
* the schema is unnecessary since it would have already been checked
* when the RTE was made. Furthermore, we want to report "RTE not
* found", not "no permissions for schema", if the name happens to
* match a schema name the user hasn't got access to.
*/
namespaceId = LookupNamespaceNoError(schemaname);
if (!OidIsValid(namespaceId)) {
return NULL;
}
(void)get_relname_relid_extend(refname, namespaceId, &relId, true, NULL);
if (!OidIsValid(relId)) {
return NULL;
}
}
while (pstate != NULL) {
RangeTblEntry* result = NULL;
if (OidIsValid(relId)) {
result = scanNameSpaceForRelid(pstate, relId, location);
} else {
result = scanNameSpaceForRefname(pstate, refname, location);
}
if (result != NULL) {
return result;
}
if (sublevels_up != NULL) {
(*sublevels_up)++;
} else {
break;
}
pstate = pstate->parentParseState;
}
return NULL;
}
* Search the query's table namespace for an RTE matching the
* given unqualified refname. Return the RTE if a unique match, or NULL
* if no match. Raise error if multiple matches.
*/
static RangeTblEntry* scanNameSpaceForRefname(ParseState* pstate, const char* refname, int location)
{
RangeTblEntry* result = NULL;
ListCell* l = NULL;
foreach (l, pstate->p_relnamespace) {
ParseNamespaceItem *nsitem = (ParseNamespaceItem *) lfirst(l);
RangeTblEntry *rte = nsitem->p_rte;
if (nsitem->p_lateral_only && !pstate->p_lateral_active)
continue;
if (strcmp(rte->eref->aliasname, refname) == 0) {
if (result != NULL)
ereport(ERROR,
(errcode(ERRCODE_AMBIGUOUS_ALIAS),
errmsg("table reference \"%s\" is ambiguous", refname),
parser_errposition(pstate, location)));
if (nsitem->p_lateral_only && !nsitem->p_lateral_ok)
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("invalid reference to FROM-clause entry for table \"%s\"", refname),
errdetail("The combining JOIN type must be INNER or LEFT for a LATERAL reference."),
parser_errposition(pstate, location)));
result = rte;
}
}
if (result != NULL && pstate->p_hasStartWith && result->swAborted) {
foreach(l, pstate->p_rtable) {
RangeTblEntry *tbl = (RangeTblEntry *)lfirst(l);
if (tbl->swConverted) {
result = tbl;
break;
}
}
}
return result;
}
* Search the query's table namespace for a relation RTE matching the
* given relation OID. Return the RTE if a unique match, or NULL
* if no match. Raise error if multiple matches (which shouldn't
* happen if the namespace was checked correctly when it was created).
*
* See the comments for refnameRangeTblEntry to understand why this
* acts the way it does.
*/
static RangeTblEntry* scanNameSpaceForRelid(ParseState* pstate, Oid relid, int location)
{
RangeTblEntry* result = NULL;
ListCell* l = NULL;
foreach (l, pstate->p_relnamespace) {
ParseNamespaceItem *nsitem = (ParseNamespaceItem *) lfirst(l);
RangeTblEntry *rte = nsitem->p_rte;
if (nsitem->p_lateral_only && !pstate->p_lateral_active)
continue;
if (rte->rtekind == RTE_RELATION && rte->relid == relid && rte->alias == NULL) {
if (result != NULL)
ereport(ERROR,
(errcode(ERRCODE_AMBIGUOUS_ALIAS),
errmsg("table reference %u is ambiguous", relid),
parser_errposition(pstate, location)));
if (nsitem->p_lateral_only && !nsitem->p_lateral_ok)
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("invalid reference to FROM-clause entry for table \"%s\"", rte->eref->aliasname),
errdetail("The combining JOIN type must be INNER or LEFT for a LATERAL reference."),
parser_errposition(pstate, location)));
result = rte;
}
}
return result;
}
* Search the query's CTE namespace for a CTE matching the given unqualified
* refname. Return the CTE (and its levelsup count) if a match, or NULL
* if no match. We need not worry about multiple matches, since parse_cte.c
* rejects WITH lists containing duplicate CTE names.
*/
CommonTableExpr* scanNameSpaceForCTE(ParseState* pstate, const char* refname, Index* ctelevelsup)
{
Index levelsup;
for (levelsup = 0; pstate != NULL; pstate = pstate->parentParseState, levelsup++) {
ListCell* lc = NULL;
foreach (lc, pstate->p_ctenamespace) {
CommonTableExpr* cte = (CommonTableExpr*)lfirst(lc);
if (strcmp(cte->ctename, refname) == 0) {
*ctelevelsup = levelsup;
return cte;
}
}
}
return NULL;
}
* Search for a possible "future CTE", that is one that is not yet in scope
* according to the WITH scoping rules. This has nothing to do with valid
* SQL semantics, but it's important for error reporting purposes.
*/
static bool isFutureCTE(ParseState* pstate, const char* refname)
{
for (; pstate != NULL; pstate = pstate->parentParseState) {
ListCell* lc = NULL;
foreach (lc, pstate->p_future_ctes) {
CommonTableExpr* cte = (CommonTableExpr*)lfirst(lc);
if (strcmp(cte->ctename, refname) == 0) {
return true;
}
}
}
return false;
}
* searchRangeTableForRel
* See if any RangeTblEntry could possibly match the RangeVar.
* If so, return a pointer to the RangeTblEntry; else return NULL.
*
* This is different from refnameRangeTblEntry in that it considers every
* entry in the ParseState's rangetable(s), not only those that are currently
* visible in the p_relnamespace lists. This behavior is invalid per the SQL
* spec, and it may give ambiguous results (there might be multiple equally
* valid matches, but only one will be returned). This must be used ONLY
* as a heuristic in giving suitable error messages. See errorMissingRTE.
*
* Notice that we consider both matches on actual relation (or CTE) name
* and matches on alias.
*/
static RangeTblEntry* searchRangeTableForRel(ParseState* pstate, RangeVar* relation)
{
const char* refname = relation->relname;
Oid relId = InvalidOid;
CommonTableExpr* cte = NULL;
Index ctelevelsup = 0;
Index levelsup;
* If it's an unqualified name, check for possible CTE matches. A CTE
* hides any real relation matches. If no CTE, look for a matching
* relation.
*
* NB: It's not critical that RangeVarGetRelid return the correct answer
* here in the face of concurrent DDL. If it doesn't, the worst case
* scenario is a less-clear error message. Also, the tables involved in
* the query are already locked, which reduces the number of cases in
* which surprising behavior can occur. So we do the name lookup
* unlocked.
*/
if (!relation->schemaname) {
cte = scanNameSpaceForCTE(pstate, refname, &ctelevelsup);
}
if (cte == NULL) {
relId = RangeVarGetRelid(relation, NoLock, true);
}
for (levelsup = 0; pstate != NULL; pstate = pstate->parentParseState, levelsup++) {
ListCell* l = NULL;
foreach (l, pstate->p_rtable) {
RangeTblEntry* rte = (RangeTblEntry*)lfirst(l);
if (rte->rtekind == RTE_RELATION && OidIsValid(relId) && rte->relid == relId) {
return rte;
}
if (rte->rtekind == RTE_CTE && cte != NULL && rte->ctelevelsup + levelsup == ctelevelsup &&
strcmp(rte->ctename, refname) == 0) {
return rte;
}
if (strcmp(rte->eref->aliasname, refname) == 0) {
return rte;
}
}
}
return NULL;
}
* Check for relation-name conflicts between two relnamespace lists.
* Raise an error if any is found.
*
* Note: we assume that each given argument does not contain conflicts
* itself; we just want to know if the two can be merged together.
*
* Per SQL92, two alias-less plain relation RTEs do not conflict even if
* they have the same eref->aliasname (ie, same relation name), if they
* are for different relation OIDs (implying they are in different schemas).
*/
void checkNameSpaceConflicts(ParseState* pstate, List* namespace1, List* namespace2)
{
ListCell* l1 = NULL;
foreach (l1, namespace1) {
ParseNamespaceItem *nsitem1 = (ParseNamespaceItem *) lfirst(l1);
RangeTblEntry *rte1 = nsitem1->p_rte;
const char* aliasname1 = rte1->eref->aliasname;
ListCell* l2 = NULL;
foreach (l2, namespace2) {
ParseNamespaceItem *nsitem2 = (ParseNamespaceItem *) lfirst(l2);
RangeTblEntry *rte2 = nsitem2->p_rte;
if (strcmp(rte2->eref->aliasname, aliasname1) != 0) {
continue;
}
if (rte1->rtekind == RTE_RELATION && rte1->alias == NULL && rte2->rtekind == RTE_RELATION &&
rte2->alias == NULL && rte1->relid != rte2->relid) {
continue;
}
ereport(ERROR,
(errcode(ERRCODE_DUPLICATE_ALIAS), errmsg("table name \"%s\" specified more than once", aliasname1)));
}
}
}
* given an RTE, return RT index (starting with 1) of the entry,
* and optionally get its nesting depth (0 = current). If sublevels_up
* is NULL, only consider rels at the current nesting level.
* Raises error if RTE not found.
*/
int RTERangeTablePosn(ParseState* pstate, RangeTblEntry* rte, int* sublevels_up)
{
int index;
ListCell* l = NULL;
if (sublevels_up != NULL) {
*sublevels_up = 0;
}
while (pstate != NULL) {
index = 1;
foreach (l, pstate->p_rtable) {
RangeTblEntry* rte_entry = (RangeTblEntry*)lfirst(l);
if (rte == rte_entry || (pstate->is_outer_parse_state == true && strcmp(rte->relname, rte_entry->relname) == 0)) {
return index;
}
index++;
}
pstate = pstate->parentParseState;
if (sublevels_up != NULL) {
(*sublevels_up)++;
} else {
break;
}
}
ereport(ERROR, (errcode(ERRCODE_SYNTAX_ERROR), errmsg("RTE not found (internal error)")));
return 0;
}
* Given an RT index and nesting depth, find the corresponding RTE.
* This is the inverse of RTERangeTablePosn.
*/
RangeTblEntry* GetRTEByRangeTablePosn(ParseState* pstate, int varno, int sublevels_up)
{
while (sublevels_up-- > 0) {
pstate = pstate->parentParseState;
AssertEreport(pstate != NULL, MOD_OPT, "");
}
AssertEreport(varno > 0 && varno <= list_length(pstate->p_rtable), MOD_OPT, "");
return rt_fetch(varno, pstate->p_rtable);
}
* Fetch the CTE for a CTE-reference RTE.
*
* rtelevelsup is the number of query levels above the given pstate that the
* RTE came from. Callers that don't have this information readily available
* may pass -1 instead.
*/
CommonTableExpr* GetCTEForRTE(ParseState* pstate, RangeTblEntry* rte, int rtelevelsup)
{
Index levelsup;
ListCell* lc = NULL;
if (rtelevelsup < 0) {
(void)RTERangeTablePosn(pstate, rte, &rtelevelsup);
}
AssertEreport(rte->rtekind == RTE_CTE, MOD_OPT, "");
levelsup = rte->ctelevelsup + rtelevelsup;
while (levelsup-- > 0) {
pstate = pstate->parentParseState;
if (pstate == NULL)
ereport(ERROR,
(errcode(ERRCODE_OPTIMIZER_INCONSISTENT_STATE), errmsg("bad levelsup for CTE \"%s\"", rte->ctename)));
}
foreach (lc, pstate->p_ctenamespace) {
CommonTableExpr* cte = (CommonTableExpr*)lfirst(lc);
if (strcmp(cte->ctename, rte->ctename) == 0) {
return cte;
}
}
ereport(ERROR, (errcode(ERRCODE_NO_DATA_FOUND), errmsg("could not find CTE \"%s\"", rte->ctename)));
return NULL;
}
* scanRTEForColumn
* Search the column names of a single RTE for the given name.
* If found, return an appropriate Var node, else return NULL.
* If the name proves ambiguous within this RTE, raise error.
*
* Side effect: if we find a match, mark the RTE as requiring read access
* for the column.
*/
Node* scanRTEForColumn(ParseState* pstate, RangeTblEntry* rte, char* colname, int location, bool omit_excluded)
{
Node* result = NULL;
int attnum = 0;
Var* var = NULL;
ListCell* c = NULL;
if (rte->eref == NULL)
return result;
* Scan the user column names (or aliases) for a match. Complain if
* multiple matches.
*
* Note: eref->colnames may include entries for dropped columns, but those
* will be empty strings that cannot match any legal SQL identifier, so we
* don't bother to test for that case here.
*
* Should this somehow go wrong and we try to access a dropped column,
* we'll still catch it by virtue of the checks in
* get_rte_attribute_type(), which is called by make_var(). That routine
* has to do a cache lookup anyway, so the check there is cheap.
*/
foreach (c, rte->eref->colnames) {
attnum++;
if (omit_excluded && rte->isexcluded) {
continue;
}
if (strcmp(strVal(lfirst(c)), colname) == 0) {
if (result != NULL) {
ereport(ERROR,
(errcode(ERRCODE_AMBIGUOUS_COLUMN), errmsg("column reference \"%s\" is ambiguous", colname),
parser_errposition(pstate, location)));
}
* When user specifies a query on a hidden column. but it actually invisible to the user.
* So just ignore this column, this only happens on timeseries table.
*/
if (strcmp(TS_PSEUDO_DIST_COLUMN, colname) == 0) {
var = ts_make_var(pstate, rte, attnum, location);
if (var == NULL) {
continue;
}
} else {
var = make_var(pstate, rte, attnum, location);
}
markVarForSelectPriv(pstate, var, rte);
result = (Node*)var;
}
}
* If we have a unique match, return it. Note that this allows a user
* alias to override a system column name (such as OID) without error.
*/
if (result != NULL) {
return result;
}
* If the RTE represents a real table, consider system column names.
*/
if (rte->rtekind == RTE_RELATION && rte->relkind != RELKIND_FOREIGN_TABLE && rte->relkind != RELKIND_STREAM) {
attnum = specialAttNum(colname);
* In generated column, no system column is allowed except tableOid.
*/
if (pstate->p_expr_kind == EXPR_KIND_GENERATED_COLUMN && attnum < InvalidAttrNumber) {
ereport(ERROR, (errmodule(MOD_GEN_COL), errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("cannot use system column \"%s\" in column generation expression", colname),
parser_errposition(pstate, location)));
}
if (attnum != InvalidAttrNumber) {
* Now check to see if column actually is defined. Because of
* an ancient oversight in DefineQueryRewrite, it's possible that
* pg_attribute contains entries for system columns for a view,
* even though views should not have such --- so we also check
* the relkind. This kluge will not be needed in 9.3 and later.
*/
if (SearchSysCacheExists2(ATTNUM, ObjectIdGetDatum(rte->relid), Int16GetDatum(attnum)) &&
get_rel_relkind(rte->relid) != RELKIND_VIEW && get_rel_relkind(rte->relid) != RELKIND_CONTQUERY) {
var = make_var(pstate, rte, attnum, location);
markVarForSelectPriv(pstate, var, rte);
result = (Node*)var;
}
}
}
return result;
}
* colNameToVar
* Search for an unqualified column name.
* If found, return the appropriate Var node (or expression).
* If not found, return NULL. If the name proves ambiguous, raise error.
* If localonly is true, only names in the innermost query are considered.
*/
Node* colNameToVar(ParseState* pstate, char* colname, bool localonly, int location, RangeTblEntry** final_rte)
{
Node* result = NULL;
ParseState* orig_pstate = pstate;
while (pstate != NULL) {
ListCell* l = NULL;
foreach (l, pstate->p_varnamespace) {
ParseNamespaceItem *nsitem = (ParseNamespaceItem *) lfirst(l);
RangeTblEntry *rte = nsitem->p_rte;
Node* newresult = NULL;
if (nsitem->p_lateral_only && !pstate->p_lateral_active)
continue;
newresult = scanRTEForColumn(orig_pstate, rte, colname, location, true);
if (newresult != NULL) {
if (final_rte != NULL) {
*final_rte = rte;
}
* Under normal circumstances, the alias of the column with the same name needs to be specified, but in
* some cases, it can not be specified. For example, the scene of 'merge into (matched)' takes
* priority to find in the target RTE. If it is found, it will jump out. Otherwise, it will be found
* in the source RTE. This search order is also found in the order of the RTE list, use_level of pstate
* attribute represents whether to use this rule.
*/
if (result != NULL && pstate->use_level) {
break;
}
if (result != NULL) {
ereport(ERROR,
(errcode(ERRCODE_AMBIGUOUS_COLUMN),
errmsg("column reference \"%s\" is ambiguous", colname),
parser_errposition(orig_pstate, location)));
}
if (nsitem->p_lateral_only && !nsitem->p_lateral_ok)
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("invalid reference to FROM-clause entry for table \"%s\"", rte->eref->aliasname),
errdetail("The combining JOIN type must be INNER or LEFT for a LATERAL reference."),
parser_errposition(orig_pstate, location)));
result = newresult;
}
}
if (result != NULL || localonly) {
break;
}
pstate = pstate->parentParseState;
}
return result;
}
* searchRangeTableForCol
* See if any RangeTblEntry could possibly provide the given column name.
* If so, return a pointer to the RangeTblEntry; else return NULL.
*
* This is different from colNameToVar in that it considers every entry in
* the ParseState's rangetable(s), not only those that are currently visible
* in the p_varnamespace lists. This behavior is invalid per the SQL spec,
* and it may give ambiguous results (there might be multiple equally valid
* matches, but only one will be returned). This must be used ONLY as a
* heuristic in giving suitable error messages. See errorMissingColumn.
*/
static RangeTblEntry *
searchRangeTableForCol(ParseState *pstate, char *colname, int location)
{
ParseState *orig_pstate = pstate;
while (pstate != NULL)
{
ListCell *l = NULL;
foreach(l, pstate->p_rtable)
{
RangeTblEntry *rte = (RangeTblEntry *)lfirst(l);
if (scanRTEForColumn(orig_pstate, rte, colname, location))
return rte;
}
pstate = pstate->parentParseState;
}
return NULL;
}
* markRTEForSelectPriv
* Mark the specified column of an RTE as requiring SELECT privilege
*
* col == InvalidAttrNumber means a "whole row" reference
*
* The caller should pass the actual RTE if it has it handy; otherwise pass
* NULL, and we'll look it up here. (This uglification of the API is
* worthwhile because nearly all external callers have the RTE at hand.)
*/
static void markRTEForSelectPriv(ParseState* pstate, RangeTblEntry* rte, int rtindex, AttrNumber col)
{
if (rte == NULL) {
rte = rt_fetch(rtindex, pstate->p_rtable);
}
if (rte->rtekind == RTE_RELATION) {
rte->requiredPerms |= ACL_SELECT;
rte->selectedCols = bms_add_member(rte->selectedCols, col - FirstLowInvalidHeapAttributeNumber);
} else if (rte->rtekind == RTE_JOIN) {
if (col == InvalidAttrNumber) {
* A whole-row reference to a join has to be treated as whole-row
* references to the two inputs.
*/
JoinExpr* j = NULL;
if (rtindex > 0 && rtindex <= list_length(pstate->p_joinexprs)) {
j = (JoinExpr*)list_nth(pstate->p_joinexprs, rtindex - 1);
} else {
j = NULL;
}
if (j == NULL) {
ereport(
ERROR, (errcode(ERRCODE_NO_DATA_FOUND), errmsg("could not find JoinExpr for whole-row reference")));
}
AssertEreport(IsA(j, JoinExpr), MOD_OPT, "");
if (IsA(j->larg, RangeTblRef)) {
int varno = ((RangeTblRef*)j->larg)->rtindex;
markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
} else if (IsA(j->larg, JoinExpr)) {
int varno = ((JoinExpr*)j->larg)->rtindex;
markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
} else
ereport(ERROR,
(errcode(ERRCODE_UNRECOGNIZED_NODE_TYPE),
errmsg("unrecognized node type: %d", (int)nodeTag(j->rarg))));
if (IsA(j->rarg, RangeTblRef)) {
int varno = ((RangeTblRef*)j->rarg)->rtindex;
markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
} else if (IsA(j->rarg, JoinExpr)) {
int varno = ((JoinExpr*)j->rarg)->rtindex;
markRTEForSelectPriv(pstate, NULL, varno, InvalidAttrNumber);
} else {
ereport(ERROR,
(errcode(ERRCODE_UNRECOGNIZED_NODE_TYPE),
errmsg("unrecognized node type: %d", (int)nodeTag(j->rarg))));
}
} else {
* Regular join attribute, look at the alias-variable list.
*
* The aliasvar could be either a Var or a COALESCE expression,
* but in the latter case we should already have marked the two
* referent variables as being selected, due to their use in the
* JOIN clause. So we need only be concerned with the simple Var
* case.
*/
Var* aliasvar = NULL;
AssertEreport(col > 0 && col <= list_length(rte->joinaliasvars), MOD_OPT, "");
aliasvar = (Var*)list_nth(rte->joinaliasvars, col - 1);
if (IsA(aliasvar, Var)) {
markVarForSelectPriv(pstate, aliasvar, NULL);
}
}
}
}
* markVarForSelectPriv
* Mark the RTE referenced by a Var as requiring SELECT privilege
*
* The caller should pass the Var's referenced RTE if it has it handy
* (nearly all do); otherwise pass NULL.
*/
void markVarForSelectPriv(ParseState* pstate, Var* var, RangeTblEntry* rte)
{
Index lv;
AssertEreport(IsA(var, Var), MOD_OPT, "");
for (lv = 0; lv < var->varlevelsup; lv++) {
pstate = pstate->parentParseState;
}
markRTEForSelectPriv(pstate, rte, var->varno, var->varattno);
}
* buildRelationAliases
* Construct the eref column name list for a relation RTE.
* This code is also used for the case of a function RTE returning
* a named composite type.
*
* tupdesc: the physical column information
* alias: the user-supplied alias, or NULL if none
* eref: the eref Alias to store column names in
*
* eref->colnames is filled in. Also, alias->colnames is rebuilt to insert
* empty strings for any dropped columns, so that it will be one-to-one with
* physical column numbers.
*/
static void buildRelationAliases(TupleDesc tupdesc, Alias* alias, Alias* eref)
{
int maxattrs = tupdesc->natts;
ListCell* aliaslc = NULL;
int numaliases;
int varattno;
int numdropped = 0;
AssertEreport(eref->colnames == NIL, MOD_OPT, "");
if (alias != NULL) {
aliaslc = list_head(alias->colnames);
numaliases = list_length(alias->colnames);
alias->colnames = NIL;
} else {
aliaslc = NULL;
numaliases = 0;
}
for (varattno = 0; varattno < maxattrs; varattno++) {
Form_pg_attribute attr = &tupdesc->attrs[varattno];
Value* attrname = NULL;
if (attr->attisdropped) {
attrname = makeString(pstrdup(""));
if (aliaslc != NULL) {
alias->colnames = lappend(alias->colnames, attrname);
}
numdropped++;
} else if (aliaslc != NULL) {
attrname = (Value*)lfirst(aliaslc);
aliaslc = lnext(aliaslc);
alias->colnames = lappend(alias->colnames, attrname);
} else {
attrname = makeString(pstrdup(NameStr(attr->attname)));
}
eref->colnames = lappend(eref->colnames, attrname);
}
if (aliaslc != NULL) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("table \"%s\" has %d columns available but %d columns specified",
eref->aliasname,
maxattrs - numdropped,
numaliases)));
}
}
* buildScalarFunctionAlias
* Construct the eref column name list for a function RTE,
* when the function returns a scalar type (not composite or RECORD).
*
* funcexpr: transformed expression tree for the function call
* funcname: function name (used only for error message)
* alias: the user-supplied alias, or NULL if none
* eref: the eref Alias to store column names in
*
* eref->colnames is filled in.
*/
static void buildScalarFunctionAlias(Node* funcexpr, char* funcname, Alias* alias, Alias* eref)
{
char* pname = NULL;
AssertEreport(eref->colnames == NIL, MOD_OPT, "");
if (alias != NULL && alias->colnames != NIL) {
if (list_length(alias->colnames) != 1) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("too many column aliases specified for function %s", funcname)));
}
eref->colnames = (List*)copyObject(alias->colnames);
return;
}
* If the expression is a simple function call, and the function has a
* single OUT parameter that is named, use the parameter's name.
*/
if (funcexpr && IsA(funcexpr, FuncExpr)) {
pname = get_func_result_name(((FuncExpr*)funcexpr)->funcid);
if (pname != NULL) {
eref->colnames = list_make1(makeString(pname));
return;
}
}
* Otherwise use the previously-determined alias (not necessarily the
* function name!)
*/
eref->colnames = list_make1(makeString(eref->aliasname));
}
static void CheckViewColumnExists(Oid view_oid, int2 attnum)
{
HeapTuple tuple = SearchSysCache2(ATTNUM, ObjectIdGetDatum(view_oid), Int16GetDatum(attnum));
if (!HeapTupleIsValid(tuple)) {
elog(ERROR, "catalog lookup failed for column %d of relation %u", attnum, view_oid);
}
ReleaseSysCache(tuple);
}
static bool CheckPartitionList(List *partList, List *rtePartNameList, List *rtePartOidList)
{
ListCell *nameCell = NULL;
ListCell *oidCell = NULL;
bool result = true;
forboth (nameCell, rtePartNameList, oidCell, rtePartOidList) {
char *partitionName = strVal(lfirst(nameCell));
Oid rtePartOid = lfirst_oid(oidCell);
ListCell *cell = NULL;
bool hasPartName = false;
foreach (cell, partList) {
Partition partition = (Partition)lfirst(cell);
if (strcmp(partition->pd_part->relname.data, partitionName) == 0) {
hasPartName = true;
if (rtePartOid != partition->pd_id) {
lfirst_oid(oidCell) = partition->pd_id;
}
break;
}
}
if (!hasPartName) {
result = false;
break;
}
}
return result;
}
static bool CheckPartitionRelation(RangeTblEntry *rte, Oid relationOid)
{
List *subpartitionList = NIL;
List *partitionList = NIL;
bool hasSubpartName = false;
bool hasPartName = false;
bool result = false;
Relation rel = relation_open(relationOid, AccessShareLock);
if (rte->isContainSubPartition) {
subpartitionList = RelationGetSubPartitionList(rel, AccessShareLock);
hasSubpartName = CheckPartitionList(subpartitionList, rte->subpartitionNameList, rte->subpartitionOidList);
releasePartitionList(rel, &subpartitionList, AccessShareLock);
}
partitionList = relationGetPartitionList(rel, AccessShareLock);
hasPartName = CheckPartitionList(partitionList, rte->partitionNameList, rte->partitionOidList);
releasePartitionList(rel, &partitionList, AccessShareLock);
relation_close(rel, AccessShareLock);
if ((rte->isContainPartition && hasPartName) ||
(rte->isContainSubPartition && hasSubpartName && hasPartName)) {
result = true;
}
return result;
}
* try to get new relation oid by namespace and relname, replace the old ones
* in query and update pg_depend.
*/
static bool CheckRTable(Query *query, Oid rel_oid, Oid rewrite_oid)
{
ListCell *lc = NULL;
foreach(lc, query->rtable) {
RangeTblEntry *rte = (RangeTblEntry *)lfirst(lc);
if (rte == NULL) {
return false;
}
if (rte->relid == rel_oid || rte->rtekind != RTE_RELATION) {
continue;
}
if (rte->relname == NULL || rte->relnamespace == NULL) {
return false;
}
Oid namespace_oid = get_namespace_oid(rte->relnamespace, true);
if (!OidIsValid(namespace_oid)) {
return false;
}
Oid newRelOid = get_relname_relid(rte->relname, namespace_oid);
if (!OidIsValid(newRelOid)) {
return false;
}
Oid oldRefId = rte->relid;
if (oldRefId == newRelOid) {
continue;
}
rte->relid = newRelOid;
HeapTuple dependTup = NULL;
Relation dependRel = heap_open(DependRelationId, RowExclusiveLock);
const int keyNum = 2;
ScanKeyData key[keyNum];
SysScanDesc scan = NULL;
ScanKeyInit(&key[0], Anum_pg_depend_classid, BTEqualStrategyNumber, F_OIDEQ,
ObjectIdGetDatum(RewriteRelationId));
ScanKeyInit(&key[1], Anum_pg_depend_objid, BTEqualStrategyNumber, F_OIDEQ, ObjectIdGetDatum(rewrite_oid));
List* toBeUpdatedTups = NIL;
ListCell* lc1 = NULL;
scan = systable_beginscan(dependRel, DependDependerIndexId, true, NULL, keyNum, key);
while (HeapTupleIsValid(dependTup = systable_getnext(scan))) {
Form_pg_depend dep_form = (Form_pg_depend)GETSTRUCT(dependTup);
if (dep_form->refobjid == oldRefId) {
toBeUpdatedTups = lappend(toBeUpdatedTups, heapCopyTuple(dependTup, dependRel->rd_att, NULL));
}
}
foreach (lc1, toBeUpdatedTups) {
HeapTuple tuple = (HeapTuple)lfirst(lc1);
Datum values[Natts_pg_depend] = { 0 };
bool nulls[Natts_pg_depend] = { 0 };
bool replaces[Natts_pg_depend] = { 0 };
values[Anum_pg_depend_refobjid - 1] = ObjectIdGetDatum(newRelOid);
replaces[Anum_pg_depend_refobjid - 1] = true;
HeapTuple new_dep_tuple = heap_modify_tuple(tuple, RelationGetDescr(dependRel), values, nulls, replaces);
simple_heap_update(dependRel, &new_dep_tuple->t_self, new_dep_tuple);
CatalogUpdateIndexes(dependRel, new_dep_tuple);
CommandCounterIncrement();
heap_freetuple_ext(new_dep_tuple);
}
list_free_deep(toBeUpdatedTups);
systable_endscan(scan);
heap_close(dependRel, RowExclusiveLock);
if ((rte->isContainPartition || rte->isContainSubPartition) && !CheckPartitionRelation(rte, newRelOid)) {
return false;
}
}
return true;
}
* try to get new function oid by pg_depend's depsrc, replace the old ones
* in FuncExpr and update pg_depend.
*/
bool CheckFuncExpr(FuncExpr* funcExpr, Oid rewrite_oid)
{
if (function_exists(funcExpr->funcid)) {
return true;
}
Oid newFuncid = InvalidOid;
HeapTuple dependTup = NULL;
Relation dependRel = heap_open(DependRelationId, AccessShareLock);
const int keyNum = 2;
ScanKeyData key[keyNum];
SysScanDesc scan = NULL;
ScanKeyInit(&key[0], Anum_pg_depend_classid, BTEqualStrategyNumber, F_OIDEQ,
ObjectIdGetDatum(RewriteRelationId));
ScanKeyInit(&key[1], Anum_pg_depend_objid, BTEqualStrategyNumber, F_OIDEQ, ObjectIdGetDatum(rewrite_oid));
scan = systable_beginscan(dependRel, DependDependerIndexId, true, NULL, keyNum, key);
while (HeapTupleIsValid(dependTup = systable_getnext(scan))) {
Form_pg_depend dep_form = (Form_pg_depend)GETSTRUCT(dependTup);
if (dep_form->refobjid == funcExpr->funcid) {
break;
}
}
if (!HeapTupleIsValid(dependTup)) {
systable_endscan(scan);
heap_close(dependRel, AccessShareLock);
return false;
}
bool isnull = false;
Datum depsrc = heap_getattr(dependTup, Anum_pg_depend_depsrc, RelationGetDescr(dependRel), &isnull);
if (isnull) {
systable_endscan(scan);
heap_close(dependRel, RowExclusiveLock);
return false;
}
List* namelist = stringToQualifiedNameList(TextDatumGetCString(depsrc));
char* schemaname = NULL;
char* pkgname = NULL;
char* funcname = NULL;
DeconstructQualifiedName(namelist, &schemaname, &funcname, &pkgname);
list_free_ext(namelist);
systable_endscan(scan);
heap_close(dependRel, AccessShareLock);
Oid schemaOid = get_namespace_oid(schemaname, true);
if (!OidIsValid(schemaOid)) {
return false;
}
if (pkgname != NULL) {
Oid pkgOid = PackageNameGetOid(pkgname, schemaOid);
if (!OidIsValid(pkgOid)) {
return false;
}
List* pkgFuncOids = GetFunctionOidsByPackageOid(pkgOid);
ListCell* lc = NULL;
foreach (lc, pkgFuncOids) {
char* pkgFuncName = get_func_name(lfirst_oid(lc));
if (pkgFuncName != NULL && strcmp(pkgFuncName, funcname) == 0) {
newFuncid = lfirst_oid(lc);
pfree(pkgFuncName);
break;
}
pfree_ext(pkgFuncName);
}
} else {
newFuncid = get_func_oid(funcname, schemaOid, NULL, true);
}
if (!OidIsValid(newFuncid)) {
return false;
}
funcExpr->funcid = newFuncid;
return true;
}
typedef struct change_relid_and_funcid_context {
Oid rel_oid;
Oid rewrite_oid;
bool allExist;
} change_relid_and_funcid_context;
bool change_relid_and_funcid_walker(Node* node, change_relid_and_funcid_context* context)
{
if (node == NULL) {
return false;
}
if (IsA(node, FuncExpr)) {
FuncExpr* funcExpr = (FuncExpr*)node;
if (!CheckFuncExpr(funcExpr, context->rewrite_oid)) {
context->allExist = false;
return false;
}
}
if (IsA(node, Query)) {
Query* qry = (Query*)node;
if (!CheckRTable(qry, context->rel_oid, context->rewrite_oid)) {
context->allExist = false;
return true;
}
return query_tree_walker(qry, (bool (*)())change_relid_and_funcid_walker, context, 0);
}
return expression_tree_walker(node, (bool (*)())change_relid_and_funcid_walker, (void*)context);
}
* walk through whole query to search all rtables, which some maybe
* hang on a subquery
*/
static bool CheckViewRelation(Oid rel_oid, Oid rewrite_oid, Query* query)
{
change_relid_and_funcid_context context;
context.rel_oid = rel_oid;
context.rewrite_oid = rewrite_oid;
context.allExist = true;
change_relid_and_funcid_walker((Node*)query, &context);
return context.allExist;
}
typedef struct search_rte_context {
Oid rel_oid;
int2 attnum;
char* attname;
} search_rte_context;
bool search_rte_walker(Node* node, search_rte_context* context)
{
if (node == NULL) {
return false;
}
if (IsA(node, Query)) {
ListCell* lc = NULL;
Query* query = (Query*)node;
foreach (lc, query->rtable) {
RangeTblEntry *rte = (RangeTblEntry *)lfirst(lc);
if (rte->relid == context->rel_oid) {
context->attname = strVal(list_nth(rte->eref->colnames, context->attnum - 1));
return false;
}
}
return query_tree_walker(query, (bool (*)())search_rte_walker, context, 0);
}
return expression_tree_walker(node, (bool (*)())search_rte_walker, (void*)context);
}
* find rte byu walking through all rtables of query and its sublevel query,
* and return colname.
*/
static char* get_attname_from_rte(Query* query, Oid rel_oid, int2 attnum)
{
search_rte_context context;
context.rel_oid = rel_oid;
context.attnum = attnum;
(void)search_rte_walker((Node*)query, &context);
return context.attname;
}
static bool CheckRelationColumnExists(Oid rel_oid, int2 attnum, Query* query, int2* newAttnum)
{
char* attname = get_attname_from_rte(query, rel_oid, attnum);
HeapTuple tuple;
Form_pg_attribute attForm;
tuple = SearchSysCache2(ATTNAME, ObjectIdGetDatum(rel_oid), CStringGetDatum(attname));
if (!HeapTupleIsValid(tuple)) {
tuple = SearchSysCache2(ATTNUM, ObjectIdGetDatum(rel_oid), Int16GetDatum(attnum));
if (!HeapTupleIsValid(tuple)) {
return false;
}
}
attForm = (Form_pg_attribute)GETSTRUCT(tuple);
if (attForm->attisdropped) {
ReleaseSysCache(tuple);
return false;
}
*newAttnum = attForm->attnum;
ReleaseSysCache(tuple);
return true;
}
static bool findDependentTable(Relation rel, Oid type_id)
{
bool found = false;
if (!OidIsValid(type_id)) {
return found;
}
const int keyNum = 2;
ScanKeyData key_dep[keyNum];
SysScanDesc scan_dep = NULL;
HeapTuple tup_dep = NULL;
ScanKeyInit(&key_dep[0], Anum_pg_depend_refclassid, BTEqualStrategyNumber, F_OIDEQ,
ObjectIdGetDatum(TypeRelationId));
ScanKeyInit(&key_dep[1], Anum_pg_depend_refobjid, BTEqualStrategyNumber, F_OIDEQ, ObjectIdGetDatum(type_id));
scan_dep = systable_beginscan(rel, DependReferenceIndexId, true, NULL, keyNum, key_dep);
while (HeapTupleIsValid((tup_dep = systable_getnext(scan_dep)))) {
Form_pg_depend depform = (Form_pg_depend)GETSTRUCT(tup_dep);
if (depform->classid == RelationRelationId) {
found = true;
break;
}
}
systable_endscan(scan_dep);
return found;
}
static ValidateDependResult ValidateDependView(Oid view_oid, char objType, List** list, bool force, StringInfo buf)
{
bool isValid = true;
bool existTable = false;
Oid rw_objid = InvalidOid;
Oid type_id = InvalidOid;
List* originEvAction = NIL;
if (!force && GetPgObjectValid(view_oid, objType)) {
return ValidateDependValid;
}
if (*list != NIL && list_member_oid(*list, view_oid)) {
return ValidateDependCircularDepend;
}
*list = lappend_oid(*list, view_oid);
const int keyNum = 2;
ScanKeyData key[keyNum];
SysScanDesc scan = NULL;
HeapTuple tup = NULL;
Relation rel = heap_open(DependRelationId, AccessShareLock);
ScanKeyInit(&key[0], Anum_pg_depend_refclassid, BTEqualStrategyNumber, F_OIDEQ,
ObjectIdGetDatum(RelationRelationId));
ScanKeyInit(&key[1], Anum_pg_depend_refobjid, BTEqualStrategyNumber, F_OIDEQ, ObjectIdGetDatum(view_oid));
scan = systable_beginscan(rel, DependReferenceIndexId, true, NULL, keyNum, key);
while (HeapTupleIsValid((tup = systable_getnext(scan)))) {
Form_pg_depend depform = (Form_pg_depend)GETSTRUCT(tup);
if (depform->classid == RewriteRelationId && depform->deptype == DEPENDENCY_INTERNAL) {
rw_objid = depform->objid;
} else if (depform->classid == TypeRelationId && depform->deptype == DEPENDENCY_INTERNAL) {
type_id = depform->objid;
}
}
systable_endscan(scan);
heap_close(rel, AccessShareLock);
if (!OidIsValid(rw_objid)) {
elog(ERROR, "cannot find the internal dependent pg_rewrite entry.");
}
originEvAction = GetOriginalViewQuery(rw_objid);
Query *query = (Query*)linitial(originEvAction);
* 3.1 check relation if exist, if not, try to correct it.
* Table on which the view depends maybe rebuilt, so relid of them in view-query
* are invalid, and we need to set the new ones. If table not be rebuilt, view cannot
* be restore, return directly.
*/
if (!CheckViewRelation(view_oid, rw_objid, query)) {
return ValidateDependInvalid;
}
* 3.2 find all columns of parent views and tables which this view depends on directly,
* and check their validity recursively.
*/
List *query_str = NIL;
ScanKeyData key_dep[keyNum];
SysScanDesc scan_dep = NULL;
HeapTuple tup_dep = NULL;
Relation rel_dep = heap_open(DependRelationId, RowExclusiveLock);
ScanKeyInit(&key_dep[0], Anum_pg_depend_classid, BTEqualStrategyNumber, F_OIDEQ,
ObjectIdGetDatum(RewriteRelationId));
ScanKeyInit(&key_dep[1], Anum_pg_depend_objid, BTEqualStrategyNumber, F_OIDEQ, ObjectIdGetDatum(rw_objid));
scan_dep = systable_beginscan(rel_dep, DependDependerIndexId, true, NULL, keyNum, key_dep);
bool circularDependency = false;
List* depViewList = NIL;
while (HeapTupleIsValid((tup_dep = systable_getnext(scan_dep)))) {
Form_pg_depend depform = (Form_pg_depend)GETSTRUCT(tup_dep);
if (depform->refclassid != RelationRelationId || depform->deptype != DEPENDENCY_NORMAL ||
depform->refobjsubid == 0) {
continue;
}
Oid dep_objid = depform->refobjid;
int2 dep_objsubid = depform->refobjsubid;
char relkind = get_rel_relkind(dep_objid);
int2 newAttnum = 0;
if (relkind == RELKIND_RELATION) {
* the column exists, but it may have been deleted and recreated, and its
* type and attnum may have changed, so try to get the new attnum.
*/
isValid &= CheckRelationColumnExists(dep_objid, dep_objsubid, query, &newAttnum);
if (newAttnum > 0) {
if (newAttnum != dep_objsubid) {
Datum values[Natts_pg_depend] = { 0 };
bool nulls[Natts_pg_depend] = { 0 };
bool replaces[Natts_pg_depend] = { 0 };
HeapTuple new_dep_tuple;
values[Anum_pg_depend_refobjsubid - 1] = Int32GetDatum(newAttnum);
replaces[Anum_pg_depend_refobjsubid - 1] = true;
new_dep_tuple = heap_modify_tuple(tup_dep, RelationGetDescr(rel_dep), values, nulls, replaces);
simple_heap_update(rel_dep, &new_dep_tuple->t_self, new_dep_tuple);
CatalogUpdateIndexes(rel_dep, new_dep_tuple);
heap_freetuple_ext(new_dep_tuple);
CommandCounterIncrement();
change_var_attno(query, dep_objid, dep_objsubid, newAttnum);
}
}
} else if (relkind == RELKIND_VIEW || relkind == RELKIND_MATVIEW) {
if (force && depViewList != NIL && list_member_oid(depViewList, dep_objid)) {
continue;
}
depViewList = lappend_oid(depViewList, dep_objid);
char type = relkind == RELKIND_VIEW ? OBJECT_TYPE_VIEW : OBJECT_TYPE_MATVIEW;
ValidateDependResult result = ValidateDependView(dep_objid, type, list, force);
if (result == ValidateDependCircularDepend) {
list_free_ext(depViewList);
list_free(*list);
ereport(ERROR,
(errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
errmsg(
"infinite recursion detected in rules for relation: \"%s\"", get_rel_name(view_oid))));
}
isValid &= (result != ValidateDependInvalid);
if (isValid) {
* here means dep_objid is valid, we should keep the same view_oid.attr with dep_objid.dep_objsubid
* find dep_objid.dep_objsubid
*/
CheckViewColumnExists(dep_objid, dep_objsubid);
}
circularDependency |= (result == ValidateDependCircularDepend);
}
if (!isValid) {
list_free_ext(depViewList);
systable_endscan(scan_dep);
heap_close(rel_dep, RowExclusiveLock);
return ValidateDependInvalid;
}
}
list_free_ext(depViewList);
systable_endscan(scan_dep);
* 3.3 find views or tables which depend on this view directly,
* and report error if tables exist.
*/
existTable = findDependentTable(rel_dep, type_id);
if (existTable) {
elog(ERROR, "The view is invalid. There is a table dependent on the view so it cannot be recompiled.");
}
heap_close(rel_dep, RowExclusiveLock);
* 3.4 update pg_attribute for column type of view maybe changed
* and pg_rewrite for ev_action
*/
UpdateAttrAndRewriteForView(view_oid, rw_objid, originEvAction, query, &query_str);
if (!circularDependency) {
SetPgObjectValid(view_oid, objType, true);
}
if (!circularDependency && query_str != NIL) {
ReplaceViewQueryFirstAfter(query_str);
CommandCounterIncrement();
}
if (buf != NULL) {
appendStringInfo(buf, "%s", ((struct ViewInfoForAdd*)linitial(query_str))->query_string);
}
list_free_ext(query_str);
if (objType == OBJECT_TYPE_MATVIEW) {
HeapTuple tup = SearchSysCache1(RELOID, ObjectIdGetDatum(view_oid));
Form_pg_class relform = (Form_pg_class)GETSTRUCT(tup);
Oid toastid = relform->reltoastrelid;
if (OidIsValid(toastid)) {
HeapTuple toasttuple = SearchSysCache1(RELOID, ObjectIdGetDatum(toastid));
if (!HeapTupleIsValid(toasttuple)) {
Relation rel_class = heap_open(RelationRelationId, RowExclusiveLock);
Datum values[Natts_pg_class] = { 0 };
bool nulls[Natts_pg_class] = { 0 };
bool replaces[Natts_pg_class] = { 0 };
HeapTuple newtuple;
values[Anum_pg_class_reltoastrelid - 1] = InvalidOid;
replaces[Anum_pg_class_reltoastrelid - 1] = true;
newtuple = heap_modify_tuple(tup, RelationGetDescr(rel_class), values, nulls, replaces);
simple_heap_update(rel_class, &newtuple->t_self, newtuple);
CatalogUpdateIndexes(rel_class, newtuple);
heap_freetuple_ext(newtuple);
CommandCounterIncrement();
heap_close(rel_class, RowExclusiveLock);
} else {
ReleaseSysCache(toasttuple);
}
}
ReleaseSysCache(tup);
}
list_free_deep(originEvAction);
return (ValidateDependResult)isValid;
}
bool ValidateDependView(Oid view_oid, char objType, StringInfo buf)
{
List * list = NIL;
ValidateDependResult result = ValidateDependView(view_oid, objType, &list, false, buf);
list_free_ext(list);
if (result == ValidateDependCircularDepend) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
errmsg(
"infinite recursion detected in rules for relation: \"%s\"", get_rel_name(view_oid))));
}
return result != ValidateDependInvalid;
}
bool ValidateDependViewDetectRecursion(Oid viewOid, char objType, bool force, List* records)
{
ListCell* lc;
List* list = NIL;
if (records != NIL && list_member_oid(records, viewOid)) {
return true;
}
ValidateDependResult result = ValidateDependView(viewOid, objType, &list, force);
if (result == ValidateDependCircularDepend) {
list_free(list);
ereport(ERROR, (errcode(ERRCODE_INVALID_OBJECT_DEFINITION),
errmsg("infinite recursion detected in rules for relation: \"%s\"", get_rel_name(viewOid))));
}
foreach (lc, list) {
records = list_append_unique_oid(records, lfirst_oid(lc));
}
list_free(list);
return result != ValidateDependInvalid;
}
* Open a table during parse analysis
*
* This is essentially just the same as heap_openrv(), except that it caters
* to some parser-specific error reporting needs, notably that it arranges
* to include the RangeVar's parse location in any resulting error.
*
* Note: properly, lockmode should be declared LOCKMODE not int, but that
* would require importing storage/lock/lock.h into parse_relation.h. Since
* LOCKMODE is typedef'd as int anyway, that seems like overkill.
*/
Relation parserOpenTable(ParseState *pstate, const RangeVar *relation, int lockmode, bool isFirstNode,
bool isCreateView, bool isSupportSynonym)
{
Relation rel = NULL;
ParseCallbackState pcbstate;
StringInfoData detailInfo;
initStringInfo(&detailInfo);
char *snapshot_name = strchr(relation->relname, DB4AI_SNAPSHOT_VERSION_DELIMITER);
if (unlikely(snapshot_name)) {
*snapshot_name = *u_sess->attr.attr_sql.db4ai_snapshot_version_delimiter;
while (*(++snapshot_name)) {
if (*snapshot_name == DB4AI_SNAPSHOT_VERSION_SEPARATOR) {
*snapshot_name = *u_sess->attr.attr_sql.db4ai_snapshot_version_separator;
}
}
}
setup_parser_errposition_callback(&pcbstate, pstate, relation->location);
rel = HeapOpenrvExtended(relation, lockmode, true, isSupportSynonym, &detailInfo);
if (rel == NULL) {
#ifdef ENABLE_MOT
if (u_sess->mot_cxt.jit_compile_depth > 0) {
u_sess->mot_cxt.jit_parse_error = MOT_JIT_TABLE_NOT_FOUND;
}
#endif
if (relation->schemaname) {
if (IS_PGXC_DATANODE) {
* support multi-nodegroup, maybe the relation is in coordinator,
* but not in datanode.
*/
if (detailInfo.len > 0) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s.%s\" does not exist on%s %s",
relation->schemaname,
relation->relname,
(IS_SINGLE_NODE ? "" : " DN"),
g_instance.attr.attr_common.PGXCNodeName),
errdetail("%s", detailInfo.data)));
} else {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s.%s\" does not exist on%s %s",
relation->schemaname,
relation->relname,
(IS_SINGLE_NODE ? "" : " DN"),
g_instance.attr.attr_common.PGXCNodeName)));
}
} else {
if (detailInfo.len > 0) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s.%s\" does not exist", relation->schemaname, relation->relname),
errdetail("%s", detailInfo.data)));
} else {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s.%s\" does not exist", relation->schemaname, relation->relname)));
}
}
} else {
* An unqualified name might have been meant as a reference to
* some not-yet-in-scope CTE. The bare "does not exist" message
* has proven remarkably unhelpful for figuring out such problems,
* so we take pains to offer a specific hint.
*/
if (isFutureCTE(pstate, relation->relname)) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s\" does not exist", relation->relname),
errdetail("There is a WITH item named \"%s\", but it cannot be referenced from this part of "
"the query.",
relation->relname),
errhint("Use WITH RECURSIVE, or re-order the WITH items to remove forward references.")));
} else {
errno_t rc = 0;
if (IS_PGXC_DATANODE) {
* support multi-nodegroup, maybe the relation is in coordinator,
* but not in datanode.
*/
if (detailInfo.len > 0) {
char message[MAXSTRLEN];
rc = sprintf_s(message, MAXSTRLEN, "relation \"%s\" does not exist", relation->relname);
securec_check_ss_c(rc, "", "");
InsertErrorMessage(message, u_sess->plsql_cxt.plpgsql_yylloc, true);
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s\" does not exist on%s %s",
relation->relname,
(IS_SINGLE_NODE ? "" : " DN"),
g_instance.attr.attr_common.PGXCNodeName),
errdetail("%s", detailInfo.data)));
} else {
char message[MAXSTRLEN];
rc = sprintf_s(message, MAXSTRLEN, "relation \"%s\" does not exist", relation->relname);
securec_check_ss_c(rc, "", "");
InsertErrorMessage(message, u_sess->plsql_cxt.plpgsql_yylloc, true);
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s\" does not exist on%s %s",
relation->relname,
(IS_SINGLE_NODE ? "" : " DN"),
g_instance.attr.attr_common.PGXCNodeName)));
}
} else {
char message[MAXSTRLEN];
rc = sprintf_s(message, MAXSTRLEN, "relation \"%s\" does not exist", relation->relname);
securec_check_ss_c(rc, "", "");
InsertErrorMessage(message, u_sess->plsql_cxt.plpgsql_yylloc, true);
if (detailInfo.len > 0) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s\" does not exist", relation->relname),
errdetail("%s", detailInfo.data)));
} else {
char message[MAXSTRLEN];
rc = sprintf_s(message, MAXSTRLEN, "relation \"%s\" does not exist", relation->relname);
securec_check_ss_c(rc, "", "");
InsertErrorMessage(message, u_sess->plsql_cxt.plpgsql_yylloc, true);
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s\" does not exist", relation->relname)));
}
}
}
}
}
cancel_parser_errposition_callback(&pcbstate);
TrForbidAccessRbObject(RelationRelationId, RelationGetRelid(rel), relation->relname);
if (ENABLE_WORKLOAD_CONTROL && !CheckWLMSessionInfoTableValid(relation->relname) && !u_sess->attr.attr_common.IsInplaceUpgrade) {
ereport(NOTICE,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("relation \"%s\" has data only in database \"postgres\"", relation->relname),
errhint("please use database \"postgres\"")));
}
if (RelationGetRelkind(rel) == RELKIND_VIEW &&
RelationGetRelid(rel) >= FirstNormalObjectId) {
if (!ValidateDependView(RelationGetRelid(rel), OBJECT_TYPE_VIEW)) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_OBJECT),
errmsg("The view %s is invalid, please make it valid before operation.",
RelationGetRelationName(rel)),
errhint("Please re-add missing table fields.")));
}
}
if (!u_sess->attr.attr_common.XactReadOnly && rel->rd_id == UserStatusRelationId) {
TryUnlockAllAccounts();
}
#ifndef ENABLE_MULTIPLE_NODES
if (RelationIsPartitioned(rel)) {
* partition DDL/DML parallel work, no need this action */
LockPartitionObject(RelationGetRelid(rel), PARTITION_OBJECT_LOCK_SDEQUENCE, PARTITION_SHARE_LOCK);
AddPartitionDMLInfo(RelationGetRelid(rel));
}
#endif
if (IS_PGXC_COORDINATOR && !IsConnFromCoord()) {
if (u_sess->attr.attr_sql.enable_parallel_ddl && !isFirstNode && isCreateView) {
UnlockRelation(rel, lockmode);
}
}
return rel;
}
* Add an entry for a relation to the pstate's range table (p_rtable).
*
* If pstate is NULL, we just build an RTE and return it without adding it
* to an rtable list.
*
* Note: formerly this checked for refname conflicts, but that's wrong.
* Caller is responsible for checking for conflicts in the appropriate scope.
*/
RangeTblEntry* addRangeTableEntry(ParseState* pstate, RangeVar* relation, Alias* alias, bool inh, bool inFromCl,
bool isFirstNode, bool isCreateView, bool isSupportSynonym)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
char* refname = alias ? alias->aliasname : relation->relname;
LOCKMODE lockmode;
Relation rel;
rte->rtekind = RTE_RELATION;
rte->alias = alias;
rte->isexcluded = false;
if (pstate == NULL) {
ereport(ERROR, (errmodule(MOD_OPT), errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED), errmsg("pstate can not be NULL")));
}
* Get the rel's OID. This access also ensures that we have an up-to-date
* relcache entry for the rel. Since this is typically the first access
* to a rel in a statement, be careful to get the right access level
* depending on whether we're doing SELECT FOR UPDATE/SHARE.
*/
lockmode = isLockedRefname(pstate, refname) ? RowShareLock : AccessShareLock;
rel = parserOpenTable(pstate, relation, lockmode, isFirstNode, isCreateView, isSupportSynonym);
if (relation->withVerExpr) {
LOCKMODE lockmodePro = lockmode;
tableam_tcap_promote_lock(rel, &lockmodePro);
if (lockmodePro > lockmode) {
LockRelationOid(RelationGetRelid(rel), lockmodePro);
}
}
if (IS_FOREIGNTABLE(rel) || IS_STREAM_TABLE(rel)) {
* In the security mode, the useft privilege of a user must be
* checked before the user select from a foreign table.
*/
if (isSecurityMode && !have_useft_privilege()) {
ereport(ERROR,
(errcode(ERRCODE_INSUFFICIENT_PRIVILEGE),
errmsg("permission denied to select from foreign table in security mode")));
}
}
rte->relid = RelationGetRelid(rel);
rte->relkind = rel->rd_rel->relkind;
rte->is_ustore = RelationIsUstoreFormat(rel);
rte->ispartrel = RELATION_IS_PARTITIONED(rel);
rte->relhasbucket = RELATION_HAS_BUCKET(rel);
rte->bucketmapsize = rel->rd_bucketmapsize;
rte->refSynOid = rel->rd_refSynOid;
if (relation->ispartition) {
rte->isContainPartition = GetPartitionOidForRTE(rte, relation, pstate, rel);
}
if (relation->issubpartition) {
rte->isContainSubPartition = GetSubPartitionOidForRTE(rte, relation, pstate, rel);
}
if (list_length(relation->partitionNameList) > 0) {
GetPartitionOidListForRTE(rte, relation);
}
#ifdef ENABLE_MULTIPLE_NODES
if (!rte->relhasbucket && relation->isbucket) {
ereport(ERROR, (errmsg("table is normal,cannot contains buckets(0,1,2...)")));
}
if (hasValidBuckets(relation, rel->rd_bucketmapsize)) {
if (!(rte->relhasbucket)) {
ereport(ERROR, (errmsg("relation \"%s\" does not have hash buckets", refname)));
}
rte->isbucket = true;
rte->buckets = RangeVarGetBucketList(relation);
}
#endif
#ifdef PGXC
rte->relname = pstrdup(RelationGetRelationName(rel));
rte->partAttrNum = get_rte_part_attr_num(rel);
#endif
* Build the list of effective column names using user-supplied aliases
* and/or actual column names.
*/
rte->eref = makeAlias(refname, NIL);
buildRelationAliases(rel->rd_att, alias, rte->eref);
* Drop the rel refcount, but keep the access lock till end of transaction
* so that the table can't be deleted or have its schema modified
* underneath us.
*/
heap_close(rel, NoLock);
* which is the right thing for all except target tables.
*/
set_rte_flags(rte, inh, inFromCl, ACL_SELECT);
rte->lateral = false;
setRteOrientation(rel, rte);
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
* If rte added into p_rtable is referenced by synonym object,
* mark pstate->p_hasSynonyms.
*/
if (!pstate->p_hasSynonyms && OidIsValid(rte->refSynOid)) {
pstate->p_hasSynonyms = true;
}
}
IndexHintType ihtype = INDEX_HINT_USE;
if (DB_IS_CMPT(B_FORMAT) && relation->indexhints != NIL) {
ihtype = preCheckIndexHints(pstate, relation->indexhints, rel);
if (ihtype == INDEX_HINT_NOT_EXISTS) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_OBJECT),
errmsg(
"index not exists in relation %s", RelationGetRelationName(rel))));
} else if (ihtype == INDEX_HINT_MIX) {
ereport(ERROR,
(errcode(ERRCODE_DUPLICATE_OBJECT),
errmsg("mixed use force index and use index")));
}
}
return rte;
}
* Add an entry for a relation to the pstate's range table (p_rtable).
*
* This is just like addRangeTableEntry() except that it makes an RTE
* given an already-open relation instead of a RangeVar reference.
*/
RangeTblEntry* addRangeTableEntryForRelation(ParseState* pstate, Relation rel, Alias* alias, bool inh, bool inFromCl)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
char* refname = NULL;
if (alias != NULL) {
refname = alias->aliasname;
} else if (OidIsValid(rel->rd_refSynOid)) {
refname = GetQualifiedSynonymName(rel->rd_refSynOid, false);
} else {
refname = RelationGetRelationName(rel);
}
rte->rtekind = RTE_RELATION;
rte->alias = alias;
rte->relid = RelationGetRelid(rel);
rte->relkind = rel->rd_rel->relkind;
rte->is_ustore = RelationIsUstoreFormat(rel);
rte->ispartrel = RELATION_IS_PARTITIONED(rel);
rte->relhasbucket = RELATION_HAS_BUCKET(rel);
rte->bucketmapsize = rel->rd_bucketmapsize;
rte->isexcluded = false;
* In cases that target relation's rd_refSynOid is valid, it has been referenced from one synonym.
* thus, alias name is used to take its raw relname away in order to form the refname.
*/
rte->refSynOid = rel->rd_refSynOid;
#ifdef PGXC
rte->relname = pstrdup(RelationGetRelationName(rel));
rte->partAttrNum = get_rte_part_attr_num(rel);
#endif
* Build the list of effective column names using user-supplied aliases
* and/or actual column names.
*/
rte->eref = makeAlias(refname, NIL);
buildRelationAliases(rel->rd_att, alias, rte->eref);
* The initial default on access checks is always check-for-READ-access,
* which is the right thing for all except target tables.
*/
set_rte_flags(rte, inh, inFromCl, ACL_SELECT);
rte->lateral = false;
setRteOrientation(rel, rte);
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
* If rte added into p_rtable is referenced by synonym object,
* mark pstate->p_hasSynonyms.
*/
if (!pstate->p_hasSynonyms && OidIsValid(rte->refSynOid)) {
pstate->p_hasSynonyms = true;
}
}
return rte;
}
* Add an entry for a subquery to the pstate's range table (p_rtable).
*
* This is just like addRangeTableEntry() except that it makes a subquery RTE.
* Note that an alias clause *must* be supplied.
*/
RangeTblEntry* addRangeTableEntryForSubquery(
ParseState* pstate, Query* subquery, Alias* alias, bool lateral, bool inFromCl, bool sublinkPullUp)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
char* refname = NULL;
Alias* eref = NULL;
int numaliases;
int varattno;
ListCell* tlistitem = NULL;
Alias* query_alias = alias;
if (subquery == NULL) {
ereport(
ERROR, (errmodule(MOD_OPT), errcode(ERRCODE_NULL_VALUE_NOT_ALLOWED), errmsg("subquery can not be NULL")));
}
if (sublinkPullUp && subquery->hintState && subquery->hintState->block_name_hint != NULL) {
BlockNameHint* block_name_hint = (BlockNameHint*)linitial(subquery->hintState->block_name_hint);
block_name_hint->base.state = HINT_STATE_USED;
char* block_name = strVal(linitial(block_name_hint->base.relnames));
query_alias = makeAlias(block_name, NIL);
}
refname = query_alias ? query_alias->aliasname : (char *)"unknown";
rte->rtekind = RTE_SUBQUERY;
rte->relid = InvalidOid;
rte->subquery = subquery;
rte->alias = query_alias;
rte->sublink_pull_up = sublinkPullUp;
rte->orientation = REL_ORIENT_UNKNOWN;
if (query_alias != NULL) {
eref = (Alias *)copyObject(query_alias);
numaliases = list_length(eref->colnames);
} else {
eref = NULL;
}
varattno = 0;
foreach (tlistitem, subquery->targetList) {
TargetEntry* te = (TargetEntry*)lfirst(tlistitem);
if (te->resjunk) {
continue;
}
varattno++;
AssertEreport(varattno == te->resno, MOD_OPT, "");
if (varattno > numaliases && alias != NULL) {
char* attrname = NULL;
if (te->resname != NULL &&
IsQuerySWCBRewrite(subquery) &&
strstr(te->resname, "@")) {
rte->swSubExist = true;
char *label = strrchr(te->resname, '@');
label += 1;
attrname = pstrdup(label);
} else {
attrname = pstrdup(te->resname);
}
eref->colnames = lappend(eref->colnames, makeString(attrname));
}
}
if (varattno < numaliases) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg(
"table \"%s\" has %d columns available but %d columns specified", refname, varattno, numaliases)));
}
rte->eref = eref;
* Subqueries are never checked for access rights.
*/
set_rte_flags(rte, false, inFromCl, 0);
rte->lateral = lateral;
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
}
return rte;
}
* Add an entry for a function to the pstate's range table (p_rtable).
*
* This is just like addRangeTableEntry() except that it makes a function RTE.
*/
RangeTblEntry* addRangeTableEntryForFunction(
ParseState* pstate, char* funcname, Node* funcexpr, RangeFunction* rangefunc, bool lateral, bool inFromCl)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
TypeFuncClass functypclass;
Oid funcrettype;
TupleDesc tupdesc;
Alias* alias = rangefunc->alias;
List* coldeflist = rangefunc->coldeflist;
Alias* eref = NULL;
rte->rtekind = RTE_FUNCTION;
rte->relid = InvalidOid;
rte->subquery = NULL;
rte->funcexpr = funcexpr;
rte->funccoltypes = NIL;
rte->funccoltypmods = NIL;
rte->funccolcollations = NIL;
rte->alias = alias;
* create_functionscan_path need cursorDop to determine
* wheather functionscan smp or not.
*/
PlannedStmt* cursorPstmt = getCursorStreamFromFuncArg(funcexpr);
if (cursorPstmt != NULL && IsA(cursorPstmt->planTree, Stream)) {
rte->cursorDop = cursorPstmt->planTree->lefttree->dop;
}
eref = makeAlias(alias ? alias->aliasname : funcname, NIL);
rte->eref = eref;
* Now determine if the function returns a simple or composite type.
*/
functypclass = get_expr_result_type(funcexpr, &funcrettype, &tupdesc);
* A coldeflist is required if the function returns RECORD and hasn't got
* a predetermined record type, and is prohibited otherwise.
*/
if (coldeflist != NIL) {
if (functypclass != TYPEFUNC_RECORD) {
ereport(ERROR,
(errcode(ERRCODE_SYNTAX_ERROR),
errmsg("a column definition list is only allowed for functions returning \"record\""),
parser_errposition(pstate, exprLocation(funcexpr))));
}
} else {
if (functypclass == TYPEFUNC_RECORD) {
ereport(ERROR,
(errcode(ERRCODE_SYNTAX_ERROR),
errmsg("a column definition list is required for functions returning \"record\""),
parser_errposition(pstate, exprLocation(funcexpr))));
}
}
if (functypclass == TYPEFUNC_COMPOSITE) {
AssertEreport(tupdesc, MOD_OPT, "");
buildRelationAliases(tupdesc, alias, eref);
} else if (functypclass == TYPEFUNC_SCALAR) {
buildScalarFunctionAlias(funcexpr, funcname, alias, eref);
} else if (functypclass == TYPEFUNC_RECORD) {
ListCell* col = NULL;
* Use the column definition list to form the alias list and
* funccoltypes/funccoltypmods/funccolcollations lists.
*/
foreach (col, coldeflist) {
ColumnDef* n = (ColumnDef*)lfirst(col);
char* attrname = NULL;
Oid attrtype;
int32 attrtypmod;
Oid attrcollation;
attrname = pstrdup(n->colname);
if (n->typname->setof) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_TABLE_DEFINITION),
errmsg("column \"%s\" cannot be declared SETOF", attrname),
parser_errposition(pstate, n->typname->location)));
}
typenameTypeIdAndMod(pstate, n->typname, &attrtype, &attrtypmod);
attrcollation = GetColumnDefCollation(pstate, n, attrtype);
eref->colnames = lappend(eref->colnames, makeString(attrname));
rte->funccoltypes = lappend_oid(rte->funccoltypes, attrtype);
rte->funccoltypmods = lappend_int(rte->funccoltypmods, attrtypmod);
rte->funccolcollations = lappend_oid(rte->funccolcollations, attrcollation);
}
} else {
ereport(ERROR,
(errcode(ERRCODE_DATATYPE_MISMATCH),
errmsg("function \"%s\" in FROM has unsupported return type %s", funcname, format_type_be(funcrettype)),
parser_errposition(pstate, exprLocation(funcexpr))));
}
* Functions are never checked for access rights (at least, not by
* the RTE permissions mechanism).
*/
set_rte_flags(rte, false, inFromCl, 0);
rte->lateral = lateral;
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
}
return rte;
}
* Add an entry for a VALUES list to the pstate's range table (p_rtable).
*
* This is much like addRangeTableEntry() except that it makes a values RTE.
*/
RangeTblEntry* addRangeTableEntryForValues(
ParseState* pstate, List* exprs, List* collations, Alias* alias, bool inFromCl)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
char* refname = alias ? alias->aliasname : pstrdup("*VALUES*");
Alias* eref = NULL;
int numaliases;
int numcolumns;
rte->rtekind = RTE_VALUES;
rte->relid = InvalidOid;
rte->subquery = NULL;
rte->values_lists = exprs;
rte->values_collations = collations;
rte->alias = alias;
rte->orientation = REL_ROW_ORIENTED;
eref = alias ? (Alias*)copyObject(alias) : makeAlias(refname, NIL);
numcolumns = list_length((List*)linitial(exprs));
numaliases = list_length(eref->colnames);
while (numaliases < numcolumns) {
char attrname[64] = {0};
numaliases++;
errno_t rc = snprintf_s(attrname, sizeof(attrname), sizeof(attrname) - 1, "column%d", numaliases);
securec_check_ss(rc, "\0", "\0");
eref->colnames = lappend(eref->colnames, makeString(pstrdup(attrname)));
}
if (numcolumns < numaliases) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg("VALUES lists \"%s\" have %d columns available but %d columns specified",
refname,
numcolumns,
numaliases)));
}
rte->eref = eref;
* Subqueries are never checked for access rights.
*/
set_rte_flags(rte, false, inFromCl, 0);
rte->lateral = false;
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
}
return rte;
}
* Add an entry for a join to the pstate's range table (p_rtable).
*
* This is much like addRangeTableEntry() except that it makes a join RTE.
*/
RangeTblEntry* addRangeTableEntryForJoin(
ParseState* pstate, List* colnames, JoinType jointype, List* aliasvars, Alias* alias, bool inFromCl)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
Alias* eref = NULL;
int numaliases;
* Fail if join has too many columns --- we must be able to reference any
* of the columns with an AttrNumber.
*/
if (list_length(aliasvars) > MaxAttrNumber) {
ereport(ERROR,
(errcode(ERRCODE_PROGRAM_LIMIT_EXCEEDED), errmsg("joins can have at most %d columns", MaxAttrNumber)));
}
rte->rtekind = RTE_JOIN;
rte->relid = InvalidOid;
rte->subquery = NULL;
rte->jointype = jointype;
rte->joinaliasvars = aliasvars;
rte->alias = alias;
rte->orientation = REL_ORIENT_UNKNOWN;
eref = alias ? (Alias*)copyObject(alias) : makeAlias("unnamed_join", NIL);
numaliases = list_length(eref->colnames);
if (numaliases < list_length(colnames)) {
eref->colnames = list_concat(eref->colnames, list_copy_tail(colnames, numaliases));
}
rte->eref = eref;
set_rte_flags(rte, false, inFromCl, 0);
rte->lateral = false;
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
}
return rte;
}
* Add an entry for a CTE reference to the pstate's range table (p_rtable).
*
* This is much like addRangeTableEntry() except that it makes a CTE RTE.
*/
RangeTblEntry* addRangeTableEntryForCTE(
ParseState* pstate, CommonTableExpr* cte, Index levelsup, RangeVar* rv, bool inFromCl)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
Alias* alias = rv->alias;
char* refname = alias ? alias->aliasname : cte->ctename;
Alias* eref = NULL;
int numaliases;
int varattno;
ListCell* lc = NULL;
rte->rtekind = RTE_CTE;
rte->ctename = cte->ctename;
rte->ctelevelsup = levelsup;
if (levelsup > 0) {
cte->referenced_by_subquery = true;
}
rte->self_reference = !IsA(cte->ctequery, Query);
cte->self_reference = rte->self_reference;
rte->cterecursive = cte->cterecursive;
AssertEreport(cte->cterecursive || !rte->self_reference, MOD_OPT, "");
if (!rte->self_reference) {
cte->cterefcount++;
}
* We throw error if the CTE is INSERT/UPDATE/DELETE without RETURNING.
* This won't get checked in case of a self-reference, but that's OK
* because data-modifying CTEs aren't allowed to be recursive anyhow.
*/
if (IsA(cte->ctequery, Query)) {
Query* ctequery = (Query*)cte->ctequery;
if (ctequery->commandType != CMD_SELECT && ctequery->returningList == NIL) {
ereport(ERROR,
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
errmsg("WITH query \"%s\" does not have a RETURNING clause", cte->ctename),
parser_errposition(pstate, rv->location)));
}
}
rte->ctecoltypes = cte->ctecoltypes;
rte->ctecoltypmods = cte->ctecoltypmods;
rte->ctecolcollations = cte->ctecolcollations;
rte->alias = alias;
if (alias != NULL) {
eref = (Alias*)copyObject(alias);
} else {
eref = makeAlias(refname, NIL);
}
numaliases = list_length(eref->colnames);
varattno = 0;
foreach (lc, cte->ctecolnames) {
varattno++;
if (varattno > numaliases) {
eref->colnames = lappend(eref->colnames, lfirst(lc));
}
}
if (varattno < numaliases) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
errmsg(
"table \"%s\" has %d columns available but %d columns specified", refname, varattno, numaliases)));
}
rte->eref = eref;
* Flags:
* - this RTE should be expanded to include descendant tables,
* - this RTE is in the FROM clause,
* - this RTE should be checked for appropriate access rights.
*
* Subqueries are never checked for access rights.
* ----------
*/
rte->lateral = false;
rte->inh = false;
rte->inFromCl = inFromCl;
rte->requiredPerms = 0;
rte->checkAsUser = InvalidOid;
rte->selectedCols = NULL;
rte->insertedCols = NULL;
rte->updatedCols = NULL;
rte->extraUpdatedCols = NULL;
rte->orientation = REL_ORIENT_UNKNOWN;
* Add completed RTE to pstate's range table list, but not to join list
* nor namespace --- caller must do that if appropriate.
*/
if (pstate != NULL) {
pstate->p_rtable = lappend(pstate->p_rtable, rte);
}
* If the CTE is rewrited from startwith/connectby. We need to add pseudo columns
* because it return parser tree from sub level and don't have pseudo column infos.
*/
if (cte->swoptions != NULL && IsA(cte->ctequery, Query) && pstate != NULL) {
AddStartWithCTEPseudoReturnColumns(cte, rte, list_length(pstate->p_rtable));
}
return rte;
}
RangeTblEntry* getRangeTableEntryByRelation(Relation rel)
{
RangeTblEntry* rte = makeNode(RangeTblEntry);
char* refname = RelationGetRelationName(rel);
rte->rtekind = RTE_RELATION;
rte->alias = NULL;
rte->relid = RelationGetRelid(rel);
rte->relkind = rel->rd_rel->relkind;
rte->ispartrel = RELATION_IS_PARTITIONED(rel);
rte->relhasbucket = RELATION_HAS_BUCKET(rel);
rte->bucketmapsize = rel->rd_bucketmapsize;
rte->isexcluded = false;
* In cases that target relation's rd_refSynOid is valid, it has been referenced from one synonym.
* thus, alias name is used to take its raw relname away in order to form the refname.
*/
rte->refSynOid = rel->rd_refSynOid;
#ifdef PGXC
rte->relname = pstrdup(RelationGetRelationName(rel));
rte->partAttrNum = get_rte_part_attr_num(rel);
#endif
* Build the list of effective column names using user-supplied aliases
* and/or actual column names.
*/
rte->eref = makeAlias(refname, NIL);
buildRelationAliases(rel->rd_att, rte->alias, rte->eref);
* The initial default on access checks is always check-for-READ-access,
* which is the right thing for all except target tables.
*/
rte->inh = true;
rte->inFromCl = true;
rte->requiredPerms = ACL_SELECT;
rte->checkAsUser = InvalidOid;
rte->selectedCols = NULL;
rte->insertedCols = NULL;
rte->updatedCols = NULL;
rte->lateral = false;
rte->extraUpdatedCols = NULL;
setRteOrientation(rel, rte);
return rte;
}
* Has the specified refname been selected FOR UPDATE/FOR SHARE?
*
* This is used when we have not yet done transformLockingClause, but need
* to know the correct lock to take during initial opening of relations.
*
* Note: we pay no attention to whether it's FOR UPDATE vs FOR SHARE,
* since the table-level lock is the same either way.
*/
bool isLockedRefname(ParseState* pstate, const char* refname)
{
ListCell* l = NULL;
* If we are in a subquery specified as locked FOR UPDATE/SHARE from
* parent level, then act as though there's a generic FOR UPDATE here.
*/
if (pstate->p_locked_from_parent) {
return true;
}
foreach (l, pstate->p_locking_clause) {
LockingClause* lc = (LockingClause*)lfirst(l);
if (lc->lockedRels == NIL) {
return true;
} else {
ListCell* l2 = NULL;
foreach (l2, lc->lockedRels) {
RangeVar* thisrel = (RangeVar*)lfirst(l2);
if (strcmp(refname, thisrel->relname) == 0) {
return true;
}
}
}
}
return false;
}
* Add the given RTE as a top-level entry in the pstate's join list
* and/or name space lists. (We assume caller has checked for any
* namespace conflicts.)
*/
void addRTEtoQuery(
ParseState* pstate, RangeTblEntry* rte, bool addToJoinList, bool addToRelNameSpace, bool addToVarNameSpace)
{
if (addToJoinList) {
int rtindex = RTERangeTablePosn(pstate, rte, NULL);
RangeTblRef* rtr = makeNodeFast(RangeTblRef);
rtr->rtindex = rtindex;
pstate->p_joinlist = lappend(pstate->p_joinlist, rtr);
}
if (addToRelNameSpace || addToVarNameSpace)
{
ParseNamespaceItem *nsitem;
nsitem = (ParseNamespaceItem *) palloc(sizeof(ParseNamespaceItem));
nsitem->p_rte = rte;
nsitem->p_lateral_only = false;
nsitem->p_lateral_ok = true;
if (addToRelNameSpace)
pstate->p_relnamespace = lappend(pstate->p_relnamespace, nsitem);
if (addToVarNameSpace)
pstate->p_varnamespace = lappend(pstate->p_varnamespace, nsitem);
}
}
* expandRTE -- expand the columns of a rangetable entry
*
* This creates lists of an RTE's column names (aliases if provided, else
* real names) and Vars for each column. Only user columns are considered.
* If include_dropped is FALSE then dropped columns are omitted from the
* results. If include_dropped is TRUE then empty strings and NULL constants
* (not Vars!) are returned for dropped columns.
*
* rtindex, sublevels_up, and location are the varno, varlevelsup, and location
* values to use in the created Vars. Ordinarily rtindex should match the
* actual position of the RTE in its rangetable.
*
* The output lists go into *colnames and *colvars.
* If only one of the two kinds of output list is needed, pass NULL for the
* output pointer for the unwanted one.
*/
void expandRTE(RangeTblEntry* rte, int rtindex, int sublevels_up, int location, bool include_dropped, List** colnames,
List** colvars, ParseState* pstate)
{
int varattno;
if (colnames != NULL) {
*colnames = NIL;
}
if (colvars != NULL) {
*colvars = NIL;
}
switch (rte->rtekind) {
case RTE_RELATION:
expandRelation(rte->relid, rte->eref, rtindex, sublevels_up, location, include_dropped, colnames, colvars);
break;
case RTE_SUBQUERY: {
if (rte->eref == NULL)
break;
if (rte->alias != NULL && rte->alias->aliasname != NULL &&
pg_strcasecmp(rte->alias->aliasname, "__sw_pseudo_col_table__") == 0) {
break;
}
ListCell* aliasp_item = list_head(rte->eref->colnames);
ListCell* tlistitem = NULL;
varattno = 0;
foreach (tlistitem, rte->subquery->targetList) {
TargetEntry* te = (TargetEntry*)lfirst(tlistitem);
if (te->resjunk) {
continue;
}
varattno++;
AssertEreport(varattno == te->resno, MOD_OPT, "");
* In scenarios where columns have been added to a view
* since the outer query was originally parsed, there can
* be more items in the subquery tlist than the outer
* query expects. We should ignore such extra column(s)
* --- compare the behavior for composite-returning
* functions, in the RTE_FUNCTION case below.
*/
if (aliasp_item == NULL) {
break;
}
if (colnames != NULL) {
char* label = strVal(lfirst(aliasp_item));
*colnames = lappend(*colnames, makeString(pstrdup(label)));
}
if (colvars != NULL) {
Var* varnode = NULL;
varnode = makeVar(rtindex,
varattno,
exprType((Node*)te->expr),
exprTypmod((Node*)te->expr),
exprCollation((Node*)te->expr),
sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
aliasp_item = lnext(aliasp_item);
}
} break;
case RTE_FUNCTION: {
TypeFuncClass functypclass;
Oid funcrettype = InvalidOid;
TupleDesc tupdesc;
int4 funcrettype_orig = -1;
functypclass = get_expr_result_type(rte->funcexpr, &funcrettype, &tupdesc, &funcrettype_orig);
if (functypclass == TYPEFUNC_COMPOSITE) {
AssertEreport(tupdesc, MOD_OPT, "");
expandTupleDesc(
tupdesc, rte->eref, rtindex, sublevels_up, location, include_dropped, colnames, colvars);
} else if (functypclass == TYPEFUNC_SCALAR) {
if (colnames != NULL) {
*colnames = lappend(*colnames, linitial(rte->eref->colnames));
}
if (colvars != NULL) {
Var* varnode = NULL;
varnode =
makeVar(rtindex, 1, funcrettype, funcrettype_orig, exprCollation(rte->funcexpr), sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
} else if (functypclass == TYPEFUNC_RECORD) {
if (colnames != NULL) {
*colnames = (List*)copyObject(rte->eref->colnames);
}
if (colvars != NULL) {
ListCell* l1 = NULL;
ListCell* l2 = NULL;
ListCell* l3 = NULL;
int attnum = 0;
forthree(l1, rte->funccoltypes, l2, rte->funccoltypmods, l3, rte->funccolcollations)
{
Oid attrtype = lfirst_oid(l1);
int32 attrtypmod = lfirst_int(l2);
Oid attrcollation = lfirst_oid(l3);
Var* varnode = NULL;
attnum++;
varnode = makeVar(rtindex, attnum, attrtype, attrtypmod, attrcollation, sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
}
} else {
ereport(ERROR,
(errcode(ERRCODE_FEATURE_NOT_SUPPORTED), errmsg("function in FROM has unsupported return type")));
}
} break;
case RTE_VALUES: {
ListCell* aliasp_item = list_head(rte->eref->colnames);
int32* coltypmods = NULL;
ListCell* lcv = NULL;
ListCell* lcc = NULL;
* It's okay to extract column types from the expressions in
* the first row, since all rows will have been coerced to the
* same types. Their typmods might not be the same though, so
* we potentially need to examine all rows to compute those.
* Column collations are pre-computed in values_collations.
*/
if (colvars != NULL) {
coltypmods = getValuesTypmods(rte);
} else {
coltypmods = NULL;
}
varattno = 0;
forboth(lcv, (List*)linitial(rte->values_lists), lcc, rte->values_collations)
{
Node* col = (Node*)lfirst(lcv);
Oid colcollation = lfirst_oid(lcc);
varattno++;
if (colnames != NULL) {
char* label = strVal(lfirst(aliasp_item));
*colnames = lappend(*colnames, makeString(pstrdup(label)));
aliasp_item = lnext(aliasp_item);
}
if (colvars != NULL) {
Var* varnode = NULL;
varnode =
makeVar(rtindex, varattno, exprType(col), coltypmods[varattno - 1], colcollation, sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
}
if (coltypmods != NULL) {
pfree_ext(coltypmods);
}
} break;
case RTE_JOIN: {
ListCell* colname = NULL;
ListCell* aliasvar = NULL;
AssertEreport(list_length(rte->eref->colnames) == list_length(rte->joinaliasvars), MOD_OPT, "");
varattno = 0;
forboth(colname, rte->eref->colnames, aliasvar, rte->joinaliasvars)
{
Node* avar = (Node*)lfirst(aliasvar);
varattno++;
* During ordinary parsing, there will never be any
* deleted columns in the join; but we have to check since
* this routine is also used by the rewriter, and joins
* found in stored rules might have join columns for
* since-deleted columns. This will be signaled by a NULL
* Const in the alias-vars list.
*/
if (IsA(avar, Const)) {
if (include_dropped) {
if (colnames != NULL) {
*colnames = lappend(*colnames, makeString(pstrdup("")));
}
if (colvars != NULL) {
*colvars = lappend(*colvars, copyObject(avar));
}
}
continue;
}
if (colnames != NULL) {
char* label = strVal(lfirst(colname));
*colnames = lappend(*colnames, makeString(pstrdup(label)));
}
if (colvars != NULL) {
Var* varnode = NULL;
varnode =
makeVar(rtindex, varattno, exprType(avar), exprTypmod(avar), exprCollation(avar), sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
}
} break;
case RTE_CTE: {
ListCell* aliasp_item = list_head(rte->eref->colnames);
ListCell* lct = NULL;
ListCell* lcm = NULL;
ListCell* lcc = NULL;
varattno = 0;
forthree(lct, rte->ctecoltypes, lcm, rte->ctecoltypmods, lcc, rte->ctecolcollations)
{
Oid coltype = lfirst_oid(lct);
int32 coltypmod = lfirst_int(lcm);
Oid colcoll = lfirst_oid(lcc);
if (colnames != NULL) {
char* label = strVal(lfirst(aliasp_item));
if (rte->swConverted) {
if (IsPseudoReturnColumn(label)) {
continue;
}
label = ReplaceSWCTEOutSrting(pstate, rte, label);
}
*colnames = lappend(*colnames, makeString(pstrdup(label)));
aliasp_item = lnext(aliasp_item);
}
varattno++;
if (colvars != NULL) {
Var* varnode = NULL;
varnode = makeVar(rtindex, varattno, coltype, coltypmod, colcoll, sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
}
} break;
case RTE_RESULT:
break;
default:
ereport(ERROR,
(errcode(ERRCODE_UNRECOGNIZED_NODE_TYPE), errmsg("unrecognized RTE kind: %d", (int)rte->rtekind)));
}
}
* expandRelation -- expandRTE subroutine
*/
static void expandRelation(Oid relid, Alias* eref, int rtindex, int sublevels_up, int location, bool include_dropped,
List** colnames, List** colvars)
{
Relation rel;
rel = relation_open(relid, AccessShareLock);
expandTupleDesc(rel->rd_att, eref, rtindex, sublevels_up, location, include_dropped, colnames, colvars);
relation_close(rel, AccessShareLock);
}
* expandTupleDesc -- expandRTE subroutine
*/
static void expandTupleDesc(TupleDesc tupdesc, Alias* eref, int rtindex, int sublevels_up, int location,
bool include_dropped, List** colnames, List** colvars)
{
int maxattrs = tupdesc->natts;
int numaliases = list_length(eref->colnames);
int varattno;
for (varattno = 0; varattno < maxattrs; varattno++) {
Form_pg_attribute attr = &tupdesc->attrs[varattno];
if (attr->attisdropped) {
if (include_dropped) {
if (colnames != NULL) {
*colnames = lappend(*colnames, makeString(pstrdup("")));
}
if (colvars != NULL) {
* can't use atttypid here, but it doesn't really matter
* what type the Const claims to be.
*/
*colvars = lappend(*colvars, makeNullConst(INT4OID, -1, InvalidOid));
}
}
continue;
}
if (TsRelWithImplDistColumn(tupdesc->attrs, varattno)) {
continue;
}
if (colnames != NULL) {
char* label = NULL;
if (varattno < numaliases) {
label = strVal(list_nth(eref->colnames, varattno));
} else {
label = NameStr(attr->attname);
}
*colnames = lappend(*colnames, makeString(pstrdup(label)));
}
if (colvars != NULL) {
Var* varnode = NULL;
varnode = makeVar(rtindex, attr->attnum, attr->atttypid, attr->atttypmod, attr->attcollation, sublevels_up);
varnode->location = location;
*colvars = lappend(*colvars, varnode);
}
}
}
* getValuesTypmods -- expandRTE subroutine
*
* Identify per-column typmods for the given VALUES RTE. Returns a
* palloc'd array.
*/
static int32* getValuesTypmods(RangeTblEntry* rte)
{
int32* coltypmods = NULL;
List* firstrow = NIL;
int ncolumns, nvalid, i;
ListCell* lc = NULL;
AssertEreport(rte->values_lists != NIL, MOD_OPT, "");
firstrow = (List*)linitial(rte->values_lists);
ncolumns = list_length(firstrow);
coltypmods = (int32*)palloc(ncolumns * sizeof(int32));
nvalid = 0;
i = 0;
foreach (lc, firstrow) {
Node* col = (Node*)lfirst(lc);
coltypmods[i] = exprTypmod(col);
if (coltypmods[i] >= 0) {
nvalid++;
}
i++;
}
* Scan remaining rows; as soon as we have a non-matching typmod for a
* column, reset that typmod to -1. We can bail out early if all typmods
* become -1.
*/
if (nvalid > 0) {
for_each_cell(lc, lnext(list_head(rte->values_lists)))
{
List* thisrow = (List*)lfirst(lc);
ListCell* lc2 = NULL;
AssertEreport(list_length(thisrow) == ncolumns, MOD_OPT, "");
i = 0;
foreach (lc2, thisrow) {
Node* col = (Node*)lfirst(lc2);
if (coltypmods[i] >= 0 && coltypmods[i] != exprTypmod(col)) {
coltypmods[i] = -1;
nvalid--;
}
i++;
}
if (nvalid <= 0) {
break;
}
}
}
return coltypmods;
}
* expandRelAttrs -
* Workhorse for "*" expansion: produce a list of targetentries
* for the attributes of the RTE
*
* As with expandRTE, rtindex/sublevels_up determine the varno/varlevelsup
* fields of the Vars produced, and location sets their location.
* pstate->p_next_resno determines the resnos assigned to the TLEs.
* The referenced columns are marked as requiring SELECT access.
*/
List* expandRelAttrs(ParseState* pstate, RangeTblEntry* rte, int rtindex, int sublevels_up, int location)
{
List *names = NIL;
List *vars = NIL;
ListCell *name = NULL;
ListCell *var = NULL;
List* te_list = NIL;
bool is_ledger = is_ledger_usertable(rte->relid);
expandRTE(rte, rtindex, sublevels_up, location, false, &names, &vars, pstate);
* Require read access to the table. This is normally redundant with the
* markVarForSelectPriv calls below, but not if the table has zero
* columns.
*/
rte->requiredPerms |= ACL_SELECT;
forboth(name, names, var, vars)
{
char* label = strVal(lfirst(name));
if (is_ledger && strcmp(label, "hash") == 0) {
continue;
}
Var* varnode = (Var*)lfirst(var);
TargetEntry* te = NULL;
te = makeTargetEntry((Expr*)varnode, (AttrNumber)pstate->p_next_resno++, label, false);
te_list = lappend(te_list, te);
markVarForSelectPriv(pstate, varnode, rte);
}
AssertEreport(name == NULL && var == NULL, MOD_OPT, "");
return te_list;
}
* get_rte_attribute_name
* Get an attribute name from a RangeTblEntry
*
* This is unlike get_attname() because we use aliases if available.
* In particular, it will work on an RTE for a subselect or join, whereas
* get_attname() only works on real relations.
*
* "*" is returned if the given attnum is InvalidAttrNumber --- this case
* occurs when a Var represents a whole tuple of a relation.
*
* Must free the pointer after usage!!!
*/
char* get_rte_attribute_name(RangeTblEntry* rte, AttrNumber attnum, bool allowDropped)
{
if (attnum == InvalidAttrNumber) {
return pstrdup("*");
}
* If there is a user-written column alias, use it.
*/
if (rte->alias && attnum > 0 && attnum <= list_length(rte->alias->colnames)) {
return pstrdup(strVal(list_nth(rte->alias->colnames, attnum - 1)));
}
* If the RTE is a relation, go to the system catalogs not the
* eref->colnames list. This is a little slower but it will give the
* right answer if the column has been renamed since the eref list was
* built (which can easily happen for rules).
*/
if (rte->rtekind == RTE_RELATION) {
char* rteRelname = get_rel_name(rte->relid);
if (rteRelname == NULL) {
if (attnum > 0 && attnum <= list_length(rte->eref->colnames)) {
return pstrdup(strVal(list_nth(rte->eref->colnames, attnum - 1)));
}
} else {
return get_relid_attribute_name(rte->relid, attnum, allowDropped);
}
}
* Otherwise use the column name from eref. There should always be one.
*/
if (attnum > 0 && attnum <= list_length(rte->eref->colnames)) {
return pstrdup(strVal(list_nth(rte->eref->colnames, attnum - 1)));
}
ereport(ERROR,
(errcode(ERRCODE_FDW_INVALID_ATTRIBUTE_VALUE),
errmsg("invalid attnum %d for rangetable entry %s", attnum, rte->eref->aliasname)));
return NULL;
}
* get_rte_attribute_type
* Get attribute type/typmod/collation information from a RangeTblEntry
*/
void get_rte_attribute_type(RangeTblEntry* rte, AttrNumber attnum, Oid* vartype,
int32* vartypmod, Oid* varcollid, int* kvtype)
{
switch (rte->rtekind) {
case RTE_RELATION: {
HeapTuple tp;
Form_pg_attribute att_tup;
tp = SearchSysCache2(ATTNUM, ObjectIdGetDatum(rte->relid), Int16GetDatum(attnum));
if (!HeapTupleIsValid(tp)) {
ereport(ERROR,
(errcode(ERRCODE_CACHE_LOOKUP_FAILED),
errmsg("cache lookup failed for attribute %d of relation %u", attnum, rte->relid)));
}
att_tup = (Form_pg_attribute)GETSTRUCT(tp);
* If dropped column, pretend it ain't there. See notes in
* scanRTEForColumn.
*/
if (att_tup->attisdropped) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column \"%s\" of relation \"%s\" does not exist",
NameStr(att_tup->attname),
get_rel_name(rte->relid))));
}
*vartype = att_tup->atttypid;
*vartypmod = att_tup->atttypmod;
*varcollid = att_tup->attcollation;
if (kvtype != NULL && att_tup->attkvtype == ATT_KV_HIDE) {
*kvtype = ATT_KV_HIDE;
}
ReleaseSysCache(tp);
} break;
case RTE_SUBQUERY: {
TargetEntry* te = get_tle_by_resno(rte->subquery->targetList, attnum);
if (te == NULL || te->resjunk) {
ereport(ERROR,
(errcode(ERRCODE_INVALID_ATTRIBUTE),
errmsg("subquery %s does not have attribute %d", rte->eref->aliasname, attnum)));
}
*vartype = exprType((Node*)te->expr);
*vartypmod = exprTypmod((Node*)te->expr);
*varcollid = exprCollation((Node*)te->expr);
} break;
case RTE_FUNCTION: {
TypeFuncClass functypclass;
Oid funcrettype;
TupleDesc tupdesc;
functypclass = get_expr_result_type(rte->funcexpr, &funcrettype, &tupdesc);
if (functypclass == TYPEFUNC_COMPOSITE) {
Form_pg_attribute att_tup;
AssertEreport(tupdesc, MOD_OPT, "");
if (attnum < 1 || attnum > tupdesc->natts) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column %d of relation \"%s\" does not exist", attnum, rte->eref->aliasname)));
}
att_tup = &tupdesc->attrs[attnum - 1];
* If dropped column, pretend it ain't there. See notes
* in scanRTEForColumn.
*/
if (att_tup->attisdropped) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column \"%s\" of relation \"%s\" does not exist",
NameStr(att_tup->attname),
rte->eref->aliasname)));
}
*vartype = att_tup->atttypid;
*vartypmod = att_tup->atttypmod;
*varcollid = att_tup->attcollation;
if (kvtype != NULL && att_tup->attkvtype == ATT_KV_HIDE) {
*kvtype = ATT_KV_HIDE;
}
} else if (functypclass == TYPEFUNC_SCALAR) {
*vartype = funcrettype;
*vartypmod = -1;
*varcollid = exprCollation(rte->funcexpr);
} else if (functypclass == TYPEFUNC_RECORD) {
*vartype = list_nth_oid(rte->funccoltypes, attnum - 1);
*vartypmod = list_nth_int(rte->funccoltypmods, attnum - 1);
*varcollid = list_nth_oid(rte->funccolcollations, attnum - 1);
} else {
ereport(ERROR,
(errcode(ERRCODE_UNRECOGNIZED_NODE_TYPE), errmsg("function in FROM has unsupported return type")));
}
} break;
case RTE_VALUES: {
* Values RTE --- we can get type info from first sublist, but
* typmod may require scanning all sublists, and collation is
* stored separately. Using getValuesTypmods() is overkill,
* but this path is taken so seldom for VALUES that it's not
* worth writing extra code.
*/
List* collist = (List*)linitial(rte->values_lists);
Node* col = NULL;
int32* coltypmods = getValuesTypmods(rte);
if (attnum < 1 || attnum > list_length(collist)) {
ereport(ERROR,
(errcode(ERRCODE_UNEXPECTED_NODE_STATE),
errmsg("values list %s does not have attribute %d", rte->eref->aliasname, attnum)));
}
col = (Node*)list_nth(collist, attnum - 1);
*vartype = exprType(col);
*vartypmod = coltypmods[attnum - 1];
*varcollid = list_nth_oid(rte->values_collations, attnum - 1);
pfree_ext(coltypmods);
} break;
case RTE_JOIN: {
* Join RTE --- get type info from join RTE's alias variable
*/
Node* aliasvar = NULL;
AssertEreport(attnum > 0 && attnum <= list_length(rte->joinaliasvars), MOD_OPT, "");
aliasvar = (Node*)list_nth(rte->joinaliasvars, attnum - 1);
*vartype = exprType(aliasvar);
*vartypmod = exprTypmod(aliasvar);
*varcollid = exprCollation(aliasvar);
} break;
case RTE_CTE: {
AssertEreport(attnum > 0 && attnum <= list_length(rte->ctecoltypes), MOD_OPT, "");
*vartype = list_nth_oid(rte->ctecoltypes, attnum - 1);
*vartypmod = list_nth_int(rte->ctecoltypmods, attnum - 1);
*varcollid = list_nth_oid(rte->ctecolcollations, attnum - 1);
} break;
case RTE_RESULT:
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column %d of relation \"%s\" does not exist",
attnum,
rte->eref->aliasname)));
break;
default:
ereport(ERROR,
(errcode(ERRCODE_UNRECOGNIZED_NODE_TYPE), errmsg("unrecognized RTE kind: %d", (int)rte->rtekind)));
}
}
* get_rte_attribute_is_dropped
* Check whether attempted attribute ref is to a dropped column
*/
bool get_rte_attribute_is_dropped(RangeTblEntry* rte, AttrNumber attnum)
{
bool result = false;
switch (rte->rtekind) {
case RTE_RELATION: {
HeapTuple tp;
Form_pg_attribute att_tup;
tp = SearchSysCache2(ATTNUM, ObjectIdGetDatum(rte->relid), Int16GetDatum(attnum));
if (!HeapTupleIsValid(tp)) {
ereport(ERROR,
(errcode(ERRCODE_CACHE_LOOKUP_FAILED),
errmsg("cache lookup failed for attribute %d of relation %u", attnum, rte->relid)));
}
att_tup = (Form_pg_attribute)GETSTRUCT(tp);
result = att_tup->attisdropped;
ReleaseSysCache(tp);
} break;
case RTE_SUBQUERY:
case RTE_VALUES:
case RTE_CTE:
result = false;
break;
case RTE_JOIN: {
* A join RTE would not have dropped columns when constructed,
* but one in a stored rule might contain columns that were
* dropped from the underlying tables, if said columns are
* nowhere explicitly referenced in the rule. This will be
* signaled to us by a NULL Const in the joinaliasvars list.
*/
Var* aliasvar = NULL;
if (attnum <= 0 || attnum > list_length(rte->joinaliasvars)) {
ereport(ERROR, (errcode(ERRCODE_UNEXPECTED_NODE_STATE), errmsg("invalid varattno %d", attnum)));
}
aliasvar = (Var*)list_nth(rte->joinaliasvars, attnum - 1);
result = IsA(aliasvar, Const);
} break;
case RTE_FUNCTION: {
Oid funcrettype = exprType(rte->funcexpr);
Oid funcrelid = typeidTypeRelid(funcrettype);
if (OidIsValid(funcrelid)) {
* Composite data type, i.e. a table's row type
*
* Same as ordinary relation RTE
*/
HeapTuple tp;
Form_pg_attribute att_tup;
tp = SearchSysCache2(ATTNUM, ObjectIdGetDatum(funcrelid), Int16GetDatum(attnum));
if (!HeapTupleIsValid(tp)) {
Assert(0);
ereport(ERROR,
(errcode(ERRCODE_CACHE_LOOKUP_FAILED),
errmsg("cache lookup failed for attribute %d of relation %u", attnum, funcrelid)));
}
att_tup = (Form_pg_attribute)GETSTRUCT(tp);
result = att_tup->attisdropped;
ReleaseSysCache(tp);
} else {
* Must be a base data type, i.e. scalar
*/
result = false;
}
} break;
case RTE_RESULT:
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column %d of relation \"%s\" does not exist",
attnum,
rte->eref->aliasname)));
result = false;
break;
default:
ereport(ERROR,
(errcode(ERRCODE_UNRECOGNIZED_NODE_TYPE), errmsg("unrecognized RTE kind: %d", (int)rte->rtekind)));
result = false;
}
return result;
}
* Given a targetlist and a resno, return the matching TargetEntry
*
* Returns NULL if resno is not present in list.
*
* Note: we need to search, rather than just indexing with list_nth(),
* because not all tlists are sorted by resno.
*/
TargetEntry* get_tle_by_resno(List* tlist, AttrNumber resno)
{
ListCell* l = NULL;
foreach (l, tlist) {
TargetEntry* tle = (TargetEntry*)lfirst(l);
if (tle->resno == resno) {
return tle;
}
}
return NULL;
}
* Given a Query and rangetable index, return relation's RowMarkClause if any
*
* Returns NULL if relation is not selected FOR UPDATE/SHARE
*/
RowMarkClause* get_parse_rowmark(Query* qry, Index rtindex)
{
ListCell* l = NULL;
foreach (l, qry->rowMarks) {
RowMarkClause* rc = (RowMarkClause*)lfirst(l);
if (rc->rti == rtindex) {
return rc;
}
}
return NULL;
}
* given relation and att name, return attnum of variable
*
* Returns InvalidAttrNumber if the attr doesn't exist (or is dropped).
*
* This should only be used if the relation is already
* heap_open()'ed. Use the cache version get_attnum()
* for access to non-opened relations.
*/
int attnameAttNum(Relation rd, const char* attname, bool sysColOK)
{
int i;
for (i = 0; i < rd->rd_rel->relnatts; i++) {
Form_pg_attribute att = &rd->rd_att->attrs[i];
if (namestrcmp(&(att->attname), attname) == 0 && !att->attisdropped) {
return i + 1;
}
}
if (sysColOK) {
if ((i = specialAttNum(attname)) != InvalidAttrNumber) {
if ((i != ObjectIdAttributeNumber || rd->rd_rel->relhasoids) &&
(i != BucketIdAttributeNumber || RELATION_HAS_BUCKET(rd)) &&
(i != UidAttributeNumber || RELATION_HAS_UIDS(rd))) {
return i;
}
}
}
return InvalidAttrNumber;
}
*
* Check attribute name to see if it is "special", e.g. "oid".
* - thomas 2000-02-07
*
* Note: this only discovers whether the name could be a system attribute.
* Caller needs to verify that it really is an attribute of the rel,
* at least in the case of "oid", which is now optional.
*/
#ifdef PGXC
int specialAttNum(const char* attname)
#else
static int specialAttNum(const char* attname)
#endif
{
Form_pg_attribute sysatt;
sysatt = SystemAttributeByName(attname, true );
if (sysatt != NULL) {
return sysatt->attnum;
}
return InvalidAttrNumber;
}
* given attribute id, return name of that attribute
*
* This should only be used if the relation is already
* heap_open()'ed. Use the cache version get_atttype()
* for access to non-opened relations.
*/
Name attnumAttName(Relation rd, int attid)
{
if (attid <= 0) {
Form_pg_attribute sysatt;
sysatt = SystemAttributeDefinition(attid, rd->rd_rel->relhasoids,
RELATION_HAS_BUCKET(rd), RELATION_HAS_UIDS(rd));
return &sysatt->attname;
}
if (attid > rd->rd_att->natts) {
ereport(ERROR, (errcode(ERRCODE_INVALID_ATTRIBUTE), errmsg("invalid attribute number %d", attid)));
}
return &rd->rd_att->attrs[attid - 1].attname;
}
* given attribute id, return type of that attribute
*
* This should only be used if the relation is already
* heap_open()'ed. Use the cache version get_atttype()
* for access to non-opened relations.
*/
Oid attnumTypeId(Relation rd, int attid)
{
if (attid <= 0) {
Form_pg_attribute sysatt;
sysatt = SystemAttributeDefinition(attid, rd->rd_rel->relhasoids,
RELATION_HAS_BUCKET(rd), RELATION_HAS_UIDS(rd));
return sysatt->atttypid;
}
if (attid > rd->rd_att->natts) {
ereport(ERROR, (errcode(ERRCODE_INVALID_ATTRIBUTE), errmsg("invalid attribute number %d", attid)));
}
return rd->rd_att->attrs[attid - 1].atttypid;
}
* given attribute id, return collation of that attribute
*
* This should only be used if the relation is already heap_open()'ed.
*/
Oid attnumCollationId(Relation rd, int attid)
{
if (attid <= 0) {
return InvalidOid;
}
if (attid > rd->rd_att->natts) {
ereport(ERROR, (errcode(ERRCODE_INVALID_ATTRIBUTE), errmsg("invalid attribute number %d", attid)));
}
return rd->rd_att->attrs[attid - 1].attcollation;
}
* Generate a suitable error about a missing RTE.
*
* Since this is a very common type of error, we work rather hard to
* produce a helpful message.
*/
void errorMissingRTE(ParseState* pstate, RangeVar* relation, bool hasplus)
{
RangeTblEntry* rte = NULL;
int sublevels_up;
const char* badAlias = NULL;
* Check to see if there are any potential matches in the query's
* rangetable. (Note: cases involving a bad schema name in the RangeVar
* will throw error immediately here. That seems OK.)
*/
rte = searchRangeTableForRel(pstate, relation);
* If we found a match that has an alias and the alias is visible in the
* namespace, then the problem is probably use of the relation's real name
* instead of its alias, ie "SELECT foo.* FROM foo f". This mistake is
* common enough to justify a specific hint.
*
* If we found a match that doesn't meet those criteria, assume the
* problem is illegal use of a relation outside its scope, as in the
* B database-ism "SELECT ... FROM a, b LEFT JOIN c ON (a.x = c.y)".
*/
if (rte != NULL && rte->alias != NULL && strcmp(rte->eref->aliasname, relation->relname) != 0 &&
refnameRangeTblEntry(pstate, NULL, rte->eref->aliasname, relation->location, &sublevels_up) == rte) {
badAlias = rte->eref->aliasname;
}
if (rte != NULL && !hasplus) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("invalid reference to FROM-clause entry for table \"%s\"", relation->relname),
(badAlias ? errhint("Perhaps you meant to reference the table alias \"%s\".", badAlias)
: errhint("There is an entry for table \"%s\", but it cannot be referenced from this part of "
"the query.",
rte->eref->aliasname)),
parser_errposition(pstate, relation->location)));
} else if (rte != NULL && hasplus) {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg(
"Operator \"(+)\" can't specify on \"%s\" which cannot be referenced from this part of the query.",
relation->relname),
errhint("\"%s\" should be in current query level.", rte->eref->aliasname),
parser_errposition(pstate, relation->location)));
} else {
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_TABLE),
errmsg("missing FROM-clause entry for table \"%s\"", relation->relname),
parser_errposition(pstate, relation->location)));
}
}
* Generate a suitable error about a missing column.
*
* Since this is a very common type of error, we work rather hard to
* produce a helpful message.
*/
void
errorMissingColumn(ParseState *pstate,
char *relname, char *colname, int location)
{
RangeTblEntry *rte = NULL;
* If relname was given, just play dumb and report it. (In practice, a
* bad qualification name should end up at errorMissingRTE, not here, so
* no need to work hard on this case.)
*/
if (relname) {
char message[MAXSTRLEN];
errno_t rc = 0;
rc = sprintf_s(message, MAXSTRLEN, "column %s.%s does not exist", relname, colname);
securec_check_ss_c(rc, "", "");
InsertErrorMessage(message, u_sess->plsql_cxt.plpgsql_yylloc, true);
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column %s.%s does not exist", relname, colname),
parser_errposition(pstate, location)));
}
* Otherwise, search the entire rtable looking for possible matches. If
* we find one, emit a hint about it.
*/
rte = searchRangeTableForCol(pstate, colname, location);
ereport(ERROR,
(errcode(ERRCODE_UNDEFINED_COLUMN),
errmsg("column \"%s\" does not exist", colname),
rte ? errhint("There is a column named \"%s\" in table \"%s\", but it cannot be referenced from this part of the query.",
colname, rte->eref->aliasname) : 0,
parser_errposition(pstate, location)));
}
* Brief : Set relation store format.
* Input : rel, the table relation .
* rte, the range table entry of relation.
* Output : None.
* Return Value : None.
* Notes : 1. If the Dfs table is CU format, mark as REL_COL_ORIENTED,
* otherwise, mark as REL_PAX_ORIENTED.
*/
static void setRteOrientation(Relation rel, RangeTblEntry* rte)
{
if (RelationIsCUFormat(rel)) {
rte->orientation = REL_COL_ORIENTED;
#ifdef ENABLE_MULTIPLE_NODES
} else if (RelationIsPAXFormat(rel)) {
rte->orientation = REL_PAX_ORIENTED;
if (!u_sess->analyze_cxt.is_under_analyze) {
rte->inh = true;
}
} else if(RelationIsTsStore(rel)) {
rte->orientation = REL_TIMESERIES_ORIENTED;
#endif
} else {
rte->orientation = REL_ROW_ORIENTED;
}
}
static IndexHintType preCheckIndexHints(ParseState* pstate, List* indexhints, Relation relation)
{
IndexHintType retType = INDEX_HINT_USE;
ListCell* lc = NULL;
ListCell* lc_index = NULL;
List* indexOidList = NIL;
Oid indexOid = InvalidOid;
Oid relationOid = RelationGetRelid(relation);
Oid relationNsOid = RelationGetNamespace(relation);
List* indexList = RelationGetIndexList(relation);
IndexHintDefinition* idef = NULL;
bool exist_indexs = false;
if (indexList == NIL) {
retType = INDEX_HINT_NOT_EXISTS;
return retType;
}
IndexHintType itype = ((IndexHintDefinition*)lfirst(list_head(indexhints)))->index_type;
foreach (lc, indexhints) {
idef = (IndexHintDefinition*)lfirst(lc);
itype = (IndexHintType)(idef->index_type | itype);
if (itype == INDEX_HINT_MIX) {
retType = INDEX_HINT_MIX;
goto err;
}
foreach (lc_index, idef->indexnames) {
indexOid = get_relname_relid(strVal(lfirst(lc_index)), relationNsOid);
exist_indexs = false;
if (OidIsValid(indexOid)) {
if (list_member_oid(indexList, indexOid)) {
exist_indexs = true;
}
}
if (!exist_indexs) {
retType = INDEX_HINT_NOT_EXISTS;
goto err;
}
IndexHintRelationData* indexdata = makeNode(IndexHintRelationData);
indexdata->indexOid = indexOid;
indexdata->relationOid = relationOid;
indexdata->index_type = idef->index_type;
indexOidList = list_append_unique(indexOidList, (Node*)indexdata);
}
}
pstate->p_indexhintLists = list_copy(indexOidList);
err:
if (indexOidList != NIL)
list_free(indexOidList);
return retType;
}
typedef struct change_target_list_attrno_context {
Oid rel_oid;
int oldAttnum;
int newAttnum;
int target_varno;
int sublevels_up;
} change_target_list_attrno_context;
* return true if we found rte in current query->rtable, and save sequence to context,
* which is the target varno we need to match target Vars.
*/
static bool GetTargetVarno(Query* query, change_target_list_attrno_context* context)
{
ListCell* lc = NULL;
int targetVarno = 0;
foreach (lc, query->rtable) {
targetVarno++;
RangeTblEntry *rte = (RangeTblEntry *)lfirst(lc);
if (rte->relid == context->rel_oid) {
context->target_varno = targetVarno;
return true;
}
}
return false;
}
* walk through query, to search vars which match target_varno, sublevels_up and oldAttnum,
* and set newAttnum.
*/
bool change_target_list_attrno_walker(Node* node, change_target_list_attrno_context* context)
{
if (node == NULL) {
return false;
}
if (IsA(node, Var)) {
Var* var = (Var*)node;
if (var->varno == (unsigned int)(context->target_varno) &&
var->varlevelsup == (unsigned int)(context->sublevels_up) &&
var->varattno == context->oldAttnum) {
var->varattno = context->newAttnum;
}
return false;
}
if (IsA(node, Query)) {
* We need to search twice because Var may refer to the rtable of upper-level.
* So firstly use upper rtindex and sublevels to match var, and secondly use current-level
* rtindex and sublevels if exists to match var.
*/
context->sublevels_up++;
(void)query_tree_walker((Query*)node, (bool (*)())change_target_list_attrno_walker, context, 0);
context->sublevels_up--;
int save_target_varno = context->target_varno;
int save_sublevels_up = context->sublevels_up;
if (GetTargetVarno((Query*)node, context)) {
context->sublevels_up = 0;
(void)query_tree_walker((Query*)node, (bool (*)())change_target_list_attrno_walker, context, 0);
}
context->sublevels_up = save_sublevels_up;
context->target_varno = save_target_varno;
return false;
}
return expression_tree_walker(node, (bool (*)())change_target_list_attrno_walker, (void*)context);
}
* correct varattno of vars in query, since it maybe different from the past.
*/
static void change_var_attno(Query* query, Oid rel_oid, int oldAttnum, int newAttnum)
{
change_target_list_attrno_context context;
context.rel_oid = rel_oid;
context.oldAttnum = oldAttnum;
context.newAttnum = newAttnum;
context.sublevels_up = 0;
context.target_varno = 0;
(void)GetTargetVarno(query, &context);
(void)query_or_expression_tree_walker(
(Node*)query, (bool (*)())change_target_list_attrno_walker, (void*)&context, 0);
}
