PostgreSQL Source Code  git master
plancat.c File Reference
#include "postgres.h"
#include <math.h>
#include "access/genam.h"
#include "access/htup_details.h"
#include "access/nbtree.h"
#include "access/sysattr.h"
#include "access/table.h"
#include "access/tableam.h"
#include "access/transam.h"
#include "access/xlog.h"
#include "catalog/catalog.h"
#include "catalog/heap.h"
#include "catalog/pg_am.h"
#include "catalog/pg_proc.h"
#include "catalog/pg_statistic_ext.h"
#include "catalog/pg_statistic_ext_data.h"
#include "foreign/fdwapi.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "nodes/supportnodes.h"
#include "optimizer/cost.h"
#include "optimizer/optimizer.h"
#include "optimizer/plancat.h"
#include "parser/parse_relation.h"
#include "parser/parsetree.h"
#include "partitioning/partdesc.h"
#include "rewrite/rewriteManip.h"
#include "statistics/statistics.h"
#include "storage/bufmgr.h"
#include "utils/builtins.h"
#include "utils/lsyscache.h"
#include "utils/partcache.h"
#include "utils/rel.h"
#include "utils/snapmgr.h"
#include "utils/syscache.h"
Include dependency graph for plancat.c:

Go to the source code of this file.

Functions

static void get_relation_foreign_keys (PlannerInfo *root, RelOptInfo *rel, Relation relation, bool inhparent)
 
static bool infer_collation_opclass_match (InferenceElem *elem, Relation idxRel, List *idxExprs)
 
static Listget_relation_constraints (PlannerInfo *root, Oid relationObjectId, RelOptInfo *rel, bool include_noinherit, bool include_notnull, bool include_partition)
 
static Listbuild_index_tlist (PlannerInfo *root, IndexOptInfo *index, Relation heapRelation)
 
static Listget_relation_statistics (RelOptInfo *rel, Relation relation)
 
static void set_relation_partition_info (PlannerInfo *root, RelOptInfo *rel, Relation relation)
 
static PartitionScheme find_partition_scheme (PlannerInfo *root, Relation relation)
 
static void set_baserel_partition_key_exprs (Relation relation, RelOptInfo *rel)
 
static void set_baserel_partition_constraint (Relation relation, RelOptInfo *rel)
 
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)
 
static void get_relation_statistics_worker (List **stainfos, RelOptInfo *rel, Oid statOid, bool inh, Bitmapset *keys, List *exprs)
 
