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

2043 {
2044  HeapTuple proctup;
2045  Form_pg_proc procform;
2046 
2047  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2048  if (!HeapTupleIsValid(proctup))
2049  elog(ERROR, "cache lookup failed for function %u", funcid);
2050  procform = (Form_pg_proc) GETSTRUCT(proctup);
2051 
2052  if (OidIsValid(procform->prosupport))
2053  {
2054  SupportRequestCost req;
2055  SupportRequestCost *sresult;
2056 
2057  req.type = T_SupportRequestCost;
2058  req.root = root;
2059  req.funcid = funcid;
2060  req.node = node;
2061 
2062  /* Initialize cost fields so that support function doesn't have to */
2063  req.startup = 0;
2064  req.per_tuple = 0;
2065 
2066  sresult = (SupportRequestCost *)
2067  DatumGetPointer(OidFunctionCall1(procform->prosupport,
2068  PointerGetDatum(&req)));
2069 
2070  if (sresult == &req)
2071  {
2072  /* Success, so accumulate support function's estimate into *cost */
2073  cost->startup += req.startup;
2074  cost->per_tuple += req.per_tuple;
2075  ReleaseSysCache(proctup);
2076  return;
2077  }
2078  }
2079 
2080  /* No support function, or it failed, so rely on procost */
2081  cost->per_tuple += procform->procost * cpu_operator_cost;
2082 
2083  ReleaseSysCache(proctup);
2084 }
#define OidIsValid(objectId)
Definition: c.h:759
double cpu_operator_cost
Definition: costsize.c:124
#define ERROR
Definition: elog.h:39
#define OidFunctionCall1(functionId, arg1)
Definition: fmgr.h:680
#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
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:865
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:817
@ PROCOID
Definition: syscache.h:79

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

