PostgreSQL Source Code  git master
relnode.c File Reference
#include "postgres.h"
#include <limits.h>
#include "miscadmin.h"
#include "nodes/nodeFuncs.h"
#include "optimizer/appendinfo.h"
#include "optimizer/clauses.h"
#include "optimizer/cost.h"
#include "optimizer/inherit.h"
#include "optimizer/pathnode.h"
#include "optimizer/paths.h"
#include "optimizer/placeholder.h"
#include "optimizer/plancat.h"
#include "optimizer/restrictinfo.h"
#include "optimizer/tlist.h"
#include "utils/hsearch.h"
#include "utils/lsyscache.h"
Include dependency graph for relnode.c:

Go to the source code of this file.

Data Structures

struct  JoinHashEntry
 

Typedefs

typedef struct JoinHashEntry JoinHashEntry
 

Functions

static void build_joinrel_tlist (PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *input_rel)
 
static Listbuild_joinrel_restrictlist (PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
 
static void build_joinrel_joinlist (RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
 
static Listsubbuild_joinrel_restrictlist (RelOptInfo *joinrel, List *joininfo_list, List *new_restrictlist)
 
static Listsubbuild_joinrel_joinlist (RelOptInfo *joinrel, List *joininfo_list, List *new_joininfo)
 
static void set_foreign_rel_properties (RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
 
static void add_join_rel (PlannerInfo *root, RelOptInfo *joinrel)
 
static void build_joinrel_partition_info (RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, List *restrictlist, JoinType jointype)
 
static bool have_partkey_equi_join (RelOptInfo *joinrel, RelOptInfo *rel1, RelOptInfo *rel2, JoinType jointype, List *restrictlist)
 
static int match_expr_to_partition_keys (Expr *expr, RelOptInfo *rel, bool strict_op)
 
static void set_joinrel_partition_key_exprs (RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, JoinType jointype)
 
static void build_child_join_reltarget (PlannerInfo *root, RelOptInfo *parentrel, RelOptInfo *childrel, int nappinfos, AppendRelInfo **appinfos)
 
void setup_simple_rel_arrays (PlannerInfo *root)
 
void expand_planner_arrays (PlannerInfo *root, int add_size)
 
RelOptInfobuild_simple_rel (PlannerInfo *root, int relid, RelOptInfo *parent)
 
RelOptInfofind_base_rel (PlannerInfo *root, int relid)
 
static void build_join_rel_hash (PlannerInfo *root)
 
RelOptInfofind_join_rel (PlannerInfo *root, Relids relids)
 
RelOptInfobuild_join_rel (PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List **restrictlist_ptr)
 
RelOptInfobuild_child_join_rel (PlannerInfo *root, RelOptInfo *outer_rel, RelOptInfo *inner_rel, RelOptInfo *parent_joinrel, List *restrictlist, SpecialJoinInfo *sjinfo, JoinType jointype)
 
Relids min_join_parameterization (PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
 
RelOptInfofetch_upper_rel (PlannerInfo *root, UpperRelationKind kind, Relids relids)
 
Relids find_childrel_parents (PlannerInfo *root, RelOptInfo *rel)
 
ParamPathInfoget_baserel_parampathinfo (PlannerInfo *root, RelOptInfo *baserel, Relids required_outer)
 
ParamPathInfoget_joinrel_parampathinfo (PlannerInfo *root, RelOptInfo *joinrel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, Relids required_outer, List **restrict_clauses)
 
ParamPathInfoget_appendrel_parampathinfo (RelOptInfo *appendrel, Relids required_outer)
 
ParamPathInfofind_param_path_info (RelOptInfo *rel, Relids required_outer)
 

Typedef Documentation

◆ JoinHashEntry

typedef struct JoinHashEntry JoinHashEntry

Function Documentation

◆ add_join_rel()

static void add_join_rel ( PlannerInfo root,
RelOptInfo joinrel 
)
static

Definition at line 540 of file relnode.c.

References Assert, HASH_ENTER, hash_search(), JoinHashEntry::join_rel, PlannerInfo::join_rel_hash, PlannerInfo::join_rel_list, lappend(), and RelOptInfo::relids.

Referenced by build_child_join_rel(), and build_join_rel().

541 {
542  /* GEQO requires us to append the new joinrel to the end of the list! */
543  root->join_rel_list = lappend(root->join_rel_list, joinrel);
544 
545  /* store it into the auxiliary hashtable if there is one. */
546  if (root->join_rel_hash)
547  {
548  JoinHashEntry *hentry;
549  bool found;
550 
551  hentry = (JoinHashEntry *) hash_search(root->join_rel_hash,
552  &(joinrel->relids),
553  HASH_ENTER,
554  &found);
555  Assert(!found);
556  hentry->join_rel = joinrel;
557  }
558 }
List * join_rel_list
Definition: pathnodes.h:246
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:919
RelOptInfo * join_rel
Definition: relnode.c:38
Relids relids
Definition: pathnodes.h:665
List * lappend(List *list, void *datum)
Definition: list.c:321
#define Assert(condition)
Definition: c.h:745
struct HTAB * join_rel_hash
Definition: pathnodes.h:247

◆ build_child_join_rel()

RelOptInfo* build_child_join_rel ( PlannerInfo root,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
RelOptInfo parent_joinrel,
List restrictlist,
SpecialJoinInfo sjinfo,
JoinType  jointype 
)

Definition at line 785 of file relnode.c.

References add_child_join_rel_equivalences(), add_join_rel(), adjust_appendrel_attrs(), RelOptInfo::all_partrels, RelOptInfo::allvisfrac, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_copy(), bms_union(), RelOptInfo::boundinfo, build_child_join_reltarget(), build_joinrel_partition_info(), RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_partitionwise_join, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, RelOptInfo::eclass_indexes, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, find_appinfos_by_relids(), find_join_rel(), RelOptInfo::has_eclass_joins, has_useful_pathkeys(), RelOptInfo::indexlist, InvalidOid, IS_OTHER_REL, RelOptInfo::joininfo, RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, NIL, RelOptInfo::nparts, RelOptInfo::nullable_partexprs, RelOptInfo::pages, RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partbounds_merged, RelOptInfo::partexprs, RelOptInfo::partial_pathlist, RelOptInfo::partition_qual, RelOptInfo::partitioned_child_rels, RelOptInfo::pathlist, QualCost::per_tuple, pfree(), RelOptInfo::ppilist, RelOptInfo::relid, RelOptInfo::relids, RELOPT_OTHER_JOINREL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_JOIN, RelOptInfo::rtekind, RelOptInfo::serverid, set_foreign_rel_properties(), set_joinrel_size_estimates(), QualCost::startup, RelOptInfo::subplan_params, RelOptInfo::subroot, RelOptInfo::top_parent_relids, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by try_partitionwise_join().

789 {
790  RelOptInfo *joinrel = makeNode(RelOptInfo);
791  AppendRelInfo **appinfos;
792  int nappinfos;
793 
794  /* Only joins between "other" relations land here. */
795  Assert(IS_OTHER_REL(outer_rel) && IS_OTHER_REL(inner_rel));
796 
797  /* The parent joinrel should have consider_partitionwise_join set. */
798  Assert(parent_joinrel->consider_partitionwise_join);
799 
800  joinrel->reloptkind = RELOPT_OTHER_JOINREL;
801  joinrel->relids = bms_union(outer_rel->relids, inner_rel->relids);
802  joinrel->rows = 0;
803  /* cheap startup cost is interesting iff not all tuples to be retrieved */
804  joinrel->consider_startup = (root->tuple_fraction > 0);
805  joinrel->consider_param_startup = false;
806  joinrel->consider_parallel = false;
807  joinrel->reltarget = create_empty_pathtarget();
808  joinrel->pathlist = NIL;
809  joinrel->ppilist = NIL;
810  joinrel->partial_pathlist = NIL;
811  joinrel->cheapest_startup_path = NULL;
812  joinrel->cheapest_total_path = NULL;
813  joinrel->cheapest_unique_path = NULL;
815  joinrel->direct_lateral_relids = NULL;
816  joinrel->lateral_relids = NULL;
817  joinrel->relid = 0; /* indicates not a baserel */
818  joinrel->rtekind = RTE_JOIN;
819  joinrel->min_attr = 0;
820  joinrel->max_attr = 0;
821  joinrel->attr_needed = NULL;
822  joinrel->attr_widths = NULL;
823  joinrel->lateral_vars = NIL;
824  joinrel->lateral_referencers = NULL;
825  joinrel->indexlist = NIL;
826  joinrel->pages = 0;
827  joinrel->tuples = 0;
828  joinrel->allvisfrac = 0;
829  joinrel->eclass_indexes = NULL;
830  joinrel->subroot = NULL;
831  joinrel->subplan_params = NIL;
832  joinrel->serverid = InvalidOid;
833  joinrel->userid = InvalidOid;
834  joinrel->useridiscurrent = false;
835  joinrel->fdwroutine = NULL;
836  joinrel->fdw_private = NULL;
837  joinrel->baserestrictinfo = NIL;
838  joinrel->baserestrictcost.startup = 0;
839  joinrel->baserestrictcost.per_tuple = 0;
840  joinrel->joininfo = NIL;
841  joinrel->has_eclass_joins = false;
842  joinrel->consider_partitionwise_join = false; /* might get changed later */
843  joinrel->top_parent_relids = NULL;
844  joinrel->part_scheme = NULL;
845  joinrel->nparts = -1;
846  joinrel->boundinfo = NULL;
847  joinrel->partbounds_merged = false;
848  joinrel->partition_qual = NIL;
849  joinrel->part_rels = NULL;
850  joinrel->all_partrels = NULL;
851  joinrel->partexprs = NULL;
852  joinrel->nullable_partexprs = NULL;
853  joinrel->partitioned_child_rels = NIL;
854 
855  joinrel->top_parent_relids = bms_union(outer_rel->top_parent_relids,
856  inner_rel->top_parent_relids);
857 
858  /* Compute information relevant to foreign relations. */
859  set_foreign_rel_properties(joinrel, outer_rel, inner_rel);
860 
861  /* Compute information needed for mapping Vars to the child rel */
862  appinfos = find_appinfos_by_relids(root, joinrel->relids, &nappinfos);
863 
864  /* Set up reltarget struct */
865  build_child_join_reltarget(root, parent_joinrel, joinrel,
866  nappinfos, appinfos);
867 
868  /* Construct joininfo list. */
869  joinrel->joininfo = (List *) adjust_appendrel_attrs(root,
870  (Node *) parent_joinrel->joininfo,
871  nappinfos,
872  appinfos);
873 
874  /*
875  * Lateral relids referred in child join will be same as that referred in
876  * the parent relation.
877  */
878  joinrel->direct_lateral_relids = (Relids) bms_copy(parent_joinrel->direct_lateral_relids);
879  joinrel->lateral_relids = (Relids) bms_copy(parent_joinrel->lateral_relids);
880 
881  /*
882  * If the parent joinrel has pending equivalence classes, so does the
883  * child.
884  */
885  joinrel->has_eclass_joins = parent_joinrel->has_eclass_joins;
886 
887  /* Is the join between partitions itself partitioned? */
888  build_joinrel_partition_info(joinrel, outer_rel, inner_rel, restrictlist,
889  jointype);
890 
891  /* Child joinrel is parallel safe if parent is parallel safe. */
892  joinrel->consider_parallel = parent_joinrel->consider_parallel;
893 
894  /* Set estimates of the child-joinrel's size. */
895  set_joinrel_size_estimates(root, joinrel, outer_rel, inner_rel,
896  sjinfo, restrictlist);
897 
898  /* We build the join only once. */
899  Assert(!find_join_rel(root, joinrel->relids));
900 
901  /* Add the relation to the PlannerInfo. */
902  add_join_rel(root, joinrel);
903 
904  /*
905  * We might need EquivalenceClass members corresponding to the child join,
906  * so that we can represent sort pathkeys for it. As with children of
907  * baserels, we shouldn't need this unless there are relevant eclass joins
908  * (implying that a merge join might be possible) or pathkeys to sort by.
909  */
910  if (joinrel->has_eclass_joins || has_useful_pathkeys(root, parent_joinrel))
912  nappinfos, appinfos,
913  parent_joinrel, joinrel);
914 
915  pfree(appinfos);
916 
917  return joinrel;
918 }
bool has_eclass_joins
Definition: pathnodes.h:733
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:439
#define IS_OTHER_REL(rel)
Definition: pathnodes.h:653
void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List *restrictlist)
Definition: costsize.c:4720
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
Oid userid
Definition: pathnodes.h:715
double tuples
Definition: pathnodes.h:705
List * baserestrictinfo
Definition: pathnodes.h:727
bool consider_param_startup
Definition: pathnodes.h:672
Definition: nodes.h:529
List * partial_pathlist
Definition: pathnodes.h:681
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
Relids all_partrels
Definition: pathnodes.h:752
bool useridiscurrent
Definition: pathnodes.h:716
List ** nullable_partexprs
Definition: pathnodes.h:754
Cost startup
Definition: pathnodes.h:45
double allvisfrac
Definition: pathnodes.h:706
void add_child_join_rel_equivalences(PlannerInfo *root, int nappinfos, AppendRelInfo **appinfos, RelOptInfo *parent_joinrel, RelOptInfo *child_joinrel)
Definition: equivclass.c:2375
PlannerInfo * subroot
Definition: pathnodes.h:709
bool consider_startup
Definition: pathnodes.h:671
Relids lateral_relids
Definition: pathnodes.h:690
Cost per_tuple
Definition: pathnodes.h:46
static void set_foreign_rel_properties(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:502
double tuple_fraction
Definition: pathnodes.h:336
void pfree(void *pointer)
Definition: mcxt.c:1057
List ** partexprs
Definition: pathnodes.h:753
struct Path * cheapest_total_path
Definition: pathnodes.h:683
List * joininfo
Definition: pathnodes.h:731
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
int nparts
Definition: pathnodes.h:743
Relids relids
Definition: pathnodes.h:665
bool partbounds_merged
Definition: pathnodes.h:747
List * ppilist
Definition: pathnodes.h:680
Index relid
Definition: pathnodes.h:693
AppendRelInfo ** find_appinfos_by_relids(PlannerInfo *root, Relids relids, int *nappinfos)
Definition: appendinfo.c:728
Relids lateral_referencers
Definition: pathnodes.h:701
Oid serverid
Definition: pathnodes.h:714
Relids direct_lateral_relids
Definition: pathnodes.h:689
bool consider_partitionwise_join
Definition: pathnodes.h:736
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
RTEKind rtekind
Definition: pathnodes.h:695
List * indexlist
Definition: pathnodes.h:702
double rows
Definition: pathnodes.h:668
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: pathnodes.h:719
#define makeNode(_type_)
Definition: nodes.h:577
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:745
List * lateral_vars
Definition: pathnodes.h:700
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
bool consider_parallel
Definition: pathnodes.h:673
Bitmapset * Relids
Definition: pathnodes.h:28
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
static void build_joinrel_partition_info(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, List *restrictlist, JoinType jointype)
Definition: relnode.c:1630
bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel)
Definition: pathkeys.c:1910
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
List * partition_qual
Definition: pathnodes.h:749
int32 * attr_widths
Definition: pathnodes.h:699
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
QualCost baserestrictcost
Definition: pathnodes.h:728
static void add_join_rel(PlannerInfo *root, RelOptInfo *joinrel)
Definition: relnode.c:540
List * subplan_params
Definition: pathnodes.h:710
static void build_child_join_reltarget(PlannerInfo *root, RelOptInfo *parentrel, RelOptInfo *childrel, int nappinfos, AppendRelInfo **appinfos)
Definition: relnode.c:2013
Bitmapset * eclass_indexes
Definition: pathnodes.h:707
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:194
Relids top_parent_relids
Definition: pathnodes.h:738
AttrNumber min_attr
Definition: pathnodes.h:696

◆ build_child_join_reltarget()

static void build_child_join_reltarget ( PlannerInfo root,
RelOptInfo parentrel,
RelOptInfo childrel,
int  nappinfos,
AppendRelInfo **  appinfos 
)
static

Definition at line 2013 of file relnode.c.

References adjust_appendrel_attrs(), PathTarget::cost, PathTarget::exprs, QualCost::per_tuple, RelOptInfo::reltarget, QualCost::startup, and PathTarget::width.

Referenced by build_child_join_rel().

2018 {
2019  /* Build the targetlist */
2020  childrel->reltarget->exprs = (List *)
2022  (Node *) parentrel->reltarget->exprs,
2023  nappinfos, appinfos);
2024 
2025  /* Set the cost and width fields */
2026  childrel->reltarget->cost.startup = parentrel->reltarget->cost.startup;
2027  childrel->reltarget->cost.per_tuple = parentrel->reltarget->cost.per_tuple;
2028  childrel->reltarget->width = parentrel->reltarget->width;
2029 }
Definition: nodes.h:529
Cost startup
Definition: pathnodes.h:45
Cost per_tuple
Definition: pathnodes.h:46
List * exprs
Definition: pathnodes.h:1074
QualCost cost
Definition: pathnodes.h:1076
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Definition: appendinfo.c:194

◆ build_join_rel()

RelOptInfo* build_join_rel ( PlannerInfo root,
Relids  joinrelids,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
SpecialJoinInfo sjinfo,
List **  restrictlist_ptr 
)

Definition at line 577 of file relnode.c.

References add_join_rel(), add_placeholders_to_joinrel(), RelOptInfo::all_partrels, RelOptInfo::allvisfrac, Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_copy(), bms_del_members(), bms_is_empty(), bms_num_members(), bms_union(), RelOptInfo::boundinfo, build_joinrel_joinlist(), build_joinrel_partition_info(), build_joinrel_restrictlist(), build_joinrel_tlist(), RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_partitionwise_join, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, RelOptInfo::eclass_indexes, PathTarget::exprs, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, find_join_rel(), RelOptInfo::has_eclass_joins, has_relevant_eclass_joinclause(), RelOptInfo::indexlist, InvalidOid, IS_OTHER_REL, is_parallel_safe(), PlannerInfo::join_cur_level, PlannerInfo::join_rel_level, RelOptInfo::joininfo, SpecialJoinInfo::jointype, lappend(), RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, makeNode, RelOptInfo::max_attr, RelOptInfo::min_attr, min_join_parameterization(), NIL, RelOptInfo::non_unique_for_rels, RelOptInfo::nparts, RelOptInfo::nullable_partexprs, RelOptInfo::pages, RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partbounds_merged, RelOptInfo::partexprs, RelOptInfo::partial_pathlist, RelOptInfo::partition_qual, RelOptInfo::partitioned_child_rels, RelOptInfo::pathlist, QualCost::per_tuple, RelOptInfo::ppilist, RelOptInfo::rel_parallel_workers, RelOptInfo::relid, RelOptInfo::relids, RELOPT_JOINREL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_JOIN, RelOptInfo::rtekind, RelOptInfo::serverid, set_foreign_rel_properties(), set_joinrel_size_estimates(), QualCost::startup, RelOptInfo::statlist, RelOptInfo::subplan_params, RelOptInfo::subroot, RelOptInfo::top_parent_relids, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::unique_for_rels, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by make_join_rel().

583 {
584  RelOptInfo *joinrel;
585  List *restrictlist;
586 
587  /* This function should be used only for join between parents. */
588  Assert(!IS_OTHER_REL(outer_rel) && !IS_OTHER_REL(inner_rel));
589 
590  /*
591  * See if we already have a joinrel for this set of base rels.
592  */
593  joinrel = find_join_rel(root, joinrelids);
594 
595  if (joinrel)
596  {
597  /*
598  * Yes, so we only need to figure the restrictlist for this particular
599  * pair of component relations.
600  */
601  if (restrictlist_ptr)
602  *restrictlist_ptr = build_joinrel_restrictlist(root,
603  joinrel,
604  outer_rel,
605  inner_rel);
606  return joinrel;
607  }
608 
609  /*
610  * Nope, so make one.
611  */
612  joinrel = makeNode(RelOptInfo);
613  joinrel->reloptkind = RELOPT_JOINREL;
614  joinrel->relids = bms_copy(joinrelids);
615  joinrel->rows = 0;
616  /* cheap startup cost is interesting iff not all tuples to be retrieved */
617  joinrel->consider_startup = (root->tuple_fraction > 0);
618  joinrel->consider_param_startup = false;
619  joinrel->consider_parallel = false;
620  joinrel->reltarget = create_empty_pathtarget();
621  joinrel->pathlist = NIL;
622  joinrel->ppilist = NIL;
623  joinrel->partial_pathlist = NIL;
624  joinrel->cheapest_startup_path = NULL;
625  joinrel->cheapest_total_path = NULL;
626  joinrel->cheapest_unique_path = NULL;
628  /* init direct_lateral_relids from children; we'll finish it up below */
629  joinrel->direct_lateral_relids =
630  bms_union(outer_rel->direct_lateral_relids,
631  inner_rel->direct_lateral_relids);
632  joinrel->lateral_relids = min_join_parameterization(root, joinrel->relids,
633  outer_rel, inner_rel);
634  joinrel->relid = 0; /* indicates not a baserel */
635  joinrel->rtekind = RTE_JOIN;
636  joinrel->min_attr = 0;
637  joinrel->max_attr = 0;
638  joinrel->attr_needed = NULL;
639  joinrel->attr_widths = NULL;
640  joinrel->lateral_vars = NIL;
641  joinrel->lateral_referencers = NULL;
642  joinrel->indexlist = NIL;
643  joinrel->statlist = NIL;
644  joinrel->pages = 0;
645  joinrel->tuples = 0;
646  joinrel->allvisfrac = 0;
647  joinrel->eclass_indexes = NULL;
648  joinrel->subroot = NULL;
649  joinrel->subplan_params = NIL;
650  joinrel->rel_parallel_workers = -1;
651  joinrel->serverid = InvalidOid;
652  joinrel->userid = InvalidOid;
653  joinrel->useridiscurrent = false;
654  joinrel->fdwroutine = NULL;
655  joinrel->fdw_private = NULL;
656  joinrel->unique_for_rels = NIL;
657  joinrel->non_unique_for_rels = NIL;
658  joinrel->baserestrictinfo = NIL;
659  joinrel->baserestrictcost.startup = 0;
660  joinrel->baserestrictcost.per_tuple = 0;
661  joinrel->baserestrict_min_security = UINT_MAX;
662  joinrel->joininfo = NIL;
663  joinrel->has_eclass_joins = false;
664  joinrel->consider_partitionwise_join = false; /* might get changed later */
665  joinrel->top_parent_relids = NULL;
666  joinrel->part_scheme = NULL;
667  joinrel->nparts = -1;
668  joinrel->boundinfo = NULL;
669  joinrel->partbounds_merged = false;
670  joinrel->partition_qual = NIL;
671  joinrel->part_rels = NULL;
672  joinrel->all_partrels = NULL;
673  joinrel->partexprs = NULL;
674  joinrel->nullable_partexprs = NULL;
675  joinrel->partitioned_child_rels = NIL;
676 
677  /* Compute information relevant to the foreign relations. */
678  set_foreign_rel_properties(joinrel, outer_rel, inner_rel);
679 
680  /*
681  * Create a new tlist containing just the vars that need to be output from
682  * this join (ie, are needed for higher joinclauses or final output).
683  *
684  * NOTE: the tlist order for a join rel will depend on which pair of outer
685  * and inner rels we first try to build it from. But the contents should
686  * be the same regardless.
687  */
688  build_joinrel_tlist(root, joinrel, outer_rel);
689  build_joinrel_tlist(root, joinrel, inner_rel);
690  add_placeholders_to_joinrel(root, joinrel, outer_rel, inner_rel);
691 
692  /*
693  * add_placeholders_to_joinrel also took care of adding the ph_lateral
694  * sets of any PlaceHolderVars computed here to direct_lateral_relids, so
695  * now we can finish computing that. This is much like the computation of
696  * the transitively-closed lateral_relids in min_join_parameterization,
697  * except that here we *do* have to consider the added PHVs.
698  */
699  joinrel->direct_lateral_relids =
700  bms_del_members(joinrel->direct_lateral_relids, joinrel->relids);
701  if (bms_is_empty(joinrel->direct_lateral_relids))
702  joinrel->direct_lateral_relids = NULL;
703 
704  /*
705  * Construct restrict and join clause lists for the new joinrel. (The
706  * caller might or might not need the restrictlist, but I need it anyway
707  * for set_joinrel_size_estimates().)
708  */
709  restrictlist = build_joinrel_restrictlist(root, joinrel,
710  outer_rel, inner_rel);
711  if (restrictlist_ptr)
712  *restrictlist_ptr = restrictlist;
713  build_joinrel_joinlist(joinrel, outer_rel, inner_rel);
714 
715  /*
716  * This is also the right place to check whether the joinrel has any
717  * pending EquivalenceClass joins.
718  */
719  joinrel->has_eclass_joins = has_relevant_eclass_joinclause(root, joinrel);
720 
721  /* Store the partition information. */
722  build_joinrel_partition_info(joinrel, outer_rel, inner_rel, restrictlist,
723  sjinfo->jointype);
724 
725  /*
726  * Set estimates of the joinrel's size.
727  */
728  set_joinrel_size_estimates(root, joinrel, outer_rel, inner_rel,
729  sjinfo, restrictlist);
730 
731  /*
732  * Set the consider_parallel flag if this joinrel could potentially be
733  * scanned within a parallel worker. If this flag is false for either
734  * inner_rel or outer_rel, then it must be false for the joinrel also.
735  * Even if both are true, there might be parallel-restricted expressions
736  * in the targetlist or quals.
737  *
738  * Note that if there are more than two rels in this relation, they could
739  * be divided between inner_rel and outer_rel in any arbitrary way. We
740  * assume this doesn't matter, because we should hit all the same baserels
741  * and joinclauses while building up to this joinrel no matter which we
742  * take; therefore, we should make the same decision here however we get
743  * here.
744  */
745  if (inner_rel->consider_parallel && outer_rel->consider_parallel &&
746  is_parallel_safe(root, (Node *) restrictlist) &&
747  is_parallel_safe(root, (Node *) joinrel->reltarget->exprs))
748  joinrel->consider_parallel = true;
749 
750  /* Add the joinrel to the PlannerInfo. */
751  add_join_rel(root, joinrel);
752 
753  /*
754  * Also, if dynamic-programming join search is active, add the new joinrel
755  * to the appropriate sublist. Note: you might think the Assert on number
756  * of members should be for equality, but some of the level 1 rels might
757  * have been joinrels already, so we can only assert <=.
758  */
759  if (root->join_rel_level)
760  {
761  Assert(root->join_cur_level > 0);
762  Assert(root->join_cur_level <= bms_num_members(joinrel->relids));
763  root->join_rel_level[root->join_cur_level] =
764  lappend(root->join_rel_level[root->join_cur_level], joinrel);
765  }
766 
767  return joinrel;
768 }
bool has_eclass_joins
Definition: pathnodes.h:733
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
int join_cur_level
Definition: pathnodes.h:257
List * unique_for_rels
Definition: pathnodes.h:722
List * statlist
Definition: pathnodes.h:703
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
Definition: relnode.c:439
#define IS_OTHER_REL(rel)
Definition: pathnodes.h:653
void set_joinrel_size_estimates(PlannerInfo *root, RelOptInfo *rel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List *restrictlist)
Definition: costsize.c:4720
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
Oid userid
Definition: pathnodes.h:715
double tuples
Definition: pathnodes.h:705
List * baserestrictinfo
Definition: pathnodes.h:727
bool consider_param_startup
Definition: pathnodes.h:672
Definition: nodes.h:529
List * partial_pathlist
Definition: pathnodes.h:681
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
Index baserestrict_min_security
Definition: pathnodes.h:729
Relids all_partrels
Definition: pathnodes.h:752
bool useridiscurrent
Definition: pathnodes.h:716
List ** nullable_partexprs
Definition: pathnodes.h:754
void add_placeholders_to_joinrel(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: placeholder.c:411
Cost startup
Definition: pathnodes.h:45
double allvisfrac
Definition: pathnodes.h:706
PlannerInfo * subroot
Definition: pathnodes.h:709
bool consider_startup
Definition: pathnodes.h:671
bool is_parallel_safe(PlannerInfo *root, Node *node)
Definition: clauses.c:854
Relids lateral_relids
Definition: pathnodes.h:690
Cost per_tuple
Definition: pathnodes.h:46
static void set_foreign_rel_properties(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:502
double tuple_fraction
Definition: pathnodes.h:336
List ** partexprs
Definition: pathnodes.h:753
static void build_joinrel_tlist(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *input_rel)
Definition: relnode.c:972
Relids min_join_parameterization(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:929
int bms_num_members(const Bitmapset *a)
Definition: bitmapset.c:646
struct Path * cheapest_total_path
Definition: pathnodes.h:683
static List * build_joinrel_restrictlist(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:1058
List * joininfo
Definition: pathnodes.h:731
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
int nparts
Definition: pathnodes.h:743
Relids relids
Definition: pathnodes.h:665
bool partbounds_merged
Definition: pathnodes.h:747
bool has_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1)
Definition: equivclass.c:2713
List * non_unique_for_rels
Definition: pathnodes.h:724
List * ppilist
Definition: pathnodes.h:680
Index relid
Definition: pathnodes.h:693
List * lappend(List *list, void *datum)
Definition: list.c:321
Relids lateral_referencers
Definition: pathnodes.h:701
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
Oid serverid
Definition: pathnodes.h:714
List * exprs
Definition: pathnodes.h:1074
Relids direct_lateral_relids
Definition: pathnodes.h:689
bool consider_partitionwise_join
Definition: pathnodes.h:736
int rel_parallel_workers
Definition: pathnodes.h:711
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
RTEKind rtekind
Definition: pathnodes.h:695
List * indexlist
Definition: pathnodes.h:702
double rows
Definition: pathnodes.h:668
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: pathnodes.h:719
#define makeNode(_type_)
Definition: nodes.h:577
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:745
List ** join_rel_level
Definition: pathnodes.h:256
List * lateral_vars
Definition: pathnodes.h:700
JoinType jointype
Definition: pathnodes.h:2179
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
bool consider_parallel
Definition: pathnodes.h:673
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:928
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
static void build_joinrel_partition_info(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, List *restrictlist, JoinType jointype)
Definition: relnode.c:1630
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
List * partition_qual
Definition: pathnodes.h:749
int32 * attr_widths
Definition: pathnodes.h:699
Definition: pg_list.h:50
struct PathTarget * reltarget
Definition: pathnodes.h:676
QualCost baserestrictcost
Definition: pathnodes.h:728
static void add_join_rel(PlannerInfo *root, RelOptInfo *joinrel)
Definition: relnode.c:540
List * subplan_params
Definition: pathnodes.h:710
Bitmapset * eclass_indexes
Definition: pathnodes.h:707
static void build_joinrel_joinlist(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
Definition: relnode.c:1088
Relids top_parent_relids
Definition: pathnodes.h:738
AttrNumber min_attr
Definition: pathnodes.h:696

◆ build_join_rel_hash()

static void build_join_rel_hash ( PlannerInfo root)
static

Definition at line 397 of file relnode.c.

References Assert, bitmap_hash(), bitmap_match(), CurrentMemoryContext, HASHCTL::entrysize, HASHCTL::hash, HASH_COMPARE, HASH_CONTEXT, hash_create(), HASH_ELEM, HASH_ENTER, HASH_FUNCTION, hash_search(), HASHCTL::hcxt, JoinHashEntry::join_rel, PlannerInfo::join_rel_hash, PlannerInfo::join_rel_list, HASHCTL::keysize, lfirst, HASHCTL::match, MemSet, and RelOptInfo::relids.

Referenced by find_join_rel().

398 {
399  HTAB *hashtab;
400  HASHCTL hash_ctl;
401  ListCell *l;
402 
403  /* Create the hash table */
404  MemSet(&hash_ctl, 0, sizeof(hash_ctl));
405  hash_ctl.keysize = sizeof(Relids);
406  hash_ctl.entrysize = sizeof(JoinHashEntry);
407  hash_ctl.hash = bitmap_hash;
408  hash_ctl.match = bitmap_match;
409  hash_ctl.hcxt = CurrentMemoryContext;
410  hashtab = hash_create("JoinRelHashTable",
411  256L,
412  &hash_ctl,
414 
415  /* Insert all the already-existing joinrels */
416  foreach(l, root->join_rel_list)
417  {
418  RelOptInfo *rel = (RelOptInfo *) lfirst(l);
419  JoinHashEntry *hentry;
420  bool found;
421 
422  hentry = (JoinHashEntry *) hash_search(hashtab,
423  &(rel->relids),
424  HASH_ENTER,
425  &found);
426  Assert(!found);
427  hentry->join_rel = rel;
428  }
429 
430  root->join_rel_hash = hashtab;
431 }
#define HASH_CONTEXT
Definition: hsearch.h:91
#define HASH_ELEM
Definition: hsearch.h:85
MemoryContext hcxt
Definition: hsearch.h:77
Size entrysize
Definition: hsearch.h:72
#define MemSet(start, val, len)
Definition: c.h:949
List * join_rel_list
Definition: pathnodes.h:246
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:919
Definition: dynahash.c:218
struct JoinHashEntry JoinHashEntry
RelOptInfo * join_rel
Definition: relnode.c:38
Relids relids
Definition: pathnodes.h:665
MemoryContext CurrentMemoryContext
Definition: mcxt.c:38
int bitmap_match(const void *key1, const void *key2, Size keysize)
Definition: bitmapset.c:1187
HTAB * hash_create(const char *tabname, long nelem, HASHCTL *info, int flags)
Definition: dynahash.c:326
Size keysize
Definition: hsearch.h:71
HashCompareFunc match
Definition: hsearch.h:74
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:190
#define HASH_COMPARE
Definition: hsearch.h:88
struct HTAB * join_rel_hash
Definition: pathnodes.h:247
Bitmapset * Relids
Definition: pathnodes.h:28
uint32 bitmap_hash(const void *key, Size keysize)
Definition: bitmapset.c:1177
HashValueFunc hash
Definition: hsearch.h:73
#define HASH_FUNCTION
Definition: hsearch.h:87

◆ build_joinrel_joinlist()

static void build_joinrel_joinlist ( RelOptInfo joinrel,
RelOptInfo outer_rel,
RelOptInfo inner_rel 
)
static

Definition at line 1088 of file relnode.c.

References RelOptInfo::joininfo, NIL, and subbuild_joinrel_joinlist().

Referenced by build_join_rel().

1091 {
1092  List *result;
1093 
1094  /*
1095  * Collect all the clauses that syntactically belong above this level,
1096  * eliminating any duplicates (important since we will see many of the
1097  * same clauses arriving from both input relations).
1098  */
1099  result = subbuild_joinrel_joinlist(joinrel, outer_rel->joininfo, NIL);
1100  result = subbuild_joinrel_joinlist(joinrel, inner_rel->joininfo, result);
1101 
1102  joinrel->joininfo = result;
1103 }
#define NIL
Definition: pg_list.h:65
List * joininfo
Definition: pathnodes.h:731
static List * subbuild_joinrel_joinlist(RelOptInfo *joinrel, List *joininfo_list, List *new_joininfo)
Definition: relnode.c:1140
Definition: pg_list.h:50

◆ build_joinrel_partition_info()

static void build_joinrel_partition_info ( RelOptInfo joinrel,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
List restrictlist,
JoinType  jointype 
)
static

Definition at line 1630 of file relnode.c.

References Assert, RelOptInfo::boundinfo, RelOptInfo::consider_partitionwise_join, enable_partitionwise_join, have_partkey_equi_join(), IS_PARTITIONED_REL, RelOptInfo::nullable_partexprs, RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partexprs, and set_joinrel_partition_key_exprs().

Referenced by build_child_join_rel(), and build_join_rel().

1633 {
1634  PartitionScheme part_scheme;
1635 
1636  /* Nothing to do if partitionwise join technique is disabled. */
1638  {
1639  Assert(!IS_PARTITIONED_REL(joinrel));
1640  return;
1641  }
1642 
1643  /*
1644  * We can only consider this join as an input to further partitionwise
1645  * joins if (a) the input relations are partitioned and have
1646  * consider_partitionwise_join=true, (b) the partition schemes match, and
1647  * (c) we can identify an equi-join between the partition keys. Note that
1648  * if it were possible for have_partkey_equi_join to return different
1649  * answers for the same joinrel depending on which join ordering we try
1650  * first, this logic would break. That shouldn't happen, though, because
1651  * of the way the query planner deduces implied equalities and reorders
1652  * the joins. Please see optimizer/README for details.
1653  */
1654  if (outer_rel->part_scheme == NULL || inner_rel->part_scheme == NULL ||
1655  !outer_rel->consider_partitionwise_join ||
1656  !inner_rel->consider_partitionwise_join ||
1657  outer_rel->part_scheme != inner_rel->part_scheme ||
1658  !have_partkey_equi_join(joinrel, outer_rel, inner_rel,
1659  jointype, restrictlist))
1660  {
1661  Assert(!IS_PARTITIONED_REL(joinrel));
1662  return;
1663  }
1664 
1665  part_scheme = outer_rel->part_scheme;
1666 
1667  /*
1668  * This function will be called only once for each joinrel, hence it
1669  * should not have partitioning fields filled yet.
1670  */
1671  Assert(!joinrel->part_scheme && !joinrel->partexprs &&
1672  !joinrel->nullable_partexprs && !joinrel->part_rels &&
1673  !joinrel->boundinfo);
1674 
1675  /*
1676  * If the join relation is partitioned, it uses the same partitioning
1677  * scheme as the joining relations.
1678  *
1679  * Note: we calculate the partition bounds, number of partitions, and
1680  * child-join relations of the join relation in try_partitionwise_join().
1681  */
1682  joinrel->part_scheme = part_scheme;
1683  set_joinrel_partition_key_exprs(joinrel, outer_rel, inner_rel, jointype);
1684 
1685  /*
1686  * Set the consider_partitionwise_join flag.
1687  */
1688  Assert(outer_rel->consider_partitionwise_join);
1689  Assert(inner_rel->consider_partitionwise_join);
1690  joinrel->consider_partitionwise_join = true;
1691 }
static void set_joinrel_partition_key_exprs(RelOptInfo *joinrel, RelOptInfo *outer_rel, RelOptInfo *inner_rel, JoinType jointype)
Definition: relnode.c:1874
List ** nullable_partexprs
Definition: pathnodes.h:754
List ** partexprs
Definition: pathnodes.h:753
bool consider_partitionwise_join
Definition: pathnodes.h:736
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
#define Assert(condition)
Definition: c.h:745
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
bool enable_partitionwise_join
Definition: costsize.c:138
#define IS_PARTITIONED_REL(rel)
Definition: pathnodes.h:766
PartitionScheme part_scheme
Definition: pathnodes.h:742
static bool have_partkey_equi_join(RelOptInfo *joinrel, RelOptInfo *rel1, RelOptInfo *rel2, JoinType jointype, List *restrictlist)
Definition: relnode.c:1701

◆ build_joinrel_restrictlist()

static List * build_joinrel_restrictlist ( PlannerInfo root,
RelOptInfo joinrel,
RelOptInfo outer_rel,
RelOptInfo inner_rel 
)
static

Definition at line 1058 of file relnode.c.

References generate_join_implied_equalities(), RelOptInfo::joininfo, list_concat(), NIL, RelOptInfo::relids, and subbuild_joinrel_restrictlist().

Referenced by build_join_rel().

1062 {
1063  List *result;
1064 
1065  /*
1066  * Collect all the clauses that syntactically belong at this level,
1067  * eliminating any duplicates (important since we will see many of the
1068  * same clauses arriving from both input relations).
1069  */
1070  result = subbuild_joinrel_restrictlist(joinrel, outer_rel->joininfo, NIL);
1071  result = subbuild_joinrel_restrictlist(joinrel, inner_rel->joininfo, result);
1072 
1073  /*
1074  * Add on any clauses derived from EquivalenceClasses. These cannot be
1075  * redundant with the clauses in the joininfo lists, so don't bother
1076  * checking.
1077  */
1078  result = list_concat(result,
1080  joinrel->relids,
1081  outer_rel->relids,
1082  inner_rel));
1083 
1084  return result;
1085 }
#define NIL
Definition: pg_list.h:65
static List * subbuild_joinrel_restrictlist(RelOptInfo *joinrel, List *joininfo_list, List *new_restrictlist)
Definition: relnode.c:1106
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
Definition: equivclass.c:1145
List * joininfo
Definition: pathnodes.h:731
Relids relids
Definition: pathnodes.h:665
Definition: pg_list.h:50

◆ build_joinrel_tlist()

static void build_joinrel_tlist ( PlannerInfo root,
RelOptInfo joinrel,
RelOptInfo input_rel 
)
static

Definition at line 972 of file relnode.c.

References RelOptInfo::attr_needed, RelOptInfo::attr_widths, bms_nonempty_difference(), elog, ERROR, PathTarget::exprs, find_base_rel(), IsA, lappend(), lfirst, RelOptInfo::min_attr, nodeTag, RelOptInfo::relids, RelOptInfo::reltarget, Var::varattno, Var::varno, and PathTarget::width.

Referenced by build_join_rel().

974 {
975  Relids relids = joinrel->relids;
976  ListCell *vars;
977 
978  foreach(vars, input_rel->reltarget->exprs)
979  {
980  Var *var = (Var *) lfirst(vars);
981  RelOptInfo *baserel;
982  int ndx;
983 
984  /*
985  * Ignore PlaceHolderVars in the input tlists; we'll make our own
986  * decisions about whether to copy them.
987  */
988  if (IsA(var, PlaceHolderVar))
989  continue;
990 
991  /*
992  * Otherwise, anything in a baserel or joinrel targetlist ought to be
993  * a Var. (More general cases can only appear in appendrel child
994  * rels, which will never be seen here.)
995  */
996  if (!IsA(var, Var))
997  elog(ERROR, "unexpected node type in rel targetlist: %d",
998  (int) nodeTag(var));
999 
1000  /* Get the Var's original base rel */
1001  baserel = find_base_rel(root, var->varno);
1002 
1003  /* Is it still needed above this joinrel? */
1004  ndx = var->varattno - baserel->min_attr;
1005  if (bms_nonempty_difference(baserel->attr_needed[ndx], relids))
1006  {
1007  /* Yup, add it to the output */
1008  joinrel->reltarget->exprs = lappend(joinrel->reltarget->exprs, var);
1009  /* Vars have cost zero, so no need to adjust reltarget->cost */
1010  joinrel->reltarget->width += baserel->attr_widths[ndx];
1011  }
1012  }
1013 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
Relids * attr_needed
Definition: pathnodes.h:698
AttrNumber varattno
Definition: primnodes.h:186
Definition: primnodes.h:181
#define ERROR
Definition: elog.h:43
Relids relids
Definition: pathnodes.h:665
List * lappend(List *list, void *datum)
Definition: list.c:321
Index varno
Definition: primnodes.h:184
List * exprs
Definition: pathnodes.h:1074
#define lfirst(lc)
Definition: pg_list.h:190
#define nodeTag(nodeptr)
Definition: nodes.h:534
#define elog(elevel,...)
Definition: elog.h:214
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:374
int32 * attr_widths
Definition: pathnodes.h:699
Definition: regcomp.c:224
struct PathTarget * reltarget
Definition: pathnodes.h:676
bool bms_nonempty_difference(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:545
AttrNumber min_attr
Definition: pathnodes.h:696

◆ build_simple_rel()

RelOptInfo* build_simple_rel ( PlannerInfo root,
int  relid,
RelOptInfo parent 
)

Definition at line 194 of file relnode.c.

References RelOptInfo::all_partrels, RelOptInfo::allvisfrac, PlannerInfo::append_rel_array, apply_child_basequals(), Assert, RelOptInfo::attr_needed, RelOptInfo::attr_widths, RelOptInfo::baserestrict_min_security, RelOptInfo::baserestrictcost, RelOptInfo::baserestrictinfo, bms_copy(), bms_make_singleton(), RelOptInfo::boundinfo, RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RangeTblEntry::checkAsUser, Alias::colnames, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_partitionwise_join, RelOptInfo::consider_startup, create_empty_pathtarget(), RelOptInfo::direct_lateral_relids, RelOptInfo::eclass_indexes, elog, RangeTblEntry::eref, ERROR, RelOptInfo::fdw_private, RelOptInfo::fdwroutine, get_relation_info(), RelOptInfo::has_eclass_joins, RelOptInfo::indexlist, RangeTblEntry::inh, InvalidOid, RelOptInfo::joininfo, RelOptInfo::lateral_referencers, RelOptInfo::lateral_relids, RelOptInfo::lateral_vars, list_length(), makeNode, mark_dummy_rel(), RelOptInfo::max_attr, RelOptInfo::min_attr, NIL, RelOptInfo::non_unique_for_rels, RelOptInfo::nparts, RelOptInfo::nullable_partexprs, RelOptInfo::pages, palloc0(), RelOptInfo::part_rels, RelOptInfo::part_scheme, RelOptInfo::partbounds_merged, RelOptInfo::partexprs, RelOptInfo::partial_pathlist, RelOptInfo::partition_qual, RelOptInfo::partitioned_child_rels, RelOptInfo::pathlist, QualCost::per_tuple, RelOptInfo::ppilist, RelOptInfo::rel_parallel_workers, RelOptInfo::relid, RangeTblEntry::relid, RelOptInfo::relids, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, RelOptInfo::reltarget, RelOptInfo::rows, RTE_CTE, RTE_FUNCTION, RTE_NAMEDTUPLESTORE, RTE_RELATION, RTE_RESULT, RTE_SUBQUERY, RTE_TABLEFUNC, RTE_VALUES, RelOptInfo::rtekind, RangeTblEntry::rtekind, RelOptInfo::serverid, PlannerInfo::simple_rel_array, PlannerInfo::simple_rte_array, QualCost::startup, RelOptInfo::statlist, RelOptInfo::subplan_params, RelOptInfo::subroot, RelOptInfo::top_parent_relids, PlannerInfo::tuple_fraction, RelOptInfo::tuples, RelOptInfo::unique_for_rels, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by add_base_rels_to_query(), expand_appendrel_subquery(), expand_inherited_rtentry(), expand_partitioned_rtentry(), plan_cluster_use_sort(), plan_create_index_workers(), query_planner(), and recurse_set_operations().

195 {
196  RelOptInfo *rel;
197  RangeTblEntry *rte;
198 
199  /* Rel should not exist already */
200  Assert(relid > 0 && relid < root->simple_rel_array_size);
201  if (root->simple_rel_array[relid] != NULL)
202  elog(ERROR, "rel %d already exists", relid);
203 
204  /* Fetch RTE for relation */
205  rte = root->simple_rte_array[relid];
206  Assert(rte != NULL);
207 
208  rel = makeNode(RelOptInfo);
210  rel->relids = bms_make_singleton(relid);
211  rel->rows = 0;
212  /* cheap startup cost is interesting iff not all tuples to be retrieved */
213  rel->consider_startup = (root->tuple_fraction > 0);
214  rel->consider_param_startup = false; /* might get changed later */
215  rel->consider_parallel = false; /* might get changed later */
217  rel->pathlist = NIL;
218  rel->ppilist = NIL;
219  rel->partial_pathlist = NIL;
220  rel->cheapest_startup_path = NULL;
221  rel->cheapest_total_path = NULL;
222  rel->cheapest_unique_path = NULL;
224  rel->relid = relid;
225  rel->rtekind = rte->rtekind;
226  /* min_attr, max_attr, attr_needed, attr_widths are set below */
227  rel->lateral_vars = NIL;
228  rel->indexlist = NIL;
229  rel->statlist = NIL;
230  rel->pages = 0;
231  rel->tuples = 0;
232  rel->allvisfrac = 0;
233  rel->eclass_indexes = NULL;
234  rel->subroot = NULL;
235  rel->subplan_params = NIL;
236  rel->rel_parallel_workers = -1; /* set up in get_relation_info */
237  rel->serverid = InvalidOid;
238  rel->userid = rte->checkAsUser;
239  rel->useridiscurrent = false;
240  rel->fdwroutine = NULL;
241  rel->fdw_private = NULL;
242  rel->unique_for_rels = NIL;
243  rel->non_unique_for_rels = NIL;
244  rel->baserestrictinfo = NIL;
245  rel->baserestrictcost.startup = 0;
246  rel->baserestrictcost.per_tuple = 0;
247  rel->baserestrict_min_security = UINT_MAX;
248  rel->joininfo = NIL;
249  rel->has_eclass_joins = false;
250  rel->consider_partitionwise_join = false; /* might get changed later */
251  rel->part_scheme = NULL;
252  rel->nparts = -1;
253  rel->boundinfo = NULL;
254  rel->partbounds_merged = false;
255  rel->partition_qual = NIL;
256  rel->part_rels = NULL;
257  rel->all_partrels = NULL;
258  rel->partexprs = NULL;
259  rel->nullable_partexprs = NULL;
261 
262  /*
263  * Pass assorted information down the inheritance hierarchy.
264  */
265  if (parent)
266  {
267  /*
268  * Each direct or indirect child wants to know the relids of its
269  * topmost parent.
270  */
271  if (parent->top_parent_relids)
272  rel->top_parent_relids = parent->top_parent_relids;
273  else
274  rel->top_parent_relids = bms_copy(parent->relids);
275 
276  /*
277  * Also propagate lateral-reference information from appendrel parent
278  * rels to their child rels. We intentionally give each child rel the
279  * same minimum parameterization, even though it's quite possible that
280  * some don't reference all the lateral rels. This is because any
281  * append path for the parent will have to have the same
282  * parameterization for every child anyway, and there's no value in
283  * forcing extra reparameterize_path() calls. Similarly, a lateral
284  * reference to the parent prevents use of otherwise-movable join rels
285  * for each child.
286  *
287  * It's possible for child rels to have their own children, in which
288  * case the topmost parent's lateral info propagates all the way down.
289  */
291  rel->lateral_relids = parent->lateral_relids;
293  }
294  else
295  {
296  rel->top_parent_relids = NULL;
297  rel->direct_lateral_relids = NULL;
298  rel->lateral_relids = NULL;
299  rel->lateral_referencers = NULL;
300  }
301 
302  /* Check type of rtable entry */
303  switch (rte->rtekind)
304  {
305  case RTE_RELATION:
306  /* Table --- retrieve statistics from the system catalogs */
307  get_relation_info(root, rte->relid, rte->inh, rel);
308  break;
309  case RTE_SUBQUERY:
310  case RTE_FUNCTION:
311  case RTE_TABLEFUNC:
312  case RTE_VALUES:
313  case RTE_CTE:
314  case RTE_NAMEDTUPLESTORE:
315 
316  /*
317  * Subquery, function, tablefunc, values list, CTE, or ENR --- set
318  * up attr range and arrays
319  *
320  * Note: 0 is included in range to support whole-row Vars
321  */
322  rel->min_attr = 0;
323  rel->max_attr = list_length(rte->eref->colnames);
324  rel->attr_needed = (Relids *)
325  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(Relids));
326  rel->attr_widths = (int32 *)
327  palloc0((rel->max_attr - rel->min_attr + 1) * sizeof(int32));
328  break;
329  case RTE_RESULT:
330  /* RTE_RESULT has no columns, nor could it have whole-row Var */
331  rel->min_attr = 0;
332  rel->max_attr = -1;
333  rel->attr_needed = NULL;
334  rel->attr_widths = NULL;
335  break;
336  default:
337  elog(ERROR, "unrecognized RTE kind: %d",
338  (int) rte->rtekind);
339  break;
340  }
341 
342  /*
343  * Copy the parent's quals to the child, with appropriate substitution of
344  * variables. If any constant false or NULL clauses turn up, we can mark
345  * the child as dummy right away. (We must do this immediately so that
346  * pruning works correctly when recursing in expand_partitioned_rtentry.)
347  */
348  if (parent)
349  {
350  AppendRelInfo *appinfo = root->append_rel_array[relid];
351 
352  Assert(appinfo != NULL);
353  if (!apply_child_basequals(root, parent, rel, rte, appinfo))
354  {
355  /*
356  * Some restriction clause reduced to constant FALSE or NULL after
357  * substitution, so this child need not be scanned.
358  */
359  mark_dummy_rel(rel);
360  }
361  }
362 
363  /* Save the finished struct in the query's simple_rel_array */
364  root->simple_rel_array[relid] = rel;
365 
366  return rel;
367 }
bool has_eclass_joins
Definition: pathnodes.h:733
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
List * unique_for_rels
Definition: pathnodes.h:722
List * statlist
Definition: pathnodes.h:703
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids * attr_needed
Definition: pathnodes.h:698
List * colnames
Definition: primnodes.h:43
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
Oid userid
Definition: pathnodes.h:715
double tuples
Definition: pathnodes.h:705
List * baserestrictinfo
Definition: pathnodes.h:727
bool consider_param_startup
Definition: pathnodes.h:672
List * partial_pathlist
Definition: pathnodes.h:681
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
Index baserestrict_min_security
Definition: pathnodes.h:729
Relids all_partrels
Definition: pathnodes.h:752
bool useridiscurrent
Definition: pathnodes.h:716
List ** nullable_partexprs
Definition: pathnodes.h:754
Cost startup
Definition: pathnodes.h:45
double allvisfrac
Definition: pathnodes.h:706
signed int int32
Definition: c.h:362
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
PlannerInfo * subroot
Definition: pathnodes.h:709
bool consider_startup
Definition: pathnodes.h:671
bool apply_child_basequals(PlannerInfo *root, RelOptInfo *parentrel, RelOptInfo *childrel, RangeTblEntry *childRTE, AppendRelInfo *appinfo)
Definition: inherit.c:693
Relids lateral_relids
Definition: pathnodes.h:690
Cost per_tuple
Definition: pathnodes.h:46
double tuple_fraction
Definition: pathnodes.h:336
List ** partexprs
Definition: pathnodes.h:753
#define ERROR
Definition: elog.h:43
struct Path * cheapest_total_path
Definition: pathnodes.h:683
Bitmapset * bms_make_singleton(int x)
Definition: bitmapset.c:186
List * joininfo
Definition: pathnodes.h:731
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
int nparts
Definition: pathnodes.h:743
Relids relids
Definition: pathnodes.h:665
bool partbounds_merged
Definition: pathnodes.h:747
List * non_unique_for_rels
Definition: pathnodes.h:724
List * ppilist
Definition: pathnodes.h:680
Index relid
Definition: pathnodes.h:693
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
Relids lateral_referencers
Definition: pathnodes.h:701
Oid serverid
Definition: pathnodes.h:714
Relids direct_lateral_relids
Definition: pathnodes.h:689
bool consider_partitionwise_join
Definition: pathnodes.h:736
void * palloc0(Size size)
Definition: mcxt.c:981
void mark_dummy_rel(RelOptInfo *rel)
Definition: joinrels.c:1261
int rel_parallel_workers
Definition: pathnodes.h:711
struct AppendRelInfo ** append_rel_array
Definition: pathnodes.h:219
struct PartitionBoundInfoData * boundinfo
Definition: pathnodes.h:746
RTEKind rtekind
Definition: pathnodes.h:695
List * indexlist
Definition: pathnodes.h:702
double rows
Definition: pathnodes.h:668
#define InvalidOid
Definition: postgres_ext.h:36
void * fdw_private
Definition: pathnodes.h:719
#define makeNode(_type_)
Definition: nodes.h:577
BlockNumber pages
Definition: pathnodes.h:704
#define Assert(condition)
Definition: c.h:745
List * lateral_vars
Definition: pathnodes.h:700
struct RelOptInfo ** part_rels
Definition: pathnodes.h:750
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
RTEKind rtekind
Definition: parsenodes.h:977
List * partitioned_child_rels
Definition: pathnodes.h:755
AttrNumber max_attr
Definition: pathnodes.h:697
#define elog(elevel,...)
Definition: elog.h:214
PartitionScheme part_scheme
Definition: pathnodes.h:742
List * pathlist
Definition: pathnodes.h:679
Alias * eref
Definition: parsenodes.h:1116
List * partition_qual
Definition: pathnodes.h:749
int32 * attr_widths
Definition: pathnodes.h:699
struct PathTarget * reltarget
Definition: pathnodes.h:676
QualCost baserestrictcost
Definition: pathnodes.h:728
List * subplan_params
Definition: pathnodes.h:710
Bitmapset * eclass_indexes
Definition: pathnodes.h:707
void get_relation_info(PlannerInfo *root, Oid relationObjectId, bool inhparent, RelOptInfo *rel)
Definition: plancat.c:113
Relids top_parent_relids
Definition: pathnodes.h:738
AttrNumber min_attr
Definition: pathnodes.h:696

◆ expand_planner_arrays()

void expand_planner_arrays ( PlannerInfo root,
int  add_size 
)

Definition at line 152 of file relnode.c.

References add_size(), PlannerInfo::append_rel_array, Assert, MemSet, palloc0(), repalloc(), PlannerInfo::simple_rel_array, PlannerInfo::simple_rel_array_size, and PlannerInfo::simple_rte_array.

Referenced by expand_inherited_rtentry(), and expand_partitioned_rtentry().

153 {
154  int new_size;
155 
156  Assert(add_size > 0);
157 
158  new_size = root->simple_rel_array_size + add_size;
159 
160  root->simple_rel_array = (RelOptInfo **)
162  sizeof(RelOptInfo *) * new_size);
164  0, sizeof(RelOptInfo *) * add_size);
165 
166  root->simple_rte_array = (RangeTblEntry **)
168  sizeof(RangeTblEntry *) * new_size);
170  0, sizeof(RangeTblEntry *) * add_size);
171 
172  if (root->append_rel_array)
173  {
174  root->append_rel_array = (AppendRelInfo **)
176  sizeof(AppendRelInfo *) * new_size);
178  0, sizeof(AppendRelInfo *) * add_size);
179  }
180  else
181  {
182  root->append_rel_array = (AppendRelInfo **)
183  palloc0(sizeof(AppendRelInfo *) * new_size);
184  }
185 
186  root->simple_rel_array_size = new_size;
187 }
#define MemSet(start, val, len)
Definition: c.h:949
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
int simple_rel_array_size
Definition: pathnodes.h:204
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
void * palloc0(Size size)
Definition: mcxt.c:981
struct AppendRelInfo ** append_rel_array
Definition: pathnodes.h:219
Size add_size(Size s1, Size s2)
Definition: shmem.c:498
#define Assert(condition)
Definition: c.h:745
void * repalloc(void *pointer, Size size)
Definition: mcxt.c:1070

