PostgreSQL Source Code  git master
All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros Pages
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)
 
Bitmapsetget_dependent_generated_columns (PlannerInfo *root, Index rti, Bitmapset *target_cols)
 

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 2097 of file plancat.c.

2099 {
2100  HeapTuple proctup;
2101  Form_pg_proc procform;
2102 
2103  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2104  if (!HeapTupleIsValid(proctup))
2105  elog(ERROR, "cache lookup failed for function %u", funcid);
2106  procform = (Form_pg_proc) GETSTRUCT(proctup);
2107 
2108  if (OidIsValid(procform->prosupport))
2109  {
2110  SupportRequestCost req;
2111  SupportRequestCost *sresult;
2112 
2113  req.type = T_SupportRequestCost;
2114  req.root = root;
2115  req.funcid = funcid;
2116  req.node = node;
2117 
2118  /* Initialize cost fields so that support function doesn't have to */
2119  req.startup = 0;
2120  req.per_tuple = 0;
2121 
2122  sresult = (SupportRequestCost *)
2123  DatumGetPointer(OidFunctionCall1(procform->prosupport,
2124  PointerGetDatum(&req)));
2125 
2126  if (sresult == &req)
2127  {
2128  /* Success, so accumulate support function's estimate into *cost */
2129  cost->startup += req.startup;
2130  cost->per_tuple += req.per_tuple;
2131  ReleaseSysCache(proctup);
2132  return;
2133  }
2134  }
2135 
2136  /* No support function, or it failed, so rely on procost */
2137  cost->per_tuple += procform->procost * cpu_operator_cost;
2138 
2139  ReleaseSysCache(proctup);
2140 }
#define OidIsValid(objectId)
Definition: c.h:754
double cpu_operator_cost
Definition: costsize.c:134
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:225
#define OidFunctionCall1(functionId, arg1)
Definition: fmgr.h:679
#define HeapTupleIsValid(tuple)
Definition: htup.h:78
#define GETSTRUCT(TUP)
Definition: htup_details.h:653
FormData_pg_proc * Form_pg_proc
Definition: pg_proc.h:136
static Datum PointerGetDatum(const void *X)
Definition: postgres.h:322
static Datum ObjectIdGetDatum(Oid X)
Definition: postgres.h:252
static Pointer DatumGetPointer(Datum X)
Definition: postgres.h:312
tree ctl root
Definition: radixtree.h:1886
Cost per_tuple
Definition: pathnodes.h:48
Cost startup
Definition: pathnodes.h:47
struct PlannerInfo * root
Definition: supportnodes.h:136
void ReleaseSysCache(HeapTuple tuple)
Definition: syscache.c:269
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:221

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

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

◆ build_physical_tlist()

List* build_physical_tlist ( PlannerInfo root,
RelOptInfo rel 
)

Definition at line 1772 of file plancat.c.

1773 {
1774  List *tlist = NIL;
1775  Index varno = rel->relid;
1776  RangeTblEntry *rte = planner_rt_fetch(varno, root);
1777  Relation relation;
1778  Query *subquery;
1779  Var *var;
1780  ListCell *l;
1781  int attrno,
1782  numattrs;
1783  List *colvars;
1784 
1785  switch (rte->rtekind)
1786  {
1787  case RTE_RELATION:
1788  /* Assume we already have adequate lock */
1789  relation = table_open(rte->relid, NoLock);
1790 
1791  numattrs = RelationGetNumberOfAttributes(relation);
1792  for (attrno = 1; attrno <= numattrs; attrno++)
1793  {
1794  Form_pg_attribute att_tup = TupleDescAttr(relation->rd_att,
1795  attrno - 1);
1796 
1797  if (att_tup->attisdropped || att_tup->atthasmissing)
1798  {
1799  /* found a dropped or missing col, so punt */
1800  tlist = NIL;
1801  break;
1802  }
1803 
1804  var = makeVar(varno,
1805  attrno,
1806  att_tup->atttypid,
1807  att_tup->atttypmod,
1808  att_tup->attcollation,
1809  0);
1810 
1811  tlist = lappend(tlist,
1812  makeTargetEntry((Expr *) var,
1813  attrno,
1814  NULL,
1815  false));
1816  }
1817 
1818  table_close(relation, NoLock);
1819  break;
1820 
1821  case RTE_SUBQUERY:
1822  subquery = rte->subquery;
1823  foreach(l, subquery->targetList)
1824  {
1825  TargetEntry *tle = (TargetEntry *) lfirst(l);
1826 
1827  /*
1828  * A resjunk column of the subquery can be reflected as
1829  * resjunk in the physical tlist; we need not punt.
1830  */
1831  var = makeVarFromTargetEntry(varno, tle);
1832 
1833  tlist = lappend(tlist,
1834  makeTargetEntry((Expr *) var,
1835  tle->resno,
1836  NULL,
1837  tle->resjunk));
1838  }
1839  break;
1840 
1841  case RTE_FUNCTION:
1842  case RTE_TABLEFUNC:
1843  case RTE_VALUES:
1844  case RTE_CTE:
1845  case RTE_NAMEDTUPLESTORE:
1846  case RTE_RESULT:
1847  /* Not all of these can have dropped cols, but share code anyway */
1848  expandRTE(rte, varno, 0, -1, true /* include dropped */ ,
1849  NULL, &colvars);
1850  foreach(l, colvars)
1851  {
1852  var = (Var *) lfirst(l);
1853 
1854  /*
1855  * A non-Var in expandRTE's output means a dropped column;
1856  * must punt.
1857  */
1858  if (!IsA(var, Var))
1859  {
1860  tlist = NIL;
1861  break;
1862  }
1863 
1864  tlist = lappend(tlist,
1865  makeTargetEntry((Expr *) var,
1866  var->varattno,
1867  NULL,
1868  false));
1869  }
1870  break;
1871 
1872  default:
1873  /* caller error */
1874  elog(ERROR, "unsupported RTE kind %d in build_physical_tlist",
1875  (int) rte->rtekind);
1876  break;
1877  }
1878 
1879  return tlist;
1880 }
unsigned int Index
Definition: c.h:593
List * lappend(List *list, void *datum)
Definition: list.c:339
#define NoLock
Definition: lockdefs.h:34
Var * makeVarFromTargetEntry(int varno, TargetEntry *tle)
Definition: makefuncs.c:105
TargetEntry * makeTargetEntry(Expr *expr, AttrNumber resno, char *resname, bool resjunk)
Definition: makefuncs.c:240
Var * makeVar(int varno, AttrNumber varattno, Oid vartype, int32 vartypmod, Oid varcollid, Index varlevelsup)
Definition: makefuncs.c:66
#define IsA(nodeptr, _type_)
Definition: nodes.h:158
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
@ RTE_CTE
Definition: parsenodes.h:1023
@ RTE_NAMEDTUPLESTORE
Definition: parsenodes.h:1024
@ RTE_VALUES
Definition: parsenodes.h:1022
@ RTE_SUBQUERY
Definition: parsenodes.h:1018
@ RTE_RESULT
Definition: parsenodes.h:1025
@ RTE_FUNCTION
Definition: parsenodes.h:1020
@ RTE_TABLEFUNC
Definition: parsenodes.h:1021
@ RTE_RELATION
Definition: parsenodes.h:1017
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:570
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:209
#define lfirst(lc)
Definition: pg_list.h:172
#define NIL
Definition: pg_list.h:68
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:511
Definition: pg_list.h:54
List * targetList
Definition: parsenodes.h:193
Query * subquery
Definition: parsenodes.h:1104
RTEKind rtekind
Definition: parsenodes.h:1047
Index relid
Definition: pathnodes.h:918
TupleDesc rd_att
Definition: rel.h:112
AttrNumber resno
Definition: primnodes.h:2192
Definition: primnodes.h:248
void table_close(Relation relation, LOCKMODE lockmode)
Definition: table.c:126
Relation table_open(Oid relationId, LOCKMODE lockmode)
Definition: table.c:40
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92

References elog, ERROR, expandRTE(), IsA, lappend(), lfirst, makeTargetEntry(), makeVar(), makeVarFromTargetEntry(), NIL, NoLock, planner_rt_fetch, RelationData::rd_att, RelationGetNumberOfAttributes, RangeTblEntry::relid, RelOptInfo::relid, TargetEntry::resno, root, 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().

◆ estimate_rel_size()

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

Definition at line 1066 of file plancat.c.