1717 {
1718  List *tlist = NIL;
1719  Index varno = rel->relid;
1720  RangeTblEntry *rte = planner_rt_fetch(varno, root);
1721  Relation relation;
1722  Query *subquery;
1723  Var *var;
1724  ListCell *l;
1725  int attrno,
1726  numattrs;
1727  List *colvars;
1728 
1729  switch (rte->rtekind)
1730  {
1731  case RTE_RELATION:
1732  /* Assume we already have adequate lock */
1733  relation = table_open(rte->relid, NoLock);
1734 
1735  numattrs = RelationGetNumberOfAttributes(relation);
1736  for (attrno = 1; attrno <= numattrs; attrno++)
1737  {
1738  Form_pg_attribute att_tup = TupleDescAttr(relation->rd_att,
1739  attrno - 1);
1740 
1741  if (att_tup->attisdropped || att_tup->atthasmissing)
1742  {
1743  /* found a dropped or missing col, so punt */
1744  tlist = NIL;
1745  break;
1746  }
1747 
1748  var = makeVar(varno,
1749  attrno,
1750  att_tup->atttypid,
1751  att_tup->atttypmod,
1752  att_tup->attcollation,
1753  0);
1754 
1755  tlist = lappend(tlist,
1756  makeTargetEntry((Expr *) var,
1757  attrno,
1758  NULL,
1759  false));
1760  }
1761 
1762  table_close(relation, NoLock);
1763  break;
1764 
1765  case RTE_SUBQUERY:
1766  subquery = rte->subquery;
1767  foreach(l, subquery->targetList)
1768  {
1769  TargetEntry *tle = (TargetEntry *) lfirst(l);
1770 
1771  /*
1772  * A resjunk column of the subquery can be reflected as
1773  * resjunk in the physical tlist; we need not punt.
1774  */
1775  var = makeVarFromTargetEntry(varno, tle);
1776 
1777  tlist = lappend(tlist,
1778  makeTargetEntry((Expr *) var,
1779  tle->resno,
1780  NULL,
1781  tle->resjunk));
1782  }
1783  break;
1784 
1785  case RTE_FUNCTION:
1786  case RTE_TABLEFUNC:
1787  case RTE_VALUES:
1788  case RTE_CTE:
1789  case RTE_NAMEDTUPLESTORE:
1790  case RTE_RESULT:
1791  /* Not all of these can have dropped cols, but share code anyway */
1792  expandRTE(rte, varno, 0, -1, true /* include dropped */ ,
1793  NULL, &colvars);
1794  foreach(l, colvars)
1795  {
1796  var = (Var *) lfirst(l);
1797 
1798  /*
1799  * A non-Var in expandRTE's output means a dropped column;
1800  * must punt.
1801  */
1802  if (!IsA(var, Var))
1803  {
1804  tlist = NIL;
1805  break;
1806  }
1807 
1808  tlist = lappend(tlist,
1809  makeTargetEntry((Expr *) var,
1810  var->varattno,
1811  NULL,
1812  false));
1813  }
1814  break;
1815 
1816  default:
1817  /* caller error */
1818  elog(ERROR, "unsupported RTE kind %d in build_physical_tlist",
1819  (int) rte->rtekind);
1820  break;
1821  }
1822 
1823  return tlist;
1824 }
unsigned int Index
Definition: c.h:598
List * lappend(List *list, void *datum)
Definition: list.c:338
#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:179
void expandRTE(RangeTblEntry *rte, int rtindex, int sublevels_up, int location, bool include_dropped, List **colnames, List **colvars)
@ RTE_CTE
Definition: parsenodes.h:1019
@ RTE_NAMEDTUPLESTORE
Definition: parsenodes.h:1020
@ RTE_VALUES
Definition: parsenodes.h:1018
@ RTE_SUBQUERY
Definition: parsenodes.h:1014
@ RTE_RESULT
Definition: parsenodes.h:1021
@ RTE_FUNCTION
Definition: parsenodes.h:1016
@ RTE_TABLEFUNC
Definition: parsenodes.h:1017
@ RTE_RELATION
Definition: parsenodes.h:1013
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:561
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:207
#define lfirst(lc)
Definition: pg_list.h:172
#define NIL
Definition: pg_list.h:68
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:507
Definition: pg_list.h:54
List * targetList
Definition: parsenodes.h:189
Query * subquery
Definition: parsenodes.h:1080
RTEKind rtekind
Definition: parsenodes.h:1032
Index relid
Definition: pathnodes.h:913
TupleDesc rd_att
Definition: rel.h:111
AttrNumber resno
Definition: primnodes.h:1724
Definition: primnodes.h:223
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, 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 1013 of file plancat.c.