◆ fetch_upper_rel()

RelOptInfo* fetch_upper_rel ( PlannerInfo root,
UpperRelationKind  kind,
Relids  relids 
)

Definition at line 1192 of file relnode.c.

References bms_copy(), bms_equal(), RelOptInfo::cheapest_parameterized_paths, RelOptInfo::cheapest_startup_path, RelOptInfo::cheapest_total_path, RelOptInfo::cheapest_unique_path, RelOptInfo::consider_parallel, RelOptInfo::consider_param_startup, RelOptInfo::consider_startup, create_empty_pathtarget(), lappend(), lfirst, makeNode, NIL, RelOptInfo::pathlist, RelOptInfo::relids, RELOPT_UPPER_REL, RelOptInfo::reloptkind, RelOptInfo::reltarget, PlannerInfo::tuple_fraction, and PlannerInfo::upper_rels.

Referenced by add_rtes_to_flat_rtable(), create_distinct_paths(), create_ordered_paths(), create_partial_grouping_paths(), create_window_paths(), generate_nonunion_paths(), generate_recursion_path(), generate_union_paths(), grouping_planner(), inheritance_planner(), make_grouping_rel(), make_subplan(), make_union_unique(), preprocess_minmax_aggregates(), recurse_set_operations(), set_subquery_pathlist(), set_subquery_size_estimates(), SS_process_ctes(), standard_planner(), and subquery_planner().

