PostgreSQL Source Code git master
Loading...
Searching...
No Matches
parse_utilcmd.h File Reference
Include dependency graph for parse_utilcmd.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs

typedef struct AttrMap AttrMap
 

Functions

ListtransformCreateStmt (CreateStmt *stmt, const char *queryString)
 
AlterTableStmttransformAlterTableStmt (Oid relid, AlterTableStmt *stmt, const char *queryString, List **beforeStmts, List **afterStmts)
 
IndexStmttransformIndexStmt (Oid relid, IndexStmt *stmt, const char *queryString)
 
CreateStatsStmttransformStatsStmt (Oid relid, CreateStatsStmt *stmt, const char *queryString)
 
void transformRuleStmt (RuleStmt *stmt, const char *queryString, List **actions, Node **whereClause)
 
ListtransformCreateSchemaStmtElements (ParseState *pstate, List *schemaElts, const char *schemaName)
 
PartitionBoundSpectransformPartitionBound (ParseState *pstate, Relation parent, PartitionBoundSpec *spec)
 
ListexpandTableLikeClause (RangeVar *heapRel, TableLikeClause *table_like_clause)
 
IndexStmtgenerateClonedIndexStmt (RangeVar *heapRel, Relation source_idx, const AttrMap *attmap, Oid *constraintOid)
 

Typedef Documentation

◆ AttrMap

Definition at line 19 of file parse_utilcmd.h.

Function Documentation

◆ expandTableLikeClause()

List * expandTableLikeClause ( RangeVar heapRel,
TableLikeClause table_like_clause 
)
extern

Definition at line 1342 of file parse_utilcmd.c.