1015 {
1016  BlockNumber curpages;
1017  BlockNumber relpages;
1018  double reltuples;
1019  BlockNumber relallvisible;
1020  double density;
1021 
1022  if (RELKIND_HAS_TABLE_AM(rel->rd_rel->relkind))
1023  {
1024  table_relation_estimate_size(rel, attr_widths, pages, tuples,
1025  allvisfrac);
1026  }
1027  else if (rel->rd_rel->relkind == RELKIND_INDEX)
1028  {
1029  /*
1030  * XXX: It'd probably be good to move this into a callback, individual
1031  * index types e.g. know if they have a metapage.
1032  */
1033 
1034  /* it has storage, ok to call the smgr */
1035  curpages = RelationGetNumberOfBlocks(rel);
1036 
1037  /* report estimated # pages */
1038  *pages = curpages;
1039  /* quick exit if rel is clearly empty */
1040  if (curpages == 0)
1041  {
1042  *tuples = 0;
1043  *allvisfrac = 0;
1044  return;
1045  }
1046 
1047  /* coerce values in pg_class to more desirable types */
1048  relpages = (BlockNumber) rel->rd_rel->relpages;
1049  reltuples = (double) rel->rd_rel->reltuples;
1050  relallvisible = (BlockNumber) rel->rd_rel->relallvisible;
1051 
1052  /*
1053  * Discount the metapage while estimating the number of tuples. This
1054  * is a kluge because it assumes more than it ought to about index
1055  * structure. Currently it's OK for btree, hash, and GIN indexes but
1056  * suspect for GiST indexes.
1057  */
1058  if (relpages > 0)
1059  {
1060  curpages--;
1061  relpages--;
1062  }
1063 
1064  /* estimate number of tuples from previous tuple density */
1065  if (reltuples >= 0 && relpages > 0)
1066  density = reltuples / (double) relpages;
1067  else
1068  {
1069  /*
1070  * If we have no data because the relation was never vacuumed,
1071  * estimate tuple width from attribute datatypes. We assume here
1072  * that the pages are completely full, which is OK for tables
1073  * (since they've presumably not been VACUUMed yet) but is
1074  * probably an overestimate for indexes. Fortunately
1075  * get_relation_info() can clamp the overestimate to the parent
1076  * table's size.
1077  *
1078  * Note: this code intentionally disregards alignment
1079  * considerations, because (a) that would be gilding the lily
1080  * considering how crude the estimate is, and (b) it creates
1081  * platform dependencies in the default plans which are kind of a
1082  * headache for regression testing.
1083  *
1084  * XXX: Should this logic be more index specific?
1085  */
1086  int32 tuple_width;
1087 
1088  tuple_width = get_rel_data_width(rel, attr_widths);
1089  tuple_width += MAXALIGN(SizeofHeapTupleHeader);
1090  tuple_width += sizeof(ItemIdData);
1091  /* note: integer division is intentional here */
1092  density = (BLCKSZ - SizeOfPageHeaderData) / tuple_width;
1093  }
1094  *tuples = rint(density * (double) curpages);
1095 
1096  /*
1097  * We use relallvisible as-is, rather than scaling it up like we do
1098  * for the pages and tuples counts, on the theory that any pages added
1099  * since the last VACUUM are most likely not marked all-visible. But
1100  * costsize.c wants it converted to a fraction.
1101  */
1102  if (relallvisible == 0 || curpages <= 0)
1103  *allvisfrac = 0;
1104  else if ((double) relallvisible >= curpages)
1105  *allvisfrac = 1;
1106  else
1107  *allvisfrac = (double) relallvisible / curpages;
1108  }
1109  else
1110  {
1111  /*
1112  * Just use whatever's in pg_class. This covers foreign tables,
1113  * sequences, and also relkinds without storage (shouldn't get here?);
1114  * see initializations in AddNewRelationTuple(). Note that FDW must
1115  * cope if reltuples is -1!
1116  */
1117  *pages = rel->rd_rel->relpages;
1118  *tuples = rel->rd_rel->reltuples;
1119  *allvisfrac = 0;
1120  }
1121 }
uint32 BlockNumber
Definition: block.h:31
#define RelationGetNumberOfBlocks(reln)
Definition: bufmgr.h:156
#define SizeOfPageHeaderData
Definition: bufpage.h:213
#define MAXALIGN(LEN)
Definition: c.h:795
signed int int32
Definition: c.h:478
#define SizeofHeapTupleHeader
Definition: htup_details.h:185
if(TABLE==NULL||TABLE_index==NULL)
Definition: isn.c:77
struct ItemIdData ItemIdData
int32 get_rel_data_width(Relation rel, int32 *attr_widths)
Definition: plancat.c:1138
Form_pg_class rd_rel
Definition: rel.h:110
static void table_relation_estimate_size(Relation rel, int32 *attr_widths, BlockNumber *pages, double *tuples, double *allvisfrac)
Definition: tableam.h:1918

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

1987 {
1988  RegProcedure prosupport = get_func_support(funcid);
1990  SupportRequestSelectivity *sresult;
1991 
1992  /*
1993  * If no support function is provided, use our historical default
1994  * estimate, 0.3333333. This seems a pretty unprincipled choice, but
1995  * Postgres has been using that estimate for function calls since 1992.
1996  * The hoariness of this behavior suggests that we should not be in too
1997  * much hurry to use another value.
1998  */
1999  if (!prosupport)
2000  return (Selectivity) 0.3333333;
2001 
2002  req.type = T_SupportRequestSelectivity;
2003  req.root = root;
2004  req.funcid = funcid;
2005  req.args = args;
2006  req.inputcollid = inputcollid;
2007  req.is_join = is_join;
2008  req.varRelid = varRelid;
2009  req.jointype = jointype;
2010  req.sjinfo = sjinfo;
2011  req.selectivity = -1; /* to catch failure to set the value */
2012 
2013  sresult = (SupportRequestSelectivity *)
2014  DatumGetPointer(OidFunctionCall1(prosupport,
2015  PointerGetDatum(&req)));
2016 
2017  /* If support function fails, use default */
2018  if (sresult != &req)
2019  return (Selectivity) 0.3333333;
2020 
2021  if (req.selectivity < 0.0 || req.selectivity > 1.0)
2022  elog(ERROR, "invalid function selectivity: %f", req.selectivity);
2023 
2024  return (Selectivity) req.selectivity;
2025 }
regproc RegProcedure
Definition: c.h:634
RegProcedure get_func_support(Oid funcid)
Definition: lsyscache.c:1840
double Selectivity
Definition: nodes.h:261
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(), 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 2269 of file plancat.c.