1193 {
1194  RelOptInfo *upperrel;
1195  ListCell *lc;
1196 
1197  /*
1198  * For the moment, our indexing data structure is just a List for each
1199  * relation kind. If we ever get so many of one kind that this stops
1200  * working well, we can improve it. No code outside this function should
1201  * assume anything about how to find a particular upperrel.
1202  */
1203 
1204  /* If we already made this upperrel for the query, return it */
1205  foreach(lc, root->upper_rels[kind])
1206  {
1207  upperrel = (RelOptInfo *) lfirst(lc);
1208 
1209  if (bms_equal(upperrel->relids, relids))
1210  return upperrel;
1211  }
1212 
1213  upperrel = makeNode(RelOptInfo);
1214  upperrel->reloptkind = RELOPT_UPPER_REL;
1215  upperrel->relids = bms_copy(relids);
1216 
1217  /* cheap startup cost is interesting iff not all tuples to be retrieved */
1218  upperrel->consider_startup = (root->tuple_fraction > 0);
1219  upperrel->consider_param_startup = false;
1220  upperrel->consider_parallel = false; /* might get changed later */
1221  upperrel->reltarget = create_empty_pathtarget();
1222  upperrel->pathlist = NIL;
1223  upperrel->cheapest_startup_path = NULL;
1224  upperrel->cheapest_total_path = NULL;
1225  upperrel->cheapest_unique_path = NULL;
1226  upperrel->cheapest_parameterized_paths = NIL;
1227 
1228  root->upper_rels[kind] = lappend(root->upper_rels[kind], upperrel);
1229 
1230  return upperrel;
1231 }
struct Path * cheapest_unique_path
Definition: pathnodes.h:684
PathTarget * create_empty_pathtarget(void)
Definition: tlist.c:696
#define NIL
Definition: pg_list.h:65
Bitmapset * bms_copy(const Bitmapset *a)
Definition: bitmapset.c:74
RelOptKind reloptkind
Definition: pathnodes.h:662
struct Path * cheapest_startup_path
Definition: pathnodes.h:682
bool consider_param_startup
Definition: pathnodes.h:672
List * cheapest_parameterized_paths
Definition: pathnodes.h:685
bool consider_startup
Definition: pathnodes.h:671
double tuple_fraction
Definition: pathnodes.h:336
struct Path * cheapest_total_path
Definition: pathnodes.h:683
Relids relids
Definition: pathnodes.h:665
List * lappend(List *list, void *datum)
Definition: list.c:321
#define makeNode(_type_)
Definition: nodes.h:577
#define lfirst(lc)
Definition: pg_list.h:190
bool consider_parallel
Definition: pathnodes.h:673
List * pathlist
Definition: pathnodes.h:679
struct PathTarget * reltarget
Definition: pathnodes.h:676
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94
List * upper_rels[UPPERREL_FINAL+1]
Definition: pathnodes.h:311

