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/appendinfo.h"
#include "optimizer/clauses.h"
#include "optimizer/cost.h"
#include "optimizer/geqo.h"
#include "optimizer/inherit.h"
#include "optimizer/optimizer.h"
#include "optimizer/pathnode.h"
#include "optimizer/paths.h"
#include "optimizer/plancat.h"
#include "optimizer/planner.h"
#include "optimizer/restrictinfo.h"
#include "optimizer/tlist.h"
#include "parser/parse_clause.h"
#include "parser/parsetree.h"
#include "partitioning/partbounds.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_orderedappend_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 Pathget_singleton_append_subpath (Path *path)
 
static void set_dummy_rel_pathlist (RelOptInfo *rel)
 
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_result_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)
 
static bool has_multiple_baserels (PlannerInfo *root)
 
void generate_gather_paths (PlannerInfo *root, RelOptInfo *rel, bool override_rows)
 
static Listget_useful_pathkeys_for_relation (PlannerInfo *root, RelOptInfo *rel)
 
void generate_useful_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 2042 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_orderedappend_paths().

2043 {
2044  if (IsA(path, AppendPath))
2045  {
2046  AppendPath *apath = (AppendPath *) path;
2047 
2048  if (!apath->path.parallel_aware || apath->first_partial_path == 0)
2049  {
2050  *subpaths = list_concat(*subpaths, apath->subpaths);
2051  return;
2052  }
2053  else if (special_subpaths != NULL)
2054  {
2055  List *new_special_subpaths;
2056 
2057  /* Split Parallel Append into partial and non-partial subpaths */
2058  *subpaths = list_concat(*subpaths,
2059  list_copy_tail(apath->subpaths,
2060  apath->first_partial_path));
2061  new_special_subpaths =
2063  apath->first_partial_path);
2064  *special_subpaths = list_concat(*special_subpaths,
2065  new_special_subpaths);
2066  return;
2067  }
2068  }
2069  else if (IsA(path, MergeAppendPath))
2070  {
2071  MergeAppendPath *mpath = (MergeAppendPath *) path;
2072 
2073  *subpaths = list_concat(*subpaths, mpath->subpaths);
2074  return;
2075  }
2076 
2077  *subpaths = lappend(*subpaths, path);
2078 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
List * list_truncate(List *list, int new_size)
Definition: list.c:585
List * list_copy(const List *oldlist)
Definition: list.c:1403
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
List * list_copy_tail(const List *oldlist, int nskip)
Definition: list.c:1422
int first_partial_path
Definition: pathnodes.h:1406
List * subpaths
Definition: pathnodes.h:1404
List * lappend(List *list, void *datum)
Definition: list.c:321
bool parallel_aware
Definition: pathnodes.h:1149
Definition: pg_list.h:50

◆ add_paths_to_append_rel()

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

Definition at line 1294 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(), RelOptInfo::consider_parallel, create_append_path(), enable_parallel_append, fls(), generate_orderedappend_paths(), get_cheapest_parallel_safe_total_inner(), get_cheapest_parameterized_child_path(), IS_JOIN_REL, IS_SIMPLE_REL, lappend(), lfirst, linitial, list_concat(), list_length(), list_make1, 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().

1296 {
1297  List *subpaths = NIL;
1298  bool subpaths_valid = true;
1299  List *partial_subpaths = NIL;
1300  List *pa_partial_subpaths = NIL;
1301  List *pa_nonpartial_subpaths = NIL;
1302  bool partial_subpaths_valid = true;
1303  bool pa_subpaths_valid;
1304  List *all_child_pathkeys = NIL;
1305  List *all_child_outers = NIL;
1306  ListCell *l;
1307  List *partitioned_rels = NIL;
1308  double partial_rows = -1;
1309 
1310  /* If appropriate, consider parallel append */
1311  pa_subpaths_valid = enable_parallel_append && rel->consider_parallel;
1312 
1313  /*
1314  * AppendPath generated for partitioned tables must record the RT indexes
1315  * of partitioned tables that are direct or indirect children of this
1316  * Append rel.
1317  *
1318  * AppendPath may be for a sub-query RTE (UNION ALL), in which case, 'rel'
1319  * itself does not represent a partitioned relation, but the child sub-
1320  * queries may contain references to partitioned relations. The loop
1321  * below will look for such children and collect them in a list to be
1322  * passed to the path creation function. (This assumes that we don't need
1323  * to look through multiple levels of subquery RTEs; if we ever do, we
1324  * could consider stuffing the list we generate here into sub-query RTE's
1325  * RelOptInfo, just like we do for partitioned rels, which would be used
1326  * when populating our parent rel with paths. For the present, that
1327  * appears to be unnecessary.)
1328  */
1329  if (rel->part_scheme != NULL)
1330  {
1331  if (IS_SIMPLE_REL(rel))
1332  partitioned_rels = list_make1(rel->partitioned_child_rels);
1333  else if (IS_JOIN_REL(rel))
1334  {
1335  int relid = -1;
1336  List *partrels = NIL;
1337 
1338  /*
1339  * For a partitioned joinrel, concatenate the component rels'
1340  * partitioned_child_rels lists.
1341  */
1342  while ((relid = bms_next_member(rel->relids, relid)) >= 0)
1343  {
1344  RelOptInfo *component;
1345 
1346  Assert(relid >= 1 && relid < root->simple_rel_array_size);
1347  component = root->simple_rel_array[relid];
1348  Assert(component->part_scheme != NULL);
1349  Assert(list_length(component->partitioned_child_rels) >= 1);
1350  partrels = list_concat(partrels,
1351  component->partitioned_child_rels);
1352  }
1353 
1354  partitioned_rels = list_make1(partrels);
1355  }
1356 
1357  Assert(list_length(partitioned_rels) >= 1);
1358  }
1359 
1360  /*
1361  * For every non-dummy child, remember the cheapest path. Also, identify
1362  * all pathkeys (orderings) and parameterizations (required_outer sets)
1363  * available for the non-dummy member relations.
1364  */
1365  foreach(l, live_childrels)
1366  {
1367  RelOptInfo *childrel = lfirst(l);
1368  ListCell *lcp;
1369  Path *cheapest_partial_path = NULL;
1370 
1371  /*
1372  * For UNION ALLs with non-empty partitioned_child_rels, accumulate
1373  * the Lists of child relations.
1374  */
1375  if (rel->rtekind == RTE_SUBQUERY && childrel->partitioned_child_rels != NIL)
1376  partitioned_rels = lappend(partitioned_rels,
1377  childrel->partitioned_child_rels);
1378 
1379  /*
1380  * If child has an unparameterized cheapest-total path, add that to
1381  * the unparameterized Append path we are constructing for the parent.
1382  * If not, there's no workable unparameterized path.
1383  *
1384  * With partitionwise aggregates, the child rel's pathlist may be
1385  * empty, so don't assume that a path exists here.
1386  */
1387  if (childrel->pathlist != NIL &&
1388  childrel->cheapest_total_path->param_info == NULL)
1390  &subpaths, NULL);
1391  else
1392  subpaths_valid = false;
1393 
1394  /* Same idea, but for a partial plan. */
1395  if (childrel->partial_pathlist != NIL)
1396  {
1397  cheapest_partial_path = linitial(childrel->partial_pathlist);
1398  accumulate_append_subpath(cheapest_partial_path,
1399  &partial_subpaths, NULL);
1400  }
1401  else
1402  partial_subpaths_valid = false;
1403 
1404  /*
1405  * Same idea, but for a parallel append mixing partial and non-partial
1406  * paths.
1407  */
1408  if (pa_subpaths_valid)
1409  {
1410  Path *nppath = NULL;
1411 
1412  nppath =
1414 
1415  if (cheapest_partial_path == NULL && nppath == NULL)
1416  {
1417  /* Neither a partial nor a parallel-safe path? Forget it. */
1418  pa_subpaths_valid = false;
1419  }
1420  else if (nppath == NULL ||
1421  (cheapest_partial_path != NULL &&
1422  cheapest_partial_path->total_cost < nppath->total_cost))
1423  {
1424  /* Partial path is cheaper or the only option. */
1425  Assert(cheapest_partial_path != NULL);
1426  accumulate_append_subpath(cheapest_partial_path,
1427  &pa_partial_subpaths,
1428  &pa_nonpartial_subpaths);
1429 
1430  }
1431  else
1432  {
1433  /*
1434  * Either we've got only a non-partial path, or we think that
1435  * a single backend can execute the best non-partial path
1436  * faster than all the parallel backends working together can
1437  * execute the best partial path.
1438  *
1439  * It might make sense to be more aggressive here. Even if
1440  * the best non-partial path is more expensive than the best
1441  * partial path, it could still be better to choose the
1442  * non-partial path if there are several such paths that can
1443  * be given to different workers. For now, we don't try to
1444  * figure that out.
1445  */
1447  &pa_nonpartial_subpaths,
1448  NULL);
1449  }
1450  }
1451 
1452  /*
1453  * Collect lists of all the available path orderings and
1454  * parameterizations for all the children. We use these as a
1455  * heuristic to indicate which sort orderings and parameterizations we
1456  * should build Append and MergeAppend paths for.
1457  */
1458  foreach(lcp, childrel->pathlist)
1459  {
1460  Path *childpath = (Path *) lfirst(lcp);
1461  List *childkeys = childpath->pathkeys;
1462  Relids childouter = PATH_REQ_OUTER(childpath);
1463 
1464  /* Unsorted paths don't contribute to pathkey list */
1465  if (childkeys != NIL)
1466  {
1467  ListCell *lpk;
1468  bool found = false;
1469 
1470  /* Have we already seen this ordering? */
1471  foreach(lpk, all_child_pathkeys)
1472  {
1473  List *existing_pathkeys = (List *) lfirst(lpk);
1474 
1475  if (compare_pathkeys(existing_pathkeys,
1476  childkeys) == PATHKEYS_EQUAL)
1477  {
1478  found = true;
1479  break;
1480  }
1481  }
1482  if (!found)
1483  {
1484  /* No, so add it to all_child_pathkeys */
1485  all_child_pathkeys = lappend(all_child_pathkeys,
1486  childkeys);
1487  }
1488  }
1489 
1490  /* Unparameterized paths don't contribute to param-set list */
1491  if (childouter)
1492  {
1493  ListCell *lco;
1494  bool found = false;
1495 
1496  /* Have we already seen this param set? */
1497  foreach(lco, all_child_outers)
1498  {
1499  Relids existing_outers = (Relids) lfirst(lco);
1500 
1501  if (bms_equal(existing_outers, childouter))
1502  {
1503  found = true;
1504  break;
1505  }
1506  }
1507  if (!found)
1508  {
1509  /* No, so add it to all_child_outers */
1510  all_child_outers = lappend(all_child_outers,
1511  childouter);
1512  }
1513  }
1514  }
1515  }
1516 
1517  /*
1518  * If we found unparameterized paths for all children, build an unordered,
1519  * unparameterized Append path for the rel. (Note: this is correct even
1520  * if we have zero or one live subpath due to constraint exclusion.)
1521  */
1522  if (subpaths_valid)
1523  add_path(rel, (Path *) create_append_path(root, rel, subpaths, NIL,
1524  NIL, NULL, 0, false,
1525  partitioned_rels, -1));
1526 
1527  /*
1528  * Consider an append of unordered, unparameterized partial paths. Make
1529  * it parallel-aware if possible.
1530  */
1531  if (partial_subpaths_valid && partial_subpaths != NIL)
1532  {
1533  AppendPath *appendpath;
1534  ListCell *lc;
1535  int parallel_workers = 0;
1536 
1537  /* Find the highest number of workers requested for any subpath. */
1538  foreach(lc, partial_subpaths)
1539  {
1540  Path *path = lfirst(lc);
1541 
1542  parallel_workers = Max(parallel_workers, path->parallel_workers);
1543  }
1544  Assert(parallel_workers > 0);
1545 
1546  /*
1547  * If the use of parallel append is permitted, always request at least
1548  * log2(# of children) workers. We assume it can be useful to have
1549  * extra workers in this case because they will be spread out across
1550  * the children. The precise formula is just a guess, but we don't
1551  * want to end up with a radically different answer for a table with N
1552  * partitions vs. an unpartitioned table with the same data, so the
1553  * use of some kind of log-scaling here seems to make some sense.
1554  */
1556  {
1557  parallel_workers = Max(parallel_workers,
1558  fls(list_length(live_childrels)));
1559  parallel_workers = Min(parallel_workers,
1561  }
1562  Assert(parallel_workers > 0);
1563 
1564  /* Generate a partial append path. */
1565  appendpath = create_append_path(root, rel, NIL, partial_subpaths,
1566  NIL, NULL, parallel_workers,
1568  partitioned_rels, -1);
1569 
1570  /*
1571  * Make sure any subsequent partial paths use the same row count
1572  * estimate.
1573  */
1574  partial_rows = appendpath->path.rows;
1575 
1576  /* Add the path. */
1577  add_partial_path(rel, (Path *) appendpath);
1578  }
1579 
1580  /*
1581  * Consider a parallel-aware append using a mix of partial and non-partial
1582  * paths. (This only makes sense if there's at least one child which has
1583  * a non-partial path that is substantially cheaper than any partial path;
1584  * otherwise, we should use the append path added in the previous step.)
1585  */
1586  if (pa_subpaths_valid && pa_nonpartial_subpaths != NIL)
1587  {
1588  AppendPath *appendpath;
1589  ListCell *lc;
1590  int parallel_workers = 0;
1591 
1592  /*
1593  * Find the highest number of workers requested for any partial
1594  * subpath.
1595  */
1596  foreach(lc, pa_partial_subpaths)
1597  {
1598  Path *path = lfirst(lc);
1599 
1600  parallel_workers = Max(parallel_workers, path->parallel_workers);
1601  }
1602 
1603  /*
1604  * Same formula here as above. It's even more important in this
1605  * instance because the non-partial paths won't contribute anything to
1606  * the planned number of parallel workers.
1607  */
1608  parallel_workers = Max(parallel_workers,
1609  fls(list_length(live_childrels)));
1610  parallel_workers = Min(parallel_workers,
1612  Assert(parallel_workers > 0);
1613 
1614  appendpath = create_append_path(root, rel, pa_nonpartial_subpaths,
1615  pa_partial_subpaths,
1616  NIL, NULL, parallel_workers, true,
1617  partitioned_rels, partial_rows);
1618  add_partial_path(rel, (Path *) appendpath);
1619  }
1620 
1621  /*
1622  * Also build unparameterized ordered append paths based on the collected
1623  * list of child pathkeys.
1624  */
1625  if (subpaths_valid)
1626  generate_orderedappend_paths(root, rel, live_childrels,
1627  all_child_pathkeys,
1628  partitioned_rels);
1629 
1630  /*
1631  * Build Append paths for each parameterization seen among the child rels.
1632  * (This may look pretty expensive, but in most cases of practical
1633  * interest, the child rels will expose mostly the same parameterizations,
1634  * so that not that many cases actually get considered here.)
1635  *
1636  * The Append node itself cannot enforce quals, so all qual checking must
1637  * be done in the child paths. This means that to have a parameterized
1638  * Append path, we must have the exact same parameterization for each
1639  * child path; otherwise some children might be failing to check the
1640  * moved-down quals. To make them match up, we can try to increase the
1641  * parameterization of lesser-parameterized paths.
1642  */
1643  foreach(l, all_child_outers)
1644  {
1645  Relids required_outer = (Relids) lfirst(l);
1646  ListCell *lcr;
1647 
1648  /* Select the child paths for an Append with this parameterization */
1649  subpaths = NIL;
1650  subpaths_valid = true;
1651  foreach(lcr, live_childrels)
1652  {
1653  RelOptInfo *childrel = (RelOptInfo *) lfirst(lcr);
1654  Path *subpath;
1655 
1656  if (childrel->pathlist == NIL)
1657  {
1658  /* failed to make a suitable path for this child */
1659  subpaths_valid = false;
1660  break;
1661  }
1662 
1664  childrel,
1665  required_outer);
1666  if (subpath == NULL)
1667  {
1668  /* failed to make a suitable path for this child */
1669  subpaths_valid = false;
1670  break;
1671  }
1672  accumulate_append_subpath(subpath, &subpaths, NULL);
1673  }
1674 
1675  if (subpaths_valid)
1676  add_path(rel, (Path *)
1677  create_append_path(root, rel, subpaths, NIL,
1678  NIL, required_outer, 0, false,
1679  partitioned_rels, -1));
1680  }
1681 
1682  /*
1683  * When there is only a single child relation, the Append path can inherit
1684  * any ordering available for the child rel's path, so that it's useful to
1685  * consider ordered partial paths. Above we only considered the cheapest
1686  * partial path for each child, but let's also make paths using any
1687  * partial paths that have pathkeys.
1688  */
1689  if (list_length(live_childrels) == 1)
1690  {
1691  RelOptInfo *childrel = (RelOptInfo *) linitial(live_childrels);
1692 
1693  foreach(l, childrel->partial_pathlist)
1694  {
1695  Path *path = (Path *) lfirst(l);
1696  AppendPath *appendpath;
1697 
1698  /*
1699  * Skip paths with no pathkeys. Also skip the cheapest partial
1700  * path, since we already used that above.
1701  */
1702  if (path->pathkeys == NIL ||
1703  path == linitial(childrel->partial_pathlist))
1704  continue;
1705 
1706  appendpath = create_append_path(root, rel, NIL, list_make1(path),
1707  NIL, NULL,
1708  path->parallel_workers, true,
1709  partitioned_rels, partial_rows);
1710  add_partial_path(rel, (Path *) appendpath);
1711  }
1712  }
1713 }
#define NIL
Definition: pg_list.h:65
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:1954
#define Min(x, y)
Definition: c.h:920
int bms_next_member(const Bitmapset *a, int prevbit)
Definition: bitmapset.c:1043
int parallel_workers
Definition: pathnodes.h:1151
ParamPathInfo * param_info
Definition: pathnodes.h:1147
#define IS_JOIN_REL(rel)
Definition: pathnodes.h:643
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
List * partial_pathlist
Definition: pathnodes.h:681
bool enable_parallel_append
Definition: costsize.c:142
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:285
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:638
int fls(int mask)
Definition: fls.c:55
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
#define list_make1(x1)
Definition: pg_list.h:227
#define linitial(l)
Definition: pg_list.h:195
struct Path * cheapest_total_path
Definition: pathnodes.h:683
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1163
Relids relids
Definition: pathnodes.h:665
Path * get_cheapest_parallel_safe_total_inner(List *paths)
Definition: pathkeys.c:482
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, List *pathkeys, Relids required_outer, int parallel_workers, bool parallel_aware, List *partitioned_rels, double rows)
Definition: pathnode.c:1183
List * lappend(List *list, void *datum)
Definition: list.c:321
RTEKind rtekind
Definition: pathnodes.h:695
Cost total_cost
Definition: pathnodes.h:1156
List * pathkeys
Definition: pathnodes.h:1158
#define Max(x, y)
Definition: c.h:914
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
Bitmapset * Relids
Definition: pathnodes.h:28
List * partitioned_child_rels
Definition: pathnodes.h:755
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:749
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
static void generate_orderedappend_paths(PlannerInfo *root, RelOptInfo *rel, List *live_childrels, List *all_child_pathkeys, List *partitioned_rels)
Definition: allpaths.c:1743
static void accumulate_append_subpath(Path *path, List **subpaths, List **special_subpaths)
Definition: allpaths.c:2042
int max_parallel_workers_per_gather
Definition: costsize.c:123
Definition: pg_list.h:50
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ check_output_expressions()