2271 {
2272  Bitmapset *dependentCols = NULL;
2273  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2274  Relation relation;
2275  TupleDesc tupdesc;
2276  TupleConstr *constr;
2277 
2278  /* Assume we already have adequate lock */
2279  relation = table_open(rte->relid, NoLock);
2280 
2281  tupdesc = RelationGetDescr(relation);
2282  constr = tupdesc->constr;
2283 
2284  if (constr && constr->has_generated_stored)
2285  {
2286  for (int i = 0; i < constr->num_defval; i++)
2287  {
2288  AttrDefault *defval = &constr->defval[i];
2289  Node *expr;
2290  Bitmapset *attrs_used = NULL;
2291 
2292  /* skip if not generated column */
2293  if (!TupleDescAttr(tupdesc, defval->adnum - 1)->attgenerated)
2294  continue;
2295 
2296  /* identify columns this generated column depends on */
2297  expr = stringToNode(defval->adbin);
2298  pull_varattnos(expr, 1, &attrs_used);
2299 
2300  if (bms_overlap(target_cols, attrs_used))
2301  dependentCols = bms_add_member(dependentCols,
2303  }
2304  }
2305 
2306  table_close(relation, NoLock);
2307 
2308  return dependentCols;
2309 }
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:739
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:495
int i
Definition: isn.c:73
void * stringToNode(const char *str)
Definition: read.c:90
#define RelationGetDescr(relation)
Definition: rel.h:527
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:301

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

2103 {
2104  HeapTuple proctup;
2105  Form_pg_proc procform;
2106  double result;
2107 
2108  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2109  if (!HeapTupleIsValid(proctup))
2110  elog(ERROR, "cache lookup failed for function %u", funcid);
2111  procform = (Form_pg_proc) GETSTRUCT(proctup);
2112 
2113  Assert(procform->proretset); /* else caller error */
2114 
2115  if (OidIsValid(procform->prosupport))
2116  {
2117  SupportRequestRows req;
2118  SupportRequestRows *sresult;
2119 
2120  req.type = T_SupportRequestRows;
2121  req.root = root;
2122  req.funcid = funcid;
2123  req.node = node;
2124 
2125  req.rows = 0; /* just for sanity */
2126 
2127  sresult = (SupportRequestRows *)
2128  DatumGetPointer(OidFunctionCall1(procform->prosupport,
2129  PointerGetDatum(&req)));
2130 
2131  if (sresult == &req)
2132  {
2133  /* Success */
2134  ReleaseSysCache(proctup);
2135  return req.rows;
2136  }
2137  }
2138 
2139  /* No support function, or it failed, so rely on prorows */
2140  result = procform->prorows;
2141 
2142  ReleaseSysCache(proctup);
2143 
2144  return result;
2145 }
Assert(fmt[strlen(fmt) - 1] !='\n')
struct PlannerInfo * root
Definition: supportnodes.h:163

References Assert(), DatumGetPointer(), elog(), ERROR, SupportRequestRows::funcid, GETSTRUCT, HeapTupleIsValid, SupportRequestRows::node, ObjectIdGetDatum(), OidFunctionCall1, OidIsValid, PointerGetDatum(), PROCOID, ReleaseSysCache(), 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 1138 of file plancat.c.

1139 {
1140  int32 tuple_width = 0;
1141  int i;
1142 
1143  for (i = 1; i <= RelationGetNumberOfAttributes(rel); i++)
1144  {
1145  Form_pg_attribute att = TupleDescAttr(rel->rd_att, i - 1);
1146  int32 item_width;
1147 
1148  if (att->attisdropped)
1149  continue;
1150 
1151  /* use previously cached data, if any */
1152  if (attr_widths != NULL && attr_widths[i] > 0)
1153  {
1154  tuple_width += attr_widths[i];
1155  continue;
1156  }
1157 
1158  /* This should match set_rel_width() in costsize.c */
1159  item_width = get_attavgwidth(RelationGetRelid(rel), i);
1160  if (item_width <= 0)
1161  {
1162  item_width = get_typavgwidth(att->atttypid, att->atttypmod);
1163  Assert(item_width > 0);
1164  }
1165  if (attr_widths != NULL)
1166  attr_widths[i] = item_width;
1167  tuple_width += item_width;
1168  }
1169 
1170  return tuple_width;
1171 }
int32 get_attavgwidth(Oid relid, AttrNumber attnum)
Definition: lsyscache.c:3116
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition: lsyscache.c:2536
#define RelationGetRelid(relation)
Definition: rel.h:501

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().

◆ get_relation_data_width()

int32 get_relation_data_width ( Oid  relid,
int32 attr_widths 
)

Definition at line 1180 of file plancat.c.

1181 {
1182  int32 result;
1183  Relation relation;
1184 
1185  /* As above, assume relation is already locked */
1186  relation = table_open(relid, NoLock);
1187 
1188  result = get_rel_data_width(relation, attr_widths);
1189 
1190  table_close(relation, NoLock);
1191 
1192  return result;
1193 }

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

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

References _bt_getrootheight(), 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::amgettuple, IndexOptInfo::amhasgetbitmap, IndexOptInfo::amhasgettuple, IndexAmRoutine::ammarkpos, IndexAmRoutine::amoptionalkey, IndexOptInfo::amoptionalkey, IndexAmRoutine::amrestrpos, IndexAmRoutine::amsearcharray, IndexOptInfo::amsearcharray, IndexAmRoutine::amsearchnulls, IndexOptInfo::amsearchnulls, Assert(), BTLessStrategyNumber, build_index_tlist(), ChangeVarNodes(), ereport, errcode(), errdetail_relkind_not_supported(), errmsg(), ERROR, estimate_rel_size(), 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(), RelOptInfo::indexlist, IndexOptInfo::indexoid, 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, OidIsValid, 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(), RelOptInfo::rel_parallel_workers, IndexOptInfo::relam, RelationGetForm, RelationGetIndexAttOptions(), RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), RelationGetNumberOfAttributes, RelationGetNumberOfBlocks, RelationGetParallelWorkers, RelationGetRelationName, RelationGetRelid, RelationIsPermanent, RelOptInfo::relid, RelOptInfo::reltablespace, IndexOptInfo::reltablespace, 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, PlannerGlobal::transientPlan, IndexOptInfo::tree_height, RelOptInfo::tuples, IndexOptInfo::tuples, and IndexOptInfo::unique.