◆ find_base_rel()

RelOptInfo* find_base_rel ( PlannerInfo root,
int  relid 
)

Definition at line 374 of file relnode.c.

References Assert, elog, ERROR, and PlannerInfo::simple_rel_array.

Referenced by add_join_clause_to_rels(), add_placeholders_to_base_rels(), add_vars_to_targetlist(), build_joinrel_tlist(), clause_selectivity(), create_lateral_join_info(), distribute_restrictinfo_to_rels(), examine_simple_variable(), examine_variable(), finalize_plan(), find_childrel_parents(), find_join_input_rel(), find_single_rel_for_clauses(), get_foreign_key_join_selectivity(), get_matching_part_pairs(), join_is_removable(), make_partitionedrel_pruneinfo(), make_rel_from_joinlist(), reduce_unique_semijoins(), remove_join_clause_from_rels(), remove_rel_from_query(), set_append_rel_size(), set_base_rel_consider_startup(), set_subquery_size_estimates(), and set_subqueryscan_references().

375 {
376  RelOptInfo *rel;
377 
378  Assert(relid > 0);
379 
380  if (relid < root->simple_rel_array_size)
381  {
382  rel = root->simple_rel_array[relid];
383  if (rel)
384  return rel;
385  }
386 
387  elog(ERROR, "no relation entry for relid %d", relid);
388 
389  return NULL; /* keep compiler quiet */
390 }
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
#define ERROR
Definition: elog.h:43
#define Assert(condition)
Definition: c.h:745
#define elog(elevel,...)
Definition: elog.h:214

