PostgreSQL Source Code  git master
allpaths.c File Reference
#include "postgres.h"
#include <limits.h>
#include <math.h>
#include "access/sysattr.h"
#include "access/tsmapi.h"
#include "catalog/pg_class.h"
#include "catalog/pg_operator.h"
#include "catalog/pg_proc.h"
#include "foreign/fdwapi.h"
#include "miscadmin.h"
#include "nodes/makefuncs.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/clauses.h"
#include "optimizer/cost.h"
#include "optimizer/geqo.h"
#include "optimizer/pathnode.h"
#include "optimizer/paths.h"
#include "optimizer/plancat.h"
#include "optimizer/planner.h"
#include "optimizer/prep.h"
#include "optimizer/restrictinfo.h"
#include "optimizer/tlist.h"
#include "optimizer/var.h"
#include "parser/parse_clause.h"
#include "parser/parsetree.h"
#include "partitioning/partprune.h"
#include "rewrite/rewriteManip.h"
#include "utils/lsyscache.h"
Include dependency graph for allpaths.c:

Go to the source code of this file.

Data Structures

struct  pushdown_safety_info
 

Typedefs

typedef struct pushdown_safety_info pushdown_safety_info
 

Functions

static void set_base_rel_consider_startup (PlannerInfo *root)
 
static void set_base_rel_sizes (PlannerInfo *root)
 
static void set_base_rel_pathlists (PlannerInfo *root)
 