Referenced by build_simple_rel().

◆ has_row_triggers()

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

Definition at line 2192 of file plancat.c.

2193 {
2194  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2195  Relation relation;
2196  TriggerDesc *trigDesc;
2197  bool result = false;
2198 
2199  /* Assume we already have adequate lock */
2200  relation = table_open(rte->relid, NoLock);
2201 
2202  trigDesc = relation->trigdesc;
2203  switch (event)
2204  {
2205  case CMD_INSERT:
2206  if (trigDesc &&
2207  (trigDesc->trig_insert_after_row ||
2208  trigDesc->trig_insert_before_row))
2209  result = true;
2210  break;
2211  case CMD_UPDATE:
2212  if (trigDesc &&
2213  (trigDesc->trig_update_after_row ||
2214  trigDesc->trig_update_before_row))
2215  result = true;
2216  break;
2217  case CMD_DELETE:
2218  if (trigDesc &&
2219  (trigDesc->trig_delete_after_row ||
2220  trigDesc->trig_delete_before_row))
2221  result = true;
2222  break;
2223  /* There is no separate event for MERGE, only INSERT/UPDATE/DELETE */
2224  case CMD_MERGE:
2225  result = false;
2226  break;
2227  default:
2228  elog(ERROR, "unrecognized CmdType: %d", (int) event);
2229  break;
2230  }
2231 
2232  table_close(relation, NoLock);
2233  return result;
2234 }
@ CMD_MERGE
Definition: nodes.h:280
@ CMD_INSERT
Definition: nodes.h:278
@ CMD_DELETE
Definition: nodes.h:279
@ CMD_UPDATE
Definition: nodes.h:277
TriggerDesc * trigdesc
Definition: rel.h:116
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, 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 2242 of file plancat.c.