◆ find_childrel_parents()

Relids find_childrel_parents ( PlannerInfo root,
RelOptInfo rel 
)

Definition at line 1243 of file relnode.c.

References PlannerInfo::append_rel_array, Assert, bms_add_member(), find_base_rel(), AppendRelInfo::parent_relid, RelOptInfo::relid, RELOPT_BASEREL, RELOPT_OTHER_MEMBER_REL, RelOptInfo::reloptkind, and PlannerInfo::simple_rel_array_size.

Referenced by check_index_predicates(), and generate_implied_equalities_for_column().

1244 {
1245  Relids result = NULL;
1246 
1248  Assert(rel->relid > 0 && rel->relid < root->simple_rel_array_size);
1249 
1250  do
1251  {
1252  AppendRelInfo *appinfo = root->append_rel_array[rel->relid];
1253  Index prelid = appinfo->parent_relid;
1254 
1255  result = bms_add_member(result, prelid);
1256 
1257  /* traverse up to the parent rel, loop if it's also a child rel */
1258  rel = find_base_rel(root, prelid);
1259  } while (rel->reloptkind == RELOPT_OTHER_MEMBER_REL);
1260 
1261  Assert(rel->reloptkind == RELOPT_BASEREL);
1262 
1263  return result;
1264 }
RelOptKind reloptkind
Definition: pathnodes.h:662
int simple_rel_array_size
Definition: pathnodes.h:204
Index relid
Definition: pathnodes.h:693
struct AppendRelInfo ** append_rel_array
Definition: pathnodes.h:219
unsigned int Index
Definition: c.h:482
#define Assert(condition)
Definition: c.h:745
Bitmapset * bms_add_member(Bitmapset *a, int x)
Definition: bitmapset.c:736
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
Definition: relnode.c:374
Index parent_relid
Definition: pathnodes.h:2229

◆ find_join_rel()

RelOptInfo* find_join_rel ( PlannerInfo root,
Relids  relids 
)

Definition at line 439 of file relnode.c.

References bms_equal(), build_join_rel_hash(), HASH_FIND, hash_search(), JoinHashEntry::join_rel, PlannerInfo::join_rel_hash, PlannerInfo::join_rel_list, lfirst, list_length(), and RelOptInfo::relids.

Referenced by build_child_join_rel(), build_join_rel(), examine_variable(), find_join_input_rel(), get_matching_part_pairs(), and postgresPlanDirectModify().

440 {
441  /*
442  * Switch to using hash lookup when list grows "too long". The threshold
443  * is arbitrary and is known only here.
444  */
445  if (!root->join_rel_hash && list_length(root->join_rel_list) > 32)
446  build_join_rel_hash(root);
447 
448  /*
449  * Use either hashtable lookup or linear search, as appropriate.
450  *
451  * Note: the seemingly redundant hashkey variable is used to avoid taking
452  * the address of relids; unless the compiler is exceedingly smart, doing
453  * so would force relids out of a register and thus probably slow down the
454  * list-search case.
455  */
456  if (root->join_rel_hash)
457  {
458  Relids hashkey = relids;
459  JoinHashEntry *hentry;
460 
461  hentry = (JoinHashEntry *) hash_search(root->join_rel_hash,
462  &hashkey,
463  HASH_FIND,
464  NULL);
465  if (hentry)
466  return hentry->join_rel;
467  }
468  else
469  {
470  ListCell *l;
471 
472  foreach(l, root->join_rel_list)
473  {
474  RelOptInfo *rel = (RelOptInfo *) lfirst(l);
475 
476  if (bms_equal(rel->relids, relids))
477  return rel;
478  }
479  }
480 
481  return NULL;
482 }
List * join_rel_list
Definition: pathnodes.h:246
void * hash_search(HTAB *hashp, const void *keyPtr, HASHACTION action, bool *foundPtr)
Definition: dynahash.c:919
RelOptInfo * join_rel
Definition: relnode.c:38
Relids relids
Definition: pathnodes.h:665
static void build_join_rel_hash(PlannerInfo *root)
Definition: relnode.c:397
#define lfirst(lc)
Definition: pg_list.h:190
static int list_length(const List *l)
Definition: pg_list.h:169
struct HTAB * join_rel_hash
Definition: pathnodes.h:247
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ find_param_path_info()

ParamPathInfo* find_param_path_info ( RelOptInfo rel,
Relids  required_outer 
)

Definition at line 1608 of file relnode.c.

References bms_equal(), lfirst, ParamPathInfo::ppi_req_outer, and RelOptInfo::ppilist.

Referenced by get_appendrel_parampathinfo(), get_baserel_parampathinfo(), get_joinrel_parampathinfo(), and reparameterize_path_by_child().

1609 {
1610  ListCell *lc;
1611 
1612  foreach(lc, rel->ppilist)
1613  {
1614  ParamPathInfo *ppi = (ParamPathInfo *) lfirst(lc);
1615 
1616  if (bms_equal(ppi->ppi_req_outer, required_outer))
1617  return ppi;
1618  }
1619 
1620  return NULL;
1621 }
List * ppilist
Definition: pathnodes.h:680
#define lfirst(lc)
Definition: pg_list.h:190
Relids ppi_req_outer
Definition: pathnodes.h:1103
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:94

◆ get_appendrel_parampathinfo()

ParamPathInfo* get_appendrel_parampathinfo ( RelOptInfo appendrel,
Relids  required_outer 
)

Definition at line 1576 of file relnode.c.

References Assert, bms_is_empty(), bms_is_subset(), bms_overlap(), find_param_path_info(), lappend(), RelOptInfo::lateral_relids, makeNode, NIL, ParamPathInfo::ppi_clauses, ParamPathInfo::ppi_req_outer, ParamPathInfo::ppi_rows, RelOptInfo::ppilist, and RelOptInfo::relids.

Referenced by create_append_path(), and create_merge_append_path().