1343{
1344 List *result = NIL;
1345 List *atsubcmds = NIL;
1347 Relation relation;
1350 TupleConstr *constr;
1351 AttrMap *attmap;
1352 char *comment;
1353
1354 /*
1355 * Open the relation referenced by the LIKE clause. We should still have
1356 * the table lock obtained by transformTableLikeClause (and this'll throw
1357 * an assertion failure if not). Hence, no need to recheck privileges
1358 * etc. We must open the rel by OID not name, to be sure we get the same
1359 * table.
1360 */
1361 if (!OidIsValid(table_like_clause->relationOid))
1362 elog(ERROR, "expandTableLikeClause called on untransformed LIKE clause");
1363
1364 relation = relation_open(table_like_clause->relationOid, NoLock);
1365
1366 tupleDesc = RelationGetDescr(relation);
1367 constr = tupleDesc->constr;
1368
1369 /*
1370 * Open the newly-created child relation; we have lock on that too.
1371 */
1372 childrel = relation_openrv(heapRel, NoLock);
1373
1374 /*
1375 * Construct a map from the LIKE relation's attnos to the child rel's.
1376 * This re-checks type match etc, although it shouldn't be possible to
1377 * have a failure since both tables are locked.
1378 */
1380 tupleDesc,
1381 false);
1382
1383 /*
1384 * Process defaults, if required.
1385 */
1386 if ((table_like_clause->options &
1388 constr != NULL)
1389 {
1390 for (parent_attno = 1; parent_attno <= tupleDesc->natts;
1391 parent_attno++)
1392 {
1394 parent_attno - 1);
1395
1396 /*
1397 * Ignore dropped columns in the parent.
1398 */
1399 if (attribute->attisdropped)
1400 continue;
1401
1402 /*
1403 * Copy default, if present and it should be copied. We have
1404 * separate options for plain default expressions and GENERATED
1405 * defaults.
1406 */
1407 if (attribute->atthasdef &&
1408 (attribute->attgenerated ?
1411 {
1414 bool found_whole_row;
1415
1417 if (this_default == NULL)
1418 elog(ERROR, "default expression not found for attribute %d of relation \"%s\"",
1420
1423 atsubcmd->num = attmap->attnums[parent_attno - 1];
1425 1, 0,
1426 attmap,
1427 InvalidOid,
1428 &found_whole_row);
1429
1430 /*
1431 * Prevent this for the same reason as for constraints below.
1432 * Note that defaults cannot contain any vars, so it's OK that
1433 * the error message refers to generated columns.
1434 */
1435 if (found_whole_row)
1436 ereport(ERROR,
1438 errmsg("cannot convert whole-row table reference"),
1439 errdetail("Generation expression for column \"%s\" contains a whole-row reference to table \"%s\".",
1440 NameStr(attribute->attname),
1441 RelationGetRelationName(relation))));
1442
1444 }
1445 }
1446 }
1447
1448 /*
1449 * Copy CHECK constraints if requested, being careful to adjust attribute
1450 * numbers so they match the child.
1451 */
1453 constr != NULL)
1454 {
1455 int ccnum;
1456
1457 for (ccnum = 0; ccnum < constr->num_check; ccnum++)
1458 {
1459 char *ccname = constr->check[ccnum].ccname;
1460 char *ccbin = constr->check[ccnum].ccbin;
1461 bool ccenforced = constr->check[ccnum].ccenforced;
1462 bool ccnoinherit = constr->check[ccnum].ccnoinherit;
1464 bool found_whole_row;
1465 Constraint *n;
1467
1469 1, 0,
1470 attmap,
1471 InvalidOid, &found_whole_row);
1472
1473 /*
1474 * We reject whole-row variables because the whole point of LIKE
1475 * is that the new table's rowtype might later diverge from the
1476 * parent's. So, while translation might be possible right now,
1477 * it wouldn't be possible to guarantee it would work in future.
1478 */
1479 if (found_whole_row)
1480 ereport(ERROR,
1482 errmsg("cannot convert whole-row table reference"),
1483 errdetail("Constraint \"%s\" contains a whole-row reference to table \"%s\".",
1484 ccname,
1485 RelationGetRelationName(relation))));
1486
1487 n = makeNode(Constraint);
1488 n->contype = CONSTR_CHECK;
1489 n->conname = pstrdup(ccname);
1490 n->location = -1;
1491 n->is_enforced = ccenforced;
1492 n->initially_valid = ccenforced; /* sic */
1493 n->is_no_inherit = ccnoinherit;
1494 n->raw_expr = NULL;
1496
1497 /* We can skip validation, since the new table should be empty. */
1498 n->skip_validation = true;
1499
1501 atsubcmd->subtype = AT_AddConstraint;
1502 atsubcmd->def = (Node *) n;
1504
1505 /* Copy comment on constraint */
1508 n->conname, false),
1510 0)) != NULL)
1511 {
1513
1514 stmt->objtype = OBJECT_TABCONSTRAINT;
1515 stmt->object = (Node *) list_make3(makeString(heapRel->schemaname),
1516 makeString(heapRel->relname),
1517 makeString(n->conname));
1518 stmt->comment = comment;
1519
1521 }
1522 }
1523 }
1524
1525 /*
1526 * If we generated any ALTER TABLE actions above, wrap them into a single
1527 * ALTER TABLE command. Stick it at the front of the result, so it runs
1528 * before any CommentStmts we made above.
1529 */
1530 if (atsubcmds)
1531 {
1533
1534 atcmd->relation = copyObject(heapRel);
1535 atcmd->cmds = atsubcmds;
1536 atcmd->objtype = OBJECT_TABLE;
1537 atcmd->missing_ok = false;
1539 }
1540
1541 /*
1542 * Process indexes if required.
1543 */
1545 relation->rd_rel->relhasindex &&
1546 childrel->rd_rel->relkind != RELKIND_FOREIGN_TABLE)
1547 {
1549 ListCell *l;
1550
1552
1553 foreach(l, parent_indexes)
1554 {
1558
1560
1561 /* Build CREATE INDEX statement to recreate the parent_index */
1564 attmap,
1565 NULL);
1566
1567 /* Copy comment on index, if requested */
1569 {
1571
1572 /*
1573 * We make use of IndexStmt's idxcomment option, so as not to
1574 * need to know now what name the index will have.
1575 */
1576 index_stmt->idxcomment = comment;
1577 }
1578
1580
1582 }
1583 }
1584
1585 /*
1586 * Process extended statistics if required.
1587 */
1589 {
1591 ListCell *l;
1592
1594
1595 foreach(l, parent_extstats)
1596 {
1599
1603 attmap);
1604
1605 /* Copy comment on statistics object, if requested */
1607 {
1609
1610 /*
1611 * We make use of CreateStatsStmt's stxcomment option, so as
1612 * not to need to know now what name the statistics will have.
1613 */
1614 stats_stmt->stxcomment = comment;
1615 }
1616
1618 }
1619
1621 }
1622
1623 /* Done with child rel */
1625
1626 /*
1627 * Close the parent rel, but keep our AccessShareLock on it until xact
1628 * commit. That will prevent someone else from deleting or ALTERing the
1629 * parent before the child is committed.
1630 */
1631 table_close(relation, NoLock);
1632
1633 return result;
1634}
AttrMap * build_attrmap_by_name(TupleDesc indesc, TupleDesc outdesc, bool missing_ok)
Definition attmap.c:175
int16 AttrNumber
Definition attnum.h:21
#define NameStr(name)
Definition c.h:835
#define OidIsValid(objectId)
Definition c.h:858
uint32 result
char * GetComment(Oid oid, Oid classoid, int32 subid)
Definition comment.c:420
int errcode(int sqlerrcode)
Definition elog.c:875
int errdetail(const char *fmt,...) pg_attribute_printf(1
#define ERROR
Definition elog.h:40
#define elog(elevel,...)
Definition elog.h:228
#define ereport(elevel,...)
Definition elog.h:152
#define stmt
#define comment
void index_close(Relation relation, LOCKMODE lockmode)
Definition indexam.c:178
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition indexam.c:134
List * lappend(List *list, void *datum)
Definition list.c:339
List * lcons(void *datum, List *list)
Definition list.c:495
void list_free(List *list)
Definition list.c:1546
#define NoLock
Definition lockdefs.h:34
#define AccessShareLock
Definition lockdefs.h:36
char * pstrdup(const char *in)
Definition mcxt.c:1910
#define copyObject(obj)
Definition nodes.h:232
#define makeNode(_type_)
Definition nodes.h:161
static char * errmsg
char * nodeToString(const void *obj)
Definition outfuncs.c:811
static CreateStatsStmt * generateClonedExtStatsStmt(RangeVar *heapRel, Oid heapRelid, Oid source_statsid, const AttrMap *attmap)
IndexStmt * generateClonedIndexStmt(RangeVar *heapRel, Relation source_idx, const AttrMap *attmap, Oid *constraintOid)
@ CONSTR_CHECK
@ OBJECT_TABLE
@ OBJECT_TABCONSTRAINT
@ AT_AddConstraint
@ AT_CookedColumnDefault
@ CREATE_TABLE_LIKE_COMMENTS
Definition parsenodes.h:805
@ CREATE_TABLE_LIKE_GENERATED
Definition parsenodes.h:809
@ CREATE_TABLE_LIKE_INDEXES
Definition parsenodes.h:811
@ CREATE_TABLE_LIKE_DEFAULTS
Definition parsenodes.h:808
@ CREATE_TABLE_LIKE_STATISTICS
Definition parsenodes.h:812
@ CREATE_TABLE_LIKE_CONSTRAINTS
Definition parsenodes.h:807
FormData_pg_attribute * Form_pg_attribute
Oid get_relation_constraint_oid(Oid relid, const char *conname, bool missing_ok)
#define NIL
Definition pg_list.h:68
#define list_make3(x1, x2, x3)
Definition pg_list.h:248
#define lfirst_oid(lc)
Definition pg_list.h:174
#define InvalidOid
unsigned int Oid
static int fb(int x)
void * stringToNode(const char *str)
Definition read.c:90
#define RelationGetRelid(relation)
Definition rel.h:516
#define RelationGetDescr(relation)
Definition rel.h:542
#define RelationGetRelationName(relation)
Definition rel.h:550
List * RelationGetIndexList(Relation relation)
Definition relcache.c:4837
List * RelationGetStatExtList(Relation relation)
Definition relcache.c:4978
Node * map_variable_attnos(Node *node, int target_varno, int sublevels_up, const AttrMap *attno_map, Oid to_rowtype, bool *found_whole_row)
Relation relation_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition relation.c:138
Relation relation_open(Oid relationId, LOCKMODE lockmode)
Definition relation.c:48
char * ccname
Definition tupdesc.h:30
bool ccenforced
Definition tupdesc.h:32
bool ccnoinherit
Definition tupdesc.h:34
char * ccbin
Definition tupdesc.h:31
ParseLoc location
ConstrType contype
bool is_no_inherit
bool is_enforced
char * cooked_expr
bool initially_valid
bool skip_validation
Node * raw_expr
char * conname
Definition pg_list.h:54
Definition nodes.h:135
char * relname
Definition primnodes.h:84
char * schemaname
Definition primnodes.h:81
Form_pg_class rd_rel
Definition rel.h:111
ConstrCheck * check
Definition tupdesc.h:41
uint16 num_check
Definition tupdesc.h:44
void table_close(Relation relation, LOCKMODE lockmode)
Definition table.c:126
Node * TupleDescGetDefault(TupleDesc tupdesc, AttrNumber attnum)
Definition tupdesc.c:1152
static FormData_pg_attribute * TupleDescAttr(TupleDesc tupdesc, int i)
Definition tupdesc.h:178
String * makeString(char *str)
Definition value.c:63

References AccessShareLock, AT_AddConstraint, AT_CookedColumnDefault, build_attrmap_by_name(), ConstrCheck::ccbin, ConstrCheck::ccenforced, ConstrCheck::ccname, ConstrCheck::ccnoinherit, TupleConstr::check, comment, Constraint::conname, CONSTR_CHECK, Constraint::contype, Constraint::cooked_expr, copyObject, CREATE_TABLE_LIKE_COMMENTS, CREATE_TABLE_LIKE_CONSTRAINTS, CREATE_TABLE_LIKE_DEFAULTS, CREATE_TABLE_LIKE_GENERATED, CREATE_TABLE_LIKE_INDEXES, CREATE_TABLE_LIKE_STATISTICS, elog, ereport, errcode(), errdetail(), errmsg, ERROR, fb(), generateClonedExtStatsStmt(), generateClonedIndexStmt(), get_relation_constraint_oid(), GetComment(), index_close(), index_open(), Constraint::initially_valid, InvalidOid, Constraint::is_enforced, Constraint::is_no_inherit, lappend(), lcons(), lfirst_oid, list_free(), list_make3, Constraint::location, makeNode, makeString(), map_variable_attnos(), NameStr, NIL, nodeToString(), NoLock, TupleConstr::num_check, OBJECT_TABCONSTRAINT, OBJECT_TABLE, OidIsValid, pstrdup(), Constraint::raw_expr, RelationData::rd_rel, relation_open(), relation_openrv(), RelationGetDescr, RelationGetIndexList(), RelationGetRelationName, RelationGetRelid, RelationGetStatExtList(), RangeVar::relname, result, RangeVar::schemaname, Constraint::skip_validation, stmt, stringToNode(), table_close(), TupleDescAttr(), and TupleDescGetDefault().

Referenced by ProcessUtilitySlow().

◆ generateClonedIndexStmt()

IndexStmt * generateClonedIndexStmt ( RangeVar heapRel,
Relation  source_idx,
const AttrMap attmap,
Oid constraintOid 
)
extern

Definition at line 1690 of file parse_utilcmd.c.

1693{
1704 List *indexprs;
1706 Oid indrelid;
1707 int keyno;
1709 Datum datum;
1710 bool isnull;
1711
1712 if (constraintOid)
1714
1715 /*
1716 * Fetch pg_class tuple of source index. We can't use the copy in the
1717 * relcache entry because it doesn't include optional fields.
1718 */
1721 elog(ERROR, "cache lookup failed for relation %u", source_relid);
1723
1724 /* Fetch pg_index tuple for source index from relcache entry */
1725 ht_idx = source_idx->rd_indextuple;
1727 indrelid = idxrec->indrelid;
1728
1729 /* Fetch the pg_am tuple of the index' access method */
1731 if (!HeapTupleIsValid(ht_am))
1732 elog(ERROR, "cache lookup failed for access method %u",
1733 idxrelrec->relam);
1735
1736 /* Extract indcollation from the pg_index tuple */
1740
1741 /* Extract indclass from the pg_index tuple */
1743 indclass = (oidvector *) DatumGetPointer(datum);
1744
1745 /* Begin building the IndexStmt */
1747 index->relation = heapRel;
1748 index->accessMethod = pstrdup(NameStr(amrec->amname));
1749 if (OidIsValid(idxrelrec->reltablespace))
1750 index->tableSpace = get_tablespace_name(idxrelrec->reltablespace);
1751 else
1752 index->tableSpace = NULL;
1753 index->excludeOpNames = NIL;
1754 index->idxcomment = NULL;
1755 index->indexOid = InvalidOid;
1756 index->oldNumber = InvalidRelFileNumber;
1757 index->oldCreateSubid = InvalidSubTransactionId;
1758 index->oldFirstRelfilelocatorSubid = InvalidSubTransactionId;
1759 index->unique = idxrec->indisunique;
1760 index->nulls_not_distinct = idxrec->indnullsnotdistinct;
1761 index->primary = idxrec->indisprimary;
1762 index->iswithoutoverlaps = (idxrec->indisprimary || idxrec->indisunique) && idxrec->indisexclusion;
1763 index->transformed = true; /* don't need transformIndexStmt */
1764 index->concurrent = false;
1765 index->if_not_exists = false;
1766 index->reset_default_tblspc = false;
1767
1768 /*
1769 * We don't try to preserve the name of the source index; instead, just
1770 * let DefineIndex() choose a reasonable name. (If we tried to preserve
1771 * the name, we'd get duplicate-relation-name failures unless the source
1772 * table was in a different schema.)
1773 */
1774 index->idxname = NULL;
1775
1776 /*
1777 * If the index is marked PRIMARY or has an exclusion condition, it's
1778 * certainly from a constraint; else, if it's not marked UNIQUE, it
1779 * certainly isn't. If it is or might be from a constraint, we have to
1780 * fetch the pg_constraint record.
1781 */
1782 if (index->primary || index->unique || idxrec->indisexclusion)
1783 {
1785
1787 {
1790
1791 if (constraintOid)
1793
1797 elog(ERROR, "cache lookup failed for constraint %u",
1798 constraintId);
1800
1801 index->isconstraint = true;
1802 index->deferrable = conrec->condeferrable;
1803 index->initdeferred = conrec->condeferred;
1804
1805 /* If it's an exclusion constraint, we need the operator names */
1806 if (idxrec->indisexclusion)
1807 {
1808 Datum *elems;
1809 int nElems;
1810 int i;
1811
1812 Assert(conrec->contype == CONSTRAINT_EXCLUSION ||
1813 (index->iswithoutoverlaps &&
1814 (conrec->contype == CONSTRAINT_PRIMARY || conrec->contype == CONSTRAINT_UNIQUE)));
1815 /* Extract operator OIDs from the pg_constraint tuple */
1818 deconstruct_array_builtin(DatumGetArrayTypeP(datum), OIDOID, &elems, NULL, &nElems);
1819
1820 for (i = 0; i < nElems; i++)
1821 {
1822 Oid operid = DatumGetObjectId(elems[i]);
1825 char *oprname;
1826 char *nspname;
1827 List *namelist;
1828
1832 elog(ERROR, "cache lookup failed for operator %u",
1833 operid);
1835 oprname = pstrdup(NameStr(operform->oprname));
1836 /* For simplicity we always schema-qualify the op name */
1837 nspname = get_namespace_name(operform->oprnamespace);
1838 namelist = list_make2(makeString(nspname),
1839 makeString(oprname));
1840 index->excludeOpNames = lappend(index->excludeOpNames,
1841 namelist);
1843 }
1844 }
1845
1847 }
1848 else
1849 index->isconstraint = false;
1850 }
1851 else
1852 index->isconstraint = false;
1853
1854 /* Get the index expressions, if any */
1856 Anum_pg_index_indexprs, &isnull);
1857 if (!isnull)
1858 {
1859 char *exprsString;
1860
1863 }
1864 else
1865 indexprs = NIL;
1866
1867 /* Build the list of IndexElem */
1868 index->indexParams = NIL;
1869 index->indexIncludingParams = NIL;
1870
1872 for (keyno = 0; keyno < idxrec->indnkeyatts; keyno++)
1873 {
1875 AttrNumber attnum = idxrec->indkey.values[keyno];
1877 keyno);
1878 int16 opt = source_idx->rd_indoption[keyno];
1879
1881
1883 {
1884 /* Simple index column */
1885 char *attname;
1886
1889
1890 iparam->name = attname;
1891 iparam->expr = NULL;
1892 }
1893 else
1894 {
1895 /* Expressional index */
1896 Node *indexkey;
1897 bool found_whole_row;
1898
1899 if (indexpr_item == NULL)
1900 elog(ERROR, "too few entries in indexprs list");
1903
1904 /* Adjust Vars to match new table's column numbering */
1906 1, 0,
1907 attmap,
1908 InvalidOid, &found_whole_row);
1909
1910 /* As in expandTableLikeClause, reject whole-row variables */
1911 if (found_whole_row)
1912 ereport(ERROR,
1914 errmsg("cannot convert whole-row table reference"),
1915 errdetail("Index \"%s\" contains a whole-row table reference.",
1917
1918 iparam->name = NULL;
1919 iparam->expr = indexkey;
1920
1922 }
1923
1924 /* Copy the original index column name */
1925 iparam->indexcolname = pstrdup(NameStr(attr->attname));
1926
1927 /* Add the collation name, if non-default */
1928 iparam->collation = get_collation(indcollation->values[keyno], keycoltype);
1929
1930 /* Add the operator class name, if non-default */
1931 iparam->opclass = get_opclass(indclass->values[keyno], keycoltype);
1932 iparam->opclassopts =
1934
1935 iparam->ordering = SORTBY_DEFAULT;
1936 iparam->nulls_ordering = SORTBY_NULLS_DEFAULT;
1937
1938 /* Adjust options if necessary */
1939 if (source_idx->rd_indam->amcanorder)
1940 {
1941 /*
1942 * If it supports sort ordering, copy DESC and NULLS opts. Don't
1943 * set non-default settings unnecessarily, though, so as to
1944 * improve the chance of recognizing equivalence to constraint
1945 * indexes.
1946 */
1947 if (opt & INDOPTION_DESC)
1948 {
1949 iparam->ordering = SORTBY_DESC;
1950 if ((opt & INDOPTION_NULLS_FIRST) == 0)
1951 iparam->nulls_ordering = SORTBY_NULLS_LAST;
1952 }
1953 else
1954 {
1955 if (opt & INDOPTION_NULLS_FIRST)
1956 iparam->nulls_ordering = SORTBY_NULLS_FIRST;
1957 }
1958 }
1959
1960 iparam->location = -1;
1961
1962 index->indexParams = lappend(index->indexParams, iparam);
1963 }
1964
1965 /* Handle included columns separately */
1966 for (keyno = idxrec->indnkeyatts; keyno < idxrec->indnatts; keyno++)
1967 {
1969 AttrNumber attnum = idxrec->indkey.values[keyno];
1971 keyno);
1972
1974
1976 {
1977 /* Simple index column */
1978 char *attname;
1979
1981
1982 iparam->name = attname;
1983 iparam->expr = NULL;
1984 }
1985 else
1986 ereport(ERROR,
1988 errmsg("expressions are not supported in included columns")));
1989
1990 /* Copy the original index column name */
1991 iparam->indexcolname = pstrdup(NameStr(attr->attname));
1992
1993 iparam->location = -1;
1994
1995 index->indexIncludingParams = lappend(index->indexIncludingParams, iparam);
1996 }
1997 /* Copy reloptions if any */
1999 Anum_pg_class_reloptions, &isnull);
2000 if (!isnull)
2001 index->options = untransformRelOptions(datum);
2002
2003 /* If it's a partial index, decompile and append the predicate */
2005 Anum_pg_index_indpred, &isnull);
2006 if (!isnull)
2007 {
2008 char *pred_str;
2009 Node *pred_tree;
2010 bool found_whole_row;
2011
2012 /* Convert text string to node tree */
2015
2016 /* Adjust Vars to match new table's column numbering */
2018 1, 0,
2019 attmap,
2020 InvalidOid, &found_whole_row);
2021
2022 /* As in expandTableLikeClause, reject whole-row variables */
2023 if (found_whole_row)
2024 ereport(ERROR,
2026 errmsg("cannot convert whole-row table reference"),
2027 errdetail("Index \"%s\" contains a whole-row table reference.",
2029
2030 index->whereClause = pred_tree;
2031 }
2032
2033 /* Clean up */
2036
2037 return index;
2038}
#define DatumGetArrayTypeP(X)
Definition array.h:261
void deconstruct_array_builtin(const ArrayType *array, Oid elmtype, Datum **elemsp, bool **nullsp, int *nelemsp)
#define AttributeNumberIsValid(attributeNumber)
Definition attnum.h:34
char * get_tablespace_name(Oid spc_oid)
#define TextDatumGetCString(d)
Definition builtins.h:99
#define InvalidSubTransactionId
Definition c.h:742
#define Assert(condition)
Definition c.h:943
int16_t int16
Definition c.h:619
#define HeapTupleIsValid(tuple)
Definition htup.h:78
static void * GETSTRUCT(const HeapTupleData *tuple)
int i
Definition isn.c:77
Datum get_attoptions(Oid relid, int16 attnum)
Definition lsyscache.c:1127
char * get_attname(Oid relid, AttrNumber attnum, bool missing_ok)
Definition lsyscache.c:984
char * get_namespace_name(Oid nspid)
Definition lsyscache.c:3599
Oid get_atttype(Oid relid, AttrNumber attnum)
Definition lsyscache.c:1070
Oid exprType(const Node *expr)
Definition nodeFuncs.c:42
static List * get_collation(Oid collation, Oid actual_datatype)
static List * get_opclass(Oid opclass, Oid actual_datatype)
@ SORTBY_NULLS_DEFAULT
Definition parsenodes.h:54
@ SORTBY_NULLS_LAST
Definition parsenodes.h:56
@ SORTBY_NULLS_FIRST
Definition parsenodes.h:55
@ SORTBY_DESC
Definition parsenodes.h:48
@ SORTBY_DEFAULT
Definition parsenodes.h:46
END_CATALOG_STRUCT typedef FormData_pg_am * Form_pg_am
Definition pg_am.h:52
NameData attname
int16 attnum
FormData_pg_class * Form_pg_class
Definition pg_class.h:160
END_CATALOG_STRUCT typedef FormData_pg_constraint * Form_pg_constraint
Oid get_index_constraint(Oid indexId)
Definition pg_depend.c:1061
END_CATALOG_STRUCT typedef FormData_pg_index * Form_pg_index
Definition pg_index.h:74
#define lfirst(lc)
Definition pg_list.h:172
static ListCell * list_head(const List *l)
Definition pg_list.h:128
static ListCell * lnext(const List *l, const ListCell *c)
Definition pg_list.h:375
#define list_make2(x1, x2)
Definition pg_list.h:246
END_CATALOG_STRUCT typedef FormData_pg_operator * Form_pg_operator
Definition pg_operator.h:87
static Oid DatumGetObjectId(Datum X)
Definition postgres.h:242
static Datum ObjectIdGetDatum(Oid X)
Definition postgres.h:252
uint64_t Datum
Definition postgres.h:70
static Pointer DatumGetPointer(Datum X)
Definition postgres.h:332
List * untransformRelOptions(Datum options)
#define InvalidRelFileNumber
Definition relpath.h:26
Definition type.h:97
Definition c.h:815
void ReleaseSysCache(HeapTuple tuple)
Definition syscache.c:265
Datum SysCacheGetAttrNotNull(SysCacheIdentifier cacheId, HeapTuple tup, AttrNumber attributeNumber)
Definition syscache.c:626
HeapTuple SearchSysCache1(SysCacheIdentifier cacheId, Datum key1)
Definition syscache.c:221
Datum SysCacheGetAttr(SysCacheIdentifier cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition syscache.c:596

References Assert, attname, attnum, AttributeNumberIsValid, DatumGetArrayTypeP, DatumGetObjectId(), DatumGetPointer(), deconstruct_array_builtin(), elog, ereport, errcode(), errdetail(), errmsg, ERROR, exprType(), fb(), Form_pg_am, Form_pg_constraint, Form_pg_index, Form_pg_operator, get_attname(), get_attoptions(), get_atttype(), get_collation(), get_index_constraint(), get_namespace_name(), get_opclass(), get_tablespace_name(), GETSTRUCT(), HeapTupleIsValid, i, InvalidOid, InvalidRelFileNumber, InvalidSubTransactionId, lappend(), lfirst, list_head(), list_make2, lnext(), makeNode, makeString(), map_variable_attnos(), NameStr, NIL, ObjectIdGetDatum(), OidIsValid, pstrdup(), RelationGetDescr, RelationGetRelationName, RelationGetRelid, ReleaseSysCache(), SearchSysCache1(), SORTBY_DEFAULT, SORTBY_DESC, SORTBY_NULLS_DEFAULT, SORTBY_NULLS_FIRST, SORTBY_NULLS_LAST, stringToNode(), SysCacheGetAttr(), SysCacheGetAttrNotNull(), TextDatumGetCString, TupleDescAttr(), and untransformRelOptions().

Referenced by AttachPartitionEnsureIndexes(), DefineIndex(), DefineRelation(), and expandTableLikeClause().

◆ transformAlterTableStmt()

AlterTableStmt * transformAlterTableStmt ( Oid  relid,
AlterTableStmt stmt,
const char queryString,
List **  beforeStmts,
List **  afterStmts 
)
extern

Definition at line 3819 of file parse_utilcmd.c.

3822{
3823 Relation rel;
3824 TupleDesc tupdesc;
3825 ParseState *pstate;
3828 ListCell *lcmd,
3829 *l;
3830 List *newcmds = NIL;
3831 bool skipValidation = true;
3834
3835 /* Caller is responsible for locking the relation */
3836 rel = relation_open(relid, NoLock);
3837 tupdesc = RelationGetDescr(rel);
3838
3839 /* Set up pstate */
3840 pstate = make_parsestate(NULL);
3841 pstate->p_sourcetext = queryString;
3843 rel,
3845 NULL,
3846 false,
3847 true);
3848 addNSItemToQuery(pstate, nsitem, false, true, true);
3849
3850 /* Set up CreateStmtContext */
3851 cxt.pstate = pstate;
3852 if (rel->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
3853 {
3854 cxt.stmtType = "ALTER FOREIGN TABLE";
3855 cxt.isforeign = true;
3856 }
3857 else
3858 {
3859 cxt.stmtType = "ALTER TABLE";
3860 cxt.isforeign = false;
3861 }
3862 cxt.relation = stmt->relation;
3863 cxt.rel = rel;
3864 cxt.inhRelations = NIL;
3865 cxt.isalter = true;
3866 cxt.columns = NIL;
3867 cxt.ckconstraints = NIL;
3868 cxt.nnconstraints = NIL;
3869 cxt.fkconstraints = NIL;
3870 cxt.ixconstraints = NIL;
3871 cxt.likeclauses = NIL;
3872 cxt.blist = NIL;
3873 cxt.alist = NIL;
3874 cxt.pkey = NULL;
3875 cxt.ispartitioned = (rel->rd_rel->relkind == RELKIND_PARTITIONED_TABLE);
3876 cxt.partbound = NULL;
3877 cxt.ofType = false;
3878
3879 /*
3880 * Transform ALTER subcommands that need it (most don't). These largely
3881 * re-use code from CREATE TABLE.
3882 */
3883 foreach(lcmd, stmt->cmds)
3884 {
3886
3887 switch (cmd->subtype)
3888 {
3889 case AT_AddColumn:
3890 {
3891 ColumnDef *def = castNode(ColumnDef, cmd->def);
3892
3893 transformColumnDefinition(&cxt, def);
3894
3895 /*
3896 * If the column has a non-null default, we can't skip
3897 * validation of foreign keys.
3898 */
3899 if (def->raw_default != NULL)
3900 skipValidation = false;
3901
3902 /*
3903 * All constraints are processed in other ways. Remove the
3904 * original list
3905 */
3906 def->constraints = NIL;
3907
3908 newcmds = lappend(newcmds, cmd);
3909 break;
3910 }
3911
3912 case AT_AddConstraint:
3913
3914 /*
3915 * The original AddConstraint cmd node doesn't go to newcmds
3916 */
3917 if (IsA(cmd->def, Constraint))
3918 {
3919 transformTableConstraint(&cxt, (Constraint *) cmd->def);
3920 if (((Constraint *) cmd->def)->contype == CONSTR_FOREIGN)
3921 skipValidation = false;
3922 }
3923 else
3924 elog(ERROR, "unrecognized node type: %d",
3925 (int) nodeTag(cmd->def));
3926 break;
3927
3928 case AT_AlterColumnType:
3929 {
3930 ColumnDef *def = castNode(ColumnDef, cmd->def);
3932
3933 /*
3934 * For ALTER COLUMN TYPE, transform the USING clause if
3935 * one was specified.
3936 */
3937 if (def->raw_default)
3938 {
3939 def->cooked_default =
3940 transformExpr(pstate, def->raw_default,
3942 }
3943
3944 /*
3945 * For identity column, create ALTER SEQUENCE command to
3946 * change the data type of the sequence. Identity sequence
3947 * is associated with the top level partitioned table.
3948 * Hence ignore partitions.
3949 */
3951 {
3952 attnum = get_attnum(relid, cmd->name);
3954 ereport(ERROR,
3956 errmsg("column \"%s\" of relation \"%s\" does not exist",
3957 cmd->name, RelationGetRelationName(rel))));
3958
3959 if (attnum > 0 &&
3960 TupleDescAttr(tupdesc, attnum - 1)->attidentity)
3961 {
3962 Oid seq_relid = getIdentitySequence(rel, attnum, false);
3963 Oid typeOid = typenameTypeId(pstate, def->typeName);
3965
3966 altseqstmt->sequence
3969 -1);
3970 altseqstmt->options = list_make1(makeDefElem("as",
3971 (Node *) makeTypeNameFromOid(typeOid, -1),
3972 -1));
3973 altseqstmt->for_identity = true;
3974 cxt.blist = lappend(cxt.blist, altseqstmt);
3975 }
3976 }
3977
3978 newcmds = lappend(newcmds, cmd);
3979 break;
3980 }
3981
3982 case AT_AddIdentity:
3983 {
3984 Constraint *def = castNode(Constraint, cmd->def);
3987
3988 newdef->colname = cmd->name;
3989 newdef->identity = def->generated_when;
3990 cmd->def = (Node *) newdef;
3991
3992 attnum = get_attnum(relid, cmd->name);
3994 ereport(ERROR,
3996 errmsg("column \"%s\" of relation \"%s\" does not exist",
3997 cmd->name, RelationGetRelationName(rel))));
3998
4000 get_atttype(relid, attnum),
4001 def->options, true, true,
4002 NULL, NULL);
4003
4004 newcmds = lappend(newcmds, cmd);
4005 break;
4006 }
4007
4008 case AT_SetIdentity:
4009 {
4010 /*
4011 * Create an ALTER SEQUENCE statement for the internal
4012 * sequence of the identity column.
4013 */
4014 ListCell *lc;
4015 List *newseqopts = NIL;
4016 List *newdef = NIL;
4018 Oid seq_relid;
4019
4020 /*
4021 * Split options into those handled by ALTER SEQUENCE and
4022 * those for ALTER TABLE proper.
4023 */
4024 foreach(lc, castNode(List, cmd->def))
4025 {
4026 DefElem *def = lfirst_node(DefElem, lc);
4027
4028 if (strcmp(def->defname, "generated") == 0)
4029 newdef = lappend(newdef, def);
4030 else
4032 }
4033
4034 attnum = get_attnum(relid, cmd->name);
4036 ereport(ERROR,
4038 errmsg("column \"%s\" of relation \"%s\" does not exist",
4039 cmd->name, RelationGetRelationName(rel))));
4040
4041 seq_relid = getIdentitySequence(rel, attnum, true);
4042
4043 if (seq_relid)
4044 {
4046
4049 get_rel_name(seq_relid), -1);
4050 seqstmt->options = newseqopts;
4051 seqstmt->for_identity = true;
4052 seqstmt->missing_ok = false;
4053
4054 cxt.blist = lappend(cxt.blist, seqstmt);
4055 }
4056
4057 /*
4058 * If column was not an identity column, we just let the
4059 * ALTER TABLE command error out later. (There are cases
4060 * this fails to cover, but we'll need to restructure
4061 * where creation of the sequence dependency linkage
4062 * happens before we can fix it.)
4063 */
4064
4065 cmd->def = (Node *) newdef;
4066 newcmds = lappend(newcmds, cmd);
4067 break;
4068 }
4069
4070 case AT_AttachPartition:
4071 case AT_DetachPartition:
4072 {
4074
4075 transformPartitionCmd(&cxt, partcmd->bound);
4076 /* assign the transformed value of the partition bound */
4077 partcmd->bound = cxt.partbound;
4078 }
4079
4080 newcmds = lappend(newcmds, cmd);
4081 break;
4082
4083 case AT_MergePartitions:
4084 {
4086
4087 if (list_length(partcmd->partlist) < 2)
4088 ereport(ERROR,
4090 errmsg("list of partitions to be merged should include at least two partitions"));
4091
4093 newcmds = lappend(newcmds, cmd);
4094 break;
4095 }
4096
4097 case AT_SplitPartition:
4098 {
4100
4101 if (list_length(partcmd->partlist) < 2)
4102 ereport(ERROR,
4104 errmsg("list of new partitions should contain at least two partitions"));
4105
4107 newcmds = lappend(newcmds, cmd);
4108 break;
4109 }
4110
4111 default:
4112
4113 /*
4114 * Currently, we shouldn't actually get here for the
4115 * subcommand types that don't require transformation; but if
4116 * we do, just emit them unchanged.
4117 */
4118 newcmds = lappend(newcmds, cmd);
4119 break;
4120 }
4121 }
4122
4123 /*
4124 * Transfer anything we already have in cxt.alist into save_alist, to keep
4125 * it separate from the output of transformIndexConstraints.
4126 */
4127 save_alist = cxt.alist;
4128 cxt.alist = NIL;
4129
4130 /* Postprocess constraints */
4133 transformCheckConstraints(&cxt, false);
4134
4135 /*
4136 * Push any index-creation commands into the ALTER, so that they can be
4137 * scheduled nicely by tablecmds.c. Note that tablecmds.c assumes that
4138 * the IndexStmt attached to an AT_AddIndex or AT_AddIndexConstraint
4139 * subcommand has already been through transformIndexStmt.
4140 */
4141 foreach(l, cxt.alist)
4142 {
4143 Node *istmt = (Node *) lfirst(l);
4144
4145 /*
4146 * We assume here that cxt.alist contains only IndexStmts generated
4147 * from primary key constraints.
4148 */
4149 if (IsA(istmt, IndexStmt))
4150 {
4151 IndexStmt *idxstmt = (IndexStmt *) istmt;
4152
4153 idxstmt = transformIndexStmt(relid, idxstmt, queryString);
4155 newcmd->subtype = OidIsValid(idxstmt->indexOid) ? AT_AddIndexConstraint : AT_AddIndex;
4156 newcmd->def = (Node *) idxstmt;
4158 }
4159 else
4160 elog(ERROR, "unexpected stmt type %d", (int) nodeTag(istmt));
4161 }
4162 cxt.alist = NIL;
4163
4164 /* Append any CHECK, NOT NULL or FK constraints to the commands list */
4166 {
4168 newcmd->subtype = AT_AddConstraint;
4169 newcmd->def = (Node *) def;
4171 }
4173 {
4175 newcmd->subtype = AT_AddConstraint;
4176 newcmd->def = (Node *) def;
4178 }
4180 {
4182 newcmd->subtype = AT_AddConstraint;
4183 newcmd->def = (Node *) def;
4185 }
4186
4187 /* Close rel */
4188 relation_close(rel, NoLock);
4189
4190 /*
4191 * Output results.
4192 */
4193 stmt->cmds = newcmds;
4194
4195 *beforeStmts = cxt.blist;
4196 *afterStmts = list_concat(cxt.alist, save_alist);
4197
4198 return stmt;
4199}
#define InvalidAttrNumber
Definition attnum.h:23
List * list_concat(List *list1, const List *list2)
Definition list.c:561
char * get_rel_name(Oid relid)
Definition lsyscache.c:2159
AttrNumber get_attnum(Oid relid, const char *attname)
Definition lsyscache.c:1015
Oid get_rel_namespace(Oid relid)
Definition lsyscache.c:2183
DefElem * makeDefElem(char *name, Node *arg, int location)
Definition makefuncs.c:637
RangeVar * makeRangeVar(char *schemaname, char *relname, int location)
Definition makefuncs.c:473
TypeName * makeTypeNameFromOid(Oid typeOid, int32 typmod)
Definition makefuncs.c:547
#define IsA(nodeptr, _type_)
Definition nodes.h:164
#define nodeTag(nodeptr)
Definition nodes.h:139
#define castNode(_type_, nodeptr)
Definition nodes.h:182
Node * transformExpr(ParseState *pstate, Node *expr, ParseExprKind exprKind)
Definition parse_expr.c:121
ParseState * make_parsestate(ParseState *parentParseState)
Definition parse_node.c:39
@ EXPR_KIND_ALTER_COL_TRANSFORM
Definition parse_node.h:76
void addNSItemToQuery(ParseState *pstate, ParseNamespaceItem *nsitem, bool addToJoinList, bool addToRelNameSpace, bool addToVarNameSpace)
ParseNamespaceItem * addRangeTableEntryForRelation(ParseState *pstate, Relation rel, LOCKMODE lockmode, Alias *alias, bool inh, bool inFromCl)
Oid typenameTypeId(ParseState *pstate, const TypeName *typeName)
Definition parse_type.c:291
static void generateSerialExtraStmts(CreateStmtContext *cxt, ColumnDef *column, Oid seqtypid, List *seqoptions, bool for_identity, bool col_exists, char **snamespace_p, char **sname_p)
IndexStmt * transformIndexStmt(Oid relid, IndexStmt *stmt, const char *queryString)
static void transformColumnDefinition(CreateStmtContext *cxt, ColumnDef *column)
static void transformIndexConstraints(CreateStmtContext *cxt)
static void transformPartitionCmdForSplit(CreateStmtContext *cxt, PartitionCmd *partcmd)
static void transformTableConstraint(CreateStmtContext *cxt, Constraint *constraint)
static void transformPartitionCmdForMerge(CreateStmtContext *cxt, PartitionCmd *partcmd)
static void transformPartitionCmd(CreateStmtContext *cxt, PartitionBoundSpec *bound)
static void transformCheckConstraints(CreateStmtContext *cxt, bool skipValidation)
static void transformFKConstraints(CreateStmtContext *cxt, bool skipValidation, bool isAddConstraint)
@ CONSTR_FOREIGN
@ AT_AddIndexConstraint
@ AT_MergePartitions
@ AT_SetIdentity
@ AT_AddIndex
@ AT_AddIdentity
@ AT_AlterColumnType
@ AT_DetachPartition
@ AT_AttachPartition
@ AT_SplitPartition
@ AT_AddColumn
Oid getIdentitySequence(Relation rel, AttrNumber attnum, bool missing_ok)
Definition pg_depend.c:1018
#define lfirst_node(type, lc)
Definition pg_list.h:176
static int list_length(const List *l)
Definition pg_list.h:152
#define list_make1(x1)
Definition pg_list.h:244
#define foreach_node(type, var, lst)
Definition pg_list.h:528
#define RelationGetForm(relation)
Definition rel.h:510
void relation_close(Relation relation, LOCKMODE lockmode)
Definition relation.c:206
AlterTableType subtype
List * constraints
Definition parsenodes.h:787
Node * cooked_default
Definition parsenodes.h:780
TypeName * typeName
Definition parsenodes.h:771
Node * raw_default
Definition parsenodes.h:779
List * options
char generated_when
const char * stmtType
RangeVar * relation
ParseState * pstate
PartitionBoundSpec * partbound
char * defname
Definition parsenodes.h:860
const char * p_sourcetext
Definition parse_node.h:214