2243 {
2244  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2245  Relation relation;
2246  TupleDesc tupdesc;
2247  bool result = false;
2248 
2249  /* Assume we already have adequate lock */
2250  relation = table_open(rte->relid, NoLock);
2251 
2252  tupdesc = RelationGetDescr(relation);
2253  result = tupdesc->constr && tupdesc->constr->has_generated_stored;
2254 
2255  table_close(relation, NoLock);
2256 
2257  return result;
2258 }

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

Referenced by make_modifytable().

◆ has_unique_index()

bool has_unique_index ( RelOptInfo rel,
AttrNumber  attno 
)

Definition at line 2160 of file plancat.c.

2161 {
2162  ListCell *ilist;
2163 
2164  foreach(ilist, rel->indexlist)
2165  {
2166  IndexOptInfo *index = (IndexOptInfo *) lfirst(ilist);
2167 
2168  /*
2169  * Note: ignore partial indexes, since they don't allow us to conclude
2170  * that all attr values are distinct, *unless* they are marked predOK
2171  * which means we know the index's predicate is satisfied by the
2172  * query. We don't take any interest in expressional indexes either.
2173  * Also, a multicolumn unique index doesn't allow us to conclude that
2174  * just the specified attr is unique.
2175  */
2176  if (index->unique &&
2177  index->nkeycolumns == 1 &&
2178  index->indexkeys[0] == attno &&
2179  (index->indpred == NIL || index->predOK))
2180  return true;
2181  }
2182  return false;
2183 }

References RelOptInfo::indexlist, lfirst, and NIL.

Referenced by examine_variable().

◆ infer_arbiter_indexes()

List* infer_arbiter_indexes ( PlannerInfo root)

Definition at line 665 of file plancat.c.

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

References OnConflictExpr::action, OnConflictExpr::arbiterElems, OnConflictExpr::arbiterWhere, bms_add_member(), bms_equal(), 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, Query::onConflict, ONCONFLICT_UPDATE, PlannerInfo::parse, predicate_implied_by(), RelationData::rd_index, RelationGetIndexExpressions(), RelationGetIndexList(), RelationGetIndexPredicate(), RangeTblEntry::relid, RangeTblEntry::rellockmode, rt_fetch, Query::rtable, 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 1938 of file plancat.c.

1944 {
1945  RegProcedure oprjoin = get_oprjoin(operatorid);
1946  float8 result;
1947 
1948  /*
1949  * if the oprjoin procedure is missing for whatever reason, use a
1950  * selectivity of 0.5
1951  */
1952  if (!oprjoin)
1953  return (Selectivity) 0.5;
1954 
1955  result = DatumGetFloat8(OidFunctionCall5Coll(oprjoin,
1956  inputcollid,
1957  PointerGetDatum(root),
1958  ObjectIdGetDatum(operatorid),
1960  Int16GetDatum(jointype),
1961  PointerGetDatum(sjinfo)));
1962 
1963  if (result < 0.0 || result > 1.0)
1964  elog(ERROR, "invalid join selectivity: %f", result);
1965 
1966  return (Selectivity) result;
1967 }
double float8
Definition: c.h:614
Datum OidFunctionCall5Coll(Oid functionId, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4, Datum arg5)
Definition: fmgr.c:1440
RegProcedure get_oprjoin(Oid opno)
Definition: lsyscache.c:1563
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(), and PointerGetDatum().

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