bool relation_excluded_by_constraints (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
Listbuild_physical_tlist (PlannerInfo *root, RelOptInfo *rel)
 
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_unique_index (RelOptInfo *rel, AttrNumber attno)
 
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

int constraint_exclusion = CONSTRAINT_EXCLUSION_PARTITION
 
get_relation_info_hook_type get_relation_info_hook = NULL
 

Function Documentation

◆ add_function_cost()

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

Definition at line 2077 of file plancat.c.

2079 {
2080  HeapTuple proctup;
2081  Form_pg_proc procform;
2082 
2083  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2084  if (!HeapTupleIsValid(proctup))
2085  elog(ERROR, "cache lookup failed for function %u", funcid);
2086  procform = (Form_pg_proc) GETSTRUCT(proctup);
2087 
2088  if (OidIsValid(procform->prosupport))
2089  {
2090  SupportRequestCost req;
2091  SupportRequestCost *sresult;
2092 
2093  req.type = T_SupportRequestCost;
2094  req.root = root;
2095  req.funcid = funcid;
2096  req.node = node;
2097 
2098  /* Initialize cost fields so that support function doesn't have to */
2099  req.startup = 0;
2100  req.per_tuple = 0;
2101 
2102  sresult = (SupportRequestCost *)
2103  DatumGetPointer(OidFunctionCall1(procform->prosupport,
2104  PointerGetDatum(&req)));
2105 
2106  if (sresult == &req)
2107  {
2108  /* Success, so accumulate support function's estimate into *cost */
2109  cost->startup += req.startup;
2110  cost->per_tuple += req.per_tuple;
2111  ReleaseSysCache(proctup);
2112  return;
2113  }
2114  }
2115 
2116  /* No support function, or it failed, so rely on procost */
2117  cost->per_tuple += procform->procost * cpu_operator_cost;
2118 
2119  ReleaseSysCache(proctup);
2120 }
#define OidIsValid(objectId)
Definition: c.h:775
double cpu_operator_cost
Definition: costsize.c:123
#define ERROR
Definition: elog.h:39
#define elog(elevel,...)
Definition: elog.h:224
#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
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:266
HeapTuple SearchSysCache1(int cacheId, Datum key1)
Definition: syscache.c:218

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

static List * build_index_tlist ( PlannerInfo root,
IndexOptInfo index,
Relation  heapRelation 
)
static

Definition at line 1873 of file plancat.c.

1875 {
1876  List *tlist = NIL;
1877  Index varno = index->rel->relid;
1878  ListCell *indexpr_item;
1879  int i;
1880 
1881  indexpr_item = list_head(index->indexprs);
1882  for (i = 0; i < index->ncolumns; i++)
1883  {
1884  int indexkey = index->indexkeys[i];
1885  Expr *indexvar;
1886 
1887  if (indexkey != 0)
1888  {
1889  /* simple column */
1890  const FormData_pg_attribute *att_tup;
1891 
1892  if (indexkey < 0)
1893  att_tup = SystemAttributeDefinition(indexkey);
1894  else
1895  att_tup = TupleDescAttr(heapRelation->rd_att, indexkey - 1);
1896 
1897  indexvar = (Expr *) makeVar(varno,
1898  indexkey,
1899  att_tup->atttypid,
1900  att_tup->atttypmod,
1901  att_tup->attcollation,
1902  0);
1903  }
1904  else
1905  {
1906  /* expression column */
1907  if (indexpr_item == NULL)
1908  elog(ERROR, "wrong number of index expressions");
1909  indexvar = (Expr *) lfirst(indexpr_item);
1910  indexpr_item = lnext(index->indexprs, indexpr_item);
1911  }
1912 
1913  tlist = lappend(tlist,
1914  makeTargetEntry(indexvar,
1915  i + 1,
1916  NULL,
1917  false));
1918  }
1919  if (indexpr_item != NULL)
1920  elog(ERROR, "wrong number of index expressions");
1921 
1922  return tlist;
1923 }
unsigned int Index
Definition: c.h:614
const FormData_pg_attribute * SystemAttributeDefinition(AttrNumber attno)
Definition: heap.c:240
int i
Definition: isn.c:73
List * lappend(List *list, void *datum)
Definition: list.c:339
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
FormData_pg_attribute
Definition: pg_attribute.h:193
#define lfirst(lc)
Definition: pg_list.h:172
#define NIL
Definition: pg_list.h:68
static ListCell * list_head(const List *l)
Definition: pg_list.h:128
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:343
Definition: pg_list.h:54
TupleDesc rd_att
Definition: rel.h:112
Definition: type.h:95
#define TupleDescAttr(tupdesc, i)
Definition: tupdesc.h:92

References elog, ERROR, FormData_pg_attribute, i, lappend(), lfirst, list_head(), lnext(), makeTargetEntry(), makeVar(), NIL, RelationData::rd_att, SystemAttributeDefinition(), and TupleDescAttr.

Referenced by get_relation_info().

◆ build_physical_tlist()

List* build_physical_tlist ( PlannerInfo root,
RelOptInfo rel 
)

Definition at line 1752 of file plancat.c.

1753 {
1754  List *tlist = NIL;
1755  Index varno = rel->relid;
1756  RangeTblEntry *rte = planner_rt_fetch(varno, root);
1757  Relation relation;
1758  Query *subquery;
1759  Var *var;
1760  ListCell *l;
1761  int attrno,
1762  numattrs;
1763  List *colvars;
1764 
1765  switch (rte->rtekind)
1766  {
1767  case RTE_RELATION:
1768  /* Assume we already have adequate lock */
1769  relation = table_open(rte->relid, NoLock);
1770 
1771  numattrs = RelationGetNumberOfAttributes(relation);
1772  for (attrno = 1; attrno <= numattrs; attrno++)
1773  {
1774  Form_pg_attribute att_tup = TupleDescAttr(relation->rd_att,
1775  attrno - 1);
1776 
1777  if (att_tup->attisdropped || att_tup->atthasmissing)
1778  {
1779  /* found a dropped or missing col, so punt */
1780  tlist = NIL;
1781  break;
1782  }
1783 
1784  var = makeVar(varno,
1785  attrno,
1786  att_tup->atttypid,
1787  att_tup->atttypmod,
1788  att_tup->attcollation,
1789  0);
1790 
1791  tlist = lappend(tlist,
1792  makeTargetEntry((Expr *) var,
1793  attrno,
1794  NULL,
1795  false));
1796  }
1797 
1798  table_close(relation, NoLock);
1799  break;
1800 
1801  case RTE_SUBQUERY:
1802  subquery = rte->subquery;
1803  foreach(l, subquery->targetList)
1804  {
1805  TargetEntry *tle = (TargetEntry *) lfirst(l);
1806 
1807  /*
1808  * A resjunk column of the subquery can be reflected as
1809  * resjunk in the physical tlist; we need not punt.
1810  */
1811  var = makeVarFromTargetEntry(varno, tle);
1812 
1813  tlist = lappend(tlist,
1814  makeTargetEntry((Expr *) var,
1815  tle->resno,
1816  NULL,
1817  tle->resjunk));
1818  }
1819  break;
1820 
1821  case RTE_FUNCTION:
1822  case RTE_TABLEFUNC:
1823  case RTE_VALUES:
1824  case RTE_CTE:
1825  case RTE_NAMEDTUPLESTORE:
1826  case RTE_RESULT:
1827  /* Not all of these can have dropped cols, but share code anyway */
1828  expandRTE(rte, varno, 0, -1, true /* include dropped */ ,
1829  NULL, &colvars);
1830  foreach(l, colvars)
1831  {
1832  var = (Var *) lfirst(l);
1833 
1834  /*
1835  * A non-Var in expandRTE's output means a dropped column;
1836  * must punt.
1837  */
1838  if (!IsA(var, Var))
1839  {
1840  tlist = NIL;
1841  break;
1842  }
1843 
1844  tlist = lappend(tlist,
1845  makeTargetEntry((Expr *) var,
1846  var->varattno,
1847  NULL,
1848  false));
1849  }
1850  break;
1851 
1852  default:
1853  /* caller error */
1854  elog(ERROR, "unsupported RTE kind %d in build_physical_tlist",
1855  (int) rte->rtekind);
1856  break;
1857  }
1858 
1859  return tlist;
1860 }
#define NoLock
Definition: lockdefs.h:34
Var * makeVarFromTargetEntry(int varno, TargetEntry *tle)
Definition: makefuncs.c:105
#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:1034
@ RTE_NAMEDTUPLESTORE
Definition: parsenodes.h:1035
@ RTE_VALUES
Definition: parsenodes.h:1033
@ RTE_SUBQUERY
Definition: parsenodes.h:1029
@ RTE_RESULT
Definition: parsenodes.h:1036
@ RTE_FUNCTION
Definition: parsenodes.h:1031
@ RTE_TABLEFUNC
Definition: parsenodes.h:1032
@ RTE_RELATION
Definition: parsenodes.h:1028
#define planner_rt_fetch(rti, root)
Definition: pathnodes.h:564
FormData_pg_attribute * Form_pg_attribute
Definition: pg_attribute.h:209
#define RelationGetNumberOfAttributes(relation)
Definition: rel.h:511
List * targetList
Definition: parsenodes.h:191
Query * subquery
Definition: parsenodes.h:1114
RTEKind rtekind
Definition: parsenodes.h:1057
Index relid
Definition: pathnodes.h:912
AttrNumber resno
Definition: primnodes.h:2188
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

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

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

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

◆ find_partition_scheme()

static PartitionScheme find_partition_scheme ( PlannerInfo root,
Relation  relation 
)
static

Definition at line 2383 of file plancat.c.

2384 {
2385  PartitionKey partkey = RelationGetPartitionKey(relation);
2386  ListCell *lc;
2387  int partnatts,
2388  i;
2389  PartitionScheme part_scheme;
2390 
2391  /* A partitioned table should have a partition key. */
2392  Assert(partkey != NULL);
2393 
2394  partnatts = partkey->partnatts;
2395 
2396  /* Search for a matching partition scheme and return if found one. */
2397  foreach(lc, root->part_schemes)
2398  {
2399  part_scheme = lfirst(lc);
2400 
2401  /* Match partitioning strategy and number of keys. */
2402  if (partkey->strategy != part_scheme->strategy ||
2403  partnatts != part_scheme->partnatts)
2404  continue;
2405 
2406  /* Match partition key type properties. */
2407  if (memcmp(partkey->partopfamily, part_scheme->partopfamily,
2408  sizeof(Oid) * partnatts) != 0 ||
2409  memcmp(partkey->partopcintype, part_scheme->partopcintype,
2410  sizeof(Oid) * partnatts) != 0 ||
2411  memcmp(partkey->partcollation, part_scheme->partcollation,
2412  sizeof(Oid) * partnatts) != 0)
2413  continue;
2414 
2415  /*
2416  * Length and byval information should match when partopcintype
2417  * matches.
2418  */
2419  Assert(memcmp(partkey->parttyplen, part_scheme->parttyplen,
2420  sizeof(int16) * partnatts) == 0);
2421  Assert(memcmp(partkey->parttypbyval, part_scheme->parttypbyval,
2422  sizeof(bool) * partnatts) == 0);
2423 
2424  /*
2425  * If partopfamily and partopcintype matched, must have the same
2426  * partition comparison functions. Note that we cannot reliably
2427  * Assert the equality of function structs themselves for they might
2428  * be different across PartitionKey's, so just Assert for the function
2429  * OIDs.
2430  */
2431 #ifdef USE_ASSERT_CHECKING
2432  for (i = 0; i < partkey->partnatts; i++)
2433  Assert(partkey->partsupfunc[i].fn_oid ==
2434  part_scheme->partsupfunc[i].fn_oid);
2435 #endif
2436 
2437  /* Found matching partition scheme. */
2438  return part_scheme;
2439  }
2440 
2441  /*
2442  * Did not find matching partition scheme. Create one copying relevant
2443  * information from the relcache. We need to copy the contents of the
2444  * array since the relcache entry may not survive after we have closed the
2445  * relation.
2446  */
2447  part_scheme = (PartitionScheme) palloc0(sizeof(PartitionSchemeData));
2448  part_scheme->strategy = partkey->strategy;
2449  part_scheme->partnatts = partkey->partnatts;
2450 
2451  part_scheme->partopfamily = (Oid *) palloc(sizeof(Oid) * partnatts);
2452  memcpy(part_scheme->partopfamily, partkey->partopfamily,
2453  sizeof(Oid) * partnatts);
2454 
2455  part_scheme->partopcintype = (Oid *) palloc(sizeof(Oid) * partnatts);
2456  memcpy(part_scheme->partopcintype, partkey->partopcintype,
2457  sizeof(Oid) * partnatts);
2458 
2459  part_scheme->partcollation = (Oid *) palloc(sizeof(Oid) * partnatts);
2460  memcpy(part_scheme->partcollation, partkey->partcollation,
2461  sizeof(Oid) * partnatts);
2462 
2463  part_scheme->parttyplen = (int16 *) palloc(sizeof(int16) * partnatts);
2464  memcpy(part_scheme->parttyplen, partkey->parttyplen,
2465  sizeof(int16) * partnatts);
2466 
2467  part_scheme->parttypbyval = (bool *) palloc(sizeof(bool) * partnatts);
2468  memcpy(part_scheme->parttypbyval, partkey->parttypbyval,
2469  sizeof(bool) * partnatts);
2470 
2471  part_scheme->partsupfunc = (FmgrInfo *)
2472  palloc(sizeof(FmgrInfo) * partnatts);
2473  for (i = 0; i < partnatts; i++)
2474  fmgr_info_copy(&part_scheme->partsupfunc[i], &partkey->partsupfunc[i],
2476 
2477  /* Add the partitioning scheme to PlannerInfo. */
2478  root->part_schemes = lappend(root->part_schemes, part_scheme);
2479 
2480  return part_scheme;
2481 }
signed short int16
Definition: c.h:493
#define Assert(condition)
Definition: c.h:858
void fmgr_info_copy(FmgrInfo *dstinfo, FmgrInfo *srcinfo, MemoryContext destcxt)
Definition: fmgr.c:580
void * palloc0(Size size)
Definition: mcxt.c:1347
MemoryContext CurrentMemoryContext
Definition: mcxt.c:143
void * palloc(Size size)
Definition: mcxt.c:1317
PartitionKey RelationGetPartitionKey(Relation rel)
Definition: partcache.c:51
struct PartitionSchemeData * PartitionScheme
Definition: pathnodes.h:598
unsigned int Oid
Definition: postgres_ext.h:31
Definition: fmgr.h:57
Oid fn_oid
Definition: fmgr.h:59
Oid * partcollation
Definition: partcache.h:39
Oid * partopfamily
Definition: partcache.h:34
bool * parttypbyval
Definition: partcache.h:45
PartitionStrategy strategy
Definition: partcache.h:27
int16 * parttyplen
Definition: partcache.h:44
FmgrInfo * partsupfunc
Definition: partcache.h:36
Oid * partopcintype
Definition: partcache.h:35
struct FmgrInfo * partsupfunc
Definition: pathnodes.h:595

References Assert, CurrentMemoryContext, fmgr_info_copy(), FmgrInfo::fn_oid, i, lappend(), lfirst, palloc(), palloc0(), PartitionSchemeData::partcollation, PartitionKeyData::partcollation, PartitionSchemeData::partnatts, PartitionKeyData::partnatts, PartitionSchemeData::partopcintype, PartitionKeyData::partopcintype, PartitionSchemeData::partopfamily, PartitionKeyData::partopfamily, PartitionSchemeData::partsupfunc, PartitionKeyData::partsupfunc, PartitionSchemeData::parttypbyval, PartitionKeyData::parttypbyval, PartitionSchemeData::parttyplen, PartitionKeyData::parttyplen, RelationGetPartitionKey(), root, PartitionSchemeData::strategy, and PartitionKeyData::strategy.

Referenced by set_relation_partition_info().

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

2023 {
2024  RegProcedure prosupport = get_func_support(funcid);
2026  SupportRequestSelectivity *sresult;
2027 
2028  /*
2029  * If no support function is provided, use our historical default
2030  * estimate, 0.3333333. This seems a pretty unprincipled choice, but
2031  * Postgres has been using that estimate for function calls since 1992.
2032  * The hoariness of this behavior suggests that we should not be in too
2033  * much hurry to use another value.
2034  */
2035  if (!prosupport)
2036  return (Selectivity) 0.3333333;
2037 
2038  req.type = T_SupportRequestSelectivity;
2039  req.root = root;
2040  req.funcid = funcid;
2041  req.args = args;
2042  req.inputcollid = inputcollid;
2043  req.is_join = is_join;
2044  req.varRelid = varRelid;
2045  req.jointype = jointype;
2046  req.sjinfo = sjinfo;
2047  req.selectivity = -1; /* to catch failure to set the value */
2048 
2049  sresult = (SupportRequestSelectivity *)
2050  DatumGetPointer(OidFunctionCall1(prosupport,
2051  PointerGetDatum(&req)));
2052 
2053  /* If support function fails, use default */
2054  if (sresult != &req)
2055  return (Selectivity) 0.3333333;
2056 
2057  if (req.selectivity < 0.0 || req.selectivity > 1.0)
2058  elog(ERROR, "invalid function selectivity: %f", req.selectivity);
2059 
2060  return (Selectivity) req.selectivity;
2061 }
regproc RegProcedure
Definition: c.h:650
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 2305 of file plancat.c.

2307 {
2308  Bitmapset *dependentCols = NULL;
2309  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2310  Relation relation;
2311  TupleDesc tupdesc;
2312  TupleConstr *constr;
2313 
2314  /* Assume we already have adequate lock */
2315  relation = table_open(rte->relid, NoLock);
2316 
2317  tupdesc = RelationGetDescr(relation);
2318  constr = tupdesc->constr;
2319 
2320  if (constr && constr->has_generated_stored)
2321  {
2322  for (int i = 0; i < constr->num_defval; i++)
2323  {
2324  AttrDefault *defval = &constr->defval[i];
2325  Node *expr;
2326  Bitmapset *attrs_used = NULL;
2327 
2328  /* skip if not generated column */
2329  if (!TupleDescAttr(tupdesc, defval->adnum - 1)->attgenerated)
2330  continue;
2331 
2332  /* identify columns this generated column depends on */
2333  expr = stringToNode(defval->adbin);
2334  pull_varattnos(expr, 1, &attrs_used);
2335 
2336  if (bms_overlap(target_cols, attrs_used))
2337  dependentCols = bms_add_member(dependentCols,
2339  }
2340  }
2341 
2342  table_close(relation, NoLock);
2343 
2344  return dependentCols;
2345 }
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
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:291

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

2139 {
2140  HeapTuple proctup;
2141  Form_pg_proc procform;
2142  double result;
2143 
2144  proctup = SearchSysCache1(PROCOID, ObjectIdGetDatum(funcid));
2145  if (!HeapTupleIsValid(proctup))
2146  elog(ERROR, "cache lookup failed for function %u", funcid);
2147  procform = (Form_pg_proc) GETSTRUCT(proctup);
2148 
2149  Assert(procform->proretset); /* else caller error */
2150 
2151  if (OidIsValid(procform->prosupport))
2152  {
2153  SupportRequestRows req;
2154  SupportRequestRows *sresult;
2155 
2156  req.type = T_SupportRequestRows;
2157  req.root = root;
2158  req.funcid = funcid;
2159  req.node = node;
2160 
2161  req.rows = 0; /* just for sanity */
2162 
2163  sresult = (SupportRequestRows *)
2164  DatumGetPointer(OidFunctionCall1(procform->prosupport,
2165  PointerGetDatum(&req)));
2166 
2167  if (sresult == &req)
2168  {
2169  /* Success */
2170  ReleaseSysCache(proctup);
2171  return req.rows;
2172  }
2173  }
2174 
2175  /* No support function, or it failed, so rely on prorows */
2176  result = procform->prorows;
2177 
2178  ReleaseSysCache(proctup);
2179 
2180  return result;
2181 }
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 1173 of file plancat.c.

1174 {
1175  int64 tuple_width = 0;
1176  int i;
1177 
1178  for (i = 1; i <= RelationGetNumberOfAttributes(rel); i++)
1179  {
1180  Form_pg_attribute att = TupleDescAttr(rel->rd_att, i - 1);
1181  int32 item_width;
1182 
1183  if (att->attisdropped)
1184  continue;
1185 
1186  /* use previously cached data, if any */
1187  if (attr_widths != NULL && attr_widths[i] > 0)
1188  {
1189  tuple_width += attr_widths[i];
1190  continue;
1191  }
1192 
1193  /* This should match set_rel_width() in costsize.c */
1194  item_width = get_attavgwidth(RelationGetRelid(rel), i);
1195  if (item_width <= 0)
1196  {
1197  item_width = get_typavgwidth(att->atttypid, att->atttypmod);
1198  Assert(item_width > 0);
1199  }
1200  if (attr_widths != NULL)
1201  attr_widths[i] = item_width;
1202  tuple_width += item_width;
1203  }
1204 
1205  return clamp_width_est(tuple_width);
1206 }
int32 clamp_width_est(int64 tuple_width)
Definition: costsize.c:231
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_constraints()

static List * get_relation_constraints ( PlannerInfo root,
Oid  relationObjectId,
RelOptInfo rel,
bool  include_noinherit,
bool  include_notnull,
bool  include_partition 
)
static

Definition at line 1255 of file plancat.c.

1260 {
1261  List *result = NIL;
1262  Index varno = rel->relid;
1263  Relation relation;
1264  TupleConstr *constr;
1265 
1266  /*
1267  * We assume the relation has already been safely locked.
1268  */
1269  relation = table_open(relationObjectId, NoLock);
1270 
1271  constr = relation->rd_att->constr;
1272  if (constr != NULL)
1273  {
1274  int num_check = constr->num_check;
1275  int i;
1276 
1277  for (i = 0; i < num_check; i++)
1278  {
1279  Node *cexpr;
1280 
1281  /*
1282  * If this constraint hasn't been fully validated yet, we must
1283  * ignore it here. Also ignore if NO INHERIT and we weren't told
1284  * that that's safe.
1285  */
1286  if (!constr->check[i].ccvalid)
1287  continue;
1288  if (constr->check[i].ccnoinherit && !include_noinherit)
1289  continue;
1290 
1291  cexpr = stringToNode(constr->check[i].ccbin);
1292 
1293  /*
1294  * Run each expression through const-simplification and
1295  * canonicalization. This is not just an optimization, but is
1296  * necessary, because we will be comparing it to
1297  * similarly-processed qual clauses, and may fail to detect valid
1298  * matches without this. This must match the processing done to
1299  * qual clauses in preprocess_expression()! (We can skip the
1300  * stuff involving subqueries, however, since we don't allow any
1301  * in check constraints.)
1302  */
1303  cexpr = eval_const_expressions(root, cexpr);
1304 
1305  cexpr = (Node *) canonicalize_qual((Expr *) cexpr, true);
1306 
1307  /* Fix Vars to have the desired varno */
1308  if (varno != 1)
1309  ChangeVarNodes(cexpr, 1, varno, 0);
1310 
1311  /*
1312  * Finally, convert to implicit-AND format (that is, a List) and
1313  * append the resulting item(s) to our output list.
1314  */
1315  result = list_concat(result,
1316  make_ands_implicit((Expr *) cexpr));
1317  }
1318 
1319  /* Add NOT NULL constraints in expression form, if requested */
1320  if (include_notnull && constr->has_not_null)
1321  {
1322  int natts = relation->rd_att->natts;
1323 
1324  for (i = 1; i <= natts; i++)
1325  {
1326  Form_pg_attribute att = TupleDescAttr(relation->rd_att, i - 1);
1327 
1328  if (att->attnotnull && !att->attisdropped)
1329  {
1330  NullTest *ntest = makeNode(NullTest);
1331 
1332  ntest->arg = (Expr *) makeVar(varno,
1333  i,
1334  att->atttypid,
1335  att->atttypmod,
1336  att->attcollation,
1337  0);
1338  ntest->nulltesttype = IS_NOT_NULL;
1339 
1340  /*
1341  * argisrow=false is correct even for a composite column,
1342  * because attnotnull does not represent a SQL-spec IS NOT
1343  * NULL test in such a case, just IS DISTINCT FROM NULL.
1344  */
1345  ntest->argisrow = false;
1346  ntest->location = -1;
1347  result = lappend(result, ntest);
1348  }
1349  }
1350  }
1351  }
1352 
1353  /*
1354  * Add partitioning constraints, if requested.
1355  */
1356  if (include_partition && relation->rd_rel->relispartition)
1357  {
1358  /* make sure rel->partition_qual is set */
1359  set_baserel_partition_constraint(relation, rel);
1360  result = list_concat(result, rel->partition_qual);
1361  }
1362 
1363  table_close(relation, NoLock);
1364 
1365  return result;
1366 }
Node * eval_const_expressions(PlannerInfo *root, Node *node)
Definition: clauses.c:2254
List * list_concat(List *list1, const List *list2)
Definition: list.c:561
List * make_ands_implicit(Expr *clause)
Definition: makefuncs.c:737
#define makeNode(_type_)
Definition: nodes.h:155
static void set_baserel_partition_constraint(Relation relation, RelOptInfo *rel)
Definition: plancat.c:2558
Expr * canonicalize_qual(Expr *qual, bool is_check)
Definition: prepqual.c:293
@ IS_NOT_NULL
Definition: primnodes.h:1948
void ChangeVarNodes(Node *node, int rt_index, int new_index, int sublevels_up)
Definition: rewriteManip.c:674
bool ccnoinherit
Definition: tupdesc.h:33
bool ccvalid
Definition: tupdesc.h:32
char * ccbin
Definition: tupdesc.h:31
NullTestType nulltesttype
Definition: primnodes.h:1955
ParseLoc location
Definition: primnodes.h:1958
Expr * arg
Definition: primnodes.h:1954
List * partition_qual
Definition: pathnodes.h:1021
bool has_not_null
Definition: tupdesc.h:44
ConstrCheck * check
Definition: tupdesc.h:40
uint16 num_check
Definition: tupdesc.h:43

References NullTest::arg, canonicalize_qual(), ConstrCheck::ccbin, ConstrCheck::ccnoinherit, ConstrCheck::ccvalid, ChangeVarNodes(), TupleConstr::check, TupleDescData::constr, eval_const_expressions(), TupleConstr::has_not_null, i, IS_NOT_NULL, lappend(), list_concat(), NullTest::location, make_ands_implicit(), makeNode, makeVar(), TupleDescData::natts, NIL, NoLock, NullTest::nulltesttype, TupleConstr::num_check, RelOptInfo::partition_qual, RelationData::rd_att, RelationData::rd_rel, RelOptInfo::relid, root, set_baserel_partition_constraint(), stringToNode(), table_close(), table_open(), and TupleDescAttr.

Referenced by relation_excluded_by_constraints().

◆ get_relation_data_width()

int32 get_relation_data_width ( Oid  relid,
int32 attr_widths 
)

Definition at line 1215 of file plancat.c.

1216 {
1217  int32 result;
1218  Relation relation;
1219 
1220  /* As above, assume relation is already locked */
1221  relation = table_open(relid, NoLock);
1222 
1223  result = get_rel_data_width(relation, attr_widths);
1224 
1225  table_close(relation, NoLock);
1226 
1227  return result;
1228 }

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

Referenced by plan_cluster_use_sort(), and set_rel_width().

◆ get_relation_foreign_keys()

static void get_relation_foreign_keys ( PlannerInfo root,
RelOptInfo rel,
Relation  relation,
bool  inhparent 
)
static

Definition at line 578 of file plancat.c.

580 {
581  List *rtable = root->parse->rtable;
582  List *cachedfkeys;
583  ListCell *lc;
584 
585  /*
586  * If it's not a baserel, we don't care about its FKs. Also, if the query
587  * references only a single relation, we can skip the lookup since no FKs
588  * could satisfy the requirements below.
589  */
590  if (rel->reloptkind != RELOPT_BASEREL ||
591  list_length(rtable) < 2)
592  return;
593 
594  /*
595  * If it's the parent of an inheritance tree, ignore its FKs. We could
596  * make useful FK-based deductions if we found that all members of the
597  * inheritance tree have equivalent FK constraints, but detecting that
598  * would require code that hasn't been written.
599  */
600  if (inhparent)
601  return;
602 
603  /*
604  * Extract data about relation's FKs from the relcache. Note that this
605  * list belongs to the relcache and might disappear in a cache flush, so
606  * we must not do any further catalog access within this function.
607  */
608  cachedfkeys = RelationGetFKeyList(relation);
609 
610  /*
611  * Figure out which FKs are of interest for this query, and create
612  * ForeignKeyOptInfos for them. We want only FKs that reference some
613  * other RTE of the current query. In queries containing self-joins,
614  * there might be more than one other RTE for a referenced table, and we
615  * should make a ForeignKeyOptInfo for each occurrence.
616  *
617  * Ideally, we would ignore RTEs that correspond to non-baserels, but it's
618  * too hard to identify those here, so we might end up making some useless
619  * ForeignKeyOptInfos. If so, match_foreign_keys_to_quals() will remove
620  * them again.
621  */
622  foreach(lc, cachedfkeys)
623  {
624  ForeignKeyCacheInfo *cachedfk = (ForeignKeyCacheInfo *) lfirst(lc);
625  Index rti;
626  ListCell *lc2;
627 
628  /* conrelid should always be that of the table we're considering */
629  Assert(cachedfk->conrelid == RelationGetRelid(relation));
630 
631  /* Scan to find other RTEs matching confrelid */
632  rti = 0;
633  foreach(lc2, rtable)
634  {
635  RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc2);
636  ForeignKeyOptInfo *info;
637 
638  rti++;
639  /* Ignore if not the correct table */
640  if (rte->rtekind != RTE_RELATION ||
641  rte->relid != cachedfk->confrelid)
642  continue;
643  /* Ignore if it's an inheritance parent; doesn't really match */
644  if (rte->inh)
645  continue;
646  /* Ignore self-referential FKs; we only care about joins */
647  if (rti == rel->relid)
648  continue;
649 
650  /* OK, let's make an entry */
651  info = makeNode(ForeignKeyOptInfo);
652  info->con_relid = rel->relid;
653  info->ref_relid = rti;
654  info->nkeys = cachedfk->nkeys;
655  memcpy(info->conkey, cachedfk->conkey, sizeof(info->conkey));
656  memcpy(info->confkey, cachedfk->confkey, sizeof(info->confkey));
657  memcpy(info->conpfeqop, cachedfk->conpfeqop, sizeof(info->conpfeqop));
658  /* zero out fields to be filled by match_foreign_keys_to_quals */
659  info->nmatched_ec = 0;
660  info->nconst_ec = 0;
661  info->nmatched_rcols = 0;
662  info->nmatched_ri = 0;
663  memset(info->eclass, 0, sizeof(info->eclass));
664  memset(info->fk_eclass_member, 0, sizeof(info->fk_eclass_member));
665  memset(info->rinfos, 0, sizeof(info->rinfos));
666 
667  root->fkey_list = lappend(root->fkey_list, info);
668  }
669  }
670 }
@ RELOPT_BASEREL
Definition: pathnodes.h:821
static int list_length(const List *l)
Definition: pg_list.h:152
List * RelationGetFKeyList(Relation relation)
Definition: relcache.c:4692
struct EquivalenceClass * eclass[INDEX_MAX_KEYS]
Definition: pathnodes.h:1250
List * rinfos[INDEX_MAX_KEYS]
Definition: pathnodes.h:1254
struct EquivalenceMember * fk_eclass_member[INDEX_MAX_KEYS]
Definition: pathnodes.h:1252
RelOptKind reloptkind
Definition: pathnodes.h:859

References Assert, ForeignKeyOptInfo::con_relid, ForeignKeyCacheInfo::confrelid, ForeignKeyCacheInfo::conrelid, ForeignKeyOptInfo::eclass, ForeignKeyOptInfo::fk_eclass_member, RangeTblEntry::inh, lappend(), lfirst, list_length(), makeNode, ForeignKeyOptInfo::nconst_ec, ForeignKeyOptInfo::nkeys, ForeignKeyCacheInfo::nkeys, ForeignKeyOptInfo::nmatched_ec, ForeignKeyOptInfo::nmatched_rcols, ForeignKeyOptInfo::nmatched_ri, ForeignKeyOptInfo::ref_relid, RelationGetFKeyList(), RelationGetRelid, RangeTblEntry::relid, RelOptInfo::relid, RELOPT_BASEREL, RelOptInfo::reloptkind, ForeignKeyOptInfo::rinfos, root, RTE_RELATION, and RangeTblEntry::rtekind.

Referenced by get_relation_info().

◆ get_relation_info()

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

Definition at line 115 of file plancat.c.

117 {
118  Index varno = rel->relid;
119  Relation relation;
120  bool hasindex;
121  List *indexinfos = NIL;
122 
123  /*
124  * We need not lock the relation since it was already locked, either by
125  * the rewriter or when expand_inherited_rtentry() added it to the query's
126  * rangetable.
127  */
128  relation = table_open(relationObjectId, NoLock);
129 
130  /*
131  * Relations without a table AM can be used in a query only if they are of
132  * special-cased relkinds. This check prevents us from crashing later if,
133  * for example, a view's ON SELECT rule has gone missing. Note that
134  * table_open() already rejected indexes and composite types; spell the
135  * error the same way it does.
136  */
137  if (!relation->rd_tableam)
138  {
139  if (!(relation->rd_rel->relkind == RELKIND_FOREIGN_TABLE ||
140  relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE))
141  ereport(ERROR,
142  (errcode(ERRCODE_WRONG_OBJECT_TYPE),
143  errmsg("cannot open relation \"%s\"",
144  RelationGetRelationName(relation)),
145  errdetail_relkind_not_supported(relation->rd_rel->relkind)));
146  }
147 
148  /* Temporary and unlogged relations are inaccessible during recovery. */
149  if (!RelationIsPermanent(relation) && RecoveryInProgress())
150  ereport(ERROR,
151  (errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
152  errmsg("cannot access temporary or unlogged relations during recovery")));
153 
155  rel->max_attr = RelationGetNumberOfAttributes(relation);
156  rel->reltablespace = RelationGetForm(relation)->reltablespace;
157 
158  Assert(rel->max_attr >= rel->min_attr);
159  rel->attr_needed = (Relids *)
160  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
161  rel->attr_widths = (int32 *)
162  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
163 
164  /*
165  * Record which columns are defined as NOT NULL. We leave this
166  * unpopulated for non-partitioned inheritance parent relations as it's
167  * ambiguous as to what it means. Some child tables may have a NOT NULL
168  * constraint for a column while others may not. We could work harder and
169  * build a unioned set of all child relations notnullattnums, but there's
170  * currently no need. The RelOptInfo corresponding to the !inh
171  * RangeTblEntry does get populated.
172  */
173  if (!inhparent || relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
174  {
175  for (int i = 0; i < relation->rd_att->natts; i++)
176  {
177  Form_pg_attribute attr = TupleDescAttr(relation->rd_att, i);
178 
179  if (attr->attnotnull)
180  {
182  attr->attnum);
183 
184  /*
185  * Per RemoveAttributeById(), dropped columns will have their
186  * attnotnull unset, so we needn't check for dropped columns
187  * in the above condition.
188  */
189  Assert(!attr->attisdropped);
190  }
191  }
192  }
193 
194  /*
195  * Estimate relation size --- unless it's an inheritance parent, in which
196  * case the size we want is not the rel's own size but the size of its
197  * inheritance tree. That will be computed in set_append_rel_size().
198  */
199  if (!inhparent)
200  estimate_rel_size(relation, rel->attr_widths - rel->min_attr,
201  &rel->pages, &rel->tuples, &rel->allvisfrac);
202 
203  /* Retrieve the parallel_workers reloption, or -1 if not set. */
205 
206  /*
207  * Make list of indexes. Ignore indexes on system catalogs if told to.
208  * Don't bother with indexes from traditional inheritance parents. For
209  * partitioned tables, we need a list of at least unique indexes as these
210  * serve as unique proofs for certain planner optimizations. However,
211  * let's not discriminate here and just record all partitioned indexes
212  * whether they're unique indexes or not.
213  */
214  if ((inhparent && relation->rd_rel->relkind != RELKIND_PARTITIONED_TABLE)
215  || (IgnoreSystemIndexes && IsSystemRelation(relation)))
216  hasindex = false;
217  else
218  hasindex = relation->rd_rel->relhasindex;
219 
220  if (hasindex)
221  {
222  List *indexoidlist;
223  LOCKMODE lmode;
224  ListCell *l;
225 
226  indexoidlist = RelationGetIndexList(relation);
227 
228  /*
229  * For each index, we get the same type of lock that the executor will
230  * need, and do not release it. This saves a couple of trips to the
231  * shared lock manager while not creating any real loss of
232  * concurrency, because no schema changes could be happening on the
233  * index while we hold lock on the parent rel, and no lock type used
234  * for queries blocks any other kind of index operation.
235  */
236  lmode = root->simple_rte_array[varno]->rellockmode;
237 
238  foreach(l, indexoidlist)
239  {
240  Oid indexoid = lfirst_oid(l);
241  Relation indexRelation;
243  IndexAmRoutine *amroutine;
244  IndexOptInfo *info;
245  int ncolumns,
246  nkeycolumns;
247  int i;
248 
249  /*
250  * Extract info from the relation descriptor for the index.
251  */
252  indexRelation = index_open(indexoid, lmode);
253  index = indexRelation->rd_index;
254 
255  /*
256  * Ignore invalid indexes, since they can't safely be used for
257  * queries. Note that this is OK because the data structure we
258  * are constructing is only used by the planner --- the executor
259  * still needs to insert into "invalid" indexes, if they're marked
260  * indisready.
261  */
262  if (!index->indisvalid)
263  {
264  index_close(indexRelation, NoLock);
265  continue;
266  }
267 
268  /*
269  * If the index is valid, but cannot yet be used, ignore it; but
270  * mark the plan we are generating as transient. See
271  * src/backend/access/heap/README.HOT for discussion.
272  */
273  if (index->indcheckxmin &&
276  {
277  root->glob->transientPlan = true;
278  index_close(indexRelation, NoLock);
279  continue;
280  }
281 
282  info = makeNode(IndexOptInfo);
283 
284  info->indexoid = index->indexrelid;
285  info->reltablespace =
286  RelationGetForm(indexRelation)->reltablespace;
287  info->rel = rel;
288  info->ncolumns = ncolumns = index->indnatts;
289  info->nkeycolumns = nkeycolumns = index->indnkeyatts;
290 
291  info->indexkeys = (int *) palloc(sizeof(int) * ncolumns);
292  info->indexcollations = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
293  info->opfamily = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
294  info->opcintype = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
295  info->canreturn = (bool *) palloc(sizeof(bool) * ncolumns);
296 
297  for (i = 0; i < ncolumns; i++)
298  {
299  info->indexkeys[i] = index->indkey.values[i];
300  info->canreturn[i] = index_can_return(indexRelation, i + 1);
301  }
302 
303  for (i = 0; i < nkeycolumns; i++)
304  {
305  info->opfamily[i] = indexRelation->rd_opfamily[i];
306  info->opcintype[i] = indexRelation->rd_opcintype[i];
307  info->indexcollations[i] = indexRelation->rd_indcollation[i];
308  }
309 
310  info->relam = indexRelation->rd_rel->relam;
311 
312  /*
313  * We don't have an AM for partitioned indexes, so we'll just
314  * NULLify the AM related fields for those.
315  */
316  if (indexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
317  {
318  /* We copy just the fields we need, not all of rd_indam */
319  amroutine = indexRelation->rd_indam;
320  info->amcanorderbyop = amroutine->amcanorderbyop;
321  info->amoptionalkey = amroutine->amoptionalkey;
322  info->amsearcharray = amroutine->amsearcharray;
323  info->amsearchnulls = amroutine->amsearchnulls;
324  info->amcanparallel = amroutine->amcanparallel;
325  info->amhasgettuple = (amroutine->amgettuple != NULL);
326  info->amhasgetbitmap = amroutine->amgetbitmap != NULL &&
327  relation->rd_tableam->scan_bitmap_next_block != NULL;
328  info->amcanmarkpos = (amroutine->ammarkpos != NULL &&
329  amroutine->amrestrpos != NULL);
330  info->amcostestimate = amroutine->amcostestimate;
331  Assert(info->amcostestimate != NULL);
332 
333  /* Fetch index opclass options */
334  info->opclassoptions = RelationGetIndexAttOptions(indexRelation, true);
335 
336  /*
337  * Fetch the ordering information for the index, if any.
338  */
339  if (info->relam == BTREE_AM_OID)
340  {
341  /*
342  * If it's a btree index, we can use its opfamily OIDs
343  * directly as the sort ordering opfamily OIDs.
344  */
345  Assert(amroutine->amcanorder);
346 
347  info->sortopfamily = info->opfamily;
348  info->reverse_sort = (bool *) palloc(sizeof(bool) * nkeycolumns);
349  info->nulls_first = (bool *) palloc(sizeof(bool) * nkeycolumns);
350 
351  for (i = 0; i < nkeycolumns; i++)
352  {
353  int16 opt = indexRelation->rd_indoption[i];
354 
355  info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
356  info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
357  }
358  }
359  else if (amroutine->amcanorder)
360  {
361  /*
362  * Otherwise, identify the corresponding btree opfamilies
363  * by trying to map this index's "<" operators into btree.
364  * Since "<" uniquely defines the behavior of a sort
365  * order, this is a sufficient test.
366  *
367  * XXX This method is rather slow and also requires the
368  * undesirable assumption that the other index AM numbers
369  * its strategies the same as btree. It'd be better to
370  * have a way to explicitly declare the corresponding
371  * btree opfamily for each opfamily of the other index
372  * type. But given the lack of current or foreseeable
373  * amcanorder index types, it's not worth expending more
374  * effort on now.
375  */
376  info->sortopfamily = (Oid *) palloc(sizeof(Oid) * nkeycolumns);
377  info->reverse_sort = (bool *) palloc(sizeof(bool) * nkeycolumns);
378  info->nulls_first = (bool *) palloc(sizeof(bool) * nkeycolumns);
379 
380  for (i = 0; i < nkeycolumns; i++)
381  {
382  int16 opt = indexRelation->rd_indoption[i];
383  Oid ltopr;
384  Oid btopfamily;
385  Oid btopcintype;
386  int16 btstrategy;
387 
388  info->reverse_sort[i] = (opt & INDOPTION_DESC) != 0;
389  info->nulls_first[i] = (opt & INDOPTION_NULLS_FIRST) != 0;
390 
391  ltopr = get_opfamily_member(info->opfamily[i],
392  info->opcintype[i],
393  info->opcintype[i],
395  if (OidIsValid(ltopr) &&
397  &btopfamily,
398  &btopcintype,
399  &btstrategy) &&
400  btopcintype == info->opcintype[i] &&
401  btstrategy == BTLessStrategyNumber)
402  {
403  /* Successful mapping */
404  info->sortopfamily[i] = btopfamily;
405  }
406  else
407  {
408  /* Fail ... quietly treat index as unordered */
409  info->sortopfamily = NULL;
410  info->reverse_sort = NULL;
411  info->nulls_first = NULL;
412  break;
413  }
414  }
415  }
416  else
417  {
418  info->sortopfamily = NULL;
419  info->reverse_sort = NULL;
420  info->nulls_first = NULL;
421  }
422  }
423  else
424  {
425  info->amcanorderbyop = false;
426  info->amoptionalkey = false;
427  info->amsearcharray = false;
428  info->amsearchnulls = false;
429  info->amcanparallel = false;
430  info->amhasgettuple = false;
431  info->amhasgetbitmap = false;
432  info->amcanmarkpos = false;
433  info->amcostestimate = NULL;
434 
435  info->sortopfamily = NULL;
436  info->reverse_sort = NULL;
437  info->nulls_first = NULL;
438  }
439 
440  /*
441  * Fetch the index expressions and predicate, if any. We must
442  * modify the copies we obtain from the relcache to have the
443  * correct varno for the parent relation, so that they match up
444  * correctly against qual clauses.
445  */
446  info->indexprs = RelationGetIndexExpressions(indexRelation);
447  info->indpred = RelationGetIndexPredicate(indexRelation);
448  if (info->indexprs && varno != 1)
449  ChangeVarNodes((Node *) info->indexprs, 1, varno, 0);
450  if (info->indpred && varno != 1)
451  ChangeVarNodes((Node *) info->indpred, 1, varno, 0);
452 
453  /* Build targetlist using the completed indexprs data */
454  info->indextlist = build_index_tlist(root, info, relation);
455 
456  info->indrestrictinfo = NIL; /* set later, in indxpath.c */
457  info->predOK = false; /* set later, in indxpath.c */
458  info->unique = index->indisunique;
459  info->immediate = index->indimmediate;
460  info->hypothetical = false;
461 
462  /*
463  * Estimate the index size. If it's not a partial index, we lock
464  * the number-of-tuples estimate to equal the parent table; if it
465  * is partial then we have to use the same methods as we would for
466  * a table, except we can be sure that the index is not larger
467  * than the table. We must ignore partitioned indexes here as
468  * there are not physical indexes.
469  */
470  if (indexRelation->rd_rel->relkind != RELKIND_PARTITIONED_INDEX)
471  {
472  if (info->indpred == NIL)
473  {
474  info->pages = RelationGetNumberOfBlocks(indexRelation);
475  info->tuples = rel->tuples;
476  }
477  else
478  {
479  double allvisfrac; /* dummy */
480 
481  estimate_rel_size(indexRelation, NULL,
482  &info->pages, &info->tuples, &allvisfrac);
483  if (info->tuples > rel->tuples)
484  info->tuples = rel->tuples;
485  }
486 
487  if (info->relam == BTREE_AM_OID)
488  {
489  /*
490  * For btrees, get tree height while we have the index
491  * open
492  */
493  info->tree_height = _bt_getrootheight(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  {
532  rel->fdwroutine = GetFdwRoutineForRelation(relation, true);
533  }
534  else
535  {
536  rel->serverid = InvalidOid;
537  rel->fdwroutine = NULL;
538  }
539 
540  /* Collect info about relation's foreign keys, if relevant */
541  get_relation_foreign_keys(root, rel, relation, inhparent);
542 
543  /* Collect info about functions implemented by the rel's table AM. */
544  if (relation->rd_tableam &&
545  relation->rd_tableam->scan_set_tidrange != NULL &&
546  relation->rd_tableam->scan_getnextslot_tidrange != NULL)
548 
549  /*
550  * Collect info about relation's partitioning scheme, if any. Only
551  * inheritance parents may be partitioned.
552  */
553  if (inhparent && relation->rd_rel->relkind == RELKIND_PARTITIONED_TABLE)
554  set_relation_partition_info(root, rel, relation);
555 
556  table_close(relation, NoLock);
557 
558  /*
559  * Allow a plugin to editorialize on the info we obtained from the
560  * catalogs. Actions might include altering the assumed relation size,
561  * removing an index, or adding a hypothetical index to the indexlist.
562  */
564  (*get_relation_info_hook) (root, relationObjectId, inhparent, rel);
565 }
bool IsSystemRelation(Relation relation)
Definition: catalog.c:73
int errcode(int sqlerrcode)
Definition: elog.c:855
int errmsg(const char *fmt,...)
Definition: elog.c:1072
#define ereport(elevel,...)
Definition: elog.h:149
FdwRoutine * GetFdwRoutineForRelation(Relation relation, bool makecopy)
Definition: foreign.c:432
Oid GetForeignServerIdByRelId(Oid relid)
Definition: foreign.c:345
#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:788
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
bool IgnoreSystemIndexes
Definition: miscinit.c:80
int _bt_getrootheight(Relation rel)
Definition: nbtpage.c:675
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:1048
static void get_relation_foreign_keys(PlannerInfo *root, RelOptInfo *rel, Relation relation, bool inhparent)
Definition: plancat.c:578
get_relation_info_hook_type get_relation_info_hook
Definition: plancat.c:59
static List * build_index_tlist(PlannerInfo *root, IndexOptInfo *index, Relation heapRelation)
Definition: plancat.c:1873
static List * get_relation_statistics(RelOptInfo *rel, Relation relation)
Definition: plancat.c:1458
static void set_relation_partition_info(PlannerInfo *root, RelOptInfo *rel, Relation relation)
Definition: plancat.c:2353
#define InvalidOid
Definition: postgres_ext.h:36
#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:4801
List * RelationGetIndexPredicate(Relation relation)
Definition: relcache.c:5151
bytea ** RelationGetIndexAttOptions(Relation relation, bool copy)
Definition: relcache.c:5891
List * RelationGetIndexExpressions(Relation relation)
Definition: relcache.c:5038
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:286
amcostestimate_function amcostestimate
Definition: amapi.h:274
bool amcanorderbyop
Definition: amapi.h:226
bool amoptionalkey
Definition: amapi.h:234
amgettuple_function amgettuple
Definition: amapi.h:282
amgetbitmap_function amgetbitmap
Definition: amapi.h:283
bool amsearcharray
Definition: amapi.h:236
ammarkpos_function ammarkpos
Definition: amapi.h:285
bool amcanparallel
Definition: amapi.h:246
bool amcanorder
Definition: amapi.h:224
bool amsearchnulls
Definition: amapi.h:238
bool amcanparallel
Definition: pathnodes.h:1198
bool amoptionalkey
Definition: pathnodes.h:1191
Oid reltablespace
Definition: pathnodes.h:1113
bool amcanmarkpos
Definition: pathnodes.h:1200
List * indrestrictinfo
Definition: pathnodes.h:1175
void(* amcostestimate)() pg_node_attr(read_write_ignore)
Definition: pathnodes.h:1203
bool amhasgettuple
Definition: pathnodes.h:1195
bool amcanorderbyop
Definition: pathnodes.h:1190
bool hypothetical
Definition: pathnodes.h:1184
List * indpred
Definition: pathnodes.h:1165
Cardinality tuples
Definition: pathnodes.h:1123
bool amsearcharray
Definition: pathnodes.h:1192
BlockNumber pages
Definition: pathnodes.h:1121
bool amsearchnulls
Definition: pathnodes.h:1193
bool amhasgetbitmap
Definition: pathnodes.h:1197
List * indextlist
Definition: pathnodes.h:1168
bool immediate
Definition: pathnodes.h:1182
uint32 amflags
Definition: pathnodes.h:952
Bitmapset * notnullattnums
Definition: pathnodes.h:930
List * statlist
Definition: pathnodes.h:940
Cardinality tuples
Definition: pathnodes.h:943
BlockNumber pages
Definition: pathnodes.h:942
List * indexlist
Definition: pathnodes.h:938
Oid reltablespace
Definition: pathnodes.h:914
Oid serverid
Definition: pathnodes.h:958
int rel_parallel_workers
Definition: pathnodes.h:950
AttrNumber max_attr
Definition: pathnodes.h:920
double allvisfrac
Definition: pathnodes.h:944
AttrNumber min_attr
Definition: pathnodes.h:918
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:380
void(* scan_set_tidrange)(TableScanDesc scan, ItemPointer mintid, ItemPointer maxtid)
Definition: tableam.h:372
bool(* scan_bitmap_next_block)(TableScanDesc scan, struct TBMIterateResult *tbmres)
Definition: tableam.h:813
bool TransactionIdPrecedes(TransactionId id1, TransactionId id2)
Definition: transam.c:280
bool RecoveryInProgress(void)
Definition: xlog.c:6290

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, bms_add_member(), 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(), 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, 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, and IndexOptInfo::unique.

Referenced by build_simple_rel().

◆ get_relation_statistics()

static List * get_relation_statistics ( RelOptInfo rel,
Relation  relation 
)
static

Definition at line 1458 of file plancat.c.

1459 {
1460  Index varno = rel->relid;
1461  List *statoidlist;
1462  List *stainfos = NIL;
1463  ListCell *l;
1464 
1465  statoidlist = RelationGetStatExtList(relation);
1466 
1467  foreach(l, statoidlist)
1468  {
1469  Oid statOid = lfirst_oid(l);
1470  Form_pg_statistic_ext staForm;
1471  HeapTuple htup;
1472  Bitmapset *keys = NULL;
1473  List *exprs = NIL;
1474  int i;
1475 
1476  htup = SearchSysCache1(STATEXTOID, ObjectIdGetDatum(statOid));
1477  if (!HeapTupleIsValid(htup))
1478  elog(ERROR, "cache lookup failed for statistics object %u", statOid);
1479  staForm = (Form_pg_statistic_ext) GETSTRUCT(htup);
1480 
1481  /*
1482  * First, build the array of columns covered. This is ultimately
1483  * wasted if no stats within the object have actually been built, but
1484  * it doesn't seem worth troubling over that case.
1485  */
1486  for (i = 0; i < staForm->stxkeys.dim1; i++)
1487  keys = bms_add_member(keys, staForm->stxkeys.values[i]);
1488 
1489  /*
1490  * Preprocess expressions (if any). We read the expressions, run them
1491  * through eval_const_expressions, and fix the varnos.
1492  *
1493  * XXX We don't know yet if there are any data for this stats object,
1494  * with either stxdinherit value. But it's reasonable to assume there
1495  * is at least one of those, possibly both. So it's better to process
1496  * keys and expressions here.
1497  */
1498  {
1499  bool isnull;
1500  Datum datum;
1501 
1502  /* decode expression (if any) */
1503  datum = SysCacheGetAttr(STATEXTOID, htup,
1504  Anum_pg_statistic_ext_stxexprs, &isnull);
1505 
1506  if (!isnull)
1507  {
1508  char *exprsString;
1509 
1510  exprsString = TextDatumGetCString(datum);
1511  exprs = (List *) stringToNode(exprsString);
1512  pfree(exprsString);
1513 
1514  /*
1515  * Run the expressions through eval_const_expressions. This is
1516  * not just an optimization, but is necessary, because the
1517  * planner will be comparing them to similarly-processed qual
1518  * clauses, and may fail to detect valid matches without this.
1519  * We must not use canonicalize_qual, however, since these
1520  * aren't qual expressions.
1521  */
1522  exprs = (List *) eval_const_expressions(NULL, (Node *) exprs);
1523 
1524  /* May as well fix opfuncids too */
1525  fix_opfuncids((Node *) exprs);
1526 
1527  /*
1528  * Modify the copies we obtain from the relcache to have the
1529  * correct varno for the parent relation, so that they match
1530  * up correctly against qual clauses.
1531  */
1532  if (varno != 1)
1533  ChangeVarNodes((Node *) exprs, 1, varno, 0);
1534  }
1535  }
1536 
1537  /* extract statistics for possible values of stxdinherit flag */
1538 
1539  get_relation_statistics_worker(&stainfos, rel, statOid, true, keys, exprs);
1540 
1541  get_relation_statistics_worker(&stainfos, rel, statOid, false, keys, exprs);
1542 
1543  ReleaseSysCache(htup);
1544  bms_free(keys);
1545  }
1546 
1547  list_free(statoidlist);
1548 
1549  return stainfos;
1550 }
void bms_free(Bitmapset *a)
Definition: bitmapset.c:239
#define TextDatumGetCString(d)
Definition: builtins.h:98
void pfree(void *pointer)
Definition: mcxt.c:1521
void fix_opfuncids(Node *node)
Definition: nodeFuncs.c:1831
FormData_pg_statistic_ext * Form_pg_statistic_ext
static void get_relation_statistics_worker(List **stainfos, RelOptInfo *rel, Oid statOid, bool inh, Bitmapset *keys, List *exprs)
Definition: plancat.c:1375
uintptr_t Datum
Definition: postgres.h:64
List * RelationGetStatExtList(Relation relation)
Definition: relcache.c:4922
Datum SysCacheGetAttr(int cacheId, HeapTuple tup, AttrNumber attributeNumber, bool *isNull)
Definition: syscache.c:479

References bms_add_member(), bms_free(), ChangeVarNodes(), elog, ERROR, eval_const_expressions(), fix_opfuncids(), get_relation_statistics_worker(), GETSTRUCT, HeapTupleIsValid, i, lfirst_oid, list_free(), NIL, ObjectIdGetDatum(), pfree(), RelationGetStatExtList(), ReleaseSysCache(), RelOptInfo::relid, SearchSysCache1(), stringToNode(), SysCacheGetAttr(), and TextDatumGetCString.

Referenced by get_relation_info().

◆ get_relation_statistics_worker()

static void get_relation_statistics_worker ( List **  stainfos,
RelOptInfo rel,
Oid  statOid,
bool  inh,
Bitmapset keys,
List exprs 
)
static

Definition at line 1375 of file plancat.c.

1378 {
1379  Form_pg_statistic_ext_data dataForm;
1380  HeapTuple dtup;
1381 
1382  dtup = SearchSysCache2(STATEXTDATASTXOID,
1383  ObjectIdGetDatum(statOid), BoolGetDatum(inh));
1384  if (!HeapTupleIsValid(dtup))
1385  return;
1386 
1387  dataForm = (Form_pg_statistic_ext_data) GETSTRUCT(dtup);
1388 
1389  /* add one StatisticExtInfo for each kind built */
1390  if (statext_is_kind_built(dtup, STATS_EXT_NDISTINCT))
1391  {
1393 
1394  info->statOid = statOid;
1395  info->inherit = dataForm->stxdinherit;
1396  info->rel = rel;
1397  info->kind = STATS_EXT_NDISTINCT;
1398  info->keys = bms_copy(keys);
1399  info->exprs = exprs;
1400 
1401  *stainfos = lappend(*stainfos, info);
1402  }
1403 
1404  if (statext_is_kind_built(dtup, STATS_EXT_DEPENDENCIES))
1405  {
1407 
1408  info->statOid = statOid;
1409  info->inherit = dataForm->stxdinherit;
1410  info->rel = rel;
1411  info->kind = STATS_EXT_DEPENDENCIES;
1412  info->keys = bms_copy(keys);
1413  info->exprs = exprs;
1414 
1415  *stainfos = lappend(*stainfos, info);
1416  }
1417 
1418  if (statext_is_kind_built(dtup, STATS_EXT_MCV))
1419  {
1421 
1422  info->statOid = statOid;
1423  info->inherit = dataForm->stxdinherit;
1424  info->rel = rel;
1425  info->kind = STATS_EXT_MCV;
1426  info->keys = bms_copy(keys);
1427  info->exprs = exprs;
1428 
1429  *stainfos = lappend(*stainfos, info);
1430  }
1431 
1432  if (statext_is_kind_built(dtup, STATS_EXT_EXPRESSIONS))
1433  {
1435 
1436  info->statOid = statOid;
1437  info->inherit = dataForm->stxdinherit;
1438  info->rel = rel;
1439  info->kind = STATS_EXT_EXPRESSIONS;
1440  info->keys = bms_copy(keys);
1441  info->exprs = exprs;
1442 
1443  *stainfos = lappend(*stainfos, info);
1444  }
1445 
1446  ReleaseSysCache(dtup);
1447 }
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:122
bool statext_is_kind_built(HeapTuple htup, char type)
FormData_pg_statistic_ext_data * Form_pg_statistic_ext_data
static Datum BoolGetDatum(bool X)
Definition: postgres.h:102
Bitmapset * keys
Definition: pathnodes.h:1283
HeapTuple SearchSysCache2(int cacheId, Datum key1, Datum key2)
Definition: syscache.c:229

References bms_copy(), BoolGetDatum(), StatisticExtInfo::exprs, GETSTRUCT, HeapTupleIsValid, StatisticExtInfo::inherit, StatisticExtInfo::keys, StatisticExtInfo::kind, lappend(), makeNode, ObjectIdGetDatum(), ReleaseSysCache(), SearchSysCache2(), statext_is_kind_built(), and StatisticExtInfo::statOid.

Referenced by get_relation_statistics().

◆ has_row_triggers()

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

Definition at line 2228 of file plancat.c.

2229 {
2230  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2231  Relation relation;
2232  TriggerDesc *trigDesc;
2233  bool result = false;
2234 
2235  /* Assume we already have adequate lock */
2236  relation = table_open(rte->relid, NoLock);
2237 
2238  trigDesc = relation->trigdesc;
2239  switch (event)
2240  {
2241  case CMD_INSERT:
2242  if (trigDesc &&
2243  (trigDesc->trig_insert_after_row ||
2244  trigDesc->trig_insert_before_row))
2245  result = true;
2246  break;
2247  case CMD_UPDATE:
2248  if (trigDesc &&
2249  (trigDesc->trig_update_after_row ||
2250  trigDesc->trig_update_before_row))
2251  result = true;
2252  break;
2253  case CMD_DELETE:
2254  if (trigDesc &&
2255  (trigDesc->trig_delete_after_row ||
2256  trigDesc->trig_delete_before_row))
2257  result = true;
2258  break;
2259  /* There is no separate event for MERGE, only INSERT/UPDATE/DELETE */
2260  case CMD_MERGE:
2261  result = false;
2262  break;
2263  default:
2264  elog(ERROR, "unrecognized CmdType: %d", (int) event);
2265  break;
2266  }
2267 
2268  table_close(relation, NoLock);
2269  return result;
2270 }
@ 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 2278 of file plancat.c.

2279 {
2280  RangeTblEntry *rte = planner_rt_fetch(rti, root);
2281  Relation relation;
2282  TupleDesc tupdesc;
2283  bool result = false;
2284 
2285  /* Assume we already have adequate lock */
2286  relation = table_open(rte->relid, NoLock);
2287 
2288  tupdesc = RelationGetDescr(relation);
2289  result = tupdesc->constr && tupdesc->constr->has_generated_stored;
2290 
2291  table_close(relation, NoLock);
2292 
2293  return result;
2294 }

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

2197 {
2198  ListCell *ilist;
2199 
2200  foreach(ilist, rel->indexlist)
2201  {
2202  IndexOptInfo *index = (IndexOptInfo *) lfirst(ilist);
2203 
2204  /*
2205  * Note: ignore partial indexes, since they don't allow us to conclude
2206  * that all attr values are distinct, *unless* they are marked predOK
2207  * which means we know the index's predicate is satisfied by the
2208  * query. We don't take any interest in expressional indexes either.
2209  * Also, a multicolumn unique index doesn't allow us to conclude that
2210  * just the specified attr is unique.
2211  */
2212  if (index->unique &&
2213  index->nkeycolumns == 1 &&
2214  index->indexkeys[0] == attno &&
2215  (index->indpred == NIL || index->predOK))
2216  return true;
2217  }
2218  return false;
2219 }

References RelOptInfo::indexlist, lfirst, and NIL.

Referenced by examine_variable().

◆ infer_arbiter_indexes()

List* infer_arbiter_indexes ( PlannerInfo root)

Definition at line 693 of file plancat.c.

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

◆ infer_collation_opclass_match()

static bool infer_collation_opclass_match ( InferenceElem elem,
Relation  idxRel,
List idxExprs 
)
static

Definition at line 966 of file plancat.c.

968 {
969  AttrNumber natt;
970  Oid inferopfamily = InvalidOid; /* OID of opclass opfamily */
971  Oid inferopcinputtype = InvalidOid; /* OID of opclass input type */
972  int nplain = 0; /* # plain attrs observed */
973 
974  /*
975  * If inference specification element lacks collation/opclass, then no
976  * need to check for exact match.
977  */
978  if (elem->infercollid == InvalidOid && elem->inferopclass == InvalidOid)
979  return true;
980 
981  /*
982  * Lookup opfamily and input type, for matching indexes
983  */
984  if (elem->inferopclass)
985  {
986  inferopfamily = get_opclass_family(elem->inferopclass);
987  inferopcinputtype = get_opclass_input_type(elem->inferopclass);
988  }
989 
990  for (natt = 1; natt <= idxRel->rd_att->natts; natt++)
991  {
992  Oid opfamily = idxRel->rd_opfamily[natt - 1];
993  Oid opcinputtype = idxRel->rd_opcintype[natt - 1];
994  Oid collation = idxRel->rd_indcollation[natt - 1];
995  int attno = idxRel->rd_index->indkey.values[natt - 1];
996 
997  if (attno != 0)
998  nplain++;
999 
1000  if (elem->inferopclass != InvalidOid &&
1001  (inferopfamily != opfamily || inferopcinputtype != opcinputtype))
1002  {
1003  /* Attribute needed to match opclass, but didn't */
1004  continue;
1005  }
1006 
1007  if (elem->infercollid != InvalidOid &&
1008  elem->infercollid != collation)
1009  {
1010  /* Attribute needed to match collation, but didn't */
1011  continue;
1012  }
1013 
1014  /* If one matching index att found, good enough -- return true */
1015  if (IsA(elem->expr, Var))
1016  {
1017  if (((Var *) elem->expr)->varattno == attno)
1018  return true;
1019  }
1020  else if (attno == 0)
1021  {
1022  Node *nattExpr = list_nth(idxExprs, (natt - 1) - nplain);
1023 
1024  /*
1025  * Note that unlike routines like match_index_to_operand() we
1026  * don't need to care about RelabelType. Neither the index
1027  * definition nor the inference clause should contain them.
1028  */
1029  if (equal(elem->expr, nattExpr))
1030  return true;
1031  }
1032  }
1033 
1034  return false;
1035 }
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:223
Oid get_opclass_input_type(Oid opclass)
Definition: lsyscache.c:1212
Oid get_opclass_family(Oid opclass)
Definition: lsyscache.c:1190
static void * list_nth(const List *list, int n)
Definition: pg_list.h:299

References equal(), InferenceElem::expr, get_opclass_family(), get_opclass_input_type(), InferenceElem::infercollid, InferenceElem::inferopclass, InvalidOid, IsA, list_nth(), TupleDescData::natts, RelationData::rd_att, RelationData::rd_indcollation, RelationData::rd_index, RelationData::rd_opcintype, and RelationData::rd_opfamily.

Referenced by infer_arbiter_indexes().

◆ join_selectivity()

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

Definition at line 1974 of file plancat.c.

1980 {
1981  RegProcedure oprjoin = get_oprjoin(operatorid);
1982  float8 result;
1983 
1984  /*
1985  * if the oprjoin procedure is missing for whatever reason, use a
1986  * selectivity of 0.5
1987  */
1988  if (!oprjoin)
1989  return (Selectivity) 0.5;
1990 
1991  result = DatumGetFloat8(OidFunctionCall5Coll(oprjoin,
1992  inputcollid,
1994  ObjectIdGetDatum(operatorid),
1996  Int16GetDatum(jointype),
1997  PointerGetDatum(sjinfo)));
1998 
1999  if (result < 0.0 || result > 1.0)
2000  elog(ERROR, "invalid join selectivity: %f", result);
2001 
2002  return (Selectivity) result;
2003 }
double float8
Definition: c.h:630
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 1564 of file plancat.c.

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

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

1940 {
1941  RegProcedure oprrest = get_oprrest(operatorid);
1942  float8 result;
1943 
1944  /*
1945  * if the oprrest procedure is missing for whatever reason, use a
1946  * selectivity of 0.5
1947  */
1948  if (!oprrest)
1949  return (Selectivity) 0.5;
1950 
1951  result = DatumGetFloat8(OidFunctionCall4Coll(oprrest,
1952  inputcollid,
1954  ObjectIdGetDatum(operatorid),
1956  Int32GetDatum(varRelid)));
1957 
1958  if (result < 0.0 || result > 1.0)
1959  elog(ERROR, "invalid restriction selectivity: %f", result);
1960 
1961  return (Selectivity) result;
1962 }
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().

◆ set_baserel_partition_constraint()

static void set_baserel_partition_constraint ( Relation  relation,
RelOptInfo rel 
)
static

Definition at line 2558 of file plancat.c.

2559 {
2560  List *partconstr;
2561 
2562  if (rel->partition_qual) /* already done */
2563  return;
2564 
2565  /*
2566  * Run the partition quals through const-simplification similar to check
2567  * constraints. We skip canonicalize_qual, though, because partition
2568  * quals should be in canonical form already; also, since the qual is in
2569  * implicit-AND format, we'd have to explicitly convert it to explicit-AND
2570  * format and back again.
2571  */
2572  partconstr = RelationGetPartitionQual(relation);
2573  if (partconstr)
2574  {
2575  partconstr = (List *) expression_planner((Expr *) partconstr);
2576  if (rel->relid != 1)
2577  ChangeVarNodes((Node *) partconstr, 1, rel->relid, 0);
2578  rel->partition_qual = partconstr;
2579  }
2580 }
List * RelationGetPartitionQual(Relation rel)
Definition: partcache.c:277
Expr * expression_planner(Expr *expr)
Definition: planner.c:6580

References ChangeVarNodes(), expression_planner(), RelOptInfo::partition_qual, RelationGetPartitionQual(), and RelOptInfo::relid.

Referenced by get_relation_constraints(), and set_relation_partition_info().

◆ set_baserel_partition_key_exprs()

static void set_baserel_partition_key_exprs ( Relation  relation,
RelOptInfo rel 
)
static

Definition at line 2490 of file plancat.c.

2492 {
2493  PartitionKey partkey = RelationGetPartitionKey(relation);
2494  int partnatts;
2495  int cnt;
2496  List **partexprs;
2497  ListCell *lc;
2498  Index varno = rel->relid;
2499 
2500  Assert(IS_SIMPLE_REL(rel) && rel->relid > 0);
2501 
2502  /* A partitioned table should have a partition key. */
2503  Assert(partkey != NULL);
2504 
2505  partnatts = partkey->partnatts;
2506  partexprs = (List **) palloc(sizeof(List *) * partnatts);
2507  lc = list_head(partkey->partexprs);
2508 
2509  for (cnt = 0; cnt < partnatts; cnt++)
2510  {
2511  Expr *partexpr;
2512  AttrNumber attno = partkey->partattrs[cnt];
2513 
2514  if (attno != InvalidAttrNumber)
2515  {
2516  /* Single column partition key is stored as a Var node. */
2517  Assert(attno > 0);
2518 
2519  partexpr = (Expr *) makeVar(varno, attno,
2520  partkey->parttypid[cnt],
2521  partkey->parttypmod[cnt],
2522  partkey->parttypcoll[cnt], 0);
2523  }
2524  else
2525  {
2526  if (lc == NULL)
2527  elog(ERROR, "wrong number of partition key expressions");
2528 
2529  /* Re-stamp the expression with given varno. */
2530  partexpr = (Expr *) copyObject(lfirst(lc));
2531  ChangeVarNodes((Node *) partexpr, 1, varno, 0);
2532  lc = lnext(partkey->partexprs, lc);
2533  }
2534 
2535  /* Base relations have a single expression per key. */
2536  partexprs[cnt] = list_make1(partexpr);
2537  }
2538 
2539  rel->partexprs = partexprs;
2540 
2541  /*
2542  * A base relation does not have nullable partition key expressions, since
2543  * no outer join is involved. We still allocate an array of empty
2544  * expression lists to keep partition key expression handling code simple.
2545  * See build_joinrel_partition_info() and match_expr_to_partition_keys().
2546  */
2547  rel->nullable_partexprs = (List **) palloc0(sizeof(List *) * partnatts);
2548 }
#define InvalidAttrNumber
Definition: attnum.h:23
#define copyObject(obj)
Definition: nodes.h:224
#define list_make1(x1)
Definition: pg_list.h:212
Oid * parttypcoll
Definition: partcache.h:47
int32 * parttypmod
Definition: partcache.h:43
List * partexprs
Definition: partcache.h:31
AttrNumber * partattrs
Definition: partcache.h:29

References Assert, ChangeVarNodes(), copyObject, elog, ERROR, InvalidAttrNumber, IS_SIMPLE_REL, lfirst, list_head(), list_make1, lnext(), makeVar(), palloc(), palloc0(), PartitionKeyData::partattrs, PartitionKeyData::partexprs, PartitionKeyData::partnatts, PartitionKeyData::parttypcoll, PartitionKeyData::parttypid, PartitionKeyData::parttypmod, RelationGetPartitionKey(), and RelOptInfo::relid.

Referenced by set_relation_partition_info().

◆ set_relation_partition_info()

static void set_relation_partition_info ( PlannerInfo root,
RelOptInfo rel,
Relation  relation 
)
static

Definition at line 2353 of file plancat.c.

2355 {
2356  PartitionDesc partdesc;
2357 
2358  /*
2359  * Create the PartitionDirectory infrastructure if we didn't already.
2360  */
2361  if (root->glob->partition_directory == NULL)
2362  {
2363  root->glob->partition_directory =
2365  }
2366 
2367  partdesc = PartitionDirectoryLookup(root->glob->partition_directory,
2368  relation);
2369  rel->part_scheme = find_partition_scheme(root, relation);
2370  Assert(partdesc != NULL && rel->part_scheme != NULL);
2371  rel->boundinfo = partdesc->boundinfo;
2372  rel->nparts = partdesc->nparts;
2373  set_baserel_partition_key_exprs(relation, rel);
2374  set_baserel_partition_constraint(relation, rel);
2375 }
PartitionDirectory CreatePartitionDirectory(MemoryContext mcxt, bool omit_detached)
Definition: partdesc.c:409
PartitionDesc PartitionDirectoryLookup(PartitionDirectory pdir, Relation rel)
Definition: partdesc.c:442
static PartitionScheme find_partition_scheme(PlannerInfo *root, Relation relation)
Definition: plancat.c:2383
static void set_baserel_partition_key_exprs(Relation relation, RelOptInfo *rel)
Definition: plancat.c:2490
PartitionBoundInfo boundinfo
Definition: partdesc.h:38

References Assert, PartitionDescData::boundinfo, CreatePartitionDirectory(), CurrentMemoryContext, find_partition_scheme(), RelOptInfo::nparts, PartitionDescData::nparts, PartitionDirectoryLookup(), root, set_baserel_partition_constraint(), and set_baserel_partition_key_exprs().

Referenced by get_relation_info().

Variable Documentation

◆ constraint_exclusion

int constraint_exclusion = CONSTRAINT_EXCLUSION_PARTITION

Definition at line 56 of file plancat.c.

Referenced by relation_excluded_by_constraints().

◆ get_relation_info_hook

get_relation_info_hook_type get_relation_info_hook = NULL

Definition at line 59 of file plancat.c.

Referenced by get_relation_info().