References AccessShareLock, addNSItemToQuery(), addRangeTableEntryForRelation(), CreateStmtContext::alist, AT_AddColumn, AT_AddConstraint, AT_AddIdentity, AT_AddIndex, AT_AddIndexConstraint, AT_AlterColumnType, AT_AttachPartition, AT_DetachPartition, AT_MergePartitions, AT_SetIdentity, AT_SplitPartition, attnum, CreateStmtContext::blist, castNode, CreateStmtContext::ckconstraints, CreateStmtContext::columns, CONSTR_FOREIGN, ColumnDef::constraints, ColumnDef::cooked_default, AlterTableCmd::def, DefElem::defname, elog, ereport, errcode(), errmsg, ERROR, EXPR_KIND_ALTER_COL_TRANSFORM, fb(), CreateStmtContext::fkconstraints, foreach_node, Constraint::generated_when, generateSerialExtraStmts(), get_attnum(), get_atttype(), get_namespace_name(), get_rel_name(), get_rel_namespace(), getIdentitySequence(), CreateStmtContext::inhRelations, InvalidAttrNumber, IsA, CreateStmtContext::isalter, CreateStmtContext::isforeign, CreateStmtContext::ispartitioned, CreateStmtContext::ixconstraints, lappend(), lfirst, lfirst_node, CreateStmtContext::likeclauses, list_concat(), list_length(), list_make1, make_parsestate(), makeDefElem(), makeNode, makeRangeVar(), makeTypeNameFromOid(), AlterTableCmd::name, NIL, CreateStmtContext::nnconstraints, nodeTag, NoLock, CreateStmtContext::ofType, OidIsValid, Constraint::options, ParseState::p_sourcetext, CreateStmtContext::partbound, CreateStmtContext::pkey, CreateStmtContext::pstate, ColumnDef::raw_default, RelationData::rd_rel, CreateStmtContext::rel, CreateStmtContext::relation, relation_close(), relation_open(), RelationGetDescr, RelationGetForm, RelationGetRelationName, stmt, CreateStmtContext::stmtType, AlterTableCmd::subtype, transformCheckConstraints(), transformColumnDefinition(), transformExpr(), transformFKConstraints(), transformIndexConstraints(), transformIndexStmt(), transformPartitionCmd(), transformPartitionCmdForMerge(), transformPartitionCmdForSplit(), transformTableConstraint(), TupleDescAttr(), ColumnDef::typeName, and typenameTypeId().