1531 {
1532  bool include_noinherit;
1533  bool include_notnull;
1534  bool include_partition = false;
1535  List *safe_restrictions;
1536  List *constraint_pred;
1537  List *safe_constraints;
1538  ListCell *lc;
1539 
1540  /* As of now, constraint exclusion works only with simple relations. */
1541  Assert(IS_SIMPLE_REL(rel));
1542 
1543  /*
1544  * If there are no base restriction clauses, we have no hope of proving
1545  * anything below, so fall out quickly.
1546  */
1547  if (rel->baserestrictinfo == NIL)
1548  return false;
1549 
1550  /*
1551  * Regardless of the setting of constraint_exclusion, detect
1552  * constant-FALSE-or-NULL restriction clauses. Because const-folding will
1553  * reduce "anything AND FALSE" to just "FALSE", any such case should
1554  * result in exactly one baserestrictinfo entry. This doesn't fire very
1555  * often, but it seems cheap enough to be worth doing anyway. (Without
1556  * this, we'd miss some optimizations that 9.5 and earlier found via much
1557  * more roundabout methods.)
1558  */
1559  if (list_length(rel->baserestrictinfo) == 1)
1560  {
1562  Expr *clause = rinfo->clause;
1563 
1564  if (clause && IsA(clause, Const) &&
1565  (((Const *) clause)->constisnull ||
1566  !DatumGetBool(((Const *) clause)->constvalue)))
1567  return true;
1568  }
1569 
1570  /*
1571  * Skip further tests, depending on constraint_exclusion.
1572  */
1573  switch (constraint_exclusion)
1574  {
1576  /* In 'off' mode, never make any further tests */
1577  return false;
1578 
1580 
1581  /*
1582  * When constraint_exclusion is set to 'partition' we only handle
1583  * appendrel members. Partition pruning has already been applied,
1584  * so there is no need to consider the rel's partition constraints
1585  * here.
1586  */
1587  if (rel->reloptkind == RELOPT_OTHER_MEMBER_REL)
1588  break; /* appendrel member, so process it */
1589  return false;
1590 
1592 
1593  /*
1594  * In 'on' mode, always apply constraint exclusion. If we are
1595  * considering a baserel that is a partition (i.e., it was
1596  * directly named rather than expanded from a parent table), then
1597  * its partition constraints haven't been considered yet, so
1598  * include them in the processing here.
1599  */
1600  if (rel->reloptkind == RELOPT_BASEREL)
1601  include_partition = true;
1602  break; /* always try to exclude */
1603  }
1604 
1605  /*
1606  * Check for self-contradictory restriction clauses. We dare not make
1607  * deductions with non-immutable functions, but any immutable clauses that
1608  * are self-contradictory allow us to conclude the scan is unnecessary.
1609  *
1610  * Note: strip off RestrictInfo because predicate_refuted_by() isn't
1611  * expecting to see any in its predicate argument.
1612  */
1613  safe_restrictions = NIL;
1614  foreach(lc, rel->baserestrictinfo)
1615  {
1616  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1617 
1618  if (!contain_mutable_functions((Node *) rinfo->clause))
1619  safe_restrictions = lappend(safe_restrictions, rinfo->clause);
1620  }
1621 
1622  /*
1623  * We can use weak refutation here, since we're comparing restriction
1624  * clauses with restriction clauses.
1625  */
1626  if (predicate_refuted_by(safe_restrictions, safe_restrictions, true))
1627  return true;
1628 
1629  /*
1630  * Only plain relations have constraints, so stop here for other rtekinds.
1631  */
1632  if (rte->rtekind != RTE_RELATION)
1633  return false;
1634 
1635  /*
1636  * If we are scanning just this table, we can use NO INHERIT constraints,
1637  * but not if we're scanning its children too. (Note that partitioned
1638  * tables should never have NO INHERIT constraints; but it's not necessary
1639  * for us to assume that here.)
1640  */
1641  include_noinherit = !rte->inh;
1642 
1643  /*
1644  * Currently, attnotnull constraints must be treated as NO INHERIT unless
1645  * this is a partitioned table. In future we might track their
1646  * inheritance status more accurately, allowing this to be refined.
1647  */
1648  include_notnull = (!rte->inh || rte->relkind == RELKIND_PARTITIONED_TABLE);
1649 
1650  /*
1651  * Fetch the appropriate set of constraint expressions.
1652  */
1653  constraint_pred = get_relation_constraints(root, rte->relid, rel,
1654  include_noinherit,
1655  include_notnull,
1656  include_partition);
1657 
1658  /*
1659  * We do not currently enforce that CHECK constraints contain only
1660  * immutable functions, so it's necessary to check here. We daren't draw
1661  * conclusions from plan-time evaluation of non-immutable functions. Since
1662  * they're ANDed, we can just ignore any mutable constraints in the list,
1663  * and reason about the rest.
1664  */
1665  safe_constraints = NIL;
1666  foreach(lc, constraint_pred)
1667  {
1668  Node *pred = (Node *) lfirst(lc);
1669 
1670  if (!contain_mutable_functions(pred))
1671  safe_constraints = lappend(safe_constraints, pred);
1672  }
1673 
1674  /*
1675  * The constraints are effectively ANDed together, so we can just try to
1676  * refute the entire collection at once. This may allow us to make proofs
1677  * that would fail if we took them individually.
1678  *
1679  * Note: we use rel->baserestrictinfo, not safe_restrictions as might seem
1680  * an obvious optimization. Some of the clauses might be OR clauses that
1681  * have volatile and nonvolatile subclauses, and it's OK to make
1682  * deductions with the nonvolatile parts.
1683  *
1684  * We need strong refutation because we have to prove that the constraints
1685  * would yield false, not just NULL.
1686  */
1687  if (predicate_refuted_by(safe_constraints, rel->baserestrictinfo, false))
1688  return true;
1689 
1690  return false;
1691 }
bool contain_mutable_functions(Node *clause)
Definition: clauses.c:365
@ 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:834
@ RELOPT_BASEREL
Definition: pathnodes.h:821
@ RELOPT_OTHER_MEMBER_REL
Definition: pathnodes.h:823
static int list_length(const List *l)
Definition: pg_list.h:152
#define linitial(l)
Definition: pg_list.h:178
int constraint_exclusion
Definition: plancat.c:58
static List * get_relation_constraints(PlannerInfo *root, Oid relationObjectId, RelOptInfo *rel, bool include_noinherit, bool include_notnull, bool include_partition)
Definition: plancat.c:1220
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:974
RelOptKind reloptkind
Definition: pathnodes.h:860
Expr * clause
Definition: pathnodes.h:2517

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, linitial, list_length(), NIL, predicate_refuted_by(), RangeTblEntry::relid, RangeTblEntry::relkind, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, 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 1899 of file plancat.c.

1904 {
1905  RegProcedure oprrest = get_oprrest(operatorid);
1906  float8 result;
1907 
1908  /*
1909  * if the oprrest procedure is missing for whatever reason, use a
1910  * selectivity of 0.5
1911  */
1912  if (!oprrest)
1913  return (Selectivity) 0.5;
1914 
1915  result = DatumGetFloat8(OidFunctionCall4Coll(oprrest,
1916  inputcollid,
1917  PointerGetDatum(root),
1918  ObjectIdGetDatum(operatorid),
1920  Int32GetDatum(varRelid)));
1921 
1922  if (result < 0.0 || result > 1.0)
1923  elog(ERROR, "invalid restriction selectivity: %f", result);
1924 
1925  return (Selectivity) result;
1926 }
Datum OidFunctionCall4Coll(Oid functionId, Oid collation, Datum arg1, Datum arg2, Datum arg3, Datum arg4)
Definition: fmgr.c:1429
RegProcedure get_oprrest(Oid opno)
Definition: lsyscache.c:1539
static Datum Int32GetDatum(int32 X)
Definition: postgres.h:212

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

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

Referenced by get_relation_info().