37 bool is_child,
Oid datatype);
52 Relids nominal_join_relids,
54 Relids nominal_inner_relids,
57 Oid lefttype,
Oid righttype);
121 bool below_outer_join)
133 item1_nullable_relids,
134 item2_nullable_relids;
153 opno = ((
OpExpr *) clause)->opno;
154 collation = ((
OpExpr *) clause)->inputcollid;
177 if (
equal(item1, item2))
216 if (below_outer_join)
358 elog(
ERROR,
"too late to merge equivalence classes");
401 em2 =
add_eq_member(ec1, item2, item2_relids, item2_nullable_relids,
419 em1 =
add_eq_member(ec2, item1, item1_relids, item1_nullable_relids,
453 em1 =
add_eq_member(ec, item1, item1_relids, item1_nullable_relids,
455 em2 =
add_eq_member(ec, item2, item2_relids, item2_nullable_relids,
508 if (IsPolymorphicType(req_type) || req_type == RECORDOID)
509 req_type = expr_type;
514 if (expr_type != req_type ||
524 if (expr_type != req_type)
534 req_type, req_typmod, req_collation,
546 Relids nullable_relids,
bool is_child,
Oid datatype)
655 (sortref == 0 || sortref != cur_ec->
ec_sortref))
716 elog(
ERROR,
"volatile EquivalenceClass has no sortref");
722 nullable_relids =
bms_intersect(nullable_relids, expr_relids);
725 nullable_relids,
false, opcintype);
822 if (
equal(emexpr, expr))
855 bool require_parallel_safe)
886 foreach(lc2, exprvars)
899 if (require_parallel_safe &&
928 if (
equal(node, expr))
993 foreach(lc, target->
exprs)
1014 if (require_parallel_safe &&
1025 require_parallel_safe);
1106 bool can_generate_joinclause =
false;
1129 can_generate_joinclause =
1150 if (can_generate_joinclause)
1204 Assert(const_em != NULL);
1214 if (cur_em == const_em)
1282 Assert(relid < root->simple_rel_array_size);
1284 if (prev_ems[relid] != NULL)
1323 prev_ems[relid] = cur_em;
1428 Relids nominal_inner_relids;
1429 Relids nominal_join_relids;
1441 nominal_join_relids =
bms_union(outer_relids, nominal_inner_relids);
1445 nominal_inner_relids = inner_relids;
1446 nominal_join_relids = join_relids;
1483 nominal_join_relids,
1485 nominal_inner_relids,
1507 Relids nominal_inner_relids;
1508 Relids nominal_join_relids;
1519 nominal_join_relids =
bms_union(outer_relids, nominal_inner_relids);
1523 nominal_inner_relids = inner_relids;
1524 nominal_join_relids = join_relids;
1527 foreach(lc, eclasses)
1555 nominal_join_relids,
1557 nominal_inner_relids,
1604 outer_members =
lappend(outer_members, cur_em);
1606 inner_members =
lappend(inner_members, cur_em);
1608 new_members =
lappend(new_members, cur_em);
1620 if (outer_members && inner_members)
1625 int best_score = -1;
1628 foreach(lc1, outer_members)
1633 foreach(lc2, inner_members)
1656 if (score > best_score)
1658 best_outer_em = outer_em;
1659 best_inner_em = inner_em;
1662 if (best_score == 3)
1666 if (best_score == 3)
1681 best_outer_em, best_inner_em,
1684 result =
lappend(result, rinfo);
1706 foreach(lc1, new_members)
1710 if (prev_em != NULL)
1728 result =
lappend(result, rinfo);
1748 Relids nominal_join_relids,
1750 Relids nominal_inner_relids,
1764 result =
lappend(result, restrictinfo);
1849 if (rinfo->
left_em == leftem &&
1859 if (rinfo->
left_em == leftem &&
2090 inner_nullable_relids;
2107 inner_datatype = right_type;
2114 inner_datatype = left_type;
2215 left_nullable_relids,
2216 right_nullable_relids;
2288 if (
equal(leftvar, cfirst) &&
equal(rightvar, csecond))
2305 matchleft = matchright =
false;
2355 if (matchleft && matchright)
2393 bool item1member =
false;
2394 bool item2member =
false;
2412 if (item1member && item2member)
2485 if (!(var &&
IsA(var,
Var)))
2491 else if (var->
varno == var2varno && var->
varattno == var2attno)
2495 if (item1_em && item2_em)
2502 if (opfamilies ==
NIL)
2506 fkinfo->
eclass[colno] = ec;
2607 for (
int pos = 0; pos < num_members; pos++)
2631 Relids new_nullable_relids;
2636 child_expr = (
Expr *)
2644 child_expr = (
Expr *)
2666 if (
bms_overlap(new_nullable_relids, top_parent_relids))
2675 new_relids, new_nullable_relids,
2745 for (
int pos = 0; pos < num_members; pos++)
2772 Relids new_nullable_relids;
2777 child_expr = (
Expr *)
2780 nappinfos, appinfos);
2786 child_expr = (
Expr *)
2808 if (
bms_overlap(new_nullable_relids, top_parent_relids))
2809 new_nullable_relids =
2811 new_nullable_relids,
2816 new_relids, new_nullable_relids,
2871 parent_relids = NULL;
2905 callback(root, rel, cur_ec, cur_em, callback_arg))
2927 if (other_em == cur_em ||
2954 result =
lappend(result, rinfo);
3155 if (parent_ec == NULL)
3158 foreach(lc, clauselist)
3181 foreach(lc, indexclauses)
3191 if (rinfo == otherrinfo)
3194 if (parent_ec && otherrinfo->
parent_ec == parent_ec)
bool exprs_known_equal(PlannerInfo *root, Node *item1, Node *item2)
Relids pull_varnos(PlannerInfo *root, Node *node)
static bool reconsider_full_join_clause(PlannerInfo *root, RestrictInfo *rinfo)
static void generate_base_implied_equalities_no_const(PlannerInfo *root, EquivalenceClass *ec)
bool get_func_leakproof(Oid funcid)
static RestrictInfo * create_join_clause(PlannerInfo *root, EquivalenceClass *ec, Oid opno, EquivalenceMember *leftem, EquivalenceMember *rightem, EquivalenceClass *parent_ec)
#define IsA(nodeptr, _type_)
bool is_redundant_derived_clause(RestrictInfo *rinfo, List *clauselist)
Bitmapset * bms_copy(const Bitmapset *a)
bool equal(const void *a, const void *b)
EquivalenceMember * find_computable_ec_member(PlannerInfo *root, EquivalenceClass *ec, List *exprs, Relids relids, bool require_parallel_safe)
Node * applyRelabelType(Node *arg, Oid rtype, int32 rtypmod, Oid rcollid, CoercionForm rformat, int rlocation, bool overwrite_ok)
int32 exprTypmod(const Node *expr)
#define IS_OTHER_REL(rel)
bool eclass_useful_for_merging(PlannerInfo *root, EquivalenceClass *eclass, RelOptInfo *rel)
Relids em_nullable_relids
List * get_mergejoin_opfamilies(Oid opno)
int bms_next_member(const Bitmapset *a, int prevbit)
bool expression_returns_set(Node *clause)
EquivalenceClass * get_eclass_for_sort_expr(PlannerInfo *root, Expr *expr, Relids nullable_relids, List *opfamilies, Oid opcintype, Oid collation, Index sortref, Relids rel, bool create_it)
Bitmapset * bms_difference(const Bitmapset *a, const Bitmapset *b)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
static void generate_base_implied_equalities_broken(PlannerInfo *root, EquivalenceClass *ec)
List * list_copy(const List *oldlist)
List * list_concat(List *list1, const List *list2)
bool bms_get_singleton_member(const Bitmapset *a, int *member)
Relids adjust_child_relids_multilevel(PlannerInfo *root, Relids relids, Relids child_relids, Relids top_parent_relids)
EquivalenceClass * right_ec
List * pull_var_clause(Node *node, int flags)
static bool reconsider_outer_join_clause(PlannerInfo *root, RestrictInfo *rinfo, bool outer_on_left)
void add_child_rel_equivalences(PlannerInfo *root, AppendRelInfo *appinfo, RelOptInfo *parent_rel, RelOptInfo *child_rel)
bool contain_volatile_functions(Node *clause)
RestrictInfo * build_implied_join_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Relids nullable_relids, Index security_level)
#define OidIsValid(objectId)
#define PVC_INCLUDE_AGGREGATES
#define IS_SIMPLE_REL(rel)
static struct cvec * eclass(struct vars *v, chr c, int cases)
struct RelOptInfo ** simple_rel_array
Node * adjust_appendrel_attrs_multilevel(PlannerInfo *root, Node *node, Relids child_relids, Relids top_parent_relids)
#define foreach_delete_current(lst, cell)
void add_vars_to_targetlist(PlannerInfo *root, List *vars, Relids where_needed, bool create_new_ph)
#define PVC_INCLUDE_WINDOWFUNCS
void add_child_join_rel_equivalences(PlannerInfo *root, int nappinfos, AppendRelInfo **appinfos, RelOptInfo *parent_joinrel, RelOptInfo *child_joinrel)
bool is_parallel_safe(PlannerInfo *root, Node *node)
void pfree(void *pointer)
void distribute_restrictinfo_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo)
bool op_hashjoinable(Oid opno, Oid inputtype)
bool process_equivalence(PlannerInfo *root, RestrictInfo **p_restrictinfo, bool below_outer_join)
bool relation_can_be_sorted_early(PlannerInfo *root, RelOptInfo *rel, EquivalenceClass *ec, bool require_parallel_safe)
static void * list_nth(const List *list, int n)
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
EquivalenceMember * left_em
Bitmapset * bms_join(Bitmapset *a, Bitmapset *b)
static Bitmapset * get_eclass_indexes_for_relids(PlannerInfo *root, Relids relids)
Oid conpfeqop[INDEX_MAX_KEYS]
EquivalenceClass * parent_ec
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
bool is_redundant_with_indexclauses(RestrictInfo *rinfo, List *indexclauses)
Expr * canonicalize_ec_expression(Expr *expr, Oid req_type, Oid req_collation)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
#define lfirst_node(type, lc)
static Oid select_equality_operator(EquivalenceClass *ec, Oid lefttype, Oid righttype)
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)
struct RestrictInfo * rinfo
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
Expr * find_em_expr_for_rel(EquivalenceClass *ec, RelOptInfo *rel)
void op_input_types(Oid opno, Oid *lefttype, Oid *righttype)
static Node * get_leftop(const void *clause)
static bool is_exprlist_member(Expr *node, List *exprs)
bool has_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1)
static List * generate_join_implied_equalities_normal(PlannerInfo *root, EquivalenceClass *ec, Relids join_relids, Relids outer_relids, Relids inner_relids)
int simple_rel_array_size
RestrictInfo * make_restrictinfo(PlannerInfo *root, Expr *clause, bool is_pushed_down, bool outerjoin_delayed, bool pseudoconstant, Index security_level, Relids required_relids, Relids outer_relids, Relids nullable_relids)
bool contain_window_function(Node *clause)
List * lappend(List *list, void *datum)
EquivalenceMember * right_em
bool bms_is_empty(const Bitmapset *a)
struct EquivalenceClass * eclass[INDEX_MAX_KEYS]
#define PVC_INCLUDE_PLACEHOLDERS
BMS_Membership bms_membership(const Bitmapset *a)
struct EquivalenceMember * fk_eclass_member[INDEX_MAX_KEYS]
void * palloc0(Size size)
List * generate_join_implied_equalities_for_ecs(PlannerInfo *root, List *eclasses, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
AttrNumber conkey[INDEX_MAX_KEYS]
static Bitmapset * get_common_eclass_indexes(PlannerInfo *root, Relids relids1, Relids relids2)
Bitmapset * bms_intersect(const Bitmapset *a, const Bitmapset *b)
void generate_base_implied_equalities(PlannerInfo *root)
bool have_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
NullTestType nulltesttype
Relids find_childrel_parents(PlannerInfo *root, RelOptInfo *rel)
EquivalenceClass * match_eclasses_to_foreign_key_col(PlannerInfo *root, ForeignKeyOptInfo *fkinfo, int colno)
static Node * get_rightop(const void *clause)
RegProcedure get_opcode(Oid opno)
void reconsider_outer_join_clauses(PlannerInfo *root)
bool(* ec_matches_callback_type)(PlannerInfo *root, RelOptInfo *rel, EquivalenceClass *ec, EquivalenceMember *em, void *arg)
#define Assert(condition)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Oid exprType(const Node *expr)
static int list_length(const List *l)
Oid exprCollation(const Node *expr)
Bitmapset * bms_add_member(Bitmapset *a, int x)
bool func_strict(Oid funcid)
EquivalenceMember * find_ec_member_matching_expr(EquivalenceClass *ec, Expr *expr, Relids relids)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
bool contain_agg_clause(Node *clause)
EquivalenceClass * left_ec
void set_opfuncid(OpExpr *opexpr)
#define PVC_RECURSE_WINDOWFUNCS
void list_free(List *list)
RestrictInfo * find_derived_clause_for_ec_member(EquivalenceClass *ec, EquivalenceMember *em)
static EquivalenceMember * add_eq_member(EquivalenceClass *ec, Expr *expr, Relids relids, Relids nullable_relids, bool is_child, Oid datatype)
#define IS_SRF_CALL(node)
static void generate_base_implied_equalities_const(PlannerInfo *root, EquivalenceClass *ec)
MemoryContext planner_cxt
List * right_join_clauses
bool contain_nonstrict_functions(Node *clause)
static bool is_opclause(const void *clause)
List * list_delete_nth_cell(List *list, int n)
Bitmapset * bms_int_members(Bitmapset *a, const Bitmapset *b)
AttrNumber confkey[INDEX_MAX_KEYS]
struct PathTarget * reltarget
#define PVC_RECURSE_AGGREGATES
Bitmapset * eclass_indexes
struct EquivalenceClass * ec_merged
#define BTEqualStrategyNumber
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
#define foreach_current_index(cell)
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
Node * adjust_appendrel_attrs(PlannerInfo *root, Node *node, int nappinfos, AppendRelInfo **appinfos)
List * generate_implied_equalities_for_column(PlannerInfo *root, RelOptInfo *rel, ec_matches_callback_type callback, void *callback_arg, Relids prohibited_rels)
RestrictInfo * process_implied_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Relids nullable_relids, Index security_level, bool below_outer_join, bool both_const)