Referenced by ATParseTransformCmd(), and ATPostAlterTypeParse().

◆ transformCreateSchemaStmtElements()

List * transformCreateSchemaStmtElements ( ParseState pstate,
List schemaElts,
const char schemaName 
)
extern

Definition at line 4428 of file parse_utilcmd.c.

4430{
4431 List *elements = NIL;
4432 List *fk_elements = NIL;
4433 ListCell *lc;
4434
4435 /*
4436 * Run through each schema element in the schema element list. Check
4437 * target schema names, and collect the list of actions to be done.
4438 */
4439 foreach(lc, schemaElts)
4440 {
4441 Node *element = lfirst(lc);
4442
4443 switch (nodeTag(element))
4444 {
4445 case T_CreateSeqStmt:
4446 {
4448
4449 checkSchemaNameRV(pstate, schemaName, elp->sequence);
4450 elements = lappend(elements, element);
4451 }
4452 break;
4453
4454 case T_CreateStmt:
4455 {
4457
4458 checkSchemaNameRV(pstate, schemaName, elp->relation);
4459 /* Pull out any foreign key clauses, add to fk_elements */
4461 elp,
4462 &fk_elements);
4463 elements = lappend(elements, elp);
4464 }
4465 break;
4466
4467 case T_ViewStmt:
4468 {
4470
4471 checkSchemaNameRV(pstate, schemaName, elp->view);
4472 elements = lappend(elements, element);
4473 }
4474 break;
4475
4476 case T_IndexStmt:
4477 {
4479
4480 checkSchemaNameRV(pstate, schemaName, elp->relation);
4481 elements = lappend(elements, element);
4482 }
4483 break;
4484
4485 case T_CreateTrigStmt:
4486 {
4488
4489 checkSchemaNameRV(pstate, schemaName, elp->relation);
4490 elements = lappend(elements, element);
4491 }
4492 break;
4493
4494 case T_CreateDomainStmt:
4495 {
4497
4498 checkSchemaNameList(schemaName, elp->domainname);
4499 elements = lappend(elements, element);
4500 }
4501 break;
4502
4504 {
4506
4508 elements = lappend(elements, element);
4509 }
4510 break;
4511
4512 /*
4513 * CREATE TYPE can produce a DefineStmt, but also
4514 * CreateEnumStmt, CreateRangeStmt, and CompositeTypeStmt.
4515 * Allowing DefineStmt also provides support for several other
4516 * commands: currently, CREATE AGGREGATE, CREATE COLLATION,
4517 * CREATE OPERATOR, and text search objects.
4518 */
4519
4520 case T_DefineStmt:
4521 {
4523
4525 elements = lappend(elements, element);
4526 }
4527 break;
4528
4529 case T_CreateEnumStmt:
4530 {
4532
4534 elements = lappend(elements, element);
4535 }
4536 break;
4537
4538 case T_CreateRangeStmt:
4539 {
4541
4543 elements = lappend(elements, element);
4544 }
4545 break;
4546
4548 {
4550
4551 checkSchemaNameRV(pstate, schemaName, elp->typevar);
4552 elements = lappend(elements, element);
4553 }
4554 break;
4555
4556 case T_GrantStmt:
4557 elements = lappend(elements, element);
4558 break;
4559
4560 default:
4561 elog(ERROR, "unrecognized node type: %d",
4562 (int) nodeTag(element));
4563 }
4564 }
4565
4566 return list_concat(elements, fk_elements);
4567}
static CreateStmt * transformCreateSchemaCreateTable(ParseState *pstate, CreateStmt *stmt, List **fk_elements)
static void checkSchemaNameRV(ParseState *pstate, const char *context_schema, RangeVar *relation)
static void checkSchemaNameList(const char *context_schema, List *qualified_name)
static chr element(struct vars *v, const chr *startp, const chr *endp)