1577 {
1578  ParamPathInfo *ppi;
1579 
1580  /* If rel has LATERAL refs, every path for it should account for them */
1581  Assert(bms_is_subset(appendrel->lateral_relids, required_outer));
1582 
1583  /* Unparameterized paths have no ParamPathInfo */
1584  if (bms_is_empty(required_outer))
1585  return NULL;
1586 
1587  Assert(!bms_overlap(appendrel->relids, required_outer));
1588 
1589  /* If we already have a PPI for this parameterization, just return it */
1590  if ((ppi = find_param_path_info(appendrel, required_outer)))
1591  return ppi;
1592 
1593  /* Else build the ParamPathInfo */
1594  ppi = makeNode(ParamPathInfo);
1595  ppi->ppi_req_outer = required_outer;
1596  ppi->ppi_rows = 0;
1597  ppi->ppi_clauses = NIL;
1598  appendrel->ppilist = lappend(appendrel->ppilist, ppi);
1599 
1600  return ppi;
1601 }
#define NIL
Definition: pg_list.h:65
ParamPathInfo * find_param_path_info(RelOptInfo *rel, Relids required_outer)
Definition: relnode.c:1608
Relids lateral_relids
Definition: pathnodes.h:690
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
Relids relids
Definition: pathnodes.h:665
List * ppilist
Definition: pathnodes.h:680
List * lappend(List *list, void *datum)
Definition: list.c:321
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:745
List * ppi_clauses
Definition: pathnodes.h:1105
double ppi_rows
Definition: pathnodes.h:1104
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
Relids ppi_req_outer
Definition: pathnodes.h:1103

◆ get_baserel_parampathinfo()

ParamPathInfo* get_baserel_parampathinfo ( PlannerInfo root,
RelOptInfo baserel,
Relids  required_outer 
)

Definition at line 1279 of file relnode.c.

References Assert, bms_is_empty(), bms_is_subset(), bms_overlap(), bms_union(), find_param_path_info(), generate_join_implied_equalities(), get_parameterized_baserel_size(), join_clause_is_movable_into(), RelOptInfo::joininfo, lappend(), RelOptInfo::lateral_relids, lfirst, list_concat(), makeNode, NIL, ParamPathInfo::ppi_clauses, ParamPathInfo::ppi_req_outer, ParamPathInfo::ppi_rows, RelOptInfo::ppilist, and RelOptInfo::relids.

Referenced by create_append_path(), create_bitmap_and_path(), create_bitmap_heap_path(), create_bitmap_or_path(), create_ctescan_path(), create_foreignscan_path(), create_functionscan_path(), create_gather_merge_path(), create_gather_path(), create_index_path(), create_namedtuplestorescan_path(), create_resultscan_path(), create_samplescan_path(), create_seqscan_path(), create_subqueryscan_path(), create_tablefuncscan_path(), create_tidscan_path(), create_valuesscan_path(), create_worktablescan_path(), postgresGetForeignPaths(), and reparameterize_path().

1281 {
1282  ParamPathInfo *ppi;
1283  Relids joinrelids;
1284  List *pclauses;
1285  double rows;
1286  ListCell *lc;
1287 
1288  /* If rel has LATERAL refs, every path for it should account for them */
1289  Assert(bms_is_subset(baserel->lateral_relids, required_outer));
1290 
1291  /* Unparameterized paths have no ParamPathInfo */
1292  if (bms_is_empty(required_outer))
1293  return NULL;
1294 
1295  Assert(!bms_overlap(baserel->relids, required_outer));
1296 
1297  /* If we already have a PPI for this parameterization, just return it */
1298  if ((ppi = find_param_path_info(baserel, required_outer)))
1299  return ppi;
1300 
1301  /*
1302  * Identify all joinclauses that are movable to this base rel given this
1303  * parameterization.
1304  */
1305  joinrelids = bms_union(baserel->relids, required_outer);
1306  pclauses = NIL;
1307  foreach(lc, baserel->joininfo)
1308  {
1309  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1310 
1311  if (join_clause_is_movable_into(rinfo,
1312  baserel->relids,
1313  joinrelids))
1314  pclauses = lappend(pclauses, rinfo);
1315  }
1316 
1317  /*
1318  * Add in joinclauses generated by EquivalenceClasses, too. (These
1319  * necessarily satisfy join_clause_is_movable_into.)
1320  */
1321  pclauses = list_concat(pclauses,
1323  joinrelids,
1324  required_outer,
1325  baserel));
1326 
1327  /* Estimate the number of rows returned by the parameterized scan */
1328  rows = get_parameterized_baserel_size(root, baserel, pclauses);
1329 
1330  /* And now we can build the ParamPathInfo */
1331  ppi = makeNode(ParamPathInfo);
1332  ppi->ppi_req_outer = required_outer;
1333  ppi->ppi_rows = rows;
1334  ppi->ppi_clauses = pclauses;
1335  baserel->ppilist = lappend(baserel->ppilist, ppi);
1336 
1337  return ppi;
1338 }
#define NIL
Definition: pg_list.h:65
ParamPathInfo * find_param_path_info(RelOptInfo *rel, Relids required_outer)
Definition: relnode.c:1608
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
Relids lateral_relids
Definition: pathnodes.h:690
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
Definition: equivclass.c:1145
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
List * joininfo
Definition: pathnodes.h:731
Relids relids
Definition: pathnodes.h:665
bool join_clause_is_movable_into(RestrictInfo *rinfo, Relids currentrelids, Relids current_and_outer)
Definition: restrictinfo.c:577
List * ppilist
Definition: pathnodes.h:680
List * lappend(List *list, void *datum)
Definition: list.c:321
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
double get_parameterized_baserel_size(PlannerInfo *root, RelOptInfo *rel, List *param_clauses)
Definition: costsize.c:4671
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:190
List * ppi_clauses
Definition: pathnodes.h:1105
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
double ppi_rows
Definition: pathnodes.h:1104
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
Relids ppi_req_outer
Definition: pathnodes.h:1103
Definition: pg_list.h:50

◆ get_joinrel_parampathinfo()

ParamPathInfo* get_joinrel_parampathinfo ( PlannerInfo root,
RelOptInfo joinrel,
Path outer_path,
Path inner_path,
SpecialJoinInfo sjinfo,
Relids  required_outer,
List **  restrict_clauses 
)

Definition at line 1369 of file relnode.c.

References Assert, bms_is_empty(), bms_is_subset(), bms_overlap(), bms_union(), find_param_path_info(), generate_join_implied_equalities(), generate_join_implied_equalities_for_ecs(), get_parameterized_joinrel_size(), join_clause_is_movable_into(), RelOptInfo::joininfo, lappend(), RelOptInfo::lateral_relids, RestrictInfo::left_ec, lfirst, list_concat(), makeNode, NIL, Path::param_info, Path::parent, PATH_REQ_OUTER, ParamPathInfo::ppi_clauses, ParamPathInfo::ppi_req_outer, ParamPathInfo::ppi_rows, RelOptInfo::ppilist, RelOptInfo::relids, and RestrictInfo::right_ec.

Referenced by create_hashjoin_path(), create_mergejoin_path(), and create_nestloop_path().