static void check_output_expressions ( Query subquery,
pushdown_safety_info safetyInfo 
)
static

Definition at line 3333 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().

3334 {
3335  ListCell *lc;
3336 
3337  foreach(lc, subquery->targetList)
3338  {
3339  TargetEntry *tle = (TargetEntry *) lfirst(lc);
3340 
3341  if (tle->resjunk)
3342  continue; /* ignore resjunk columns */
3343 
3344  /* We need not check further if output col is already known unsafe */
3345  if (safetyInfo->unsafeColumns[tle->resno])
3346  continue;
3347 
3348  /* Functions returning sets are unsafe (point 1) */
3349  if (subquery->hasTargetSRFs &&
3350  expression_returns_set((Node *) tle->expr))
3351  {
3352  safetyInfo->unsafeColumns[tle->resno] = true;
3353  continue;
3354  }
3355 
3356  /* Volatile functions are unsafe (point 2) */
3357  if (contain_volatile_functions((Node *) tle->expr))
3358  {
3359  safetyInfo->unsafeColumns[tle->resno] = true;
3360  continue;
3361  }
3362 
3363  /* If subquery uses DISTINCT ON, check point 3 */
3364  if (subquery->hasDistinctOn &&
3365  !targetIsInSortList(tle, InvalidOid, subquery->distinctClause))
3366  {
3367  /* non-DISTINCT column, so mark it unsafe */
3368  safetyInfo->unsafeColumns[tle->resno] = true;
3369  continue;
3370  }
3371 
3372  /* If subquery uses window functions, check point 4 */
3373  if (subquery->hasWindowFuncs &&
3374  !targetIsInAllPartitionLists(tle, subquery))
3375  {
3376  /* not present in all PARTITION BY clauses, so mark it unsafe */
3377  safetyInfo->unsafeColumns[tle->resno] = true;
3378  continue;
3379  }
3380  }
3381 }
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:669
Definition: nodes.h:529
bool * unsafeColumns
Definition: allpaths.c:56
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:726
bool hasDistinctOn
Definition: parsenodes.h:129
List * targetList
Definition: parsenodes.h:140
bool resjunk
Definition: primnodes.h:1414
List * distinctClause
Definition: parsenodes.h:156
static bool targetIsInAllPartitionLists(TargetEntry *tle, Query *query)
Definition: allpaths.c:3434
AttrNumber resno
Definition: primnodes.h:1408
#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:190
bool hasWindowFuncs
Definition: parsenodes.h:126
Expr * expr
Definition: primnodes.h:1407

◆ compare_tlist_datatypes()

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

Definition at line 3401 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().

3403 {
3404  ListCell *l;
3405  ListCell *colType = list_head(colTypes);
3406 
3407  foreach(l, tlist)
3408  {
3409  TargetEntry *tle = (TargetEntry *) lfirst(l);
3410 
3411  if (tle->resjunk)
3412  continue; /* ignore resjunk columns */
3413  if (colType == NULL)
3414  elog(ERROR, "wrong number of tlist entries");
3415  if (exprType((Node *) tle->expr) != lfirst_oid(colType))
3416  safetyInfo->unsafeColumns[tle->resno] = true;
3417  colType = lnext(colTypes, colType);
3418  }
3419  if (colType != NULL)
3420  elog(ERROR, "wrong number of tlist entries");
3421 }
static ListCell * lnext(const List *l, const ListCell *c)
Definition: pg_list.h:321
Definition: nodes.h:529
bool * unsafeColumns
Definition: allpaths.c:56
bool resjunk
Definition: primnodes.h:1414
#define ERROR
Definition: elog.h:43
AttrNumber resno
Definition: primnodes.h:1408
static ListCell * list_head(const List *l)
Definition: pg_list.h:125
#define lfirst(lc)
Definition: pg_list.h:190
Expr * expr
Definition: primnodes.h:1407
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
#define elog(elevel,...)
Definition: elog.h:214
#define lfirst_oid(lc)
Definition: pg_list.h:192

◆ compute_parallel_worker()

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

Definition at line 3788 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().

3790 {
3791  int parallel_workers = 0;
3792 
3793  /*
3794  * If the user has set the parallel_workers reloption, use that; otherwise
3795  * select a default number of workers.
3796  */
3797  if (rel->rel_parallel_workers != -1)
3798  parallel_workers = rel->rel_parallel_workers;
3799  else
3800  {
3801  /*
3802  * If the number of pages being scanned is insufficient to justify a
3803  * parallel scan, just return zero ... unless it's an inheritance
3804  * child. In that case, we want to generate a parallel path here
3805  * anyway. It might not be worthwhile just for this relation, but
3806  * when combined with all of its inheritance siblings it may well pay
3807  * off.
3808  */
3809  if (rel->reloptkind == RELOPT_BASEREL &&
3810  ((heap_pages >= 0 && heap_pages < min_parallel_table_scan_size) ||
3811  (index_pages >= 0 && index_pages < min_parallel_index_scan_size)))
3812  return 0;
3813 
3814  if (heap_pages >= 0)
3815  {
3816  int heap_parallel_threshold;
3817  int heap_parallel_workers = 1;
3818 
3819  /*
3820  * Select the number of workers based on the log of the size of
3821  * the relation. This probably needs to be a good deal more
3822  * sophisticated, but we need something here for now. Note that
3823  * the upper limit of the min_parallel_table_scan_size GUC is
3824  * chosen to prevent overflow here.
3825  */
3826  heap_parallel_threshold = Max(min_parallel_table_scan_size, 1);
3827  while (heap_pages >= (BlockNumber) (heap_parallel_threshold * 3))
3828  {
3829  heap_parallel_workers++;
3830  heap_parallel_threshold *= 3;
3831  if (heap_parallel_threshold > INT_MAX / 3)
3832  break; /* avoid overflow */
3833  }
3834 
3835  parallel_workers = heap_parallel_workers;
3836  }
3837 
3838  if (index_pages >= 0)
3839  {
3840  int index_parallel_workers = 1;
3841  int index_parallel_threshold;
3842 
3843  /* same calculation as for heap_pages above */
3844  index_parallel_threshold = Max(min_parallel_index_scan_size, 1);
3845  while (index_pages >= (BlockNumber) (index_parallel_threshold * 3))
3846  {
3847  index_parallel_workers++;
3848  index_parallel_threshold *= 3;
3849  if (index_parallel_threshold > INT_MAX / 3)
3850  break; /* avoid overflow */
3851  }
3852 
3853  if (parallel_workers > 0)
3854  parallel_workers = Min(parallel_workers, index_parallel_workers);
3855  else
3856  parallel_workers = index_parallel_workers;
3857  }
3858  }
3859 
3860  /* In no case use more than caller supplied maximum number of workers */
3861  parallel_workers = Min(parallel_workers, max_workers);
3862 
3863  return parallel_workers;
3864 }
RelOptKind reloptkind
Definition: pathnodes.h:662
#define Min(x, y)
Definition: c.h:920
uint32 BlockNumber
Definition: block.h:31
int min_parallel_index_scan_size
Definition: allpaths.c:65
int rel_parallel_workers
Definition: pathnodes.h:711
#define Max(x, y)
Definition: c.h:914
int min_parallel_table_scan_size
Definition: allpaths.c:64

◆ create_partial_bitmap_paths()

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

Definition at line 3752 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().

3754 {
3755  int parallel_workers;
3756  double pages_fetched;
3757 
3758  /* Compute heap pages for bitmap heap scan */
3759  pages_fetched = compute_bitmap_pages(root, rel, bitmapqual, 1.0,
3760  NULL, NULL);
3761 
3762  parallel_workers = compute_parallel_worker(rel, pages_fetched, -1,
3764 
3765  if (parallel_workers <= 0)
3766  return;
3767 
3768  add_partial_path(rel, (Path *) create_bitmap_heap_path(root, rel,
3769  bitmapqual, rel->lateral_relids, 1.0, parallel_workers));
3770 }
int compute_parallel_worker(RelOptInfo *rel, double heap_pages, double index_pages, int max_workers)
Definition: allpaths.c:3788
Relids lateral_relids
Definition: pathnodes.h:690
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:749
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:5694
BitmapHeapPath * create_bitmap_heap_path(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual, Relids required_outer, double loop_count, int parallel_degree)
Definition: pathnode.c:1046

◆ create_plain_partial_paths()

static void create_plain_partial_paths ( PlannerInfo root,
RelOptInfo rel 
)
static

Definition at line 796 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().

797 {
798  int parallel_workers;
799 
800  parallel_workers = compute_parallel_worker(rel, rel->pages, -1,
802 
803  /* If any limit was set to zero, the user doesn't want a parallel scan. */
804  if (parallel_workers <= 0)
805  return;
806 
807  /* Add an unordered partial path based on a parallel sequential scan. */
808  add_partial_path(rel, create_seqscan_path(root, rel, NULL, parallel_workers));
809 }
int compute_parallel_worker(RelOptInfo *rel, double heap_pages, double index_pages, int max_workers)
Definition: allpaths.c:3788
BlockNumber pages
Definition: pathnodes.h:704
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:749
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:929

◆ generate_gather_paths()

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

Definition at line 2682 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 generate_useful_gather_paths().

2683 {
2684  Path *cheapest_partial_path;
2685  Path *simple_gather_path;
2686  ListCell *lc;
2687  double rows;
2688  double *rowsp = NULL;
2689 
2690  /* If there are no partial paths, there's nothing to do here. */
2691  if (rel->partial_pathlist == NIL)
2692  return;
2693 
2694  /* Should we override the rel's rowcount estimate? */
2695  if (override_rows)
2696  rowsp = &rows;
2697 
2698  /*
2699  * The output of Gather is always unsorted, so there's only one partial
2700  * path of interest: the cheapest one. That will be the one at the front
2701  * of partial_pathlist because of the way add_partial_path works.
2702  */
2703  cheapest_partial_path = linitial(rel->partial_pathlist);
2704  rows =
2705  cheapest_partial_path->rows * cheapest_partial_path->parallel_workers;
2706  simple_gather_path = (Path *)
2707  create_gather_path(root, rel, cheapest_partial_path, rel->reltarget,
2708  NULL, rowsp);
2709  add_path(rel, simple_gather_path);
2710 
2711  /*
2712  * For each useful ordering, we can consider an order-preserving Gather
2713  * Merge.
2714  */
2715  foreach(lc, rel->partial_pathlist)
2716  {
2717  Path *subpath = (Path *) lfirst(lc);
2718  GatherMergePath *path;
2719 
2720  if (subpath->pathkeys == NIL)
2721  continue;
2722 
2723  rows = subpath->rows * subpath->parallel_workers;
2724  path = create_gather_merge_path(root, rel, subpath, rel->reltarget,
2725  subpath->pathkeys, NULL, rowsp);
2726  add_path(rel, &path->path);
2727  }
2728 }
#define NIL
Definition: pg_list.h:65
GatherPath * create_gather_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, Relids required_outer, double *rows)
Definition: pathnode.c:1845
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
int parallel_workers
Definition: pathnodes.h:1151
List * partial_pathlist
Definition: pathnodes.h:681
#define linitial(l)
Definition: pg_list.h:195
GatherMergePath * create_gather_merge_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
Definition: pathnode.c:1754
List * pathkeys
Definition: pathnodes.h:1158
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ generate_orderedappend_paths()

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

Definition at line 1743 of file allpaths.c.

References accumulate_append_subpath(), add_path(), Assert, BackwardScanDirection, RelOptInfo::boundinfo, build_partition_pathkeys(), RelOptInfo::cheapest_total_path, create_append_path(), create_merge_append_path(), ForwardScanDirection, get_cheapest_path_for_pathkeys(), get_singleton_append_subpath(), IS_SIMPLE_REL, lappend(), lcons(), lfirst, NIL, RelOptInfo::nparts, Path::param_info, RelOptInfo::part_scheme, partitions_are_ordered(), pathkeys_contained_in(), RelOptInfo::pathlist, STARTUP_COST, and TOTAL_COST.

Referenced by add_paths_to_append_rel().

1747 {
1748  ListCell *lcp;
1749  List *partition_pathkeys = NIL;
1750  List *partition_pathkeys_desc = NIL;
1751  bool partition_pathkeys_partial = true;
1752  bool partition_pathkeys_desc_partial = true;
1753 
1754  /*
1755  * Some partitioned table setups may allow us to use an Append node
1756  * instead of a MergeAppend. This is possible in cases such as RANGE
1757  * partitioned tables where it's guaranteed that an earlier partition must
1758  * contain rows which come earlier in the sort order. To detect whether
1759  * this is relevant, build pathkey descriptions of the partition ordering,
1760  * for both forward and reverse scans.
1761  */
1762  if (rel->part_scheme != NULL && IS_SIMPLE_REL(rel) &&
1764  {
1765  partition_pathkeys = build_partition_pathkeys(root, rel,
1767  &partition_pathkeys_partial);
1768 
1769  partition_pathkeys_desc = build_partition_pathkeys(root, rel,
1771  &partition_pathkeys_desc_partial);
1772 
1773  /*
1774  * You might think we should truncate_useless_pathkeys here, but
1775  * allowing partition keys which are a subset of the query's pathkeys
1776  * can often be useful. For example, consider a table partitioned by
1777  * RANGE (a, b), and a query with ORDER BY a, b, c. If we have child
1778  * paths that can produce the a, b, c ordering (perhaps via indexes on
1779  * (a, b, c)) then it works to consider the appendrel output as
1780  * ordered by a, b, c.
1781  */
1782  }
1783 
1784  /* Now consider each interesting sort ordering */
1785  foreach(lcp, all_child_pathkeys)
1786  {
1787  List *pathkeys = (List *) lfirst(lcp);
1788  List *startup_subpaths = NIL;
1789  List *total_subpaths = NIL;
1790  bool startup_neq_total = false;
1791  ListCell *lcr;
1792  bool match_partition_order;
1793  bool match_partition_order_desc;
1794 
1795  /*
1796  * Determine if this sort ordering matches any partition pathkeys we
1797  * have, for both ascending and descending partition order. If the
1798  * partition pathkeys happen to be contained in pathkeys then it still
1799  * works, as described above, providing that the partition pathkeys
1800  * are complete and not just a prefix of the partition keys. (In such
1801  * cases we'll be relying on the child paths to have sorted the
1802  * lower-order columns of the required pathkeys.)
1803  */
1804  match_partition_order =
1805  pathkeys_contained_in(pathkeys, partition_pathkeys) ||
1806  (!partition_pathkeys_partial &&
1807  pathkeys_contained_in(partition_pathkeys, pathkeys));
1808 
1809  match_partition_order_desc = !match_partition_order &&
1810  (pathkeys_contained_in(pathkeys, partition_pathkeys_desc) ||
1811  (!partition_pathkeys_desc_partial &&
1812  pathkeys_contained_in(partition_pathkeys_desc, pathkeys)));
1813 
1814  /* Select the child paths for this ordering... */
1815  foreach(lcr, live_childrels)
1816  {
1817  RelOptInfo *childrel = (RelOptInfo *) lfirst(lcr);
1818  Path *cheapest_startup,
1819  *cheapest_total;
1820 
1821  /* Locate the right paths, if they are available. */
1822  cheapest_startup =
1824  pathkeys,
1825  NULL,
1826  STARTUP_COST,
1827  false);
1828  cheapest_total =
1830  pathkeys,
1831  NULL,
1832  TOTAL_COST,
1833  false);
1834 
1835  /*
1836  * If we can't find any paths with the right order just use the
1837  * cheapest-total path; we'll have to sort it later.
1838  */
1839  if (cheapest_startup == NULL || cheapest_total == NULL)
1840  {
1841  cheapest_startup = cheapest_total =
1842  childrel->cheapest_total_path;
1843  /* Assert we do have an unparameterized path for this child */
1844  Assert(cheapest_total->param_info == NULL);
1845  }
1846 
1847  /*
1848  * Notice whether we actually have different paths for the
1849  * "cheapest" and "total" cases; frequently there will be no point
1850  * in two create_merge_append_path() calls.
1851  */
1852  if (cheapest_startup != cheapest_total)
1853  startup_neq_total = true;
1854 
1855  /*
1856  * Collect the appropriate child paths. The required logic varies
1857  * for the Append and MergeAppend cases.
1858  */
1859  if (match_partition_order)
1860  {
1861  /*
1862  * We're going to make a plain Append path. We don't need
1863  * most of what accumulate_append_subpath would do, but we do
1864  * want to cut out child Appends or MergeAppends if they have
1865  * just a single subpath (and hence aren't doing anything
1866  * useful).
1867  */
1868  cheapest_startup = get_singleton_append_subpath(cheapest_startup);
1869  cheapest_total = get_singleton_append_subpath(cheapest_total);
1870 
1871  startup_subpaths = lappend(startup_subpaths, cheapest_startup);
1872  total_subpaths = lappend(total_subpaths, cheapest_total);
1873  }
1874  else if (match_partition_order_desc)
1875  {
1876  /*
1877  * As above, but we need to reverse the order of the children,
1878  * because nodeAppend.c doesn't know anything about reverse
1879  * ordering and will scan the children in the order presented.
1880  */
1881  cheapest_startup = get_singleton_append_subpath(cheapest_startup);
1882  cheapest_total = get_singleton_append_subpath(cheapest_total);
1883 
1884  startup_subpaths = lcons(cheapest_startup, startup_subpaths);
1885  total_subpaths = lcons(cheapest_total, total_subpaths);
1886  }
1887  else
1888  {
1889  /*
1890  * Otherwise, rely on accumulate_append_subpath to collect the
1891  * child paths for the MergeAppend.
1892  */
1893  accumulate_append_subpath(cheapest_startup,
1894  &startup_subpaths, NULL);
1895  accumulate_append_subpath(cheapest_total,
1896  &total_subpaths, NULL);
1897  }
1898  }
1899 
1900  /* ... and build the Append or MergeAppend paths */
1901  if (match_partition_order || match_partition_order_desc)
1902  {
1903  /* We only need Append */
1904  add_path(rel, (Path *) create_append_path(root,
1905  rel,
1906  startup_subpaths,
1907  NIL,
1908  pathkeys,
1909  NULL,
1910  0,
1911  false,
1912  partitioned_rels,
1913  -1));
1914  if (startup_neq_total)
1915  add_path(rel, (Path *) create_append_path(root,
1916  rel,
1917  total_subpaths,
1918  NIL,
1919  pathkeys,
1920  NULL,
1921  0,
1922  false,
1923  partitioned_rels,
1924  -1));
1925  }
1926  else
1927  {
1928  /* We need MergeAppend */
1929  add_path(rel, (Path *) create_merge_append_path(root,
1930  rel,
1931  startup_subpaths,
1932  pathkeys,
1933  NULL,
1934  partitioned_rels));
1935  if (startup_neq_total)
1936  add_path(rel, (Path *) create_merge_append_path(root,
1937  rel,
1938  total_subpaths,
1939  pathkeys,
1940  NULL,
1941  partitioned_rels));
1942  }
1943  }
1944 }
Path * get_cheapest_path_for_pathkeys(List *paths, List *pathkeys, Relids required_outer, CostSelector cost_criterion, bool require_parallel_safe)
Definition: pathkeys.c:404
#define NIL
Definition: pg_list.h:65
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
List * build_partition_pathkeys(PlannerInfo *root, RelOptInfo *partrel, ScanDirection scandir, bool *partialkeys)
Definition: pathkeys.c:699
ParamPathInfo * param_info
Definition: pathnodes.h:1147
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:638
struct Path * cheapest_total_path
Definition: pathnodes.h:683
int nparts
Definition: pathnodes.h:743
MergeAppendPath * create_merge_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *pathkeys, Relids required_outer, List *partitioned_rels)
Definition: pathnode.c:1345
static Path * get_singleton_append_subpath(Path *path)
Definition: allpaths.c:2088
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, List *pathkeys, Relids required_outer, int parallel_workers, bool parallel_aware, List *partitioned_rels, double rows)
Definition: pathnode.c:1183
List * lappend(List *list, void *datum)
Definition: list.c:321
bool pathkeys_contained_in(List *keys1, List *keys2)
Definition: pathkeys.c:324
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
List * lcons(void *datum, List *list)
Definition: list.c:453
bool partitions_are_ordered(PartitionBoundInfo boundinfo, int nparts)
Definition: partbounds.c:2746
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
static void accumulate_append_subpath(Path *path, List **subpaths, List **special_subpaths)
Definition: allpaths.c:2042
Definition: pg_list.h:50