References checkSchemaNameList(), checkSchemaNameRV(), element(), elog, ERROR, fb(), lappend(), lfirst, list_concat(), NIL, nodeTag, and transformCreateSchemaCreateTable().

Referenced by CreateSchemaCommand().

◆ transformCreateStmt()

List * transformCreateStmt ( CreateStmt stmt,
const char queryString 
)
extern

Definition at line 162 of file parse_utilcmd.c.

163{
164 ParseState *pstate;
166 List *result;
168 ListCell *elements;
172
173 /* Set up pstate */
174 pstate = make_parsestate(NULL);
175 pstate->p_sourcetext = queryString;
176
177 /*
178 * Look up the creation namespace. This also checks permissions on the
179 * target namespace, locks it against concurrent drops, checks for a
180 * preexisting relation in that namespace with the same name, and updates
181 * stmt->relation->relpersistence if the selected namespace is temporary.
182 */
184 stmt->relation->location);
189
190 /*
191 * If the relation already exists and the user specified "IF NOT EXISTS",
192 * bail out with a NOTICE.
193 */
194 if (stmt->if_not_exists && OidIsValid(existing_relid))
195 {
196 /*
197 * If we are in an extension script, insist that the pre-existing
198 * object be a member of the extension, to avoid security risks.
199 */
200 ObjectAddress address;
201
204
205 /* OK to skip */
208 errmsg("relation \"%s\" already exists, skipping",
209 stmt->relation->relname)));
210 return NIL;
211 }
212
213 /*
214 * If the target relation name isn't schema-qualified, make it so. This
215 * prevents some corner cases in which added-on rewritten commands might
216 * think they should apply to other relations that have the same name and
217 * are earlier in the search path. But a local temp table is effectively
218 * specified to be in pg_temp, so no need for anything extra in that case.
219 */
220 if (stmt->relation->schemaname == NULL
221 && stmt->relation->relpersistence != RELPERSISTENCE_TEMP)
222 stmt->relation->schemaname = get_namespace_name(namespaceid);
223
224 /* Set up CreateStmtContext */
225 cxt.pstate = pstate;
227 {
228 cxt.stmtType = "CREATE FOREIGN TABLE";
229 cxt.isforeign = true;
230 }
231 else
232 {
233 cxt.stmtType = "CREATE TABLE";
234 cxt.isforeign = false;
235 }
236 cxt.relation = stmt->relation;
237 cxt.rel = NULL;
238 cxt.inhRelations = stmt->inhRelations;
239 cxt.isalter = false;
240 cxt.columns = NIL;
241 cxt.ckconstraints = NIL;
242 cxt.nnconstraints = NIL;
243 cxt.fkconstraints = NIL;
244 cxt.ixconstraints = NIL;
245 cxt.likeclauses = NIL;
246 cxt.blist = NIL;
247 cxt.alist = NIL;
248 cxt.pkey = NULL;
249 cxt.ispartitioned = stmt->partspec != NULL;
250 cxt.partbound = stmt->partbound;
251 cxt.ofType = (stmt->ofTypename != NULL);
252
253 Assert(!stmt->ofTypename || !stmt->inhRelations); /* grammar enforces */
254
255 if (stmt->ofTypename)
256 transformOfType(&cxt, stmt->ofTypename);
257
258 if (stmt->partspec)
259 {
260 if (stmt->inhRelations && !stmt->partbound)
263 errmsg("cannot create partitioned table as inheritance child")));
264 }
265
266 /*
267 * Run through each primary element in the table creation clause. Separate
268 * column defs from constraints, and do preliminary analysis.
269 */
270 foreach(elements, stmt->tableElts)
271 {
272 Node *element = lfirst(elements);
273
274 switch (nodeTag(element))
275 {
276 case T_ColumnDef:
278 break;
279
280 case T_Constraint:
282 break;
283
286 break;
287
288 default:
289 elog(ERROR, "unrecognized node type: %d",
290 (int) nodeTag(element));
291 break;
292 }
293 }
294
295 /*
296 * Transfer anything we already have in cxt.alist into save_alist, to keep
297 * it separate from the output of transformIndexConstraints. (This may
298 * not be necessary anymore, but we'll keep doing it to preserve the
299 * historical order of execution of the alist commands.)
300 */
301 save_alist = cxt.alist;
302 cxt.alist = NIL;
303
304 Assert(stmt->constraints == NIL);
305
306 /*
307 * Before processing index constraints, which could include a primary key,
308 * we must scan all not-null constraints to propagate the is_not_null flag
309 * to each corresponding ColumnDef. This is necessary because table-level
310 * not-null constraints have not been marked in each ColumnDef, and the PK
311 * processing code needs to know whether one constraint has already been
312 * declared in order not to declare a redundant one.
313 */
315 {
316 char *colname = strVal(linitial(nn->keys));
317
319 {
320 /* not our column? */
321 if (strcmp(cd->colname, colname) != 0)
322 continue;
323 /* Already marked not-null? Nothing to do */
324 if (cd->is_not_null)
325 break;
326 /* Bingo, we're done for this constraint */
327 cd->is_not_null = true;
328 break;
329 }
330 }
331
332 /*
333 * Postprocess constraints that give rise to index definitions.
334 */
336
337 /*
338 * Re-consideration of LIKE clauses should happen after creation of
339 * indexes, but before creation of foreign keys. This order is critical
340 * because a LIKE clause may attempt to create a primary key. If there's
341 * also a pkey in the main CREATE TABLE list, creation of that will not
342 * check for a duplicate at runtime (since index_check_primary_key()
343 * expects that we rejected dups here). Creation of the LIKE-generated
344 * pkey behaves like ALTER TABLE ADD, so it will check, but obviously that
345 * only works if it happens second. On the other hand, we want to make
346 * pkeys before foreign key constraints, in case the user tries to make a
347 * self-referential FK.
348 */
349 cxt.alist = list_concat(cxt.alist, cxt.likeclauses);
350
351 /*
352 * Postprocess foreign-key constraints.
353 */
354 transformFKConstraints(&cxt, true, false);
355
356 /*
357 * Postprocess check constraints.
358 *
359 * For regular tables all constraints can be marked valid immediately,
360 * because the table is new therefore empty. Not so for foreign tables.
361 */
363
364 /*
365 * Output results.
366 */
367 stmt->tableElts = cxt.columns;
368 stmt->constraints = cxt.ckconstraints;
369 stmt->nnconstraints = cxt.nnconstraints;
370
371 result = lappend(cxt.blist, stmt);
374
375 return result;
376}
#define NOTICE
Definition elog.h:36
Oid RangeVarGetAndCheckCreationNamespace(RangeVar *relation, LOCKMODE lockmode, Oid *existing_relation_id)
Definition namespace.c:740
#define ObjectAddressSet(addr, class_id, object_id)
void cancel_parser_errposition_callback(ParseCallbackState *pcbstate)
Definition parse_node.c:156
void setup_parser_errposition_callback(ParseCallbackState *pcbstate, ParseState *pstate, int location)
Definition parse_node.c:140
static void transformTableLikeClause(CreateStmtContext *cxt, TableLikeClause *table_like_clause)
static void transformOfType(CreateStmtContext *cxt, TypeName *ofTypename)
void checkMembershipInCurrentExtension(const ObjectAddress *object)
Definition pg_depend.c:260
#define linitial(l)
Definition pg_list.h:178
#define strVal(v)
Definition value.h:82