static void set_rel_size (PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
 
static void set_rel_pathlist (PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
 
static void set_plain_rel_size (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void create_plain_partial_paths (PlannerInfo *root, RelOptInfo *rel)
 
static void set_rel_consider_parallel (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_plain_rel_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_tablesample_rel_size (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_tablesample_rel_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_foreign_size (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_foreign_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_append_rel_size (PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
 
static void set_append_rel_pathlist (PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
 
static void generate_mergeappend_paths (PlannerInfo *root, RelOptInfo *rel, List *live_childrels, List *all_child_pathkeys, List *partitioned_rels)
 
static Pathget_cheapest_parameterized_child_path (PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
 
static void accumulate_append_subpath (Path *path, List **subpaths, List **special_subpaths)
 
static void set_subquery_pathlist (PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
 
static void set_function_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_values_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_tablefunc_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_cte_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_namedtuplestore_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static void set_worktable_pathlist (PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
 
static RelOptInfomake_rel_from_joinlist (PlannerInfo *root, List *joinlist)
 
static bool subquery_is_pushdown_safe (Query *subquery, Query *topquery, pushdown_safety_info *safetyInfo)
 
static bool recurse_pushdown_safe (Node *setOp, Query *topquery, pushdown_safety_info *safetyInfo)
 
static void check_output_expressions (Query *subquery, pushdown_safety_info *safetyInfo)
 
static void compare_tlist_datatypes (List *tlist, List *colTypes, pushdown_safety_info *safetyInfo)
 
static bool targetIsInAllPartitionLists (TargetEntry *tle, Query *query)
 
static bool qual_is_pushdown_safe (Query *subquery, Index rti, Node *qual, pushdown_safety_info *safetyInfo)
 
static void subquery_push_qual (Query *subquery, RangeTblEntry *rte, Index rti, Node *qual)
 
static void recurse_push_qual (Node *setOp, Query *topquery, RangeTblEntry *rte, Index rti, Node *qual)
 
static void remove_unused_subquery_outputs (Query *subquery, RelOptInfo *rel)
 
RelOptInfomake_one_rel (PlannerInfo *root, List *joinlist)
 
void add_paths_to_append_rel (PlannerInfo *root, RelOptInfo *rel, List *live_childrels)
 
void set_dummy_rel_pathlist (RelOptInfo *rel)
 
static bool has_multiple_baserels (PlannerInfo *root)
 
void generate_gather_paths (PlannerInfo *root, RelOptInfo *rel, bool override_rows)
 
RelOptInfostandard_join_search (PlannerInfo *root, int levels_needed, List *initial_rels)
 
void create_partial_bitmap_paths (PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual)
 
int compute_parallel_worker (RelOptInfo *rel, double heap_pages, double index_pages, int max_workers)
 
void generate_partitionwise_join_paths (PlannerInfo *root, RelOptInfo *rel)
 

Variables

bool enable_geqo = false
 
int geqo_threshold
 
int min_parallel_table_scan_size
 
int min_parallel_index_scan_size
 
set_rel_pathlist_hook_type set_rel_pathlist_hook = NULL
 
join_search_hook_type join_search_hook = NULL
 

Typedef Documentation

◆ pushdown_safety_info

Function Documentation

◆ accumulate_append_subpath()

static void accumulate_append_subpath ( Path path,
List **  subpaths,
List **  special_subpaths 
)
static

Definition at line 1967 of file allpaths.c.

References AppendPath::first_partial_path, IsA, lappend(), list_concat(), list_copy(), list_copy_tail(), list_truncate(), Path::parallel_aware, AppendPath::path, AppendPath::subpaths, and MergeAppendPath::subpaths.

Referenced by add_paths_to_append_rel(), and generate_mergeappend_paths().

1968 {
1969  if (IsA(path, AppendPath))
1970  {
1971  AppendPath *apath = (AppendPath *) path;
1972 
1973  if (!apath->path.parallel_aware || apath->first_partial_path == 0)
1974  {
1975  /* list_copy is important here to avoid sharing list substructure */
1976  *subpaths = list_concat(*subpaths, list_copy(apath->subpaths));
1977  return;
1978  }
1979  else if (special_subpaths != NULL)
1980  {
1981  List *new_special_subpaths;
1982 
1983  /* Split Parallel Append into partial and non-partial subpaths */
1984  *subpaths = list_concat(*subpaths,
1985  list_copy_tail(apath->subpaths,
1986  apath->first_partial_path));
1987  new_special_subpaths =
1989  apath->first_partial_path);
1990  *special_subpaths = list_concat(*special_subpaths,
1991  new_special_subpaths);
1992  return;
1993  }
1994  }
1995  else if (IsA(path, MergeAppendPath))
1996  {
1997  MergeAppendPath *mpath = (MergeAppendPath *) path;
1998 
1999  /* list_copy is important here to avoid sharing list substructure */
2000  *subpaths = list_concat(*subpaths, list_copy(mpath->subpaths));
2001  return;
2002  }
2003 
2004  *subpaths = lappend(*subpaths, path);
2005 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
List * list_truncate(List *list, int new_size)
Definition: list.c:350
List * list_copy(const List *oldlist)
Definition: list.c:1160
List * list_concat(List *list1, List *list2)
Definition: list.c:321
List * list_copy_tail(const List *oldlist, int nskip)
Definition: list.c:1203
Path path
Definition: relation.h:1292
int first_partial_path
Definition: relation.h:1298
List * subpaths
Definition: relation.h:1295
List * lappend(List *list, void *datum)
Definition: list.c:128
bool parallel_aware
Definition: relation.h:1071
List * subpaths
Definition: relation.h:1318
Definition: pg_list.h:45

◆ add_paths_to_append_rel()

void add_paths_to_append_rel ( PlannerInfo root,
RelOptInfo rel,
List live_childrels 
)

Definition at line 1376 of file allpaths.c.

References accumulate_append_subpath(), add_partial_path(), add_path(), Assert, bms_equal(), bms_next_member(), RelOptInfo::cheapest_total_path, compare_pathkeys(), create_append_path(), enable_parallel_append, fls(), generate_mergeappend_paths(), get_cheapest_parallel_safe_total_inner(), get_cheapest_parameterized_child_path(), IS_JOIN_REL, IS_SIMPLE_REL, lappend(), lfirst, linitial, list_concat(), list_copy(), list_length(), Max, max_parallel_workers_per_gather, Min, NIL, Path::parallel_workers, Path::param_info, RelOptInfo::part_scheme, RelOptInfo::partial_pathlist, RelOptInfo::partitioned_child_rels, AppendPath::path, PATH_REQ_OUTER, Path::pathkeys, PATHKEYS_EQUAL, RelOptInfo::pathlist, RelOptInfo::relids, Path::rows, RTE_SUBQUERY, RelOptInfo::rtekind, PlannerInfo::simple_rel_array, subpath(), and Path::total_cost.

Referenced by apply_scanjoin_target_to_paths(), create_partitionwise_grouping_paths(), generate_partitionwise_join_paths(), and set_append_rel_pathlist().

1378 {
1379  List *subpaths = NIL;
1380  bool subpaths_valid = true;
1381  List *partial_subpaths = NIL;
1382  List *pa_partial_subpaths = NIL;
1383  List *pa_nonpartial_subpaths = NIL;
1384  bool partial_subpaths_valid = true;
1385  bool pa_subpaths_valid = enable_parallel_append;
1386  List *all_child_pathkeys = NIL;
1387  List *all_child_outers = NIL;
1388  ListCell *l;
1389  List *partitioned_rels = NIL;
1390  bool build_partitioned_rels = false;
1391  double partial_rows = -1;
1392 
1393  /*
1394  * AppendPath generated for partitioned tables must record the RT indexes
1395  * of partitioned tables that are direct or indirect children of this
1396  * Append rel.
1397  *
1398  * AppendPath may be for a sub-query RTE (UNION ALL), in which case, 'rel'
1399  * itself does not represent a partitioned relation, but the child sub-
1400  * queries may contain references to partitioned relations. The loop
1401  * below will look for such children and collect them in a list to be
1402  * passed to the path creation function. (This assumes that we don't need
1403  * to look through multiple levels of subquery RTEs; if we ever do, we
1404  * could consider stuffing the list we generate here into sub-query RTE's
1405  * RelOptInfo, just like we do for partitioned rels, which would be used
1406  * when populating our parent rel with paths. For the present, that
1407  * appears to be unnecessary.)
1408  */
1409  if (rel->part_scheme != NULL)
1410  {
1411  if (IS_SIMPLE_REL(rel))
1412  partitioned_rels = rel->partitioned_child_rels;
1413  else if (IS_JOIN_REL(rel))
1414  {
1415  int relid = -1;
1416 
1417  /*
1418  * For a partitioned joinrel, concatenate the component rels'
1419  * partitioned_child_rels lists.
1420  */
1421  while ((relid = bms_next_member(rel->relids, relid)) >= 0)
1422  {
1423  RelOptInfo *component;
1424 
1425  Assert(relid >= 1 && relid < root->simple_rel_array_size);
1426  component = root->simple_rel_array[relid];
1427  Assert(component->part_scheme != NULL);
1428  Assert(list_length(component->partitioned_child_rels) >= 1);
1429  partitioned_rels =
1430  list_concat(partitioned_rels,
1431  list_copy(component->partitioned_child_rels));
1432  }
1433  }
1434 
1435  Assert(list_length(partitioned_rels) >= 1);
1436  }
1437  else if (rel->rtekind == RTE_SUBQUERY)
1438  build_partitioned_rels = true;
1439 
1440  /*
1441  * For every non-dummy child, remember the cheapest path. Also, identify
1442  * all pathkeys (orderings) and parameterizations (required_outer sets)
1443  * available for the non-dummy member relations.
1444  */
1445  foreach(l, live_childrels)
1446  {
1447  RelOptInfo *childrel = lfirst(l);
1448  ListCell *lcp;
1449  Path *cheapest_partial_path = NULL;
1450 
1451  /*
1452  * If we need to build partitioned_rels, accumulate the partitioned
1453  * rels for this child.
1454  */
1455  if (build_partitioned_rels)
1456  {
1457  List *cprels = childrel->partitioned_child_rels;
1458 
1459  partitioned_rels = list_concat(partitioned_rels,
1460  list_copy(cprels));
1461  }
1462 
1463  /*
1464  * If child has an unparameterized cheapest-total path, add that to
1465  * the unparameterized Append path we are constructing for the parent.
1466  * If not, there's no workable unparameterized path.
1467  *
1468  * With partitionwise aggregates, the child rel's pathlist may be
1469  * empty, so don't assume that a path exists here.
1470  */
1471  if (childrel->pathlist != NIL &&
1472  childrel->cheapest_total_path->param_info == NULL)
1474  &subpaths, NULL);
1475  else
1476  subpaths_valid = false;
1477 
1478  /* Same idea, but for a partial plan. */
1479  if (childrel->partial_pathlist != NIL)
1480  {
1481  cheapest_partial_path = linitial(childrel->partial_pathlist);
1482  accumulate_append_subpath(cheapest_partial_path,
1483  &partial_subpaths, NULL);
1484  }
1485  else
1486  partial_subpaths_valid = false;
1487 
1488  /*
1489  * Same idea, but for a parallel append mixing partial and non-partial
1490  * paths.
1491  */
1492  if (pa_subpaths_valid)
1493  {
1494  Path *nppath = NULL;
1495 
1496  nppath =
1498 
1499  if (cheapest_partial_path == NULL && nppath == NULL)
1500  {
1501  /* Neither a partial nor a parallel-safe path? Forget it. */
1502  pa_subpaths_valid = false;
1503  }
1504  else if (nppath == NULL ||
1505  (cheapest_partial_path != NULL &&
1506  cheapest_partial_path->total_cost < nppath->total_cost))
1507  {
1508  /* Partial path is cheaper or the only option. */
1509  Assert(cheapest_partial_path != NULL);
1510  accumulate_append_subpath(cheapest_partial_path,
1511  &pa_partial_subpaths,
1512  &pa_nonpartial_subpaths);
1513 
1514  }
1515  else
1516  {
1517  /*
1518  * Either we've got only a non-partial path, or we think that
1519  * a single backend can execute the best non-partial path
1520  * faster than all the parallel backends working together can
1521  * execute the best partial path.
1522  *
1523  * It might make sense to be more aggressive here. Even if
1524  * the best non-partial path is more expensive than the best
1525  * partial path, it could still be better to choose the
1526  * non-partial path if there are several such paths that can
1527  * be given to different workers. For now, we don't try to
1528  * figure that out.
1529  */
1531  &pa_nonpartial_subpaths,
1532  NULL);
1533  }
1534  }
1535 
1536  /*
1537  * Collect lists of all the available path orderings and
1538  * parameterizations for all the children. We use these as a
1539  * heuristic to indicate which sort orderings and parameterizations we
1540  * should build Append and MergeAppend paths for.
1541  */
1542  foreach(lcp, childrel->pathlist)
1543  {
1544  Path *childpath = (Path *) lfirst(lcp);
1545  List *childkeys = childpath->pathkeys;
1546  Relids childouter = PATH_REQ_OUTER(childpath);
1547 
1548  /* Unsorted paths don't contribute to pathkey list */
1549  if (childkeys != NIL)
1550  {
1551  ListCell *lpk;
1552  bool found = false;
1553 
1554  /* Have we already seen this ordering? */
1555  foreach(lpk, all_child_pathkeys)
1556  {
1557  List *existing_pathkeys = (List *) lfirst(lpk);
1558 
1559  if (compare_pathkeys(existing_pathkeys,
1560  childkeys) == PATHKEYS_EQUAL)
1561  {
1562  found = true;
1563  break;
1564  }
1565  }
1566  if (!found)
1567  {
1568  /* No, so add it to all_child_pathkeys */
1569  all_child_pathkeys = lappend(all_child_pathkeys,
1570  childkeys);
1571  }
1572  }
1573 
1574  /* Unparameterized paths don't contribute to param-set list */
1575  if (childouter)
1576  {
1577  ListCell *lco;
1578  bool found = false;
1579 
1580  /* Have we already seen this param set? */
1581  foreach(lco, all_child_outers)
1582  {
1583  Relids existing_outers = (Relids) lfirst(lco);
1584 
1585  if (bms_equal(existing_outers, childouter))
1586  {
1587  found = true;
1588  break;
1589  }
1590  }
1591  if (!found)
1592  {
1593  /* No, so add it to all_child_outers */
1594  all_child_outers = lappend(all_child_outers,
1595  childouter);
1596  }
1597  }
1598  }
1599  }
1600 
1601  /*
1602  * If we found unparameterized paths for all children, build an unordered,
1603  * unparameterized Append path for the rel. (Note: this is correct even
1604  * if we have zero or one live subpath due to constraint exclusion.)
1605  */
1606  if (subpaths_valid)
1607  add_path(rel, (Path *) create_append_path(root, rel, subpaths, NIL,
1608  NULL, 0, false,
1609  partitioned_rels, -1));
1610 
1611  /*
1612  * Consider an append of unordered, unparameterized partial paths. Make
1613  * it parallel-aware if possible.
1614  */
1615  if (partial_subpaths_valid)
1616  {
1617  AppendPath *appendpath;
1618  ListCell *lc;
1619  int parallel_workers = 0;
1620 
1621  /* Find the highest number of workers requested for any subpath. */
1622  foreach(lc, partial_subpaths)
1623  {
1624  Path *path = lfirst(lc);
1625 
1626  parallel_workers = Max(parallel_workers, path->parallel_workers);
1627  }
1628  Assert(parallel_workers > 0);
1629 
1630  /*
1631  * If the use of parallel append is permitted, always request at least
1632  * log2(# of children) workers. We assume it can be useful to have
1633  * extra workers in this case because they will be spread out across
1634  * the children. The precise formula is just a guess, but we don't
1635  * want to end up with a radically different answer for a table with N
1636  * partitions vs. an unpartitioned table with the same data, so the
1637  * use of some kind of log-scaling here seems to make some sense.
1638  */
1640  {
1641  parallel_workers = Max(parallel_workers,
1642  fls(list_length(live_childrels)));
1643  parallel_workers = Min(parallel_workers,
1645  }
1646  Assert(parallel_workers > 0);
1647 
1648  /* Generate a partial append path. */
1649  appendpath = create_append_path(root, rel, NIL, partial_subpaths,
1650  NULL, parallel_workers,
1652  partitioned_rels, -1);
1653 
1654  /*
1655  * Make sure any subsequent partial paths use the same row count
1656  * estimate.
1657  */
1658  partial_rows = appendpath->path.rows;
1659 
1660  /* Add the path. */
1661  add_partial_path(rel, (Path *) appendpath);
1662  }
1663 
1664  /*
1665  * Consider a parallel-aware append using a mix of partial and non-partial
1666  * paths. (This only makes sense if there's at least one child which has
1667  * a non-partial path that is substantially cheaper than any partial path;
1668  * otherwise, we should use the append path added in the previous step.)
1669  */
1670  if (pa_subpaths_valid && pa_nonpartial_subpaths != NIL)
1671  {
1672  AppendPath *appendpath;
1673  ListCell *lc;
1674  int parallel_workers = 0;
1675 
1676  /*
1677  * Find the highest number of workers requested for any partial
1678  * subpath.
1679  */
1680  foreach(lc, pa_partial_subpaths)
1681  {
1682  Path *path = lfirst(lc);
1683 
1684  parallel_workers = Max(parallel_workers, path->parallel_workers);
1685  }
1686 
1687  /*
1688  * Same formula here as above. It's even more important in this
1689  * instance because the non-partial paths won't contribute anything to
1690  * the planned number of parallel workers.
1691  */
1692  parallel_workers = Max(parallel_workers,
1693  fls(list_length(live_childrels)));
1694  parallel_workers = Min(parallel_workers,
1696  Assert(parallel_workers > 0);
1697 
1698  appendpath = create_append_path(root, rel, pa_nonpartial_subpaths,
1699  pa_partial_subpaths,
1700  NULL, parallel_workers, true,
1701  partitioned_rels, partial_rows);
1702  add_partial_path(rel, (Path *) appendpath);
1703  }
1704 
1705  /*
1706  * Also build unparameterized MergeAppend paths based on the collected
1707  * list of child pathkeys.
1708  */
1709  if (subpaths_valid)
1710  generate_mergeappend_paths(root, rel, live_childrels,
1711  all_child_pathkeys,
1712  partitioned_rels);
1713 
1714  /*
1715  * Build Append paths for each parameterization seen among the child rels.
1716  * (This may look pretty expensive, but in most cases of practical
1717  * interest, the child rels will expose mostly the same parameterizations,
1718  * so that not that many cases actually get considered here.)
1719  *
1720  * The Append node itself cannot enforce quals, so all qual checking must
1721  * be done in the child paths. This means that to have a parameterized
1722  * Append path, we must have the exact same parameterization for each
1723  * child path; otherwise some children might be failing to check the
1724  * moved-down quals. To make them match up, we can try to increase the
1725  * parameterization of lesser-parameterized paths.
1726  */
1727  foreach(l, all_child_outers)
1728  {
1729  Relids required_outer = (Relids) lfirst(l);
1730  ListCell *lcr;
1731 
1732  /* Select the child paths for an Append with this parameterization */
1733  subpaths = NIL;
1734  subpaths_valid = true;
1735  foreach(lcr, live_childrels)
1736  {
1737  RelOptInfo *childrel = (RelOptInfo *) lfirst(lcr);
1738  Path *subpath;
1739 
1740  if (childrel->pathlist == NIL)
1741  {
1742  /* failed to make a suitable path for this child */
1743  subpaths_valid = false;
1744  break;
1745  }
1746 
1748  childrel,
1749  required_outer);
1750  if (subpath == NULL)
1751  {
1752  /* failed to make a suitable path for this child */
1753  subpaths_valid = false;
1754  break;
1755  }
1756  accumulate_append_subpath(subpath, &subpaths, NULL);
1757  }
1758 
1759  if (subpaths_valid)
1760  add_path(rel, (Path *)
1761  create_append_path(root, rel, subpaths, NIL,
1762  required_outer, 0, false,
1763  partitioned_rels, -1));
1764  }
1765 }
#define NIL
Definition: pg_list.h:69
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, Relids required_outer, int parallel_workers, bool parallel_aware, List *partitioned_rels, double rows)
Definition: pathnode.c:1213
static void generate_mergeappend_paths(PlannerInfo *root, RelOptInfo *rel, List *live_childrels, List *all_child_pathkeys, List *partitioned_rels)
Definition: allpaths.c:1791
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
static Path * get_cheapest_parameterized_child_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: allpaths.c:1878
#define Min(x, y)
Definition: c.h:857
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1075
int parallel_workers
Definition: relation.h:1073
#define IS_JOIN_REL(rel)
Definition: relation.h:578
ParamPathInfo * param_info
Definition: relation.h:1069
List * list_copy(const List *oldlist)
Definition: list.c:1160
List * partial_pathlist
Definition: relation.h:616
List * list_concat(List *list1, List *list2)
Definition: list.c:321
bool enable_parallel_append
Definition: costsize.c:139
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:278
#define IS_SIMPLE_REL(rel)
Definition: relation.h:573
Path path
Definition: relation.h:1292
int fls(int mask)
Definition: fls.c:55
struct RelOptInfo ** simple_rel_array
Definition: relation.h:182
#define linitial(l)
Definition: pg_list.h:111
struct Path * cheapest_total_path
Definition: relation.h:618
Relids relids
Definition: relation.h:600
Path * get_cheapest_parallel_safe_total_inner(List *paths)
Definition: pathkeys.c:421
Bitmapset * Relids
Definition: relation.h:29
List * lappend(List *list, void *datum)
Definition: list.c:128
RTEKind rtekind
Definition: relation.h:630
Cost total_cost
Definition: relation.h:1078
List * pathkeys
Definition: relation.h:1080
#define Max(x, y)
Definition: c.h:851
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:1076
#define PATH_REQ_OUTER(path)
Definition: relation.h:1085
static int list_length(const List *l)
Definition: pg_list.h:89
List * partitioned_child_rels
Definition: relation.h:680
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:762
PartitionScheme part_scheme
Definition: relation.h:672
List * pathlist
Definition: relation.h:614
static void accumulate_append_subpath(Path *path, List **subpaths, List **special_subpaths)
Definition: allpaths.c:1967
int max_parallel_workers_per_gather
Definition: costsize.c:123
Definition: pg_list.h:45
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:153

◆ check_output_expressions()

static void check_output_expressions ( Query subquery,
pushdown_safety_info safetyInfo 
)
static

Definition at line 2979 of file allpaths.c.

References contain_volatile_functions(), Query::distinctClause, TargetEntry::expr, expression_returns_set(), Query::hasDistinctOn, Query::hasTargetSRFs, Query::hasWindowFuncs, InvalidOid, lfirst, TargetEntry::resjunk, TargetEntry::resno, targetIsInAllPartitionLists(), targetIsInSortList(), Query::targetList, and pushdown_safety_info::unsafeColumns.

Referenced by subquery_is_pushdown_safe().

2980 {
2981  ListCell *lc;
2982 
2983  foreach(lc, subquery->targetList)
2984  {
2985  TargetEntry *tle = (TargetEntry *) lfirst(lc);
2986 
2987  if (tle->resjunk)
2988  continue; /* ignore resjunk columns */
2989 
2990  /* We need not check further if output col is already known unsafe */
2991  if (safetyInfo->unsafeColumns[tle->resno])
2992  continue;
2993 
2994  /* Functions returning sets are unsafe (point 1) */
2995  if (subquery->hasTargetSRFs &&
2996  expression_returns_set((Node *) tle->expr))
2997  {
2998  safetyInfo->unsafeColumns[tle->resno] = true;
2999  continue;
3000  }
3001 
3002  /* Volatile functions are unsafe (point 2) */
3003  if (contain_volatile_functions((Node *) tle->expr))
3004  {
3005  safetyInfo->unsafeColumns[tle->resno] = true;
3006  continue;
3007  }
3008 
3009  /* If subquery uses DISTINCT ON, check point 3 */
3010  if (subquery->hasDistinctOn &&
3011  !targetIsInSortList(tle, InvalidOid, subquery->distinctClause))
3012  {
3013  /* non-DISTINCT column, so mark it unsafe */
3014  safetyInfo->unsafeColumns[tle->resno] = true;
3015  continue;
3016  }
3017 
3018  /* If subquery uses window functions, check point 4 */
3019  if (subquery->hasWindowFuncs &&
3020  !targetIsInAllPartitionLists(tle, subquery))
3021  {
3022  /* not present in all PARTITION BY clauses, so mark it unsafe */
3023  safetyInfo->unsafeColumns[tle->resno] = true;
3024  continue;
3025  }
3026  }
3027 }
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:670
Definition: nodes.h:517
bool * unsafeColumns
Definition: allpaths.c:54
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:958
bool hasDistinctOn
Definition: parsenodes.h:129
List * targetList
Definition: parsenodes.h:140
bool resjunk
Definition: primnodes.h:1383
List * distinctClause
Definition: parsenodes.h:156
static bool targetIsInAllPartitionLists(TargetEntry *tle, Query *query)
Definition: allpaths.c:3080
AttrNumber resno
Definition: primnodes.h:1377
#define InvalidOid
Definition: postgres_ext.h:36
bool targetIsInSortList(TargetEntry *tle, Oid sortop, List *sortList)
bool hasTargetSRFs
Definition: parsenodes.h:127
#define lfirst(lc)
Definition: pg_list.h:106
bool hasWindowFuncs
Definition: parsenodes.h:126
Expr * expr
Definition: primnodes.h:1376

◆ compare_tlist_datatypes()

static void compare_tlist_datatypes ( List tlist,
List colTypes,
pushdown_safety_info safetyInfo 
)
static

Definition at line 3047 of file allpaths.c.

References elog, ERROR, TargetEntry::expr, exprType(), lfirst, lfirst_oid, list_head(), lnext, TargetEntry::resjunk, TargetEntry::resno, and pushdown_safety_info::unsafeColumns.

Referenced by subquery_is_pushdown_safe().

3049 {
3050  ListCell *l;
3051  ListCell *colType = list_head(colTypes);
3052 
3053  foreach(l, tlist)
3054  {
3055  TargetEntry *tle = (TargetEntry *) lfirst(l);
3056 
3057  if (tle->resjunk)
3058  continue; /* ignore resjunk columns */
3059  if (colType == NULL)
3060  elog(ERROR, "wrong number of tlist entries");
3061  if (exprType((Node *) tle->expr) != lfirst_oid(colType))
3062  safetyInfo->unsafeColumns[tle->resno] = true;
3063  colType = lnext(colType);
3064  }
3065  if (colType != NULL)
3066  elog(ERROR, "wrong number of tlist entries");
3067 }
Definition: nodes.h:517
bool * unsafeColumns
Definition: allpaths.c:54
bool resjunk
Definition: primnodes.h:1383
#define ERROR
Definition: elog.h:43
AttrNumber resno
Definition: primnodes.h:1377
static ListCell * list_head(const List *l)
Definition: pg_list.h:77
#define lnext(lc)
Definition: pg_list.h:105
#define lfirst(lc)
Definition: pg_list.h:106
Expr * expr
Definition: primnodes.h:1376
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
#define elog
Definition: elog.h:219
#define lfirst_oid(lc)
Definition: pg_list.h:108

◆ compute_parallel_worker()

int compute_parallel_worker ( RelOptInfo rel,
double  heap_pages,
double  index_pages,
int  max_workers 
)

Definition at line 3434 of file allpaths.c.

References Max, Min, min_parallel_index_scan_size, min_parallel_table_scan_size, RelOptInfo::rel_parallel_workers, RELOPT_BASEREL, and RelOptInfo::reloptkind.

Referenced by cost_index(), create_partial_bitmap_paths(), create_plain_partial_paths(), and plan_create_index_workers().

3436 {
3437  int parallel_workers = 0;
3438 
3439  /*
3440  * If the user has set the parallel_workers reloption, use that; otherwise
3441  * select a default number of workers.
3442  */
3443  if (rel->rel_parallel_workers != -1)
3444  parallel_workers = rel->rel_parallel_workers;
3445  else
3446  {
3447  /*
3448  * If the number of pages being scanned is insufficient to justify a
3449  * parallel scan, just return zero ... unless it's an inheritance
3450  * child. In that case, we want to generate a parallel path here
3451  * anyway. It might not be worthwhile just for this relation, but
3452  * when combined with all of its inheritance siblings it may well pay
3453  * off.
3454  */
3455  if (rel->reloptkind == RELOPT_BASEREL &&
3456  ((heap_pages >= 0 && heap_pages < min_parallel_table_scan_size) ||
3457  (index_pages >= 0 && index_pages < min_parallel_index_scan_size)))
3458  return 0;
3459 
3460  if (heap_pages >= 0)
3461  {
3462  int heap_parallel_threshold;
3463  int heap_parallel_workers = 1;
3464 
3465  /*
3466  * Select the number of workers based on the log of the size of
3467  * the relation. This probably needs to be a good deal more
3468  * sophisticated, but we need something here for now. Note that
3469  * the upper limit of the min_parallel_table_scan_size GUC is
3470  * chosen to prevent overflow here.
3471  */
3472  heap_parallel_threshold = Max(min_parallel_table_scan_size, 1);
3473  while (heap_pages >= (BlockNumber) (heap_parallel_threshold * 3))
3474  {
3475  heap_parallel_workers++;
3476  heap_parallel_threshold *= 3;
3477  if (heap_parallel_threshold > INT_MAX / 3)
3478  break; /* avoid overflow */
3479  }
3480 
3481  parallel_workers = heap_parallel_workers;
3482  }
3483 
3484  if (index_pages >= 0)
3485  {
3486  int index_parallel_workers = 1;
3487  int index_parallel_threshold;
3488 
3489  /* same calculation as for heap_pages above */
3490  index_parallel_threshold = Max(min_parallel_index_scan_size, 1);
3491  while (index_pages >= (BlockNumber) (index_parallel_threshold * 3))
3492  {
3493  index_parallel_workers++;
3494  index_parallel_threshold *= 3;
3495  if (index_parallel_threshold > INT_MAX / 3)
3496  break; /* avoid overflow */
3497  }
3498 
3499  if (parallel_workers > 0)
3500  parallel_workers = Min(parallel_workers, index_parallel_workers);
3501  else
3502  parallel_workers = index_parallel_workers;
3503  }
3504  }
3505 
3506  /* In no case use more than caller supplied maximum number of workers */
3507  parallel_workers = Min(parallel_workers, max_workers);
3508 
3509  return parallel_workers;
3510 }
RelOptKind reloptkind
Definition: relation.h:597
#define Min(x, y)
Definition: c.h:857
uint32 BlockNumber
Definition: block.h:31
int min_parallel_index_scan_size
Definition: allpaths.c:63
int rel_parallel_workers
Definition: relation.h:644
#define Max(x, y)
Definition: c.h:851
int min_parallel_table_scan_size
Definition: allpaths.c:62

◆ create_partial_bitmap_paths()

void create_partial_bitmap_paths ( PlannerInfo root,
RelOptInfo rel,
Path bitmapqual 
)

Definition at line 3398 of file allpaths.c.

References add_partial_path(), compute_bitmap_pages(), compute_parallel_worker(), create_bitmap_heap_path(), RelOptInfo::lateral_relids, and max_parallel_workers_per_gather.

Referenced by create_index_paths().

3400 {
3401  int parallel_workers;
3402  double pages_fetched;
3403 
3404  /* Compute heap pages for bitmap heap scan */
3405  pages_fetched = compute_bitmap_pages(root, rel, bitmapqual, 1.0,
3406  NULL, NULL);
3407 
3408  parallel_workers = compute_parallel_worker(rel, pages_fetched, -1,
3410 
3411  if (parallel_workers <= 0)
3412  return;
3413 
3414  add_partial_path(rel, (Path *) create_bitmap_heap_path(root, rel,
3415  bitmapqual, rel->lateral_relids, 1.0, parallel_workers));
3416 }
int compute_parallel_worker(RelOptInfo *rel, double heap_pages, double index_pages, int max_workers)
Definition: allpaths.c:3434
Relids lateral_relids
Definition: relation.h:625
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:762
int max_parallel_workers_per_gather
Definition: costsize.c:123
double compute_bitmap_pages(PlannerInfo *root, RelOptInfo *baserel, Path *bitmapqual, int loop_count, Cost *cost, double *tuple)
Definition: costsize.c:5382
BitmapHeapPath * create_bitmap_heap_path(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual, Relids required_outer, double loop_count, int parallel_degree)
Definition: pathnode.c:1077

◆ create_plain_partial_paths()

static void create_plain_partial_paths ( PlannerInfo root,
RelOptInfo rel 
)
static

Definition at line 725 of file allpaths.c.

References add_partial_path(), compute_parallel_worker(), create_seqscan_path(), max_parallel_workers_per_gather, and RelOptInfo::pages.

Referenced by set_plain_rel_pathlist().

726 {
727  int parallel_workers;
728 
729  parallel_workers = compute_parallel_worker(rel, rel->pages, -1,
731 
732  /* If any limit was set to zero, the user doesn't want a parallel scan. */
733  if (parallel_workers <= 0)
734  return;
735 
736  /* Add an unordered partial path based on a parallel sequential scan. */
737  add_partial_path(rel, create_seqscan_path(root, rel, NULL, parallel_workers));
738 }
int compute_parallel_worker(RelOptInfo *rel, double heap_pages, double index_pages, int max_workers)
Definition: allpaths.c:3434
BlockNumber pages
Definition: relation.h:639
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:762
int max_parallel_workers_per_gather
Definition: costsize.c:123
Path * create_seqscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer, int parallel_workers)
Definition: pathnode.c:948

◆ generate_gather_paths()

void generate_gather_paths ( PlannerInfo root,
RelOptInfo rel,
bool  override_rows 
)

Definition at line 2540 of file allpaths.c.

References add_path(), create_gather_merge_path(), create_gather_path(), lfirst, linitial, NIL, Path::parallel_workers, RelOptInfo::partial_pathlist, GatherMergePath::path, Path::pathkeys, RelOptInfo::reltarget, Path::rows, and subpath().

Referenced by apply_scanjoin_target_to_paths(), gather_grouping_paths(), merge_clump(), set_rel_pathlist(), and standard_join_search().

2541 {
2542  Path *cheapest_partial_path;
2543  Path *simple_gather_path;
2544  ListCell *lc;
2545  double rows;
2546  double *rowsp = NULL;
2547 
2548  /* If there are no partial paths, there's nothing to do here. */
2549  if (rel->partial_pathlist == NIL)
2550  return;
2551 
2552  /* Should we override the rel's rowcount estimate? */
2553  if (override_rows)
2554  rowsp = &rows;
2555 
2556  /*
2557  * The output of Gather is always unsorted, so there's only one partial
2558  * path of interest: the cheapest one. That will be the one at the front
2559  * of partial_pathlist because of the way add_partial_path works.
2560  */
2561  cheapest_partial_path = linitial(rel->partial_pathlist);
2562  rows =
2563  cheapest_partial_path->rows * cheapest_partial_path->parallel_workers;
2564  simple_gather_path = (Path *)
2565  create_gather_path(root, rel, cheapest_partial_path, rel->reltarget,
2566  NULL, rowsp);
2567  add_path(rel, simple_gather_path);
2568 
2569  /*
2570  * For each useful ordering, we can consider an order-preserving Gather
2571  * Merge.
2572  */
2573  foreach(lc, rel->partial_pathlist)
2574  {
2575  Path *subpath = (Path *) lfirst(lc);
2576  GatherMergePath *path;
2577 
2578  if (subpath->pathkeys == NIL)
2579  continue;
2580 
2581  rows = subpath->rows * subpath->parallel_workers;
2582  path = create_gather_merge_path(root, rel, subpath, rel->reltarget,
2583  subpath->pathkeys, NULL, rowsp);
2584  add_path(rel, &path->path);
2585  }
2586 }
#define NIL
Definition: pg_list.h:69
GatherPath * create_gather_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, Relids required_outer, double *rows)
Definition: pathnode.c:1826
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
int parallel_workers
Definition: relation.h:1073
List * partial_pathlist
Definition: relation.h:616
#define linitial(l)
Definition: pg_list.h:111
GatherMergePath * create_gather_merge_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
Definition: pathnode.c:1735
List * pathkeys
Definition: relation.h:1080
#define lfirst(lc)
Definition: pg_list.h:106
double rows
Definition: relation.h:1076
struct PathTarget * reltarget
Definition: relation.h:611
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234

◆ generate_mergeappend_paths()

static void generate_mergeappend_paths ( PlannerInfo root,
RelOptInfo rel,
List live_childrels,
List all_child_pathkeys,
List partitioned_rels 
)
static

Definition at line 1791 of file allpaths.c.

References accumulate_append_subpath(), add_path(), Assert, RelOptInfo::cheapest_total_path, create_merge_append_path(), get_cheapest_path_for_pathkeys(), lfirst, NIL, Path::param_info, RelOptInfo::pathlist, STARTUP_COST, and TOTAL_COST.

Referenced by add_paths_to_append_rel().

1795 {
1796  ListCell *lcp;
1797 
1798  foreach(lcp, all_child_pathkeys)
1799  {
1800  List *pathkeys = (List *) lfirst(lcp);
1801  List *startup_subpaths = NIL;
1802  List *total_subpaths = NIL;
1803  bool startup_neq_total = false;
1804  ListCell *lcr;
1805 
1806  /* Select the child paths for this ordering... */
1807  foreach(lcr, live_childrels)
1808  {
1809  RelOptInfo *childrel = (RelOptInfo *) lfirst(lcr);
1810  Path *cheapest_startup,
1811  *cheapest_total;
1812 
1813  /* Locate the right paths, if they are available. */
1814  cheapest_startup =
1816  pathkeys,
1817  NULL,
1818  STARTUP_COST,
1819  false);
1820  cheapest_total =
1822  pathkeys,
1823  NULL,
1824  TOTAL_COST,
1825  false);
1826 
1827  /*
1828  * If we can't find any paths with the right order just use the
1829  * cheapest-total path; we'll have to sort it later.
1830  */
1831  if (cheapest_startup == NULL || cheapest_total == NULL)
1832  {
1833  cheapest_startup = cheapest_total =
1834  childrel->cheapest_total_path;
1835  /* Assert we do have an unparameterized path for this child */
1836  Assert(cheapest_total->param_info == NULL);
1837  }
1838 
1839  /*
1840  * Notice whether we actually have different paths for the
1841  * "cheapest" and "total" cases; frequently there will be no point
1842  * in two create_merge_append_path() calls.
1843  */
1844  if (cheapest_startup != cheapest_total)
1845  startup_neq_total = true;
1846 
1847  accumulate_append_subpath(cheapest_startup,
1848  &startup_subpaths, NULL);
1849  accumulate_append_subpath(cheapest_total,
1850  &total_subpaths, NULL);
1851  }
1852 
1853  /* ... and build the MergeAppend paths */
1854  add_path(rel, (Path *) create_merge_append_path(root,
1855  rel,
1856  startup_subpaths,
1857  pathkeys,
1858  NULL,
1859  partitioned_rels));
1860  if (startup_neq_total)
1861  add_path(rel, (Path *) create_merge_append_path(root,
1862  rel,
1863  total_subpaths,
1864  pathkeys,
1865  NULL,
1866  partitioned_rels));
1867  }
1868 }
Path * get_cheapest_path_for_pathkeys(List *paths, List *pathkeys, Relids required_outer, CostSelector cost_criterion, bool require_parallel_safe)
Definition: pathkeys.c:343
#define NIL
Definition: pg_list.h:69
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
ParamPathInfo * param_info
Definition: relation.h:1069
struct Path * cheapest_total_path
Definition: relation.h:618
MergeAppendPath * create_merge_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *pathkeys, Relids required_outer, List *partitioned_rels)
Definition: pathnode.c:1341
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
List * pathlist
Definition: relation.h:614
static void accumulate_append_subpath(Path *path, List **subpaths, List **special_subpaths)
Definition: allpaths.c:1967
Definition: pg_list.h:45

◆ generate_partitionwise_join_paths()

void generate_partitionwise_join_paths ( PlannerInfo root,
RelOptInfo rel 
)

Definition at line 3522 of file allpaths.c.

References add_paths_to_append_rel(), Alias::aliasname, Assert, RelOptInfo::baserestrictinfo, bms_next_member(), RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, check_stack_depth(), RestrictInfo::clause, RangeTblEntry::eref, generate_partitionwise_join_paths(), i, JoinPath::innerjoinpath, MergePath::innersortkeys, IS_DUMMY_REL, IS_JOIN_REL, IS_PARTITIONED_REL, IsA, RelOptInfo::joininfo, JoinPath::joinrestrictinfo, lappend(), lfirst, list_free(), lnext, mark_dummy_rel(), MergePath::materialize_inner, NIL, nodeTag, RelOptInfo::nparts, JoinPath::outerjoinpath, MergePath::outersortkeys, Path::param_info, Path::parent, PlannerInfo::parse, RelOptInfo::part_rels, Path::pathkeys, RelOptInfo::pathlist, Path::pathtype, ParamPathInfo::ppi_req_outer, print_expr(), print_pathkeys(), RelOptInfo::relids, RelOptInfo::reltarget, RelOptInfo::rows, Path::rows, Query::rtable, set_cheapest(), PlannerInfo::simple_rte_array, Path::startup_cost, subpath(), T_AggPath, T_AppendPath, T_BitmapAndPath, T_BitmapHeapPath, T_BitmapOrPath, T_CteScan, T_ForeignPath, T_FunctionScan, T_GatherPath, T_GroupingSetsPath, T_GroupPath, T_HashPath, T_IndexPath, T_LimitPath, T_LockRowsPath, T_MaterialPath, T_MergeAppendPath, T_MergePath, T_MinMaxAggPath, T_ModifyTablePath, T_NestPath, T_Path, T_ProjectionPath, T_ProjectSetPath, T_RecursiveUnionPath, T_ResultPath, T_SampleScan, T_SeqScan, T_SetOpPath, T_SortPath, T_SubqueryScan, T_SubqueryScanPath, T_TableFuncScan, T_TidPath, T_UniquePath, T_UpperUniquePath, T_ValuesScan, T_WindowAggPath, T_WorkTableScan, Path::total_cost, and PathTarget::width.

Referenced by generate_partitionwise_join_paths(), merge_clump(), and standard_join_search().

3523 {
3524  List *live_children = NIL;
3525  int cnt_parts;
3526  int num_parts;
3527  RelOptInfo **part_rels;
3528 
3529  /* Handle only join relations here. */
3530  if (!IS_JOIN_REL(rel))
3531  return;
3532 
3533  /* We've nothing to do if the relation is not partitioned. */
3534  if (!IS_PARTITIONED_REL(rel))
3535  return;
3536 
3537  /* Guard against stack overflow due to overly deep partition hierarchy. */
3539 
3540  num_parts = rel->nparts;
3541  part_rels = rel->part_rels;
3542 
3543  /* Collect non-dummy child-joins. */
3544  for (cnt_parts = 0; cnt_parts < num_parts; cnt_parts++)
3545  {
3546  RelOptInfo *child_rel = part_rels[cnt_parts];
3547 
3548  Assert(child_rel != NULL);
3549 
3550  /* Add partitionwise join paths for partitioned child-joins. */
3551  generate_partitionwise_join_paths(root, child_rel);
3552 
3553  /* Dummy children will not be scanned, so ignore those. */
3554  if (IS_DUMMY_REL(child_rel))
3555  continue;
3556 
3557  set_cheapest(child_rel);
3558 
3559 #ifdef OPTIMIZER_DEBUG
3560  debug_print_rel(root, child_rel);
3561 #endif
3562 
3563  live_children = lappend(live_children, child_rel);
3564  }
3565 
3566  /* If all child-joins are dummy, parent join is also dummy. */
3567  if (!live_children)
3568  {
3569  mark_dummy_rel(rel);
3570  return;
3571  }
3572 
3573  /* Build additional paths for this rel from child-join paths. */
3574  add_paths_to_append_rel(root, rel, live_children);
3575  list_free(live_children);
3576 }
#define NIL
Definition: pg_list.h:69
void add_paths_to_append_rel(PlannerInfo *root, RelOptInfo *rel, List *live_childrels)
Definition: allpaths.c:1376
#define IS_PARTITIONED_REL(rel)
Definition: relation.h:694
#define IS_JOIN_REL(rel)
Definition: relation.h:578
void generate_partitionwise_join_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:3522
#define IS_DUMMY_REL(r)
Definition: relation.h:1305
void check_stack_depth(void)
Definition: postgres.c:3155
int nparts
Definition: relation.h:673
List * lappend(List *list, void *datum)
Definition: list.c:128
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
void mark_dummy_rel(RelOptInfo *rel)
Definition: joinrels.c:1215
#define Assert(condition)
Definition: c.h:699
struct RelOptInfo ** part_rels
Definition: relation.h:676
void list_free(List *list)
Definition: list.c:1133
Definition: pg_list.h:45

◆ get_cheapest_parameterized_child_path()

static Path * get_cheapest_parameterized_child_path ( PlannerInfo root,
RelOptInfo rel,
Relids  required_outer 
)
static

Definition at line 1878 of file allpaths.c.

References Assert, bms_equal(), bms_is_subset(), compare_path_costs(), get_cheapest_path_for_pathkeys(), lfirst, NIL, PATH_REQ_OUTER, RelOptInfo::pathlist, reparameterize_path(), and TOTAL_COST.

Referenced by add_paths_to_append_rel().

1880 {
1881  Path *cheapest;
1882  ListCell *lc;
1883 
1884  /*
1885  * Look up the cheapest existing path with no more than the needed
1886  * parameterization. If it has exactly the needed parameterization, we're
1887  * done.
1888  */
1889  cheapest = get_cheapest_path_for_pathkeys(rel->pathlist,
1890  NIL,
1891  required_outer,
1892  TOTAL_COST,
1893  false);
1894  Assert(cheapest != NULL);
1895  if (bms_equal(PATH_REQ_OUTER(cheapest), required_outer))
1896  return cheapest;
1897 
1898  /*
1899  * Otherwise, we can "reparameterize" an existing path to match the given
1900  * parameterization, which effectively means pushing down additional
1901  * joinquals to be checked within the path's scan. However, some existing
1902  * paths might check the available joinquals already while others don't;
1903  * therefore, it's not clear which existing path will be cheapest after
1904  * reparameterization. We have to go through them all and find out.
1905  */
1906  cheapest = NULL;
1907  foreach(lc, rel->pathlist)
1908  {
1909  Path *path = (Path *) lfirst(lc);
1910 
1911  /* Can't use it if it needs more than requested parameterization */
1912  if (!bms_is_subset(PATH_REQ_OUTER(path), required_outer))
1913  continue;
1914 
1915  /*
1916  * Reparameterization can only increase the path's cost, so if it's
1917  * already more expensive than the current cheapest, forget it.
1918  */
1919  if (cheapest != NULL &&
1920  compare_path_costs(cheapest, path, TOTAL_COST) <= 0)
1921  continue;
1922 
1923  /* Reparameterize if needed, then recheck cost */
1924  if (!bms_equal(PATH_REQ_OUTER(path), required_outer))
1925  {
1926  path = reparameterize_path(root, path, required_outer, 1.0);
1927  if (path == NULL)
1928  continue; /* failed to reparameterize this one */
1929  Assert(bms_equal(PATH_REQ_OUTER(path), required_outer));
1930 
1931  if (cheapest != NULL &&
1932  compare_path_costs(cheapest, path, TOTAL_COST) <= 0)
1933  continue;
1934  }
1935 
1936  /* We have a new best path */
1937  cheapest = path;
1938  }
1939 
1940  /* Return the best path, or NULL if we found no suitable candidate */
1941  return cheapest;
1942 }
Path * get_cheapest_path_for_pathkeys(List *paths, List *pathkeys, Relids required_outer, CostSelector cost_criterion, bool require_parallel_safe)
Definition: pathkeys.c:343
#define NIL
Definition: pg_list.h:69
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:374
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:71
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
#define PATH_REQ_OUTER(path)
Definition: relation.h:1085
Path * reparameterize_path(PlannerInfo *root, Path *path, Relids required_outer, double loop_count)
Definition: pathnode.c:3507
List * pathlist
Definition: relation.h:614
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:153

◆ has_multiple_baserels()

static bool has_multiple_baserels ( PlannerInfo root)
static

Definition at line 2041 of file allpaths.c.

References RELOPT_BASEREL, RelOptInfo::reloptkind, PlannerInfo::simple_rel_array, and PlannerInfo::simple_rel_array_size.

Referenced by set_subquery_pathlist().

2042 {
2043  int num_base_rels = 0;
2044  Index rti;
2045 
2046  for (rti = 1; rti < root->simple_rel_array_size; rti++)
2047  {
2048  RelOptInfo *brel = root->simple_rel_array[rti];
2049 
2050  if (brel == NULL)
2051  continue;
2052 
2053  /* ignore RTEs that are "other rels" */
2054  if (brel->reloptkind == RELOPT_BASEREL)
2055  if (++num_base_rels > 1)
2056  return true;
2057  }
2058  return false;
2059 }
RelOptKind reloptkind
Definition: relation.h:597
struct RelOptInfo ** simple_rel_array
Definition: relation.h:182
int simple_rel_array_size
Definition: relation.h:183
unsigned int Index
Definition: c.h:442

◆ make_one_rel()

RelOptInfo* make_one_rel ( PlannerInfo root,
List joinlist 
)

Definition at line 146 of file allpaths.c.

References PlannerInfo::all_baserels, Assert, bms_add_member(), bms_equal(), make_rel_from_joinlist(), RelOptInfo::relid, RelOptInfo::relids, RELOPT_BASEREL, RelOptInfo::reloptkind, set_base_rel_consider_startup(), set_base_rel_pathlists(), set_base_rel_sizes(), PlannerInfo::simple_rel_array, and PlannerInfo::simple_rel_array_size.

Referenced by query_planner().

147 {
148  RelOptInfo *rel;
149  Index rti;
150 
151  /*
152  * Construct the all_baserels Relids set.
153  */
154  root->all_baserels = NULL;
155  for (rti = 1; rti < root->simple_rel_array_size; rti++)
156  {
157  RelOptInfo *brel = root->simple_rel_array[rti];
158 
159  /* there may be empty slots corresponding to non-baserel RTEs */
160  if (brel == NULL)
161  continue;
162 
163  Assert(brel->relid == rti); /* sanity check on array */
164 
165  /* ignore RTEs that are "other rels" */
166  if (brel->reloptkind != RELOPT_BASEREL)
167  continue;
168 
169  root->all_baserels = bms_add_member(root->all_baserels, brel->relid);
170  }
171 
172  /* Mark base rels as to whether we care about fast-start plans */
174 
175  /*
176  * Compute size estimates and consider_parallel flags for each base rel,
177  * then generate access paths.
178  */
179  set_base_rel_sizes(root);
181 
182  /*
183  * Generate access paths for the entire join tree.
184  */
185  rel = make_rel_from_joinlist(root, joinlist);
186 
187  /*
188  * The result should join all and only the query's base rels.
189  */
190  Assert(bms_equal(rel->relids, root->all_baserels));
191 
192  return rel;
193 }
RelOptKind reloptkind
Definition: relation.h:597
static void set_base_rel_sizes(PlannerInfo *root)
Definition: allpaths.c:249
static void set_base_rel_consider_startup(PlannerInfo *root)
Definition: allpaths.c:206
struct RelOptInfo ** simple_rel_array
Definition: relation.h:182
Relids all_baserels
Definition: relation.h:199
static RelOptInfo * make_rel_from_joinlist(PlannerInfo *root, List *joinlist)
Definition: allpaths.c:2596
Relids relids
Definition: relation.h:600
int simple_rel_array_size
Definition: relation.h:183
Index relid
Definition: relation.h:628
static void set_base_rel_pathlists(PlannerInfo *root)
Definition: allpaths.c:292
unsigned int Index
Definition: c.h:442
#define Assert(condition)
Definition: c.h:699
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:764
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:153

◆ make_rel_from_joinlist()

static RelOptInfo * make_rel_from_joinlist ( PlannerInfo root,
List joinlist 
)
static

Definition at line 2596 of file allpaths.c.

References elog, enable_geqo, ERROR, find_base_rel(), geqo(), geqo_threshold, PlannerInfo::initial_rels, IsA, join_search_hook, lappend(), lfirst, linitial, list_length(), NIL, nodeTag, and standard_join_search().

Referenced by make_one_rel().

2597 {
2598  int levels_needed;
2599  List *initial_rels;
2600  ListCell *jl;
2601 
2602  /*
2603  * Count the number of child joinlist nodes. This is the depth of the
2604  * dynamic-programming algorithm we must employ to consider all ways of
2605  * joining the child nodes.
2606  */
2607  levels_needed = list_length(joinlist);
2608 
2609  if (levels_needed <= 0)
2610  return NULL; /* nothing to do? */
2611 
2612  /*
2613  * Construct a list of rels corresponding to the child joinlist nodes.
2614  * This may contain both base rels and rels constructed according to
2615  * sub-joinlists.
2616  */
2617  initial_rels = NIL;
2618  foreach(jl, joinlist)
2619  {
2620  Node *jlnode = (Node *) lfirst(jl);
2621  RelOptInfo *thisrel;
2622 
2623  if (IsA(jlnode, RangeTblRef))
2624  {
2625  int varno = ((RangeTblRef *) jlnode)->rtindex;
2626 
2627  thisrel = find_base_rel(root, varno);
2628  }
2629  else if (IsA(jlnode, List))
2630  {
2631  /* Recurse to handle subproblem */
2632  thisrel = make_rel_from_joinlist(root, (List *) jlnode);
2633  }
2634  else
2635  {
2636  elog(ERROR, "unrecognized joinlist node type: %d",
2637  (int) nodeTag(jlnode));
2638  thisrel = NULL; /* keep compiler quiet */
2639  }
2640 
2641  initial_rels = lappend(initial_rels, thisrel);
2642  }
2643 
2644  if (levels_needed == 1)
2645  {
2646  /*
2647  * Single joinlist node, so we're done.
2648  */
2649  return (RelOptInfo *) linitial(initial_rels);
2650  }
2651  else
2652  {
2653  /*
2654  * Consider the different orders in which we could join the rels,
2655  * using a plugin, GEQO, or the regular join search code.
2656  *
2657  * We put the initial_rels list into a PlannerInfo field because
2658  * has_legal_joinclause() needs to look at it (ugly :-().
2659  */
2660  root->initial_rels = initial_rels;
2661 
2662  if (join_search_hook)
2663  return (*join_search_hook) (root, levels_needed, initial_rels);
2664  else if (enable_geqo && levels_needed >= geqo_threshold)
2665  return geqo(root, levels_needed, initial_rels);
2666  else
2667  return standard_join_search(root, levels_needed, initial_rels);
2668  }
2669 }
RelOptInfo * standard_join_search(PlannerInfo *root, int levels_needed, List *initial_rels)
Definition: allpaths.c:2701
#define NIL
Definition: pg_list.h:69
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
Definition: nodes.h:517
#define linitial(l)
Definition: pg_list.h:111
#define ERROR
Definition: elog.h:43
bool enable_geqo
Definition: allpaths.c:60
static RelOptInfo * make_rel_from_joinlist(PlannerInfo *root, List *joinlist)
Definition: allpaths.c:2596
List * lappend(List *list, void *datum)
Definition: list.c:128
join_search_hook_type join_search_hook
Definition: allpaths.c:69
int geqo_threshold
Definition: allpaths.c:61
RelOptInfo * geqo(PlannerInfo *root, int number_of_rels, List *initial_rels)
Definition: geqo_main.c:67
#define lfirst(lc)
Definition: pg_list.h:106
static int list_length(const List *l)
Definition: pg_list.h:89
#define nodeTag(nodeptr)
Definition: nodes.h:522
List * initial_rels
Definition: relation.h:273
#define elog
Definition: elog.h:219
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:279
Definition: pg_list.h:45

◆ qual_is_pushdown_safe()

static bool qual_is_pushdown_safe ( Query subquery,
Index  rti,
Node qual,
pushdown_safety_info safetyInfo 
)
static

Definition at line 3122 of file allpaths.c.

References Assert, contain_leaked_vars(), contain_subplans(), contain_volatile_functions(), contain_window_function(), IsA, lfirst, list_free(), pull_var_clause(), PVC_INCLUDE_PLACEHOLDERS, pushdown_safety_info::unsafeColumns, pushdown_safety_info::unsafeLeaky, pushdown_safety_info::unsafeVolatile, Var::varattno, and Var::varno.

Referenced by set_subquery_pathlist().

3124 {
3125  bool safe = true;
3126  List *vars;
3127  ListCell *vl;
3128 
3129  /* Refuse subselects (point 1) */
3130  if (contain_subplans(qual))
3131  return false;
3132 
3133  /* Refuse volatile quals if we found they'd be unsafe (point 2) */
3134  if (safetyInfo->unsafeVolatile &&
3136  return false;
3137 
3138  /* Refuse leaky quals if told to (point 3) */
3139  if (safetyInfo->unsafeLeaky &&
3140  contain_leaked_vars(qual))
3141  return false;
3142 
3143  /*
3144  * It would be unsafe to push down window function calls, but at least for
3145  * the moment we could never see any in a qual anyhow. (The same applies
3146  * to aggregates, which we check for in pull_var_clause below.)
3147  */
3149 
3150  /*
3151  * Examine all Vars used in clause; since it's a restriction clause, all
3152  * such Vars must refer to subselect output columns.
3153  */
3155  foreach(vl, vars)
3156  {
3157  Var *var = (Var *) lfirst(vl);
3158 
3159  /*
3160  * XXX Punt if we find any PlaceHolderVars in the restriction clause.
3161  * It's not clear whether a PHV could safely be pushed down, and even
3162  * less clear whether such a situation could arise in any cases of
3163  * practical interest anyway. So for the moment, just refuse to push
3164  * down.
3165  */
3166  if (!IsA(var, Var))
3167  {
3168  safe = false;
3169  break;
3170  }
3171 
3172  Assert(var->varno == rti);
3173  Assert(var->varattno >= 0);
3174 
3175  /* Check point 4 */
3176  if (var->varattno == 0)
3177  {
3178  safe = false;
3179  break;
3180  }
3181 
3182  /* Check point 5 */
3183  if (safetyInfo->unsafeColumns[var->varattno])
3184  {
3185  safe = false;
3186  break;
3187  }
3188  }
3189 
3190  list_free(vars);
3191 
3192  return safe;
3193 }
bool contain_leaked_vars(Node *clause)
Definition: clauses.c:1516
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
AttrNumber varattno
Definition: primnodes.h:169
bool * unsafeColumns
Definition: allpaths.c:54
List * pull_var_clause(Node *node, int flags)
Definition: var.c:535
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:958
Definition: primnodes.h:164
bool contain_subplans(Node *clause)
Definition: clauses.c:844
#define PVC_INCLUDE_PLACEHOLDERS
Definition: var.h:24
bool contain_window_function(Node *clause)
Definition: clauses.c:728
Index varno
Definition: primnodes.h:167
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
void list_free(List *list)
Definition: list.c:1133
Definition: regcomp.c:224
Definition: pg_list.h:45

◆ recurse_push_qual()

static void recurse_push_qual ( Node setOp,
Query topquery,
RangeTblEntry rte,
Index  rti,
Node qual 
)
static

Definition at line 3246 of file allpaths.c.

References Assert, elog, ERROR, IsA, SetOperationStmt::larg, nodeTag, SetOperationStmt::rarg, rt_fetch, Query::rtable, RangeTblRef::rtindex, RangeTblEntry::subquery, and subquery_push_qual().

Referenced by subquery_push_qual().

3248 {
3249  if (IsA(setOp, RangeTblRef))
3250  {
3251  RangeTblRef *rtr = (RangeTblRef *) setOp;
3252  RangeTblEntry *subrte = rt_fetch(rtr->rtindex, topquery->rtable);
3253  Query *subquery = subrte->subquery;
3254 
3255  Assert(subquery != NULL);
3256  subquery_push_qual(subquery, rte, rti, qual);
3257  }
3258  else if (IsA(setOp, SetOperationStmt))
3259  {
3260  SetOperationStmt *op = (SetOperationStmt *) setOp;
3261 
3262  recurse_push_qual(op->larg, topquery, rte, rti, qual);
3263  recurse_push_qual(op->rarg, topquery, rte, rti, qual);
3264  }
3265  else
3266  {
3267  elog(ERROR, "unrecognized node type: %d",
3268  (int) nodeTag(setOp));
3269  }
3270 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
List * rtable
Definition: parsenodes.h:137
#define ERROR
Definition: elog.h:43
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
#define Assert(condition)
Definition: c.h:699
static void subquery_push_qual(Query *subquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3199
static void recurse_push_qual(Node *setOp, Query *topquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3246
#define nodeTag(nodeptr)
Definition: nodes.h:522
Query * subquery
Definition: parsenodes.h:985
#define elog
Definition: elog.h:219

◆ recurse_pushdown_safe()

static bool recurse_pushdown_safe ( Node setOp,
Query topquery,
pushdown_safety_info safetyInfo 
)
static

Definition at line 2912 of file allpaths.c.

References Assert, elog, ERROR, IsA, SetOperationStmt::larg, nodeTag, SetOperationStmt::op, SetOperationStmt::rarg, rt_fetch, Query::rtable, RangeTblRef::rtindex, SETOP_EXCEPT, RangeTblEntry::subquery, and subquery_is_pushdown_safe().

Referenced by subquery_is_pushdown_safe().

2914 {
2915  if (IsA(setOp, RangeTblRef))
2916  {
2917  RangeTblRef *rtr = (RangeTblRef *) setOp;
2918  RangeTblEntry *rte = rt_fetch(rtr->rtindex, topquery->rtable);
2919  Query *subquery = rte->subquery;
2920 
2921  Assert(subquery != NULL);
2922  return subquery_is_pushdown_safe(subquery, topquery, safetyInfo);
2923  }
2924  else if (IsA(setOp, SetOperationStmt))
2925  {
2926  SetOperationStmt *op = (SetOperationStmt *) setOp;
2927 
2928  /* EXCEPT is no good (point 2 for subquery_is_pushdown_safe) */
2929  if (op->op == SETOP_EXCEPT)
2930  return false;
2931  /* Else recurse */
2932  if (!recurse_pushdown_safe(op->larg, topquery, safetyInfo))
2933  return false;
2934  if (!recurse_pushdown_safe(op->rarg, topquery, safetyInfo))
2935  return false;
2936  }
2937  else
2938  {
2939  elog(ERROR, "unrecognized node type: %d",
2940  (int) nodeTag(setOp));
2941  }
2942  return true;
2943 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
static bool recurse_pushdown_safe(Node *setOp, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:2912
List * rtable
Definition: parsenodes.h:137
#define ERROR
Definition: elog.h:43
#define rt_fetch(rangetable_index, rangetable)
Definition: parsetree.h:31
#define Assert(condition)
Definition: c.h:699
SetOperation op
Definition: parsenodes.h:1599
#define nodeTag(nodeptr)
Definition: nodes.h:522
static bool subquery_is_pushdown_safe(Query *subquery, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:2860
Query * subquery
Definition: parsenodes.h:985
#define elog
Definition: elog.h:219

◆ remove_unused_subquery_outputs()

static void remove_unused_subquery_outputs ( Query subquery,
RelOptInfo rel 
)
static

Definition at line 3293 of file allpaths.c.

References RelOptInfo::baserestrictinfo, bms_is_member(), RestrictInfo::clause, contain_volatile_functions(), Query::distinctClause, TargetEntry::expr, exprCollation(), expression_returns_set(), PathTarget::exprs, exprType(), exprTypmod(), FirstLowInvalidHeapAttributeNumber, Query::hasDistinctOn, Query::hasTargetSRFs, lfirst, makeNullConst(), pull_varattnos(), RelOptInfo::relid, RelOptInfo::reltarget, TargetEntry::resjunk, TargetEntry::resno, TargetEntry::ressortgroupref, Query::setOperations, and Query::targetList.

Referenced by set_subquery_pathlist().

3294 {
3295  Bitmapset *attrs_used = NULL;
3296  ListCell *lc;
3297 
3298  /*
3299  * Do nothing if subquery has UNION/INTERSECT/EXCEPT: in principle we
3300  * could update all the child SELECTs' tlists, but it seems not worth the
3301  * trouble presently.
3302  */
3303  if (subquery->setOperations)
3304  return;
3305 
3306  /*
3307  * If subquery has regular DISTINCT (not DISTINCT ON), we're wasting our
3308  * time: all its output columns must be used in the distinctClause.
3309  */
3310  if (subquery->distinctClause && !subquery->hasDistinctOn)
3311  return;
3312 
3313  /*
3314  * Collect a bitmap of all the output column numbers used by the upper
3315  * query.
3316  *
3317  * Add all the attributes needed for joins or final output. Note: we must
3318  * look at rel's targetlist, not the attr_needed data, because attr_needed
3319  * isn't computed for inheritance child rels, cf set_append_rel_size().
3320  * (XXX might be worth changing that sometime.)
3321  */
3322  pull_varattnos((Node *) rel->reltarget->exprs, rel->relid, &attrs_used);
3323 
3324  /* Add all the attributes used by un-pushed-down restriction clauses. */
3325  foreach(lc, rel->baserestrictinfo)
3326  {
3327  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
3328 
3329  pull_varattnos((Node *) rinfo->clause, rel->relid, &attrs_used);
3330  }
3331 
3332  /*
3333  * If there's a whole-row reference to the subquery, we can't remove
3334  * anything.
3335  */
3337  return;
3338 
3339  /*
3340  * Run through the tlist and zap entries we don't need. It's okay to
3341  * modify the tlist items in-place because set_subquery_pathlist made a
3342  * copy of the subquery.
3343  */
3344  foreach(lc, subquery->targetList)
3345  {
3346  TargetEntry *tle = (TargetEntry *) lfirst(lc);
3347  Node *texpr = (Node *) tle->expr;
3348 
3349  /*
3350  * If it has a sortgroupref number, it's used in some sort/group
3351  * clause so we'd better not remove it. Also, don't remove any
3352  * resjunk columns, since their reason for being has nothing to do
3353  * with anybody reading the subquery's output. (It's likely that
3354  * resjunk columns in a sub-SELECT would always have ressortgroupref
3355  * set, but even if they don't, it seems imprudent to remove them.)
3356  */
3357  if (tle->ressortgroupref || tle->resjunk)
3358  continue;
3359 
3360  /*
3361  * If it's used by the upper query, we can't remove it.
3362  */
3364  attrs_used))
3365  continue;
3366 
3367  /*
3368  * If it contains a set-returning function, we can't remove it since
3369  * that could change the number of rows returned by the subquery.
3370  */
3371  if (subquery->hasTargetSRFs &&
3372  expression_returns_set(texpr))
3373  continue;
3374 
3375  /*
3376  * If it contains volatile functions, we daren't remove it for fear
3377  * that the user is expecting their side-effects to happen.
3378  */
3379  if (contain_volatile_functions(texpr))
3380  continue;
3381 
3382  /*
3383  * OK, we don't need it. Replace the expression with a NULL constant.
3384  * Preserve the exposed type of the expression, in case something
3385  * looks at the rowtype of the subquery's result.
3386  */
3387  tle->expr = (Expr *) makeNullConst(exprType(texpr),
3388  exprTypmod(texpr),
3389  exprCollation(texpr));
3390  }
3391 }
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:276
List * baserestrictinfo
Definition: relation.h:660
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:670
Definition: nodes.h:517
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:28
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:958
void pull_varattnos(Node *node, Index varno, Bitmapset **varattnos)
Definition: var.c:219
bool hasDistinctOn
Definition: parsenodes.h:129
List * targetList
Definition: parsenodes.h:140
Const * makeNullConst(Oid consttype, int32 consttypmod, Oid constcollid)
Definition: makefuncs.c:336
bool resjunk
Definition: primnodes.h:1383
List * distinctClause
Definition: parsenodes.h:156
AttrNumber resno
Definition: primnodes.h:1377
Index relid
Definition: relation.h:628
Expr * clause
Definition: relation.h:1868
List * exprs
Definition: relation.h:996
bool hasTargetSRFs
Definition: parsenodes.h:127
#define lfirst(lc)
Definition: pg_list.h:106
Expr * expr
Definition: primnodes.h:1376
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:720
Node * setOperations
Definition: parsenodes.h:165
Index ressortgroupref
Definition: primnodes.h:1379
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:486
struct PathTarget * reltarget
Definition: relation.h:611

◆ set_append_rel_pathlist()

static void set_append_rel_pathlist ( PlannerInfo root,
RelOptInfo rel,
Index  rti,
RangeTblEntry rte 
)
static

Definition at line 1300 of file allpaths.c.

References add_paths_to_append_rel(), PlannerInfo::append_rel_list, AppendRelInfo::child_relid, RelOptInfo::consider_parallel, IS_DUMMY_REL, lappend(), lfirst, list_concat(), list_copy(), NIL, AppendRelInfo::parent_relid, RelOptInfo::part_scheme, RelOptInfo::partitioned_child_rels, set_rel_pathlist(), PlannerInfo::simple_rel_array, and PlannerInfo::simple_rte_array.

Referenced by set_rel_pathlist().

1302 {
1303  int parentRTindex = rti;
1304  List *live_childrels = NIL;
1305  ListCell *l;
1306 
1307  /*
1308  * Generate access paths for each member relation, and remember the
1309  * non-dummy children.
1310  */
1311  foreach(l, root->append_rel_list)
1312  {
1313  AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
1314  int childRTindex;
1315  RangeTblEntry *childRTE;
1316  RelOptInfo *childrel;
1317 
1318  /* append_rel_list contains all append rels; ignore others */
1319  if (appinfo->parent_relid != parentRTindex)
1320  continue;
1321 
1322  /* Re-locate the child RTE and RelOptInfo */
1323  childRTindex = appinfo->child_relid;
1324  childRTE = root->simple_rte_array[childRTindex];
1325  childrel = root->simple_rel_array[childRTindex];
1326 
1327  /*
1328  * If set_append_rel_size() decided the parent appendrel was
1329  * parallel-unsafe at some point after visiting this child rel, we
1330  * need to propagate the unsafety marking down to the child, so that
1331  * we don't generate useless partial paths for it.
1332  */
1333  if (!rel->consider_parallel)
1334  childrel->consider_parallel = false;
1335 
1336  /*
1337  * Compute the child's access paths.
1338  */
1339  set_rel_pathlist(root, childrel, childRTindex, childRTE);
1340 
1341  /*
1342  * If child is dummy, ignore it.
1343  */
1344  if (IS_DUMMY_REL(childrel))
1345  continue;
1346 
1347  /* Bubble up childrel's partitioned children. */
1348  if (rel->part_scheme)
1349  rel->partitioned_child_rels =
1351  list_copy(childrel->partitioned_child_rels));
1352 
1353  /*
1354  * Child is live, so add it to the live_childrels list for use below.
1355  */
1356  live_childrels = lappend(live_childrels, childrel);
1357  }
1358 
1359  /* Add paths to the append relation. */
1360  add_paths_to_append_rel(root, rel, live_childrels);
1361 }
#define NIL
Definition: pg_list.h:69
void add_paths_to_append_rel(PlannerInfo *root, RelOptInfo *rel, List *live_childrels)
Definition: allpaths.c:1376
List * list_copy(const List *oldlist)
Definition: list.c:1160
List * list_concat(List *list1, List *list2)
Definition: list.c:321
struct RelOptInfo ** simple_rel_array
Definition: relation.h:182
#define IS_DUMMY_REL(r)
Definition: relation.h:1305
List * lappend(List *list, void *datum)
Definition: list.c:128
RangeTblEntry ** simple_rte_array
Definition: relation.h:191
List * append_rel_list
Definition: relation.h:255
static void set_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:422
#define lfirst(lc)
Definition: pg_list.h:106
bool consider_parallel
Definition: relation.h:608
List * partitioned_child_rels
Definition: relation.h:680
PartitionScheme part_scheme
Definition: relation.h:672
Index child_relid
Definition: relation.h:2113
Index parent_relid
Definition: relation.h:2112
Definition: pg_list.h:45

◆ set_append_rel_size()

static void set_append_rel_size ( PlannerInfo root,
RelOptInfo rel,
Index  rti,
RangeTblEntry rte 
)
static

Definition at line 868 of file allpaths.c.

References add_child_rel_equivalences(), adjust_appendrel_attrs(), PlannerInfo::append_rel_list, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictinfo, bms_is_member(), check_stack_depth(), AppendRelInfo::child_relid, RestrictInfo::clause, RelOptInfo::consider_parallel, contain_vars_of_level(), contain_volatile_functions(), DatumGetBool, eval_const_expressions(), PathTarget::exprs, exprType(), exprTypmod(), find_base_rel(), forboth, get_typavgwidth(), PlannerInfo::glob, RelOptInfo::has_eclass_joins, has_useful_pathkeys(), PlannerInfo::hasPseudoConstantQuals, i, IS_DUMMY_REL, RestrictInfo::is_pushed_down, IS_SIMPLE_REL, IsA, RelOptInfo::joininfo, lappend(), lfirst, list_make1_int, list_nth_node, make_ands_implicit(), make_restrictinfo(), RelOptInfo::max_attr, Min, RelOptInfo::min_attr, NIL, RestrictInfo::outerjoin_delayed, palloc0(), PlannerGlobal::parallelModeOK, AppendRelInfo::parent_relid, RelOptInfo::part_scheme, RelOptInfo::partitioned_child_rels, pfree(), prune_append_rel_partitions(), relation_excluded_by_constraints(), RelOptInfo::relid, RangeTblEntry::relkind, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, RelOptInfo::reltarget, rint(), RelOptInfo::rows, RestrictInfo::security_level, RangeTblEntry::securityQuals, set_dummy_rel_pathlist(), set_rel_consider_parallel(), set_rel_size(), PlannerInfo::simple_rte_array, AppendRelInfo::translated_vars, RelOptInfo::tuples, Var::varattno, and PathTarget::width.

Referenced by set_rel_size().

870 {
871  int parentRTindex = rti;
872  bool has_live_children;
873  double parent_rows;
874  double parent_size;
875  double *parent_attrsizes;
876  int nattrs;
877  ListCell *l;
878  Relids live_children = NULL;
879  bool did_pruning = false;
880 
881  /* Guard against stack overflow due to overly deep inheritance tree. */
883 
884  Assert(IS_SIMPLE_REL(rel));
885 
886  /*
887  * Initialize partitioned_child_rels to contain this RT index.
888  *
889  * Note that during the set_append_rel_pathlist() phase, we will bubble up
890  * the indexes of partitioned relations that appear down in the tree, so
891  * that when we've created Paths for all the children, the root
892  * partitioned table's list will contain all such indexes.
893  */
894  if (rte->relkind == RELKIND_PARTITIONED_TABLE)
896 
897  /*
898  * If the partitioned relation has any baserestrictinfo quals then we
899  * attempt to use these quals to prune away partitions that cannot
900  * possibly contain any tuples matching these quals. In this case we'll
901  * store the relids of all partitions which could possibly contain a
902  * matching tuple, and skip anything else in the loop below.
903  */
904  if (rte->relkind == RELKIND_PARTITIONED_TABLE &&
905  rel->baserestrictinfo != NIL)
906  {
907  live_children = prune_append_rel_partitions(rel);
908  did_pruning = true;
909  }
910 
911  /*
912  * Initialize to compute size estimates for whole append relation.
913  *
914  * We handle width estimates by weighting the widths of different child
915  * rels proportionally to their number of rows. This is sensible because
916  * the use of width estimates is mainly to compute the total relation
917  * "footprint" if we have to sort or hash it. To do this, we sum the
918  * total equivalent size (in "double" arithmetic) and then divide by the
919  * total rowcount estimate. This is done separately for the total rel
920  * width and each attribute.
921  *
922  * Note: if you consider changing this logic, beware that child rels could
923  * have zero rows and/or width, if they were excluded by constraints.
924  */
925  has_live_children = false;
926  parent_rows = 0;
927  parent_size = 0;
928  nattrs = rel->max_attr - rel->min_attr + 1;
929  parent_attrsizes = (double *) palloc0(nattrs * sizeof(double));
930 
931  foreach(l, root->append_rel_list)
932  {
933  AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
934  int childRTindex;
935  RangeTblEntry *childRTE;
936  RelOptInfo *childrel;
937  List *childquals;
938  Index cq_min_security;
939  bool have_const_false_cq;
940  ListCell *parentvars;
941  ListCell *childvars;
942  ListCell *lc;
943 
944  /* append_rel_list contains all append rels; ignore others */
945  if (appinfo->parent_relid != parentRTindex)
946  continue;
947 
948  childRTindex = appinfo->child_relid;
949  childRTE = root->simple_rte_array[childRTindex];
950 
951  /*
952  * The child rel's RelOptInfo was already created during
953  * add_base_rels_to_query.
954  */
955  childrel = find_base_rel(root, childRTindex);
957 
958  if (rel->part_scheme)
959  {
960  AttrNumber attno;
961 
962  /*
963  * We need attr_needed data for building targetlist of a join
964  * relation representing join between matching partitions for
965  * partitionwise join. A given attribute of a child will be
966  * needed in the same highest joinrel where the corresponding
967  * attribute of parent is needed. Hence it suffices to use the
968  * same Relids set for parent and child.
969  */
970  for (attno = rel->min_attr; attno <= rel->max_attr; attno++)
971  {
972  int index = attno - rel->min_attr;
973  Relids attr_needed = rel->attr_needed[index];
974 
975  /* System attributes do not need translation. */
976  if (attno <= 0)
977  {
978  Assert(rel->min_attr == childrel->min_attr);
979  childrel->attr_needed[index] = attr_needed;
980  }
981  else
982  {
983  Var *var = list_nth_node(Var,
984  appinfo->translated_vars,
985  attno - 1);
986  int child_index;
987 
988  /*
989  * Ignore any column dropped from the parent.
990  * Corresponding Var won't have any translation. It won't
991  * have attr_needed information, since it can not be
992  * referenced in the query.
993  */
994  if (var == NULL)
995  {
996  Assert(attr_needed == NULL);
997  continue;
998  }
999 
1000  child_index = var->varattno - childrel->min_attr;
1001  childrel->attr_needed[child_index] = attr_needed;
1002  }
1003  }
1004  }
1005 
1006  /*
1007  * Copy/Modify targetlist. Even if this child is deemed empty, we need
1008  * its targetlist in case it falls on nullable side in a child-join
1009  * because of partitionwise join.
1010  *
1011  * NB: the resulting childrel->reltarget->exprs may contain arbitrary
1012  * expressions, which otherwise would not occur in a rel's targetlist.
1013  * Code that might be looking at an appendrel child must cope with
1014  * such. (Normally, a rel's targetlist would only include Vars and
1015  * PlaceHolderVars.) XXX we do not bother to update the cost or width
1016  * fields of childrel->reltarget; not clear if that would be useful.
1017  */
1018  childrel->reltarget->exprs = (List *)
1020  (Node *) rel->reltarget->exprs,
1021  1, &appinfo);
1022 
1023  /*
1024  * We have to make child entries in the EquivalenceClass data
1025  * structures as well. This is needed either if the parent
1026  * participates in some eclass joins (because we will want to consider
1027  * inner-indexscan joins on the individual children) or if the parent
1028  * has useful pathkeys (because we should try to build MergeAppend
1029  * paths that produce those sort orderings). Even if this child is
1030  * deemed dummy, it may fall on nullable side in a child-join, which
1031  * in turn may participate in a MergeAppend, where we will need the
1032  * EquivalenceClass data structures.
1033  */
1034  if (rel->has_eclass_joins || has_useful_pathkeys(root, rel))
1035  add_child_rel_equivalences(root, appinfo, rel, childrel);
1036  childrel->has_eclass_joins = rel->has_eclass_joins;
1037 
1038  /*
1039  * We have to copy the parent's quals to the child, with appropriate
1040  * substitution of variables. However, only the baserestrictinfo
1041  * quals are needed before we can check for constraint exclusion; so
1042  * do that first and then check to see if we can disregard this child.
1043  *
1044  * The child rel's targetlist might contain non-Var expressions, which
1045  * means that substitution into the quals could produce opportunities
1046  * for const-simplification, and perhaps even pseudoconstant quals.
1047  * Therefore, transform each RestrictInfo separately to see if it
1048  * reduces to a constant or pseudoconstant. (We must process them
1049  * separately to keep track of the security level of each qual.)
1050  */
1051  childquals = NIL;
1052  cq_min_security = UINT_MAX;
1053  have_const_false_cq = false;
1054  foreach(lc, rel->baserestrictinfo)
1055  {
1056  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1057  Node *childqual;
1058  ListCell *lc2;
1059 
1060  Assert(IsA(rinfo, RestrictInfo));
1061  childqual = adjust_appendrel_attrs(root,
1062  (Node *) rinfo->clause,
1063  1, &appinfo);
1064  childqual = eval_const_expressions(root, childqual);
1065  /* check for flat-out constant */
1066  if (childqual && IsA(childqual, Const))
1067  {
1068  if (((Const *) childqual)->constisnull ||
1069  !DatumGetBool(((Const *) childqual)->constvalue))
1070  {
1071  /* Restriction reduces to constant FALSE or NULL */
1072  have_const_false_cq = true;
1073  break;
1074  }
1075  /* Restriction reduces to constant TRUE, so drop it */
1076  continue;
1077  }
1078  /* might have gotten an AND clause, if so flatten it */
1079  foreach(lc2, make_ands_implicit((Expr *) childqual))
1080  {
1081  Node *onecq = (Node *) lfirst(lc2);
1082  bool pseudoconstant;
1083 
1084  /* check for pseudoconstant (no Vars or volatile functions) */
1085  pseudoconstant =
1086  !contain_vars_of_level(onecq, 0) &&
1088  if (pseudoconstant)
1089  {
1090  /* tell createplan.c to check for gating quals */
1091  root->hasPseudoConstantQuals = true;
1092  }
1093  /* reconstitute RestrictInfo with appropriate properties */
1094  childquals = lappend(childquals,
1095  make_restrictinfo((Expr *) onecq,
1096  rinfo->is_pushed_down,
1097  rinfo->outerjoin_delayed,
1098  pseudoconstant,
1099  rinfo->security_level,
1100  NULL, NULL, NULL));
1101  /* track minimum security level among child quals */
1102  cq_min_security = Min(cq_min_security, rinfo->security_level);
1103  }
1104  }
1105 
1106  /*
1107  * In addition to the quals inherited from the parent, we might have
1108  * securityQuals associated with this particular child node.
1109  * (Currently this can only happen in appendrels originating from
1110  * UNION ALL; inheritance child tables don't have their own
1111  * securityQuals, see expand_inherited_rtentry().) Pull any such
1112  * securityQuals up into the baserestrictinfo for the child. This is
1113  * similar to process_security_barrier_quals() for the parent rel,
1114  * except that we can't make any general deductions from such quals,
1115  * since they don't hold for the whole appendrel.
1116  */
1117  if (childRTE->securityQuals)
1118  {
1119  Index security_level = 0;
1120 
1121  foreach(lc, childRTE->securityQuals)
1122  {
1123  List *qualset = (List *) lfirst(lc);
1124  ListCell *lc2;
1125 
1126  foreach(lc2, qualset)
1127  {
1128  Expr *qual = (Expr *) lfirst(lc2);
1129 
1130  /* not likely that we'd see constants here, so no check */
1131  childquals = lappend(childquals,
1132  make_restrictinfo(qual,
1133  true, false, false,
1134  security_level,
1135  NULL, NULL, NULL));
1136  cq_min_security = Min(cq_min_security, security_level);
1137  }
1138  security_level++;
1139  }
1140  Assert(security_level <= root->qual_security_level);
1141  }
1142 
1143  /*
1144  * OK, we've got all the baserestrictinfo quals for this child.
1145  */
1146  childrel->baserestrictinfo = childquals;
1147  childrel->baserestrict_min_security = cq_min_security;
1148 
1149  if (have_const_false_cq)
1150  {
1151  /*
1152  * Some restriction clause reduced to constant FALSE or NULL after
1153  * substitution, so this child need not be scanned.
1154  */
1155  set_dummy_rel_pathlist(childrel);
1156  continue;
1157  }
1158 
1159  if (did_pruning && !bms_is_member(appinfo->child_relid, live_children))
1160  {
1161  /* This partition was pruned; skip it. */
1162  set_dummy_rel_pathlist(childrel);
1163  continue;
1164  }
1165 
1166  if (relation_excluded_by_constraints(root, childrel, childRTE))
1167  {
1168  /*
1169  * This child need not be scanned, so we can omit it from the
1170  * appendrel.
1171  */
1172  set_dummy_rel_pathlist(childrel);
1173  continue;
1174  }
1175 
1176  /* CE failed, so finish copying/modifying join quals. */
1177  childrel->joininfo = (List *)
1179  (Node *) rel->joininfo,
1180  1, &appinfo);
1181 
1182  /*
1183  * If parallelism is allowable for this query in general, see whether
1184  * it's allowable for this childrel in particular. But if we've
1185  * already decided the appendrel is not parallel-safe as a whole,
1186  * there's no point in considering parallelism for this child. For
1187  * consistency, do this before calling set_rel_size() for the child.
1188  */
1189  if (root->glob->parallelModeOK && rel->consider_parallel)
1190  set_rel_consider_parallel(root, childrel, childRTE);
1191 
1192  /*
1193  * Compute the child's size.
1194  */
1195  set_rel_size(root, childrel, childRTindex, childRTE);
1196 
1197  /*
1198  * It is possible that constraint exclusion detected a contradiction
1199  * within a child subquery, even though we didn't prove one above. If
1200  * so, we can skip this child.
1201  */
1202  if (IS_DUMMY_REL(childrel))
1203  continue;
1204 
1205  /* We have at least one live child. */
1206  has_live_children = true;
1207 
1208  /*
1209  * If any live child is not parallel-safe, treat the whole appendrel
1210  * as not parallel-safe. In future we might be able to generate plans
1211  * in which some children are farmed out to workers while others are
1212  * not; but we don't have that today, so it's a waste to consider
1213  * partial paths anywhere in the appendrel unless it's all safe.
1214  * (Child rels visited before this one will be unmarked in
1215  * set_append_rel_pathlist().)
1216  */
1217  if (!childrel->consider_parallel)
1218  rel->consider_parallel = false;
1219 
1220  /*
1221  * Accumulate size information from each live child.
1222  */
1223  Assert(childrel->rows > 0);
1224 
1225  parent_rows += childrel->rows;
1226  parent_size += childrel->reltarget->width * childrel->rows;
1227 
1228  /*
1229  * Accumulate per-column estimates too. We need not do anything for
1230  * PlaceHolderVars in the parent list. If child expression isn't a
1231  * Var, or we didn't record a width estimate for it, we have to fall
1232  * back on a datatype-based estimate.
1233  *
1234  * By construction, child's targetlist is 1-to-1 with parent's.
1235  */
1236  forboth(parentvars, rel->reltarget->exprs,
1237  childvars, childrel->reltarget->exprs)
1238  {
1239  Var *parentvar = (Var *) lfirst(parentvars);
1240  Node *childvar = (Node *) lfirst(childvars);
1241 
1242  if (IsA(parentvar, Var))
1243  {
1244  int pndx = parentvar->varattno - rel->min_attr;
1245  int32 child_width = 0;
1246 
1247  if (IsA(childvar, Var) &&
1248  ((Var *) childvar)->varno == childrel->relid)
1249  {
1250  int cndx = ((Var *) childvar)->varattno - childrel->min_attr;
1251 
1252  child_width = childrel->attr_widths[cndx];
1253  }
1254  if (child_width <= 0)
1255  child_width = get_typavgwidth(exprType(childvar),
1256  exprTypmod(childvar));
1257  Assert(child_width > 0);
1258  parent_attrsizes[pndx] += child_width * childrel->rows;
1259  }
1260  }
1261  }
1262 
1263  if (has_live_children)
1264  {
1265  /*
1266  * Save the finished size estimates.
1267  */
1268  int i;
1269 
1270  Assert(parent_rows > 0);
1271  rel->rows = parent_rows;
1272  rel->reltarget->width = rint(parent_size / parent_rows);
1273  for (i = 0; i < nattrs; i++)
1274  rel->attr_widths[i] = rint(parent_attrsizes[i] / parent_rows);
1275 
1276  /*
1277  * Set "raw tuples" count equal to "rows" for the appendrel; needed
1278  * because some places assume rel->tuples is valid for any baserel.
1279  */
1280  rel->tuples = parent_rows;
1281  }
1282  else
1283  {
1284  /*
1285  * All children were excluded by constraints, so mark the whole
1286  * appendrel dummy. We must do this in this phase so that the rel's
1287  * dummy-ness is visible when we generate paths for other rels.
1288  */
1290  }
1291 
1292  pfree(parent_attrsizes);
1293 }
bool has_eclass_joins
Definition: relation.h:666
#define NIL
Definition: pg_list.h:69
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
Index security_level
Definition: relation.h:1880
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:180
RelOptKind reloptkind
Definition: relation.h:597
RestrictInfo * make_restrictinfo(Expr *clause, bool is_pushed_down, bool outerjoin_delayed, bool pseudoconstant, Index security_level, Relids required_relids, Relids outer_relids, Relids nullable_relids)
Definition: restrictinfo.c:57
Relids * attr_needed
Definition: relation.h:633
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:276
List * securityQuals
Definition: parsenodes.h:1075
double tuples
Definition: relation.h:640
List * baserestrictinfo
Definition: relation.h:660
#define Min(x, y)
Definition: c.h:857
bool relation_excluded_by_constraints(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: plancat.c:1387
Definition: nodes.h:517
AttrNumber varattno
Definition: primnodes.h:169
Node * eval_const_expressions(PlannerInfo *root, Node *node)
Definition: clauses.c:2460
Index baserestrict_min_security
Definition: relation.h:662
void add_child_rel_equivalences(PlannerInfo *root, AppendRelInfo *appinfo, RelOptInfo *parent_rel, RelOptInfo *child_rel)
Definition: equivclass.c:2108
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:958
Definition: primnodes.h:164
List * translated_vars
Definition: relation.h:2140
#define IS_SIMPLE_REL(rel)
Definition: relation.h:573
signed int int32
Definition: c.h:313
Definition: type.h:89
void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:2017
void pfree(void *pointer)
Definition: mcxt.c:1031
List * make_ands_implicit(Expr *clause)
Definition: clauses.c:379
Relids prune_append_rel_partitions(RelOptInfo *rel)
Definition: partprune.c:410
#define IS_DUMMY_REL(r)
Definition: relation.h:1305
bool parallelModeOK
Definition: relation.h:132
bool outerjoin_delayed
Definition: relation.h:1872
#define list_nth_node(type, list, n)
Definition: pg_list.h:227
static void set_rel_consider_parallel(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:537
List * joininfo
Definition: relation.h:664
void check_stack_depth(void)
Definition: postgres.c:3155
PlannerGlobal * glob
Definition: relation.h:160
#define DatumGetBool(X)
Definition: postgres.h:376
#define list_make1_int(x1)
Definition: pg_list.h:145
double rint(double x)
Definition: rint.c:22
Index relid
Definition: relation.h:628
List * lappend(List *list, void *datum)
Definition: list.c:128
RangeTblEntry ** simple_rte_array
Definition: relation.h:191
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: prepunion.c:2046
Expr * clause
Definition: relation.h:1868
List * exprs
Definition: relation.h:996
void * palloc0(Size size)
Definition: mcxt.c:955
List * append_rel_list
Definition: relation.h:255
unsigned int Index
Definition: c.h:442
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition: lsyscache.c:2332
double rows
Definition: relation.h:603
bool hasPseudoConstantQuals
Definition: relation.h:307
bool is_pushed_down
Definition: relation.h:1870
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
bool contain_vars_of_level(Node *node, int levelsup)
Definition: var.c:369
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:42
bool consider_parallel
Definition: relation.h:608
int width
Definition: relation.h:999
List * partitioned_child_rels
Definition: relation.h:680
AttrNumber max_attr
Definition: relation.h:632
int i
bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel)
Definition: pathkeys.c:1659
PartitionScheme part_scheme
Definition: relation.h:672
Index child_relid
Definition: relation.h:2113
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:279
Index parent_relid
Definition: relation.h:2112
int32 * attr_widths
Definition: relation.h:634
Definition: pg_list.h:45
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:486
struct PathTarget * reltarget
Definition: relation.h:611
int16 AttrNumber
Definition: attnum.h:21
static void set_rel_size(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:319
AttrNumber min_attr
Definition: relation.h:631

◆ set_base_rel_consider_startup()

static void set_base_rel_consider_startup ( PlannerInfo root)
static

Definition at line 206 of file allpaths.c.

References bms_get_singleton_member(), RelOptInfo::consider_param_startup, find_base_rel(), JOIN_ANTI, PlannerInfo::join_info_list, JOIN_SEMI, SpecialJoinInfo::jointype, lfirst, and SpecialJoinInfo::syn_righthand.

Referenced by make_one_rel().

207 {
208  /*
209  * Since parameterized paths can only be used on the inside of a nestloop
210  * join plan, there is usually little value in considering fast-start
211  * plans for them. However, for relations that are on the RHS of a SEMI
212  * or ANTI join, a fast-start plan can be useful because we're only going
213  * to care about fetching one tuple anyway.
214  *
215  * To minimize growth of planning time, we currently restrict this to
216  * cases where the RHS is a single base relation, not a join; there is no
217  * provision for consider_param_startup to get set at all on joinrels.
218  * Also we don't worry about appendrels. costsize.c's costing rules for
219  * nestloop semi/antijoins don't consider such cases either.
220  */
221  ListCell *lc;
222 
223  foreach(lc, root->join_info_list)
224  {
225  SpecialJoinInfo *sjinfo = (SpecialJoinInfo *) lfirst(lc);
226  int varno;
227 
228  if ((sjinfo->jointype == JOIN_SEMI || sjinfo->jointype == JOIN_ANTI) &&
229  bms_get_singleton_member(sjinfo->syn_righthand, &varno))
230  {
231  RelOptInfo *rel = find_base_rel(root, varno);
232 
233  rel->consider_param_startup = true;
234  }
235  }
236 }
List * join_info_list
Definition: relation.h:253
bool consider_param_startup
Definition: relation.h:607
bool bms_get_singleton_member(const Bitmapset *a, int *member)
Definition: bitmapset.c:635
Relids syn_righthand
Definition: relation.h:2057
#define lfirst(lc)
Definition: pg_list.h:106
JoinType jointype
Definition: relation.h:2058
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:279

◆ set_base_rel_pathlists()

static void set_base_rel_pathlists ( PlannerInfo root)
static

Definition at line 292 of file allpaths.c.

References Assert, RelOptInfo::relid, RELOPT_BASEREL, RelOptInfo::reloptkind, set_rel_pathlist(), PlannerInfo::simple_rel_array, PlannerInfo::simple_rel_array_size, and PlannerInfo::simple_rte_array.

Referenced by make_one_rel().

293 {
294  Index rti;
295 
296  for (rti = 1; rti < root->simple_rel_array_size; rti++)
297  {
298  RelOptInfo *rel = root->simple_rel_array[rti];
299 
300  /* there may be empty slots corresponding to non-baserel RTEs */
301  if (rel == NULL)
302  continue;
303 
304  Assert(rel->relid == rti); /* sanity check on array */
305 
306  /* ignore RTEs that are "other rels" */
307  if (rel->reloptkind != RELOPT_BASEREL)
308  continue;
309 
310  set_rel_pathlist(root, rel, rti, root->simple_rte_array[rti]);
311  }
312 }
RelOptKind reloptkind
Definition: relation.h:597
struct RelOptInfo ** simple_rel_array
Definition: relation.h:182
int simple_rel_array_size
Definition: relation.h:183
Index relid
Definition: relation.h:628
RangeTblEntry ** simple_rte_array
Definition: relation.h:191
unsigned int Index
Definition: c.h:442
static void set_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:422
#define Assert(condition)
Definition: c.h:699

◆ set_base_rel_sizes()

static void set_base_rel_sizes ( PlannerInfo root)
static

Definition at line 249 of file allpaths.c.

References Assert, PlannerInfo::glob, PlannerGlobal::parallelModeOK, RelOptInfo::relid, RELOPT_BASEREL, RelOptInfo::reloptkind, set_rel_consider_parallel(), set_rel_size(), PlannerInfo::simple_rel_array, PlannerInfo::simple_rel_array_size, and PlannerInfo::simple_rte_array.

Referenced by make_one_rel().

250 {
251  Index rti;
252 
253  for (rti = 1; rti < root->simple_rel_array_size; rti++)
254  {
255  RelOptInfo *rel = root->simple_rel_array[rti];
256  RangeTblEntry *rte;
257 
258  /* there may be empty slots corresponding to non-baserel RTEs */
259  if (rel == NULL)
260  continue;
261 
262  Assert(rel->relid == rti); /* sanity check on array */
263 
264  /* ignore RTEs that are "other rels" */
265  if (rel->reloptkind != RELOPT_BASEREL)
266  continue;
267 
268  rte = root->simple_rte_array[rti];
269 
270  /*
271  * If parallelism is allowable for this query in general, see whether
272  * it's allowable for this rel in particular. We have to do this
273  * before set_rel_size(), because (a) if this rel is an inheritance
274  * parent, set_append_rel_size() will use and perhaps change the rel's
275  * consider_parallel flag, and (b) for some RTE types, set_rel_size()
276  * goes ahead and makes paths immediately.
277  */
278  if (root->glob->parallelModeOK)
279  set_rel_consider_parallel(root, rel, rte);
280 
281  set_rel_size(root, rel, rti, rte);
282  }
283 }
RelOptKind reloptkind
Definition: relation.h:597
struct RelOptInfo ** simple_rel_array
Definition: relation.h:182
bool parallelModeOK
Definition: relation.h:132
static void set_rel_consider_parallel(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:537
PlannerGlobal * glob
Definition: relation.h:160
int simple_rel_array_size
Definition: relation.h:183
Index relid
Definition: relation.h:628
RangeTblEntry ** simple_rte_array
Definition: relation.h:191
unsigned int Index
Definition: c.h:442
#define Assert(condition)
Definition: c.h:699
static void set_rel_size(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:319

◆ set_cte_pathlist()

static void set_cte_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 2385 of file allpaths.c.

References add_path(), Assert, create_ctescan_path(), PlannerInfo::cte_plan_ids, RangeTblEntry::ctelevelsup, Query::cteList, RangeTblEntry::ctename, CommonTableExpr::ctename, elog, ERROR, PlannerInfo::glob, RelOptInfo::lateral_relids, lfirst, list_length(), list_nth(), list_nth_int(), PlannerInfo::parent_root, PlannerInfo::parse, Plan::plan_rows, set_cte_size_estimates(), and PlannerGlobal::subplans.

Referenced by set_rel_size().

2386 {
2387  Plan *cteplan;
2388  PlannerInfo *cteroot;
2389  Index levelsup;
2390  int ndx;
2391  ListCell *lc;
2392  int plan_id;
2393  Relids required_outer;
2394 
2395  /*
2396  * Find the referenced CTE, and locate the plan previously made for it.
2397  */
2398  levelsup = rte->ctelevelsup;
2399  cteroot = root;
2400  while (levelsup-- > 0)
2401  {
2402  cteroot = cteroot->parent_root;
2403  if (!cteroot) /* shouldn't happen */
2404  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
2405  }
2406 
2407  /*
2408  * Note: cte_plan_ids can be shorter than cteList, if we are still working
2409  * on planning the CTEs (ie, this is a side-reference from another CTE).
2410  * So we mustn't use forboth here.
2411  */
2412  ndx = 0;
2413  foreach(lc, cteroot->parse->cteList)
2414  {
2415  CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
2416 
2417  if (strcmp(cte->ctename, rte->ctename) == 0)
2418  break;
2419  ndx++;
2420  }
2421  if (lc == NULL) /* shouldn't happen */
2422  elog(ERROR, "could not find CTE \"%s\"", rte->ctename);
2423  if (ndx >= list_length(cteroot->cte_plan_ids))
2424  elog(ERROR, "could not find plan for CTE \"%s\"", rte->ctename);
2425  plan_id = list_nth_int(cteroot->cte_plan_ids, ndx);
2426  Assert(plan_id > 0);
2427  cteplan = (Plan *) list_nth(root->glob->subplans, plan_id - 1);
2428 
2429  /* Mark rel with estimated output rows, width, etc */
2430  set_cte_size_estimates(root, rel, cteplan->plan_rows);
2431 
2432  /*
2433  * We don't support pushing join clauses into the quals of a CTE scan, but
2434  * it could still have required parameterization due to LATERAL refs in
2435  * its tlist.
2436  */
2437  required_outer = rel->lateral_relids;
2438 
2439  /* Generate appropriate path */
2440  add_path(rel, create_ctescan_path(root, rel, required_outer));
2441 }
double plan_rows
Definition: plannodes.h:133
Query * parse
Definition: relation.h:158
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
void set_cte_size_estimates(PlannerInfo *root, RelOptInfo *rel, double cte_rows)
Definition: costsize.c:4981
Relids lateral_relids
Definition: relation.h:625
#define ERROR
Definition: elog.h:43
void * list_nth(const List *list, int n)
Definition: list.c:410
List * subplans
Definition: relation.h:101
PlannerGlobal * glob
Definition: relation.h:160
struct PlannerInfo * parent_root
Definition: relation.h:164
int list_nth_int(const List *list, int n)
Definition: list.c:421
List * cte_plan_ids
Definition: relation.h:233
unsigned int Index
Definition: c.h:442
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
static int list_length(const List *l)
Definition: pg_list.h:89
Index ctelevelsup
Definition: parsenodes.h:1033
List * cteList
Definition: parsenodes.h:135
char * ctename
Definition: parsenodes.h:1032
#define elog
Definition: elog.h:219
Path * create_ctescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1971

◆ set_dummy_rel_pathlist()

void set_dummy_rel_pathlist ( RelOptInfo rel)

Definition at line 2017 of file allpaths.c.

References add_path(), create_append_path(), NIL, RelOptInfo::partial_pathlist, RelOptInfo::pathlist, RelOptInfo::reltarget, RelOptInfo::rows, set_cheapest(), and PathTarget::width.

Referenced by inheritance_planner(), set_append_rel_size(), set_rel_size(), and set_subquery_pathlist().

2018 {
2019  /* Set dummy size estimates --- we leave attr_widths[] as zeroes */
2020  rel->rows = 0;
2021  rel->reltarget->width = 0;
2022 
2023  /* Discard any pre-existing paths; no further need for them */
2024  rel->pathlist = NIL;
2025  rel->partial_pathlist = NIL;
2026 
2027  add_path(rel, (Path *) create_append_path(NULL, rel, NIL, NIL, NULL,
2028  0, false, NIL, -1));
2029 
2030  /*
2031  * We set the cheapest path immediately, to ensure that IS_DUMMY_REL()
2032  * will recognize the relation as dummy if anyone asks. This is redundant
2033  * when we're called from set_rel_size(), but not when called from
2034  * elsewhere, and doing it twice is harmless anyway.
2035  */
2036  set_cheapest(rel);
2037 }
#define NIL
Definition: pg_list.h:69
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, Relids required_outer, int parallel_workers, bool parallel_aware, List *partitioned_rels, double rows)
Definition: pathnode.c:1213
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
List * partial_pathlist
Definition: relation.h:616
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
double rows
Definition: relation.h:603
int width
Definition: relation.h:999
List * pathlist
Definition: relation.h:614
struct PathTarget * reltarget
Definition: relation.h:611

◆ set_foreign_pathlist()

static void set_foreign_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 850 of file allpaths.c.

References RelOptInfo::fdwroutine, FdwRoutine::GetForeignPaths, and RangeTblEntry::relid.

Referenced by set_rel_pathlist().

851 {
852  /* Call the FDW's GetForeignPaths function to generate path(s) */
853  rel->fdwroutine->GetForeignPaths(root, rel, rte->relid);
854 }
struct FdwRoutine * fdwroutine
Definition: relation.h:651
GetForeignPaths_function GetForeignPaths
Definition: fdwapi.h:188

◆ set_foreign_size()

static void set_foreign_size ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 833 of file allpaths.c.

References clamp_row_est(), RelOptInfo::fdwroutine, FdwRoutine::GetForeignRelSize, RangeTblEntry::relid, RelOptInfo::rows, and set_foreign_size_estimates().

Referenced by set_rel_size().

834 {
835  /* Mark rel with estimated output rows, width, etc */
836  set_foreign_size_estimates(root, rel);
837 
838  /* Let FDW adjust the size estimates, if it can */
839  rel->fdwroutine->GetForeignRelSize(root, rel, rte->relid);
840 
841  /* ... but do not let it set the rows estimate to zero */
842  rel->rows = clamp_row_est(rel->rows);
843 }
struct FdwRoutine * fdwroutine
Definition: relation.h:651
GetForeignRelSize_function GetForeignRelSize
Definition: fdwapi.h:187
double rows
Definition: relation.h:603
void set_foreign_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5057
double clamp_row_est(double nrows)
Definition: costsize.c:187

◆ set_function_pathlist()

static void set_function_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 2273 of file allpaths.c.

References add_path(), build_expression_pathkey(), create_functionscan_path(), PathTarget::exprs, RangeTblEntry::funcordinality, IsA, RelOptInfo::lateral_relids, lfirst, RelOptInfo::max_attr, NIL, RelOptInfo::relid, RelOptInfo::relids, RelOptInfo::reltarget, Var::varattno, Var::varlevelsup, and Var::varno.

Referenced by set_rel_pathlist().

2274 {
2275  Relids required_outer;
2276  List *pathkeys = NIL;
2277 
2278  /*
2279  * We don't support pushing join clauses into the quals of a function
2280  * scan, but it could still have required parameterization due to LATERAL
2281  * refs in the function expression.
2282  */
2283  required_outer = rel->lateral_relids;
2284 
2285  /*
2286  * The result is considered unordered unless ORDINALITY was used, in which
2287  * case it is ordered by the ordinal column (the last one). See if we
2288  * care, by checking for uses of that Var in equivalence classes.
2289  */
2290  if (rte->funcordinality)
2291  {
2292  AttrNumber ordattno = rel->max_attr;
2293  Var *var = NULL;
2294  ListCell *lc;
2295 
2296  /*
2297  * Is there a Var for it in rel's targetlist? If not, the query did
2298  * not reference the ordinality column, or at least not in any way
2299  * that would be interesting for sorting.
2300  */
2301  foreach(lc, rel->reltarget->exprs)
2302  {
2303  Var *node = (Var *) lfirst(lc);
2304 
2305  /* checking varno/varlevelsup is just paranoia */
2306  if (IsA(node, Var) &&
2307  node->varattno == ordattno &&
2308  node->varno == rel->relid &&
2309  node->varlevelsup == 0)
2310  {
2311  var = node;
2312  break;
2313  }
2314  }
2315 
2316  /*
2317  * Try to build pathkeys for this Var with int8 sorting. We tell
2318  * build_expression_pathkey not to build any new equivalence class; if
2319  * the Var isn't already mentioned in some EC, it means that nothing
2320  * cares about the ordering.
2321  */
2322  if (var)
2323  pathkeys = build_expression_pathkey(root,
2324  (Expr *) var,
2325  NULL, /* below outer joins */
2326  Int8LessOperator,
2327  rel->relids,
2328  false);
2329  }
2330 
2331  /* Generate appropriate path */
2332  add_path(rel, create_functionscan_path(root, rel,
2333  pathkeys, required_outer));
2334 }
#define NIL
Definition: pg_list.h:69
#define IsA(nodeptr, _type_)
Definition: nodes.h:568
List * build_expression_pathkey(PlannerInfo *root, Expr *expr, Relids nullable_relids, Oid opno, Relids rel, bool create_it)
Definition: pathkeys.c:562
Index varlevelsup
Definition: primnodes.h:174
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
AttrNumber varattno
Definition: primnodes.h:169
bool funcordinality
Definition: parsenodes.h:1017
Definition: primnodes.h:164
Path * create_functionscan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1893
Relids lateral_relids
Definition: relation.h:625
Relids relids
Definition: relation.h:600
Index relid
Definition: relation.h:628
Index varno
Definition: primnodes.h:167
List * exprs
Definition: relation.h:996
#define lfirst(lc)
Definition: pg_list.h:106
AttrNumber max_attr
Definition: relation.h:632
Definition: pg_list.h:45
struct PathTarget * reltarget
Definition: relation.h:611
int16 AttrNumber
Definition: attnum.h:21

◆ set_namedtuplestore_pathlist()

static void set_namedtuplestore_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 2451 of file allpaths.c.

References add_path(), create_namedtuplestorescan_path(), RelOptInfo::lateral_relids, set_cheapest(), and set_namedtuplestore_size_estimates().

Referenced by set_rel_size().

2453 {
2454  Relids required_outer;
2455 
2456  /* Mark rel with estimated output rows, width, etc */
2458 
2459  /*
2460  * We don't support pushing join clauses into the quals of a tuplestore
2461  * scan, but it could still have required parameterization due to LATERAL
2462  * refs in its tlist.
2463  */
2464  required_outer = rel->lateral_relids;
2465 
2466  /* Generate appropriate path */
2467  add_path(rel, create_namedtuplestorescan_path(root, rel, required_outer));
2468 
2469  /* Select cheapest path (pretty easy in this case...) */
2470  set_cheapest(rel);
2471 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
Relids lateral_relids
Definition: relation.h:625
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
void set_namedtuplestore_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5018
Path * create_namedtuplestorescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1996

◆ set_plain_rel_pathlist()

static void set_plain_rel_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 695 of file allpaths.c.

References add_path(), RelOptInfo::consider_parallel, create_index_paths(), create_plain_partial_paths(), create_seqscan_path(), create_tidscan_paths(), and RelOptInfo::lateral_relids.

Referenced by set_rel_pathlist().

696 {
697  Relids required_outer;
698 
699  /*
700  * We don't support pushing join clauses into the quals of a seqscan, but
701  * it could still have required parameterization due to LATERAL refs in
702  * its tlist.
703  */
704  required_outer = rel->lateral_relids;
705 
706  /* Consider sequential scan */
707  add_path(rel, create_seqscan_path(root, rel, required_outer, 0));
708 
709  /* If appropriate, consider parallel sequential scan */
710  if (rel->consider_parallel && required_outer == NULL)
711  create_plain_partial_paths(root, rel);
712 
713  /* Consider index scans */
714  create_index_paths(root, rel);
715 
716  /* Consider TID scans */
717  create_tidscan_paths(root, rel);
718 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
void create_index_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:230
Relids lateral_relids
Definition: relation.h:625
void create_tidscan_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: tidpath.c:253
bool consider_parallel
Definition: relation.h:608
static void create_plain_partial_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:725
Path * create_seqscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer, int parallel_workers)
Definition: pathnode.c:948

◆ set_plain_rel_size()

static void set_plain_rel_size ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 520 of file allpaths.c.

References check_index_predicates(), and set_baserel_size_estimates().

Referenced by set_rel_size().

521 {
522  /*
523  * Test any partial indexes of rel for applicability. We must do this
524  * first since partial unique indexes can affect size estimates.
525  */
526  check_index_predicates(root, rel);
527 
528  /* Mark rel with estimated output rows, width, etc */
529  set_baserel_size_estimates(root, rel);
530 }
void check_index_predicates(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:2794
void set_baserel_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4294

◆ set_rel_consider_parallel()

static void set_rel_consider_parallel ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 537 of file allpaths.c.

References TableSampleClause::args, Assert, RelOptInfo::baserestrictinfo, RelOptInfo::consider_parallel, PathTarget::exprs, RelOptInfo::fdwroutine, func_parallel(), RangeTblEntry::functions, get_rel_persistence(), PlannerInfo::glob, is_parallel_safe(), IS_SIMPLE_REL, FdwRoutine::IsForeignScanParallelSafe, PlannerGlobal::parallelModeOK, RangeTblEntry::relid, RangeTblEntry::relkind, RelOptInfo::reltarget, RTE_CTE, RTE_FUNCTION, RTE_JOIN, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RangeTblEntry::rtekind, RangeTblEntry::tablesample, TableSampleClause::tsmhandler, and RangeTblEntry::values_lists.

Referenced by set_append_rel_size(), and set_base_rel_sizes().

539 {
540  /*
541  * The flag has previously been initialized to false, so we can just
542  * return if it becomes clear that we can't safely set it.
543  */
544  Assert(!rel->consider_parallel);
545 
546  /* Don't call this if parallelism is disallowed for the entire query. */
547  Assert(root->glob->parallelModeOK);
548 
549  /* This should only be called for baserels and appendrel children. */
550  Assert(IS_SIMPLE_REL(rel));
551 
552  /* Assorted checks based on rtekind. */
553  switch (rte->rtekind)
554  {
555  case RTE_RELATION:
556 
557  /*
558  * Currently, parallel workers can't access the leader's temporary
559  * tables. We could possibly relax this if the wrote all of its
560  * local buffers at the start of the query and made no changes
561  * thereafter (maybe we could allow hint bit changes), and if we
562  * taught the workers to read them. Writing a large number of
563  * temporary buffers could be expensive, though, and we don't have
564  * the rest of the necessary infrastructure right now anyway. So
565  * for now, bail out if we see a temporary table.
566  */
567  if (get_rel_persistence(rte->relid) == RELPERSISTENCE_TEMP)
568  return;
569 
570  /*
571  * Table sampling can be pushed down to workers if the sample
572  * function and its arguments are safe.
573  */
574  if (rte->tablesample != NULL)
575  {
576  char proparallel = func_parallel(rte->tablesample->tsmhandler);
577 
578  if (proparallel != PROPARALLEL_SAFE)
579  return;
580  if (!is_parallel_safe(root, (Node *) rte->tablesample->args))
581  return;
582  }
583 
584  /*
585  * Ask FDWs whether they can support performing a ForeignScan
586  * within a worker. Most often, the answer will be no. For
587  * example, if the nature of the FDW is such that it opens a TCP
588  * connection with a remote server, each parallel worker would end
589  * up with a separate connection, and these connections might not
590  * be appropriately coordinated between workers and the leader.
591  */
592  if (rte->relkind == RELKIND_FOREIGN_TABLE)
593  {
594  Assert(rel->fdwroutine);
596  return;
597  if (!rel->fdwroutine->IsForeignScanParallelSafe(root, rel, rte))
598  return;
599  }
600 
601  /*
602  * There are additional considerations for appendrels, which we'll
603  * deal with in set_append_rel_size and set_append_rel_pathlist.
604  * For now, just set consider_parallel based on the rel's own
605  * quals and targetlist.
606  */
607  break;
608 
609  case RTE_SUBQUERY:
610 
611  /*
612  * There's no intrinsic problem with scanning a subquery-in-FROM
613  * (as distinct from a SubPlan or InitPlan) in a parallel worker.
614  * If the subquery doesn't happen to have any parallel-safe paths,
615  * then flagging it as consider_parallel won't change anything,
616  * but that's true for plain tables, too. We must set
617  * consider_parallel based on the rel's own quals and targetlist,
618  * so that if a subquery path is parallel-safe but the quals and
619  * projection we're sticking onto it are not, we correctly mark
620  * the SubqueryScanPath as not parallel-safe. (Note that
621  * set_subquery_pathlist() might push some of these quals down
622  * into the subquery itself, but that doesn't change anything.)
623  */
624  break;
625 
626  case RTE_JOIN:
627  /* Shouldn't happen; we're only considering baserels here. */
628  Assert(false);
629  return;
630 
631  case RTE_FUNCTION:
632  /* Check for parallel-restricted functions. */
633  if (!is_parallel_safe(root, (Node *) rte->functions))
634  return;
635  break;
636 
637  case RTE_TABLEFUNC:
638  /* not parallel safe */
639  return;
640 
641  case RTE_VALUES:
642  /* Check for parallel-restricted functions. */
643  if (!is_parallel_safe(root, (Node *) rte->values_lists))
644  return;
645  break;
646 
647  case RTE_CTE:
648 
649  /*
650  * CTE tuplestores aren't shared among parallel workers, so we
651  * force all CTE scans to happen in the leader. Also, populating
652  * the CTE would require executing a subplan that's not available
653  * in the worker, might be parallel-restricted, and must get
654  * executed only once.
655  */
656  return;
657 
658  case RTE_NAMEDTUPLESTORE:
659 
660  /*
661  * tuplestore cannot be shared, at least without more
662  * infrastructure to support that.
663  */
664  return;
665  }
666 
667  /*
668  * If there's anything in baserestrictinfo that's parallel-restricted, we
669  * give up on parallelizing access to this relation. We could consider
670  * instead postponing application of the restricted quals until we're
671  * above all the parallelism in the plan tree, but it's not clear that
672  * that would be a win in very many cases, and it might be tricky to make
673  * outer join clauses work correctly. It would likely break equivalence
674  * classes, too.
675  */
676  if (!is_parallel_safe(root, (Node *) rel->baserestrictinfo))
677  return;
678 
679  /*
680  * Likewise, if the relation's outputs are not parallel-safe, give up.
681  * (Usually, they're just Vars, but sometimes they're not.)
682  */
683  if (!is_parallel_safe(root, (Node *) rel->reltarget->exprs))
684  return;
685 
686  /* We have a winner. */
687  rel->consider_parallel = true;
688 }
List * baserestrictinfo
Definition: relation.h:660
Definition: nodes.h:517
List * values_lists
Definition: parsenodes.h:1027
#define IS_SIMPLE_REL(rel)
Definition: relation.h:573
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:1088
IsForeignScanParallelSafe_function IsForeignScanParallelSafe
Definition: fdwapi.h:239
bool parallelModeOK
Definition: relation.h:132
PlannerGlobal * glob
Definition: relation.h:160
struct FdwRoutine * fdwroutine
Definition: relation.h:651
List * exprs
Definition: relation.h:996
#define Assert(condition)
Definition: c.h:699
List * functions
Definition: parsenodes.h:1016
char func_parallel(Oid funcid)
Definition: lsyscache.c:1588
bool consider_parallel
Definition: relation.h:608
char get_rel_persistence(Oid relid)
Definition: lsyscache.c:1856
RTEKind rtekind
Definition: parsenodes.h:962
struct PathTarget * reltarget
Definition: relation.h:611
struct TableSampleClause * tablesample
Definition: parsenodes.h:980

◆ set_rel_pathlist()

static void set_rel_pathlist ( PlannerInfo root,
RelOptInfo rel,
Index  rti,
RangeTblEntry rte 
)
static

Definition at line 422 of file allpaths.c.

References PlannerInfo::all_baserels, bms_membership(), BMS_SINGLETON, elog, ERROR, generate_gather_paths(), RangeTblEntry::inh, IS_DUMMY_REL, RangeTblEntry::relkind, RELOPT_BASEREL, RelOptInfo::reloptkind, RTE_CTE, RTE_FUNCTION, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RelOptInfo::rtekind, set_append_rel_pathlist(), set_cheapest(), set_foreign_pathlist(), set_function_pathlist(), set_plain_rel_pathlist(), set_rel_pathlist_hook, set_tablefunc_pathlist(), set_tablesample_rel_pathlist(), set_values_pathlist(), and RangeTblEntry::tablesample.

Referenced by set_append_rel_pathlist(), and set_base_rel_pathlists().

424 {
425  if (IS_DUMMY_REL(rel))
426  {
427  /* We already proved the relation empty, so nothing more to do */
428  }
429  else if (rte->inh)
430  {
431  /* It's an "append relation", process accordingly */
432  set_append_rel_pathlist(root, rel, rti, rte);
433  }
434  else
435  {
436  switch (rel->rtekind)
437  {
438  case RTE_RELATION:
439  if (rte->relkind == RELKIND_FOREIGN_TABLE)
440  {
441  /* Foreign table */
442  set_foreign_pathlist(root, rel, rte);
443  }
444  else if (rte->tablesample != NULL)
445  {
446  /* Sampled relation */
447  set_tablesample_rel_pathlist(root, rel, rte);
448  }
449  else
450  {
451  /* Plain relation */
452  set_plain_rel_pathlist(root, rel, rte);
453  }
454  break;
455  case RTE_SUBQUERY:
456  /* Subquery --- fully handled during set_rel_size */
457  break;
458  case RTE_FUNCTION:
459  /* RangeFunction */
460  set_function_pathlist(root, rel, rte);
461  break;
462  case RTE_TABLEFUNC:
463  /* Table Function */
464  set_tablefunc_pathlist(root, rel, rte);
465  break;
466  case RTE_VALUES:
467  /* Values list */
468  set_values_pathlist(root, rel, rte);
469  break;
470  case RTE_CTE:
471  /* CTE reference --- fully handled during set_rel_size */
472  break;
473  case RTE_NAMEDTUPLESTORE:
474  /* tuplestore reference --- fully handled during set_rel_size */
475  break;
476  default:
477  elog(ERROR, "unexpected rtekind: %d", (int) rel->rtekind);
478  break;
479  }
480  }
481 
482  /*
483  * If this is a baserel, we should normally consider gathering any partial
484  * paths we may have created for it.
485  *
486  * However, if this is an inheritance child, skip it. Otherwise, we could
487  * end up with a very large number of gather nodes, each trying to grab
488  * its own pool of workers. Instead, we'll consider gathering partial
489  * paths for the parent appendrel.
490  *
491  * Also, if this is the topmost scan/join rel (that is, the only baserel),
492  * we postpone this until the final scan/join targelist is available (see
493  * grouping_planner).
494  */
495  if (rel->reloptkind == RELOPT_BASEREL &&
497  generate_gather_paths(root, rel, false);
498 
499  /*
500  * Allow a plugin to editorialize on the set of Paths for this base
501  * relation. It could add new paths (such as CustomPaths) by calling
502  * add_path(), or delete or modify paths added by the core code.
503  */
505  (*set_rel_pathlist_hook) (root, rel, rti, rte);
506 
507  /* Now find the cheapest of the paths for this rel */
508  set_cheapest(rel);
509 
510 #ifdef OPTIMIZER_DEBUG
511  debug_print_rel(root, rel);
512 #endif
513 }
RelOptKind reloptkind
Definition: relation.h:597
set_rel_pathlist_hook_type set_rel_pathlist_hook
Definition: allpaths.c:66
void generate_gather_paths(PlannerInfo *root, RelOptInfo *rel, bool override_rows)
Definition: allpaths.c:2540
Relids all_baserels
Definition: relation.h:199
#define ERROR
Definition: elog.h:43
#define IS_DUMMY_REL(r)
Definition: relation.h:1305
static void set_append_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:1300
static void set_foreign_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:850
static void set_plain_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:695
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
BMS_Membership bms_membership(const Bitmapset *a)
Definition: bitmapset.c:700
RTEKind rtekind
Definition: relation.h:630
static void set_tablesample_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:785
static void set_tablefunc_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2361
#define elog
Definition: elog.h:219
static void set_function_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2273
static void set_values_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2341
struct TableSampleClause * tablesample
Definition: parsenodes.h:980

◆ set_rel_size()

static void set_rel_size ( PlannerInfo root,
RelOptInfo rel,
Index  rti,
RangeTblEntry rte 
)
static

Definition at line 319 of file allpaths.c.

References Assert, elog, ERROR, RangeTblEntry::inh, IS_DUMMY_REL, relation_excluded_by_constraints(), RangeTblEntry::relkind, RELOPT_BASEREL, RelOptInfo::reloptkind, RelOptInfo::rows, RTE_CTE, RTE_FUNCTION, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RelOptInfo::rtekind, RangeTblEntry::self_reference, set_append_rel_size(), set_cte_pathlist(), set_dummy_rel_pathlist(), set_foreign_size(), set_function_size_estimates(), set_namedtuplestore_pathlist(), set_plain_rel_size(), set_subquery_pathlist(), set_tablefunc_size_estimates(), set_tablesample_rel_size(), set_values_size_estimates(), set_worktable_pathlist(), and RangeTblEntry::tablesample.

Referenced by set_append_rel_size(), and set_base_rel_sizes().

321 {
322  if (rel->reloptkind == RELOPT_BASEREL &&
323  relation_excluded_by_constraints(root, rel, rte))
324  {
325  /*
326  * We proved we don't need to scan the rel via constraint exclusion,
327  * so set up a single dummy path for it. Here we only check this for
328  * regular baserels; if it's an otherrel, CE was already checked in
329  * set_append_rel_size().
330  *
331  * In this case, we go ahead and set up the relation's path right away
332  * instead of leaving it for set_rel_pathlist to do. This is because
333  * we don't have a convention for marking a rel as dummy except by
334  * assigning a dummy path to it.
335  */
337  }
338  else if (rte->inh)
339  {
340  /* It's an "append relation", process accordingly */
341  set_append_rel_size(root, rel, rti, rte);
342  }
343  else
344  {
345  switch (rel->rtekind)
346  {
347  case RTE_RELATION:
348  if (rte->relkind == RELKIND_FOREIGN_TABLE)
349  {
350  /* Foreign table */
351  set_foreign_size(root, rel, rte);
352  }
353  else if (rte->relkind == RELKIND_PARTITIONED_TABLE)
354  {
355  /*
356  * A partitioned table without any partitions is marked as
357  * a dummy rel.
358  */
360  }
361  else if (rte->tablesample != NULL)
362  {
363  /* Sampled relation */
364  set_tablesample_rel_size(root, rel, rte);
365  }
366  else
367  {
368  /* Plain relation */
369  set_plain_rel_size(root, rel, rte);
370  }
371  break;
372  case RTE_SUBQUERY:
373 
374  /*
375  * Subqueries don't support making a choice between
376  * parameterized and unparameterized paths, so just go ahead
377  * and build their paths immediately.
378  */
379  set_subquery_pathlist(root, rel, rti, rte);
380  break;
381  case RTE_FUNCTION:
382  set_function_size_estimates(root, rel);
383  break;
384  case RTE_TABLEFUNC:
385  set_tablefunc_size_estimates(root, rel);
386  break;
387  case RTE_VALUES:
388  set_values_size_estimates(root, rel);
389  break;
390  case RTE_CTE:
391 
392  /*
393  * CTEs don't support making a choice between parameterized
394  * and unparameterized paths, so just go ahead and build their
395  * paths immediately.
396  */
397  if (rte->self_reference)
398  set_worktable_pathlist(root, rel, rte);
399  else
400  set_cte_pathlist(root, rel, rte);
401  break;
402  case RTE_NAMEDTUPLESTORE:
403  set_namedtuplestore_pathlist(root, rel, rte);
404  break;
405  default:
406  elog(ERROR, "unexpected rtekind: %d", (int) rel->rtekind);
407  break;
408  }
409  }
410 
411  /*
412  * We insist that all non-dummy rels have a nonzero rowcount estimate.
413  */
414  Assert(rel->rows > 0 || IS_DUMMY_REL(rel));
415 }
RelOptKind reloptkind
Definition: relation.h:597
static void set_cte_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2385
static void set_foreign_size(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:833
bool relation_excluded_by_constraints(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: plancat.c:1387
static void set_namedtuplestore_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2451
static void set_append_rel_size(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:868
void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:2017
#define ERROR
Definition: elog.h:43
#define IS_DUMMY_REL(r)
Definition: relation.h:1305
static void set_subquery_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:2074
static void set_tablesample_rel_size(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:745
bool self_reference
Definition: parsenodes.h:1034
RTEKind rtekind
Definition: relation.h:630
double rows
Definition: relation.h:603
#define Assert(condition)
Definition: c.h:699
void set_values_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4949
static void set_plain_rel_size(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:520
void set_tablefunc_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4927
void set_function_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4889
#define elog
Definition: elog.h:219
struct TableSampleClause * tablesample
Definition: parsenodes.h:980
static void set_worktable_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2481

◆ set_subquery_pathlist()

static void set_subquery_pathlist ( PlannerInfo root,
RelOptInfo rel,
Index  rti,
RangeTblEntry rte 
)
static

Definition at line 2074 of file allpaths.c.

References add_partial_path(), add_path(), Assert, RelOptInfo::baserestrictinfo, RestrictInfo::clause, RelOptInfo::consider_parallel, convert_subquery_pathkeys(), copyObject, create_subqueryscan_path(), Query::distinctClause, fetch_upper_rel(), PlannerInfo::glob, Query::groupClause, Query::groupingSets, has_multiple_baserels(), Query::hasAggs, Query::havingQual, IS_DUMMY_REL, lappend(), RelOptInfo::lateral_relids, lfirst, list_length(), make_tlist_from_pathtarget(), NIL, palloc0(), parse(), PlannerInfo::parse, RelOptInfo::partial_pathlist, Path::pathkeys, RelOptInfo::pathlist, Path::pathtarget, pfree(), PlannerInfo::plan_params, RestrictInfo::pseudoconstant, qual_is_pushdown_safe(), remove_unused_subquery_outputs(), RangeTblEntry::security_barrier, set_dummy_rel_pathlist(), set_subquery_size_estimates(), Query::sortClause, subpath(), RelOptInfo::subplan_params, RangeTblEntry::subquery, subquery_is_pushdown_safe(), subquery_planner(), subquery_push_qual(), RelOptInfo::subroot, Query::targetList, PlannerInfo::tuple_fraction, pushdown_safety_info::unsafeColumns, pushdown_safety_info::unsafeLeaky, and UPPERREL_FINAL.

Referenced by set_rel_size().

2076 {
2077  Query *parse = root->parse;
2078  Query *subquery = rte->subquery;
2079  Relids required_outer;
2080  pushdown_safety_info safetyInfo;
2081  double tuple_fraction;
2082  RelOptInfo *sub_final_rel;
2083  ListCell *lc;
2084 
2085  /*
2086  * Must copy the Query so that planning doesn't mess up the RTE contents
2087  * (really really need to fix the planner to not scribble on its input,
2088  * someday ... but see remove_unused_subquery_outputs to start with).
2089  */
2090  subquery = copyObject(subquery);
2091 
2092  /*
2093  * If it's a LATERAL subquery, it might contain some Vars of the current
2094  * query level, requiring it to be treated as parameterized, even though
2095  * we don't support pushing down join quals into subqueries.
2096  */
2097  required_outer = rel->lateral_relids;
2098 
2099  /*
2100  * Zero out result area for subquery_is_pushdown_safe, so that it can set
2101  * flags as needed while recursing. In particular, we need a workspace
2102  * for keeping track of unsafe-to-reference columns. unsafeColumns[i]
2103  * will be set true if we find that output column i of the subquery is
2104  * unsafe to use in a pushed-down qual.
2105  */
2106  memset(&safetyInfo, 0, sizeof(safetyInfo));
2107  safetyInfo.unsafeColumns = (bool *)
2108  palloc0((list_length(subquery->targetList) + 1) * sizeof(bool));
2109 
2110  /*
2111  * If the subquery has the "security_barrier" flag, it means the subquery
2112  * originated from a view that must enforce row level security. Then we
2113  * must not push down quals that contain leaky functions. (Ideally this
2114  * would be checked inside subquery_is_pushdown_safe, but since we don't
2115  * currently pass the RTE to that function, we must do it here.)
2116  */
2117  safetyInfo.unsafeLeaky = rte->security_barrier;
2118 
2119  /*
2120  * If there are any restriction clauses that have been attached to the
2121  * subquery relation, consider pushing them down to become WHERE or HAVING
2122  * quals of the subquery itself. This transformation is useful because it
2123  * may allow us to generate a better plan for the subquery than evaluating
2124  * all the subquery output rows and then filtering them.
2125  *
2126  * There are several cases where we cannot push down clauses. Restrictions
2127  * involving the subquery are checked by subquery_is_pushdown_safe().
2128  * Restrictions on individual clauses are checked by
2129  * qual_is_pushdown_safe(). Also, we don't want to push down
2130  * pseudoconstant clauses; better to have the gating node above the
2131  * subquery.
2132  *
2133  * Non-pushed-down clauses will get evaluated as qpquals of the
2134  * SubqueryScan node.
2135  *
2136  * XXX Are there any cases where we want to make a policy decision not to
2137  * push down a pushable qual, because it'd result in a worse plan?
2138  */
2139  if (rel->baserestrictinfo != NIL &&
2140  subquery_is_pushdown_safe(subquery, subquery, &safetyInfo))
2141  {
2142  /* OK to consider pushing down individual quals */
2143  List *upperrestrictlist = NIL;
2144  ListCell *l;
2145 
2146  foreach(l, rel->baserestrictinfo)
2147  {
2148  RestrictInfo *rinfo = (RestrictInfo *) lfirst(l);
2149  Node *clause = (Node *) rinfo->clause;
2150 
2151  if (!rinfo->pseudoconstant &&
2152  qual_is_pushdown_safe(subquery, rti, clause, &safetyInfo))
2153  {
2154  /* Push it down */
2155  subquery_push_qual(subquery, rte, rti, clause);
2156  }
2157  else
2158  {
2159  /* Keep it in the upper query */
2160  upperrestrictlist = lappend(upperrestrictlist, rinfo);
2161  }
2162  }
2163  rel->baserestrictinfo = upperrestrictlist;
2164  /* We don't bother recomputing baserestrict_min_security */
2165  }
2166 
2167  pfree(safetyInfo.unsafeColumns);
2168 
2169  /*
2170  * The upper query might not use all the subquery's output columns; if
2171  * not, we can simplify.
2172  */
2173  remove_unused_subquery_outputs(subquery, rel);
2174 
2175  /*
2176  * We can safely pass the outer tuple_fraction down to the subquery if the
2177  * outer level has no joining, aggregation, or sorting to do. Otherwise
2178  * we'd better tell the subquery to plan for full retrieval. (XXX This
2179  * could probably be made more intelligent ...)
2180  */
2181  if (parse->hasAggs ||
2182  parse->groupClause ||
2183  parse->groupingSets ||
2184  parse->havingQual ||
2185  parse->distinctClause ||
2186  parse->sortClause ||
2187  has_multiple_baserels(root))
2188  tuple_fraction = 0.0; /* default case */
2189  else
2190  tuple_fraction = root->tuple_fraction;
2191 
2192  /* plan_params should not be in use in current query level */
2193  Assert(root->plan_params == NIL);
2194 
2195  /* Generate a subroot and Paths for the subquery */
2196  rel->subroot = subquery_planner(root->glob, subquery,
2197  root,
2198  false, tuple_fraction);
2199 
2200  /* Isolate the params needed by this specific subplan */
2201  rel->subplan_params = root->plan_params;
2202  root->plan_params = NIL;
2203 
2204  /*
2205  * It's possible that constraint exclusion proved the subquery empty. If
2206  * so, it's desirable to produce an unadorned dummy path so that we will
2207  * recognize appropriate optimizations at this query level.
2208  */
2209  sub_final_rel = fetch_upper_rel(rel->subroot, UPPERREL_FINAL, NULL);
2210 
2211  if (IS_DUMMY_REL(sub_final_rel))
2212  {
2214  return;
2215  }
2216 
2217  /*
2218  * Mark rel with estimated output rows, width, etc. Note that we have to
2219  * do this before generating outer-query paths, else cost_subqueryscan is
2220  * not happy.
2221  */
2222  set_subquery_size_estimates(root, rel);
2223 
2224  /*
2225  * For each Path that subquery_planner produced, make a SubqueryScanPath
2226  * in the outer query.
2227  */
2228  foreach(lc, sub_final_rel->pathlist)
2229  {
2230  Path *subpath = (Path *) lfirst(lc);
2231  List *pathkeys;
2232 
2233  /* Convert subpath's pathkeys to outer representation */
2234  pathkeys = convert_subquery_pathkeys(root,
2235  rel,
2236  subpath->pathkeys,
2238 
2239  /* Generate outer path using this subpath */
2240  add_path(rel, (Path *)
2241  create_subqueryscan_path(root, rel, subpath,
2242  pathkeys, required_outer));
2243  }
2244 
2245  /* If consider_parallel is false, there should be no partial paths. */
2246  Assert(sub_final_rel->consider_parallel ||
2247  sub_final_rel->partial_pathlist == NIL);
2248 
2249  /* Same for partial paths. */
2250  foreach(lc, sub_final_rel->partial_pathlist)
2251  {
2252  Path *subpath = (Path *) lfirst(lc);
2253  List *pathkeys;
2254 
2255  /* Convert subpath's pathkeys to outer representation */
2256  pathkeys = convert_subquery_pathkeys(root,
2257  rel,
2258  subpath->pathkeys,
2260 
2261  /* Generate outer path using this subpath */
2262  add_partial_path(rel, (Path *)
2263  create_subqueryscan_path(root, rel, subpath,
2264  pathkeys, required_outer));
2265  }
2266 }
void set_subquery_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4809
#define NIL
Definition: pg_list.h:69
PathTarget * pathtarget
Definition: relation.h:1067
Query * parse
Definition: relation.h:158
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
SubqueryScanPath * create_subqueryscan_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1865
List * plan_params
Definition: relation.h:172
List * sortClause
Definition: parsenodes.h:158
List * baserestrictinfo
Definition: relation.h:660
bool hasAggs
Definition: parsenodes.h:125
bool pseudoconstant
Definition: relation.h:1876
List * groupingSets
Definition: parsenodes.h:150
Definition: nodes.h:517
List * partial_pathlist
Definition: relation.h:616
List * make_tlist_from_pathtarget(PathTarget *target)
Definition: tlist.c:595
bool * unsafeColumns
Definition: allpaths.c:54
char bool
Definition: c.h:275
List * targetList
Definition: parsenodes.h:140
PlannerInfo * subroot
Definition: relation.h:642
Relids lateral_relids
Definition: relation.h:625
double tuple_fraction
Definition: relation.h:295
void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:2017
void pfree(void *pointer)
Definition: mcxt.c:1031
List * distinctClause
Definition: parsenodes.h:156
#define IS_DUMMY_REL(r)
Definition: relation.h:1305
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1145
List * convert_subquery_pathkeys(PlannerInfo *root, RelOptInfo *rel, List *subquery_pathkeys, List *subquery_tlist)
Definition: pathkeys.c:616
PlannerGlobal * glob
Definition: relation.h:160
static void remove_unused_subquery_outputs(Query *subquery, RelOptInfo *rel)
Definition: allpaths.c:3293
List * lappend(List *list, void *datum)
Definition: list.c:128
Expr * clause
Definition: relation.h:1868
static bool qual_is_pushdown_safe(Query *subquery, Index rti, Node *qual, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3122
void * palloc0(Size size)
Definition: mcxt.c:955
bool security_barrier
Definition: parsenodes.h:986
List * pathkeys
Definition: relation.h:1080
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
static bool has_multiple_baserels(PlannerInfo *root)
Definition: allpaths.c:2041
static void subquery_push_qual(Query *subquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3199
static int list_length(const List *l)
Definition: pg_list.h:89
bool consider_parallel
Definition: relation.h:608
static bool subquery_is_pushdown_safe(Query *subquery, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:2860
Query * subquery
Definition: parsenodes.h:985
List * groupClause
Definition: parsenodes.h:148
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:762
List * pathlist
Definition: relation.h:614
#define copyObject(obj)
Definition: nodes.h:630
Node * havingQual
Definition: parsenodes.h:152
Definition: pg_list.h:45
List * subplan_params
Definition: relation.h:643
PlannerInfo * subquery_planner(PlannerGlobal *glob, Query *parse, PlannerInfo *parent_root, bool hasRecursion, double tuple_fraction)
Definition: planner.c:594
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:234
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:649

◆ set_tablefunc_pathlist()

static void set_tablefunc_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 2361 of file allpaths.c.

References add_path(), create_tablefuncscan_path(), and RelOptInfo::lateral_relids.

Referenced by set_rel_pathlist().

2362 {
2363  Relids required_outer;
2364 
2365  /*
2366  * We don't support pushing join clauses into the quals of a tablefunc
2367  * scan, but it could still have required parameterization due to LATERAL
2368  * refs in the function expression.
2369  */
2370  required_outer = rel->lateral_relids;
2371 
2372  /* Generate appropriate path */
2373  add_path(rel, create_tablefuncscan_path(root, rel,
2374  required_outer));
2375 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
Relids lateral_relids
Definition: relation.h:625
Path * create_tablefuncscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1919

◆ set_tablesample_rel_pathlist()

static void set_tablesample_rel_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 785 of file allpaths.c.

References add_path(), PlannerInfo::all_baserels, bms_membership(), BMS_SINGLETON, create_material_path(), create_samplescan_path(), GetTsmRoutine(), RelOptInfo::lateral_relids, PlannerInfo::query_level, TsmRoutine::repeatable_across_scans, RangeTblEntry::tablesample, and TableSampleClause::tsmhandler.

Referenced by set_rel_pathlist().

786 {
787  Relids required_outer;
788  Path *path;
789 
790  /*
791  * We don't support pushing join clauses into the quals of a samplescan,
792  * but it could still have required parameterization due to LATERAL refs
793  * in its tlist or TABLESAMPLE arguments.
794  */
795  required_outer = rel->lateral_relids;
796 
797  /* Consider sampled scan */
798  path = create_samplescan_path(root, rel, required_outer);
799 
800  /*
801  * If the sampling method does not support repeatable scans, we must avoid
802  * plans that would scan the rel multiple times. Ideally, we'd simply
803  * avoid putting the rel on the inside of a nestloop join; but adding such
804  * a consideration to the planner seems like a great deal of complication
805  * to support an uncommon usage of second-rate sampling methods. Instead,
806  * if there is a risk that the query might perform an unsafe join, just
807  * wrap the SampleScan in a Materialize node. We can check for joins by
808  * counting the membership of all_baserels (note that this correctly
809  * counts inheritance trees as single rels). If we're inside a subquery,
810  * we can't easily check whether a join might occur in the outer query, so
811  * just assume one is possible.
812  *
813  * GetTsmRoutine is relatively expensive compared to the other tests here,
814  * so check repeatable_across_scans last, even though that's a bit odd.
815  */
816  if ((root->query_level > 1 ||
819  {
820  path = (Path *) create_material_path(rel, path);
821  }
822 
823  add_path(rel, path);
824 
825  /* For the moment, at least, there are no other paths to consider */
826 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
MaterialPath * create_material_path(RelOptInfo *rel, Path *subpath)
Definition: pathnode.c:1477
Relids lateral_relids
Definition: relation.h:625
Relids all_baserels
Definition: relation.h:199
BMS_Membership bms_membership(const Bitmapset *a)
Definition: bitmapset.c:700
Path * create_samplescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:973
TsmRoutine * GetTsmRoutine(Oid tsmhandler)
Definition: tablesample.c:27
bool repeatable_across_scans
Definition: tsmapi.h:64
Index query_level
Definition: relation.h:162
struct TableSampleClause * tablesample
Definition: parsenodes.h:980

◆ set_tablesample_rel_size()

static void set_tablesample_rel_size ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 745 of file allpaths.c.

References TableSampleClause::args, check_index_predicates(), GetTsmRoutine(), RelOptInfo::pages, TsmRoutine::SampleScanGetSampleSize, set_baserel_size_estimates(), RangeTblEntry::tablesample, TableSampleClause::tsmhandler, and RelOptInfo::tuples.

Referenced by set_rel_size().

746 {
747  TableSampleClause *tsc = rte->tablesample;
748  TsmRoutine *tsm;
749  BlockNumber pages;
750  double tuples;
751 
752  /*
753  * Test any partial indexes of rel for applicability. We must do this
754  * first since partial unique indexes can affect size estimates.
755  */
756  check_index_predicates(root, rel);
757 
758  /*
759  * Call the sampling method's estimation function to estimate the number
760  * of pages it will read and the number of tuples it will return. (Note:
761  * we assume the function returns sane values.)
762  */
763  tsm = GetTsmRoutine(tsc->tsmhandler);
764  tsm->SampleScanGetSampleSize(root, rel, tsc->args,
765  &pages, &tuples);
766 
767  /*
768  * For the moment, because we will only consider a SampleScan path for the
769  * rel, it's okay to just overwrite the pages and tuples estimates for the
770  * whole relation. If we ever consider multiple path types for sampled
771  * rels, we'll need more complication.
772  */
773  rel->pages = pages;
774  rel->tuples = tuples;
775 
776  /* Mark rel with estimated output rows, width, etc */
777  set_baserel_size_estimates(root, rel);
778 }
double tuples
Definition: relation.h:640
uint32 BlockNumber
Definition: block.h:31
void check_index_predicates(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:2794
SampleScanGetSampleSize_function SampleScanGetSampleSize
Definition: tsmapi.h:67
void set_baserel_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4294
TsmRoutine * GetTsmRoutine(Oid tsmhandler)
Definition: tablesample.c:27
BlockNumber pages
Definition: relation.h:639
struct TableSampleClause * tablesample
Definition: parsenodes.h:980

◆ set_values_pathlist()

static void set_values_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 2341 of file allpaths.c.

References add_path(), create_valuesscan_path(), and RelOptInfo::lateral_relids.

Referenced by set_rel_pathlist().

2342 {
2343  Relids required_outer;
2344 
2345  /*
2346  * We don't support pushing join clauses into the quals of a values scan,
2347  * but it could still have required parameterization due to LATERAL refs
2348  * in the values expressions.
2349  */
2350  required_outer = rel->lateral_relids;
2351 
2352  /* Generate appropriate path */
2353  add_path(rel, create_valuesscan_path(root, rel, required_outer));
2354 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
Path * create_valuesscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1945
Relids lateral_relids
Definition: relation.h:625

◆ set_worktable_pathlist()

static void set_worktable_pathlist ( PlannerInfo root,
RelOptInfo rel,
RangeTblEntry rte 
)
static

Definition at line 2481 of file allpaths.c.

References add_path(), create_worktablescan_path(), RangeTblEntry::ctelevelsup, RangeTblEntry::ctename, elog, ERROR, RelOptInfo::lateral_relids, PlannerInfo::non_recursive_path, PlannerInfo::parent_root, Path::rows, and set_cte_size_estimates().

Referenced by set_rel_size().

2482 {
2483  Path *ctepath;
2484  PlannerInfo *cteroot;
2485  Index levelsup;
2486  Relids required_outer;
2487 
2488  /*
2489  * We need to find the non-recursive term's path, which is in the plan
2490  * level that's processing the recursive UNION, which is one level *below*
2491  * where the CTE comes from.
2492  */
2493  levelsup = rte->ctelevelsup;
2494  if (levelsup == 0) /* shouldn't happen */
2495  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
2496  levelsup--;
2497  cteroot = root;
2498  while (levelsup-- > 0)
2499  {
2500  cteroot = cteroot->parent_root;
2501  if (!cteroot) /* shouldn't happen */
2502  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
2503  }
2504  ctepath = cteroot->non_recursive_path;
2505  if (!ctepath) /* shouldn't happen */
2506  elog(ERROR, "could not find path for CTE \"%s\"", rte->ctename);
2507 
2508  /* Mark rel with estimated output rows, width, etc */
2509  set_cte_size_estimates(root, rel, ctepath->rows);
2510 
2511  /*
2512  * We don't support pushing join clauses into the quals of a worktable
2513  * scan, but it could still have required parameterization due to LATERAL
2514  * refs in its tlist. (I'm not sure this is actually possible given the
2515  * restrictions on recursive references, but it's easy enough to support.)
2516  */
2517  required_outer = rel->lateral_relids;
2518 
2519  /* Generate appropriate path */
2520  add_path(rel, create_worktablescan_path(root, rel, required_outer));
2521 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
void set_cte_size_estimates(PlannerInfo *root, RelOptInfo *rel, double cte_rows)
Definition: costsize.c:4981
Relids lateral_relids
Definition: relation.h:625
#define ERROR
Definition: elog.h:43
Path * create_worktablescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2022
struct PlannerInfo * parent_root
Definition: relation.h:164
unsigned int Index
Definition: c.h:442
double rows
Definition: relation.h:1076
struct Path * non_recursive_path
Definition: relation.h:313
Index ctelevelsup
Definition: parsenodes.h:1033
char * ctename
Definition: parsenodes.h:1032
#define elog
Definition: elog.h:219

◆ standard_join_search()

RelOptInfo* standard_join_search ( PlannerInfo root,
int  levels_needed,
List initial_rels 
)

Definition at line 2701 of file allpaths.c.

References Assert, elog, ERROR, generate_gather_paths(), generate_partitionwise_join_paths(), PlannerInfo::join_rel_level, join_search_one_level(), lfirst, linitial, list_length(), NIL, palloc0(), and set_cheapest().

Referenced by make_rel_from_joinlist().

2702 {
2703  int lev;
2704  RelOptInfo *rel;
2705 
2706  /*
2707  * This function cannot be invoked recursively within any one planning
2708  * problem, so join_rel_level[] can't be in use already.
2709  */
2710  Assert(root->join_rel_level == NULL);
2711 
2712  /*
2713  * We employ a simple "dynamic programming" algorithm: we first find all
2714  * ways to build joins of two jointree items, then all ways to build joins
2715  * of three items (from two-item joins and single items), then four-item
2716  * joins, and so on until we have considered all ways to join all the
2717  * items into one rel.
2718  *
2719  * root->join_rel_level[j] is a list of all the j-item rels. Initially we
2720  * set root->join_rel_level[1] to represent all the single-jointree-item
2721  * relations.
2722  */
2723  root->join_rel_level = (List **) palloc0((levels_needed + 1) * sizeof(List *));
2724 
2725  root->join_rel_level[1] = initial_rels;
2726 
2727  for (lev = 2; lev <= levels_needed; lev++)
2728  {
2729  ListCell *lc;
2730 
2731  /*
2732  * Determine all possible pairs of relations to be joined at this
2733  * level, and build paths for making each one from every available
2734  * pair of lower-level relations.
2735  */
2736  join_search_one_level(root, lev);
2737 
2738  /*
2739  * Run generate_partitionwise_join_paths() and
2740  * generate_gather_paths() for each just-processed joinrel. We could
2741  * not do this earlier because both regular and partial paths can get
2742  * added to a particular joinrel at multiple times within
2743  * join_search_one_level.
2744  *
2745  * After that, we're done creating paths for the joinrel, so run
2746  * set_cheapest().
2747  */
2748  foreach(lc, root->join_rel_level[lev])
2749  {
2750  rel = (RelOptInfo *) lfirst(lc);
2751 
2752  /* Create paths for partitionwise joins. */
2754 
2755  /*
2756  * Except for the topmost scan/join rel, consider gathering
2757  * partial paths. We'll do the same for the topmost scan/join rel
2758  * once we know the final targetlist (see grouping_planner).
2759  */
2760  if (lev < levels_needed)
2761  generate_gather_paths(root, rel, false);
2762 
2763  /* Find and save the cheapest paths for this rel */
2764  set_cheapest(rel);
2765 
2766 #ifdef OPTIMIZER_DEBUG
2767  debug_print_rel(root, rel);
2768 #endif
2769  }
2770  }
2771 
2772  /*
2773  * We should have a single rel at the final level.
2774  */
2775  if (root->join_rel_level[levels_needed] == NIL)
2776  elog(ERROR, "failed to build any %d-way joins", levels_needed);
2777  Assert(list_length(root->join_rel_level[levels_needed]) == 1);
2778 
2779  rel = (RelOptInfo *) linitial(root->join_rel_level[levels_needed]);
2780 
2781  root->join_rel_level = NULL;
2782 
2783  return rel;
2784 }
#define NIL
Definition: pg_list.h:69
void generate_partitionwise_join_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:3522
void generate_gather_paths(PlannerInfo *root, RelOptInfo *rel, bool override_rows)
Definition: allpaths.c:2540
#define linitial(l)
Definition: pg_list.h:111
#define ERROR
Definition: elog.h:43
void join_search_one_level(PlannerInfo *root, int level)
Definition: joinrels.c:65
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
void * palloc0(Size size)
Definition: mcxt.c:955
#define Assert(condition)
Definition: c.h:699
#define lfirst(lc)
Definition: pg_list.h:106
List ** join_rel_level
Definition: relation.h:228
static int list_length(const List *l)
Definition: pg_list.h:89
#define elog
Definition: elog.h:219
Definition: pg_list.h:45

◆ subquery_is_pushdown_safe()

static bool subquery_is_pushdown_safe ( Query subquery,
Query topquery,
pushdown_safety_info safetyInfo 
)
static

Definition at line 2860 of file allpaths.c.

References Assert, castNode, check_output_expressions(), SetOperationStmt::colTypes, compare_tlist_datatypes(), Query::distinctClause, Query::hasTargetSRFs, Query::hasWindowFuncs, Query::limitCount, Query::limitOffset, recurse_pushdown_safe(), Query::setOperations, Query::targetList, and pushdown_safety_info::unsafeVolatile.

Referenced by recurse_pushdown_safe(), and set_subquery_pathlist().

2862 {
2863  SetOperationStmt *topop;
2864 
2865  /* Check point 1 */
2866  if (subquery->limitOffset != NULL || subquery->limitCount != NULL)
2867  return false;
2868 
2869  /* Check points 3, 4, and 5 */
2870  if (subquery->distinctClause ||
2871  subquery->hasWindowFuncs ||
2872  subquery->hasTargetSRFs)
2873  safetyInfo->unsafeVolatile = true;
2874 
2875  /*
2876  * If we're at a leaf query, check for unsafe expressions in its target
2877  * list, and mark any unsafe ones in unsafeColumns[]. (Non-leaf nodes in
2878  * setop trees have only simple Vars in their tlists, so no need to check
2879  * them.)
2880  */
2881  if (subquery->setOperations == NULL)
2882  check_output_expressions(subquery, safetyInfo);
2883 
2884  /* Are we at top level, or looking at a setop component? */
2885  if (subquery == topquery)
2886  {
2887  /* Top level, so check any component queries */
2888  if (subquery->setOperations != NULL)
2889  if (!recurse_pushdown_safe(subquery->setOperations, topquery,
2890  safetyInfo))
2891  return false;
2892  }
2893  else
2894  {
2895  /* Setop component must not have more components (too weird) */
2896  if (subquery->setOperations != NULL)
2897  return false;
2898  /* Check whether setop component output types match top level */
2899  topop = castNode(SetOperationStmt, topquery->setOperations);
2900  Assert(topop);
2902  topop->colTypes,
2903  safetyInfo);
2904  }
2905  return true;
2906 }
Node * limitOffset
Definition: parsenodes.h:160
#define castNode(_type_, nodeptr)
Definition: nodes.h:586
static bool recurse_pushdown_safe(Node *setOp, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:2912
static void compare_tlist_datatypes(List *tlist, List *colTypes, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3047
List * targetList
Definition: parsenodes.h:140
List * distinctClause
Definition: parsenodes.h:156
Node * limitCount
Definition: parsenodes.h:161
static void check_output_expressions(Query *subquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:2979
bool hasTargetSRFs
Definition: parsenodes.h:127
#define Assert(condition)
Definition: c.h:699
bool hasWindowFuncs
Definition: parsenodes.h:126
Node * setOperations
Definition: parsenodes.h:165

◆ subquery_push_qual()

static void subquery_push_qual ( Query subquery,
RangeTblEntry rte,
Index  rti,
Node qual 
)
static

Definition at line 3199 of file allpaths.c.

References Query::groupClause, Query::groupingSets, Query::hasAggs, Query::hasSubLinks, Query::havingQual, Query::jointree, make_and_qual(), FromExpr::quals, recurse_push_qual(), REPLACEVARS_REPORT_ERROR, ReplaceVarsFromTargetList(), Query::setOperations, and Query::targetList.

Referenced by recurse_push_qual(), and set_subquery_pathlist().

3200 {
3201  if (subquery->setOperations != NULL)
3202  {
3203  /* Recurse to push it separately to each component query */
3204  recurse_push_qual(subquery->setOperations, subquery,
3205  rte, rti, qual);
3206  }
3207  else
3208  {
3209  /*
3210  * We need to replace Vars in the qual (which must refer to outputs of
3211  * the subquery) with copies of the subquery's targetlist expressions.
3212  * Note that at this point, any uplevel Vars in the qual should have
3213  * been replaced with Params, so they need no work.
3214  *
3215  * This step also ensures that when we are pushing into a setop tree,
3216  * each component query gets its own copy of the qual.
3217  */
3218  qual = ReplaceVarsFromTargetList(qual, rti, 0, rte,
3219  subquery->targetList,
3221  &subquery->hasSubLinks);
3222 
3223  /*
3224  * Now attach the qual to the proper place: normally WHERE, but if the
3225  * subquery uses grouping or aggregation, put it in HAVING (since the
3226  * qual really refers to the group-result rows).
3227  */
3228  if (subquery->hasAggs || subquery->groupClause || subquery->groupingSets || subquery->havingQual)
3229  subquery->havingQual = make_and_qual(subquery->havingQual, qual);
3230  else
3231  subquery->jointree->quals =
3232  make_and_qual(subquery->jointree->quals, qual);
3233 
3234  /*
3235  * We need not change the subquery's hasAggs or hasSubLinks flags,
3236  * since we can't be pushing down any aggregates that weren't there
3237  * before, and we don't push down subselects at all.
3238  */
3239  }
3240 }
Node * make_and_qual(Node *qual1, Node *qual2)
Definition: clauses.c:349
FromExpr * jointree
Definition: parsenodes.h:138
bool hasAggs
Definition: parsenodes.h:125
List * groupingSets
Definition: parsenodes.h:150
Node * quals
Definition: primnodes.h:1480
List * targetList
Definition: parsenodes.h:140
Node * ReplaceVarsFromTargetList(Node *node, int target_varno, int sublevels_up, RangeTblEntry *target_rte, List *targetlist, ReplaceVarsNoMatchOption nomatch_option, int nomatch_varno, bool *outer_hasSubLinks)
static void recurse_push_qual(Node *setOp, Query *topquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3246
Node * setOperations
Definition: parsenodes.h:165
List * groupClause
Definition: parsenodes.h:148
bool hasSubLinks
Definition: parsenodes.h:128
Node * havingQual
Definition: parsenodes.h:152

◆ targetIsInAllPartitionLists()

static bool targetIsInAllPartitionLists ( TargetEntry tle,
Query query 
)
static

Definition at line 3080 of file allpaths.c.

References InvalidOid, lfirst, WindowClause::partitionClause, targetIsInSortList(), and Query::windowClause.

Referenced by check_output_expressions().

3081 {
3082  ListCell *lc;
3083 
3084  foreach(lc, query->windowClause)
3085  {
3086  WindowClause *wc = (WindowClause *) lfirst(lc);
3087 
3089  return false;
3090  }
3091  return true;
3092 }
List * windowClause
Definition: parsenodes.h:154
List * partitionClause
Definition: parsenodes.h:1303
#define InvalidOid
Definition: postgres_ext.h:36
bool targetIsInSortList(TargetEntry *tle, Oid sortop, List *sortList)
#define lfirst(lc)
Definition: pg_list.h:106

Variable Documentation

◆ enable_geqo

bool enable_geqo = false

Definition at line 60 of file allpaths.c.

Referenced by make_rel_from_joinlist().

◆ geqo_threshold

int geqo_threshold

Definition at line 61 of file allpaths.c.

Referenced by make_rel_from_joinlist().

◆ join_search_hook

join_search_hook_type join_search_hook = NULL

Definition at line 69 of file allpaths.c.

Referenced by make_rel_from_joinlist().

◆ min_parallel_index_scan_size

int min_parallel_index_scan_size

Definition at line 63 of file allpaths.c.

Referenced by compute_parallel_worker().

◆ min_parallel_table_scan_size

int min_parallel_table_scan_size

Definition at line 62 of file allpaths.c.

Referenced by compute_parallel_worker().

◆ set_rel_pathlist_hook

set_rel_pathlist_hook_type set_rel_pathlist_hook = NULL

Definition at line 66 of file allpaths.c.

Referenced by set_rel_pathlist().