1068 {
1069  BlockNumber curpages;
1070  BlockNumber relpages;
1071  double reltuples;
1072  BlockNumber relallvisible;
1073  double density;
1074 
1075  if (RELKIND_HAS_TABLE_AM(rel->rd_rel->relkind))
1076  {
1077  table_relation_estimate_size(rel, attr_widths, pages, tuples,
1078  allvisfrac);
1079  }
1080  else if (rel->rd_rel->relkind == RELKIND_INDEX)
1081  {
1082  /*
1083  * XXX: It'd probably be good to move this into a callback, individual
1084  * index types e.g. know if they have a metapage.
1085  */
1086 
1087  /* it has storage, ok to call the smgr */
1088  curpages = RelationGetNumberOfBlocks(rel);
1089 
1090  /* report estimated # pages */
1091  *pages = curpages;
1092  /* quick exit if rel is clearly empty */
1093  if (curpages == 0)
1094  {
1095  *tuples = 0;
1096  *allvisfrac = 0;
1097  return;
1098  }
1099 
1100  /* coerce values in pg_class to more desirable types */
1101  relpages = (BlockNumber) rel->rd_rel->relpages;
1102  reltuples = (double) rel->rd_rel->reltuples;
1103  relallvisible = (BlockNumber) rel->rd_rel->relallvisible;
1104 
1105  /*
1106  * Discount the metapage while estimating the number of tuples. This
1107  * is a kluge because it assumes more than it ought to about index
1108  * structure. Currently it's OK for btree, hash, and GIN indexes but
1109  * suspect for GiST indexes.
1110  */
1111  if (relpages > 0)
1112  {
1113  curpages--;
1114  relpages--;
1115  }
1116 
1117  /* estimate number of tuples from previous tuple density */
1118  if (reltuples >= 0 && relpages > 0)
1119  density = reltuples / (double) relpages;
1120  else
1121  {
1122  /*
1123  * If we have no data because the relation was never vacuumed,
1124  * estimate tuple width from attribute datatypes. We assume here
1125  * that the pages are completely full, which is OK for tables
1126  * (since they've presumably not been VACUUMed yet) but is
1127  * probably an overestimate for indexes. Fortunately
1128  * get_relation_info() can clamp the overestimate to the parent
1129  * table's size.
1130  *
1131  * Note: this code intentionally disregards alignment
1132  * considerations, because (a) that would be gilding the lily
1133  * considering how crude the estimate is, and (b) it creates
1134  * platform dependencies in the default plans which are kind of a
1135  * headache for regression testing.
1136  *
1137  * XXX: Should this logic be more index specific?
1138  */
1139  int32 tuple_width;
1140 
1141  tuple_width = get_rel_data_width(rel, attr_widths);
1142  tuple_width += MAXALIGN(SizeofHeapTupleHeader);
1143  tuple_width += sizeof(ItemIdData);
1144  /* note: integer division is intentional here */
1145  density = (BLCKSZ - SizeOfPageHeaderData) / tuple_width;
1146  }
1147  *tuples = rint(density * (double) curpages);
1148 
1149  /*
1150  * We use relallvisible as-is, rather than scaling it up like we do
1151  * for the pages and tuples counts, on the theory that any pages added
1152  * since the last VACUUM are most likely not marked all-visible. But
1153  * costsize.c wants it converted to a fraction.
1154  */
1155  if (relallvisible == 0 || curpages <= 0)
1156  *allvisfrac = 0;
1157  else if ((double) relallvisible >= curpages)
1158  *allvisfrac = 1;
1159  else
1160  *allvisfrac = (double) relallvisible / curpages;
1161  }
1162  else
1163  {
1164  /*
1165  * Just use whatever's in pg_class. This covers foreign tables,
1166  * sequences, and also relkinds without storage (shouldn't get here?);
1167  * see initializations in AddNewRelationTuple(). Note that FDW must
1168  * cope if reltuples is -1!
1169  */
1170  *pages = rel->rd_rel->relpages;
1171  *tuples = rel->rd_rel->reltuples;
1172  *allvisfrac = 0;
1173  }
1174 }
uint32 BlockNumber
Definition: block.h:31
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:273
#define SizeOfPageHeaderData
Definition: bufpage.h:216
#define MAXALIGN(LEN)
Definition: c.h:790
signed int int32
Definition: c.h:482
#define SizeofHeapTupleHeader
Definition: htup_details.h:185
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:76
struct ItemIdData ItemIdData
int32 get_rel_data_width(Relation rel, int32 *attr_widths)
Definition: plancat.c:1191
Form_pg_class rd_rel
Definition: rel.h:111
static void table_relation_estimate_size(Relation rel, int32 *attr_widths, BlockNumber *pages, double *tuples, double *allvisfrac)
Definition: tableam.h:1946

References get_rel_data_width(), if(), MAXALIGN, RelationData::rd_rel, RelationGetNumberOfBlocks, SizeofHeapTupleHeader, SizeOfPageHeaderData, and table_relation_estimate_size().

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

◆ 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 2035 of file plancat.c.

2043 {
2044  RegProcedure prosupport = get_func_support(funcid);
2046  SupportRequestSelectivity *sresult;
2047 
2048  /*
2049  * If no support function is provided, use our historical default
2050  * estimate, 0.3333333. This seems a pretty unprincipled choice, but
2051  * Postgres has been using that estimate for function calls since 1992.
2052  * The hoariness of this behavior suggests that we should not be in too
2053  * much hurry to use another value.
2054  */
2055  if (!prosupport)
2056  return (Selectivity) 0.3333333;
2057 
2058  req.type = T_SupportRequestSelectivity;
2059  req.root = root;
2060  req.funcid = funcid;
2061  req.args = args;
2062  req.inputcollid = inputcollid;
2063  req.is_join = is_join;
2064  req.varRelid = varRelid;
2065  req.jointype = jointype;
2066  req.sjinfo = sjinfo;
2067  req.selectivity = -1; /* to catch failure to set the value */
2068 
2069  sresult = (SupportRequestSelectivity *)
2070  DatumGetPointer(OidFunctionCall1(prosupport,
2071  PointerGetDatum(&req)));
2072 
2073  /* If support function fails, use default */
2074  if (sresult != &req)
2075  return (Selectivity) 0.3333333;
2076 
2077  if (req.selectivity < 0.0 || req.selectivity > 1.0)
2078  elog(ERROR, "invalid function selectivity: %f", req.selectivity);
2079 
2080  return (Selectivity) req.selectivity;
2081 }
regproc RegProcedure
Definition: c.h:629
RegProcedure get_func_support(Oid funcid)
Definition: lsyscache.c:1858
double Selectivity
Definition: nodes.h:250
struct PlannerInfo * root
Definition: supportnodes.h:96
struct SpecialJoinInfo * sjinfo
Definition: supportnodes.h:103

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

Referenced by clause_selectivity_ext().

◆ get_dependent_generated_columns()

Bitmapset* get_dependent_generated_columns ( PlannerInfo root,
Index  rti,
Bitmapset target_cols 
)

Definition at line 2325 of file plancat.c.