References CreateStmtContext::alist, Assert, CreateStmtContext::blist, cancel_parser_errposition_callback(), checkMembershipInCurrentExtension(), CreateStmtContext::ckconstraints, CreateStmtContext::columns, element(), elog, ereport, errcode(), errmsg, ERROR, fb(), CreateStmtContext::fkconstraints, foreach_node, get_namespace_name(), CreateStmtContext::inhRelations, IsA, CreateStmtContext::isalter, CreateStmtContext::isforeign, CreateStmtContext::ispartitioned, CreateStmtContext::ixconstraints, lappend(), lfirst, CreateStmtContext::likeclauses, linitial, list_concat(), make_parsestate(), NIL, CreateStmtContext::nnconstraints, nodeTag, NoLock, NOTICE, ObjectAddressSet, CreateStmtContext::ofType, OidIsValid, ParseState::p_sourcetext, CreateStmtContext::partbound, CreateStmtContext::pkey, CreateStmtContext::pstate, RangeVarGetAndCheckCreationNamespace(), CreateStmtContext::rel, CreateStmtContext::relation, result, setup_parser_errposition_callback(), stmt, CreateStmtContext::stmtType, strVal, transformCheckConstraints(), transformColumnDefinition(), transformFKConstraints(), transformIndexConstraints(), transformOfType(), transformTableConstraint(), and transformTableLikeClause().

Referenced by ProcessUtilitySlow().

◆ transformIndexStmt()

IndexStmt * transformIndexStmt ( Oid  relid,
IndexStmt stmt,
const char queryString 
)
extern

Definition at line 3062 of file parse_utilcmd.c.

3063{
3064 ParseState *pstate;
3066 ListCell *l;
3067 Relation rel;
3068
3069 /* Nothing to do if statement already transformed. */
3070 if (stmt->transformed)
3071 return stmt;
3072
3073 /* Set up pstate */
3074 pstate = make_parsestate(NULL);
3075 pstate->p_sourcetext = queryString;
3076
3077 /*
3078 * Put the parent table into the rtable so that the expressions can refer
3079 * to its fields without qualification. Caller is responsible for locking
3080 * relation, but we still need to open it.
3081 */
3082 rel = relation_open(relid, NoLock);
3085 NULL, false, true);
3086
3087 /* no to join list, yes to namespaces */
3088 addNSItemToQuery(pstate, nsitem, false, true, true);
3089
3090 /* take care of the where clause */
3091 if (stmt->whereClause)
3092 {
3093 stmt->whereClause = transformWhereClause(pstate,
3094 stmt->whereClause,
3096 "WHERE");
3097 /* we have to fix its collations too */
3098 assign_expr_collations(pstate, stmt->whereClause);
3099 }
3100
3101 /* take care of any index expressions */
3102 foreach(l, stmt->indexParams)
3103 {
3104 IndexElem *ielem = (IndexElem *) lfirst(l);
3105
3106 if (ielem->expr)
3107 {
3108 /* Extract preliminary index col name before transforming expr */
3109 if (ielem->indexcolname == NULL)
3111
3112 /* Now do parse transformation of the expression */
3113 ielem->expr = transformExpr(pstate, ielem->expr,
3115
3116 /* We have to fix its collations too */
3117 assign_expr_collations(pstate, ielem->expr);
3118
3119 /*
3120 * transformExpr() should have already rejected subqueries,
3121 * aggregates, window functions, and SRFs, based on the EXPR_KIND_
3122 * for an index expression.
3123 *
3124 * DefineIndex() will make more checks.
3125 */
3126 }
3127 }
3128
3129 /*
3130 * Check that only the base rel is mentioned. (This should be dead code
3131 * now that add_missing_from is history.)
3132 */
3133 if (list_length(pstate->p_rtable) != 1)
3134 ereport(ERROR,
3136 errmsg("index expressions and predicates can refer only to the table being indexed")));
3137
3138 free_parsestate(pstate);
3139
3140 /* Close relation */
3141 table_close(rel, NoLock);
3142
3143 /* Mark statement as successfully transformed */
3144 stmt->transformed = true;
3145
3146 return stmt;
3147}
Node * transformWhereClause(ParseState *pstate, Node *clause, ParseExprKind exprKind, const char *constructName)
void assign_expr_collations(ParseState *pstate, Node *expr)
void free_parsestate(ParseState *pstate)
Definition parse_node.c:72
@ EXPR_KIND_INDEX_EXPRESSION
Definition parse_node.h:73
@ EXPR_KIND_INDEX_PREDICATE
Definition parse_node.h:74
char * FigureIndexColname(Node *node)
char * indexcolname
Definition parsenodes.h:829
List * p_rtable
Definition parse_node.h:215

References AccessShareLock, addNSItemToQuery(), addRangeTableEntryForRelation(), assign_expr_collations(), ereport, errcode(), errmsg, ERROR, EXPR_KIND_INDEX_EXPRESSION, EXPR_KIND_INDEX_PREDICATE, fb(), FigureIndexColname(), free_parsestate(), IndexElem::indexcolname, lfirst, list_length(), make_parsestate(), NoLock, ParseState::p_rtable, ParseState::p_sourcetext, relation_open(), stmt, table_close(), transformExpr(), and transformWhereClause().

Referenced by ATPostAlterTypeParse(), ProcessUtilitySlow(), and transformAlterTableStmt().

◆ transformPartitionBound()

PartitionBoundSpec * transformPartitionBound ( ParseState pstate,
Relation  parent,
PartitionBoundSpec spec 
)
extern

Definition at line 4843 of file parse_utilcmd.c.

