28 List *other_rels_list,
37 bool only_pushed_down);
44 List *parent_restrictlist);
73 List **joinrels = root->join_rel_level;
89 foreach(r, joinrels[level - 1])
109 List *other_rels_list;
114 other_rels_list = joinrels[level - 1];
115 other_rels =
lnext(other_rels_list, r);
119 other_rels_list = joinrels[1];
158 int other_level = level - k;
167 foreach(r, joinrels[k])
170 List *other_rels_list;
183 if (k == other_level)
186 other_rels_list = joinrels[k];
187 other_rels =
lnext(other_rels_list, r);
191 other_rels_list = joinrels[other_level];
235 if (joinrels[level] ==
NIL)
241 foreach(r, joinrels[level - 1])
268 if (joinrels[level] ==
NIL &&
271 elog(
ERROR,
"failed to build any %d-way joins", level);
299 List *other_rels_list,
337 foreach(l, other_rels)
374 bool must_be_leftjoin;
391 unique_ified =
false;
392 must_be_leftjoin =
false;
451 match_sjinfo = sjinfo;
459 match_sjinfo = sjinfo;
491 match_sjinfo = sjinfo;
503 match_sjinfo = sjinfo;
546 must_be_leftjoin =
true;
559 if (must_be_leftjoin &&
560 (match_sjinfo == NULL ||
591 if (lateral_fwd && lateral_rev)
608 else if (lateral_rev)
639 if (join_lateral_rels)
670 *sjinfo_p = match_sjinfo;
671 *reversed_p = reversed;
714 if (sjinfo && sjinfo->
ojrelid != 0)
733 sjinfo = &sjinfo_data;
734 sjinfo->type = T_SpecialJoinInfo;
864 (
errcode(ERRCODE_FEATURE_NOT_SUPPORTED),
865 errmsg(
"FULL JOIN is only supported with merge-joinable or hash-joinable join conditions")));
1134 foreach(lc, root->initial_rels)
1152 &sjinfo, &reversed))
1316 bool only_pushed_down)
1326 foreach(lc, restrictlist)
1338 if (con->constisnull)
1370 List *parent_restrictlist)
1384 if (joinrel->part_scheme == NULL || joinrel->
nparts == 0)
1407 Assert(joinrel->part_scheme == rel1->part_scheme &&
1408 joinrel->part_scheme == rel2->part_scheme);
1426 for (cnt_parts = 0; cnt_parts < joinrel->
nparts; cnt_parts++)
1433 List *child_restrictlist;
1443 lcr1 =
lnext(parts1, lcr1);
1444 lcr2 =
lnext(parts2, lcr2);
1448 child_rel1 = rel1->part_rels[cnt_parts];
1449 child_rel2 = rel2->part_rels[cnt_parts];
1452 rel1_empty = (child_rel1 == NULL ||
IS_DUMMY_REL(child_rel1));
1453 rel2_empty = (child_rel2 == NULL ||
IS_DUMMY_REL(child_rel2));
1466 if (rel1_empty || rel2_empty)
1475 if (rel1_empty && rel2_empty)
1480 elog(
ERROR,
"unrecognized join type: %d",
1490 if (child_rel1 == NULL || child_rel2 == NULL)
1534 if (child_sjinfo->
ojrelid != 0)
1545 child_restrictlist =
1547 (
Node *) parent_restrictlist,
1548 nappinfos, appinfos);
1551 child_joinrel = joinrel->part_rels[cnt_parts];
1555 joinrel, child_restrictlist,
1557 joinrel->part_rels[cnt_parts] = child_joinrel;
1566 child_joinrel, child_sjinfo,
1567 child_restrictlist);
1584 int right_nappinfos;
1593 left_nappinfos, left_appinfos);
1598 left_nappinfos, left_appinfos);
1608 pfree(left_appinfos);
1609 pfree(right_appinfos);
1628 if (joinrel->
nparts == -1)
1634 Assert(joinrel->boundinfo == NULL);
1635 Assert(joinrel->part_rels == NULL);
1653 rel1->boundinfo, rel2->boundinfo))
1655 boundinfo = rel1->boundinfo;
1667 if (boundinfo == NULL)
1677 joinrel->boundinfo = boundinfo;
1678 joinrel->
nparts = nparts;
1679 joinrel->part_rels =
1685 Assert(joinrel->boundinfo);
1686 Assert(joinrel->part_rels);
1721 for (cnt_parts = 0; cnt_parts < joinrel->
nparts; cnt_parts++)
1723 RelOptInfo *child_joinrel = joinrel->part_rels[cnt_parts];
1739 *parts1 =
lappend(*parts1, NULL);
1740 *parts2 =
lappend(*parts2, NULL);
1797 *parts1 =
lappend(*parts1, child_rel1);
1798 *parts2 =
lappend(*parts2, child_rel2);
AppendRelInfo ** find_appinfos_by_relids(PlannerInfo *root, Relids relids, int *nappinfos)
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Relids adjust_child_relids(Relids relids, int nappinfos, AppendRelInfo **appinfos)
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
int bms_singleton_member(const Bitmapset *a)
void bms_free(Bitmapset *a)
int bms_num_members(const Bitmapset *a)
Bitmapset * bms_add_member(Bitmapset *a, int x)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_intersect(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_copy(const Bitmapset *a)
elog(ERROR, "%s: %s", p2, msg)
int errcode(int sqlerrcode)
int errmsg(const char *fmt,...)
#define ereport(elevel,...)
if(TABLE==NULL||TABLE_index==NULL)
bool have_relevant_joinclause(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
void add_paths_to_joinrel(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outerrel, RelOptInfo *innerrel, JoinType jointype, SpecialJoinInfo *sjinfo, List *restrictlist)
static void populate_joinrel_with_paths(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, RelOptInfo *joinrel, SpecialJoinInfo *sjinfo, List *restrictlist)
static void try_partitionwise_join(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, RelOptInfo *joinrel, SpecialJoinInfo *parent_sjinfo, List *parent_restrictlist)
static void make_rels_by_clauseless_joins(PlannerInfo *root, RelOptInfo *old_rel, List *other_rels)
bool is_dummy_rel(RelOptInfo *rel)
void join_search_one_level(PlannerInfo *root, int level)
static bool restriction_is_constant_false(List *restrictlist, RelOptInfo *joinrel, bool only_pushed_down)
static void get_matching_part_pairs(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *rel1, RelOptInfo *rel2, List **parts1, List **parts2)
static bool has_legal_joinclause(PlannerInfo *root, RelOptInfo *rel)
static void compute_partition_bounds(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, RelOptInfo *joinrel, SpecialJoinInfo *parent_sjinfo, List **parts1, List **parts2)
static SpecialJoinInfo * build_child_join_sjinfo(PlannerInfo *root, SpecialJoinInfo *parent_sjinfo, Relids left_relids, Relids right_relids)
RelOptInfo * make_join_rel(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
void mark_dummy_rel(RelOptInfo *rel)
bool have_dangerous_phv(PlannerInfo *root, Relids outer_relids, Relids inner_params)
bool have_join_order_restriction(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
static bool has_join_restriction(PlannerInfo *root, RelOptInfo *rel)
static bool join_is_legal(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2, Relids joinrelids, SpecialJoinInfo **sjinfo_p, bool *reversed_p)
static void make_rels_by_clause_joins(PlannerInfo *root, RelOptInfo *old_rel, List *other_rels_list, ListCell *other_rels)
Assert(fmt[strlen(fmt) - 1] !='\n')
List * lappend(List *list, void *datum)
Datum subpath(PG_FUNCTION_ARGS)
void pfree(void *pointer)
void * palloc0(Size size)
MemoryContext GetMemoryChunkContext(void *pointer)
#define IsA(nodeptr, _type_)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
bool partition_bounds_equal(int partnatts, int16 *parttyplen, bool *parttypbyval, PartitionBoundInfo b1, PartitionBoundInfo b2)
PartitionBoundInfo partition_bounds_merge(int partnatts, FmgrInfo *partsupfunc, Oid *partcollation, RelOptInfo *outer_rel, RelOptInfo *inner_rel, JoinType jointype, List **outer_parts, List **inner_parts)
AppendPath * create_append_path(PlannerInfo *root, RelOptInfo *rel, List *subpaths, List *partial_subpaths, List *pathkeys, Relids required_outer, int parallel_workers, bool parallel_aware, double rows)
UniquePath * create_unique_path(PlannerInfo *root, RelOptInfo *rel, Path *subpath, SpecialJoinInfo *sjinfo)
void set_cheapest(RelOptInfo *parent_rel)
void add_path(RelOptInfo *parent_rel, Path *new_path)
#define IS_DUMMY_APPEND(p)
#define RINFO_IS_PUSHED_DOWN(rinfo, joinrelids)
#define IS_SIMPLE_REL(rel)
#define IS_PARTITIONED_REL(rel)
#define REL_HAS_ALL_PART_PROPS(rel)
@ RELOPT_OTHER_MEMBER_REL
#define lfirst_node(type, lc)
static int list_length(const List *l)
#define for_each_cell(cell, lst, initcell)
static ListCell * list_head(const List *l)
static ListCell * lnext(const List *l, const ListCell *c)
void check_stack_depth(void)
static bool DatumGetBool(Datum X)
Relids min_join_parameterization(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel)
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
RelOptInfo * find_join_rel(PlannerInfo *root, Relids relids)
RelOptInfo * build_join_rel(PlannerInfo *root, Relids joinrelids, RelOptInfo *outer_rel, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo, List **restrictlist_ptr)
RelOptInfo * build_child_join_rel(PlannerInfo *root, RelOptInfo *outer_rel, RelOptInfo *inner_rel, RelOptInfo *parent_joinrel, List *restrictlist, SpecialJoinInfo *sjinfo)
struct FmgrInfo * partsupfunc
Relids lateral_referencers
struct Path * cheapest_total_path
Relids direct_lateral_relids
bool consider_partitionwise_join