2327 {
2328  Bitmapset *dependentCols = NULL;
2329  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2330  Relation relation;
2331  TupleDesc tupdesc;
2332  TupleConstr *constr;
2333 
2334  /* Assume we already have adequate lock */
2335  relation = table_open(rte->relid, NoLock);
2336 
2337  tupdesc = RelationGetDescr(relation);
2338  constr = tupdesc->constr;
2339 
2340  if (constr && constr->has_generated_stored)
2341  {
2342  for (int i = 0; i < constr->num_defval; i++)
2343  {
2344  AttrDefault *defval = &constr->defval[i];
2345  Node *expr;
2346  Bitmapset *attrs_used = NULL;
2347 
2348  /* skip if not generated column */
2349  if (!TupleDescAttr(tupdesc, defval->adnum - 1)->attgenerated)
2350  continue;
2351 
2352  /* identify columns this generated column depends on */
2353  expr = stringToNode(defval->adbin);
2354  pull_varattnos(expr, 1, &attrs_used);
2355 
2356  if (bms_overlap(target_cols, attrs_used))
2357  dependentCols = bms_add_member(dependentCols,
2359  }
2360  }
2361 
2362  table_close(relation, NoLock);
2363 
2364  return dependentCols;
2365 }
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:815
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:582
int i
Definition: isn.c:72
void * stringToNode(const char *str)
Definition: read.c:90
#define RelationGetDescr(relation)
Definition: rel.h:531
AttrNumber adnum
Definition: tupdesc.h:24
char * adbin
Definition: tupdesc.h:25
Definition: nodes.h:129
AttrDefault * defval
Definition: tupdesc.h:39
bool has_generated_stored
Definition: tupdesc.h:45
uint16 num_defval
Definition: tupdesc.h:42
TupleConstr * constr
Definition: tupdesc.h:85
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
void pull_varattnos(Node *node, Index varno, Bitmapset **varattnos)
Definition: var.c:295

References AttrDefault::adbin, AttrDefault::adnum, bms_add_member(), bms_overlap(), TupleDescData::constr, TupleConstr::defval, FirstLowInvalidHeapAttributeNumber, TupleConstr::has_generated_stored, i, NoLock, TupleConstr::num_defval, planner_rt_fetch, pull_varattnos(), RelationGetDescr, RangeTblEntry::relid, root, stringToNode(), table_close(), table_open(), and TupleDescAttr.

Referenced by get_rel_all_updated_cols().

◆ get_function_rows()

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

Definition at line 2158 of file plancat.c.

2159 {
2160  HeapTuple proctup;
2161  Form_pg_proc procform;
2162  double result;
2163 
2164  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2165  if (!HeapTupleIsValid(proctup))
2166  elog(ERROR, "cache lookup failed for function %u", funcid);
2167  procform = (Form_pg_proc) GETSTRUCT(proctup);
2168 
2169  Assert(procform->proretset); /* else caller error */
2170 
2171  if (OidIsValid(procform->prosupport))
2172  {
2173  SupportRequestRows req;
2174  SupportRequestRows *sresult;
2175 
2176  req.type = T_SupportRequestRows;
2177  req.root = root;
2178  req.funcid = funcid;
2179  req.node = node;
2180 
2181  req.rows = 0; /* just for sanity */
2182 
2183  sresult = (SupportRequestRows *)
2184  DatumGetPointer(OidFunctionCall1(procform->prosupport,
2185  PointerGetDatum(&req)));
2186 
2187  if (sresult == &req)
2188  {
2189  /* Success */
2190  ReleaseSysCache(proctup);
2191  return req.rows;
2192  }
2193  }
2194 
2195  /* No support function, or it failed, so rely on prorows */
2196  result = procform->prorows;
2197 
2198  ReleaseSysCache(proctup);
2199 
2200  return result;
2201 }
#define Assert(condition)
Definition: c.h:837
struct PlannerInfo * root
Definition: supportnodes.h:163

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

Referenced by expression_returns_set_rows().

◆ get_rel_data_width()

int32 get_rel_data_width ( Relation  rel,
int32 attr_widths 
)

Definition at line 1191 of file plancat.c.

1192 {
1193  int64 tuple_width = 0;
1194  int i;
1195 
1196  for (i = 1; i <= RelationGetNumberOfAttributes(rel); i++)
1197  {
1198  Form_pg_attribute att = TupleDescAttr(rel->rd_att, i - 1);
1199  int32 item_width;
1200 
1201  if (att->attisdropped)
1202  continue;
1203 
1204  /* use previously cached data, if any */
1205  if (attr_widths != NULL && attr_widths[i] > 0)
1206  {
1207  tuple_width += attr_widths[i];
1208  continue;
1209  }
1210 
1211  /* This should match set_rel_width() in costsize.c */
1212  item_width = get_attavgwidth(RelationGetRelid(rel), i);
1213  if (item_width <= 0)
1214  {
1215  item_width = get_typavgwidth(att->atttypid, att->atttypmod);
1216  Assert(item_width > 0);
1217  }
1218  if (attr_widths != NULL)
1219  attr_widths[i] = item_width;
1220  tuple_width += item_width;
1221  }
1222 
1223  return clamp_width_est(tuple_width);
1224 }
int32 clamp_width_est(int64 tuple_width)
Definition: costsize.c:242
int32 get_attavgwidth(Oid relid, AttrNumber attnum)
Definition: lsyscache.c:3158
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition: lsyscache.c:2578
#define RelationGetRelid(relation)
Definition: rel.h:505

References Assert, clamp_width_est(), 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().

◆ get_relation_data_width()

int32 get_relation_data_width ( Oid  relid,
int32 attr_widths 
)

Definition at line 1233 of file plancat.c.

1234 {
1235  int32 result;
1236  Relation relation;
1237 
1238  /* As above, assume relation is already locked */
1239  relation = table_open(relid, NoLock);
1240 
1241  result = get_rel_data_width(relation, attr_widths);
1242 
1243  table_close(relation, NoLock);
1244 
1245  return result;
1246 }

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

Referenced by plan_cluster_use_sort(), and set_rel_width().

◆ get_relation_info()

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

Definition at line 116 of file plancat.c.

118 {
119  Index varno = rel->relid;
120  Relation relation;
121  bool hasindex;
122  List *indexinfos = NIL;
123 
124  /*
125  * We need not lock the relation since it was already locked, either by
126  * the rewriter or when expand_inherited_rtentry() added it to the query's
127  * rangetable.
128  */
129  relation = table_open(relationObjectId, NoLock);
130 
131  /*
132  * Relations without a table AM can be used in a query only if they are of
133  * special-cased relkinds. This check prevents us from crashing later if,
134  * for example, a view's ON SELECT rule has gone missing. Note that
135  * table_open() already rejected indexes and composite types; spell the
136  * error the same way it does.
137  */
138  if (!relation->rd_tableam)
139  {
140  if (!(relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE ||
141  relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE))
142  ereport(ERROR,
143  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
144  errmsg("cannot open relation \"%s\"",
145  RelationGetRelationName(relation)),
146  errdetail_relkind_not_supported(relation->rd_rel->relkind)));
147  }
148 
149  /* Temporary and unlogged relations are inaccessible during recovery. */
150  if (!RelationIsPermanent(relation) && RecoveryInProgress())
151  ereport(ERROR,
152  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
153  errmsg("cannot access temporary or unlogged relations during recovery")));
154 
156  rel->max_attr = RelationGetNumberOfAttributes(relation);
157  rel->reltablespace = RelationGetForm(relation)->reltablespace;
158 
159  Assert(rel->max_attr >= rel->min_attr);
160  rel->attr_needed = (Relids *)
161  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
162  rel->attr_widths = (int32 *)
163  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
164 
165  /*
166  * Record which columns are defined as NOT NULL. We leave this
167  * unpopulated for non-partitioned inheritance parent relations as it's
168  * ambiguous as to what it means. Some child tables may have a NOT NULL
169  * constraint for a column while others may not. We could work harder and
170  * build a unioned set of all child relations notnullattnums, but there's
171  * currently no need. The RelOptInfo corresponding to the !inh
172  * RangeTblEntry does get populated.
173  */
174  if (!inhparent || relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
175  {
176  for (int i = 0; i < relation->rd_att->natts; i++)
177  {
178  Form_pg_attribute attr = TupleDescAttr(relation->rd_att, i);
179 
180  if (attr->attnotnull)
181  {
183  attr->attnum);
184 
185  /*
186  * Per RemoveAttributeById(), dropped columns will have their
187  * attnotnull unset, so we needn't check for dropped columns
188  * in the above condition.
189  */
190  Assert(!attr->attisdropped);
191  }
192  }
193  }
194 
195  /*
196  * Estimate relation size --- unless it's an inheritance parent, in which
197  * case the size we want is not the rel's own size but the size of its
198  * inheritance tree. That will be computed in set_append_rel_size().
199  */
200  if (!inhparent)
201  estimate_rel_size(relation, rel->attr_widths - rel->min_attr,
202  &rel->pages, &rel->tuples, &rel->allvisfrac);
203 
204  /* Retrieve the parallel_workers reloption, or -1 if not set. */
206 
207  /*
208  * Make list of indexes. Ignore indexes on system catalogs if told to.
209  * Don't bother with indexes from traditional inheritance parents. For
210  * partitioned tables, we need a list of at least unique indexes as these
211  * serve as unique proofs for certain planner optimizations. However,
212  * let's not discriminate here and just record all partitioned indexes
213  * whether they're unique indexes or not.
214  */
215  if ((inhparent && relation->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
216  || (IgnoreSystemIndexes && IsSystemRelation(relation)))
217  hasindex = false;
218  else
219  hasindex = relation->rd_rel->relhasindex;
220 
221  if (hasindex)
222  {
223  List *indexoidlist;
224  LOCKMODE lmode;
225  ListCell *l;
226 
227  indexoidlist = RelationGetIndexList(relation);
228 
229  /*
230  * For each index, we get the same type of lock that the executor will
231  * need, and do not release it. This saves a couple of trips to the
232  * shared lock manager while not creating any real loss of
233  * concurrency, because no schema changes could be happening on the
234  * index while we hold lock on the parent rel, and no lock type used
235  * for queries blocks any other kind of index operation.
236  */
237  lmode = root->simple_rte_array[varno]->rellockmode;
238 
239  foreach(l, indexoidlist)
240  {
241  Oid indexoid = lfirst_oid(l);
242  Relation indexRelation;
244  IndexAmRoutine *amroutine = NULL;
245  IndexOptInfo *info;
246  int ncolumns,
247  nkeycolumns;
248  int i;
249 
250  /*
251  * Extract info from the relation descriptor for the index.
252  */
253  indexRelation = index_open(indexoid, lmode);
254  index = indexRelation->rd_index;
255 
256  /*
257  * Ignore invalid indexes, since they can't safely be used for
258  * queries. Note that this is OK because the data structure we
259  * are constructing is only used by the planner --- the executor
260  * still needs to insert into "invalid" indexes, if they're marked
261  * indisready.
262  */
263  if (!index->indisvalid)
264  {
265  index_close(indexRelation, NoLock);
266  continue;
267  }
268 
269  /*
270  * If the index is valid, but cannot yet be used, ignore it; but
271  * mark the plan we are generating as transient. See
272  * src/backend/access/heap/README.HOT for discussion.
273  */
274  if (index->indcheckxmin &&
277  {
278  root->glob->transientPlan = true;
279  index_close(indexRelation, NoLock);
280  continue;
281  }
282 
283  info = makeNode(IndexOptInfo);
284 
285  info->indexoid = index->indexrelid;
286  info->reltablespace =
287  RelationGetForm(indexRelation)->reltablespace;
288  info->rel = rel;
289  info->ncolumns = ncolumns = index->indnatts;
290  info->nkeycolumns = nkeycolumns = index->indnkeyatts;
291 
292  info->indexkeys = (int *) palloc(sizeof(int) * ncolumns);
293  info->indexcollations = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
294  info->opfamily = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
295  info->opcintype = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
296  info->canreturn = (bool *) palloc(sizeof(bool) * ncolumns);
297 
298  for (i = 0; i < ncolumns; i++)
299  {
300  info->indexkeys[i] = index->indkey.values[i];
301  info->canreturn[i] = index_can_return(indexRelation, i + 1);
302  }
303 
304  for (i = 0; i < nkeycolumns; i++)
305  {
306  info->opfamily[i] = indexRelation->rd_opfamily[i];
307  info->opcintype[i] = indexRelation->rd_opcintype[i];
308  info->indexcollations[i] = indexRelation->rd_indcollation[i];
309  }
310 
311  info->relam = indexRelation->rd_rel->relam;
312 
313  /*
314  * We don't have an AM for partitioned indexes, so we'll just
315  * NULLify the AM related fields for those.
316  */
317  if (indexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
318  {
319  /* We copy just the fields we need, not all of rd_indam */
320  amroutine = indexRelation->rd_indam;
321  info->amcanorderbyop = amroutine->amcanorderbyop;
322  info->amoptionalkey = amroutine->amoptionalkey;
323  info->amsearcharray = amroutine->amsearcharray;
324  info->amsearchnulls = amroutine->amsearchnulls;
325  info->amcanparallel = amroutine->amcanparallel;
326  info->amhasgettuple = (amroutine->amgettuple != NULL);
327  info->amhasgetbitmap = amroutine->amgetbitmap != NULL &&
328  relation->rd_tableam->scan_bitmap_next_block != NULL;
329  info->amcanmarkpos = (amroutine->ammarkpos != NULL &&
330  amroutine->amrestrpos != NULL);
331  info->amcostestimate = amroutine->amcostestimate;
332  Assert(info->amcostestimate != NULL);
333 
334  /* Fetch index opclass options */
335  info->opclassoptions = RelationGetIndexAttOptions(indexRelation, true);
336 
337  /*
338  * Fetch the ordering information for the index, if any.
339  */
340  if (info->relam == BTREE_AM_OID)
341  {
342  /*
343  * If it's a btree index, we can use its opfamily OIDs
344  * directly as the sort ordering opfamily OIDs.
345  */
346  Assert(amroutine->amcanorder);
347 
348  info->sortopfamily = info->opfamily;
349  info->reverse_sort = (bool *) palloc(sizeof(bool) * nkeycolumns);
350  info->nulls_first = (bool *) palloc(sizeof(bool) * nkeycolumns);
351 
352  for (i = 0; i < nkeycolumns; i++)
353  {
354  int16 opt = indexRelation->rd_indoption[i];
355 
356  info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
357  info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
358  }
359  }
360  else if (amroutine->amcanorder)
361  {
362  /*
363  * Otherwise, identify the corresponding btree opfamilies
364  * by trying to map this index's "<" operators into btree.
365  * Since "<" uniquely defines the behavior of a sort
366  * order, this is a sufficient test.
367  *
368  * XXX This method is rather slow and also requires the
369  * undesirable assumption that the other index AM numbers
370  * its strategies the same as btree. It'd be better to
371  * have a way to explicitly declare the corresponding
372  * btree opfamily for each opfamily of the other index
373  * type. But given the lack of current or foreseeable
374  * amcanorder index types, it's not worth expending more
375  * effort on now.
376  */
377  info->sortopfamily = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
378  info->reverse_sort = (bool *) palloc(sizeof(bool) * nkeycolumns);
379  info->nulls_first = (bool *) palloc(sizeof(bool) * nkeycolumns);
380 
381  for (i = 0; i < nkeycolumns; i++)
382  {
383  int16 opt = indexRelation->rd_indoption[i];
384  Oid ltopr;
385  Oid btopfamily;
386  Oid btopcintype;
387  int16 btstrategy;
388 
389  info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
390  info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
391 
392  ltopr = get_opfamily_member(info->opfamily[i],
393  info->opcintype[i],
394  info->opcintype[i],
396  if (OidIsValid(ltopr) &&
398  &btopfamily,
399  &btopcintype,
400  &btstrategy) &&
401  btopcintype == info->opcintype[i] &&
402  btstrategy == BTLessStrategyNumber)
403  {
404  /* Successful mapping */
405  info->sortopfamily[i] = btopfamily;
406  }
407  else
408  {
409  /* Fail ... quietly treat index as unordered */
410  info->sortopfamily = NULL;
411  info->reverse_sort = NULL;
412  info->nulls_first = NULL;
413  break;
414  }
415  }
416  }
417  else
418  {
419  info->sortopfamily = NULL;
420  info->reverse_sort = NULL;
421  info->nulls_first = NULL;
422  }
423  }
424  else
425  {
426  info->amcanorderbyop = false;
427  info->amoptionalkey = false;
428  info->amsearcharray = false;
429  info->amsearchnulls = false;
430  info->amcanparallel = false;
431  info->amhasgettuple = false;
432  info->amhasgetbitmap = false;
433  info->amcanmarkpos = false;
434  info->amcostestimate = NULL;
435 
436  info->sortopfamily = NULL;
437  info->reverse_sort = NULL;
438  info->nulls_first = NULL;
439  }
440 
441  /*
442  * Fetch the index expressions and predicate, if any. We must
443  * modify the copies we obtain from the relcache to have the
444  * correct varno for the parent relation, so that they match up
445  * correctly against qual clauses.
446  */
447  info->indexprs = RelationGetIndexExpressions(indexRelation);
448  info->indpred = RelationGetIndexPredicate(indexRelation);
449  if (info->indexprs && varno != 1)
450  ChangeVarNodes((Node *) info->indexprs, 1, varno, 0);
451  if (info->indpred && varno != 1)
452  ChangeVarNodes((Node *) info->indpred, 1, varno, 0);
453 
454  /* Build targetlist using the completed indexprs data */
455  info->indextlist = build_index_tlist(root, info, relation);
456 
457  info->indrestrictinfo = NIL; /* set later, in indxpath.c */
458  info->predOK = false; /* set later, in indxpath.c */
459  info->unique = index->indisunique;
460  info->immediate = index->indimmediate;
461  info->hypothetical = false;
462 
463  /*
464  * Estimate the index size. If it's not a partial index, we lock
465  * the number-of-tuples estimate to equal the parent table; if it
466  * is partial then we have to use the same methods as we would for
467  * a table, except we can be sure that the index is not larger
468  * than the table. We must ignore partitioned indexes here as
469  * there are not physical indexes.
470  */
471  if (indexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
472  {
473  if (info->indpred == NIL)
474  {
475  info->pages = RelationGetNumberOfBlocks(indexRelation);
476  info->tuples = rel->tuples;
477  }
478  else
479  {
480  double allvisfrac; /* dummy */
481 
482  estimate_rel_size(indexRelation, NULL,
483  &info->pages, &info->tuples, &allvisfrac);
484  if (info->tuples > rel->tuples)
485  info->tuples = rel->tuples;
486  }
487 
488  /*
489  * Get tree height while we have the index open
490  */
491  if (amroutine->amgettreeheight)
492  {
493  info->tree_height = amroutine->amgettreeheight(indexRelation);
494  }
495  else
496  {
497  /* For other index types, just set it to "unknown" for now */
498  info->tree_height = -1;
499  }
500  }
501  else
502  {
503  /* Zero these out for partitioned indexes */
504  info->pages = 0;
505  info->tuples = 0.0;
506  info->tree_height = -1;
507  }
508 
509  index_close(indexRelation, NoLock);
510 
511  /*
512  * We've historically used lcons() here. It'd make more sense to
513  * use lappend(), but that causes the planner to change behavior
514  * in cases where two indexes seem equally attractive. For now,
515  * stick with lcons() --- few tables should have so many indexes
516  * that the O(N^2) behavior of lcons() is really a problem.
517  */
518  indexinfos = lcons(info, indexinfos);
519  }
520 
521  list_free(indexoidlist);
522  }
523 
524  rel->indexlist = indexinfos;
525 
526  rel->statlist = get_relation_statistics(rel, relation);
527 
528  /* Grab foreign-table info using the relcache, while we have it */
529  if (relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE)
530  {
531  /* Check if the access to foreign tables is restricted */
533  {
534  /* there must not be built-in foreign tables */
536 
537  ereport(ERROR,
538  (errcode(ERRCODE_OBJECT_NOT_IN_PREREQUISITE_STATE),
539  errmsg("access to non-system foreign table is restricted")));
540  }
541 
543  rel->fdwroutine = GetFdwRoutineForRelation(relation, true);
544  }
545  else
546  {
547  rel->serverid = InvalidOid;
548  rel->fdwroutine = NULL;
549  }
550 
551  /* Collect info about relation's foreign keys, if relevant */
552  get_relation_foreign_keys(root, rel, relation, inhparent);
553 
554  /* Collect info about functions implemented by the rel's table AM. */
555  if (relation->rd_tableam &&
556  relation->rd_tableam->scan_set_tidrange != NULL &&
557  relation->rd_tableam->scan_getnextslot_tidrange != NULL)
559 
560  /*
561  * Collect info about relation's partitioning scheme, if any. Only
562  * inheritance parents may be partitioned.
563  */
564  if (inhparent && relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
565  set_relation_partition_info(root, rel, relation);
566 
567  table_close(relation, NoLock);
568 
569  /*
570  * Allow a plugin to editorialize on the info we obtained from the
571  * catalogs. Actions might include altering the assumed relation size,
572  * removing an index, or adding a hypothetical index to the indexlist.
573  */
575  (*get_relation_info_hook) (root, relationObjectId, inhparent, rel);
576 }
signed short int16
Definition: c.h:481
#define unlikely(x)
Definition: c.h:326
bool IsSystemRelation(Relation relation)
Definition: catalog.c:73
int errcode(int sqlerrcode)
Definition: elog.c:853
int errmsg(const char *fmt,...)
Definition: elog.c:1070
#define ereport(elevel,...)
Definition: elog.h:149
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:442
Oid GetForeignServerIdByRelId(Oid relid)
Definition: foreign.c:355
#define HeapTupleHeaderGetXmin(tup)
Definition: htup_details.h:309
void index_close(Relation relation, LOCKMODE lockmode)
Definition: indexam.c:177
bool index_can_return(Relation indexRelation, int attno)
Definition: indexam.c:790
Relation index_open(Oid relationId, LOCKMODE lockmode)
Definition: indexam.c:133
void list_free(List *list)
Definition: list.c:1546
List * lcons(void *datum, List *list)
Definition: list.c:495
int LOCKMODE
Definition: lockdefs.h:26
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Definition: lsyscache.c:166
bool get_ordering_op_properties(Oid opno, Oid *opfamily, Oid *opcintype, int16 *strategy)
Definition: lsyscache.c:207
void * palloc0(Size size)
Definition: mcxt.c:1347
void * palloc(Size size)
Definition: mcxt.c:1317
bool IgnoreSystemIndexes
Definition: miscinit.c:81
#define makeNode(_type_)
Definition: nodes.h:155
Bitmapset * Relids
Definition: pathnodes.h:30
#define AMFLAG_HAS_TID_RANGE
Definition: pathnodes.h:823
int errdetail_relkind_not_supported(char relkind)
Definition: pg_class.c:24
FormData_pg_index * Form_pg_index
Definition: pg_index.h:70
#define lfirst_oid(lc)
Definition: pg_list.h:174
void estimate_rel_size(Relation rel, int32 *attr_widths, BlockNumber *pages, double *tuples, double *allvisfrac)
Definition: plancat.c:1066
static void get_relation_foreign_keys(PlannerInfo *root, RelOptInfo *rel, Relation relation, bool inhparent)
Definition: plancat.c:589
get_relation_info_hook_type get_relation_info_hook
Definition: plancat.c:60
static List * build_index_tlist(PlannerInfo *root, IndexOptInfo *index, Relation heapRelation)
Definition: plancat.c:1893
static List * get_relation_statistics(RelOptInfo *rel, Relation relation)
Definition: plancat.c:1476
static void set_relation_partition_info(PlannerInfo *root, RelOptInfo *rel, Relation relation)
Definition: plancat.c:2373
int restrict_nonsystem_relation_kind
Definition: postgres.c:107
#define InvalidOid
Definition: postgres_ext.h:36
unsigned int Oid
Definition: postgres_ext.h:31
#define RelationGetForm(relation)
Definition: rel.h:499
#define RelationGetParallelWorkers(relation, defaultpw)
Definition: rel.h:397
#define RelationGetRelationName(relation)
Definition: rel.h:539
#define RelationIsPermanent(relation)
Definition: rel.h:617
List * RelationGetIndexList(Relation relation)
Definition: relcache.c:4766
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:5140
bytea ** RelationGetIndexAttOptions(Relation relation, bool copy)
Definition: relcache.c:5885
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:5027
void ChangeVarNodes(Node *node, int rt_index, int new_index, int sublevels_up)
Definition: rewriteManip.c:668
TransactionId TransactionXmin
Definition: snapmgr.c:98
#define BTLessStrategyNumber
Definition: stratnum.h:29
HeapTupleHeader t_data
Definition: htup.h:68
amrestrpos_function amrestrpos
Definition: amapi.h:294
amcostestimate_function amcostestimate
Definition: amapi.h:281
bool amcanorderbyop
Definition: amapi.h:233
bool amoptionalkey
Definition: amapi.h:241
amgettuple_function amgettuple
Definition: amapi.h:290
amgetbitmap_function amgetbitmap
Definition: amapi.h:291
bool amsearcharray
Definition: amapi.h:243
ammarkpos_function ammarkpos
Definition: amapi.h:293
bool amcanparallel
Definition: amapi.h:253
bool amcanorder
Definition: amapi.h:231
amgettreeheight_function amgettreeheight
Definition: amapi.h:282
bool amsearchnulls
Definition: amapi.h:245
bool amcanparallel
Definition: pathnodes.h:1207
void(* amcostestimate)(struct PlannerInfo *, struct IndexPath *, double, Cost *, Cost *, Selectivity *, double *, double *) pg_node_attr(read_write_ignore)
Definition: pathnodes.h:1212
bool amoptionalkey
Definition: pathnodes.h:1200
Oid reltablespace
Definition: pathnodes.h:1122
bool amcanmarkpos
Definition: pathnodes.h:1209
List * indrestrictinfo
Definition: pathnodes.h:1184
bool amhasgettuple
Definition: pathnodes.h:1204
bool amcanorderbyop
Definition: pathnodes.h:1199
bool hypothetical
Definition: pathnodes.h:1193
List * indpred
Definition: pathnodes.h:1174
Cardinality tuples
Definition: pathnodes.h:1132
bool amsearcharray
Definition: pathnodes.h:1201
BlockNumber pages
Definition: pathnodes.h:1130
bool amsearchnulls
Definition: pathnodes.h:1202
bool amhasgetbitmap
Definition: pathnodes.h:1206
List * indextlist
Definition: pathnodes.h:1177
bool immediate
Definition: pathnodes.h:1191
uint32 amflags
Definition: pathnodes.h:958
Bitmapset * notnullattnums
Definition: pathnodes.h:936
List * statlist
Definition: pathnodes.h:946
Cardinality tuples
Definition: pathnodes.h:949
BlockNumber pages
Definition: pathnodes.h:948
List * indexlist
Definition: pathnodes.h:944
Oid reltablespace
Definition: pathnodes.h:920
Oid serverid
Definition: pathnodes.h:964
int rel_parallel_workers
Definition: pathnodes.h:956
AttrNumber max_attr
Definition: pathnodes.h:926
double allvisfrac
Definition: pathnodes.h:950
AttrNumber min_attr
Definition: pathnodes.h:924
const struct TableAmRoutine * rd_tableam
Definition: rel.h:189
struct IndexAmRoutine * rd_indam
Definition: rel.h:206
Oid * rd_opcintype
Definition: rel.h:208
struct HeapTupleData * rd_indextuple
Definition: rel.h:194
int16 * rd_indoption
Definition: rel.h:211
Form_pg_index rd_index
Definition: rel.h:192
Oid * rd_opfamily
Definition: rel.h:207
Oid * rd_indcollation
Definition: rel.h:217
bool(* scan_getnextslot_tidrange)(TableScanDesc scan, ScanDirection direction, TupleTableSlot *slot)
Definition: tableam.h:379
bool(* scan_bitmap_next_block)(TableScanDesc scan, BlockNumber *blockno, bool *recheck, uint64 *lossy_pages, uint64 *exact_pages)
Definition: tableam.h:819
void(* scan_set_tidrange)(TableScanDesc scan, ItemPointer mintid, ItemPointer maxtid)
Definition: tableam.h:371
Definition: type.h:96
#define RESTRICT_RELKIND_FOREIGN_TABLE
Definition: tcopprot.h:48
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:280
#define FirstNormalObjectId
Definition: transam.h:197
bool RecoveryInProgress(void)
Definition: xlog.c:6334

References RelOptInfo::allvisfrac, IndexOptInfo::amcanmarkpos, IndexAmRoutine::amcanorder, IndexAmRoutine::amcanorderbyop, IndexOptInfo::amcanorderbyop, IndexAmRoutine::amcanparallel, IndexOptInfo::amcanparallel, IndexAmRoutine::amcostestimate, IndexOptInfo::amcostestimate, AMFLAG_HAS_TID_RANGE, RelOptInfo::amflags, IndexAmRoutine::amgetbitmap, IndexAmRoutine::amgettreeheight, IndexAmRoutine::amgettuple, IndexOptInfo::amhasgetbitmap, IndexOptInfo::amhasgettuple, IndexAmRoutine::ammarkpos, IndexAmRoutine::amoptionalkey, IndexOptInfo::amoptionalkey, IndexAmRoutine::amrestrpos, IndexAmRoutine::amsearcharray, IndexOptInfo::amsearcharray, IndexAmRoutine::amsearchnulls, IndexOptInfo::amsearchnulls, Assert, bms_add_member(), BTLessStrategyNumber, build_index_tlist(), ChangeVarNodes(), ereport, errcode(), errdetail_relkind_not_supported(), errmsg(), ERROR, estimate_rel_size(), FirstLowInvalidHeapAttributeNumber, FirstNormalObjectId, get_opfamily_member(), get_ordering_op_properties(), get_relation_foreign_keys(), get_relation_info_hook, get_relation_statistics(), GetFdwRoutineForRelation(), GetForeignServerIdByRelId(), HeapTupleHeaderGetXmin, IndexOptInfo::hypothetical, i, IgnoreSystemIndexes, IndexOptInfo::immediate, index_can_return(), index_close(), index_open(), RelOptInfo::indexlist, IndexOptInfo::indexoid, IndexOptInfo::indextlist, IndexOptInfo::indpred, IndexOptInfo::indrestrictinfo, InvalidOid, IsSystemRelation(), lcons(), lfirst_oid, list_free(), makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, TupleDescData::natts, IndexOptInfo::ncolumns, NIL, IndexOptInfo::nkeycolumns, NoLock, RelOptInfo::notnullattnums, OidIsValid, RelOptInfo::pages, IndexOptInfo::pages, palloc(), palloc0(), IndexOptInfo::predOK, RelationData::rd_att, 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(), RelOptInfo::rel_parallel_workers, IndexOptInfo::relam, RelationGetForm, RelationGetIndexAttOptions(), RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), RelationGetNumberOfAttributes, RelationGetNumberOfBlocks, RelationGetParallelWorkers, RelationGetRelationName, RelationGetRelid, RelationIsPermanent, RelOptInfo::relid, RelOptInfo::reltablespace, IndexOptInfo::reltablespace, restrict_nonsystem_relation_kind, RESTRICT_RELKIND_FOREIGN_TABLE, root, TableAmRoutine::scan_bitmap_next_block, TableAmRoutine::scan_getnextslot_tidrange, TableAmRoutine::scan_set_tidrange, RelOptInfo::serverid, set_relation_partition_info(), RelOptInfo::statlist, HeapTupleData::t_data, table_close(), table_open(), TransactionIdPrecedes(), TransactionXmin, IndexOptInfo::tree_height, TupleDescAttr, RelOptInfo::tuples, IndexOptInfo::tuples, IndexOptInfo::unique, and unlikely.

Referenced by build_simple_rel().

◆ has_row_triggers()

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

Definition at line 2248 of file plancat.c.

2249 {
2250  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2251  Relation relation;
2252  TriggerDesc *trigDesc;
2253  bool result = false;
2254 
2255  /* Assume we already have adequate lock */
2256  relation = table_open(rte->relid, NoLock);
2257 
2258  trigDesc = relation->trigdesc;
2259  switch (event)
2260  {
2261  case CMD_INSERT:
2262  if (trigDesc &&
2263  (trigDesc->trig_insert_after_row ||
2264  trigDesc->trig_insert_before_row))
2265  result = true;
2266  break;
2267  case CMD_UPDATE:
2268  if (trigDesc &&
2269  (trigDesc->trig_update_after_row ||
2270  trigDesc->trig_update_before_row))
2271  result = true;
2272  break;
2273  case CMD_DELETE:
2274  if (trigDesc &&
2275  (trigDesc->trig_delete_after_row ||
2276  trigDesc->trig_delete_before_row))
2277  result = true;
2278  break;
2279  /* There is no separate event for MERGE, only INSERT/UPDATE/DELETE */
2280  case CMD_MERGE:
2281  result = false;
2282  break;
2283  default:
2284  elog(ERROR, "unrecognized CmdType: %d", (int) event);
2285  break;
2286  }
2287 
2288  table_close(relation, NoLock);
2289  return result;
2290 }
@ CMD_MERGE
Definition: nodes.h:269
@ CMD_INSERT
Definition: nodes.h:267
@ CMD_DELETE
Definition: nodes.h:268
@ CMD_UPDATE
Definition: nodes.h:266
TriggerDesc * trigdesc
Definition: rel.h:117
bool trig_delete_before_row
Definition: reltrigger.h:66
bool trig_update_after_row
Definition: reltrigger.h:62
bool trig_insert_after_row
Definition: reltrigger.h:57
bool trig_update_before_row
Definition: reltrigger.h:61
bool trig_delete_after_row
Definition: reltrigger.h:67
bool trig_insert_before_row
Definition: reltrigger.h:56

References CMD_DELETE, CMD_INSERT, CMD_MERGE, CMD_UPDATE, elog, ERROR, NoLock, planner_rt_fetch, RangeTblEntry::relid, root, 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().

◆ has_stored_generated_columns()

bool has_stored_generated_columns ( PlannerInfo root,
Index  rti 
)

Definition at line 2298 of file plancat.c.

2299 {
2300  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2301  Relation relation;
2302  TupleDesc tupdesc;
2303  bool result = false;
2304 
2305  /* Assume we already have adequate lock */
2306  relation = table_open(rte->relid, NoLock);
2307 
2308  tupdesc = RelationGetDescr(relation);
2309  result = tupdesc->constr && tupdesc->constr->has_generated_stored;
2310 
2311  table_close(relation, NoLock);
2312 
2313  return result;
2314 }

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

Referenced by make_modifytable().

◆ has_unique_index()

bool has_unique_index ( RelOptInfo rel,
AttrNumber  attno 
)

Definition at line 2216 of file plancat.c.

2217 {
2218  ListCell *ilist;
2219 
2220  foreach(ilist, rel->indexlist)
2221  {
2222  IndexOptInfo *index = (IndexOptInfo *) lfirst(ilist);
2223 
2224  /*
2225  * Note: ignore partial indexes, since they don't allow us to conclude
2226  * that all attr values are distinct, *unless* they are marked predOK
2227  * which means we know the index's predicate is satisfied by the
2228  * query. We don't take any interest in expressional indexes either.
2229  * Also, a multicolumn unique index doesn't allow us to conclude that
2230  * just the specified attr is unique.
2231  */
2232  if (index->unique &&
2233  index->nkeycolumns == 1 &&
2234  index->indexkeys[0] == attno &&
2235  (index->indpred == NIL || index->predOK))
2236  return true;
2237  }
2238  return false;
2239 }

References RelOptInfo::indexlist, lfirst, and NIL.

Referenced by examine_variable().

◆ infer_arbiter_indexes()

List* infer_arbiter_indexes ( PlannerInfo root)

Definition at line 704 of file plancat.c.

705 {
706  OnConflictExpr *onconflict = root->parse->onConflict;
707 
708  /* Iteration state */
709  Index varno;
710  RangeTblEntry *rte;
711  Relation relation;
712  Oid indexOidFromConstraint = InvalidOid;
713  List *indexList;
714  ListCell *l;
715 
716  /* Normalized inference attributes and inference expressions: */
717  Bitmapset *inferAttrs = NULL;
718  List *inferElems = NIL;
719 
720  /* Results */
721  List *results = NIL;
722 
723  /*
724  * Quickly return NIL for ON CONFLICT DO NOTHING without an inference
725  * specification or named constraint. ON CONFLICT DO UPDATE statements
726  * must always provide one or the other (but parser ought to have caught
727  * that already).
728  */
729  if (onconflict->arbiterElems == NIL &&
730  onconflict->constraint == InvalidOid)
731  return NIL;
732 
733  /*
734  * We need not lock the relation since it was already locked, either by
735  * the rewriter or when expand_inherited_rtentry() added it to the query's
736  * rangetable.
737  */
738  varno = root->parse->resultRelation;
739  rte = rt_fetch(varno, root->parse->rtable);
740 
741  relation = table_open(rte->relid, NoLock);
742 
743  /*
744  * Build normalized/BMS representation of plain indexed attributes, as
745  * well as a separate list of expression items. This simplifies matching
746  * the cataloged definition of indexes.
747  */
748  foreach(l, onconflict->arbiterElems)
749  {
750  InferenceElem *elem = (InferenceElem *) lfirst(l);
751  Var *var;
752  int attno;
753 
754  if (!IsA(elem->expr, Var))
755  {
756  /* If not a plain Var, just shove it in inferElems for now */
757  inferElems = lappend(inferElems, elem->expr);
758  continue;
759  }
760 
761  var = (Var *) elem->expr;
762  attno = var->varattno;
763 
764  if (attno == 0)
765  ereport(ERROR,
766  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
767  errmsg("whole row unique index inference specifications are not supported")));
768 
769  inferAttrs = bms_add_member(inferAttrs,
771  }
772 
773  /*
774  * Lookup named constraint's index. This is not immediately returned
775  * because some additional sanity checks are required.
776  */
777  if (onconflict->constraint != InvalidOid)
778  {
779  indexOidFromConstraint = get_constraint_index(onconflict->constraint);
780 
781  if (indexOidFromConstraint == InvalidOid)
782  ereport(ERROR,
783  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
784  errmsg("constraint in ON CONFLICT clause has no associated index")));
785  }
786 
787  /*
788  * Using that representation, iterate through the list of indexes on the
789  * target relation to try and find a match
790  */
791  indexList = RelationGetIndexList(relation);
792 
793  foreach(l, indexList)
794  {
795  Oid indexoid = lfirst_oid(l);
796  Relation idxRel;
797  Form_pg_index idxForm;
798  Bitmapset *indexedAttrs;
799  List *idxExprs;
800  List *predExprs;
801  AttrNumber natt;
802  ListCell *el;
803 
804  /*
805  * Extract info from the relation descriptor for the index. Obtain
806  * the same lock type that the executor will ultimately use.
807  *
808  * Let executor complain about !indimmediate case directly, because
809  * enforcement needs to occur there anyway when an inference clause is
810  * omitted.
811  */
812  idxRel = index_open(indexoid, rte->rellockmode);
813  idxForm = idxRel->rd_index;
814 
815  if (!idxForm->indisvalid)
816  goto next;
817 
818  /*
819  * Note that we do not perform a check against indcheckxmin (like e.g.
820  * get_relation_info()) here to eliminate candidates, because
821  * uniqueness checking only cares about the most recently committed
822  * tuple versions.
823  */
824 
825  /*
826  * Look for match on "ON constraint_name" variant, which may not be
827  * unique constraint. This can only be a constraint name.
828  */
829  if (indexOidFromConstraint == idxForm->indexrelid)
830  {
831  if (idxForm->indisexclusion && onconflict->action == ONCONFLICT_UPDATE)
832  ereport(ERROR,
833  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
834  errmsg("ON CONFLICT DO UPDATE not supported with exclusion constraints")));
835 
836  results = lappend_oid(results, idxForm->indexrelid);
837  list_free(indexList);
838  index_close(idxRel, NoLock);
839  table_close(relation, NoLock);
840  return results;
841  }
842  else if (indexOidFromConstraint != InvalidOid)
843  {
844  /* No point in further work for index in named constraint case */
845  goto next;
846  }
847 
848  /*
849  * Only considering conventional inference at this point (not named
850  * constraints), so index under consideration can be immediately
851  * skipped if it's not unique
852  */
853  if (!idxForm->indisunique)
854  goto next;
855 
856  /*
857  * So-called unique constraints with WITHOUT OVERLAPS are really
858  * exclusion constraints, so skip those too.
859  */
860  if (idxForm->indisexclusion)
861  goto next;
862 
863  /* Build BMS representation of plain (non expression) index attrs */
864  indexedAttrs = NULL;
865  for (natt = 0; natt < idxForm->indnkeyatts; natt++)
866  {
867  int attno = idxRel->rd_index->indkey.values[natt];
868 
869  if (attno != 0)
870  indexedAttrs = bms_add_member(indexedAttrs,
872  }
873 
874  /* Non-expression attributes (if any) must match */
875  if (!bms_equal(indexedAttrs, inferAttrs))
876  goto next;
877 
878  /* Expression attributes (if any) must match */
879  idxExprs = RelationGetIndexExpressions(idxRel);
880  if (idxExprs && varno != 1)
881  ChangeVarNodes((Node *) idxExprs, 1, varno, 0);
882 
883  foreach(el, onconflict->arbiterElems)
884  {
885  InferenceElem *elem = (InferenceElem *) lfirst(el);
886 
887  /*
888  * Ensure that collation/opclass aspects of inference expression
889  * element match. Even though this loop is primarily concerned
890  * with matching expressions, it is a convenient point to check
891  * this for both expressions and ordinary (non-expression)
892  * attributes appearing as inference elements.
893  */
894  if (!infer_collation_opclass_match(elem, idxRel, idxExprs))
895  goto next;
896 
897  /*
898  * Plain Vars don't factor into count of expression elements, and
899  * the question of whether or not they satisfy the index
900  * definition has already been considered (they must).
901  */
902  if (IsA(elem->expr, Var))
903  continue;
904 
905  /*
906  * Might as well avoid redundant check in the rare cases where
907  * infer_collation_opclass_match() is required to do real work.
908  * Otherwise, check that element expression appears in cataloged
909  * index definition.
910  */
911  if (elem->infercollid != InvalidOid ||
912  elem->inferopclass != InvalidOid ||
913  list_member(idxExprs, elem->expr))
914  continue;
915 
916  goto next;
917  }
918 
919  /*
920  * Now that all inference elements were matched, ensure that the
921  * expression elements from inference clause are not missing any
922  * cataloged expressions. This does the right thing when unique
923  * indexes redundantly repeat the same attribute, or if attributes
924  * redundantly appear multiple times within an inference clause.
925  */
926  if (list_difference(idxExprs, inferElems) != NIL)
927  goto next;
928 
929  /*
930  * If it's a partial index, its predicate must be implied by the ON
931  * CONFLICT's WHERE clause.
932  */
933  predExprs = RelationGetIndexPredicate(idxRel);
934  if (predExprs && varno != 1)
935  ChangeVarNodes((Node *) predExprs, 1, varno, 0);
936 
937  if (!predicate_implied_by(predExprs, (List *) onconflict->arbiterWhere, false))
938  goto next;
939 
940  results = lappend_oid(results, idxForm->indexrelid);
941 next:
942  index_close(idxRel, NoLock);
943  }
944 
945  list_free(indexList);
946  table_close(relation, NoLock);
947 
948  if (results == NIL)
949  ereport(ERROR,
950  (errcode(ERRCODE_INVALID_COLUMN_REFERENCE),
951  errmsg("there is no unique or exclusion constraint matching the ON CONFLICT specification")));
952 
953  return results;
954 }
int16 AttrNumber
Definition: attnum.h:21
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:142
static int32 next
Definition: blutils.c:219
List * lappend_oid(List *list, Oid datum)
Definition: list.c:375
bool list_member(const List *list, const void *datum)
Definition: list.c:661
List * list_difference(const List *list1, const List *list2)
Definition: list.c:1237
Oid get_constraint_index(Oid conoid)
Definition: lsyscache.c:1113
@ ONCONFLICT_UPDATE
Definition: nodes.h:420
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
static bool infer_collation_opclass_match(InferenceElem *elem, Relation idxRel, List *idxExprs)
Definition: plancat.c:984
bool predicate_implied_by(List *predicate_list, List *clause_list, bool weak)
Definition: predtest.c:152
List * arbiterElems
Definition: primnodes.h:2327
OnConflictAction action
Definition: primnodes.h:2324
Node * arbiterWhere
Definition: primnodes.h:2329
AttrNumber varattno
Definition: primnodes.h:260

References OnConflictExpr::action, OnConflictExpr::arbiterElems, OnConflictExpr::arbiterWhere, bms_add_member(), bms_equal(), ChangeVarNodes(), OnConflictExpr::constraint, ereport, errcode(), errmsg(), ERROR, InferenceElem::expr, FirstLowInvalidHeapAttributeNumber, get_constraint_index(), if(), 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, ONCONFLICT_UPDATE, predicate_implied_by(), RelationData::rd_index, RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), RangeTblEntry::relid, root, rt_fetch, table_close(), table_open(), and Var::varattno.

Referenced by make_modifytable().

◆ join_selectivity()

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

Definition at line 1994 of file plancat.c.

2000 {
2001  RegProcedure oprjoin = get_oprjoin(operatorid);
2002  float8 result;
2003 
2004  /*
2005  * if the oprjoin procedure is missing for whatever reason, use a
2006  * selectivity of 0.5
2007  */
2008  if (!oprjoin)
2009  return (Selectivity) 0.5;
2010 
2011  result = DatumGetFloat8(OidFunctionCall5Coll(oprjoin,
2012  inputcollid,
2014  ObjectIdGetDatum(operatorid),
2016  Int16GetDatum(jointype),
2017  PointerGetDatum(sjinfo)));
2018 
2019  if (result < 0.0 || result > 1.0)
2020  elog(ERROR, "invalid join selectivity: %f", result);
2021 
2022  return (Selectivity) result;
2023 }
double float8
Definition: c.h:609
Datum OidFunctionCall5Coll(Oid functionId, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4, Datum arg5)
Definition: fmgr.c:1453
RegProcedure get_oprjoin(Oid opno)
Definition: lsyscache.c:1581
static Datum Int16GetDatum(int16 X)
Definition: postgres.h:172
static float8 DatumGetFloat8(Datum X)
Definition: postgres.h:494

References generate_unaccent_rules::args, DatumGetFloat8(), elog, ERROR, get_oprjoin(), Int16GetDatum(), ObjectIdGetDatum(), OidFunctionCall5Coll(), PointerGetDatum(), and root.

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

◆ relation_excluded_by_constraints()

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

Definition at line 1582 of file plancat.c.

1584 {
1585  bool include_noinherit;
1586  bool include_notnull;
1587  bool include_partition = false;
1588  List *safe_restrictions;
1589  List *constraint_pred;
1590  List *safe_constraints;
1591  ListCell *lc;
1592 
1593  /* As of now, constraint exclusion works only with simple relations. */
1594  Assert(IS_SIMPLE_REL(rel));
1595 
1596  /*
1597  * If there are no base restriction clauses, we have no hope of proving
1598  * anything below, so fall out quickly.
1599  */
1600  if (rel->baserestrictinfo == NIL)
1601  return false;
1602 
1603  /*
1604  * Regardless of the setting of constraint_exclusion, detect
1605  * constant-FALSE-or-NULL restriction clauses. Although const-folding
1606  * will reduce "anything AND FALSE" to just "FALSE", the baserestrictinfo
1607  * list can still have other members besides the FALSE constant, due to
1608  * qual pushdown and other mechanisms; so check them all. This doesn't
1609  * fire very often, but it seems cheap enough to be worth doing anyway.
1610  * (Without this, we'd miss some optimizations that 9.5 and earlier found
1611  * via much more roundabout methods.)
1612  */
1613  foreach(lc, rel->baserestrictinfo)
1614  {
1615  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1616  Expr *clause = rinfo->clause;
1617 
1618  if (clause && IsA(clause, Const) &&
1619  (((Const *) clause)->constisnull ||
1620  !DatumGetBool(((Const *) clause)->constvalue)))
1621  return true;
1622  }
1623 
1624  /*
1625  * Skip further tests, depending on constraint_exclusion.
1626  */
1627  switch (constraint_exclusion)
1628  {
1630  /* In 'off' mode, never make any further tests */
1631  return false;
1632 
1634 
1635  /*
1636  * When constraint_exclusion is set to 'partition' we only handle
1637  * appendrel members. Partition pruning has already been applied,
1638  * so there is no need to consider the rel's partition constraints
1639  * here.
1640  */
1641  if (rel->reloptkind == RELOPT_OTHER_MEMBER_REL)
1642  break; /* appendrel member, so process it */
1643  return false;
1644 
1646 
1647  /*
1648  * In 'on' mode, always apply constraint exclusion. If we are
1649  * considering a baserel that is a partition (i.e., it was
1650  * directly named rather than expanded from a parent table), then
1651  * its partition constraints haven't been considered yet, so
1652  * include them in the processing here.
1653  */
1654  if (rel->reloptkind == RELOPT_BASEREL)
1655  include_partition = true;
1656  break; /* always try to exclude */
1657  }
1658 
1659  /*
1660  * Check for self-contradictory restriction clauses. We dare not make
1661  * deductions with non-immutable functions, but any immutable clauses that
1662  * are self-contradictory allow us to conclude the scan is unnecessary.
1663  *
1664  * Note: strip off RestrictInfo because predicate_refuted_by() isn't
1665  * expecting to see any in its predicate argument.
1666  */
1667  safe_restrictions = NIL;
1668  foreach(lc, rel->baserestrictinfo)
1669  {
1670  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1671 
1672  if (!contain_mutable_functions((Node *) rinfo->clause))
1673  safe_restrictions = lappend(safe_restrictions, rinfo->clause);
1674  }
1675 
1676  /*
1677  * We can use weak refutation here, since we're comparing restriction
1678  * clauses with restriction clauses.
1679  */
1680  if (predicate_refuted_by(safe_restrictions, safe_restrictions, true))
1681  return true;
1682 
1683  /*
1684  * Only plain relations have constraints, so stop here for other rtekinds.
1685  */
1686  if (rte->rtekind != RTE_RELATION)
1687  return false;
1688 
1689  /*
1690  * If we are scanning just this table, we can use NO INHERIT constraints,
1691  * but not if we're scanning its children too. (Note that partitioned
1692  * tables should never have NO INHERIT constraints; but it's not necessary
1693  * for us to assume that here.)
1694  */
1695  include_noinherit = !rte->inh;
1696 
1697  /*
1698  * Currently, attnotnull constraints must be treated as NO INHERIT unless
1699  * this is a partitioned table. In future we might track their
1700  * inheritance status more accurately, allowing this to be refined.
1701  *
1702  * XXX do we need/want to change this?
1703  */
1704  include_notnull = (!rte->inh || rte->relkind == RELKIND_PARTITIONED_TABLE);
1705 
1706  /*
1707  * Fetch the appropriate set of constraint expressions.
1708  */
1709  constraint_pred = get_relation_constraints(root, rte->relid, rel,
1710  include_noinherit,
1711  include_notnull,
1712  include_partition);
1713 
1714  /*
1715  * We do not currently enforce that CHECK constraints contain only
1716  * immutable functions, so it's necessary to check here. We daren't draw
1717  * conclusions from plan-time evaluation of non-immutable functions. Since
1718  * they're ANDed, we can just ignore any mutable constraints in the list,
1719  * and reason about the rest.
1720  */
1721  safe_constraints = NIL;
1722  foreach(lc, constraint_pred)
1723  {
1724  Node *pred = (Node *) lfirst(lc);
1725 
1726  if (!contain_mutable_functions(pred))
1727  safe_constraints = lappend(safe_constraints, pred);
1728  }
1729 
1730  /*
1731  * The constraints are effectively ANDed together, so we can just try to
1732  * refute the entire collection at once. This may allow us to make proofs
1733  * that would fail if we took them individually.
1734  *
1735  * Note: we use rel->baserestrictinfo, not safe_restrictions as might seem
1736  * an obvious optimization. Some of the clauses might be OR clauses that
1737  * have volatile and nonvolatile subclauses, and it's OK to make
1738  * deductions with the nonvolatile parts.
1739  *
1740  * We need strong refutation because we have to prove that the constraints
1741  * would yield false, not just NULL.
1742  */
1743  if (predicate_refuted_by(safe_constraints, rel->baserestrictinfo, false))
1744  return true;
1745 
1746  return false;
1747 }
bool contain_mutable_functions(Node *clause)
Definition: clauses.c:369
@ CONSTRAINT_EXCLUSION_OFF
Definition: cost.h:38
@ CONSTRAINT_EXCLUSION_PARTITION
Definition: cost.h:40
@ CONSTRAINT_EXCLUSION_ON
Definition: cost.h:39
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:839
@ RELOPT_BASEREL
Definition: pathnodes.h:827
@ RELOPT_OTHER_MEMBER_REL
Definition: pathnodes.h:829
int constraint_exclusion
Definition: plancat.c:57
static List * get_relation_constraints(PlannerInfo *root, Oid relationObjectId, RelOptInfo *rel, bool include_noinherit, bool include_notnull, bool include_partition)
Definition: plancat.c:1273
static bool DatumGetBool(Datum X)
Definition: postgres.h:90
bool predicate_refuted_by(List *predicate_list, List *clause_list, bool weak)
Definition: predtest.c:222
List * baserestrictinfo
Definition: pathnodes.h:985
RelOptKind reloptkind
Definition: pathnodes.h:865
Expr * clause
Definition: pathnodes.h:2574

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, IS_SIMPLE_REL, IsA, lappend(), lfirst, NIL, predicate_refuted_by(), RangeTblEntry::relid, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, root, RTE_RELATION, and RangeTblEntry::rtekind.

Referenced by set_append_rel_size(), and set_rel_size().

◆ restriction_selectivity()

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

Definition at line 1955 of file plancat.c.

1960 {
1961  RegProcedure oprrest = get_oprrest(operatorid);
1962  float8 result;
1963 
1964  /*
1965  * if the oprrest procedure is missing for whatever reason, use a
1966  * selectivity of 0.5
1967  */
1968  if (!oprrest)
1969  return (Selectivity) 0.5;
1970 
1971  result = DatumGetFloat8(OidFunctionCall4Coll(oprrest,
1972  inputcollid,
1974  ObjectIdGetDatum(operatorid),
1976  Int32GetDatum(varRelid)));
1977 
1978  if (result < 0.0 || result > 1.0)
1979  elog(ERROR, "invalid restriction selectivity: %f", result);
1980 
1981  return (Selectivity) result;
1982 }
Datum OidFunctionCall4Coll(Oid functionId, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4)
Definition: fmgr.c:1442
RegProcedure get_oprrest(Oid opno)
Definition: lsyscache.c:1557
static Datum Int32GetDatum(int32 X)
Definition: postgres.h:212

References generate_unaccent_rules::args, DatumGetFloat8(), elog, ERROR, get_oprrest(), Int32GetDatum(), ObjectIdGetDatum(), OidFunctionCall4Coll(), PointerGetDatum(), and root.

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

Variable Documentation

◆ get_relation_info_hook

PGDLLIMPORT get_relation_info_hook_type get_relation_info_hook
extern

Definition at line 60 of file plancat.c.

Referenced by get_relation_info().