◆ generate_partitionwise_join_paths()

void generate_partitionwise_join_paths ( PlannerInfo root,
RelOptInfo rel 
)

Definition at line 3876 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, RelOptInfo::consider_partitionwise_join, 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(), printf, RelOptInfo::relids, RelOptInfo::reltarget, RelOptInfo::rows, Path::rows, Query::rtable, set_cheapest(), PlannerInfo::simple_rte_array, Path::startup_cost, generate_unaccent_rules::stdout, subpath(), T_AggPath, T_AppendPath, T_BitmapAndPath, T_BitmapHeapPath, T_BitmapOrPath, T_CteScan, T_CustomPath, T_ForeignPath, T_FunctionScan, T_GatherMergePath, T_GatherPath, T_GroupingSetsPath, T_GroupPath, T_GroupResultPath, T_HashPath, T_IncrementalSortPath, T_IndexPath, T_LimitPath, T_LockRowsPath, T_MaterialPath, T_MergeAppendPath, T_MergePath, T_MinMaxAggPath, T_ModifyTablePath, T_NamedTuplestoreScan, T_NestPath, T_Path, T_ProjectionPath, T_ProjectSetPath, T_RecursiveUnionPath, T_Result, T_SampleScan, T_SeqScan, T_SetOpPath, T_SortPath, 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().

3877 {
3878  List *live_children = NIL;
3879  int cnt_parts;
3880  int num_parts;
3881  RelOptInfo **part_rels;
3882 
3883  /* Handle only join relations here. */
3884  if (!IS_JOIN_REL(rel))
3885  return;
3886 
3887  /* We've nothing to do if the relation is not partitioned. */
3888  if (!IS_PARTITIONED_REL(rel))
3889  return;
3890 
3891  /* The relation should have consider_partitionwise_join set. */
3893 
3894  /* Guard against stack overflow due to overly deep partition hierarchy. */
3896 
3897  num_parts = rel->nparts;
3898  part_rels = rel->part_rels;
3899 
3900  /* Collect non-dummy child-joins. */
3901  for (cnt_parts = 0; cnt_parts < num_parts; cnt_parts++)
3902  {
3903  RelOptInfo *child_rel = part_rels[cnt_parts];
3904 
3905  /* If it's been pruned entirely, it's certainly dummy. */
3906  if (child_rel == NULL)
3907  continue;
3908 
3909  /* Add partitionwise join paths for partitioned child-joins. */
3910  generate_partitionwise_join_paths(root, child_rel);
3911 
3912  set_cheapest(child_rel);
3913 
3914  /* Dummy children will not be scanned, so ignore those. */
3915  if (IS_DUMMY_REL(child_rel))
3916  continue;
3917 
3918 #ifdef OPTIMIZER_DEBUG
3919  debug_print_rel(root, child_rel);
3920 #endif
3921 
3922  live_children = lappend(live_children, child_rel);
3923  }
3924 
3925  /* If all child-joins are dummy, parent join is also dummy. */
3926  if (!live_children)
3927  {
3928  mark_dummy_rel(rel);
3929  return;
3930  }
3931 
3932  /* Build additional paths for this rel from child-join paths. */
3933  add_paths_to_append_rel(root, rel, live_children);
3934  list_free(live_children);
3935 }
#define NIL
Definition: pg_list.h:65
void add_paths_to_append_rel(PlannerInfo *root, RelOptInfo *rel, List *live_childrels)
Definition: allpaths.c:1294
void generate_partitionwise_join_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:3876
#define IS_JOIN_REL(rel)
Definition: pathnodes.h:643
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
void check_stack_depth(void)
Definition: postgres.c:3312
int nparts
Definition: pathnodes.h:743
List * lappend(List *list, void *datum)
Definition: list.c:321
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
bool consider_partitionwise_join
Definition: pathnodes.h:736
void mark_dummy_rel(RelOptInfo *rel)
Definition: joinrels.c:1261
#define Assert(condition)
Definition: c.h:738
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
#define IS_PARTITIONED_REL(rel)
Definition: pathnodes.h:766
void list_free(List *list)
Definition: list.c:1376
Definition: pg_list.h:50

◆ generate_useful_gather_paths()

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

Definition at line 2812 of file allpaths.c.

References add_path(), Assert, create_gather_merge_path(), create_incremental_sort_path(), create_sort_path(), enable_incrementalsort, generate_gather_paths(), get_useful_pathkeys_for_relation(), lfirst, linitial, list_length(), NIL, Path::parallel_workers, RelOptInfo::partial_pathlist, GatherMergePath::path, Path::pathkeys, pathkeys_count_contained_in(), 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().

2813 {
2814  ListCell *lc;
2815  double rows;
2816  double *rowsp = NULL;
2817  List *useful_pathkeys_list = NIL;
2818  Path *cheapest_partial_path = NULL;
2819 
2820  /* If there are no partial paths, there's nothing to do here. */
2821  if (rel->partial_pathlist == NIL)
2822  return;
2823 
2824  /* Should we override the rel's rowcount estimate? */
2825  if (override_rows)
2826  rowsp = &rows;
2827 
2828  /* generate the regular gather (merge) paths */
2829  generate_gather_paths(root, rel, override_rows);
2830 
2831  /* consider incremental sort for interesting orderings */
2832  useful_pathkeys_list = get_useful_pathkeys_for_relation(root, rel);
2833 
2834  /* used for explicit (full) sort paths */
2835  cheapest_partial_path = linitial(rel->partial_pathlist);
2836 
2837  /*
2838  * Consider incremental sort paths for each interesting ordering.
2839  */
2840  foreach(lc, useful_pathkeys_list)
2841  {
2842  List *useful_pathkeys = lfirst(lc);
2843  ListCell *lc2;
2844  bool is_sorted;
2845  int presorted_keys;
2846 
2847  foreach(lc2, rel->partial_pathlist)
2848  {
2849  Path *subpath = (Path *) lfirst(lc2);
2850  GatherMergePath *path;
2851 
2852  /*
2853  * If the path has no ordering at all, then we can't use either
2854  * incremental sort or rely on implict sorting with a gather merge.
2855  */
2856  if (subpath->pathkeys == NIL)
2857  continue;
2858 
2859  is_sorted = pathkeys_count_contained_in(useful_pathkeys,
2860  subpath->pathkeys,
2861  &presorted_keys);
2862 
2863  /*
2864  * We don't need to consider the case where a subpath is already
2865  * fully sorted because generate_gather_paths already creates a
2866  * gather merge path for every subpath that has pathkeys present.
2867  *
2868  * But since the subpath is already sorted, we know we don't need
2869  * to consider adding a sort (other either kind) on top of it, so
2870  * we can continue here.
2871  */
2872  if (is_sorted)
2873  continue;
2874 
2875  /*
2876  * Consider regular sort for the cheapest partial path (for each
2877  * useful pathkeys). We know the path is not sorted, because we'd
2878  * not get here otherwise.
2879  *
2880  * This is not redundant with the gather paths created in
2881  * generate_gather_paths, because that doesn't generate ordered
2882  * output. Here we add an explicit sort to match the useful
2883  * ordering.
2884  */
2885  if (cheapest_partial_path == subpath)
2886  {
2887  Path *tmp;
2888 
2889  tmp = (Path *) create_sort_path(root,
2890  rel,
2891  subpath,
2892  useful_pathkeys,
2893  -1.0);
2894 
2895  rows = tmp->rows * tmp->parallel_workers;
2896 
2897  path = create_gather_merge_path(root, rel,
2898  tmp,
2899  rel->reltarget,
2900  tmp->pathkeys,
2901  NULL,
2902  rowsp);
2903 
2904  add_path(rel, &path->path);
2905 
2906  /* Fall through */
2907  }
2908 
2909  /*
2910  * Consider incremental sort, but only when the subpath is already
2911  * partially sorted on a pathkey prefix.
2912  */
2913  if (enable_incrementalsort && presorted_keys > 0)
2914  {
2915  Path *tmp;
2916 
2917  /*
2918  * We should have already excluded pathkeys of length 1 because
2919  * then presorted_keys > 0 would imply is_sorted was true.
2920  */
2921  Assert(list_length(useful_pathkeys) != 1);
2922 
2923  tmp = (Path *) create_incremental_sort_path(root,
2924  rel,
2925  subpath,
2926  useful_pathkeys,
2927  presorted_keys,
2928  -1);
2929 
2930  path = create_gather_merge_path(root, rel,
2931  tmp,
2932  rel->reltarget,
2933  tmp->pathkeys,
2934  NULL,
2935  rowsp);
2936 
2937  add_path(rel, &path->path);
2938  }
2939  }
2940  }
2941 }
#define NIL
Definition: pg_list.h:65
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
SortPath * create_incremental_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, int presorted_keys, double limit_tuples)
Definition: pathnode.c:2769
int parallel_workers
Definition: pathnodes.h:1151
List * partial_pathlist
Definition: pathnodes.h:681
void generate_gather_paths(PlannerInfo *root, RelOptInfo *rel, bool override_rows)
Definition: allpaths.c:2682
bool pathkeys_count_contained_in(List *keys1, List *keys2, int *n_common)
Definition: pathkeys.c:343
#define linitial(l)
Definition: pg_list.h:195
static List * get_useful_pathkeys_for_relation(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:2749
GatherMergePath * create_gather_merge_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, PathTarget *target, List *pathkeys, Relids required_outer, double *rows)
Definition: pathnode.c:1754
SortPath * create_sort_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, List *pathkeys, double limit_tuples)
Definition: pathnode.c:2818
List * pathkeys
Definition: pathnodes.h:1158
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
double rows
Definition: pathnodes.h:1154
static int list_length(const List *l)
Definition: pg_list.h:169
bool enable_incrementalsort
Definition: costsize.c:131
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241

◆ get_cheapest_parameterized_child_path()

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

Definition at line 1954 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().

1956 {
1957  Path *cheapest;
1958  ListCell *lc;
1959 
1960  /*
1961  * Look up the cheapest existing path with no more than the needed
1962  * parameterization. If it has exactly the needed parameterization, we're
1963  * done.
1964  */
1965  cheapest = get_cheapest_path_for_pathkeys(rel->pathlist,
1966  NIL,
1967  required_outer,
1968  TOTAL_COST,
1969  false);
1970  Assert(cheapest != NULL);
1971  if (bms_equal(PATH_REQ_OUTER(cheapest), required_outer))
1972  return cheapest;
1973 
1974  /*
1975  * Otherwise, we can "reparameterize" an existing path to match the given
1976  * parameterization, which effectively means pushing down additional
1977  * joinquals to be checked within the path's scan. However, some existing
1978  * paths might check the available joinquals already while others don't;
1979  * therefore, it's not clear which existing path will be cheapest after
1980  * reparameterization. We have to go through them all and find out.
1981  */
1982  cheapest = NULL;
1983  foreach(lc, rel->pathlist)
1984  {
1985  Path *path = (Path *) lfirst(lc);
1986 
1987  /* Can't use it if it needs more than requested parameterization */
1988  if (!bms_is_subset(PATH_REQ_OUTER(path), required_outer))
1989  continue;
1990 
1991  /*
1992  * Reparameterization can only increase the path's cost, so if it's
1993  * already more expensive than the current cheapest, forget it.
1994  */
1995  if (cheapest != NULL &&
1996  compare_path_costs(cheapest, path, TOTAL_COST) <= 0)
1997  continue;
1998 
1999  /* Reparameterize if needed, then recheck cost */
2000  if (!bms_equal(PATH_REQ_OUTER(path), required_outer))
2001  {
2002  path = reparameterize_path(root, path, required_outer, 1.0);
2003  if (path == NULL)
2004  continue; /* failed to reparameterize this one */
2005  Assert(bms_equal(PATH_REQ_OUTER(path), required_outer));
2006 
2007  if (cheapest != NULL &&
2008  compare_path_costs(cheapest, path, TOTAL_COST) <= 0)
2009  continue;
2010  }
2011 
2012  /* We have a new best path */
2013  cheapest = path;
2014  }
2015 
2016  /* Return the best path, or NULL if we found no suitable candidate */
2017  return cheapest;
2018 }
Path * get_cheapest_path_for_pathkeys(List *paths, List *pathkeys, Relids required_outer, CostSelector cost_criterion, bool require_parallel_safe)
Definition: pathkeys.c:404
#define NIL
Definition: pg_list.h:65
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
int compare_path_costs(Path *path1, Path *path2, CostSelector criterion)
Definition: pathnode.c:71
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1163
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
Path * reparameterize_path(PlannerInfo *root, Path *path, Relids required_outer, double loop_count)
Definition: pathnode.c:3725
List * pathlist
Definition: pathnodes.h:679
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ get_singleton_append_subpath()

static Path * get_singleton_append_subpath ( Path path)
static

Definition at line 2088 of file allpaths.c.

References Assert, IsA, linitial, list_length(), Path::parallel_aware, AppendPath::subpaths, and MergeAppendPath::subpaths.

Referenced by generate_orderedappend_paths().

2089 {
2090  Assert(!path->parallel_aware);
2091 
2092  if (IsA(path, AppendPath))
2093  {
2094  AppendPath *apath = (AppendPath *) path;
2095 
2096  if (list_length(apath->subpaths) == 1)
2097  return (Path *) linitial(apath->subpaths);
2098  }
2099  else if (IsA(path, MergeAppendPath))
2100  {
2101  MergeAppendPath *mpath = (MergeAppendPath *) path;
2102 
2103  if (list_length(mpath->subpaths) == 1)
2104  return (Path *) linitial(mpath->subpaths);
2105  }
2106 
2107  return path;
2108 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
List * subpaths
Definition: pathnodes.h:1404
#define linitial(l)
Definition: pg_list.h:195
#define Assert(condition)
Definition: c.h:738
static int list_length(const List *l)
Definition: pg_list.h:169
bool parallel_aware
Definition: pathnodes.h:1149

◆ get_useful_pathkeys_for_relation()

static List* get_useful_pathkeys_for_relation ( PlannerInfo root,
RelOptInfo rel 
)
static

Definition at line 2749 of file allpaths.c.

References find_em_expr_for_rel(), lappend(), lfirst, list_copy(), list_length(), list_truncate(), NIL, PathKey::pk_eclass, and PlannerInfo::query_pathkeys.

Referenced by generate_useful_gather_paths().

2750 {
2751  List *useful_pathkeys_list = NIL;
2752 
2753  /*
2754  * Considering query_pathkeys is always worth it, because it might allow us
2755  * to avoid a total sort when we have a partially presorted path available.
2756  */
2757  if (root->query_pathkeys)
2758  {
2759  ListCell *lc;
2760  int npathkeys = 0; /* useful pathkeys */
2761 
2762  foreach(lc, root->query_pathkeys)
2763  {
2764  PathKey *pathkey = (PathKey *) lfirst(lc);
2765  EquivalenceClass *pathkey_ec = pathkey->pk_eclass;
2766 
2767  /*
2768  * We can only build an Incremental Sort for pathkeys which contain
2769  * an EC member in the current relation, so ignore any suffix of the
2770  * list as soon as we find a pathkey without an EC member the
2771  * relation.
2772  *
2773  * By still returning the prefix of the pathkeys list that does meet
2774  * criteria of EC membership in the current relation, we enable not
2775  * just an incremental sort on the entirety of query_pathkeys but
2776  * also incremental sort below a JOIN.
2777  */
2778  if (!find_em_expr_for_rel(pathkey_ec, rel))
2779  break;
2780 
2781  npathkeys++;
2782  }
2783 
2784  /*
2785  * The whole query_pathkeys list matches, so append it directly, to allow
2786  * comparing pathkeys easily by comparing list pointer. If we have to truncate
2787  * the pathkeys, we gotta do a copy though.
2788  */
2789  if (npathkeys == list_length(root->query_pathkeys))
2790  useful_pathkeys_list = lappend(useful_pathkeys_list,
2791  root->query_pathkeys);
2792  else if (npathkeys > 0)
2793  useful_pathkeys_list = lappend(useful_pathkeys_list,
2795  npathkeys));
2796  }
2797 
2798  return useful_pathkeys_list;
2799 }
#define NIL
Definition: pg_list.h:65
List * query_pathkeys
Definition: pathnodes.h:298
List * list_truncate(List *list, int new_size)
Definition: list.c:585
List * list_copy(const List *oldlist)
Definition: list.c:1403
List * lappend(List *list, void *datum)
Definition: list.c:321
Expr * find_em_expr_for_rel(EquivalenceClass *ec, RelOptInfo *rel)
Definition: equivclass.c:782
#define lfirst(lc)
Definition: pg_list.h:190
EquivalenceClass * pk_eclass
Definition: pathnodes.h:1041
static int list_length(const List *l)
Definition: pg_list.h:169
Definition: pg_list.h:50

◆ has_multiple_baserels()

static bool has_multiple_baserels ( PlannerInfo root)
static

Definition at line 2148 of file allpaths.c.

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

