48 int ec_index,
Expr *expr,
67 Relids nominal_join_relids,
69 Relids nominal_inner_relids,
72 Oid lefttype,
Oid righttype);
124#define EC_DERIVES_HASH_THRESHOLD 32
126#define SH_PREFIX derives
127#define SH_ELEMENT_TYPE ECDerivesEntry
128#define SH_KEY_TYPE ECDerivesKey
130#define SH_HASH_KEY(tb, key) \
131 hash_bytes((const unsigned char *) &(key), sizeof(ECDerivesKey))
132#define SH_EQUAL(tb, a, b) \
133 ((a).em1 == (b).em1 && (a).em2 == (b).em2 && (a).parent_ec == (b).parent_ec)
134#define SH_SCOPE static inline
202 Assert(restrictinfo->left_ec == NULL);
203 Assert(restrictinfo->right_ec == NULL);
211 opno = ((
OpExpr *) clause)->opno;
212 collation = ((
OpExpr *) clause)->inputcollid;
215 item1_relids = restrictinfo->left_relids;
216 item2_relids = restrictinfo->right_relids;
235 if (
equal(item1, item2))
254 ntest->argisrow =
false;
263 restrictinfo->pseudoconstant,
282 opfamilies = restrictinfo->mergeopfamilies;
305 foreach(lc1,
root->eq_classes)
385 restrictinfo->left_ec = ec1;
386 restrictinfo->right_ec = ec1;
388 restrictinfo->left_em = em1;
389 restrictinfo->right_em = em2;
399 if (
root->ec_merging_done)
400 elog(
ERROR,
"too late to merge equivalence classes");
437 restrictinfo->left_ec = ec1;
438 restrictinfo->right_ec = ec1;
440 restrictinfo->left_em = em1;
441 restrictinfo->right_em = em2;
447 jdomain, item2_type);
454 restrictinfo->left_ec = ec1;
455 restrictinfo->right_ec = ec1;
457 restrictinfo->left_em = em1;
458 restrictinfo->right_em = em2;
464 jdomain, item1_type);
471 restrictinfo->left_ec = ec2;
472 restrictinfo->right_ec = ec2;
474 restrictinfo->left_em = em1;
475 restrictinfo->right_em = em2;
499 jdomain, item1_type);
501 jdomain, item2_type);
506 restrictinfo->left_ec = ec;
507 restrictinfo->right_ec = ec;
509 restrictinfo->left_em = em1;
510 restrictinfo->right_em = em2;
553 if (IsPolymorphicType(req_type) || req_type == RECORDOID)
554 req_type = expr_type;
559 if (expr_type != req_type ||
569 if (expr_type != req_type)
579 req_type, req_typmod, req_collation,
603 em->em_parent = parent;
668 Assert(parent_em != NULL);
681 root->simple_rel_array_size);
686 em =
make_eq_member(ec, expr, relids, jdomain, parent_em, datatype);
766 foreach(lc1,
root->eq_classes)
777 (sortref == 0 || sortref != cur_ec->
ec_sortref))
838 elog(
ERROR,
"volatile EquivalenceClass has no sortref");
872 if (
root->ec_merging_done)
882 if (
i ==
root->group_rtindex)
953 if (
equal(emexpr, expr))
995 bool require_parallel_safe)
1040 foreach(lc2, emvars)
1053 if (require_parallel_safe &&
1093 foreach(lc, target->
exprs)
1114 if (require_parallel_safe &&
1125 require_parallel_safe);
1200 root->ec_merging_done =
true;
1203 foreach(lc,
root->eq_classes)
1206 bool can_generate_joinclause =
false;
1229 can_generate_joinclause =
1246 if (
i ==
root->group_rtindex)
1260 if (can_generate_joinclause)
1314 Assert(const_em != NULL);
1325 if (cur_em == const_em)
1356 if (rinfo && rinfo->mergeopfamilies)
1359 rinfo->left_ec = rinfo->right_ec = ec;
1360 rinfo->left_em = cur_em;
1361 rinfo->right_em = const_em;
1401 Assert(relid < root->simple_rel_array_size);
1403 if (prev_ems[relid] != NULL)
1437 if (rinfo && rinfo->mergeopfamilies)
1440 rinfo->left_ec = rinfo->right_ec = ec;
1441 rinfo->left_em = prev_em;
1442 rinfo->right_em = cur_em;
1445 prev_ems[relid] = cur_em;
1558 Relids nominal_inner_relids;
1559 Relids nominal_join_relids;
1571 nominal_join_relids =
bms_union(outer_relids, nominal_inner_relids);
1573 nominal_join_relids,
1579 nominal_inner_relids = inner_relids;
1580 nominal_join_relids = join_relids;
1596 if (sjinfo && sjinfo->
ojrelid != 0)
1630 nominal_join_relids,
1632 nominal_inner_relids,
1658 Relids nominal_inner_relids;
1659 Relids nominal_join_relids;
1670 nominal_join_relids =
bms_union(outer_relids, nominal_inner_relids);
1674 nominal_inner_relids = inner_relids;
1675 nominal_join_relids = join_relids;
1678 foreach(lc, eclasses)
1706 nominal_join_relids,
1708 nominal_inner_relids,
1755 outer_members =
lappend(outer_members, cur_em);
1757 inner_members =
lappend(inner_members, cur_em);
1759 new_members =
lappend(new_members, cur_em);
1771 if (outer_members && inner_members)
1776 int best_score = -1;
1780 foreach(lc1, outer_members)
1785 foreach(lc2, inner_members)
1808 if (score > best_score)
1810 best_outer_em = outer_em;
1811 best_inner_em = inner_em;
1814 if (best_score == 3)
1818 if (best_score == 3)
1833 best_outer_em, best_inner_em,
1836 result =
lappend(result, rinfo);
1859 foreach(lc1, new_members)
1863 if (prev_em != NULL)
1881 result =
lappend(result, rinfo);
1901 Relids nominal_join_relids,
1903 Relids nominal_inner_relids,
1917 result =
lappend(result, restrictinfo);
1935 inner_rel->top_parent);
2046 rinfo->parent_ec = parent_ec;
2052 rinfo->left_ec = ec;
2053 rinfo->right_ec = ec;
2056 rinfo->left_em = leftem;
2057 rinfo->right_em = rightem;
2146 foreach(cell,
root->left_join_clauses)
2156 root->left_join_clauses =
2174 foreach(cell,
root->right_join_clauses)
2184 root->right_join_clauses =
2202 foreach(cell,
root->full_join_clauses)
2212 root->full_join_clauses =
2231 foreach(cell,
root->left_join_clauses)
2237 foreach(cell,
root->right_join_clauses)
2243 foreach(cell,
root->full_join_clauses)
2282 inner_datatype = right_type;
2283 inner_relids = rinfo->right_relids;
2289 inner_datatype = left_type;
2290 inner_relids = rinfo->left_relids;
2294 foreach(lc1,
root->eq_classes)
2406 left_relids = rinfo->left_relids;
2407 right_relids = rinfo->right_relids;
2409 foreach(lc1,
root->eq_classes)
2477 if (
equal(leftvar, cfirst) &&
equal(rightvar, csecond))
2494 matchleft = matchright =
false;
2547 if (matchleft && matchright)
2578 foreach(lc,
root->eq_classes)
2621 foreach(lc,
root->join_domains)
2628 elog(
ERROR,
"failed to find appropriate JoinDomain");
2652 foreach(lc1,
root->eq_classes)
2655 bool item1member =
false;
2656 bool item2member =
false;
2686 if (item1member && item2member)
2715 AttrNumber var1attno = fkinfo->conkey[colno];
2717 AttrNumber var2attno = fkinfo->confkey[colno];
2718 Oid eqop = fkinfo->conpfeqop[colno];
2761 if (!(var &&
IsA(var,
Var)))
2767 else if (var->
varno == var2varno && var->
varattno == var2attno)
2771 if (item1_em && item2_em)
2778 if (opfamilies ==
NIL)
2782 fkinfo->
eclass[colno] = ec;
2867 if (cur_em->em_is_const)
2871 Assert(!cur_em->em_is_child);
2891 child_expr = (
Expr *)
2893 (
Node *) cur_em->em_expr,
2899 child_expr = (
Expr *)
2901 (
Node *) cur_em->em_expr,
2903 child_rel->top_parent);
2923 cur_em->em_datatype,
2985 if (cur_em->em_is_const)
2989 Assert(!cur_em->em_is_child);
2999 if (
bms_overlap(cur_em->em_relids, top_parent_relids))
3008 child_expr = (
Expr *)
3010 (
Node *) cur_em->em_expr,
3011 nappinfos, appinfos);
3017 child_expr = (
Expr *)
3019 (
Node *) cur_em->em_expr,
3021 child_joinrel->top_parent);
3061 cur_em->em_datatype,
3085 List *child_tlist,
List *setop_pathkeys)
3090 foreach(lc, child_tlist)
3100 elog(
ERROR,
"too few pathkeys for set operation");
3103 parent_em =
linitial(pk->pk_eclass->ec_members);
3122 lc2 =
lnext(setop_pathkeys, lc2);
3260 parent_relids = NULL;
3315 if (other_em == cur_em ||
3342 result =
lappend(result, rinfo);
3528 foreach(lc,
eclass->ec_members)
3556 if (parent_ec == NULL)
3559 foreach(lc, clauselist)
3563 if (otherrinfo->parent_ec == parent_ec)
3582 foreach(lc, indexclauses)
3592 if (rinfo == otherrinfo)
3595 if (parent_ec && otherrinfo->parent_ec == parent_ec)
3626 if (
i ==
root->group_rtindex)
3660 rel2ecs =
root->simple_rel_array[relid]->eclass_indexes;
3709 Assert(!clause->left_em->em_is_const);
3715 Assert(!clause->parent_ec || !clause->right_em->em_is_const);
3762 if (rightem == NULL)
3767 else if (leftem < rightem)
3777 key->parent_ec = parent_ec;
3799 Assert(!rinfo->left_em->em_is_const);
3805 Assert(!rinfo->parent_ec || !rinfo->right_em->em_is_const);
3814 rinfo->right_em->em_is_const ? NULL : rinfo->right_em,
3818 entry->
rinfo = rinfo;
3862 if (rinfo->left_em == leftem &&
3863 rinfo->right_em == rightem &&
3864 rinfo->parent_ec == parent_ec)
3866 if (rinfo->left_em == rightem &&
3867 rinfo->right_em == leftem &&
3868 rinfo->parent_ec == parent_ec)
3914 rinfo = entry->
rinfo;
3916 Assert(rightem || rinfo->right_em->em_is_const);
3927 rinfo->left_em == leftem)
3929 Assert(rinfo->right_em->em_is_const);
3932 if (rinfo->left_em == leftem &&
3933 rinfo->right_em == rightem &&
3934 rinfo->parent_ec == parent_ec)
3936 if (rinfo->left_em == rightem &&
3937 rinfo->right_em == leftem &&
3938 rinfo->parent_ec == parent_ec)
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
Node * adjust_appendrel_attrs_multilevel(PlannerInfo *root, Node *node, RelOptInfo *childrel, RelOptInfo *parentrel)
Bitmapset * bms_difference(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_make_singleton(int x)
Bitmapset * bms_int_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_intersect(const Bitmapset *a, const Bitmapset *b)
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
int bms_next_member(const Bitmapset *a, int prevbit)
Bitmapset * bms_add_range(Bitmapset *a, int lower, int upper)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
bool bms_is_member(int x, const Bitmapset *a)
Bitmapset * bms_add_member(Bitmapset *a, int x)
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
BMS_Membership bms_membership(const Bitmapset *a)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
bool bms_get_singleton_member(const Bitmapset *a, int *member)
Bitmapset * bms_join(Bitmapset *a, Bitmapset *b)
Bitmapset * bms_copy(const Bitmapset *a)
#define OidIsValid(objectId)
bool contain_agg_clause(Node *clause)
bool contain_window_function(Node *clause)
bool is_parallel_safe(PlannerInfo *root, Node *node)
bool contain_volatile_functions(Node *clause)
bool equal(const void *a, const void *b)
void rebuild_eclass_attr_needed(PlannerInfo *root)
EquivalenceClass * get_eclass_for_sort_expr(PlannerInfo *root, Expr *expr, List *opfamilies, Oid opcintype, Oid collation, Index sortref, Relids rel, bool create_it)
void add_child_rel_equivalences(PlannerInfo *root, AppendRelInfo *appinfo, RelOptInfo *parent_rel, RelOptInfo *child_rel)
bool is_redundant_with_indexclauses(RestrictInfo *rinfo, List *indexclauses)
void generate_base_implied_equalities(PlannerInfo *root)
bool exprs_known_equal(PlannerInfo *root, Node *item1, Node *item2, Oid opfamily)
static List * generate_join_implied_equalities_normal(PlannerInfo *root, EquivalenceClass *ec, Relids join_relids, Relids outer_relids, Relids inner_relids)
static RestrictInfo * ec_search_derived_clause_for_ems(PlannerInfo *root, EquivalenceClass *ec, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec)
static void ec_build_derives_hash(PlannerInfo *root, EquivalenceClass *ec)
Expr * canonicalize_ec_expression(Expr *expr, Oid req_type, Oid req_collation)
EquivalenceMember * find_ec_member_matching_expr(EquivalenceClass *ec, Expr *expr, Relids relids)
static void ec_add_clause_to_derives_hash(EquivalenceClass *ec, RestrictInfo *rinfo)
static JoinDomain * find_join_domain(PlannerInfo *root, Relids relids)
bool relation_can_be_sorted_early(PlannerInfo *root, RelOptInfo *rel, EquivalenceClass *ec, bool require_parallel_safe)
void setup_eclass_member_iterator(EquivalenceMemberIterator *it, EquivalenceClass *ec, Relids child_relids)
static void generate_base_implied_equalities_broken(PlannerInfo *root, EquivalenceClass *ec)
void ec_clear_derived_clauses(EquivalenceClass *ec)
static void ec_add_derived_clause(EquivalenceClass *ec, RestrictInfo *clause)
bool process_equivalence(PlannerInfo *root, RestrictInfo **p_restrictinfo, JoinDomain *jdomain)
List * generate_implied_equalities_for_column(PlannerInfo *root, RelOptInfo *rel, ec_matches_callback_type callback, void *callback_arg, Relids prohibited_rels)
static EquivalenceMember * add_child_eq_member(PlannerInfo *root, EquivalenceClass *ec, int ec_index, Expr *expr, Relids relids, JoinDomain *jdomain, EquivalenceMember *parent_em, Oid datatype, Index child_relid)
#define EC_DERIVES_HASH_THRESHOLD
EquivalenceMember * eclass_member_iterator_next(EquivalenceMemberIterator *it)
bool have_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
EquivalenceMember * find_computable_ec_member(PlannerInfo *root, EquivalenceClass *ec, List *exprs, Relids relids, bool require_parallel_safe)
static Bitmapset * get_common_eclass_indexes(PlannerInfo *root, Relids relids1, Relids relids2)
List * generate_join_implied_equalities_for_ecs(PlannerInfo *root, List *eclasses, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
void add_setop_child_rel_equivalences(PlannerInfo *root, RelOptInfo *child_rel, List *child_tlist, List *setop_pathkeys)
static void fill_ec_derives_key(ECDerivesKey *key, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec)
void reconsider_outer_join_clauses(PlannerInfo *root)
bool eclass_useful_for_merging(PlannerInfo *root, EquivalenceClass *eclass, RelOptInfo *rel)
void add_child_join_rel_equivalences(PlannerInfo *root, int nappinfos, AppendRelInfo **appinfos, RelOptInfo *parent_joinrel, RelOptInfo *child_joinrel)
static RestrictInfo * create_join_clause(PlannerInfo *root, EquivalenceClass *ec, Oid opno, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec)
static void ec_add_derived_clauses(EquivalenceClass *ec, List *clauses)
static Bitmapset * get_eclass_indexes_for_relids(PlannerInfo *root, Relids relids)
bool is_redundant_derived_clause(RestrictInfo *rinfo, List *clauselist)
RestrictInfo * find_derived_clause_for_ec_member(PlannerInfo *root, EquivalenceClass *ec, EquivalenceMember *em)
static RestrictInfo * ec_search_clause_for_ems(PlannerInfo *root, EquivalenceClass *ec, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec)
static void generate_base_implied_equalities_no_const(PlannerInfo *root, EquivalenceClass *ec)
static void generate_base_implied_equalities_const(PlannerInfo *root, EquivalenceClass *ec)
static Oid select_equality_operator(EquivalenceClass *ec, Oid lefttype, Oid righttype)
EquivalenceClass * match_eclasses_to_foreign_key_col(PlannerInfo *root, ForeignKeyOptInfo *fkinfo, int colno)
static EquivalenceMember * make_eq_member(EquivalenceClass *ec, Expr *expr, Relids relids, JoinDomain *jdomain, EquivalenceMember *parent, Oid datatype)
static bool reconsider_outer_join_clause(PlannerInfo *root, OuterJoinClauseInfo *ojcinfo, bool outer_on_left)
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel, SpecialJoinInfo *sjinfo)
static EquivalenceMember * add_eq_member(EquivalenceClass *ec, Expr *expr, Relids relids, JoinDomain *jdomain, Oid datatype)
bool has_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1)
static bool reconsider_full_join_clause(PlannerInfo *root, OuterJoinClauseInfo *ojcinfo)
static List * generate_join_implied_equalities_broken(PlannerInfo *root, EquivalenceClass *ec, Relids nominal_join_relids, Relids outer_relids, Relids nominal_inner_relids, RelOptInfo *inner_rel)
#define palloc0_array(type, count)
Assert(PointerIsAligned(start, uint64))
void distribute_restrictinfo_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo)
RestrictInfo * build_implied_join_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level)
void add_vars_to_targetlist(PlannerInfo *root, List *vars, Relids where_needed)
RestrictInfo * process_implied_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level, bool both_const)
void add_vars_to_attr_needed(PlannerInfo *root, List *vars, Relids where_needed)
if(TABLE==NULL||TABLE_index==NULL)
Relids add_outer_joins_to_relids(PlannerInfo *root, Relids input_relids, SpecialJoinInfo *sjinfo, List **pushed_down_joins)
List * lappend(List *list, void *datum)
List * list_delete_nth_cell(List *list, int n)
List * list_concat(List *list1, const List *list2)
List * list_copy(const List *oldlist)
void list_free(List *list)
bool list_member_oid(const List *list, Oid datum)
bool list_member(const List *list, const void *datum)
Oid get_opfamily_member_for_cmptype(Oid opfamily, Oid lefttype, Oid righttype, CompareType cmptype)
bool op_hashjoinable(Oid opno, Oid inputtype)
RegProcedure get_opcode(Oid opno)
bool func_strict(Oid funcid)
bool get_func_leakproof(Oid funcid)
List * get_mergejoin_opfamilies(Oid opno)
void op_input_types(Oid opno, Oid *lefttype, Oid *righttype)
Node * makeBoolConst(bool value, bool isnull)
void pfree(void *pointer)
void * palloc0(Size size)
Oid exprType(const Node *expr)
int32 exprTypmod(const Node *expr)
Oid exprCollation(const Node *expr)
Node * applyRelabelType(Node *arg, Oid rtype, int32 rtypmod, Oid rcollid, CoercionForm rformat, int rlocation, bool overwrite_ok)
bool expression_returns_set(Node *clause)
void set_opfuncid(OpExpr *opexpr)
static Node * get_rightop(const void *clause)
static bool is_opclause(const void *clause)
static Node * get_leftop(const void *clause)
#define IsA(nodeptr, _type_)
#define PVC_RECURSE_AGGREGATES
#define PVC_RECURSE_WINDOWFUNCS
#define PVC_INCLUDE_WINDOWFUNCS
#define PVC_INCLUDE_PLACEHOLDERS
#define PVC_INCLUDE_CONVERTROWTYPES
#define PVC_INCLUDE_AGGREGATES
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
#define repalloc0_array(pointer, type, oldcount, count)
#define IS_SIMPLE_REL(rel)
@ RELOPT_OTHER_MEMBER_REL
#define IS_OTHER_REL(rel)
bool(* ec_matches_callback_type)(PlannerInfo *root, RelOptInfo *rel, EquivalenceClass *ec, EquivalenceMember *em, void *arg)
#define lfirst_node(type, lc)
static int list_length(const List *l)
#define linitial_node(type, l)
#define foreach_current_index(var_or_cell)
#define foreach_delete_current(lst, var_or_cell)
static void * list_nth(const List *list, int n)
#define foreach_node(type, var, lst)
static ListCell * list_head(const List *l)
static ListCell * lnext(const List *l, const ListCell *c)
static struct cvec * eclass(struct vars *v, chr c, int cases)
Relids find_childrel_parents(PlannerInfo *root, RelOptInfo *rel)
RestrictInfo * make_restrictinfo(PlannerInfo *root, Expr *clause, bool is_pushed_down, bool has_clone, bool is_clone, bool pseudoconstant, Index security_level, Relids required_relids, Relids incompatible_relids, Relids outer_relids)
Node * remove_nulling_relids(Node *node, const Bitmapset *removable_relids, const Bitmapset *except_relids)
EquivalenceClass * parent_ec
struct EquivalenceClass * ec_merged
struct derives_hash * ec_derives_hash
struct EquivalenceClass * eclass[INDEX_MAX_KEYS]
struct EquivalenceMember * fk_eclass_member[INDEX_MAX_KEYS]
struct RestrictInfo * rinfo
NullTestType nulltesttype
struct PathTarget * reltarget
Bitmapset * eclass_indexes
Relids incompatible_relids
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Relids pull_varnos(PlannerInfo *root, Node *node)
List * pull_var_clause(Node *node, int flags)