PostgreSQL Source Code  git master
plancat.h File Reference
#include "nodes/pathnodes.h"
#include "utils/relcache.h"
Include dependency graph for plancat.h:
This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Typedefs

typedef void(* get_relation_info_hook_type) (PlannerInfo *root, Oid relationObjectId, bool inhparent, RelOptInfo *rel)
 

Functions

void get_relation_info (PlannerInfo *root, Oid relationObjectId, bool inhparent, RelOptInfo *rel)
 
Listinfer_arbiter_indexes (PlannerInfo *root)
 
void estimate_rel_size (Relation rel, int32 *attr_widths, BlockNumber *pages, double *tuples, double *allvisfrac)
 
int32 get_rel_data_width (Relation rel, int32 *attr_widths)
 
int32 get_relation_data_width (Oid relid, int32 *attr_widths)
 
bool relation_excluded_by_constraints (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
Listbuild_physical_tlist (PlannerInfo *root, RelOptInfo *rel)
 
bool has_unique_index (RelOptInfo *rel, AttrNumber attno)
 
Selectivity restriction_selectivity (PlannerInfo *root, Oid operatorid, List *args, Oid inputcollid, int varRelid)
 
Selectivity join_selectivity (PlannerInfo *root, Oid operatorid, List *args, Oid inputcollid, JoinType jointype, SpecialJoinInfo *sjinfo)
 
Selectivity function_selectivity (PlannerInfo *root, Oid funcid, List *args, Oid inputcollid, bool is_join, int varRelid, JoinType jointype, SpecialJoinInfo *sjinfo)
 
void add_function_cost (PlannerInfo *root, Oid funcid, Node *node, QualCost *cost)
 
double get_function_rows (PlannerInfo *root, Oid funcid, Node *node)
 
bool has_row_triggers (PlannerInfo *root, Index rti, CmdType event)
 
bool has_stored_generated_columns (PlannerInfo *root, Index rti)
 

Variables

PGDLLIMPORT get_relation_info_hook_type get_relation_info_hook
 

Typedef Documentation

◆ get_relation_info_hook_type

typedef void(* get_relation_info_hook_type) (PlannerInfo *root, Oid relationObjectId, bool inhparent, RelOptInfo *rel)

Definition at line 21 of file plancat.h.

Function Documentation

◆ add_function_cost()

void add_function_cost ( PlannerInfo root,
Oid  funcid,
Node node,
QualCost cost 
)

Definition at line 1905 of file plancat.c.

References cpu_operator_cost, DatumGetPointer, elog, ERROR, SupportRequestCost::funcid, GETSTRUCT, HeapTupleIsValid, SupportRequestCost::node, ObjectIdGetDatum, OidFunctionCall1, OidIsValid, QualCost::per_tuple, SupportRequestCost::per_tuple, PointerGetDatum, PROCOID, ReleaseSysCache(), SupportRequestCost::root, SearchSysCache1(), QualCost::startup, SupportRequestCost::startup, T_SupportRequestCost, and SupportRequestCost::type.

Referenced by cost_qual_eval_walker(), cost_windowagg(), and get_agg_clause_costs_walker().

1907 {
1908  HeapTuple proctup;
1909  Form_pg_proc procform;
1910 
1911  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
1912  if (!HeapTupleIsValid(proctup))
1913  elog(ERROR, "cache lookup failed for function %u", funcid);
1914  procform = (Form_pg_proc) GETSTRUCT(proctup);
1915 
1916  if (OidIsValid(procform->prosupport))
1917  {
1918  SupportRequestCost req;
1919  SupportRequestCost *sresult;
1920 
1921  req.type = T_SupportRequestCost;
1922  req.root = root;
1923  req.funcid = funcid;
1924  req.node = node;
1925 
1926  /* Initialize cost fields so that support function doesn't have to */
1927  req.startup = 0;
1928  req.per_tuple = 0;
1929 
1930  sresult = (SupportRequestCost *)
1931  DatumGetPointer(OidFunctionCall1(procform->prosupport,
1932  PointerGetDatum(&req)));
1933 
1934  if (sresult == &req)
1935  {
1936  /* Success, so accumulate support function's estimate into *cost */
1937  cost->startup += req.startup;
1938  cost->per_tuple += req.per_tuple;
1939  ReleaseSysCache(proctup);
1940  return;
1941  }
1942  }
1943 
1944  /* No support function, or it failed, so rely on procost */
1945  cost->per_tuple += procform->procost * cpu_operator_cost;
1946 
1947  ReleaseSysCache(proctup);
1948 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define PointerGetDatum(X)
Definition: postgres.h:556
#define OidIsValid(objectId)
Definition: c.h:639
Cost startup
Definition: pathnodes.h:45
Cost per_tuple
Definition: pathnodes.h:46
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
#define OidFunctionCall1(functionId, arg1)
Definition: fmgr.h:655
double cpu_operator_cost
Definition: costsize.c:114
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
FormData_pg_proc * Form_pg_proc
Definition: pg_proc.h:134
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
struct PlannerInfo * root
Definition: supportnodes.h:136
#define DatumGetPointer(X)
Definition: postgres.h:549
#define elog(elevel,...)
Definition: elog.h:228

◆ build_physical_tlist()

List* build_physical_tlist ( PlannerInfo root,
RelOptInfo rel 
)

Definition at line 1580 of file plancat.c.

References elog, ERROR, expandRTE(), IsA, lappend(), lfirst, makeTargetEntry(), makeVar(), makeVarFromTargetEntry(), NIL, NoLock, planner_rt_fetch, RelationData::rd_att, RelationGetNumberOfAttributes, RelOptInfo::relid, RangeTblEntry::relid, TargetEntry::resjunk, TargetEntry::resno, RTE_CTE, RTE_FUNCTION, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_RESULT, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RangeTblEntry::rtekind, RangeTblEntry::subquery, table_close(), table_open(), Query::targetList, and TupleDescAttr.

Referenced by create_scan_plan().

1581 {
1582  List *tlist = NIL;
1583  Index varno = rel->relid;
1584  RangeTblEntry *rte = planner_rt_fetch(varno, root);
1585  Relation relation;
1586  Query *subquery;
1587  Var *var;
1588  ListCell *l;
1589  int attrno,
1590  numattrs;
1591  List *colvars;
1592 
1593  switch (rte->rtekind)
1594  {
1595  case RTE_RELATION:
1596  /* Assume we already have adequate lock */
1597  relation = table_open(rte->relid, NoLock);
1598 
1599  numattrs = RelationGetNumberOfAttributes(relation);
1600  for (attrno = 1; attrno <= numattrs; attrno++)
1601  {
1602  Form_pg_attribute att_tup = TupleDescAttr(relation->rd_att,
1603  attrno - 1);
1604 
1605  if (att_tup->attisdropped || att_tup->atthasmissing)
1606  {
1607  /* found a dropped or missing col, so punt */
1608  tlist = NIL;
1609  break;
1610  }
1611 
1612  var = makeVar(varno,
1613  attrno,
1614  att_tup->atttypid,
1615  att_tup->atttypmod,
1616  att_tup->attcollation,
1617  0);
1618 
1619  tlist = lappend(tlist,
1620  makeTargetEntry((Expr *) var,
1621  attrno,
1622  NULL,
1623  false));
1624  }
1625 
1626  table_close(relation, NoLock);
1627  break;
1628 
1629  case RTE_SUBQUERY:
1630  subquery = rte->subquery;
1631  foreach(l, subquery->targetList)
1632  {
1633  TargetEntry *tle = (TargetEntry *) lfirst(l);
1634 
1635  /*
1636  * A resjunk column of the subquery can be reflected as
1637  * resjunk in the physical tlist; we need not punt.
1638  */
1639  var = makeVarFromTargetEntry(varno, tle);
1640 
1641  tlist = lappend(tlist,
1642  makeTargetEntry((Expr *) var,
1643  tle->resno,
1644  NULL,
1645  tle->resjunk));
1646  }
1647  break;
1648 
1649  case RTE_FUNCTION:
1650  case RTE_TABLEFUNC:
1651  case RTE_VALUES:
1652  case RTE_CTE:
1653  case RTE_NAMEDTUPLESTORE:
1654  case RTE_RESULT:
1655  /* Not all of these can have dropped cols, but share code anyway */
1656  expandRTE(rte, varno, 0, -1, true /* include dropped */ ,
1657  NULL, &colvars);
1658  foreach(l, colvars)
1659  {
1660  var = (Var *) lfirst(l);
1661 
1662  /*
1663  * A non-Var in expandRTE's output means a dropped column;
1664  * must punt.
1665  */
1666  if (!IsA(var, Var))
1667  {
1668  tlist = NIL;
1669  break;
1670  }
1671 
1672  tlist = lappend(tlist,
1673  makeTargetEntry((Expr *) var,
1674  var->varattno,
1675  NULL,
1676  false));
1677  }
1678  break;
1679 
1680  default:
1681  /* caller error */
1682  elog(ERROR, "unsupported RTE kind %d in build_physical_tlist",
1683  (int) rte->rtekind);
1684  break;
1685  }
1686 
1687  return tlist;
1688 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:429
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
Var * makeVarFromTargetEntry(Index varno, TargetEntry *tle)
Definition: makefuncs.c:103
Definition: primnodes.h:167
List * targetList
Definition: parsenodes.h:140
bool resjunk
Definition: primnodes.h:1400
#define ERROR
Definition: elog.h:43
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:371
#define NoLock
Definition: lockdefs.h:34
AttrNumber resno
Definition: primnodes.h:1394
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:236
Var * makeVar(Index varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
Definition: makefuncs.c:66
Index relid
Definition: pathnodes.h:669
List * lappend(List *list, void *datum)
Definition: list.c:322
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
unsigned int Index
Definition: c.h:476
TupleDesc rd_att
Definition: rel.h:84
#define lfirst(lc)
Definition: pg_list.h:190
RTEKind rtekind
Definition: parsenodes.h:974
Query * subquery
Definition: parsenodes.h:1009
#define elog(elevel,...)
Definition: elog.h:228
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
Definition: pg_list.h:50

◆ estimate_rel_size()

void estimate_rel_size ( Relation  rel,
int32 attr_widths,
BlockNumber pages,
double *  tuples,
double *  allvisfrac 
)

Definition at line 946 of file plancat.c.

References get_rel_data_width(), MAXALIGN, RelationData::rd_rel, relallvisible, RelationGetNumberOfBlocks, relpages, reltuples, rint(), SizeofHeapTupleHeader, SizeOfPageHeaderData, and table_relation_estimate_size().

Referenced by get_relation_info(), hashbuild(), and plan_create_index_workers().

948 {
949  BlockNumber curpages;
951  double reltuples;
953  double density;
954 
955  switch (rel->rd_rel->relkind)
956  {
957  case RELKIND_RELATION:
958  case RELKIND_MATVIEW:
959  case RELKIND_TOASTVALUE:
960  table_relation_estimate_size(rel, attr_widths, pages, tuples,
961  allvisfrac);
962  break;
963 
964  case RELKIND_INDEX:
965 
966  /*
967  * XXX: It'd probably be good to move this into a callback,
968  * individual index types e.g. know if they have a metapage.
969  */
970 
971  /* it has storage, ok to call the smgr */
972  curpages = RelationGetNumberOfBlocks(rel);
973 
974  /* coerce values in pg_class to more desirable types */
975  relpages = (BlockNumber) rel->rd_rel->relpages;
976  reltuples = (double) rel->rd_rel->reltuples;
977  relallvisible = (BlockNumber) rel->rd_rel->relallvisible;
978 
979  /* report estimated # pages */
980  *pages = curpages;
981  /* quick exit if rel is clearly empty */
982  if (curpages == 0)
983  {
984  *tuples = 0;
985  *allvisfrac = 0;
986  break;
987  }
988  /* coerce values in pg_class to more desirable types */
989  relpages = (BlockNumber) rel->rd_rel->relpages;
990  reltuples = (double) rel->rd_rel->reltuples;
991  relallvisible = (BlockNumber) rel->rd_rel->relallvisible;
992 
993  /*
994  * Discount the metapage while estimating the number of tuples.
995  * This is a kluge because it assumes more than it ought to about
996  * index structure. Currently it's OK for btree, hash, and GIN
997  * indexes but suspect for GiST indexes.
998  */
999  if (relpages > 0)
1000  {
1001  curpages--;
1002  relpages--;
1003  }
1004 
1005  /* estimate number of tuples from previous tuple density */
1006  if (relpages > 0)
1007  density = reltuples / (double) relpages;
1008  else
1009  {
1010  /*
1011  * When we have no data because the relation was truncated,
1012  * estimate tuple width from attribute datatypes. We assume
1013  * here that the pages are completely full, which is OK for
1014  * tables (since they've presumably not been VACUUMed yet) but
1015  * is probably an overestimate for indexes. Fortunately
1016  * get_relation_info() can clamp the overestimate to the
1017  * parent table's size.
1018  *
1019  * Note: this code intentionally disregards alignment
1020  * considerations, because (a) that would be gilding the lily
1021  * considering how crude the estimate is, and (b) it creates
1022  * platform dependencies in the default plans which are kind
1023  * of a headache for regression testing.
1024  *
1025  * XXX: Should this logic be more index specific?
1026  */
1027  int32 tuple_width;
1028 
1029  tuple_width = get_rel_data_width(rel, attr_widths);
1030  tuple_width += MAXALIGN(SizeofHeapTupleHeader);
1031  tuple_width += sizeof(ItemIdData);
1032  /* note: integer division is intentional here */
1033  density = (BLCKSZ - SizeOfPageHeaderData) / tuple_width;
1034  }
1035  *tuples = rint(density * (double) curpages);
1036 
1037  /*
1038  * We use relallvisible as-is, rather than scaling it up like we
1039  * do for the pages and tuples counts, on the theory that any
1040  * pages added since the last VACUUM are most likely not marked
1041  * all-visible. But costsize.c wants it converted to a fraction.
1042  */
1043  if (relallvisible == 0 || curpages <= 0)
1044  *allvisfrac = 0;
1045  else if ((double) relallvisible >= curpages)
1046  *allvisfrac = 1;
1047  else
1048  *allvisfrac = (double) relallvisible / curpages;
1049  break;
1050 
1051  case RELKIND_SEQUENCE:
1052  /* Sequences always have a known size */
1053  *pages = 1;
1054  *tuples = 1;
1055  *allvisfrac = 0;
1056  break;
1057  case RELKIND_FOREIGN_TABLE:
1058  /* Just use whatever's in pg_class */
1059  *pages = rel->rd_rel->relpages;
1060  *tuples = rel->rd_rel->reltuples;
1061  *allvisfrac = 0;
1062  break;
1063  default:
1064  /* else it has no disk storage; probably shouldn't get here? */
1065  *pages = 0;
1066  *tuples = 0;
1067  *allvisfrac = 0;
1068  break;
1069  }
1070 }
static void table_relation_estimate_size(Relation rel, int32 *attr_widths, BlockNumber *pages, double *tuples, double *allvisfrac)
Definition: tableam.h:1617
#define SizeofHeapTupleHeader
Definition: htup_details.h:184
int32 relallvisible
Definition: pg_class.h:66
uint32 BlockNumber
Definition: block.h:31
#define SizeOfPageHeaderData
Definition: bufpage.h:216
Form_pg_class rd_rel
Definition: rel.h:83
int32 relpages
Definition: pg_class.h:60
signed int int32
Definition: c.h:347
struct ItemIdData ItemIdData
double rint(double x)
Definition: rint.c:21
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:198
#define MAXALIGN(LEN)
Definition: c.h:686
int32 get_rel_data_width(Relation rel, int32 *attr_widths)
Definition: plancat.c:1087
float4 reltuples
Definition: pg_class.h:63

◆ function_selectivity()

Selectivity function_selectivity ( PlannerInfo root,
Oid  funcid,
List args,
Oid  inputcollid,
bool  is_join,
int  varRelid,
JoinType  jointype,
SpecialJoinInfo sjinfo 
)

Definition at line 1843 of file plancat.c.

References SupportRequestSelectivity::args, generate_unaccent_rules::args, DatumGetPointer, elog, ERROR, SupportRequestSelectivity::funcid, get_func_support(), SupportRequestSelectivity::inputcollid, SupportRequestSelectivity::is_join, SupportRequestSelectivity::jointype, OidFunctionCall1, PointerGetDatum, SupportRequestSelectivity::root, SupportRequestSelectivity::selectivity, SupportRequestSelectivity::sjinfo, T_SupportRequestSelectivity, SupportRequestSelectivity::type, and SupportRequestSelectivity::varRelid.

Referenced by clause_selectivity().

1851 {
1852  RegProcedure prosupport = get_func_support(funcid);
1854  SupportRequestSelectivity *sresult;
1855 
1856  /*
1857  * If no support function is provided, use our historical default
1858  * estimate, 0.3333333. This seems a pretty unprincipled choice, but
1859  * Postgres has been using that estimate for function calls since 1992.
1860  * The hoariness of this behavior suggests that we should not be in too
1861  * much hurry to use another value.
1862  */
1863  if (!prosupport)
1864  return (Selectivity) 0.3333333;
1865 
1867  req.root = root;
1868  req.funcid = funcid;
1869  req.args = args;
1870  req.inputcollid = inputcollid;
1871  req.is_join = is_join;
1872  req.varRelid = varRelid;
1873  req.jointype = jointype;
1874  req.sjinfo = sjinfo;
1875  req.selectivity = -1; /* to catch failure to set the value */
1876 
1877  sresult = (SupportRequestSelectivity *)
1878  DatumGetPointer(OidFunctionCall1(prosupport,
1879  PointerGetDatum(&req)));
1880 
1881  /* If support function fails, use default */
1882  if (sresult != &req)
1883  return (Selectivity) 0.3333333;
1884 
1885  if (req.selectivity < 0.0 || req.selectivity > 1.0)
1886  elog(ERROR, "invalid function selectivity: %f", req.selectivity);
1887 
1888  return (Selectivity) req.selectivity;
1889 }
#define PointerGetDatum(X)
Definition: postgres.h:556
regproc RegProcedure
Definition: c.h:506
double Selectivity
Definition: nodes.h:658
#define ERROR
Definition: elog.h:43
struct PlannerInfo * root
Definition: supportnodes.h:96
struct SpecialJoinInfo * sjinfo
Definition: supportnodes.h:103
#define OidFunctionCall1(functionId, arg1)
Definition: fmgr.h:655
RegProcedure get_func_support(Oid funcid)
Definition: lsyscache.c:1660
#define DatumGetPointer(X)
Definition: postgres.h:549
#define elog(elevel,...)
Definition: elog.h:228

◆ get_function_rows()

double get_function_rows ( PlannerInfo root,
Oid  funcid,
Node node 
)

Definition at line 1966 of file plancat.c.

References Assert, DatumGetPointer, elog, ERROR, SupportRequestRows::funcid, GETSTRUCT, HeapTupleIsValid, SupportRequestRows::node, ObjectIdGetDatum, OidFunctionCall1, OidIsValid, PointerGetDatum, PROCOID, ReleaseSysCache(), SupportRequestRows::root, SupportRequestRows::rows, SearchSysCache1(), T_SupportRequestRows, and SupportRequestRows::type.

Referenced by expression_returns_set_rows().

1967 {
1968  HeapTuple proctup;
1969  Form_pg_proc procform;
1970  double result;
1971 
1972  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
1973  if (!HeapTupleIsValid(proctup))
1974  elog(ERROR, "cache lookup failed for function %u", funcid);
1975  procform = (Form_pg_proc) GETSTRUCT(proctup);
1976 
1977  Assert(procform->proretset); /* else caller error */
1978 
1979  if (OidIsValid(procform->prosupport))
1980  {
1981  SupportRequestRows req;
1982  SupportRequestRows *sresult;
1983 
1984  req.type = T_SupportRequestRows;
1985  req.root = root;
1986  req.funcid = funcid;
1987  req.node = node;
1988 
1989  req.rows = 0; /* just for sanity */
1990 
1991  sresult = (SupportRequestRows *)
1992  DatumGetPointer(OidFunctionCall1(procform->prosupport,
1993  PointerGetDatum(&req)));
1994 
1995  if (sresult == &req)
1996  {
1997  /* Success */
1998  ReleaseSysCache(proctup);
1999  return req.rows;
2000  }
2001  }
2002 
2003  /* No support function, or it failed, so rely on prorows */
2004  result = procform->prorows;
2005 
2006  ReleaseSysCache(proctup);
2007 
2008  return result;
2009 }
#define GETSTRUCT(TUP)
Definition: htup_details.h:655
#define PointerGetDatum(X)
Definition: postgres.h:556
#define OidIsValid(objectId)
Definition: c.h:639
struct PlannerInfo * root
Definition: supportnodes.h:163
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
#define OidFunctionCall1(functionId, arg1)
Definition: fmgr.h:655
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:1116
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:1164
FormData_pg_proc * Form_pg_proc
Definition: pg_proc.h:134
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define Assert(condition)
Definition: c.h:733
#define DatumGetPointer(X)
Definition: postgres.h:549
#define elog(elevel,...)
Definition: elog.h:228

◆ get_rel_data_width()

int32 get_rel_data_width ( Relation  rel,
int32 attr_widths 
)

Definition at line 1087 of file plancat.c.

References Assert, get_attavgwidth(), get_typavgwidth(), i, RelationData::rd_att, RelationGetNumberOfAttributes, RelationGetRelid, and TupleDescAttr.

Referenced by estimate_rel_size(), get_relation_data_width(), and table_block_relation_estimate_size().

1088 {
1089  int32 tuple_width = 0;
1090  int i;
1091 
1092  for (i = 1; i <= RelationGetNumberOfAttributes(rel); i++)
1093  {
1094  Form_pg_attribute att = TupleDescAttr(rel->rd_att, i - 1);
1095  int32 item_width;
1096 
1097  if (att->attisdropped)
1098  continue;
1099 
1100  /* use previously cached data, if any */
1101  if (attr_widths != NULL && attr_widths[i] > 0)
1102  {
1103  tuple_width += attr_widths[i];
1104  continue;
1105  }
1106 
1107  /* This should match set_rel_width() in costsize.c */
1108  item_width = get_attavgwidth(RelationGetRelid(rel), i);
1109  if (item_width <= 0)
1110  {
1111  item_width = get_typavgwidth(att->atttypid, att->atttypmod);
1112  Assert(item_width > 0);
1113  }
1114  if (attr_widths != NULL)
1115  attr_widths[i] = item_width;
1116  tuple_width += item_width;
1117  }
1118 
1119  return tuple_width;
1120 }
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:429
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92
signed int int32
Definition: c.h:347
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:200
TupleDesc rd_att
Definition: rel.h:84
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition: lsyscache.c:2356
#define Assert(condition)
Definition: c.h:733
int i
int32 get_attavgwidth(Oid relid, AttrNumber attnum)
Definition: lsyscache.c:2870
#define RelationGetRelid(relation)
Definition: rel.h:423

◆ get_relation_data_width()

int32 get_relation_data_width ( Oid  relid,
int32 attr_widths 
)

Definition at line 1129 of file plancat.c.

References get_rel_data_width(), NoLock, table_close(), and table_open().

Referenced by plan_cluster_use_sort(), and set_rel_width().

1130 {
1131  int32 result;
1132  Relation relation;
1133 
1134  /* As above, assume relation is already locked */
1135  relation = table_open(relid, NoLock);
1136 
1137  result = get_rel_data_width(relation, attr_widths);
1138 
1139  table_close(relation, NoLock);
1140 
1141  return result;
1142 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
signed int int32
Definition: c.h:347
#define NoLock
Definition: lockdefs.h:34
int32 get_rel_data_width(Relation rel, int32 *attr_widths)
Definition: plancat.c:1087
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ get_relation_info()

void get_relation_info ( PlannerInfo root,
Oid  relationObjectId,
bool  inhparent,
RelOptInfo rel 
)

Definition at line 113 of file plancat.c.

References _bt_getrootheight(), RelOptInfo::allvisfrac, IndexAmRoutine::amcanorder, IndexAmRoutine::amcanorderbyop, IndexOptInfo::amcanorderbyop, IndexAmRoutine::amcanparallel, IndexOptInfo::amcanparallel, IndexAmRoutine::amcostestimate, IndexOptInfo::amcostestimate, IndexAmRoutine::amgetbitmap, IndexAmRoutine::amgettuple, IndexOptInfo::amhasgetbitmap, IndexOptInfo::amhasgettuple, IndexAmRoutine::amoptionalkey, IndexOptInfo::amoptionalkey, IndexAmRoutine::amsearcharray, IndexOptInfo::amsearcharray, IndexAmRoutine::amsearchnulls, IndexOptInfo::amsearchnulls, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, BTLessStrategyNumber, build_index_tlist(), IndexOptInfo::canreturn, ChangeVarNodes(), ereport, errcode(), errmsg(), ERROR, estimate_rel_size(), RelOptInfo::fdwroutine, FirstLowInvalidHeapAttributeNumber, get_opfamily_member(), get_ordering_op_properties(), get_relation_foreign_keys(), get_relation_info_hook, get_relation_statistics(), GetFdwRoutineForRelation(), GetForeignServerIdByRelId(), PlannerInfo::glob, HeapTupleHeaderGetXmin, IndexOptInfo::hypothetical, i, IgnoreSystemIndexes, IndexOptInfo::immediate, index_can_return(), index_close(), index_open(), IndexOptInfo::indexcollations, IndexOptInfo::indexkeys, RelOptInfo::indexlist, IndexOptInfo::indexoid, IndexOptInfo::indexprs, IndexOptInfo::indextlist, IndexOptInfo::indpred, IndexOptInfo::indrestrictinfo, InvalidOid, IsSystemRelation(), lcons(), lfirst_oid, list_free(), makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, IndexOptInfo::ncolumns, NIL, IndexOptInfo::nkeycolumns, NoLock, IndexOptInfo::nulls_first, OidIsValid, IndexOptInfo::opcintype, IndexOptInfo::opfamily, RelOptInfo::pages, IndexOptInfo::pages, palloc(), palloc0(), IndexOptInfo::predOK, RelationData::rd_indam, RelationData::rd_indcollation, RelationData::rd_index, RelationData::rd_indextuple, RelationData::rd_indoption, RelationData::rd_opcintype, RelationData::rd_opfamily, RelationData::rd_rel, RelationData::rd_tableam, RecoveryInProgress(), IndexOptInfo::rel, RelOptInfo::rel_parallel_workers, IndexOptInfo::relam, RelationGetForm, RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), RelationGetNumberOfAttributes, RelationGetNumberOfBlocks, RelationGetParallelWorkers, RelationGetRelid, RelationNeedsWAL, RelOptInfo::relid, RangeTblEntry::rellockmode, RelOptInfo::reltablespace, IndexOptInfo::reltablespace, IndexOptInfo::reverse_sort, TableAmRoutine::scan_bitmap_next_block, RelOptInfo::serverid, set_relation_partition_info(), PlannerInfo::simple_rte_array, IndexOptInfo::sortopfamily, RelOptInfo::statlist, HeapTupleData::t_data, table_close(), table_open(), TransactionIdPrecedes(), TransactionXmin, PlannerGlobal::transientPlan, IndexOptInfo::tree_height, RelOptInfo::tuples, IndexOptInfo::tuples, and IndexOptInfo::unique.

Referenced by build_simple_rel().

115 {
116  Index varno = rel->relid;
117  Relation relation;
118  bool hasindex;
119  List *indexinfos = NIL;
120 
121  /*
122  * We need not lock the relation since it was already locked, either by
123  * the rewriter or when expand_inherited_rtentry() added it to the query's
124  * rangetable.
125  */
126  relation = table_open(relationObjectId, NoLock);
127 
128  /* Temporary and unlogged relations are inaccessible during recovery. */
129  if (!RelationNeedsWAL(relation) && RecoveryInProgress())
130  ereport(ERROR,
131  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
132  errmsg("cannot access temporary or unlogged relations during recovery")));
133 
135  rel->max_attr = RelationGetNumberOfAttributes(relation);
136  rel->reltablespace = RelationGetForm(relation)->reltablespace;
137 
138  Assert(rel->max_attr >= rel->min_attr);
139  rel->attr_needed = (Relids *)
140  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
141  rel->attr_widths = (int32 *)
142  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
143 
144  /*
145  * Estimate relation size --- unless it's an inheritance parent, in which
146  * case the size we want is not the rel's own size but the size of its
147  * inheritance tree. That will be computed in set_append_rel_size().
148  */
149  if (!inhparent)
150  estimate_rel_size(relation, rel->attr_widths - rel->min_attr,
151  &rel->pages, &rel->tuples, &rel->allvisfrac);
152 
153  /* Retrieve the parallel_workers reloption, or -1 if not set. */
155 
156  /*
157  * Make list of indexes. Ignore indexes on system catalogs if told to.
158  * Don't bother with indexes for an inheritance parent, either.
159  */
160  if (inhparent ||
161  (IgnoreSystemIndexes && IsSystemRelation(relation)))
162  hasindex = false;
163  else
164  hasindex = relation->rd_rel->relhasindex;
165 
166  if (hasindex)
167  {
168  List *indexoidlist;
169  LOCKMODE lmode;
170  ListCell *l;
171 
172  indexoidlist = RelationGetIndexList(relation);
173 
174  /*
175  * For each index, we get the same type of lock that the executor will
176  * need, and do not release it. This saves a couple of trips to the
177  * shared lock manager while not creating any real loss of
178  * concurrency, because no schema changes could be happening on the
179  * index while we hold lock on the parent rel, and no lock type used
180  * for queries blocks any other kind of index operation.
181  */
182  lmode = root->simple_rte_array[varno]->rellockmode;
183 
184  foreach(l, indexoidlist)
185  {
186  Oid indexoid = lfirst_oid(l);
187  Relation indexRelation;
189  IndexAmRoutine *amroutine;
190  IndexOptInfo *info;
191  int ncolumns,
192  nkeycolumns;
193  int i;
194 
195  /*
196  * Extract info from the relation descriptor for the index.
197  */
198  indexRelation = index_open(indexoid, lmode);
199  index = indexRelation->rd_index;
200 
201  /*
202  * Ignore invalid indexes, since they can't safely be used for
203  * queries. Note that this is OK because the data structure we
204  * are constructing is only used by the planner --- the executor
205  * still needs to insert into "invalid" indexes, if they're marked
206  * indisready.
207  */
208  if (!index->indisvalid)
209  {
210  index_close(indexRelation, NoLock);
211  continue;
212  }
213 
214  /*
215  * Ignore partitioned indexes, since they are not usable for
216  * queries.
217  */
218  if (indexRelation->rd_rel->relkind == RELKIND_PARTITIONED_INDEX)
219  {
220  index_close(indexRelation, NoLock);
221  continue;
222  }
223 
224  /*
225  * If the index is valid, but cannot yet be used, ignore it; but
226  * mark the plan we are generating as transient. See
227  * src/backend/access/heap/README.HOT for discussion.
228  */
229  if (index->indcheckxmin &&
232  {
233  root->glob->transientPlan = true;
234  index_close(indexRelation, NoLock);
235  continue;
236  }
237 
238  info = makeNode(IndexOptInfo);
239 
240  info->indexoid = index->indexrelid;
241  info->reltablespace =
242  RelationGetForm(indexRelation)->reltablespace;
243  info->rel = rel;
244  info->ncolumns = ncolumns = index->indnatts;
245  info->nkeycolumns = nkeycolumns = index->indnkeyatts;
246 
247  info->indexkeys = (int *) palloc(sizeof(int) * ncolumns);
248  info->indexcollations = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
249  info->opfamily = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
250  info->opcintype = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
251  info->canreturn = (bool *) palloc(sizeof(bool) * ncolumns);
252 
253  for (i = 0; i < ncolumns; i++)
254  {
255  info->indexkeys[i] = index->indkey.values[i];
256  info->canreturn[i] = index_can_return(indexRelation, i + 1);
257  }
258 
259  for (i = 0; i < nkeycolumns; i++)
260  {
261  info->opfamily[i] = indexRelation->rd_opfamily[i];
262  info->opcintype[i] = indexRelation->rd_opcintype[i];
263  info->indexcollations[i] = indexRelation->rd_indcollation[i];
264  }
265 
266  info->relam = indexRelation->rd_rel->relam;
267 
268  /* We copy just the fields we need, not all of rd_indam */
269  amroutine = indexRelation->rd_indam;
270  info->amcanorderbyop = amroutine->amcanorderbyop;
271  info->amoptionalkey = amroutine->amoptionalkey;
272  info->amsearcharray = amroutine->amsearcharray;
273  info->amsearchnulls = amroutine->amsearchnulls;
274  info->amcanparallel = amroutine->amcanparallel;
275  info->amhasgettuple = (amroutine->amgettuple != NULL);
276  info->amhasgetbitmap = amroutine->amgetbitmap != NULL &&
277  relation->rd_tableam->scan_bitmap_next_block != NULL;
278  info->amcostestimate = amroutine->amcostestimate;
279  Assert(info->amcostestimate != NULL);
280 
281  /*
282  * Fetch the ordering information for the index, if any.
283  */
284  if (info->relam == BTREE_AM_OID)
285  {
286  /*
287  * If it's a btree index, we can use its opfamily OIDs
288  * directly as the sort ordering opfamily OIDs.
289  */
290  Assert(amroutine->amcanorder);
291 
292  info->sortopfamily = info->opfamily;
293  info->reverse_sort = (bool *) palloc(sizeof(bool) * nkeycolumns);
294  info->nulls_first = (bool *) palloc(sizeof(bool) * nkeycolumns);
295 
296  for (i = 0; i < nkeycolumns; i++)
297  {
298  int16 opt = indexRelation->rd_indoption[i];
299 
300  info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
301  info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
302  }
303  }
304  else if (amroutine->amcanorder)
305  {
306  /*
307  * Otherwise, identify the corresponding btree opfamilies by
308  * trying to map this index's "<" operators into btree. Since
309  * "<" uniquely defines the behavior of a sort order, this is
310  * a sufficient test.
311  *
312  * XXX This method is rather slow and also requires the
313  * undesirable assumption that the other index AM numbers its
314  * strategies the same as btree. It'd be better to have a way
315  * to explicitly declare the corresponding btree opfamily for
316  * each opfamily of the other index type. But given the lack
317  * of current or foreseeable amcanorder index types, it's not
318  * worth expending more effort on now.
319  */
320  info->sortopfamily = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
321  info->reverse_sort = (bool *) palloc(sizeof(bool) * nkeycolumns);
322  info->nulls_first = (bool *) palloc(sizeof(bool) * nkeycolumns);
323 
324  for (i = 0; i < nkeycolumns; i++)
325  {
326  int16 opt = indexRelation->rd_indoption[i];
327  Oid ltopr;
328  Oid btopfamily;
329  Oid btopcintype;
330  int16 btstrategy;
331 
332  info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
333  info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
334 
335  ltopr = get_opfamily_member(info->opfamily[i],
336  info->opcintype[i],
337  info->opcintype[i],
339  if (OidIsValid(ltopr) &&
341  &btopfamily,
342  &btopcintype,
343  &btstrategy) &&
344  btopcintype == info->opcintype[i] &&
345  btstrategy == BTLessStrategyNumber)
346  {
347  /* Successful mapping */
348  info->sortopfamily[i] = btopfamily;
349  }
350  else
351  {
352  /* Fail ... quietly treat index as unordered */
353  info->sortopfamily = NULL;
354  info->reverse_sort = NULL;
355  info->nulls_first = NULL;
356  break;
357  }
358  }
359  }
360  else
361  {
362  info->sortopfamily = NULL;
363  info->reverse_sort = NULL;
364  info->nulls_first = NULL;
365  }
366 
367  /*
368  * Fetch the index expressions and predicate, if any. We must
369  * modify the copies we obtain from the relcache to have the
370  * correct varno for the parent relation, so that they match up
371  * correctly against qual clauses.
372  */
373  info->indexprs = RelationGetIndexExpressions(indexRelation);
374  info->indpred = RelationGetIndexPredicate(indexRelation);
375  if (info->indexprs && varno != 1)
376  ChangeVarNodes((Node *) info->indexprs, 1, varno, 0);
377  if (info->indpred && varno != 1)
378  ChangeVarNodes((Node *) info->indpred, 1, varno, 0);
379 
380  /* Build targetlist using the completed indexprs data */
381  info->indextlist = build_index_tlist(root, info, relation);
382 
383  info->indrestrictinfo = NIL; /* set later, in indxpath.c */
384  info->predOK = false; /* set later, in indxpath.c */
385  info->unique = index->indisunique;
386  info->immediate = index->indimmediate;
387  info->hypothetical = false;
388 
389  /*
390  * Estimate the index size. If it's not a partial index, we lock
391  * the number-of-tuples estimate to equal the parent table; if it
392  * is partial then we have to use the same methods as we would for
393  * a table, except we can be sure that the index is not larger
394  * than the table.
395  */
396  if (info->indpred == NIL)
397  {
398  info->pages = RelationGetNumberOfBlocks(indexRelation);
399  info->tuples = rel->tuples;
400  }
401  else
402  {
403  double allvisfrac; /* dummy */
404 
405  estimate_rel_size(indexRelation, NULL,
406  &info->pages, &info->tuples, &allvisfrac);
407  if (info->tuples > rel->tuples)
408  info->tuples = rel->tuples;
409  }
410 
411  if (info->relam == BTREE_AM_OID)
412  {
413  /* For btrees, get tree height while we have the index open */
414  info->tree_height = _bt_getrootheight(indexRelation);
415  }
416  else
417  {
418  /* For other index types, just set it to "unknown" for now */
419  info->tree_height = -1;
420  }
421 
422  index_close(indexRelation, NoLock);
423 
424  /*
425  * We've historically used lcons() here. It'd make more sense to
426  * use lappend(), but that causes the planner to change behavior
427  * in cases where two indexes seem equally attractive. For now,
428  * stick with lcons() --- few tables should have so many indexes
429  * that the O(N^2) behavior of lcons() is really a problem.
430  */
431  indexinfos = lcons(info, indexinfos);
432  }
433 
434  list_free(indexoidlist);
435  }
436 
437  rel->indexlist = indexinfos;
438 
439  rel->statlist = get_relation_statistics(rel, relation);
440 
441  /* Grab foreign-table info using the relcache, while we have it */
442  if (relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
443  {
445  rel->fdwroutine = GetFdwRoutineForRelation(relation, true);
446  }
447  else
448  {
449  rel->serverid = InvalidOid;
450  rel->fdwroutine = NULL;
451  }
452 
453  /* Collect info about relation's foreign keys, if relevant */
454  get_relation_foreign_keys(root, rel, relation, inhparent);
455 
456  /*
457  * Collect info about relation's partitioning scheme, if any. Only
458  * inheritance parents may be partitioned.
459  */
460  if (inhparent && relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
461  set_relation_partition_info(root, rel, relation);
462 
463  table_close(relation, NoLock);
464 
465  /*
466  * Allow a plugin to editorialize on the info we obtained from the
467  * catalogs. Actions might include altering the assumed relation size,
468  * removing an index, or adding a hypothetical index to the indexlist.
469  */
471  (*get_relation_info_hook) (root, relationObjectId, inhparent, rel);
472 }
signed short int16
Definition: c.h:346
#define NIL
Definition: pg_list.h:65
struct IndexAmRoutine * rd_indam
Definition: rel.h:157
List * statlist
Definition: pathnodes.h:679
int16 * rd_indoption
Definition: rel.h:162
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
static List * get_relation_statistics(RelOptInfo *rel, Relation relation)
Definition: plancat.c:1291
Oid * indexcollations
Definition: pathnodes.h:803
Relids * attr_needed
Definition: pathnodes.h:674
bool IsSystemRelation(Relation relation)
Definition: catalog.c:69
amgettuple_function amgettuple
Definition: amapi.h:223
int _bt_getrootheight(Relation rel)
Definition: nbtpage.c:584
int LOCKMODE
Definition: lockdefs.h:26
bool amcanorderbyop
Definition: amapi.h:177
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:429
List * indextlist
Definition: pathnodes.h:816
#define RelationGetForm(relation)
Definition: rel.h:417
double tuples
Definition: pathnodes.h:681
Oid reltablespace
Definition: pathnodes.h:670
Definition: nodes.h:525
Oid * sortopfamily
Definition: pathnodes.h:806
int errcode(int sqlerrcode)
Definition: elog.c:608
Oid reltablespace
Definition: pathnodes.h:790
bool IgnoreSystemIndexes
Definition: miscinit.c:77
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
bool hypothetical
Definition: pathnodes.h:827
bool immediate
Definition: pathnodes.h:826
double tuples
Definition: pathnodes.h:795
Form_pg_class rd_rel
Definition: rel.h:83
unsigned int Oid
Definition: postgres_ext.h:31
bool RecoveryInProgress(void)
Definition: xlog.c:7931
int tree_height
Definition: pathnodes.h:796
#define OidIsValid(objectId)
Definition: c.h:639
bool amoptionalkey
Definition: amapi.h:185
double allvisfrac
Definition: pathnodes.h:682
signed int int32
Definition: c.h:347
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4643
struct HeapTupleData * rd_indextuple
Definition: rel.h:145
TransactionId TransactionXmin
Definition: snapmgr.c:166
HeapTupleHeader t_data
Definition: htup.h:68
Definition: type.h:89
BlockNumber pages
Definition: pathnodes.h:794
bool index_can_return(Relation indexRelation, int attno)
Definition: indexam.c:722
Form_pg_index rd_index
Definition: rel.h:143
RelOptInfo * rel
Definition: pathnodes.h:791
bool amoptionalkey
Definition: pathnodes.h:831
amgetbitmap_function amgetbitmap
Definition: amapi.h:224
Oid * rd_indcollation
Definition: rel.h:168
#define ERROR
Definition: elog.h:43
bool(* scan_bitmap_next_block)(TableScanDesc scan, struct TBMIterateResult *tbmres)
Definition: tableam.h:641
amcostestimate_function amcostestimate
Definition: amapi.h:216
#define NoLock
Definition: lockdefs.h:34
bool amcanorderbyop
Definition: pathnodes.h:830
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4581
PlannerGlobal * glob
Definition: pathnodes.h:179
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:694
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:163
static void set_relation_partition_info(PlannerInfo *root, RelOptInfo *rel, Relation relation)
Definition: plancat.c:2121
get_relation_info_hook_type get_relation_info_hook
Definition: plancat.c:60
Oid * rd_opfamily
Definition: rel.h:158
void estimate_rel_size(Relation rel, int32 *attr_widths, BlockNumber *pages, double *tuples, double *allvisfrac)
Definition: plancat.c:946
void(* amcostestimate)()
Definition: pathnodes.h:838
#define ereport(elevel, rest)
Definition: elog.h:141
bool amhasgetbitmap
Definition: pathnodes.h:835
bool amcanparallel
Definition: amapi.h:197
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:300
Index relid
Definition: pathnodes.h:669
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:209
Oid serverid
Definition: pathnodes.h:690
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
bool amsearchnulls
Definition: amapi.h:189
List * indrestrictinfo
Definition: pathnodes.h:818
void * palloc0(Size size)
Definition: mcxt.c:980
int rel_parallel_workers
Definition: pathnodes.h:687
const struct TableAmRoutine * rd_tableam
Definition: rel.h:140
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:198
unsigned int Index
Definition: c.h:476
List * indexlist
Definition: pathnodes.h:678
bool amsearcharray
Definition: amapi.h:187
bool amhasgettuple
Definition: pathnodes.h:834
#define InvalidOid
Definition: postgres_ext.h:36
List * lcons(void *datum, List *list)
Definition: list.c:454
#define makeNode(_type_)
Definition: nodes.h:573
BlockNumber pages
Definition: pathnodes.h:680
#define Assert(condition)
Definition: c.h:733
static void get_relation_foreign_keys(PlannerInfo *root, RelOptInfo *rel, Relation relation, bool inhparent)
Definition: plancat.c:485
#define HeapTupleHeaderGetXmin(tup)
Definition: htup_details.h:313
Oid GetForeignServerIdByRelId(Oid relid)
Definition: foreign.c:340
bool get_ordering_op_properties(Oid opno, Oid *opfamily, Oid *opcintype, int16 *strategy)
Definition: lsyscache.c:204
bool amsearcharray
Definition: pathnodes.h:832
bool amcanorder
Definition: amapi.h:175
int nkeycolumns
Definition: pathnodes.h:800
#define RelationNeedsWAL(relation)
Definition: rel.h:525
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4347
Oid * opcintype
Definition: pathnodes.h:805
Bitmapset * Relids
Definition: pathnodes.h:28
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:152
Oid * opfamily
Definition: pathnodes.h:804
AttrNumber max_attr
Definition: pathnodes.h:673
void * palloc(Size size)
Definition: mcxt.c:949
int errmsg(const char *fmt,...)
Definition: elog.c:822
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:427
void list_free(List *list)
Definition: list.c:1377
int i
void ChangeVarNodes(Node *node, int rt_index, int new_index, int sublevels_up)
Definition: rewriteManip.c:607
#define RelationGetParallelWorkers(relation, defaultpw)
Definition: rel.h:326
static List * build_index_tlist(PlannerInfo *root, IndexOptInfo *index, Relation heapRelation)
Definition: plancat.c:1701
int * indexkeys
Definition: pathnodes.h:801
bool * canreturn
Definition: pathnodes.h:809
bool amsearchnulls
Definition: pathnodes.h:833
Oid * rd_opcintype
Definition: rel.h:159
bool * nulls_first
Definition: pathnodes.h:808
bool * reverse_sort
Definition: pathnodes.h:807
#define BTLessStrategyNumber
Definition: stratnum.h:29
List * indpred
Definition: pathnodes.h:814
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
int32 * attr_widths
Definition: pathnodes.h:675
Definition: pg_list.h:50
#define RelationGetRelid(relation)
Definition: rel.h:423
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:126
bool amcanparallel
Definition: pathnodes.h:836
#define lfirst_oid(lc)
Definition: pg_list.h:192
List * indexprs
Definition: pathnodes.h:813
bool transientPlan
Definition: pathnodes.h:137
AttrNumber min_attr
Definition: pathnodes.h:672

◆ has_row_triggers()

bool has_row_triggers ( PlannerInfo root,
Index  rti,
CmdType  event 
)

Definition at line 2056 of file plancat.c.

References CMD_DELETE, CMD_INSERT, CMD_UPDATE, elog, ERROR, NoLock, planner_rt_fetch, RangeTblEntry::relid, table_close(), table_open(), TriggerDesc::trig_delete_after_row, TriggerDesc::trig_delete_before_row, TriggerDesc::trig_insert_after_row, TriggerDesc::trig_insert_before_row, TriggerDesc::trig_update_after_row, TriggerDesc::trig_update_before_row, and RelationData::trigdesc.

Referenced by make_modifytable().

2057 {
2058  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2059  Relation relation;
2060  TriggerDesc *trigDesc;
2061  bool result = false;
2062 
2063  /* Assume we already have adequate lock */
2064  relation = table_open(rte->relid, NoLock);
2065 
2066  trigDesc = relation->trigdesc;
2067  switch (event)
2068  {
2069  case CMD_INSERT:
2070  if (trigDesc &&
2071  (trigDesc->trig_insert_after_row ||
2072  trigDesc->trig_insert_before_row))
2073  result = true;
2074  break;
2075  case CMD_UPDATE:
2076  if (trigDesc &&
2077  (trigDesc->trig_update_after_row ||
2078  trigDesc->trig_update_before_row))
2079  result = true;
2080  break;
2081  case CMD_DELETE:
2082  if (trigDesc &&
2083  (trigDesc->trig_delete_after_row ||
2084  trigDesc->trig_delete_before_row))
2085  result = true;
2086  break;
2087  default:
2088  elog(ERROR, "unrecognized CmdType: %d", (int) event);
2089  break;
2090  }
2091 
2092  table_close(relation, NoLock);
2093  return result;
2094 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define ERROR
Definition: elog.h:43
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:371
TriggerDesc * trigdesc
Definition: rel.h:89
bool trig_delete_after_row
Definition: reltrigger.h:66
#define NoLock
Definition: lockdefs.h:34
bool trig_update_before_row
Definition: reltrigger.h:60
bool trig_insert_after_row
Definition: reltrigger.h:56
bool trig_update_after_row
Definition: reltrigger.h:61
bool trig_insert_before_row
Definition: reltrigger.h:55
#define elog(elevel,...)
Definition: elog.h:228
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
bool trig_delete_before_row
Definition: reltrigger.h:65

◆ has_stored_generated_columns()

bool has_stored_generated_columns ( PlannerInfo root,
Index  rti 
)

Definition at line 2097 of file plancat.c.

References TupleDescData::constr, TupleConstr::has_generated_stored, NoLock, planner_rt_fetch, RelationGetDescr, RangeTblEntry::relid, table_close(), and table_open().

Referenced by make_modifytable().

2098 {
2099  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2100  Relation relation;
2101  TupleDesc tupdesc;
2102  bool result = false;
2103 
2104  /* Assume we already have adequate lock */
2105  relation = table_open(rte->relid, NoLock);
2106 
2107  tupdesc = RelationGetDescr(relation);
2108  result = tupdesc->constr && tupdesc->constr->has_generated_stored;
2109 
2110  table_close(relation, NoLock);
2111 
2112  return result;
2113 }
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
#define RelationGetDescr(relation)
Definition: rel.h:449
bool has_generated_stored
Definition: tupdesc.h:45
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:371
#define NoLock
Definition: lockdefs.h:34
TupleConstr * constr
Definition: tupdesc.h:85
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39

◆ has_unique_index()

bool has_unique_index ( RelOptInfo rel,
AttrNumber  attno 
)

Definition at line 2024 of file plancat.c.

References IndexOptInfo::indexkeys, RelOptInfo::indexlist, IndexOptInfo::indpred, lfirst, NIL, IndexOptInfo::nkeycolumns, IndexOptInfo::predOK, and IndexOptInfo::unique.

Referenced by examine_variable().

2025 {
2026  ListCell *ilist;
2027 
2028  foreach(ilist, rel->indexlist)
2029  {
2030  IndexOptInfo *index = (IndexOptInfo *) lfirst(ilist);
2031 
2032  /*
2033  * Note: ignore partial indexes, since they don't allow us to conclude
2034  * that all attr values are distinct, *unless* they are marked predOK
2035  * which means we know the index's predicate is satisfied by the
2036  * query. We don't take any interest in expressional indexes either.
2037  * Also, a multicolumn unique index doesn't allow us to conclude that
2038  * just the specified attr is unique.
2039  */
2040  if (index->unique &&
2041  index->nkeycolumns == 1 &&
2042  index->indexkeys[0] == attno &&
2043  (index->indpred == NIL || index->predOK))
2044  return true;
2045  }
2046  return false;
2047 }
#define NIL
Definition: pg_list.h:65
Definition: type.h:89
List * indexlist
Definition: pathnodes.h:678
#define lfirst(lc)
Definition: pg_list.h:190
int nkeycolumns
Definition: pathnodes.h:800
int * indexkeys
Definition: pathnodes.h:801
List * indpred
Definition: pathnodes.h:814

◆ infer_arbiter_indexes()

List* infer_arbiter_indexes ( PlannerInfo root)

Definition at line 598 of file plancat.c.

References OnConflictExpr::action, OnConflictExpr::arbiterElems, OnConflictExpr::arbiterWhere, bms_add_member(), bms_equal(), OnConflictExpr::constraint, ereport, errcode(), errmsg(), ERROR, InferenceElem::expr, FirstLowInvalidHeapAttributeNumber, get_constraint_index(), index_close(), index_open(), infer_collation_opclass_match(), InferenceElem::infercollid, InferenceElem::inferopclass, InvalidOid, IsA, lappend(), lappend_oid(), lfirst, lfirst_oid, list_difference(), list_free(), list_member(), next, NIL, NoLock, Query::onConflict, ONCONFLICT_UPDATE, PlannerInfo::parse, predicate_implied_by(), RelationData::rd_index, RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), RangeTblEntry::relid, RangeTblEntry::rellockmode, Query::resultRelation, rt_fetch, Query::rtable, table_close(), table_open(), and Var::varattno.

Referenced by make_modifytable().

599 {
600  OnConflictExpr *onconflict = root->parse->onConflict;
601 
602  /* Iteration state */
603  RangeTblEntry *rte;
604  Relation relation;
605  Oid indexOidFromConstraint = InvalidOid;
606  List *indexList;
607  ListCell *l;
608 
609  /* Normalized inference attributes and inference expressions: */
610  Bitmapset *inferAttrs = NULL;
611  List *inferElems = NIL;
612 
613  /* Results */
614  List *results = NIL;
615 
616  /*
617  * Quickly return NIL for ON CONFLICT DO NOTHING without an inference
618  * specification or named constraint. ON CONFLICT DO UPDATE statements
619  * must always provide one or the other (but parser ought to have caught
620  * that already).
621  */
622  if (onconflict->arbiterElems == NIL &&
623  onconflict->constraint == InvalidOid)
624  return NIL;
625 
626  /*
627  * We need not lock the relation since it was already locked, either by
628  * the rewriter or when expand_inherited_rtentry() added it to the query's
629  * rangetable.
630  */
631  rte = rt_fetch(root->parse->resultRelation, root->parse->rtable);
632 
633  relation = table_open(rte->relid, NoLock);
634 
635  /*
636  * Build normalized/BMS representation of plain indexed attributes, as
637  * well as a separate list of expression items. This simplifies matching
638  * the cataloged definition of indexes.
639  */
640  foreach(l, onconflict->arbiterElems)
641  {
642  InferenceElem *elem = (InferenceElem *) lfirst(l);
643  Var *var;
644  int attno;
645 
646  if (!IsA(elem->expr, Var))
647  {
648  /* If not a plain Var, just shove it in inferElems for now */
649  inferElems = lappend(inferElems, elem->expr);
650  continue;
651  }
652 
653  var = (Var *) elem->expr;
654  attno = var->varattno;
655 
656  if (attno == 0)
657  ereport(ERROR,
658  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
659  errmsg("whole row unique index inference specifications are not supported")));
660 
661  inferAttrs = bms_add_member(inferAttrs,
663  }
664 
665  /*
666  * Lookup named constraint's index. This is not immediately returned
667  * because some additional sanity checks are required.
668  */
669  if (onconflict->constraint != InvalidOid)
670  {
671  indexOidFromConstraint = get_constraint_index(onconflict->constraint);
672 
673  if (indexOidFromConstraint == InvalidOid)
674  ereport(ERROR,
675  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
676  errmsg("constraint in ON CONFLICT clause has no associated index")));
677  }
678 
679  /*
680  * Using that representation, iterate through the list of indexes on the
681  * target relation to try and find a match
682  */
683  indexList = RelationGetIndexList(relation);
684 
685  foreach(l, indexList)
686  {
687  Oid indexoid = lfirst_oid(l);
688  Relation idxRel;
689  Form_pg_index idxForm;
690  Bitmapset *indexedAttrs;
691  List *idxExprs;
692  List *predExprs;
693  AttrNumber natt;
694  ListCell *el;
695 
696  /*
697  * Extract info from the relation descriptor for the index. Obtain
698  * the same lock type that the executor will ultimately use.
699  *
700  * Let executor complain about !indimmediate case directly, because
701  * enforcement needs to occur there anyway when an inference clause is
702  * omitted.
703  */
704  idxRel = index_open(indexoid, rte->rellockmode);
705  idxForm = idxRel->rd_index;
706 
707  if (!idxForm->indisvalid)
708  goto next;
709 
710  /*
711  * Note that we do not perform a check against indcheckxmin (like e.g.
712  * get_relation_info()) here to eliminate candidates, because
713  * uniqueness checking only cares about the most recently committed
714  * tuple versions.
715  */
716 
717  /*
718  * Look for match on "ON constraint_name" variant, which may not be
719  * unique constraint. This can only be a constraint name.
720  */
721  if (indexOidFromConstraint == idxForm->indexrelid)
722  {
723  if (!idxForm->indisunique && onconflict->action == ONCONFLICT_UPDATE)
724  ereport(ERROR,
725  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
726  errmsg("ON CONFLICT DO UPDATE not supported with exclusion constraints")));
727 
728  results = lappend_oid(results, idxForm->indexrelid);
729  list_free(indexList);
730  index_close(idxRel, NoLock);
731  table_close(relation, NoLock);
732  return results;
733  }
734  else if (indexOidFromConstraint != InvalidOid)
735  {
736  /* No point in further work for index in named constraint case */
737  goto next;
738  }
739 
740  /*
741  * Only considering conventional inference at this point (not named
742  * constraints), so index under consideration can be immediately
743  * skipped if it's not unique
744  */
745  if (!idxForm->indisunique)
746  goto next;
747 
748  /* Build BMS representation of plain (non expression) index attrs */
749  indexedAttrs = NULL;
750  for (natt = 0; natt < idxForm->indnkeyatts; natt++)
751  {
752  int attno = idxRel->rd_index->indkey.values[natt];
753 
754  if (attno != 0)
755  indexedAttrs = bms_add_member(indexedAttrs,
757  }
758 
759  /* Non-expression attributes (if any) must match */
760  if (!bms_equal(indexedAttrs, inferAttrs))
761  goto next;
762 
763  /* Expression attributes (if any) must match */
764  idxExprs = RelationGetIndexExpressions(idxRel);
765  foreach(el, onconflict->arbiterElems)
766  {
767  InferenceElem *elem = (InferenceElem *) lfirst(el);
768 
769  /*
770  * Ensure that collation/opclass aspects of inference expression
771  * element match. Even though this loop is primarily concerned
772  * with matching expressions, it is a convenient point to check
773  * this for both expressions and ordinary (non-expression)
774  * attributes appearing as inference elements.
775  */
776  if (!infer_collation_opclass_match(elem, idxRel, idxExprs))
777  goto next;
778 
779  /*
780  * Plain Vars don't factor into count of expression elements, and
781  * the question of whether or not they satisfy the index
782  * definition has already been considered (they must).
783  */
784  if (IsA(elem->expr, Var))
785  continue;
786 
787  /*
788  * Might as well avoid redundant check in the rare cases where
789  * infer_collation_opclass_match() is required to do real work.
790  * Otherwise, check that element expression appears in cataloged
791  * index definition.
792  */
793  if (elem->infercollid != InvalidOid ||
794  elem->inferopclass != InvalidOid ||
795  list_member(idxExprs, elem->expr))
796  continue;
797 
798  goto next;
799  }
800 
801  /*
802  * Now that all inference elements were matched, ensure that the
803  * expression elements from inference clause are not missing any
804  * cataloged expressions. This does the right thing when unique
805  * indexes redundantly repeat the same attribute, or if attributes
806  * redundantly appear multiple times within an inference clause.
807  */
808  if (list_difference(idxExprs, inferElems) != NIL)
809  goto next;
810 
811  /*
812  * If it's a partial index, its predicate must be implied by the ON
813  * CONFLICT's WHERE clause.
814  */
815  predExprs = RelationGetIndexPredicate(idxRel);
816 
817  if (!predicate_implied_by(predExprs, (List *) onconflict->arbiterWhere, false))
818  goto next;
819 
820  results = lappend_oid(results, idxForm->indexrelid);
821 next:
822  index_close(idxRel, NoLock);
823  }
824 
825  list_free(indexList);
826  table_close(relation, NoLock);
827 
828  if (results == NIL)
829  ereport(ERROR,
830  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
831  errmsg("there is no unique or exclusion constraint matching the ON CONFLICT specification")));
832 
833  return results;
834 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
Query * parse
Definition: pathnodes.h:177
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:133
static int32 next
Definition: blutils.c:213
OnConflictExpr * onConflict
Definition: parsenodes.h:144
int resultRelation
Definition: parsenodes.h:122
static bool infer_collation_opclass_match(InferenceElem *elem, Relation idxRel, List *idxExprs)
Definition: plancat.c:864
int errcode(int sqlerrcode)
Definition: elog.c:608
AttrNumber varattno
Definition: primnodes.h:172
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
unsigned int Oid
Definition: postgres_ext.h:31
Definition: primnodes.h:167
List * lappend_oid(List *list, Oid datum)
Definition: list.c:358
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:4643
List * arbiterElems
Definition: primnodes.h:1515
Form_pg_index rd_index
Definition: rel.h:143
List * rtable
Definition: parsenodes.h:137
#define ERROR
Definition: elog.h:43
bool list_member(const List *list, const void *datum)
Definition: list.c:614
#define NoLock
Definition: lockdefs.h:34
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:4581
#define ereport(elevel, rest)
Definition: elog.h:141
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
List * lappend(List *list, void *datum)
Definition: list.c:322
OnConflictAction action
Definition: primnodes.h:1512
FormData_pg_index * Form_pg_index
Definition: pg_index.h:66
#define InvalidOid
Definition: postgres_ext.h:36
#define lfirst(lc)
Definition: pg_list.h:190
List * list_difference(const List *list1, const List *list2)
Definition: list.c:1077
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:736
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4347
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:152
Node * arbiterWhere
Definition: primnodes.h:1517
int errmsg(const char *fmt,...)
Definition: elog.c:822
void list_free(List *list)
Definition: list.c:1377
Oid get_constraint_index(Oid constraintId)
Definition: pg_depend.c:806
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:39
bool predicate_implied_by(List *predicate_list, List *clause_list, bool weak)
Definition: predtest.c:151
Definition: pg_list.h:50
int16 AttrNumber
Definition: attnum.h:21
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:126
#define lfirst_oid(lc)
Definition: pg_list.h:192
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ join_selectivity()

Selectivity join_selectivity ( PlannerInfo root,
Oid  operatorid,
List args,
Oid  inputcollid,
JoinType  jointype,
SpecialJoinInfo sjinfo 
)

Definition at line 1802 of file plancat.c.

References DatumGetFloat8, elog, ERROR, get_oprjoin(), Int16GetDatum, ObjectIdGetDatum, OidFunctionCall5Coll(), and PointerGetDatum.

Referenced by clause_selectivity(), rowcomparesel(), and test_support_func().

1808 {
1809  RegProcedure oprjoin = get_oprjoin(operatorid);
1810  float8 result;
1811 
1812  /*
1813  * if the oprjoin procedure is missing for whatever reason, use a
1814  * selectivity of 0.5
1815  */
1816  if (!oprjoin)
1817  return (Selectivity) 0.5;
1818 
1819  result = DatumGetFloat8(OidFunctionCall5Coll(oprjoin,
1820  inputcollid,
1821  PointerGetDatum(root),
1822  ObjectIdGetDatum(operatorid),
1823  PointerGetDatum(args),
1824  Int16GetDatum(jointype),
1825  PointerGetDatum(sjinfo)));
1826 
1827  if (result < 0.0 || result > 1.0)
1828  elog(ERROR, "invalid join selectivity: %f", result);
1829 
1830  return (Selectivity) result;
1831 }
RegProcedure get_oprjoin(Oid opno)
Definition: lsyscache.c:1383
#define PointerGetDatum(X)
Definition: postgres.h:556
regproc RegProcedure
Definition: c.h:506
#define Int16GetDatum(X)
Definition: postgres.h:451
double Selectivity
Definition: nodes.h:658
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
double float8
Definition: c.h:492
#define DatumGetFloat8(X)
Definition: postgres.h:728
Datum OidFunctionCall5Coll(Oid functionId, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4, Datum arg5)
Definition: fmgr.c:1454
#define elog(elevel,...)
Definition: elog.h:228

◆ relation_excluded_by_constraints()

bool relation_excluded_by_constraints ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)

Definition at line 1384 of file plancat.c.

References Assert, RelOptInfo::baserestrictinfo, RestrictInfo::clause, constraint_exclusion, CONSTRAINT_EXCLUSION_OFF, CONSTRAINT_EXCLUSION_ON, CONSTRAINT_EXCLUSION_PARTITION, contain_mutable_functions(), DatumGetBool, get_relation_constraints(), RangeTblEntry::inh, INHKIND_NONE, PlannerInfo::inhTargetKind, IS_SIMPLE_REL, IsA, lappend(), lfirst, linitial, list_length(), NIL, PlannerInfo::parse, predicate_refuted_by(), RelOptInfo::relid, RangeTblEntry::relid, RangeTblEntry::relkind, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, Query::resultRelation, RTE_RELATION, and RangeTblEntry::rtekind.

Referenced by set_append_rel_size(), and set_rel_size().

1386 {
1387  bool include_noinherit;
1388  bool include_notnull;
1389  bool include_partition = false;
1390  List *safe_restrictions;
1391  List *constraint_pred;
1392  List *safe_constraints;
1393  ListCell *lc;
1394 
1395  /* As of now, constraint exclusion works only with simple relations. */
1396  Assert(IS_SIMPLE_REL(rel));
1397 
1398  /*
1399  * If there are no base restriction clauses, we have no hope of proving
1400  * anything below, so fall out quickly.
1401  */
1402  if (rel->baserestrictinfo == NIL)
1403  return false;
1404 
1405  /*
1406  * Regardless of the setting of constraint_exclusion, detect
1407  * constant-FALSE-or-NULL restriction clauses. Because const-folding will
1408  * reduce "anything AND FALSE" to just "FALSE", any such case should
1409  * result in exactly one baserestrictinfo entry. This doesn't fire very
1410  * often, but it seems cheap enough to be worth doing anyway. (Without
1411  * this, we'd miss some optimizations that 9.5 and earlier found via much
1412  * more roundabout methods.)
1413  */
1414  if (list_length(rel->baserestrictinfo) == 1)
1415  {
1417  Expr *clause = rinfo->clause;
1418 
1419  if (clause && IsA(clause, Const) &&
1420  (((Const *) clause)->constisnull ||
1421  !DatumGetBool(((Const *) clause)->constvalue)))
1422  return true;
1423  }
1424 
1425  /*
1426  * Skip further tests, depending on constraint_exclusion.
1427  */
1428  switch (constraint_exclusion)
1429  {
1431  /* In 'off' mode, never make any further tests */
1432  return false;
1433 
1435 
1436  /*
1437  * When constraint_exclusion is set to 'partition' we only handle
1438  * appendrel members. Normally, they are RELOPT_OTHER_MEMBER_REL
1439  * relations, but we also consider inherited target relations as
1440  * appendrel members for the purposes of constraint exclusion
1441  * (since, indeed, they were appendrel members earlier in
1442  * inheritance_planner).
1443  *
1444  * In both cases, partition pruning was already applied, so there
1445  * is no need to consider the rel's partition constraints here.
1446  */
1447  if (rel->reloptkind == RELOPT_OTHER_MEMBER_REL ||
1448  (rel->relid == root->parse->resultRelation &&
1449  root->inhTargetKind != INHKIND_NONE))
1450  break; /* appendrel member, so process it */
1451  return false;
1452 
1454 
1455  /*
1456  * In 'on' mode, always apply constraint exclusion. If we are
1457  * considering a baserel that is a partition (i.e., it was
1458  * directly named rather than expanded from a parent table), then
1459  * its partition constraints haven't been considered yet, so
1460  * include them in the processing here.
1461  */
1462  if (rel->reloptkind == RELOPT_BASEREL &&
1463  !(rel->relid == root->parse->resultRelation &&
1464  root->inhTargetKind != INHKIND_NONE))
1465  include_partition = true;
1466  break; /* always try to exclude */
1467  }
1468 
1469  /*
1470  * Check for self-contradictory restriction clauses. We dare not make
1471  * deductions with non-immutable functions, but any immutable clauses that
1472  * are self-contradictory allow us to conclude the scan is unnecessary.
1473  *
1474  * Note: strip off RestrictInfo because predicate_refuted_by() isn't
1475  * expecting to see any in its predicate argument.
1476  */
1477  safe_restrictions = NIL;
1478  foreach(lc, rel->baserestrictinfo)
1479  {
1480  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1481 
1482  if (!contain_mutable_functions((Node *) rinfo->clause))
1483  safe_restrictions = lappend(safe_restrictions, rinfo->clause);
1484  }
1485 
1486  /*
1487  * We can use weak refutation here, since we're comparing restriction
1488  * clauses with restriction clauses.
1489  */
1490  if (predicate_refuted_by(safe_restrictions, safe_restrictions, true))
1491  return true;
1492 
1493  /*
1494  * Only plain relations have constraints, so stop here for other rtekinds.
1495  */
1496  if (rte->rtekind != RTE_RELATION)
1497  return false;
1498 
1499  /*
1500  * If we are scanning just this table, we can use NO INHERIT constraints,
1501  * but not if we're scanning its children too. (Note that partitioned
1502  * tables should never have NO INHERIT constraints; but it's not necessary
1503  * for us to assume that here.)
1504  */
1505  include_noinherit = !rte->inh;
1506 
1507  /*
1508  * Currently, attnotnull constraints must be treated as NO INHERIT unless
1509  * this is a partitioned table. In future we might track their
1510  * inheritance status more accurately, allowing this to be refined.
1511  */
1512  include_notnull = (!rte->inh || rte->relkind == RELKIND_PARTITIONED_TABLE);
1513 
1514  /*
1515  * Fetch the appropriate set of constraint expressions.
1516  */
1517  constraint_pred = get_relation_constraints(root, rte->relid, rel,
1518  include_noinherit,
1519  include_notnull,
1520  include_partition);
1521 
1522  /*
1523  * We do not currently enforce that CHECK constraints contain only
1524  * immutable functions, so it's necessary to check here. We daren't draw
1525  * conclusions from plan-time evaluation of non-immutable functions. Since
1526  * they're ANDed, we can just ignore any mutable constraints in the list,
1527  * and reason about the rest.
1528  */
1529  safe_constraints = NIL;
1530  foreach(lc, constraint_pred)
1531  {
1532  Node *pred = (Node *) lfirst(lc);
1533 
1534  if (!contain_mutable_functions(pred))
1535  safe_constraints = lappend(safe_constraints, pred);
1536  }
1537 
1538  /*
1539  * The constraints are effectively ANDed together, so we can just try to
1540  * refute the entire collection at once. This may allow us to make proofs
1541  * that would fail if we took them individually.
1542  *
1543  * Note: we use rel->baserestrictinfo, not safe_restrictions as might seem
1544  * an obvious optimization. Some of the clauses might be OR clauses that
1545  * have volatile and nonvolatile subclauses, and it's OK to make
1546  * deductions with the nonvolatile parts.
1547  *
1548  * We need strong refutation because we have to prove that the constraints
1549  * would yield false, not just NULL.
1550  */
1551  if (predicate_refuted_by(safe_constraints, rel->baserestrictinfo, false))
1552  return true;
1553 
1554  return false;
1555 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:576
Query * parse
Definition: pathnodes.h:177
RelOptKind reloptkind
Definition: pathnodes.h:638
List * baserestrictinfo
Definition: pathnodes.h:703
int constraint_exclusion
Definition: plancat.c:57
int resultRelation
Definition: parsenodes.h:122
Definition: nodes.h:525
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:614
#define linitial(l)
Definition: pg_list.h:195
bool predicate_refuted_by(List *predicate_list, List *clause_list, bool weak)
Definition: predtest.c:221
#define DatumGetBool(X)
Definition: postgres.h:393
Index relid
Definition: pathnodes.h:669
List * lappend(List *list, void *datum)
Definition: list.c:322
Expr * clause
Definition: pathnodes.h:1943
#define Assert(condition)
Definition: c.h:733
#define lfirst(lc)
Definition: pg_list.h:190
InheritanceKind inhTargetKind
Definition: pathnodes.h:340
static int list_length(const List *l)
Definition: pg_list.h:169
RTEKind rtekind
Definition: parsenodes.h:974
static List * get_relation_constraints(PlannerInfo *root, Oid relationObjectId, RelOptInfo *rel, bool include_noinherit, bool include_notnull, bool include_partition)
Definition: plancat.c:1169
bool contain_mutable_functions(Node *clause)
Definition: clauses.c:645
Definition: pg_list.h:50

◆ restriction_selectivity()

Selectivity restriction_selectivity ( PlannerInfo root,
Oid  operatorid,
List args,
Oid  inputcollid,
int  varRelid 
)

Definition at line 1763 of file plancat.c.

References DatumGetFloat8, elog, ERROR, get_oprrest(), Int32GetDatum, ObjectIdGetDatum, OidFunctionCall4Coll(), and PointerGetDatum.

Referenced by clause_selectivity(), rowcomparesel(), and test_support_func().

1768 {
1769  RegProcedure oprrest = get_oprrest(operatorid);
1770  float8 result;
1771 
1772  /*
1773  * if the oprrest procedure is missing for whatever reason, use a
1774  * selectivity of 0.5
1775  */
1776  if (!oprrest)
1777  return (Selectivity) 0.5;
1778 
1779  result = DatumGetFloat8(OidFunctionCall4Coll(oprrest,
1780  inputcollid,
1781  PointerGetDatum(root),
1782  ObjectIdGetDatum(operatorid),
1783  PointerGetDatum(args),
1784  Int32GetDatum(varRelid)));
1785 
1786  if (result < 0.0 || result > 1.0)
1787  elog(ERROR, "invalid restriction selectivity: %f", result);
1788 
1789  return (Selectivity) result;
1790 }
#define PointerGetDatum(X)
Definition: postgres.h:556
regproc RegProcedure
Definition: c.h:506
double Selectivity
Definition: nodes.h:658
#define ObjectIdGetDatum(X)
Definition: postgres.h:507
#define ERROR
Definition: elog.h:43
double float8
Definition: c.h:492
RegProcedure get_oprrest(Oid opno)
Definition: lsyscache.c:1359
#define DatumGetFloat8(X)
Definition: postgres.h:728
Datum OidFunctionCall4Coll(Oid functionId, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4)
Definition: fmgr.c:1443
#define Int32GetDatum(X)
Definition: postgres.h:479
#define elog(elevel,...)
Definition: elog.h:228

Variable Documentation

◆ get_relation_info_hook

PGDLLIMPORT get_relation_info_hook_type get_relation_info_hook

Definition at line 60 of file plancat.c.

Referenced by get_relation_info().