Referenced by set_subquery_pathlist().

2149 {
2150  int num_base_rels = 0;
2151  Index rti;
2152 
2153  for (rti = 1; rti < root->simple_rel_array_size; rti++)
2154  {
2155  RelOptInfo *brel = root->simple_rel_array[rti];
2156 
2157  if (brel == NULL)
2158  continue;
2159 
2160  /* ignore RTEs that are "other rels" */
2161  if (brel->reloptkind == RELOPT_BASEREL)
2162  if (++num_base_rels > 1)
2163  return true;
2164  }
2165  return false;
2166 }
RelOptKind reloptkind
Definition: pathnodes.h:662
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
int simple_rel_array_size
Definition: pathnodes.h:204
unsigned int Index
Definition: c.h:475

◆ make_one_rel()

RelOptInfo* make_one_rel ( PlannerInfo root,
List joinlist 
)

Definition at line 152 of file allpaths.c.

References PlannerInfo::all_baserels, Assert, bms_add_member(), bms_equal(), IS_DUMMY_REL, IS_SIMPLE_REL, make_rel_from_joinlist(), RelOptInfo::pages, 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, PlannerInfo::simple_rel_array_size, and PlannerInfo::total_table_pages.

Referenced by query_planner().

153 {
154  RelOptInfo *rel;
155  Index rti;
156  double total_pages;
157 
158  /*
159  * Construct the all_baserels Relids set.
160  */
161  root->all_baserels = NULL;
162  for (rti = 1; rti < root->simple_rel_array_size; rti++)
163  {
164  RelOptInfo *brel = root->simple_rel_array[rti];
165 
166  /* there may be empty slots corresponding to non-baserel RTEs */
167  if (brel == NULL)
168  continue;
169 
170  Assert(brel->relid == rti); /* sanity check on array */
171 
172  /* ignore RTEs that are "other rels" */
173  if (brel->reloptkind != RELOPT_BASEREL)
174  continue;
175 
176  root->all_baserels = bms_add_member(root->all_baserels, brel->relid);
177  }
178 
179  /* Mark base rels as to whether we care about fast-start plans */
181 
182  /*
183  * Compute size estimates and consider_parallel flags for each base rel.
184  */
185  set_base_rel_sizes(root);
186 
187  /*
188  * We should now have size estimates for every actual table involved in
189  * the query, and we also know which if any have been deleted from the
190  * query by join removal, pruned by partition pruning, or eliminated by
191  * constraint exclusion. So we can now compute total_table_pages.
192  *
193  * Note that appendrels are not double-counted here, even though we don't
194  * bother to distinguish RelOptInfos for appendrel parents, because the
195  * parents will have pages = 0.
196  *
197  * XXX if a table is self-joined, we will count it once per appearance,
198  * which perhaps is the wrong thing ... but that's not completely clear,
199  * and detecting self-joins here is difficult, so ignore it for now.
200  */
201  total_pages = 0;
202  for (rti = 1; rti < root->simple_rel_array_size; rti++)
203  {
204  RelOptInfo *brel = root->simple_rel_array[rti];
205 
206  if (brel == NULL)
207  continue;
208 
209  Assert(brel->relid == rti); /* sanity check on array */
210 
211  if (IS_DUMMY_REL(brel))
212  continue;
213 
214  if (IS_SIMPLE_REL(brel))
215  total_pages += (double) brel->pages;
216  }
217  root->total_table_pages = total_pages;
218 
219  /*
220  * Generate access paths for each base rel.
221  */
223 
224  /*
225  * Generate access paths for the entire join tree.
226  */
227  rel = make_rel_from_joinlist(root, joinlist);
228 
229  /*
230  * The result should join all and only the query's base rels.
231  */
232  Assert(bms_equal(rel->relids, root->all_baserels));
233 
234  return rel;
235 }
RelOptKind reloptkind
Definition: pathnodes.h:662
static void set_base_rel_sizes(PlannerInfo *root)
Definition: allpaths.c:291
static void set_base_rel_consider_startup(PlannerInfo *root)
Definition: allpaths.c:248
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:638
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
Relids all_baserels
Definition: pathnodes.h:227
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
static RelOptInfo * make_rel_from_joinlist(PlannerInfo *root, List *joinlist)
Definition: allpaths.c:2951
Relids relids
Definition: pathnodes.h:665
double total_table_pages
Definition: pathnodes.h:333
int simple_rel_array_size
Definition: pathnodes.h:204
Index relid
Definition: pathnodes.h:693
static void set_base_rel_pathlists(PlannerInfo *root)
Definition: allpaths.c:334
unsigned int Index
Definition: c.h:475
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:738
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:736
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ make_rel_from_joinlist()

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

Definition at line 2951 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().

2952 {
2953  int levels_needed;
2954  List *initial_rels;
2955  ListCell *jl;
2956 
2957  /*
2958  * Count the number of child joinlist nodes. This is the depth of the
2959  * dynamic-programming algorithm we must employ to consider all ways of
2960  * joining the child nodes.
2961  */
2962  levels_needed = list_length(joinlist);
2963 
2964  if (levels_needed <= 0)
2965  return NULL; /* nothing to do? */
2966 
2967  /*
2968  * Construct a list of rels corresponding to the child joinlist nodes.
2969  * This may contain both base rels and rels constructed according to
2970  * sub-joinlists.
2971  */
2972  initial_rels = NIL;
2973  foreach(jl, joinlist)
2974  {
2975  Node *jlnode = (Node *) lfirst(jl);
2976  RelOptInfo *thisrel;
2977 
2978  if (IsA(jlnode, RangeTblRef))
2979  {
2980  int varno = ((RangeTblRef *) jlnode)->rtindex;
2981 
2982  thisrel = find_base_rel(root, varno);
2983  }
2984  else if (IsA(jlnode, List))
2985  {
2986  /* Recurse to handle subproblem */
2987  thisrel = make_rel_from_joinlist(root, (List *) jlnode);
2988  }
2989  else
2990  {
2991  elog(ERROR, "unrecognized joinlist node type: %d",
2992  (int) nodeTag(jlnode));
2993  thisrel = NULL; /* keep compiler quiet */
2994  }
2995 
2996  initial_rels = lappend(initial_rels, thisrel);
2997  }
2998 
2999  if (levels_needed == 1)
3000  {
3001  /*
3002  * Single joinlist node, so we're done.
3003  */
3004  return (RelOptInfo *) linitial(initial_rels);
3005  }
3006  else
3007  {
3008  /*
3009  * Consider the different orders in which we could join the rels,
3010  * using a plugin, GEQO, or the regular join search code.
3011  *
3012  * We put the initial_rels list into a PlannerInfo field because
3013  * has_legal_joinclause() needs to look at it (ugly :-().
3014  */
3015  root->initial_rels = initial_rels;
3016 
3017  if (join_search_hook)
3018  return (*join_search_hook) (root, levels_needed, initial_rels);
3019  else if (enable_geqo && levels_needed >= geqo_threshold)
3020  return geqo(root, levels_needed, initial_rels);
3021  else
3022  return standard_join_search(root, levels_needed, initial_rels);
3023  }
3024 }
RelOptInfo * standard_join_search(PlannerInfo *root, int levels_needed, List *initial_rels)
Definition: allpaths.c:3056
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
Definition: nodes.h:529
#define linitial(l)
Definition: pg_list.h:195
#define ERROR
Definition: elog.h:43
bool enable_geqo
Definition: allpaths.c:62
static RelOptInfo * make_rel_from_joinlist(PlannerInfo *root, List *joinlist)
Definition: allpaths.c:2951
List * lappend(List *list, void *datum)
Definition: list.c:321
join_search_hook_type join_search_hook
Definition: allpaths.c:71
int geqo_threshold
Definition: allpaths.c:63
RelOptInfo * geqo(PlannerInfo *root, int number_of_rels, List *initial_rels)
Definition: geqo_main.c:67
#define lfirst(lc)
Definition: pg_list.h:190
static int list_length(const List *l)
Definition: pg_list.h:169
#define nodeTag(nodeptr)
Definition: nodes.h:534
#define elog(elevel,...)
Definition: elog.h:214
List * initial_rels
Definition: pathnodes.h:308
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:375
Definition: pg_list.h:50

◆ qual_is_pushdown_safe()

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

Definition at line 3476 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().