1375 {
1376  ParamPathInfo *ppi;
1377  Relids join_and_req;
1378  Relids outer_and_req;
1379  Relids inner_and_req;
1380  List *pclauses;
1381  List *eclauses;
1382  List *dropped_ecs;
1383  double rows;
1384  ListCell *lc;
1385 
1386  /* If rel has LATERAL refs, every path for it should account for them */
1387  Assert(bms_is_subset(joinrel->lateral_relids, required_outer));
1388 
1389  /* Unparameterized paths have no ParamPathInfo or extra join clauses */
1390  if (bms_is_empty(required_outer))
1391  return NULL;
1392 
1393  Assert(!bms_overlap(joinrel->relids, required_outer));
1394 
1395  /*
1396  * Identify all joinclauses that are movable to this join rel given this
1397  * parameterization. These are the clauses that are movable into this
1398  * join, but not movable into either input path. Treat an unparameterized
1399  * input path as not accepting parameterized clauses (because it won't,
1400  * per the shortcut exit above), even though the joinclause movement rules
1401  * might allow the same clauses to be moved into a parameterized path for
1402  * that rel.
1403  */
1404  join_and_req = bms_union(joinrel->relids, required_outer);
1405  if (outer_path->param_info)
1406  outer_and_req = bms_union(outer_path->parent->relids,
1407  PATH_REQ_OUTER(outer_path));
1408  else
1409  outer_and_req = NULL; /* outer path does not accept parameters */
1410  if (inner_path->param_info)
1411  inner_and_req = bms_union(inner_path->parent->relids,
1412  PATH_REQ_OUTER(inner_path));
1413  else
1414  inner_and_req = NULL; /* inner path does not accept parameters */
1415 
1416  pclauses = NIL;
1417  foreach(lc, joinrel->joininfo)
1418  {
1419  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1420 
1421  if (join_clause_is_movable_into(rinfo,
1422  joinrel->relids,
1423  join_and_req) &&
1425  outer_path->parent->relids,
1426  outer_and_req) &&
1428  inner_path->parent->relids,
1429  inner_and_req))
1430  pclauses = lappend(pclauses, rinfo);
1431  }
1432 
1433  /* Consider joinclauses generated by EquivalenceClasses, too */
1434  eclauses = generate_join_implied_equalities(root,
1435  join_and_req,
1436  required_outer,
1437  joinrel);
1438  /* We only want ones that aren't movable to lower levels */
1439  dropped_ecs = NIL;
1440  foreach(lc, eclauses)
1441  {
1442  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1443 
1444  /*
1445  * In principle, join_clause_is_movable_into() should accept anything
1446  * returned by generate_join_implied_equalities(); but because its
1447  * analysis is only approximate, sometimes it doesn't. So we
1448  * currently cannot use this Assert; instead just assume it's okay to
1449  * apply the joinclause at this level.
1450  */
1451 #ifdef NOT_USED
1453  joinrel->relids,
1454  join_and_req));
1455 #endif
1456  if (join_clause_is_movable_into(rinfo,
1457  outer_path->parent->relids,
1458  outer_and_req))
1459  continue; /* drop if movable into LHS */
1460  if (join_clause_is_movable_into(rinfo,
1461  inner_path->parent->relids,
1462  inner_and_req))
1463  {
1464  /* drop if movable into RHS, but remember EC for use below */
1465  Assert(rinfo->left_ec == rinfo->right_ec);
1466  dropped_ecs = lappend(dropped_ecs, rinfo->left_ec);
1467  continue;
1468  }
1469  pclauses = lappend(pclauses, rinfo);
1470  }
1471 
1472  /*
1473  * EquivalenceClasses are harder to deal with than we could wish, because
1474  * of the fact that a given EC can generate different clauses depending on
1475  * context. Suppose we have an EC {X.X, Y.Y, Z.Z} where X and Y are the
1476  * LHS and RHS of the current join and Z is in required_outer, and further
1477  * suppose that the inner_path is parameterized by both X and Z. The code
1478  * above will have produced either Z.Z = X.X or Z.Z = Y.Y from that EC,
1479  * and in the latter case will have discarded it as being movable into the
1480  * RHS. However, the EC machinery might have produced either Y.Y = X.X or
1481  * Y.Y = Z.Z as the EC enforcement clause within the inner_path; it will
1482  * not have produced both, and we can't readily tell from here which one
1483  * it did pick. If we add no clause to this join, we'll end up with
1484  * insufficient enforcement of the EC; either Z.Z or X.X will fail to be
1485  * constrained to be equal to the other members of the EC. (When we come
1486  * to join Z to this X/Y path, we will certainly drop whichever EC clause
1487  * is generated at that join, so this omission won't get fixed later.)
1488  *
1489  * To handle this, for each EC we discarded such a clause from, try to
1490  * generate a clause connecting the required_outer rels to the join's LHS
1491  * ("Z.Z = X.X" in the terms of the above example). If successful, and if
1492  * the clause can't be moved to the LHS, add it to the current join's
1493  * restriction clauses. (If an EC cannot generate such a clause then it
1494  * has nothing that needs to be enforced here, while if the clause can be
1495  * moved into the LHS then it should have been enforced within that path.)
1496  *
1497  * Note that we don't need similar processing for ECs whose clause was
1498  * considered to be movable into the LHS, because the LHS can't refer to
1499  * the RHS so there is no comparable ambiguity about what it might
1500  * actually be enforcing internally.
1501  */
1502  if (dropped_ecs)
1503  {
1504  Relids real_outer_and_req;
1505 
1506  real_outer_and_req = bms_union(outer_path->parent->relids,
1507  required_outer);
1508  eclauses =
1510  dropped_ecs,
1511  real_outer_and_req,
1512  required_outer,
1513  outer_path->parent);
1514  foreach(lc, eclauses)
1515  {
1516  RestrictInfo *rinfo = (RestrictInfo *) lfirst(lc);
1517 
1518  /* As above, can't quite assert this here */
1519 #ifdef NOT_USED
1521  outer_path->parent->relids,
1522  real_outer_and_req));
1523 #endif
1524  if (!join_clause_is_movable_into(rinfo,
1525  outer_path->parent->relids,
1526  outer_and_req))
1527  pclauses = lappend(pclauses, rinfo);
1528  }
1529  }
1530 
1531  /*
1532  * Now, attach the identified moved-down clauses to the caller's
1533  * restrict_clauses list. By using list_concat in this order, we leave
1534  * the original list structure of restrict_clauses undamaged.
1535  */
1536  *restrict_clauses = list_concat(pclauses, *restrict_clauses);
1537 
1538  /* If we already have a PPI for this parameterization, just return it */
1539  if ((ppi = find_param_path_info(joinrel, required_outer)))
1540  return ppi;
1541 
1542  /* Estimate the number of rows returned by the parameterized join */
1543  rows = get_parameterized_joinrel_size(root, joinrel,
1544  outer_path,
1545  inner_path,
1546  sjinfo,
1547  *restrict_clauses);
1548 
1549  /*
1550  * And now we can build the ParamPathInfo. No point in saving the
1551  * input-pair-dependent clause list, though.
1552  *
1553  * Note: in GEQO mode, we'll be called in a temporary memory context, but
1554  * the joinrel structure is there too, so no problem.
1555  */
1556  ppi = makeNode(ParamPathInfo);
1557  ppi->ppi_req_outer = required_outer;
1558  ppi->ppi_rows = rows;
1559  ppi->ppi_clauses = NIL;
1560  joinrel->ppilist = lappend(joinrel->ppilist, ppi);
1561 
1562  return ppi;
1563 }
#define NIL
Definition: pg_list.h:65
ParamPathInfo * find_param_path_info(RelOptInfo *rel, Relids required_outer)
Definition: relnode.c:1608
ParamPathInfo * param_info
Definition: pathnodes.h:1147
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
EquivalenceClass * right_ec
Definition: pathnodes.h:2034
Relids lateral_relids
Definition: pathnodes.h:690
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
Definition: equivclass.c:1145
RelOptInfo * parent
Definition: pathnodes.h:1144
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
double get_parameterized_joinrel_size(PlannerInfo *root, RelOptInfo *rel, Path *outer_path, Path *inner_path, SpecialJoinInfo *sjinfo, List *restrict_clauses)
Definition: costsize.c:4752
#define PATH_REQ_OUTER(path)
Definition: pathnodes.h:1163
List * joininfo
Definition: pathnodes.h:731
Relids relids
Definition: pathnodes.h:665
bool join_clause_is_movable_into(RestrictInfo *rinfo, Relids currentrelids, Relids current_and_outer)
Definition: restrictinfo.c:577
List * ppilist
Definition: pathnodes.h:680
List * lappend(List *list, void *datum)
Definition: list.c:321
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
List * generate_join_implied_equalities_for_ecs(PlannerInfo *root, List *eclasses, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
Definition: equivclass.c:1223
#define makeNode(_type_)
Definition: nodes.h:577
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:190
List * ppi_clauses
Definition: pathnodes.h:1105
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
double ppi_rows
Definition: pathnodes.h:1104
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:494
EquivalenceClass * left_ec
Definition: pathnodes.h:2033
Relids ppi_req_outer
Definition: pathnodes.h:1103
Definition: pg_list.h:50

◆ have_partkey_equi_join()

static bool have_partkey_equi_join ( RelOptInfo joinrel,
RelOptInfo rel1,
RelOptInfo rel2,
JoinType  jointype,
List restrictlist 
)
static

Definition at line 1701 of file relnode.c.

References OpExpr::args, Assert, bms_is_subset(), RestrictInfo::can_join, castNode, RestrictInfo::clause, RestrictInfo::hashjoinoperator, IS_OUTER_JOIN, RestrictInfo::left_relids, lfirst_node, linitial, list_member_oid(), lsecond, match_expr_to_partition_keys(), RestrictInfo::mergeopfamilies, OidIsValid, op_in_opfamily(), op_strict(), OpExpr::opno, RelOptInfo::part_scheme, PARTITION_MAX_KEYS, PARTITION_STRATEGY_HASH, PartitionSchemeData::partnatts, PartitionSchemeData::partopfamily, RelOptInfo::relids, RestrictInfo::right_relids, RINFO_IS_PUSHED_DOWN, and PartitionSchemeData::strategy.

Referenced by build_joinrel_partition_info().

1704 {
1705  PartitionScheme part_scheme = rel1->part_scheme;
1706  ListCell *lc;
1707  int cnt_pks;
1708  bool pk_has_clause[PARTITION_MAX_KEYS];
1709  bool strict_op;
1710 
1711  /*
1712  * This function must only be called when the joined relations have same
1713  * partitioning scheme.
1714  */
1715  Assert(rel1->part_scheme == rel2->part_scheme);
1716  Assert(part_scheme);
1717 
1718  memset(pk_has_clause, 0, sizeof(pk_has_clause));
1719  foreach(lc, restrictlist)
1720  {
1721  RestrictInfo *rinfo = lfirst_node(RestrictInfo, lc);
1722  OpExpr *opexpr;
1723  Expr *expr1;
1724  Expr *expr2;
1725  int ipk1;
1726  int ipk2;
1727 
1728  /* If processing an outer join, only use its own join clauses. */
1729  if (IS_OUTER_JOIN(jointype) &&
1730  RINFO_IS_PUSHED_DOWN(rinfo, joinrel->relids))
1731  continue;
1732 
1733  /* Skip clauses which can not be used for a join. */
1734  if (!rinfo->can_join)
1735  continue;
1736 
1737  /* Skip clauses which are not equality conditions. */
1738  if (!rinfo->mergeopfamilies && !OidIsValid(rinfo->hashjoinoperator))
1739  continue;
1740 
1741  /* Should be OK to assume it's an OpExpr. */
1742  opexpr = castNode(OpExpr, rinfo->clause);
1743 
1744  /* Match the operands to the relation. */
1745  if (bms_is_subset(rinfo->left_relids, rel1->relids) &&
1746  bms_is_subset(rinfo->right_relids, rel2->relids))
1747  {
1748  expr1 = linitial(opexpr->args);
1749  expr2 = lsecond(opexpr->args);
1750  }
1751  else if (bms_is_subset(rinfo->left_relids, rel2->relids) &&
1752  bms_is_subset(rinfo->right_relids, rel1->relids))
1753  {
1754  expr1 = lsecond(opexpr->args);
1755  expr2 = linitial(opexpr->args);
1756  }
1757  else
1758  continue;
1759 
1760  /*
1761  * Now we need to know whether the join operator is strict; see
1762  * comments in pathnodes.h.
1763  */
1764  strict_op = op_strict(opexpr->opno);
1765 
1766  /*
1767  * Only clauses referencing the partition keys are useful for
1768  * partitionwise join.
1769  */
1770  ipk1 = match_expr_to_partition_keys(expr1, rel1, strict_op);
1771  if (ipk1 < 0)
1772  continue;
1773  ipk2 = match_expr_to_partition_keys(expr2, rel2, strict_op);
1774  if (ipk2 < 0)
1775  continue;
1776 
1777  /*
1778  * If the clause refers to keys at different ordinal positions, it can
1779  * not be used for partitionwise join.
1780  */
1781  if (ipk1 != ipk2)
1782  continue;
1783 
1784  /*
1785  * The clause allows partitionwise join only if it uses the same
1786  * operator family as that specified by the partition key.
1787  */
1789  {
1790  if (!OidIsValid(rinfo->hashjoinoperator) ||
1792  part_scheme->partopfamily[ipk1]))
1793  continue;
1794  }
1795  else if (!list_member_oid(rinfo->mergeopfamilies,
1796  part_scheme->partopfamily[ipk1]))
1797  continue;
1798 
1799  /* Mark the partition key as having an equi-join clause. */
1800  pk_has_clause[ipk1] = true;
1801  }
1802 
1803  /* Check whether every partition key has an equi-join condition. */
1804  for (cnt_pks = 0; cnt_pks < part_scheme->partnatts; cnt_pks++)
1805  {
1806  if (!pk_has_clause[cnt_pks])
1807  return false;
1808  }
1809 
1810  return true;
1811 }
bool op_in_opfamily(Oid opno, Oid opfamily)
Definition: lsyscache.c:64
bool op_strict(Oid opno)
Definition: lsyscache.c:1389
#define castNode(_type_, nodeptr)
Definition: nodes.h:598
#define IS_OUTER_JOIN(jointype)
Definition: nodes.h:745
#define PARTITION_MAX_KEYS
Relids left_relids
Definition: pathnodes.h:2012
#define OidIsValid(objectId)
Definition: c.h:651
List * mergeopfamilies
Definition: pathnodes.h:2030
#define lsecond(l)
Definition: pg_list.h:200
#define linitial(l)
Definition: pg_list.h:195
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
#define lfirst_node(type, lc)
Definition: pg_list.h:193
static int match_expr_to_partition_keys(Expr *expr, RelOptInfo *rel, bool strict_op)
Definition: relnode.c:1825
Relids relids
Definition: pathnodes.h:665
Expr * clause
Definition: pathnodes.h:1985
#define PARTITION_STRATEGY_HASH
Definition: parsenodes.h:801
#define RINFO_IS_PUSHED_DOWN(rinfo, joinrelids)
Definition: pathnodes.h:2062
Relids right_relids
Definition: pathnodes.h:2013
bool list_member_oid(const List *list, Oid datum)
Definition: list.c:674
#define Assert(condition)
Definition: c.h:745
Oid hashjoinoperator
Definition: pathnodes.h:2043
PartitionScheme part_scheme
Definition: pathnodes.h:742
Oid opno
Definition: primnodes.h:516
List * args
Definition: primnodes.h:522

◆ match_expr_to_partition_keys()

static int match_expr_to_partition_keys ( Expr expr,
RelOptInfo rel,
bool  strict_op 
)
static

Definition at line 1825 of file relnode.c.

References arg, Assert, castNode, equal(), IsA, lfirst, RelOptInfo::nullable_partexprs, RelOptInfo::part_scheme, RelOptInfo::partexprs, and PartitionSchemeData::partnatts.

Referenced by have_partkey_equi_join().

1826 {
1827  int cnt;
1828 
1829  /* This function should be called only for partitioned relations. */
1830  Assert(rel->part_scheme);
1831  Assert(rel->partexprs);
1832  Assert(rel->nullable_partexprs);
1833 
1834  /* Remove any relabel decorations. */
1835  while (IsA(expr, RelabelType))
1836  expr = (Expr *) (castNode(RelabelType, expr))->arg;
1837 
1838  for (cnt = 0; cnt < rel->part_scheme->partnatts; cnt++)
1839  {
1840  ListCell *lc;
1841 
1842  /* We can always match to the non-nullable partition keys. */
1843  foreach(lc, rel->partexprs[cnt])
1844  {
1845  if (equal(lfirst(lc), expr))
1846  return cnt;
1847  }
1848 
1849  if (!strict_op)
1850  continue;
1851 
1852  /*
1853  * If it's a strict join operator then a NULL partition key on one
1854  * side will not join to any partition key on the other side, and in
1855  * particular such a row can't join to a row from a different
1856  * partition on the other side. So, it's okay to search the nullable
1857  * partition keys as well.
1858  */
1859  foreach(lc, rel->nullable_partexprs[cnt])
1860  {
1861  if (equal(lfirst(lc), expr))
1862  return cnt;
1863  }
1864  }
1865 
1866  return -1;
1867 }
#define IsA(nodeptr, _type_)
Definition: nodes.h:580
bool equal(const void *a, const void *b)
Definition: equalfuncs.c:3032
#define castNode(_type_, nodeptr)
Definition: nodes.h:598
List ** nullable_partexprs
Definition: pathnodes.h:754
List ** partexprs
Definition: pathnodes.h:753
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:190
void * arg
PartitionScheme part_scheme
Definition: pathnodes.h:742

◆ min_join_parameterization()

Relids min_join_parameterization ( PlannerInfo root,
Relids  joinrelids,
RelOptInfo outer_rel,
RelOptInfo inner_rel 
)

Definition at line 929 of file relnode.c.

References bms_del_members(), bms_is_empty(), bms_union(), and RelOptInfo::lateral_relids.

Referenced by build_join_rel(), and join_is_legal().