4845{
4848 char strategy = get_partition_strategy(key);
4849 int partnatts = get_partition_natts(key);
4850 List *partexprs = get_partition_exprs(key);
4851
4852 /* Avoid scribbling on input */
4854
4855 if (spec->is_default)
4856 {
4857 /*
4858 * Hash partitioning does not support a default partition; there's no
4859 * use case for it (since the set of partitions to create is perfectly
4860 * defined), and if users do get into it accidentally, it's hard to
4861 * back out from it afterwards.
4862 */
4863 if (strategy == PARTITION_STRATEGY_HASH)
4864 ereport(ERROR,
4866 errmsg("a hash-partitioned table may not have a default partition")));
4867
4868 /*
4869 * In case of the default partition, parser had no way to identify the
4870 * partition strategy. Assign the parent's strategy to the default
4871 * partition bound spec.
4872 */
4873 result_spec->strategy = strategy;
4874
4875 return result_spec;
4876 }
4877
4878 if (strategy == PARTITION_STRATEGY_HASH)
4879 {
4880 if (spec->strategy != PARTITION_STRATEGY_HASH)
4881 ereport(ERROR,
4883 errmsg("invalid bound specification for a hash partition"),
4884 parser_errposition(pstate, exprLocation((Node *) spec))));
4885
4886 if (spec->modulus <= 0)
4887 ereport(ERROR,
4889 errmsg("modulus for hash partition must be an integer value greater than zero")));
4890
4891 Assert(spec->remainder >= 0);
4892
4893 if (spec->remainder >= spec->modulus)
4894 ereport(ERROR,
4896 errmsg("remainder for hash partition must be less than modulus")));
4897 }
4898 else if (strategy == PARTITION_STRATEGY_LIST)
4899 {
4900 ListCell *cell;
4901 char *colname;
4902 Oid coltype;
4904 Oid partcollation;
4905
4906 if (spec->strategy != PARTITION_STRATEGY_LIST)
4907 ereport(ERROR,
4909 errmsg("invalid bound specification for a list partition"),
4910 parser_errposition(pstate, exprLocation((Node *) spec))));
4911
4912 /* Get the only column's name in case we need to output an error */
4913 if (key->partattrs[0] != 0)
4914 colname = get_attname(RelationGetRelid(parent),
4915 key->partattrs[0], false);
4916 else
4917 colname = deparse_expression((Node *) linitial(partexprs),
4919 RelationGetRelid(parent)),
4920 false, false);
4921 /* Need its type data too */
4922 coltype = get_partition_col_typid(key, 0);
4924 partcollation = get_partition_col_collation(key, 0);
4925
4926 result_spec->listdatums = NIL;
4927 foreach(cell, spec->listdatums)
4928 {
4929 Node *expr = lfirst(cell);
4930 Const *value;
4931 ListCell *cell2;
4932 bool duplicate;
4933
4934 value = transformPartitionBoundValue(pstate, expr,
4935 colname, coltype, coltypmod,
4936 partcollation);
4937
4938 /* Don't add to the result if the value is a duplicate */
4939 duplicate = false;
4940 foreach(cell2, result_spec->listdatums)
4941 {
4943
4944 if (equal(value, value2))
4945 {
4946 duplicate = true;
4947 break;
4948 }
4949 }
4950 if (duplicate)
4951 continue;
4952
4953 result_spec->listdatums = lappend(result_spec->listdatums,
4954 value);
4955 }
4956 }
4957 else if (strategy == PARTITION_STRATEGY_RANGE)
4958 {
4959 if (spec->strategy != PARTITION_STRATEGY_RANGE)
4960 ereport(ERROR,
4962 errmsg("invalid bound specification for a range partition"),
4963 parser_errposition(pstate, exprLocation((Node *) spec))));
4964
4965 if (list_length(spec->lowerdatums) != partnatts)
4966 ereport(ERROR,
4968 errmsg("FROM must specify exactly one value per partitioning column")));
4969 if (list_length(spec->upperdatums) != partnatts)
4970 ereport(ERROR,
4972 errmsg("TO must specify exactly one value per partitioning column")));
4973
4974 /*
4975 * Convert raw parse nodes into PartitionRangeDatum nodes and perform
4976 * any necessary validation.
4977 */
4978 result_spec->lowerdatums =
4979 transformPartitionRangeBounds(pstate, spec->lowerdatums,
4980 parent);
4981 result_spec->upperdatums =
4982 transformPartitionRangeBounds(pstate, spec->upperdatums,
4983 parent);
4984 }
4985 else
4986 elog(ERROR, "unexpected partition strategy: %d", (int) strategy);
4987
4988 return result_spec;
4989}
int32_t int32
Definition c.h:620
bool equal(const void *a, const void *b)
Definition equalfuncs.c:223
static struct @177 value
int exprLocation(const Node *expr)
Definition nodeFuncs.c:1403
int parser_errposition(ParseState *pstate, int location)
Definition parse_node.c:106
static List * transformPartitionRangeBounds(ParseState *pstate, List *blist, Relation parent)
static Const * transformPartitionBoundValue(ParseState *pstate, Node *val, const char *colName, Oid colType, int32 colTypmod, Oid partCollation)
@ PARTITION_STRATEGY_HASH
Definition parsenodes.h:919
@ PARTITION_STRATEGY_LIST
Definition parsenodes.h:917
@ PARTITION_STRATEGY_RANGE
Definition parsenodes.h:918
PartitionKey RelationGetPartitionKey(Relation rel)
Definition partcache.c:51
static int get_partition_strategy(PartitionKey key)
Definition partcache.h:59
static int32 get_partition_col_typmod(PartitionKey key, int col)
Definition partcache.h:92
static int get_partition_natts(PartitionKey key)
Definition partcache.h:65
static Oid get_partition_col_typid(PartitionKey key, int col)
Definition partcache.h:86
static List * get_partition_exprs(PartitionKey key)
Definition partcache.h:71
static Oid get_partition_col_collation(PartitionKey key, int col)
Definition partcache.h:98
List * deparse_context_for(const char *aliasname, Oid relid)
Definition ruleutils.c:4070
char * deparse_expression(Node *expr, List *dpcontext, bool forceprefix, bool showimplicit)
Definition ruleutils.c:4007

References Assert, copyObject, deparse_context_for(), deparse_expression(), elog, equal(), ereport, errcode(), errmsg, ERROR, exprLocation(), fb(), get_attname(), get_partition_col_collation(), get_partition_col_typid(), get_partition_col_typmod(), get_partition_exprs(), get_partition_natts(), get_partition_strategy(), lappend(), lfirst, lfirst_node, linitial, list_length(), NIL, parser_errposition(), PARTITION_STRATEGY_HASH, PARTITION_STRATEGY_LIST, PARTITION_STRATEGY_RANGE, RelationGetPartitionKey(), RelationGetRelationName, RelationGetRelid, transformPartitionBoundValue(), transformPartitionRangeBounds(), and value.

Referenced by DefineRelation(), and transformPartitionCmd().

◆ transformRuleStmt()

void transformRuleStmt ( RuleStmt stmt,
const char queryString,
List **  actions,
Node **  whereClause 
)
extern

Definition at line 3232 of file parse_utilcmd.c.