3478 {
3479  bool safe = true;
3480  List *vars;
3481  ListCell *vl;
3482 
3483  /* Refuse subselects (point 1) */
3484  if (contain_subplans(qual))
3485  return false;
3486 
3487  /* Refuse volatile quals if we found they'd be unsafe (point 2) */
3488  if (safetyInfo->unsafeVolatile &&
3490  return false;
3491 
3492  /* Refuse leaky quals if told to (point 3) */
3493  if (safetyInfo->unsafeLeaky &&
3494  contain_leaked_vars(qual))
3495  return false;
3496 
3497  /*
3498  * It would be unsafe to push down window function calls, but at least for
3499  * the moment we could never see any in a qual anyhow. (The same applies
3500  * to aggregates, which we check for in pull_var_clause below.)
3501  */
3503 
3504  /*
3505  * Examine all Vars used in clause; since it's a restriction clause, all
3506  * such Vars must refer to subselect output columns.
3507  */
3509  foreach(vl, vars)
3510  {
3511  Var *var = (Var *) lfirst(vl);
3512 
3513  /*
3514  * XXX Punt if we find any PlaceHolderVars in the restriction clause.
3515  * It's not clear whether a PHV could safely be pushed down, and even
3516  * less clear whether such a situation could arise in any cases of
3517  * practical interest anyway. So for the moment, just refuse to push
3518  * down.
3519  */
3520  if (!IsA(var, Var))
3521  {
3522  safe = false;
3523  break;
3524  }
3525 
3526  Assert(var->varno == rti);
3527  Assert(var->varattno >= 0);
3528 
3529  /* Check point 4 */
3530  if (var->varattno == 0)
3531  {
3532  safe = false;
3533  break;
3534  }
3535 
3536  /* Check point 5 */
3537  if (safetyInfo->unsafeColumns[var->varattno])
3538  {
3539  safe = false;
3540  break;
3541  }
3542  }
3543 
3544  list_free(vars);
3545 
3546  return safe;
3547 }
bool contain_leaked_vars(Node *clause)
Definition: clauses.c:1329
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
AttrNumber varattno
Definition: primnodes.h:186
bool * unsafeColumns
Definition: allpaths.c:56
List * pull_var_clause(Node *node, int flags)
Definition: var.c:535
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:726
Definition: primnodes.h:181
bool contain_subplans(Node *clause)
Definition: clauses.c:612
bool contain_window_function(Node *clause)
Definition: clauses.c:496
Index varno
Definition: primnodes.h:184
#define PVC_INCLUDE_PLACEHOLDERS
Definition: optimizer.h:175
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
void list_free(List *list)
Definition: list.c:1376
Definition: regcomp.c:224
Definition: pg_list.h:50

◆ recurse_push_qual()

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

Definition at line 3600 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().

3602 {
3603  if (IsA(setOp, RangeTblRef))
3604  {
3605  RangeTblRef *rtr = (RangeTblRef *) setOp;
3606  RangeTblEntry *subrte = rt_fetch(rtr->rtindex, topquery->rtable);
3607  Query *subquery = subrte->subquery;
3608 
3609  Assert(subquery != NULL);
3610  subquery_push_qual(subquery, rte, rti, qual);
3611  }
3612  else if (IsA(setOp, SetOperationStmt))
3613  {
3614  SetOperationStmt *op = (SetOperationStmt *) setOp;
3615 
3616  recurse_push_qual(op->larg, topquery, rte, rti, qual);
3617  recurse_push_qual(op->rarg, topquery, rte, rti, qual);
3618  }
3619  else
3620  {
3621  elog(ERROR, "unrecognized node type: %d",
3622  (int) nodeTag(setOp));
3623  }
3624 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
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:738
static void subquery_push_qual(Query *subquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3553
static void recurse_push_qual(Node *setOp, Query *topquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3600
#define nodeTag(nodeptr)
Definition: nodes.h:534
Query * subquery
Definition: parsenodes.h:1011
#define elog(elevel,...)
Definition: elog.h:214

◆ recurse_pushdown_safe()

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

Definition at line 3266 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().

3268 {
3269  if (IsA(setOp, RangeTblRef))
3270  {
3271  RangeTblRef *rtr = (RangeTblRef *) setOp;
3272  RangeTblEntry *rte = rt_fetch(rtr->rtindex, topquery->rtable);
3273  Query *subquery = rte->subquery;
3274 
3275  Assert(subquery != NULL);
3276  return subquery_is_pushdown_safe(subquery, topquery, safetyInfo);
3277  }
3278  else if (IsA(setOp, SetOperationStmt))
3279  {
3280  SetOperationStmt *op = (SetOperationStmt *) setOp;
3281 
3282  /* EXCEPT is no good (point 2 for subquery_is_pushdown_safe) */
3283  if (op->op == SETOP_EXCEPT)
3284  return false;
3285  /* Else recurse */
3286  if (!recurse_pushdown_safe(op->larg, topquery, safetyInfo))
3287  return false;
3288  if (!recurse_pushdown_safe(op->rarg, topquery, safetyInfo))
3289  return false;
3290  }
3291  else
3292  {
3293  elog(ERROR, "unrecognized node type: %d",
3294  (int) nodeTag(setOp));
3295  }
3296  return true;
3297 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
static bool recurse_pushdown_safe(Node *setOp, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3266
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:738
SetOperation op
Definition: parsenodes.h:1658
#define nodeTag(nodeptr)
Definition: nodes.h:534
static bool subquery_is_pushdown_safe(Query *subquery, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3214
Query * subquery
Definition: parsenodes.h:1011
#define elog(elevel,...)
Definition: elog.h:214

◆ remove_unused_subquery_outputs()

static void remove_unused_subquery_outputs ( Query subquery,
RelOptInfo rel 
)
static

Definition at line 3647 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().

3648 {
3649  Bitmapset *attrs_used = NULL;
3650  ListCell *lc;
3651 
3652  /*
3653  * Do nothing if subquery has UNION/INTERSECT/EXCEPT: in principle we
3654  * could update all the child SELECTs' tlists, but it seems not worth the
3655  * trouble presently.
3656  */
3657  if (subquery->setOperations)
3658  return;
3659 
3660  /*
3661  * If subquery has regular DISTINCT (not DISTINCT ON), we're wasting our
3662  * time: all its output columns must be used in the distinctClause.
3663  */
3664  if (subquery->distinctClause && !subquery->hasDistinctOn)
3665  return;
3666 
3667  /*
3668  * Collect a bitmap of all the output column numbers used by the upper
3669  * query.
3670  *
3671  * Add all the attributes needed for joins or final output. Note: we must
3672  * look at rel's targetlist, not the attr_needed data, because attr_needed
3673  * isn't computed for inheritance child rels, cf set_append_rel_size().
3674  * (XXX might be worth changing that sometime.)
3675  */
3676  pull_varattnos((Node *) rel->reltarget->exprs, rel->relid, &attrs_used);
3677 
3678  /* Add all the attributes used by un-pushed-down restriction clauses. */
3679  foreach(lc, rel->baserestrictinfo)
3680  {
3681  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
3682 
3683  pull_varattnos((Node *) rinfo->clause, rel->relid, &attrs_used);
3684  }
3685 
3686  /*
3687  * If there's a whole-row reference to the subquery, we can't remove
3688  * anything.
3689  */
3691  return;
3692 
3693  /*
3694  * Run through the tlist and zap entries we don't need. It's okay to
3695  * modify the tlist items in-place because set_subquery_pathlist made a
3696  * copy of the subquery.
3697  */
3698  foreach(lc, subquery->targetList)
3699  {
3700  TargetEntry *tle = (TargetEntry *) lfirst(lc);
3701  Node *texpr = (Node *) tle->expr;
3702 
3703  /*
3704  * If it has a sortgroupref number, it's used in some sort/group
3705  * clause so we'd better not remove it. Also, don't remove any
3706  * resjunk columns, since their reason for being has nothing to do
3707  * with anybody reading the subquery's output. (It's likely that
3708  * resjunk columns in a sub-SELECT would always have ressortgroupref
3709  * set, but even if they don't, it seems imprudent to remove them.)
3710  */
3711  if (tle->ressortgroupref || tle->resjunk)
3712  continue;
3713 
3714  /*
3715  * If it's used by the upper query, we can't remove it.
3716  */
3718  attrs_used))
3719  continue;
3720 
3721  /*
3722  * If it contains a set-returning function, we can't remove it since
3723  * that could change the number of rows returned by the subquery.
3724  */
3725  if (subquery->hasTargetSRFs &&
3726  expression_returns_set(texpr))
3727  continue;
3728 
3729  /*
3730  * If it contains volatile functions, we daren't remove it for fear
3731  * that the user is expecting their side-effects to happen.
3732  */
3733  if (contain_volatile_functions(texpr))
3734  continue;
3735 
3736  /*
3737  * OK, we don't need it. Replace the expression with a NULL constant.
3738  * Preserve the exposed type of the expression, in case something
3739  * looks at the rowtype of the subquery's result.
3740  */
3741  tle->expr = (Expr *) makeNullConst(exprType(texpr),
3742  exprTypmod(texpr),
3743  exprCollation(texpr));
3744  }
3745 }
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:275
List * baserestrictinfo
Definition: pathnodes.h:727
bool expression_returns_set(Node *clause)
Definition: nodeFuncs.c:669
Definition: nodes.h:529
#define FirstLowInvalidHeapAttributeNumber
Definition: sysattr.h:27
bool contain_volatile_functions(Node *clause)
Definition: clauses.c:726
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:335
bool resjunk
Definition: primnodes.h:1414
List * distinctClause
Definition: parsenodes.h:156
AttrNumber resno
Definition: primnodes.h:1408
Index relid
Definition: pathnodes.h:693
Expr * clause
Definition: pathnodes.h:1985
List * exprs
Definition: pathnodes.h:1074
bool hasTargetSRFs
Definition: parsenodes.h:127
#define lfirst(lc)
Definition: pg_list.h:190
Expr * expr
Definition: primnodes.h:1407
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:719
Node * setOperations
Definition: parsenodes.h:166
Index ressortgroupref
Definition: primnodes.h:1410
bool bms_is_member(int x, const Bitmapset *a)
Definition: bitmapset.c:427
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ set_append_rel_pathlist()

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

Definition at line 1218 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(), 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().

1220 {
1221  int parentRTindex = rti;
1222  List *live_childrels = NIL;
1223  ListCell *l;
1224 
1225  /*
1226  * Generate access paths for each member relation, and remember the
1227  * non-dummy children.
1228  */
1229  foreach(l, root->append_rel_list)
1230  {
1231  AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
1232  int childRTindex;
1233  RangeTblEntry *childRTE;
1234  RelOptInfo *childrel;
1235 
1236  /* append_rel_list contains all append rels; ignore others */
1237  if (appinfo->parent_relid != parentRTindex)
1238  continue;
1239 
1240  /* Re-locate the child RTE and RelOptInfo */
1241  childRTindex = appinfo->child_relid;
1242  childRTE = root->simple_rte_array[childRTindex];
1243  childrel = root->simple_rel_array[childRTindex];
1244 
1245  /*
1246  * If set_append_rel_size() decided the parent appendrel was
1247  * parallel-unsafe at some point after visiting this child rel, we
1248  * need to propagate the unsafety marking down to the child, so that
1249  * we don't generate useless partial paths for it.
1250  */
1251  if (!rel->consider_parallel)
1252  childrel->consider_parallel = false;
1253 
1254  /*
1255  * Compute the child's access paths.
1256  */
1257  set_rel_pathlist(root, childrel, childRTindex, childRTE);
1258 
1259  /*
1260  * If child is dummy, ignore it.
1261  */
1262  if (IS_DUMMY_REL(childrel))
1263  continue;
1264 
1265  /* Bubble up childrel's partitioned children. */
1266  if (rel->part_scheme)
1267  rel->partitioned_child_rels =
1269  childrel->partitioned_child_rels);
1270 
1271  /*
1272  * Child is live, so add it to the live_childrels list for use below.
1273  */
1274  live_childrels = lappend(live_childrels, childrel);
1275  }
1276 
1277  /* Add paths to the append relation. */
1278  add_paths_to_append_rel(root, rel, live_childrels);
1279 }
#define NIL
Definition: pg_list.h:65
void add_paths_to_append_rel(PlannerInfo *root, RelOptInfo *rel, List *live_childrels)
Definition: allpaths.c:1294
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
List * lappend(List *list, void *datum)
Definition: list.c:321
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
List * append_rel_list
Definition: pathnodes.h:290
static void set_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:470
#define lfirst(lc)
Definition: pg_list.h:190
bool consider_parallel
Definition: pathnodes.h:673
List * partitioned_child_rels
Definition: pathnodes.h:755
PartitionScheme part_scheme
Definition: pathnodes.h:742
Index child_relid
Definition: pathnodes.h:2230
Index parent_relid
Definition: pathnodes.h:2229
Definition: pg_list.h:50

◆ set_append_rel_size()

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

Definition at line 939 of file allpaths.c.

References add_child_rel_equivalences(), adjust_appendrel_attrs(), PlannerInfo::append_rel_list, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, check_stack_depth(), AppendRelInfo::child_relid, RelOptInfo::consider_parallel, RelOptInfo::consider_partitionwise_join, enable_partitionwise_join, PathTarget::exprs, exprType(), exprTypmod(), find_base_rel(), forboth, get_typavgwidth(), PlannerInfo::glob, RelOptInfo::has_eclass_joins, has_useful_pathkeys(), i, InvalidAttrNumber, IS_DUMMY_REL, IS_SIMPLE_REL, IsA, RelOptInfo::joininfo, lfirst, list_make1_int, RelOptInfo::max_attr, RelOptInfo::min_attr, palloc0(), PlannerGlobal::parallelModeOK, AppendRelInfo::parent_relid, RelOptInfo::partitioned_child_rels, pfree(), relation_excluded_by_constraints(), RelOptInfo::relid, RangeTblEntry::relkind, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, set_dummy_rel_pathlist(), set_rel_consider_parallel(), set_rel_size(), PlannerInfo::simple_rte_array, RelOptInfo::tuples, Var::varattno, and PathTarget::width.

Referenced by set_rel_size().

941 {
942  int parentRTindex = rti;
943  bool has_live_children;
944  double parent_rows;
945  double parent_size;
946  double *parent_attrsizes;
947  int nattrs;
948  ListCell *l;
949 
950  /* Guard against stack overflow due to overly deep inheritance tree. */
952 
953  Assert(IS_SIMPLE_REL(rel));
954 
955  /*
956  * Initialize partitioned_child_rels to contain this RT index.
957  *
958  * Note that during the set_append_rel_pathlist() phase, we will bubble up
959  * the indexes of partitioned relations that appear down in the tree, so
960  * that when we've created Paths for all the children, the root
961  * partitioned table's list will contain all such indexes.
962  */
963  if (rte->relkind == RELKIND_PARTITIONED_TABLE)
965 
966  /*
967  * If this is a partitioned baserel, set the consider_partitionwise_join
968  * flag; currently, we only consider partitionwise joins with the baserel
969  * if its targetlist doesn't contain a whole-row Var.
970  */
972  rel->reloptkind == RELOPT_BASEREL &&
973  rte->relkind == RELKIND_PARTITIONED_TABLE &&
974  rel->attr_needed[InvalidAttrNumber - rel->min_attr] == NULL)
975  rel->consider_partitionwise_join = true;
976 
977  /*
978  * Initialize to compute size estimates for whole append relation.
979  *
980  * We handle width estimates by weighting the widths of different child
981  * rels proportionally to their number of rows. This is sensible because
982  * the use of width estimates is mainly to compute the total relation
983  * "footprint" if we have to sort or hash it. To do this, we sum the
984  * total equivalent size (in "double" arithmetic) and then divide by the
985  * total rowcount estimate. This is done separately for the total rel
986  * width and each attribute.
987  *
988  * Note: if you consider changing this logic, beware that child rels could
989  * have zero rows and/or width, if they were excluded by constraints.
990  */
991  has_live_children = false;
992  parent_rows = 0;
993  parent_size = 0;
994  nattrs = rel->max_attr - rel->min_attr + 1;
995  parent_attrsizes = (double *) palloc0(nattrs * sizeof(double));
996 
997  foreach(l, root->append_rel_list)
998  {
999  AppendRelInfo *appinfo = (AppendRelInfo *) lfirst(l);
1000  int childRTindex;
1001  RangeTblEntry *childRTE;
1002  RelOptInfo *childrel;
1003  ListCell *parentvars;
1004  ListCell *childvars;
1005 
1006  /* append_rel_list contains all append rels; ignore others */
1007  if (appinfo->parent_relid != parentRTindex)
1008  continue;
1009 
1010  childRTindex = appinfo->child_relid;
1011  childRTE = root->simple_rte_array[childRTindex];
1012 
1013  /*
1014  * The child rel's RelOptInfo was already created during
1015  * add_other_rels_to_query.
1016  */
1017  childrel = find_base_rel(root, childRTindex);
1019 
1020  /* We may have already proven the child to be dummy. */
1021  if (IS_DUMMY_REL(childrel))
1022  continue;
1023 
1024  /*
1025  * We have to copy the parent's targetlist and quals to the child,
1026  * with appropriate substitution of variables. However, the
1027  * baserestrictinfo quals were already copied/substituted when the
1028  * child RelOptInfo was built. So we don't need any additional setup
1029  * before applying constraint exclusion.
1030  */
1031  if (relation_excluded_by_constraints(root, childrel, childRTE))
1032  {
1033  /*
1034  * This child need not be scanned, so we can omit it from the
1035  * appendrel.
1036  */
1037  set_dummy_rel_pathlist(childrel);
1038  continue;
1039  }
1040 
1041  /*
1042  * Constraint exclusion failed, so copy the parent's join quals and
1043  * targetlist to the child, with appropriate variable substitutions.
1044  *
1045  * NB: the resulting childrel->reltarget->exprs may contain arbitrary
1046  * expressions, which otherwise would not occur in a rel's targetlist.
1047  * Code that might be looking at an appendrel child must cope with
1048  * such. (Normally, a rel's targetlist would only include Vars and
1049  * PlaceHolderVars.) XXX we do not bother to update the cost or width
1050  * fields of childrel->reltarget; not clear if that would be useful.
1051  */
1052  childrel->joininfo = (List *)
1054  (Node *) rel->joininfo,
1055  1, &appinfo);
1056  childrel->reltarget->exprs = (List *)
1058  (Node *) rel->reltarget->exprs,
1059  1, &appinfo);
1060 
1061  /*
1062  * We have to make child entries in the EquivalenceClass data
1063  * structures as well. This is needed either if the parent
1064  * participates in some eclass joins (because we will want to consider
1065  * inner-indexscan joins on the individual children) or if the parent
1066  * has useful pathkeys (because we should try to build MergeAppend
1067  * paths that produce those sort orderings).
1068  */
1069  if (rel->has_eclass_joins || has_useful_pathkeys(root, rel))
1070  add_child_rel_equivalences(root, appinfo, rel, childrel);
1071  childrel->has_eclass_joins = rel->has_eclass_joins;
1072 
1073  /*
1074  * Note: we could compute appropriate attr_needed data for the child's
1075  * variables, by transforming the parent's attr_needed through the
1076  * translated_vars mapping. However, currently there's no need
1077  * because attr_needed is only examined for base relations not
1078  * otherrels. So we just leave the child's attr_needed empty.
1079  */
1080 
1081  /*
1082  * If we consider partitionwise joins with the parent rel, do the same
1083  * for partitioned child rels.
1084  *
1085  * Note: here we abuse the consider_partitionwise_join flag by setting
1086  * it for child rels that are not themselves partitioned. We do so to
1087  * tell try_partitionwise_join() that the child rel is sufficiently
1088  * valid to be used as a per-partition input, even if it later gets
1089  * proven to be dummy. (It's not usable until we've set up the
1090  * reltarget and EC entries, which we just did.)
1091  */
1092  if (rel->consider_partitionwise_join)
1093  childrel->consider_partitionwise_join = true;
1094 
1095  /*
1096  * If parallelism is allowable for this query in general, see whether
1097  * it's allowable for this childrel in particular. But if we've
1098  * already decided the appendrel is not parallel-safe as a whole,
1099  * there's no point in considering parallelism for this child. For
1100  * consistency, do this before calling set_rel_size() for the child.
1101  */
1102  if (root->glob->parallelModeOK && rel->consider_parallel)
1103  set_rel_consider_parallel(root, childrel, childRTE);
1104 
1105  /*
1106  * Compute the child's size.
1107  */
1108  set_rel_size(root, childrel, childRTindex, childRTE);
1109 
1110  /*
1111  * It is possible that constraint exclusion detected a contradiction
1112  * within a child subquery, even though we didn't prove one above. If
1113  * so, we can skip this child.
1114  */
1115  if (IS_DUMMY_REL(childrel))
1116  continue;
1117 
1118  /* We have at least one live child. */
1119  has_live_children = true;
1120 
1121  /*
1122  * If any live child is not parallel-safe, treat the whole appendrel
1123  * as not parallel-safe. In future we might be able to generate plans
1124  * in which some children are farmed out to workers while others are
1125  * not; but we don't have that today, so it's a waste to consider
1126  * partial paths anywhere in the appendrel unless it's all safe.
1127  * (Child rels visited before this one will be unmarked in
1128  * set_append_rel_pathlist().)
1129  */
1130  if (!childrel->consider_parallel)
1131  rel->consider_parallel = false;
1132 
1133  /*
1134  * Accumulate size information from each live child.
1135  */
1136  Assert(childrel->rows > 0);
1137 
1138  parent_rows += childrel->rows;
1139  parent_size += childrel->reltarget->width * childrel->rows;
1140 
1141  /*
1142  * Accumulate per-column estimates too. We need not do anything for
1143  * PlaceHolderVars in the parent list. If child expression isn't a
1144  * Var, or we didn't record a width estimate for it, we have to fall
1145  * back on a datatype-based estimate.
1146  *
1147  * By construction, child's targetlist is 1-to-1 with parent's.
1148  */
1149  forboth(parentvars, rel->reltarget->exprs,
1150  childvars, childrel->reltarget->exprs)
1151  {
1152  Var *parentvar = (Var *) lfirst(parentvars);
1153  Node *childvar = (Node *) lfirst(childvars);
1154 
1155  if (IsA(parentvar, Var))
1156  {
1157  int pndx = parentvar->varattno - rel->min_attr;
1158  int32 child_width = 0;
1159 
1160  if (IsA(childvar, Var) &&
1161  ((Var *) childvar)->varno == childrel->relid)
1162  {
1163  int cndx = ((Var *) childvar)->varattno - childrel->min_attr;
1164 
1165  child_width = childrel->attr_widths[cndx];
1166  }
1167  if (child_width <= 0)
1168  child_width = get_typavgwidth(exprType(childvar),
1169  exprTypmod(childvar));
1170  Assert(child_width > 0);
1171  parent_attrsizes[pndx] += child_width * childrel->rows;
1172  }
1173  }
1174  }
1175 
1176  if (has_live_children)
1177  {
1178  /*
1179  * Save the finished size estimates.
1180  */
1181  int i;
1182 
1183  Assert(parent_rows > 0);
1184  rel->rows = parent_rows;
1185  rel->reltarget->width = rint(parent_size / parent_rows);
1186  for (i = 0; i < nattrs; i++)
1187  rel->attr_widths[i] = rint(parent_attrsizes[i] / parent_rows);
1188 
1189  /*
1190  * Set "raw tuples" count equal to "rows" for the appendrel; needed
1191  * because some places assume rel->tuples is valid for any baserel.
1192  */
1193  rel->tuples = parent_rows;
1194 
1195  /*
1196  * Note that we leave rel->pages as zero; this is important to avoid
1197  * double-counting the appendrel tree in total_table_pages.
1198  */
1199  }
1200  else
1201  {
1202  /*
1203  * All children were excluded by constraints, so mark the whole
1204  * appendrel dummy. We must do this in this phase so that the rel's
1205  * dummy-ness is visible when we generate paths for other rels.
1206  */
1208  }
1209 
1210  pfree(parent_attrsizes);
1211 }
bool has_eclass_joins
Definition: pathnodes.h:733
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
#define forboth(cell1, list1, cell2, list2)
Definition: pg_list.h:419
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
int32 exprTypmod(const Node *expr)
Definition: nodeFuncs.c:275
double tuples
Definition: pathnodes.h:705
bool relation_excluded_by_constraints(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: plancat.c:1387
Definition: nodes.h:529
AttrNumber varattno
Definition: primnodes.h:186
void add_child_rel_equivalences(PlannerInfo *root, AppendRelInfo *appinfo, RelOptInfo *parent_rel, RelOptInfo *child_rel)
Definition: equivclass.c:2256
Definition: primnodes.h:181
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:638
signed int int32
Definition: c.h:355
void pfree(void *pointer)
Definition: mcxt.c:1056
bool parallelModeOK
Definition: pathnodes.h:143
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
static void set_rel_consider_parallel(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:591
static void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:2122
List * joininfo
Definition: pathnodes.h:731
void check_stack_depth(void)
Definition: postgres.c:3312
PlannerGlobal * glob
Definition: pathnodes.h:181
#define list_make1_int(x1)
Definition: pg_list.h:238
Index relid
Definition: pathnodes.h:693
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
List * exprs
Definition: pathnodes.h:1074
bool consider_partitionwise_join
Definition: pathnodes.h:736
void * palloc0(Size size)
Definition: mcxt.c:980
List * append_rel_list
Definition: pathnodes.h:290
int32 get_typavgwidth(Oid typid, int32 typmod)
Definition: lsyscache.c:2417
double rows
Definition: pathnodes.h:668
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
bool enable_partitionwise_join
Definition: costsize.c:140
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
bool consider_parallel
Definition: pathnodes.h:673
#define InvalidAttrNumber
Definition: attnum.h:23
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
int i
bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel)
Definition: pathkeys.c:1910
Index child_relid
Definition: pathnodes.h:2230
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:375
Index parent_relid
Definition: pathnodes.h:2229
int32 * attr_widths
Definition: pathnodes.h:699
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
static void set_rel_size(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:361
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:194
AttrNumber min_attr
Definition: pathnodes.h:696

◆ set_base_rel_consider_startup()

static void set_base_rel_consider_startup ( PlannerInfo root)
static

Definition at line 248 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().

249 {
250  /*
251  * Since parameterized paths can only be used on the inside of a nestloop
252  * join plan, there is usually little value in considering fast-start
253  * plans for them. However, for relations that are on the RHS of a SEMI
254  * or ANTI join, a fast-start plan can be useful because we're only going
255  * to care about fetching one tuple anyway.
256  *
257  * To minimize growth of planning time, we currently restrict this to
258  * cases where the RHS is a single base relation, not a join; there is no
259  * provision for consider_param_startup to get set at all on joinrels.
260  * Also we don't worry about appendrels. costsize.c's costing rules for
261  * nestloop semi/antijoins don't consider such cases either.
262  */
263  ListCell *lc;
264 
265  foreach(lc, root->join_info_list)
266  {
267  SpecialJoinInfo *sjinfo = (SpecialJoinInfo *) lfirst(lc);
268  int varno;
269 
270  if ((sjinfo->jointype == JOIN_SEMI || sjinfo->jointype == JOIN_ANTI) &&
271  bms_get_singleton_member(sjinfo->syn_righthand, &varno))
272  {
273  RelOptInfo *rel = find_base_rel(root, varno);
274 
275  rel->consider_param_startup = true;
276  }
277  }
278 }
List * join_info_list
Definition: pathnodes.h:283
bool consider_param_startup
Definition: pathnodes.h:672
bool bms_get_singleton_member(const Bitmapset *a, int *member)
Definition: bitmapset.c:615
Relids syn_righthand
Definition: pathnodes.h:2178
#define lfirst(lc)
Definition: pg_list.h:190
JoinType jointype
Definition: pathnodes.h:2179
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:375

◆ set_base_rel_pathlists()

static void set_base_rel_pathlists ( PlannerInfo root)
static

Definition at line 334 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().

335 {
336  Index rti;
337 
338  for (rti = 1; rti < root->simple_rel_array_size; rti++)
339  {
340  RelOptInfo *rel = root->simple_rel_array[rti];
341 
342  /* there may be empty slots corresponding to non-baserel RTEs */
343  if (rel == NULL)
344  continue;
345 
346  Assert(rel->relid == rti); /* sanity check on array */
347 
348  /* ignore RTEs that are "other rels" */
349  if (rel->reloptkind != RELOPT_BASEREL)
350  continue;
351 
352  set_rel_pathlist(root, rel, rti, root->simple_rte_array[rti]);
353  }
354 }
RelOptKind reloptkind
Definition: pathnodes.h:662
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
int simple_rel_array_size
Definition: pathnodes.h:204
Index relid
Definition: pathnodes.h:693
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
unsigned int Index
Definition: c.h:475
static void set_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:470
#define Assert(condition)
Definition: c.h:738

◆ set_base_rel_sizes()

static void set_base_rel_sizes ( PlannerInfo root)
static

Definition at line 291 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().

292 {
293  Index rti;
294 
295  for (rti = 1; rti < root->simple_rel_array_size; rti++)
296  {
297  RelOptInfo *rel = root->simple_rel_array[rti];
298  RangeTblEntry *rte;
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  rte = root->simple_rte_array[rti];
311 
312  /*
313  * If parallelism is allowable for this query in general, see whether
314  * it's allowable for this rel in particular. We have to do this
315  * before set_rel_size(), because (a) if this rel is an inheritance
316  * parent, set_append_rel_size() will use and perhaps change the rel's
317  * consider_parallel flag, and (b) for some RTE types, set_rel_size()
318  * goes ahead and makes paths immediately.
319  */
320  if (root->glob->parallelModeOK)
321  set_rel_consider_parallel(root, rel, rte);
322 
323  set_rel_size(root, rel, rti, rte);
324  }
325 }
RelOptKind reloptkind
Definition: pathnodes.h:662
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
bool parallelModeOK
Definition: pathnodes.h:143
static void set_rel_consider_parallel(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:591
PlannerGlobal * glob
Definition: pathnodes.h:181
int simple_rel_array_size
Definition: pathnodes.h:204
Index relid
Definition: pathnodes.h:693
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
unsigned int Index
Definition: c.h:475
#define Assert(condition)
Definition: c.h:738
static void set_rel_size(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:361

◆ set_cte_pathlist()

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

Definition at line 2497 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().

2498 {
2499  Plan *cteplan;
2500  PlannerInfo *cteroot;
2501  Index levelsup;
2502  int ndx;
2503  ListCell *lc;
2504  int plan_id;
2505  Relids required_outer;
2506 
2507  /*
2508  * Find the referenced CTE, and locate the plan previously made for it.
2509  */
2510  levelsup = rte->ctelevelsup;
2511  cteroot = root;
2512  while (levelsup-- > 0)
2513  {
2514  cteroot = cteroot->parent_root;
2515  if (!cteroot) /* shouldn't happen */
2516  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
2517  }
2518 
2519  /*
2520  * Note: cte_plan_ids can be shorter than cteList, if we are still working
2521  * on planning the CTEs (ie, this is a side-reference from another CTE).
2522  * So we mustn't use forboth here.
2523  */
2524  ndx = 0;
2525  foreach(lc, cteroot->parse->cteList)
2526  {
2527  CommonTableExpr *cte = (CommonTableExpr *) lfirst(lc);
2528 
2529  if (strcmp(cte->ctename, rte->ctename) == 0)
2530  break;
2531  ndx++;
2532  }
2533  if (lc == NULL) /* shouldn't happen */
2534  elog(ERROR, "could not find CTE \"%s\"", rte->ctename);
2535  if (ndx >= list_length(cteroot->cte_plan_ids))
2536  elog(ERROR, "could not find plan for CTE \"%s\"", rte->ctename);
2537  plan_id = list_nth_int(cteroot->cte_plan_ids, ndx);
2538  Assert(plan_id > 0);
2539  cteplan = (Plan *) list_nth(root->glob->subplans, plan_id - 1);
2540 
2541  /* Mark rel with estimated output rows, width, etc */
2542  set_cte_size_estimates(root, rel, cteplan->plan_rows);
2543 
2544  /*
2545  * We don't support pushing join clauses into the quals of a CTE scan, but
2546  * it could still have required parameterization due to LATERAL refs in
2547  * its tlist.
2548  */
2549  required_outer = rel->lateral_relids;
2550 
2551  /* Generate appropriate path */
2552  add_path(rel, create_ctescan_path(root, rel, required_outer));
2553 }
double plan_rows
Definition: plannodes.h:129
Query * parse
Definition: pathnodes.h:179
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
PlannerInfo * parent_root
Definition: pathnodes.h:185
void set_cte_size_estimates(PlannerInfo *root, RelOptInfo *rel, double cte_rows)
Definition: costsize.c:5270
static int list_nth_int(const List *list, int n)
Definition: pg_list.h:288
Relids lateral_relids
Definition: pathnodes.h:690
#define ERROR
Definition: elog.h:43
static void * list_nth(const List *list, int n)
Definition: pg_list.h:277
List * subplans
Definition: pathnodes.h:111
PlannerGlobal * glob
Definition: pathnodes.h:181
List * cte_plan_ids
Definition: pathnodes.h:261
unsigned int Index
Definition: c.h:475
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
static int list_length(const List *l)
Definition: pg_list.h:169
Index ctelevelsup
Definition: parsenodes.h:1080
List * cteList
Definition: parsenodes.h:135
char * ctename
Definition: parsenodes.h:1079
#define elog(elevel,...)
Definition: elog.h:214
Path * create_ctescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1990

◆ set_dummy_rel_pathlist()

static void set_dummy_rel_pathlist ( RelOptInfo rel)
static

Definition at line 2122 of file allpaths.c.

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

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

2123 {
2124  /* Set dummy size estimates --- we leave attr_widths[] as zeroes */
2125  rel->rows = 0;
2126  rel->reltarget->width = 0;
2127 
2128  /* Discard any pre-existing paths; no further need for them */
2129  rel->pathlist = NIL;
2130  rel->partial_pathlist = NIL;
2131 
2132  /* Set up the dummy path */
2133  add_path(rel, (Path *) create_append_path(NULL, rel, NIL, NIL,
2134  NIL, rel->lateral_relids,
2135  0, false, NIL, -1));
2136 
2137  /*
2138  * We set the cheapest-path fields immediately, just in case they were
2139  * pointing at some discarded path. This is redundant when we're called
2140  * from set_rel_size(), but not when called from elsewhere, and doing it
2141  * twice is harmless anyway.
2142  */
2143  set_cheapest(rel);
2144 }
#define NIL
Definition: pg_list.h:65
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
List * partial_pathlist
Definition: pathnodes.h:681
Relids lateral_relids
Definition: pathnodes.h:690
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, List *pathkeys, Relids required_outer, int parallel_workers, bool parallel_aware, List *partitioned_rels, double rows)
Definition: pathnode.c:1183
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
double rows
Definition: pathnodes.h:668
List * pathlist
Definition: pathnodes.h:679
struct PathTarget * reltarget
Definition: pathnodes.h:676

◆ set_foreign_pathlist()

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

Definition at line 921 of file allpaths.c.

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

Referenced by set_rel_pathlist().

922 {
923  /* Call the FDW's GetForeignPaths function to generate path(s) */
924  rel->fdwroutine->GetForeignPaths(root, rel, rte->relid);
925 }
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
GetForeignPaths_function GetForeignPaths
Definition: fdwapi.h:189

◆ set_foreign_size()

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

Definition at line 904 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().

905 {
906  /* Mark rel with estimated output rows, width, etc */
907  set_foreign_size_estimates(root, rel);
908 
909  /* Let FDW adjust the size estimates, if it can */
910  rel->fdwroutine->GetForeignRelSize(root, rel, rte->relid);
911 
912  /* ... but do not let it set the rows estimate to zero */
913  rel->rows = clamp_row_est(rel->rows);
914 }
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
GetForeignRelSize_function GetForeignRelSize
Definition: fdwapi.h:188
double rows
Definition: pathnodes.h:668
void set_foreign_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5369
double clamp_row_est(double nrows)
Definition: costsize.c:191

◆ set_function_pathlist()

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

Definition at line 2385 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().

2386 {
2387  Relids required_outer;
2388  List *pathkeys = NIL;
2389 
2390  /*
2391  * We don't support pushing join clauses into the quals of a function
2392  * scan, but it could still have required parameterization due to LATERAL
2393  * refs in the function expression.
2394  */
2395  required_outer = rel->lateral_relids;
2396 
2397  /*
2398  * The result is considered unordered unless ORDINALITY was used, in which
2399  * case it is ordered by the ordinal column (the last one). See if we
2400  * care, by checking for uses of that Var in equivalence classes.
2401  */
2402  if (rte->funcordinality)
2403  {
2404  AttrNumber ordattno = rel->max_attr;
2405  Var *var = NULL;
2406  ListCell *lc;
2407 
2408  /*
2409  * Is there a Var for it in rel's targetlist? If not, the query did
2410  * not reference the ordinality column, or at least not in any way
2411  * that would be interesting for sorting.
2412  */
2413  foreach(lc, rel->reltarget->exprs)
2414  {
2415  Var *node = (Var *) lfirst(lc);
2416 
2417  /* checking varno/varlevelsup is just paranoia */
2418  if (IsA(node, Var) &&
2419  node->varattno == ordattno &&
2420  node->varno == rel->relid &&
2421  node->varlevelsup == 0)
2422  {
2423  var = node;
2424  break;
2425  }
2426  }
2427 
2428  /*
2429  * Try to build pathkeys for this Var with int8 sorting. We tell
2430  * build_expression_pathkey not to build any new equivalence class; if
2431  * the Var isn't already mentioned in some EC, it means that nothing
2432  * cares about the ordering.
2433  */
2434  if (var)
2435  pathkeys = build_expression_pathkey(root,
2436  (Expr *) var,
2437  NULL, /* below outer joins */
2438  Int8LessOperator,
2439  rel->relids,
2440  false);
2441  }
2442 
2443  /* Generate appropriate path */
2444  add_path(rel, create_functionscan_path(root, rel,
2445  pathkeys, required_outer));
2446 }
#define NIL
Definition: pg_list.h:65
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
List * build_expression_pathkey(PlannerInfo *root, Expr *expr, Relids nullable_relids, Oid opno, Relids rel, bool create_it)
Definition: pathkeys.c:782
Index varlevelsup
Definition: primnodes.h:191
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
AttrNumber varattno
Definition: primnodes.h:186
bool funcordinality
Definition: parsenodes.h:1064
Definition: primnodes.h:181
Path * create_functionscan_path(PlannerInfo *root, RelOptInfo *rel, List *pathkeys, Relids required_outer)
Definition: pathnode.c:1912
Relids lateral_relids
Definition: pathnodes.h:690
Relids relids
Definition: pathnodes.h:665
Index relid
Definition: pathnodes.h:693
Index varno
Definition: primnodes.h:184
List * exprs
Definition: pathnodes.h:1074
#define lfirst(lc)
Definition: pg_list.h:190
AttrNumber max_attr
Definition: pathnodes.h:697
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
int16 AttrNumber
Definition: attnum.h:21

◆ set_namedtuplestore_pathlist()

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

Definition at line 2563 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().

2565 {
2566  Relids required_outer;
2567 
2568  /* Mark rel with estimated output rows, width, etc */
2570 
2571  /*
2572  * We don't support pushing join clauses into the quals of a tuplestore
2573  * scan, but it could still have required parameterization due to LATERAL
2574  * refs in its tlist.
2575  */
2576  required_outer = rel->lateral_relids;
2577 
2578  /* Generate appropriate path */
2579  add_path(rel, create_namedtuplestorescan_path(root, rel, required_outer));
2580 
2581  /* Select cheapest path (pretty easy in this case...) */
2582  set_cheapest(rel);
2583 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
Relids lateral_relids
Definition: pathnodes.h:690
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
void set_namedtuplestore_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5307
Path * create_namedtuplestorescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2015

◆ set_plain_rel_pathlist()

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

Definition at line 766 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().

767 {
768  Relids required_outer;
769 
770  /*
771  * We don't support pushing join clauses into the quals of a seqscan, but
772  * it could still have required parameterization due to LATERAL refs in
773  * its tlist.
774  */
775  required_outer = rel->lateral_relids;
776 
777  /* Consider sequential scan */
778  add_path(rel, create_seqscan_path(root, rel, required_outer, 0));
779 
780  /* If appropriate, consider parallel sequential scan */
781  if (rel->consider_parallel && required_outer == NULL)
782  create_plain_partial_paths(root, rel);
783 
784  /* Consider index scans */
785  create_index_paths(root, rel);
786 
787  /* Consider TID scans */
788  create_tidscan_paths(root, rel);
789 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
void create_index_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:232
Relids lateral_relids
Definition: pathnodes.h:690
void create_tidscan_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: tidpath.c:385
bool consider_parallel
Definition: pathnodes.h:673
static void create_plain_partial_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:796
Path * create_seqscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer, int parallel_workers)
Definition: pathnode.c:929

◆ set_plain_rel_size()

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

Definition at line 574 of file allpaths.c.

References check_index_predicates(), and set_baserel_size_estimates().

Referenced by set_rel_size().

575 {
576  /*
577  * Test any partial indexes of rel for applicability. We must do this
578  * first since partial unique indexes can affect size estimates.
579  */
580  check_index_predicates(root, rel);
581 
582  /* Mark rel with estimated output rows, width, etc */
583  set_baserel_size_estimates(root, rel);
584 }
void check_index_predicates(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:3395
void set_baserel_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4590

◆ set_rel_consider_parallel()

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

Definition at line 591 of file allpaths.c.

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

Referenced by set_append_rel_size(), and set_base_rel_sizes().

593 {
594  /*
595  * The flag has previously been initialized to false, so we can just
596  * return if it becomes clear that we can't safely set it.
597  */
598  Assert(!rel->consider_parallel);
599 
600  /* Don't call this if parallelism is disallowed for the entire query. */
601  Assert(root->glob->parallelModeOK);
602 
603  /* This should only be called for baserels and appendrel children. */
604  Assert(IS_SIMPLE_REL(rel));
605 
606  /* Assorted checks based on rtekind. */
607  switch (rte->rtekind)
608  {
609  case RTE_RELATION:
610 
611  /*
612  * Currently, parallel workers can't access the leader's temporary
613  * tables. We could possibly relax this if we wrote all of its
614  * local buffers at the start of the query and made no changes
615  * thereafter (maybe we could allow hint bit changes), and if we
616  * taught the workers to read them. Writing a large number of
617  * temporary buffers could be expensive, though, and we don't have
618  * the rest of the necessary infrastructure right now anyway. So
619  * for now, bail out if we see a temporary table.
620  */
621  if (get_rel_persistence(rte->relid) == RELPERSISTENCE_TEMP)
622  return;
623 
624  /*
625  * Table sampling can be pushed down to workers if the sample
626  * function and its arguments are safe.
627  */
628  if (rte->tablesample != NULL)
629  {
630  char proparallel = func_parallel(rte->tablesample->tsmhandler);
631 
632  if (proparallel != PROPARALLEL_SAFE)
633  return;
634  if (!is_parallel_safe(root, (Node *) rte->tablesample->args))
635  return;
636  }
637 
638  /*
639  * Ask FDWs whether they can support performing a ForeignScan
640  * within a worker. Most often, the answer will be no. For
641  * example, if the nature of the FDW is such that it opens a TCP
642  * connection with a remote server, each parallel worker would end
643  * up with a separate connection, and these connections might not
644  * be appropriately coordinated between workers and the leader.
645  */
646  if (rte->relkind == RELKIND_FOREIGN_TABLE)
647  {
648  Assert(rel->fdwroutine);
650  return;
651  if (!rel->fdwroutine->IsForeignScanParallelSafe(root, rel, rte))
652  return;
653  }
654 
655  /*
656  * There are additional considerations for appendrels, which we'll
657  * deal with in set_append_rel_size and set_append_rel_pathlist.
658  * For now, just set consider_parallel based on the rel's own
659  * quals and targetlist.
660  */
661  break;
662 
663  case RTE_SUBQUERY:
664 
665  /*
666  * There's no intrinsic problem with scanning a subquery-in-FROM
667  * (as distinct from a SubPlan or InitPlan) in a parallel worker.
668  * If the subquery doesn't happen to have any parallel-safe paths,
669  * then flagging it as consider_parallel won't change anything,
670  * but that's true for plain tables, too. We must set
671  * consider_parallel based on the rel's own quals and targetlist,
672  * so that if a subquery path is parallel-safe but the quals and
673  * projection we're sticking onto it are not, we correctly mark
674  * the SubqueryScanPath as not parallel-safe. (Note that
675  * set_subquery_pathlist() might push some of these quals down
676  * into the subquery itself, but that doesn't change anything.)
677  *
678  * We can't push sub-select containing LIMIT/OFFSET to workers as
679  * there is no guarantee that the row order will be fully
680  * deterministic, and applying LIMIT/OFFSET will lead to
681  * inconsistent results at the top-level. (In some cases, where
682  * the result is ordered, we could relax this restriction. But it
683  * doesn't currently seem worth expending extra effort to do so.)
684  */
685  {
686  Query *subquery = castNode(Query, rte->subquery);
687 
688  if (limit_needed(subquery))
689  return;
690  }
691  break;
692 
693  case RTE_JOIN:
694  /* Shouldn't happen; we're only considering baserels here. */
695  Assert(false);
696  return;
697 
698  case RTE_FUNCTION:
699  /* Check for parallel-restricted functions. */
700  if (!is_parallel_safe(root, (Node *) rte->functions))
701  return;
702  break;
703 
704  case RTE_TABLEFUNC:
705  /* not parallel safe */
706  return;
707 
708  case RTE_VALUES:
709  /* Check for parallel-restricted functions. */
710  if (!is_parallel_safe(root, (Node *) rte->values_lists))
711  return;
712  break;
713 
714  case RTE_CTE:
715 
716  /*
717  * CTE tuplestores aren't shared among parallel workers, so we
718  * force all CTE scans to happen in the leader. Also, populating
719  * the CTE would require executing a subplan that's not available
720  * in the worker, might be parallel-restricted, and must get
721  * executed only once.
722  */
723  return;
724 
725  case RTE_NAMEDTUPLESTORE:
726 
727  /*
728  * tuplestore cannot be shared, at least without more
729  * infrastructure to support that.
730  */
731  return;
732 
733  case RTE_RESULT:
734  /* RESULT RTEs, in themselves, are no problem. */
735  break;
736  }
737 
738  /*
739  * If there's anything in baserestrictinfo that's parallel-restricted, we
740  * give up on parallelizing access to this relation. We could consider
741  * instead postponing application of the restricted quals until we're
742  * above all the parallelism in the plan tree, but it's not clear that
743  * that would be a win in very many cases, and it might be tricky to make
744  * outer join clauses work correctly. It would likely break equivalence
745  * classes, too.
746  */
747  if (!is_parallel_safe(root, (Node *) rel->baserestrictinfo))
748  return;
749 
750  /*
751  * Likewise, if the relation's outputs are not parallel-safe, give up.
752  * (Usually, they're just Vars, but sometimes they're not.)
753  */
754  if (!is_parallel_safe(root, (Node *) rel->reltarget->exprs))
755  return;
756 
757  /* We have a winner. */
758  rel->consider_parallel = true;
759 }
#define castNode(_type_, nodeptr)
Definition: nodes.h:598
List * baserestrictinfo
Definition: pathnodes.h:727
bool limit_needed(Query *parse)
Definition: planner.c:3012
Definition: nodes.h:529
List * values_lists
Definition: parsenodes.h:1074
#define IS_SIMPLE_REL(rel)
Definition: pathnodes.h:638
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:856
IsForeignScanParallelSafe_function IsForeignScanParallelSafe
Definition: fdwapi.h:240
bool parallelModeOK
Definition: pathnodes.h:143
PlannerGlobal * glob
Definition: pathnodes.h:181
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
List * exprs
Definition: pathnodes.h:1074
#define Assert(condition)
Definition: c.h:738
List * functions
Definition: parsenodes.h:1063
char func_parallel(Oid funcid)
Definition: lsyscache.c:1662
bool consider_parallel
Definition: pathnodes.h:673
char get_rel_persistence(Oid relid)
Definition: lsyscache.c:1941
RTEKind rtekind
Definition: parsenodes.h:976
Query * subquery
Definition: parsenodes.h:1011
struct PathTarget * reltarget
Definition: pathnodes.h:676
struct TableSampleClause * tablesample
Definition: parsenodes.h:1006

◆ set_rel_pathlist()

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

Definition at line 470 of file allpaths.c.

References bms_membership(), BMS_SINGLETON, elog, ERROR, generate_useful_gather_paths(), RangeTblEntry::inh, IS_DUMMY_REL, RangeTblEntry::relkind, RELOPT_BASEREL, RTE_CTE, RTE_FUNCTION, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_RESULT, 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().

472 {
473  if (IS_DUMMY_REL(rel))
474  {
475  /* We already proved the relation empty, so nothing more to do */
476  }
477  else if (rte->inh)
478  {
479  /* It's an "append relation", process accordingly */
480  set_append_rel_pathlist(root, rel, rti, rte);
481  }
482  else
483  {
484  switch (rel->rtekind)
485  {
486  case RTE_RELATION:
487  if (rte->relkind == RELKIND_FOREIGN_TABLE)
488  {
489  /* Foreign table */
490  set_foreign_pathlist(root, rel, rte);
491  }
492  else if (rte->tablesample != NULL)
493  {
494  /* Sampled relation */
495  set_tablesample_rel_pathlist(root, rel, rte);
496  }
497  else
498  {
499  /* Plain relation */
500  set_plain_rel_pathlist(root, rel, rte);
501  }
502  break;
503  case RTE_SUBQUERY:
504  /* Subquery --- fully handled during set_rel_size */
505  break;
506  case RTE_FUNCTION:
507  /* RangeFunction */
508  set_function_pathlist(root, rel, rte);
509  break;
510  case RTE_TABLEFUNC:
511  /* Table Function */
512  set_tablefunc_pathlist(root, rel, rte);
513  break;
514  case RTE_VALUES:
515  /* Values list */
516  set_values_pathlist(root, rel, rte);
517  break;
518  case RTE_CTE:
519  /* CTE reference --- fully handled during set_rel_size */
520  break;
521  case RTE_NAMEDTUPLESTORE:
522  /* tuplestore reference --- fully handled during set_rel_size */
523  break;
524  case RTE_RESULT:
525  /* simple Result --- fully handled during set_rel_size */
526  break;
527  default:
528  elog(ERROR, "unexpected rtekind: %d", (int) rel->rtekind);
529  break;
530  }
531  }
532 
533  /*
534  * Allow a plugin to editorialize on the set of Paths for this base
535  * relation. It could add new paths (such as CustomPaths) by calling
536  * add_path(), or add_partial_path() if parallel aware. It could also
537  * delete or modify paths added by the core code.
538  */
540  (*set_rel_pathlist_hook) (root, rel, rti, rte);
541 
542  /*
543  * If this is a baserel, we should normally consider gathering any partial
544  * paths we may have created for it. We have to do this after calling the
545  * set_rel_pathlist_hook, else it cannot add partial paths to be included
546  * here.
547  *
548  * However, if this is an inheritance child, skip it. Otherwise, we could
549  * end up with a very large number of gather nodes, each trying to grab
550  * its own pool of workers. Instead, we'll consider gathering partial
551  * paths for the parent appendrel.
552  *
553  * Also, if this is the topmost scan/join rel (that is, the only baserel),
554  * we postpone gathering until the final scan/join targetlist is available
555  * (see grouping_planner).
556  */
557  if (rel->reloptkind == RELOPT_BASEREL &&
558  bms_membership(root->all_baserels) != BMS_SINGLETON)
559  generate_useful_gather_paths(root, rel, false);
560 
561  /* Now find the cheapest of the paths for this rel */
562  set_cheapest(rel);
563 
564 #ifdef OPTIMIZER_DEBUG
565  debug_print_rel(root, rel);
566 #endif
567 }
set_rel_pathlist_hook_type set_rel_pathlist_hook
Definition: allpaths.c:68
void generate_useful_gather_paths(PlannerInfo *root, RelOptInfo *rel, bool override_rows)
Definition: allpaths.c:2812
#define ERROR
Definition: elog.h:43
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
static void set_append_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:1218
static void set_foreign_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:921
static void set_plain_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:766
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
BMS_Membership bms_membership(const Bitmapset *a)
Definition: bitmapset.c:672
RTEKind rtekind
Definition: pathnodes.h:695
static void set_tablesample_rel_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:856
static void set_tablefunc_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2473
#define elog(elevel,...)
Definition: elog.h:214
static void set_function_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2385
static void set_values_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2453
struct TableSampleClause * tablesample
Definition: parsenodes.h:1006

◆ set_rel_size()

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

Definition at line 361 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_RESULT, 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_result_pathlist(), 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().

363 {
364  if (rel->reloptkind == RELOPT_BASEREL &&
365  relation_excluded_by_constraints(root, rel, rte))
366  {
367  /*
368  * We proved we don't need to scan the rel via constraint exclusion,
369  * so set up a single dummy path for it. Here we only check this for
370  * regular baserels; if it's an otherrel, CE was already checked in
371  * set_append_rel_size().
372  *
373  * In this case, we go ahead and set up the relation's path right away
374  * instead of leaving it for set_rel_pathlist to do. This is because
375  * we don't have a convention for marking a rel as dummy except by
376  * assigning a dummy path to it.
377  */
379  }
380  else if (rte->inh)
381  {
382  /* It's an "append relation", process accordingly */
383  set_append_rel_size(root, rel, rti, rte);
384  }
385  else
386  {
387  switch (rel->rtekind)
388  {
389  case RTE_RELATION:
390  if (rte->relkind == RELKIND_FOREIGN_TABLE)
391  {
392  /* Foreign table */
393  set_foreign_size(root, rel, rte);
394  }
395  else if (rte->relkind == RELKIND_PARTITIONED_TABLE)
396  {
397  /*
398  * We could get here if asked to scan a partitioned table
399  * with ONLY. In that case we shouldn't scan any of the
400  * partitions, so mark it as a dummy rel.
401  */
403  }
404  else if (rte->tablesample != NULL)
405  {
406  /* Sampled relation */
407  set_tablesample_rel_size(root, rel, rte);
408  }
409  else
410  {
411  /* Plain relation */
412  set_plain_rel_size(root, rel, rte);
413  }
414  break;
415  case RTE_SUBQUERY:
416 
417  /*
418  * Subqueries don't support making a choice between
419  * parameterized and unparameterized paths, so just go ahead
420  * and build their paths immediately.
421  */
422  set_subquery_pathlist(root, rel, rti, rte);
423  break;
424  case RTE_FUNCTION:
425  set_function_size_estimates(root, rel);
426  break;
427  case RTE_TABLEFUNC:
428  set_tablefunc_size_estimates(root, rel);
429  break;
430  case RTE_VALUES:
431  set_values_size_estimates(root, rel);
432  break;
433  case RTE_CTE:
434 
435  /*
436  * CTEs don't support making a choice between parameterized
437  * and unparameterized paths, so just go ahead and build their
438  * paths immediately.
439  */
440  if (rte->self_reference)
441  set_worktable_pathlist(root, rel, rte);
442  else
443  set_cte_pathlist(root, rel, rte);
444  break;
445  case RTE_NAMEDTUPLESTORE:
446  /* Might as well just build the path immediately */
447  set_namedtuplestore_pathlist(root, rel, rte);
448  break;
449  case RTE_RESULT:
450  /* Might as well just build the path immediately */
451  set_result_pathlist(root, rel, rte);
452  break;
453  default:
454  elog(ERROR, "unexpected rtekind: %d", (int) rel->rtekind);
455  break;
456  }
457  }
458 
459  /*
460  * We insist that all non-dummy rels have a nonzero rowcount estimate.
461  */
462  Assert(rel->rows > 0 || IS_DUMMY_REL(rel));
463 }
RelOptKind reloptkind
Definition: pathnodes.h:662
static void set_cte_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2497
static void set_foreign_size(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:904
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:2563
static void set_append_rel_size(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:939
static void set_result_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2593
#define ERROR
Definition: elog.h:43
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
static void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:2122
static void set_subquery_pathlist(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: allpaths.c:2181
static void set_tablesample_rel_size(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:816
bool self_reference
Definition: parsenodes.h:1081
RTEKind rtekind
Definition: pathnodes.h:695
double rows
Definition: pathnodes.h:668
#define Assert(condition)
Definition: c.h:738
void set_values_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5238
static void set_plain_rel_size(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:574
#define elog(elevel,...)
Definition: elog.h:214
void set_tablefunc_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5216
void set_function_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5178
struct TableSampleClause * tablesample
Definition: parsenodes.h:1006
static void set_worktable_pathlist(PlannerInfo *root, RelOptInfo *rel, RangeTblEntry *rte)
Definition: allpaths.c:2623

◆ set_result_pathlist()

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

Definition at line 2593 of file allpaths.c.

References add_path(), create_resultscan_path(), RelOptInfo::lateral_relids, set_cheapest(), and set_result_size_estimates().

Referenced by set_rel_size().

2595 {
2596  Relids required_outer;
2597 
2598  /* Mark rel with estimated output rows, width, etc */
2599  set_result_size_estimates(root, rel);
2600 
2601  /*
2602  * We don't support pushing join clauses into the quals of a Result scan,
2603  * but it could still have required parameterization due to LATERAL refs
2604  * in its tlist.
2605  */
2606  required_outer = rel->lateral_relids;
2607 
2608  /* Generate appropriate path */
2609  add_path(rel, create_resultscan_path(root, rel, required_outer));
2610 
2611  /* Select cheapest path (pretty easy in this case...) */
2612  set_cheapest(rel);
2613 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
Path * create_resultscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2041
void set_result_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5340
Relids lateral_relids
Definition: pathnodes.h:690
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244

◆ set_subquery_pathlist()

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

Definition at line 2181 of file allpaths.c.

References add_partial_path(), add_path(), Assert, RelOptInfo::baserestrictinfo, bms_is_empty(), 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().

2183 {
2184  Query *parse = root->parse;
2185  Query *subquery = rte->subquery;
2186  Relids required_outer;
2187  pushdown_safety_info safetyInfo;
2188  double tuple_fraction;
2189  RelOptInfo *sub_final_rel;
2190  ListCell *lc;
2191 
2192  /*
2193  * Must copy the Query so that planning doesn't mess up the RTE contents
2194  * (really really need to fix the planner to not scribble on its input,
2195  * someday ... but see remove_unused_subquery_outputs to start with).
2196  */
2197  subquery = copyObject(subquery);
2198 
2199  /*
2200  * If it's a LATERAL subquery, it might contain some Vars of the current
2201  * query level, requiring it to be treated as parameterized, even though
2202  * we don't support pushing down join quals into subqueries.
2203  */
2204  required_outer = rel->lateral_relids;
2205 
2206  /*
2207  * Zero out result area for subquery_is_pushdown_safe, so that it can set
2208  * flags as needed while recursing. In particular, we need a workspace
2209  * for keeping track of unsafe-to-reference columns. unsafeColumns[i]
2210  * will be set true if we find that output column i of the subquery is
2211  * unsafe to use in a pushed-down qual.
2212  */
2213  memset(&safetyInfo, 0, sizeof(safetyInfo));
2214  safetyInfo.unsafeColumns = (bool *)
2215  palloc0((list_length(subquery->targetList) + 1) * sizeof(bool));
2216 
2217  /*
2218  * If the subquery has the "security_barrier" flag, it means the subquery
2219  * originated from a view that must enforce row level security. Then we
2220  * must not push down quals that contain leaky functions. (Ideally this
2221  * would be checked inside subquery_is_pushdown_safe, but since we don't
2222  * currently pass the RTE to that function, we must do it here.)
2223  */
2224  safetyInfo.unsafeLeaky = rte->security_barrier;
2225 
2226  /*
2227  * If there are any restriction clauses that have been attached to the
2228  * subquery relation, consider pushing them down to become WHERE or HAVING
2229  * quals of the subquery itself. This transformation is useful because it
2230  * may allow us to generate a better plan for the subquery than evaluating
2231  * all the subquery output rows and then filtering them.
2232  *
2233  * There are several cases where we cannot push down clauses. Restrictions
2234  * involving the subquery are checked by subquery_is_pushdown_safe().
2235  * Restrictions on individual clauses are checked by
2236  * qual_is_pushdown_safe(). Also, we don't want to push down
2237  * pseudoconstant clauses; better to have the gating node above the
2238  * subquery.
2239  *
2240  * Non-pushed-down clauses will get evaluated as qpquals of the
2241  * SubqueryScan node.
2242  *
2243  * XXX Are there any cases where we want to make a policy decision not to
2244  * push down a pushable qual, because it'd result in a worse plan?
2245  */
2246  if (rel->baserestrictinfo != NIL &&
2247  subquery_is_pushdown_safe(subquery, subquery, &safetyInfo))
2248  {
2249  /* OK to consider pushing down individual quals */
2250  List *upperrestrictlist = NIL;
2251  ListCell *l;
2252 
2253  foreach(l, rel->baserestrictinfo)
2254  {
2255  RestrictInfo *rinfo = (RestrictInfo *) lfirst(l);
2256  Node *clause = (Node *) rinfo->clause;
2257 
2258  if (!rinfo->pseudoconstant &&
2259  qual_is_pushdown_safe(subquery, rti, clause, &safetyInfo))
2260  {
2261  /* Push it down */
2262  subquery_push_qual(subquery, rte, rti, clause);
2263  }
2264  else
2265  {
2266  /* Keep it in the upper query */
2267  upperrestrictlist = lappend(upperrestrictlist, rinfo);
2268  }
2269  }
2270  rel->baserestrictinfo = upperrestrictlist;
2271  /* We don't bother recomputing baserestrict_min_security */
2272  }
2273 
2274  pfree(safetyInfo.unsafeColumns);
2275 
2276  /*
2277  * The upper query might not use all the subquery's output columns; if
2278  * not, we can simplify.
2279  */
2280  remove_unused_subquery_outputs(subquery, rel);
2281 
2282  /*
2283  * We can safely pass the outer tuple_fraction down to the subquery if the
2284  * outer level has no joining, aggregation, or sorting to do. Otherwise
2285  * we'd better tell the subquery to plan for full retrieval. (XXX This
2286  * could probably be made more intelligent ...)
2287  */
2288  if (parse->hasAggs ||
2289  parse->groupClause ||
2290  parse->groupingSets ||
2291  parse->havingQual ||
2292  parse->distinctClause ||
2293  parse->sortClause ||
2294  has_multiple_baserels(root))
2295  tuple_fraction = 0.0; /* default case */
2296  else
2297  tuple_fraction = root->tuple_fraction;
2298 
2299  /* plan_params should not be in use in current query level */
2300  Assert(root->plan_params == NIL);
2301 
2302  /* Generate a subroot and Paths for the subquery */
2303  rel->subroot = subquery_planner(root->glob, subquery,
2304  root,
2305  false, tuple_fraction);
2306 
2307  /* Isolate the params needed by this specific subplan */
2308  rel->subplan_params = root->plan_params;
2309  root->plan_params = NIL;
2310 
2311  /*
2312  * It's possible that constraint exclusion proved the subquery empty. If
2313  * so, it's desirable to produce an unadorned dummy path so that we will
2314  * recognize appropriate optimizations at this query level.
2315  */
2316  sub_final_rel = fetch_upper_rel(rel->subroot, UPPERREL_FINAL, NULL);
2317 
2318  if (IS_DUMMY_REL(sub_final_rel))
2319  {
2321  return;
2322  }
2323 
2324  /*
2325  * Mark rel with estimated output rows, width, etc. Note that we have to
2326  * do this before generating outer-query paths, else cost_subqueryscan is
2327  * not happy.
2328  */
2329  set_subquery_size_estimates(root, rel);
2330 
2331  /*
2332  * For each Path that subquery_planner produced, make a SubqueryScanPath
2333  * in the outer query.
2334  */
2335  foreach(lc, sub_final_rel->pathlist)
2336  {
2337  Path *subpath = (Path *) lfirst(lc);
2338  List *pathkeys;
2339 
2340  /* Convert subpath's pathkeys to outer representation */
2341  pathkeys = convert_subquery_pathkeys(root,
2342  rel,
2343  subpath->pathkeys,
2345 
2346  /* Generate outer path using this subpath */
2347  add_path(rel, (Path *)
2348  create_subqueryscan_path(root, rel, subpath,
2349  pathkeys, required_outer));
2350  }
2351 
2352  /* If outer rel allows parallelism, do same for partial paths. */
2353  if (rel->consider_parallel && bms_is_empty(required_outer))
2354  {
2355  /* If consider_parallel is false, there should be no partial paths. */
2356  Assert(sub_final_rel->consider_parallel ||
2357  sub_final_rel->partial_pathlist == NIL);
2358 
2359  /* Same for partial paths. */
2360  foreach(lc, sub_final_rel->partial_pathlist)
2361  {
2362  Path *subpath = (Path *) lfirst(lc);
2363  List *pathkeys;
2364 
2365  /* Convert subpath's pathkeys to outer representation */
2366  pathkeys = convert_subquery_pathkeys(root,
2367  rel,
2368  subpath->pathkeys,
2370 
2371  /* Generate outer path using this subpath */
2372  add_partial_path(rel, (Path *)
2373  create_subqueryscan_path(root, rel, subpath,
2374  pathkeys,
2375  required_outer));
2376  }
2377  }
2378 }
void set_subquery_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:5098
#define NIL
Definition: pg_list.h:65
PathTarget * pathtarget
Definition: pathnodes.h:1145
Query * parse
Definition: pathnodes.h:179
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:1884
List * plan_params
Definition: pathnodes.h:193
List * sortClause
Definition: parsenodes.h:158
List * baserestrictinfo
Definition: pathnodes.h:727
bool hasAggs
Definition: parsenodes.h:125
bool pseudoconstant
Definition: pathnodes.h:1993
List * groupingSets
Definition: parsenodes.h:150
Definition: nodes.h:529
List * partial_pathlist
Definition: pathnodes.h:681
List * make_tlist_from_pathtarget(PathTarget *target)
Definition: tlist.c:639
bool * unsafeColumns
Definition: allpaths.c:56
List * targetList
Definition: parsenodes.h:140
PlannerInfo * subroot
Definition: pathnodes.h:709
Relids lateral_relids
Definition: pathnodes.h:690
double tuple_fraction
Definition: pathnodes.h:336
void pfree(void *pointer)
Definition: mcxt.c:1056
List * distinctClause
Definition: parsenodes.h:156
#define IS_DUMMY_REL(r)
Definition: pathnodes.h:1418
RelOptInfo * fetch_upper_rel(PlannerInfo *root, UpperRelationKind kind, Relids relids)
Definition: relnode.c:1193
static void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:2122
List * convert_subquery_pathkeys(PlannerInfo *root, RelOptInfo *rel, List *subquery_pathkeys, List *subquery_tlist)
Definition: pathkeys.c:838
PlannerGlobal * glob
Definition: pathnodes.h:181
static void remove_unused_subquery_outputs(Query *subquery, RelOptInfo *rel)
Definition: allpaths.c:3647
List * lappend(List *list, void *datum)
Definition: list.c:321
Expr * clause
Definition: pathnodes.h:1985
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
static bool qual_is_pushdown_safe(Query *subquery, Index rti, Node *qual, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3476
void * palloc0(Size size)
Definition: mcxt.c:980
bool security_barrier
Definition: parsenodes.h:1012
List * pathkeys
Definition: pathnodes.h:1158
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
static bool has_multiple_baserels(PlannerInfo *root)
Definition: allpaths.c:2148
static void subquery_push_qual(Query *subquery, RangeTblEntry *rte, Index rti, Node *qual)
Definition: allpaths.c:3553
static int list_length(const List *l)
Definition: pg_list.h:169
bool consider_parallel
Definition: pathnodes.h:673
static bool subquery_is_pushdown_safe(Query *subquery, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3214
Query * subquery
Definition: parsenodes.h:1011
List * groupClause
Definition: parsenodes.h:148
void add_partial_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:749
List * pathlist
Definition: pathnodes.h:679
#define copyObject(obj)
Definition: nodes.h:645
Node * havingQual
Definition: parsenodes.h:152
Definition: pg_list.h:50
List * subplan_params
Definition: pathnodes.h:710
PlannerInfo * subquery_planner(PlannerGlobal *glob, Query *parse, PlannerInfo *parent_root, bool hasRecursion, double tuple_fraction)
Definition: planner.c:597
Datum subpath(PG_FUNCTION_ARGS)
Definition: ltree_op.c:241
static struct subre * parse(struct vars *, int, int, struct state *, struct state *)
Definition: regcomp.c:648
unsigned char bool
Definition: c.h:317

◆ set_tablefunc_pathlist()

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

Definition at line 2473 of file allpaths.c.

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

Referenced by set_rel_pathlist().

2474 {
2475  Relids required_outer;
2476 
2477  /*
2478  * We don't support pushing join clauses into the quals of a tablefunc
2479  * scan, but it could still have required parameterization due to LATERAL
2480  * refs in the function expression.
2481  */
2482  required_outer = rel->lateral_relids;
2483 
2484  /* Generate appropriate path */
2485  add_path(rel, create_tablefuncscan_path(root, rel,
2486  required_outer));
2487 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
Relids lateral_relids
Definition: pathnodes.h:690
Path * create_tablefuncscan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:1938

◆ set_tablesample_rel_pathlist()

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

Definition at line 856 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().

857 {
858  Relids required_outer;
859  Path *path;
860 
861  /*
862  * We don't support pushing join clauses into the quals of a samplescan,
863  * but it could still have required parameterization due to LATERAL refs
864  * in its tlist or TABLESAMPLE arguments.
865  */
866  required_outer = rel->lateral_relids;
867 
868  /* Consider sampled scan */
869  path = create_samplescan_path(root, rel, required_outer);
870 
871  /*
872  * If the sampling method does not support repeatable scans, we must avoid
873  * plans that would scan the rel multiple times. Ideally, we'd simply
874  * avoid putting the rel on the inside of a nestloop join; but adding such
875  * a consideration to the planner seems like a great deal of complication
876  * to support an uncommon usage of second-rate sampling methods. Instead,
877  * if there is a risk that the query might perform an unsafe join, just
878  * wrap the SampleScan in a Materialize node. We can check for joins by
879  * counting the membership of all_baserels (note that this correctly
880  * counts inheritance trees as single rels). If we're inside a subquery,
881  * we can't easily check whether a join might occur in the outer query, so
882  * just assume one is possible.
883  *
884  * GetTsmRoutine is relatively expensive compared to the other tests here,
885  * so check repeatable_across_scans last, even though that's a bit odd.
886  */
887  if ((root->query_level > 1 ||
890  {
891  path = (Path *) create_material_path(rel, path);
892  }
893 
894  add_path(rel, path);
895 
896  /* For the moment, at least, there are no other paths to consider */
897 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
MaterialPath * create_material_path(RelOptInfo *rel, Path *subpath)
Definition: pathnode.c:1495
Relids lateral_relids
Definition: pathnodes.h:690
Relids all_baserels
Definition: pathnodes.h:227
BMS_Membership bms_membership(const Bitmapset *a)
Definition: bitmapset.c:672
Path * create_samplescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:954
TsmRoutine * GetTsmRoutine(Oid tsmhandler)
Definition: tablesample.c:27
bool repeatable_across_scans
Definition: tsmapi.h:65
Index query_level
Definition: pathnodes.h:183
struct TableSampleClause * tablesample
Definition: parsenodes.h:1006

◆ set_tablesample_rel_size()

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

Definition at line 816 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().

817 {
818  TableSampleClause *tsc = rte->tablesample;
819  TsmRoutine *tsm;
820  BlockNumber pages;
821  double tuples;
822 
823  /*
824  * Test any partial indexes of rel for applicability. We must do this
825  * first since partial unique indexes can affect size estimates.
826  */
827  check_index_predicates(root, rel);
828 
829  /*
830  * Call the sampling method's estimation function to estimate the number
831  * of pages it will read and the number of tuples it will return. (Note:
832  * we assume the function returns sane values.)
833  */
834  tsm = GetTsmRoutine(tsc->tsmhandler);
835  tsm->SampleScanGetSampleSize(root, rel, tsc->args,
836  &pages, &tuples);
837 
838  /*
839  * For the moment, because we will only consider a SampleScan path for the
840  * rel, it's okay to just overwrite the pages and tuples estimates for the
841  * whole relation. If we ever consider multiple path types for sampled
842  * rels, we'll need more complication.
843  */
844  rel->pages = pages;
845  rel->tuples = tuples;
846 
847  /* Mark rel with estimated output rows, width, etc */
848  set_baserel_size_estimates(root, rel);
849 }
double tuples
Definition: pathnodes.h:705
uint32 BlockNumber
Definition: block.h:31
void check_index_predicates(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:3395
SampleScanGetSampleSize_function SampleScanGetSampleSize
Definition: tsmapi.h:68
void set_baserel_size_estimates(PlannerInfo *root, RelOptInfo *rel)
Definition: costsize.c:4590
TsmRoutine * GetTsmRoutine(Oid tsmhandler)
Definition: tablesample.c:27
BlockNumber pages
Definition: pathnodes.h:704
struct TableSampleClause * tablesample
Definition: parsenodes.h:1006

◆ set_values_pathlist()

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

Definition at line 2453 of file allpaths.c.

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

Referenced by set_rel_pathlist().

2454 {
2455  Relids required_outer;
2456 
2457  /*
2458  * We don't support pushing join clauses into the quals of a values scan,
2459  * but it could still have required parameterization due to LATERAL refs
2460  * in the values expressions.
2461  */
2462  required_outer = rel->lateral_relids;
2463 
2464  /* Generate appropriate path */
2465  add_path(rel, create_valuesscan_path(root, rel, required_outer));
2466 }
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:1964
Relids lateral_relids
Definition: pathnodes.h:690

◆ set_worktable_pathlist()

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

Definition at line 2623 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().

2624 {
2625  Path *ctepath;
2626  PlannerInfo *cteroot;
2627  Index levelsup;
2628  Relids required_outer;
2629 
2630  /*
2631  * We need to find the non-recursive term's path, which is in the plan
2632  * level that's processing the recursive UNION, which is one level *below*
2633  * where the CTE comes from.
2634  */
2635  levelsup = rte->ctelevelsup;
2636  if (levelsup == 0) /* shouldn't happen */
2637  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
2638  levelsup--;
2639  cteroot = root;
2640  while (levelsup-- > 0)
2641  {
2642  cteroot = cteroot->parent_root;
2643  if (!cteroot) /* shouldn't happen */
2644  elog(ERROR, "bad levelsup for CTE \"%s\"", rte->ctename);
2645  }
2646  ctepath = cteroot->non_recursive_path;
2647  if (!ctepath) /* shouldn't happen */
2648  elog(ERROR, "could not find path for CTE \"%s\"", rte->ctename);
2649 
2650  /* Mark rel with estimated output rows, width, etc */
2651  set_cte_size_estimates(root, rel, ctepath->rows);
2652 
2653  /*
2654  * We don't support pushing join clauses into the quals of a worktable
2655  * scan, but it could still have required parameterization due to LATERAL
2656  * refs in its tlist. (I'm not sure this is actually possible given the
2657  * restrictions on recursive references, but it's easy enough to support.)
2658  */
2659  required_outer = rel->lateral_relids;
2660 
2661  /* Generate appropriate path */
2662  add_path(rel, create_worktablescan_path(root, rel, required_outer));
2663 }
void add_path(RelOptInfo *parent_rel, Path *new_path)
Definition: pathnode.c:422
PlannerInfo * parent_root
Definition: pathnodes.h:185
void set_cte_size_estimates(PlannerInfo *root, RelOptInfo *rel, double cte_rows)
Definition: costsize.c:5270
Relids lateral_relids
Definition: pathnodes.h:690
#define ERROR
Definition: elog.h:43
Path * create_worktablescan_path(PlannerInfo *root, RelOptInfo *rel, Relids required_outer)
Definition: pathnode.c:2067
unsigned int Index
Definition: c.h:475
double rows
Definition: pathnodes.h:1154
struct Path * non_recursive_path
Definition: pathnodes.h:354
Index ctelevelsup
Definition: parsenodes.h:1080
char * ctename
Definition: parsenodes.h:1079
#define elog(elevel,...)
Definition: elog.h:214

◆ standard_join_search()

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

Definition at line 3056 of file allpaths.c.

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

Referenced by make_rel_from_joinlist().

3057 {
3058  int lev;
3059  RelOptInfo *rel;
3060 
3061  /*
3062  * This function cannot be invoked recursively within any one planning
3063  * problem, so join_rel_level[] can't be in use already.
3064  */
3065  Assert(root->join_rel_level == NULL);
3066 
3067  /*
3068  * We employ a simple "dynamic programming" algorithm: we first find all
3069  * ways to build joins of two jointree items, then all ways to build joins
3070  * of three items (from two-item joins and single items), then four-item
3071  * joins, and so on until we have considered all ways to join all the
3072  * items into one rel.
3073  *
3074  * root->join_rel_level[j] is a list of all the j-item rels. Initially we
3075  * set root->join_rel_level[1] to represent all the single-jointree-item
3076  * relations.
3077  */
3078  root->join_rel_level = (List **) palloc0((levels_needed + 1) * sizeof(List *));
3079 
3080  root->join_rel_level[1] = initial_rels;
3081 
3082  for (lev = 2; lev <= levels_needed; lev++)
3083  {
3084  ListCell *lc;
3085 
3086  /*
3087  * Determine all possible pairs of relations to be joined at this
3088  * level, and build paths for making each one from every available
3089  * pair of lower-level relations.
3090  */
3091  join_search_one_level(root, lev);
3092 
3093  /*
3094  * Run generate_partitionwise_join_paths() and generate_gather_paths()
3095  * for each just-processed joinrel. We could not do this earlier
3096  * because both regular and partial paths can get added to a
3097  * particular joinrel at multiple times within join_search_one_level.
3098  *
3099  * After that, we're done creating paths for the joinrel, so run
3100  * set_cheapest().
3101  */
3102  foreach(lc, root->join_rel_level[lev])
3103  {
3104  rel = (RelOptInfo *) lfirst(lc);
3105 
3106  /* Create paths for partitionwise joins. */
3108 
3109  /*
3110  * Except for the topmost scan/join rel, consider gathering
3111  * partial paths. We'll do the same for the topmost scan/join rel
3112  * once we know the final targetlist (see grouping_planner).
3113  */
3114  if (lev < levels_needed)
3115  generate_useful_gather_paths(root, rel, false);
3116 
3117  /* Find and save the cheapest paths for this rel */
3118  set_cheapest(rel);
3119 
3120 #ifdef OPTIMIZER_DEBUG
3121  debug_print_rel(root, rel);
3122 #endif
3123  }
3124  }
3125 
3126  /*
3127  * We should have a single rel at the final level.
3128  */
3129  if (root->join_rel_level[levels_needed] == NIL)
3130  elog(ERROR, "failed to build any %d-way joins", levels_needed);
3131  Assert(list_length(root->join_rel_level[levels_needed]) == 1);
3132 
3133  rel = (RelOptInfo *) linitial(root->join_rel_level[levels_needed]);
3134 
3135  root->join_rel_level = NULL;
3136 
3137  return rel;
3138 }
#define NIL
Definition: pg_list.h:65
void generate_partitionwise_join_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:3876
#define linitial(l)
Definition: pg_list.h:195
void generate_useful_gather_paths(PlannerInfo *root, RelOptInfo *rel, bool override_rows)
Definition: allpaths.c:2812
#define ERROR
Definition: elog.h:43
void join_search_one_level(PlannerInfo *root, int level)
Definition: joinrels.c:71
void set_cheapest(RelOptInfo *parent_rel)
Definition: pathnode.c:244
void * palloc0(Size size)
Definition: mcxt.c:980
#define Assert(condition)
Definition: c.h:738
#define lfirst(lc)
Definition: pg_list.h:190
List ** join_rel_level
Definition: pathnodes.h:256
static int list_length(const List *l)
Definition: pg_list.h:169
#define elog(elevel,...)
Definition: elog.h:214
Definition: pg_list.h:50

◆ subquery_is_pushdown_safe()

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

Definition at line 3214 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().

3216 {
3217  SetOperationStmt *topop;
3218 
3219  /* Check point 1 */
3220  if (subquery->limitOffset != NULL || subquery->limitCount != NULL)
3221  return false;
3222 
3223  /* Check points 3, 4, and 5 */
3224  if (subquery->distinctClause ||
3225  subquery->hasWindowFuncs ||
3226  subquery->hasTargetSRFs)
3227  safetyInfo->unsafeVolatile = true;
3228 
3229  /*
3230  * If we're at a leaf query, check for unsafe expressions in its target
3231  * list, and mark any unsafe ones in unsafeColumns[]. (Non-leaf nodes in
3232  * setop trees have only simple Vars in their tlists, so no need to check
3233  * them.)
3234  */
3235  if (subquery->setOperations == NULL)
3236  check_output_expressions(subquery, safetyInfo);
3237 
3238  /* Are we at top level, or looking at a setop component? */
3239  if (subquery == topquery)
3240  {
3241  /* Top level, so check any component queries */
3242  if (subquery->setOperations != NULL)
3243  if (!recurse_pushdown_safe(subquery->setOperations, topquery,
3244  safetyInfo))
3245  return false;
3246  }
3247  else
3248  {
3249  /* Setop component must not have more components (too weird) */
3250  if (subquery->setOperations != NULL)
3251  return false;
3252  /* Check whether setop component output types match top level */
3253  topop = castNode(SetOperationStmt, topquery->setOperations);
3254  Assert(topop);
3256  topop->colTypes,
3257  safetyInfo);
3258  }
3259  return true;
3260 }
Node * limitOffset
Definition: parsenodes.h:160
#define castNode(_type_, nodeptr)
Definition: nodes.h:598
static bool recurse_pushdown_safe(Node *setOp, Query *topquery, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3266
static void compare_tlist_datatypes(List *tlist, List *colTypes, pushdown_safety_info *safetyInfo)
Definition: allpaths.c:3401
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:3333
bool hasTargetSRFs
Definition: parsenodes.h:127
#define Assert(condition)
Definition: c.h:738
bool hasWindowFuncs
Definition: parsenodes.h:126
Node * setOperations
Definition: parsenodes.h:166

◆ subquery_push_qual()

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

Definition at line 3553 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().

3554 {
3555  if (subquery->setOperations != NULL)
3556  {
3557  /* Recurse to push it separately to each component query */
3558  recurse_push_qual(subquery->setOperations, subquery,
3559  rte, rti, qual);
3560  }
3561  else
3562  {
3563  /*
3564  * We need to replace Vars in the qual (which must refer to outputs of
3565  * the subquery) with copies of the subquery's targetlist expressions.
3566  * Note that at this point, any uplevel Vars in the qual should have
3567  * been replaced with Params, so they need no work.
3568  *
3569  * This step also ensures that when we are pushing into a setop tree,
3570  * each component query gets its own copy of the qual.
3571  */
3572  qual = ReplaceVarsFromTargetList(qual, rti, 0, rte,
3573  subquery->targetList,
3575  &subquery->hasSubLinks);
3576 
3577  /*
3578  * Now attach the qual to the proper place: normally WHERE, but if the
3579  * subquery uses grouping or aggregation, put it in HAVING (since the
3580  * qual really refers to the group-result rows).
3581  */
3582  if (subquery->hasAggs || subquery->groupClause || subquery->groupingSets || subquery->havingQual)
3583  subquery->havingQual = make_and_qual(subquery->havingQual, qual);
3584  else
3585  subquery->jointree->quals =
3586  make_and_qual(subquery->jointree->quals, qual);
3587 
3588  /*
3589  * We need not change the subquery's hasAggs or hasSubLinks flags,
3590  * since we can't be pushing down any aggregates that weren't there
3591  * before, and we don't push down subselects at all.
3592  */
3593  }
3594 }
FromExpr * jointree
Definition: parsenodes.h:138
bool hasAggs
Definition: parsenodes.h:125
List * groupingSets
Definition: parsenodes.h:150
Node * make_and_qual(Node *qual1, Node *qual2)
Definition: makefuncs.c:686
Node * quals
Definition: primnodes.h:1511
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:3600
Node * setOperations
Definition: parsenodes.h:166
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 3434 of file allpaths.c.

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

Referenced by check_output_expressions().

3435 {
3436  ListCell *lc;
3437 
3438  foreach(lc, query->windowClause)
3439  {
3440  WindowClause *wc = (WindowClause *) lfirst(lc);
3441 
3443  return false;
3444  }
3445  return true;
3446 }
List * windowClause
Definition: parsenodes.h:154
List * partitionClause
Definition: parsenodes.h:1353
#define InvalidOid
Definition: postgres_ext.h:36
bool targetIsInSortList(TargetEntry *tle, Oid sortop, List *sortList)
#define lfirst(lc)
Definition: pg_list.h:190

Variable Documentation

◆ enable_geqo

bool enable_geqo = false

Definition at line 62 of file allpaths.c.

Referenced by make_rel_from_joinlist().

◆ geqo_threshold

int geqo_threshold

Definition at line 63 of file allpaths.c.

Referenced by make_rel_from_joinlist().

◆ join_search_hook

join_search_hook_type join_search_hook = NULL

Definition at line 71 of file allpaths.c.

Referenced by make_rel_from_joinlist().

◆ min_parallel_index_scan_size

int min_parallel_index_scan_size

Definition at line 65 of file allpaths.c.

Referenced by compute_parallel_vacuum_workers(), and compute_parallel_worker().

◆ min_parallel_table_scan_size

int min_parallel_table_scan_size

Definition at line 64 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 68 of file allpaths.c.

Referenced by set_rel_pathlist().