933 {
934  Relids result;
935 
936  /*
937  * Basically we just need the union of the inputs' lateral_relids, less
938  * whatever is already in the join.
939  *
940  * It's not immediately obvious that this is a valid way to compute the
941  * result, because it might seem that we're ignoring possible lateral refs
942  * of PlaceHolderVars that are due to be computed at the join but not in
943  * either input. However, because create_lateral_join_info() already
944  * charged all such PHV refs to each member baserel of the join, they'll
945  * be accounted for already in the inputs' lateral_relids. Likewise, we
946  * do not need to worry about doing transitive closure here, because that
947  * was already accounted for in the original baserel lateral_relids.
948  */
949  result = bms_union(outer_rel->lateral_relids, inner_rel->lateral_relids);
950  result = bms_del_members(result, joinrelids);
951 
952  /* Maintain invariant that result is exactly NULL if empty */
953  if (bms_is_empty(result))
954  result = NULL;
955 
956  return result;
957 }
Relids lateral_relids
Definition: pathnodes.h:690
bool bms_is_empty(const Bitmapset *a)
Definition: bitmapset.c:701
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:225
Bitmapset * bms_del_members(Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:928

◆ set_foreign_rel_properties()

static void set_foreign_rel_properties ( RelOptInfo joinrel,
RelOptInfo outer_rel,
RelOptInfo inner_rel 
)
static

Definition at line 502 of file relnode.c.

References RelOptInfo::fdwroutine, GetUserId(), OidIsValid, RelOptInfo::serverid, RelOptInfo::userid, and RelOptInfo::useridiscurrent.

Referenced by build_child_join_rel(), and build_join_rel().

504 {
505  if (OidIsValid(outer_rel->serverid) &&
506  inner_rel->serverid == outer_rel->serverid)
507  {
508  if (inner_rel->userid == outer_rel->userid)
509  {
510  joinrel->serverid = outer_rel->serverid;
511  joinrel->userid = outer_rel->userid;
512  joinrel->useridiscurrent = outer_rel->useridiscurrent || inner_rel->useridiscurrent;
513  joinrel->fdwroutine = outer_rel->fdwroutine;
514  }
515  else if (!OidIsValid(inner_rel->userid) &&
516  outer_rel->userid == GetUserId())
517  {
518  joinrel->serverid = outer_rel->serverid;
519  joinrel->userid = outer_rel->userid;
520  joinrel->useridiscurrent = true;
521  joinrel->fdwroutine = outer_rel->fdwroutine;
522  }
523  else if (!OidIsValid(outer_rel->userid) &&
524  inner_rel->userid == GetUserId())
525  {
526  joinrel->serverid = outer_rel->serverid;
527  joinrel->userid = inner_rel->userid;
528  joinrel->useridiscurrent = true;
529  joinrel->fdwroutine = outer_rel->fdwroutine;
530  }
531  }
532 }
Oid GetUserId(void)
Definition: miscinit.c:476
Oid userid
Definition: pathnodes.h:715
bool useridiscurrent
Definition: pathnodes.h:716
#define OidIsValid(objectId)
Definition: c.h:651
struct FdwRoutine * fdwroutine
Definition: pathnodes.h:718
Oid serverid
Definition: pathnodes.h:714

◆ set_joinrel_partition_key_exprs()

static void set_joinrel_partition_key_exprs ( RelOptInfo joinrel,
RelOptInfo outer_rel,
RelOptInfo inner_rel,
JoinType  jointype 
)
static

Definition at line 1874 of file relnode.c.

References CoalesceExpr::args, CoalesceExpr::coalescecollid, CoalesceExpr::coalescetype, elog, ERROR, exprCollation(), exprType(), JOIN_ANTI, JOIN_FULL, JOIN_INNER, JOIN_LEFT, JOIN_SEMI, lappend(), lfirst, list_concat(), list_concat_copy(), list_copy(), list_make2, CoalesceExpr::location, makeNode, NIL, RelOptInfo::nullable_partexprs, palloc0(), RelOptInfo::part_scheme, RelOptInfo::partexprs, and PartitionSchemeData::partnatts.

Referenced by build_joinrel_partition_info().

1877 {
1878  PartitionScheme part_scheme = joinrel->part_scheme;
1879  int partnatts = part_scheme->partnatts;
1880 
1881  joinrel->partexprs = (List **) palloc0(sizeof(List *) * partnatts);
1882  joinrel->nullable_partexprs =
1883  (List **) palloc0(sizeof(List *) * partnatts);
1884 
1885  /*
1886  * The joinrel's partition expressions are the same as those of the input
1887  * rels, but we must properly classify them as nullable or not in the
1888  * joinrel's output. (Also, we add some more partition expressions if
1889  * it's a FULL JOIN.)
1890  */
1891  for (int cnt = 0; cnt < partnatts; cnt++)
1892  {
1893  /* mark these const to enforce that we copy them properly */
1894  const List *outer_expr = outer_rel->partexprs[cnt];
1895  const List *outer_null_expr = outer_rel->nullable_partexprs[cnt];
1896  const List *inner_expr = inner_rel->partexprs[cnt];
1897  const List *inner_null_expr = inner_rel->nullable_partexprs[cnt];
1898  List *partexpr = NIL;
1899  List *nullable_partexpr = NIL;
1900  ListCell *lc;
1901 
1902  switch (jointype)
1903  {
1904  /*
1905  * A join relation resulting from an INNER join may be
1906  * regarded as partitioned by either of the inner and outer
1907  * relation keys. For example, A INNER JOIN B ON A.a = B.b
1908  * can be regarded as partitioned on either A.a or B.b. So we
1909  * add both keys to the joinrel's partexpr lists. However,
1910  * anything that was already nullable still has to be treated
1911  * as nullable.
1912  */
1913  case JOIN_INNER:
1914  partexpr = list_concat_copy(outer_expr, inner_expr);
1915  nullable_partexpr = list_concat_copy(outer_null_expr,
1916  inner_null_expr);
1917  break;
1918 
1919  /*
1920  * A join relation resulting from a SEMI or ANTI join may be
1921  * regarded as partitioned by the outer relation keys. The
1922  * inner relation's keys are no longer interesting; since they
1923  * aren't visible in the join output, nothing could join to
1924  * them.
1925  */
1926  case JOIN_SEMI:
1927  case JOIN_ANTI:
1928  partexpr = list_copy(outer_expr);
1929  nullable_partexpr = list_copy(outer_null_expr);
1930  break;
1931 
1932  /*
1933  * A join relation resulting from a LEFT OUTER JOIN likewise
1934  * may be regarded as partitioned on the (non-nullable) outer
1935  * relation keys. The inner (nullable) relation keys are okay
1936  * as partition keys for further joins as long as they involve
1937  * strict join operators.
1938  */
1939  case JOIN_LEFT:
1940  partexpr = list_copy(outer_expr);
1941  nullable_partexpr = list_concat_copy(inner_expr,
1942  outer_null_expr);
1943  nullable_partexpr = list_concat(nullable_partexpr,
1944  inner_null_expr);
1945  break;
1946 
1947  /*
1948  * For FULL OUTER JOINs, both relations are nullable, so the
1949  * resulting join relation may be regarded as partitioned on
1950  * either of inner and outer relation keys, but only for joins
1951  * that involve strict join operators.
1952  */
1953  case JOIN_FULL:
1954  nullable_partexpr = list_concat_copy(outer_expr,
1955  inner_expr);
1956  nullable_partexpr = list_concat(nullable_partexpr,
1957  outer_null_expr);
1958  nullable_partexpr = list_concat(nullable_partexpr,
1959  inner_null_expr);
1960 
1961  /*
1962  * Also add CoalesceExprs corresponding to each possible
1963  * full-join output variable (that is, left side coalesced to
1964  * right side), so that we can match equijoin expressions
1965  * using those variables. We really only need these for
1966  * columns merged by JOIN USING, and only with the pairs of
1967  * input items that correspond to the data structures that
1968  * parse analysis would build for such variables. But it's
1969  * hard to tell which those are, so just make all the pairs.
1970  * Extra items in the nullable_partexprs list won't cause big
1971  * problems. (It's possible that such items will get matched
1972  * to user-written COALESCEs, but it should still be valid to
1973  * partition on those, since they're going to be either the
1974  * partition column or NULL; it's the same argument as for
1975  * partitionwise nesting of any outer join.) We assume no
1976  * type coercions are needed to make the coalesce expressions,
1977  * since columns of different types won't have gotten
1978  * classified as the same PartitionScheme.
1979  */
1980  foreach(lc, list_concat_copy(outer_expr, outer_null_expr))
1981  {
1982  Node *larg = (Node *) lfirst(lc);
1983  ListCell *lc2;
1984 
1985  foreach(lc2, list_concat_copy(inner_expr, inner_null_expr))
1986  {
1987  Node *rarg = (Node *) lfirst(lc2);
1989 
1990  c->coalescetype = exprType(larg);
1991  c->coalescecollid = exprCollation(larg);
1992  c->args = list_make2(larg, rarg);
1993  c->location = -1;
1994  nullable_partexpr = lappend(nullable_partexpr, c);
1995  }
1996  }
1997  break;
1998 
1999  default:
2000  elog(ERROR, "unrecognized join type: %d", (int) jointype);
2001  }
2002 
2003  joinrel->partexprs[cnt] = partexpr;
2004  joinrel->nullable_partexprs[cnt] = nullable_partexpr;
2005  }
2006 }
#define list_make2(x1, x2)
Definition: pg_list.h:229
#define NIL
Definition: pg_list.h:65
List * list_copy(const List *oldlist)
Definition: list.c:1403
Definition: nodes.h:529
List * list_concat(List *list1, const List *list2)
Definition: list.c:515
List ** nullable_partexprs
Definition: pathnodes.h:754
List ** partexprs
Definition: pathnodes.h:753
#define ERROR
Definition: elog.h:43
List * args
Definition: primnodes.h:1086
char * c
List * list_concat_copy(const List *list1, const List *list2)
Definition: list.c:552
List * lappend(List *list, void *datum)
Definition: list.c:321
void * palloc0(Size size)
Definition: mcxt.c:981
#define makeNode(_type_)
Definition: nodes.h:577
#define lfirst(lc)
Definition: pg_list.h:190
Oid exprType(const Node *expr)
Definition: nodeFuncs.c:41
Oid exprCollation(const Node *expr)
Definition: nodeFuncs.c:768
#define elog(elevel,...)
Definition: elog.h:214
Oid coalescetype
Definition: primnodes.h:1084
PartitionScheme part_scheme
Definition: pathnodes.h:742
Definition: pg_list.h:50
Oid coalescecollid
Definition: primnodes.h:1085

◆ setup_simple_rel_arrays()

void setup_simple_rel_arrays ( PlannerInfo root)

Definition at line 83 of file relnode.c.

References PlannerInfo::append_rel_array, PlannerInfo::append_rel_list, Assert, AppendRelInfo::child_relid, elog, ERROR, lfirst, lfirst_node, list_length(), NIL, palloc0(), PlannerInfo::parse, Query::rtable, PlannerInfo::simple_rel_array, PlannerInfo::simple_rel_array_size, and PlannerInfo::simple_rte_array.

Referenced by plan_cluster_use_sort(), plan_create_index_workers(), plan_set_operations(), and query_planner().

84 {
85  int size;
86  Index rti;
87  ListCell *lc;
88 
89  /* Arrays are accessed using RT indexes (1..N) */
90  size = list_length(root->parse->rtable) + 1;
91  root->simple_rel_array_size = size;
92 
93  /*
94  * simple_rel_array is initialized to all NULLs, since no RelOptInfos
95  * exist yet. It'll be filled by later calls to build_simple_rel().
96  */
97  root->simple_rel_array = (RelOptInfo **)
98  palloc0(size * sizeof(RelOptInfo *));
99 
100  /* simple_rte_array is an array equivalent of the rtable list */
101  root->simple_rte_array = (RangeTblEntry **)
102  palloc0(size * sizeof(RangeTblEntry *));
103  rti = 1;
104  foreach(lc, root->parse->rtable)
105  {
106  RangeTblEntry *rte = (RangeTblEntry *) lfirst(lc);
107 
108  root->simple_rte_array[rti++] = rte;
109  }
110 
111  /* append_rel_array is not needed if there are no AppendRelInfos */
112  if (root->append_rel_list == NIL)
113  {
114  root->append_rel_array = NULL;
115  return;
116  }
117 
118  root->append_rel_array = (AppendRelInfo **)
119  palloc0(size * sizeof(AppendRelInfo *));
120 
121  /*
122  * append_rel_array is filled with any already-existing AppendRelInfos,
123  * which currently could only come from UNION ALL flattening. We might
124  * add more later during inheritance expansion, but it's the
125  * responsibility of the expansion code to update the array properly.
126  */
127  foreach(lc, root->append_rel_list)
128  {
129  AppendRelInfo *appinfo = lfirst_node(AppendRelInfo, lc);
130  int child_relid = appinfo->child_relid;
131 
132  /* Sanity check */
133  Assert(child_relid < size);
134 
135  if (root->append_rel_array[child_relid])
136  elog(ERROR, "child relation already exists");
137 
138  root->append_rel_array[child_relid] = appinfo;
139  }
140 }
#define NIL
Definition: pg_list.h:65
Query * parse
Definition: pathnodes.h:179
struct RelOptInfo ** simple_rel_array
Definition: pathnodes.h:203
List * rtable
Definition: parsenodes.h:137
#define ERROR
Definition: elog.h:43
#define lfirst_node(type, lc)
Definition: pg_list.h:193
int simple_rel_array_size
Definition: pathnodes.h:204
RangeTblEntry ** simple_rte_array
Definition: pathnodes.h:211
void * palloc0(Size size)
Definition: mcxt.c:981
List * append_rel_list
Definition: pathnodes.h:290
struct AppendRelInfo ** append_rel_array
Definition: pathnodes.h:219
unsigned int Index
Definition: c.h:482
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:190
static int list_length(const List *l)
Definition: pg_list.h:169
#define elog(elevel,...)
Definition: elog.h:214
Index child_relid
Definition: pathnodes.h:2230

◆ subbuild_joinrel_joinlist()

static List * subbuild_joinrel_joinlist ( RelOptInfo joinrel,
List joininfo_list,
List new_joininfo 
)
static

Definition at line 1140 of file relnode.c.

References Assert, bms_is_subset(), lfirst, list_append_unique_ptr(), RelOptInfo::relids, RELOPT_JOINREL, RelOptInfo::reloptkind, and RestrictInfo::required_relids.

Referenced by build_joinrel_joinlist().

1143 {
1144  ListCell *l;
1145 
1146  /* Expected to be called only for join between parent relations. */
1147  Assert(joinrel->reloptkind == RELOPT_JOINREL);
1148 
1149  foreach(l, joininfo_list)
1150  {
1151  RestrictInfo *rinfo = (RestrictInfo *) lfirst(l);
1152 
1153  if (bms_is_subset(rinfo->required_relids, joinrel->relids))
1154  {
1155  /*
1156  * This clause becomes a restriction clause for the joinrel, since
1157  * it refers to no outside rels. So we can ignore it in this
1158  * routine.
1159  */
1160  }
1161  else
1162  {
1163  /*
1164  * This clause is still a join clause at this level, so add it to
1165  * the new joininfo list, being careful to eliminate duplicates.
1166  * (Since RestrictInfo nodes in different joinlists will have been
1167  * multiply-linked rather than copied, pointer equality should be
1168  * a sufficient test.)
1169  */
1170  new_joininfo = list_append_unique_ptr(new_joininfo, rinfo);
1171  }
1172  }
1173 
1174  return new_joininfo;
1175 }
RelOptKind reloptkind
Definition: pathnodes.h:662
Relids required_relids
Definition: pathnodes.h:2003
List * list_append_unique_ptr(List *list, void *datum)
Definition: list.c:1193
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
Relids relids
Definition: pathnodes.h:665
#define Assert(condition)
Definition: c.h:745
#define lfirst(lc)
Definition: pg_list.h:190

◆ subbuild_joinrel_restrictlist()

static List * subbuild_joinrel_restrictlist ( RelOptInfo joinrel,
List joininfo_list,
List new_restrictlist 
)
static

Definition at line 1106 of file relnode.c.

References bms_is_subset(), lfirst, list_append_unique_ptr(), RelOptInfo::relids, and RestrictInfo::required_relids.

Referenced by build_joinrel_restrictlist().

1109 {
1110  ListCell *l;
1111 
1112  foreach(l, joininfo_list)
1113  {
1114  RestrictInfo *rinfo = (RestrictInfo *) lfirst(l);
1115 
1116  if (bms_is_subset(rinfo->required_relids, joinrel->relids))
1117  {
1118  /*
1119  * This clause becomes a restriction clause for the joinrel, since
1120  * it refers to no outside rels. Add it to the list, being
1121  * careful to eliminate duplicates. (Since RestrictInfo nodes in
1122  * different joinlists will have been multiply-linked rather than
1123  * copied, pointer equality should be a sufficient test.)
1124  */
1125  new_restrictlist = list_append_unique_ptr(new_restrictlist, rinfo);
1126  }
1127  else
1128  {
1129  /*
1130  * This clause is still a join clause at this level, so we ignore
1131  * it in this routine.
1132  */
1133  }
1134  }
1135 
1136  return new_restrictlist;
1137 }
Relids required_relids
Definition: pathnodes.h:2003
List * list_append_unique_ptr(List *list, void *datum)
Definition: list.c:1193
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
Definition: bitmapset.c:315
Relids relids
Definition: pathnodes.h:665
#define lfirst(lc)
Definition: pg_list.h:190