3234{
3235 Relation rel;
3236 ParseState *pstate;
3239
3240 /*
3241 * To avoid deadlock, make sure the first thing we do is grab
3242 * AccessExclusiveLock on the target relation. This will be needed by
3243 * DefineQueryRewrite(), and we don't want to grab a lesser lock
3244 * beforehand.
3245 */
3246 rel = table_openrv(stmt->relation, AccessExclusiveLock);
3247
3248 if (rel->rd_rel->relkind == RELKIND_MATVIEW)
3249 ereport(ERROR,
3251 errmsg("rules on materialized views are not supported")));
3252
3253 /* Set up pstate */
3254 pstate = make_parsestate(NULL);
3255 pstate->p_sourcetext = queryString;
3256
3257 /*
3258 * NOTE: 'OLD' must always have a varno equal to 1 and 'NEW' equal to 2.
3259 * Set up their ParseNamespaceItems in the main pstate for use in parsing
3260 * the rule qualification.
3261 */
3264 makeAlias("old", NIL),
3265 false, false);
3268 makeAlias("new", NIL),
3269 false, false);
3270
3271 /*
3272 * They must be in the namespace too for lookup purposes, but only add the
3273 * one(s) that are relevant for the current kind of rule. In an UPDATE
3274 * rule, quals must refer to OLD.field or NEW.field to be unambiguous, but
3275 * there's no need to be so picky for INSERT & DELETE. We do not add them
3276 * to the joinlist.
3277 */
3278 switch (stmt->event)
3279 {
3280 case CMD_SELECT:
3281 addNSItemToQuery(pstate, oldnsitem, false, true, true);
3282 break;
3283 case CMD_UPDATE:
3284 addNSItemToQuery(pstate, oldnsitem, false, true, true);
3285 addNSItemToQuery(pstate, newnsitem, false, true, true);
3286 break;
3287 case CMD_INSERT:
3288 addNSItemToQuery(pstate, newnsitem, false, true, true);
3289 break;
3290 case CMD_DELETE:
3291 addNSItemToQuery(pstate, oldnsitem, false, true, true);
3292 break;
3293 default:
3294 elog(ERROR, "unrecognized event type: %d",
3295 (int) stmt->event);
3296 break;
3297 }
3298
3299 /* take care of the where clause */
3300 *whereClause = transformWhereClause(pstate,
3301 stmt->whereClause,
3303 "WHERE");
3304 /* we have to fix its collations too */
3305 assign_expr_collations(pstate, *whereClause);
3306
3307 /* this is probably dead code without add_missing_from: */
3308 if (list_length(pstate->p_rtable) != 2) /* naughty, naughty... */
3309 ereport(ERROR,
3311 errmsg("rule WHERE condition cannot contain references to other relations")));
3312
3313 /*
3314 * 'instead nothing' rules with a qualification need a query rangetable so
3315 * the rewrite handler can add the negated rule qualification to the
3316 * original query. We create a query with the new command type CMD_NOTHING
3317 * here that is treated specially by the rewrite system.
3318 */
3319 if (stmt->actions == NIL)
3320 {
3322
3323 nothing_qry->commandType = CMD_NOTHING;
3324 nothing_qry->rtable = pstate->p_rtable;
3325 nothing_qry->rteperminfos = pstate->p_rteperminfos;
3326 nothing_qry->jointree = makeFromExpr(NIL, NULL); /* no join wanted */
3327
3328 *actions = list_make1(nothing_qry);
3329 }
3330 else
3331 {
3332 ListCell *l;
3333 List *newactions = NIL;
3334
3335 /*
3336 * transform each statement, like parse_sub_analyze()
3337 */
3338 foreach(l, stmt->actions)
3339 {
3340 Node *action = (Node *) lfirst(l);
3342 Query *sub_qry,
3343 *top_subqry;
3344 bool has_old,
3345 has_new;
3346
3347 /*
3348 * Since outer ParseState isn't parent of inner, have to pass down
3349 * the query text by hand.
3350 */
3351 sub_pstate->p_sourcetext = queryString;
3352
3353 /*
3354 * Set up OLD/NEW in the rtable for this statement. The entries
3355 * are added only to relnamespace, not varnamespace, because we
3356 * don't want them to be referred to by unqualified field names
3357 * nor "*" in the rule actions. We decide later whether to put
3358 * them in the joinlist.
3359 */
3362 makeAlias("old", NIL),
3363 false, false);
3366 makeAlias("new", NIL),
3367 false, false);
3368 addNSItemToQuery(sub_pstate, oldnsitem, false, true, false);
3369 addNSItemToQuery(sub_pstate, newnsitem, false, true, false);
3370
3371 /* Transform the rule action statement */
3373
3374 /*
3375 * We cannot support utility-statement actions (eg NOTIFY) with
3376 * nonempty rule WHERE conditions, because there's no way to make
3377 * the utility action execute conditionally.
3378 */
3379 if (top_subqry->commandType == CMD_UTILITY &&
3380 *whereClause != NULL)
3381 ereport(ERROR,
3383 errmsg("rules with WHERE conditions can only have SELECT, INSERT, UPDATE, or DELETE actions")));
3384
3385 /*
3386 * If the action is INSERT...SELECT, OLD/NEW have been pushed down
3387 * into the SELECT, and that's what we need to look at. (Ugly
3388 * kluge ... try to fix this when we redesign querytrees.)
3389 */
3391
3392 /*
3393 * If the sub_qry is a setop, we cannot attach any qualifications
3394 * to it, because the planner won't notice them. This could
3395 * perhaps be relaxed someday, but for now, we may as well reject
3396 * such a rule immediately.
3397 */
3398 if (sub_qry->setOperations != NULL && *whereClause != NULL)
3399 ereport(ERROR,
3401 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
3402
3403 /*
3404 * Validate action's use of OLD/NEW, qual too
3405 */
3406 has_old =
3408 rangeTableEntry_used(*whereClause, PRS2_OLD_VARNO, 0);
3409 has_new =
3411 rangeTableEntry_used(*whereClause, PRS2_NEW_VARNO, 0);
3412
3413 switch (stmt->event)
3414 {
3415 case CMD_SELECT:
3416 if (has_old)
3417 ereport(ERROR,
3419 errmsg("ON SELECT rule cannot use OLD")));
3420 if (has_new)
3421 ereport(ERROR,
3423 errmsg("ON SELECT rule cannot use NEW")));
3424 break;
3425 case CMD_UPDATE:
3426 /* both are OK */
3427 break;
3428 case CMD_INSERT:
3429 if (has_old)
3430 ereport(ERROR,
3432 errmsg("ON INSERT rule cannot use OLD")));
3433 break;
3434 case CMD_DELETE:
3435 if (has_new)
3436 ereport(ERROR,
3438 errmsg("ON DELETE rule cannot use NEW")));
3439 break;
3440 default:
3441 elog(ERROR, "unrecognized event type: %d",
3442 (int) stmt->event);
3443 break;
3444 }
3445
3446 /*
3447 * OLD/NEW are not allowed in WITH queries, because they would
3448 * amount to outer references for the WITH, which we disallow.
3449 * However, they were already in the outer rangetable when we
3450 * analyzed the query, so we have to check.
3451 *
3452 * Note that in the INSERT...SELECT case, we need to examine the
3453 * CTE lists of both top_subqry and sub_qry.
3454 *
3455 * Note that we aren't digging into the body of the query looking
3456 * for WITHs in nested sub-SELECTs. A WITH down there can
3457 * legitimately refer to OLD/NEW, because it'd be an
3458 * indirect-correlated outer reference.
3459 */
3460 if (rangeTableEntry_used((Node *) top_subqry->cteList,
3461 PRS2_OLD_VARNO, 0) ||
3462 rangeTableEntry_used((Node *) sub_qry->cteList,
3463 PRS2_OLD_VARNO, 0))
3464 ereport(ERROR,
3466 errmsg("cannot refer to OLD within WITH query")));
3467 if (rangeTableEntry_used((Node *) top_subqry->cteList,
3468 PRS2_NEW_VARNO, 0) ||
3469 rangeTableEntry_used((Node *) sub_qry->cteList,
3470 PRS2_NEW_VARNO, 0))
3471 ereport(ERROR,
3473 errmsg("cannot refer to NEW within WITH query")));
3474
3475 /*
3476 * For efficiency's sake, add OLD to the rule action's jointree
3477 * only if it was actually referenced in the statement or qual.
3478 *
3479 * For INSERT, NEW is not really a relation (only a reference to
3480 * the to-be-inserted tuple) and should never be added to the
3481 * jointree.
3482 *
3483 * For UPDATE, we treat NEW as being another kind of reference to
3484 * OLD, because it represents references to *transformed* tuples
3485 * of the existing relation. It would be wrong to enter NEW
3486 * separately in the jointree, since that would cause a double
3487 * join of the updated relation. It's also wrong to fail to make
3488 * a jointree entry if only NEW and not OLD is mentioned.
3489 */
3490 if (has_old || (has_new && stmt->event == CMD_UPDATE))
3491 {
3493
3494 /*
3495 * If sub_qry is a setop, manipulating its jointree will do no
3496 * good at all, because the jointree is dummy. (This should be
3497 * a can't-happen case because of prior tests.)
3498 */
3499 if (sub_qry->setOperations != NULL)
3500 ereport(ERROR,
3502 errmsg("conditional UNION/INTERSECT/EXCEPT statements are not implemented")));
3503 /* hackishly add OLD to the already-built FROM clause */
3505 rtr->rtindex = oldnsitem->p_rtindex;
3506 sub_qry->jointree->fromlist =
3507 lappend(sub_qry->jointree->fromlist, rtr);
3508 }
3509
3511
3513 }
3514
3515 *actions = newactions;
3516 }
3517
3518 free_parsestate(pstate);
3519
3520 /* Close relation, but keep the exclusive lock */
3521 table_close(rel, NoLock);
3522}
#define AccessExclusiveLock
Definition lockdefs.h:43
Alias * makeAlias(const char *aliasname, List *colnames)
Definition makefuncs.c:438
FromExpr * makeFromExpr(List *fromlist, Node *quals)
Definition makefuncs.c:336
@ CMD_UTILITY
Definition nodes.h:280
@ CMD_INSERT
Definition nodes.h:277
@ CMD_DELETE
Definition nodes.h:278
@ CMD_UPDATE
Definition nodes.h:276
@ CMD_SELECT
Definition nodes.h:275
@ CMD_NOTHING
Definition nodes.h:282
@ EXPR_KIND_WHERE
Definition parse_node.h:46
Query * transformStmt(ParseState *pstate, Node *parseTree)
Definition analyze.c:334
#define PRS2_OLD_VARNO
Definition primnodes.h:251
#define PRS2_NEW_VARNO
Definition primnodes.h:252
bool rangeTableEntry_used(Node *node, int rt_index, int sublevels_up)
Query * getInsertSelectQuery(Query *parsetree, Query ***subquery_ptr)
List * p_rteperminfos
Definition parse_node.h:216
Relation table_openrv(const RangeVar *relation, LOCKMODE lockmode)
Definition table.c:83

References AccessExclusiveLock, AccessShareLock, addNSItemToQuery(), addRangeTableEntryForRelation(), assign_expr_collations(), CMD_DELETE, CMD_INSERT, CMD_NOTHING, CMD_SELECT, CMD_UPDATE, CMD_UTILITY, elog, ereport, errcode(), errmsg, ERROR, EXPR_KIND_WHERE, fb(), free_parsestate(), getInsertSelectQuery(), lappend(), lfirst, list_length(), list_make1, make_parsestate(), makeAlias(), makeFromExpr(), makeNode, NIL, NoLock, ParseState::p_rtable, ParseState::p_rteperminfos, ParseState::p_sourcetext, PRS2_NEW_VARNO, PRS2_OLD_VARNO, rangeTableEntry_used(), RelationData::rd_rel, stmt, table_close(), table_openrv(), transformStmt(), and transformWhereClause().

Referenced by DefineRule().

◆ transformStatsStmt()

CreateStatsStmt * transformStatsStmt ( Oid  relid,
CreateStatsStmt stmt,
const char queryString 
)
extern

Definition at line 3157 of file parse_utilcmd.c.

3158{
3159 ParseState *pstate;
3161 ListCell *l;
3162 Relation rel;
3163
3164 /* Nothing to do if statement already transformed. */
3165 if (stmt->transformed)
3166 return stmt;
3167
3168 /* Set up pstate */
3169 pstate = make_parsestate(NULL);
3170 pstate->p_sourcetext = queryString;
3171
3172 /*
3173 * Put the parent table into the rtable so that the expressions can refer
3174 * to its fields without qualification. Caller is responsible for locking
3175 * relation, but we still need to open it.
3176 */
3177 rel = relation_open(relid, NoLock);
3180 NULL, false, true);
3181
3182 /* no to join list, yes to namespaces */
3183 addNSItemToQuery(pstate, nsitem, false, true, true);
3184
3185 /* take care of any expressions */
3186 foreach(l, stmt->exprs)
3187 {
3188 StatsElem *selem = (StatsElem *) lfirst(l);
3189
3190 if (selem->expr)
3191 {
3192 /* Now do parse transformation of the expression */
3193 selem->expr = transformExpr(pstate, selem->expr,
3195
3196 /* We have to fix its collations too */
3197 assign_expr_collations(pstate, selem->expr);
3198 }
3199 }
3200
3201 /*
3202 * Check that only the base rel is mentioned. (This should be dead code
3203 * now that add_missing_from is history.)
3204 */
3205 if (list_length(pstate->p_rtable) != 1)
3206 ereport(ERROR,
3208 errmsg("statistics expressions can refer only to the table being referenced")));
3209
3210 free_parsestate(pstate);
3211
3212 /* Close relation */
3213 table_close(rel, NoLock);
3214
3215 /* Mark statement as successfully transformed */
3216 stmt->transformed = true;
3217
3218 return stmt;
3219}
@ EXPR_KIND_STATS_EXPRESSION
Definition parse_node.h:75
Node * expr

References AccessShareLock, addNSItemToQuery(), addRangeTableEntryForRelation(), assign_expr_collations(), ereport, errcode(), errmsg, ERROR, StatsElem::expr, EXPR_KIND_STATS_EXPRESSION, fb(), free_parsestate(), lfirst, list_length(), make_parsestate(), NoLock, ParseState::p_rtable, ParseState::p_sourcetext, relation_open(), stmt, table_close(), and transformExpr().

Referenced by ATPostAlterTypeParse(), and ProcessUtilitySlow().