55 Relids nominal_join_relids,
57 Relids nominal_inner_relids,
60 Oid lefttype,
Oid righttype);
141 Assert(restrictinfo->left_ec == NULL);
142 Assert(restrictinfo->right_ec == NULL);
150 opno = ((
OpExpr *) clause)->opno;
151 collation = ((
OpExpr *) clause)->inputcollid;
154 item1_relids = restrictinfo->left_relids;
155 item2_relids = restrictinfo->right_relids;
174 if (
equal(item1, item2))
193 ntest->argisrow =
false;
200 restrictinfo->pseudoconstant,
218 opfamilies = restrictinfo->mergeopfamilies;
317 restrictinfo->left_ec = ec1;
318 restrictinfo->right_ec = ec1;
320 restrictinfo->left_em = em1;
321 restrictinfo->right_em = em2;
332 elog(
ERROR,
"too late to merge equivalence classes");
364 restrictinfo->left_ec = ec1;
365 restrictinfo->right_ec = ec1;
367 restrictinfo->left_em = em1;
368 restrictinfo->right_em = em2;
374 jdomain, NULL, item2_type);
381 restrictinfo->left_ec = ec1;
382 restrictinfo->right_ec = ec1;
384 restrictinfo->left_em = em1;
385 restrictinfo->right_em = em2;
391 jdomain, NULL, item1_type);
398 restrictinfo->left_ec = ec2;
399 restrictinfo->right_ec = ec2;
401 restrictinfo->left_em = em1;
402 restrictinfo->right_em = em2;
423 jdomain, NULL, item1_type);
425 jdomain, NULL, item2_type);
430 restrictinfo->left_ec = ec;
431 restrictinfo->right_ec = ec;
433 restrictinfo->left_em = em1;
434 restrictinfo->right_em = em2;
477 if (IsPolymorphicType(req_type) || req_type == RECORDOID)
478 req_type = expr_type;
483 if (expr_type != req_type ||
493 if (expr_type != req_type)
503 req_type, req_typmod, req_collation,
525 em->em_parent = parent;
624 (sortref == 0 || sortref != cur_ec->
ec_sortref))
683 elog(
ERROR,
"volatile EquivalenceClass has no sortref");
691 jdomain, NULL, opcintype);
793 if (
equal(emexpr, expr))
826 bool require_parallel_safe)
857 foreach(lc2, exprvars)
870 if (require_parallel_safe &&
899 if (
equal(node, expr))
935 foreach(lc, target->
exprs)
956 if (require_parallel_safe &&
967 require_parallel_safe);
1048 bool can_generate_joinclause =
false;
1071 can_generate_joinclause =
1098 if (can_generate_joinclause)
1149 Assert(const_em != NULL);
1159 if (cur_em == const_em)
1190 if (rinfo && rinfo->mergeopfamilies)
1193 rinfo->left_ec = rinfo->right_ec = ec;
1194 rinfo->left_em = cur_em;
1195 rinfo->right_em = const_em;
1230 Assert(relid < root->simple_rel_array_size);
1232 if (prev_ems[relid] != NULL)
1266 if (rinfo && rinfo->mergeopfamilies)
1269 rinfo->left_ec = rinfo->right_ec = ec;
1270 rinfo->left_em = prev_em;
1271 rinfo->right_em = cur_em;
1274 prev_ems[relid] = cur_em;
1385 Relids nominal_inner_relids;
1386 Relids nominal_join_relids;
1398 nominal_join_relids =
bms_union(outer_relids, nominal_inner_relids);
1400 nominal_join_relids =
bms_add_member(nominal_join_relids, ojrelid);
1404 nominal_inner_relids = inner_relids;
1405 nominal_join_relids = join_relids;
1455 nominal_join_relids,
1457 nominal_inner_relids,
1483 Relids nominal_inner_relids;
1484 Relids nominal_join_relids;
1495 nominal_join_relids =
bms_union(outer_relids, nominal_inner_relids);
1499 nominal_inner_relids = inner_relids;
1500 nominal_join_relids = join_relids;
1503 foreach(lc, eclasses)
1531 nominal_join_relids,
1533 nominal_inner_relids,
1580 outer_members =
lappend(outer_members, cur_em);
1582 inner_members =
lappend(inner_members, cur_em);
1584 new_members =
lappend(new_members, cur_em);
1596 if (outer_members && inner_members)
1601 int best_score = -1;
1604 foreach(lc1, outer_members)
1609 foreach(lc2, inner_members)
1632 if (score > best_score)
1634 best_outer_em = outer_em;
1635 best_inner_em = inner_em;
1638 if (best_score == 3)
1642 if (best_score == 3)
1657 best_outer_em, best_inner_em,
1660 result =
lappend(result, rinfo);
1682 foreach(lc1, new_members)
1686 if (prev_em != NULL)
1704 result =
lappend(result, rinfo);
1724 Relids nominal_join_relids,
1726 Relids nominal_inner_relids,
1740 result =
lappend(result, restrictinfo);
1758 inner_rel->top_parent);
1830 if (rinfo->left_em == leftem &&
1831 rinfo->right_em == rightem &&
1832 rinfo->parent_ec == parent_ec)
1834 if (rinfo->left_em == rightem &&
1835 rinfo->right_em == leftem &&
1836 rinfo->parent_ec == parent_ec)
1843 if (rinfo->left_em == leftem &&
1844 rinfo->right_em == rightem &&
1845 rinfo->parent_ec == parent_ec)
1847 if (rinfo->left_em == rightem &&
1848 rinfo->right_em == leftem &&
1849 rinfo->parent_ec == parent_ec)
1887 rinfo->parent_ec = parent_ec;
1893 rinfo->left_ec = ec;
1894 rinfo->right_ec = ec;
1897 rinfo->left_em = leftem;
1898 rinfo->right_em = rightem;
2113 inner_datatype = right_type;
2114 inner_relids = rinfo->right_relids;
2120 inner_datatype = left_type;
2121 inner_relids = rinfo->left_relids;
2233 left_relids = rinfo->left_relids;
2234 right_relids = rinfo->right_relids;
2299 if (
equal(leftvar, cfirst) &&
equal(rightvar, csecond))
2316 matchleft = matchright =
false;
2369 if (matchleft && matchright)
2405 elog(
ERROR,
"failed to find appropriate JoinDomain");
2430 bool item1member =
false;
2431 bool item2member =
false;
2449 if (item1member && item2member)
2479 AttrNumber var1attno = fkinfo->conkey[colno];
2481 AttrNumber var2attno = fkinfo->confkey[colno];
2482 Oid eqop = fkinfo->conpfeqop[colno];
2483 RelOptInfo *rel1 = root->simple_rel_array[var1varno];
2484 RelOptInfo *rel2 = root->simple_rel_array[var2varno];
2522 if (!(var &&
IsA(var,
Var)))
2528 else if (var->
varno == var2varno && var->
varattno == var2attno)
2532 if (item1_em && item2_em)
2539 if (opfamilies ==
NIL)
2543 fkinfo->
eclass[colno] = ec;
2580 if (rinfo->left_em == em)
2644 for (
int pos = 0; pos < num_members; pos++)
2680 child_expr = (
Expr *)
2688 child_expr = (
Expr *)
2692 child_rel->top_parent);
2776 for (
int pos = 0; pos < num_members; pos++)
2807 child_expr = (
Expr *)
2810 nappinfos, appinfos);
2816 child_expr = (
Expr *)
2820 child_joinrel->top_parent);
2889 parent_relids = NULL;
2923 callback(root, rel, cur_ec, cur_em, callback_arg))
2945 if (other_em == cur_em ||
2972 result =
lappend(result, rinfo);
3156 foreach(lc,
eclass->ec_members)
3184 if (parent_ec == NULL)
3187 foreach(lc, clauselist)
3191 if (otherrinfo->parent_ec == parent_ec)
3210 foreach(lc, indexclauses)
3220 if (rinfo == otherrinfo)
3223 if (parent_ec && otherrinfo->parent_ec == parent_ec)
3284 rel2ecs = root->simple_rel_array[relid]->eclass_indexes;
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_join(Bitmapset *a, Bitmapset *b)
bool bms_equal(const Bitmapset *a, const Bitmapset *b)
int bms_next_member(const Bitmapset *a, int prevbit)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
bool bms_is_member(int x, const Bitmapset *a)
Bitmapset * bms_make_singleton(int x)
Bitmapset * bms_add_member(Bitmapset *a, int x)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_difference(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_intersect(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_add_members(Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_int_members(Bitmapset *a, const Bitmapset *b)
BMS_Membership bms_membership(const Bitmapset *a)
bool bms_overlap(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_copy(const Bitmapset *a)
bool bms_get_singleton_member(const Bitmapset *a, int *member)
#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)
elog(ERROR, "%s: %s", p2, msg)
bool equal(const void *a, const void *b)
bool exprs_known_equal(PlannerInfo *root, Node *item1, Node *item2)
EquivalenceMember * find_ec_member_matching_expr(EquivalenceClass *ec, Expr *expr, Relids relids)
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)
RestrictInfo * find_derived_clause_for_ec_member(EquivalenceClass *ec, EquivalenceMember *em)
static List * generate_join_implied_equalities_normal(PlannerInfo *root, EquivalenceClass *ec, Relids join_relids, Relids outer_relids, Relids inner_relids)
Expr * canonicalize_ec_expression(Expr *expr, Oid req_type, Oid req_collation)
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)
static void generate_base_implied_equalities_broken(PlannerInfo *root, EquivalenceClass *ec)
bool process_equivalence(PlannerInfo *root, RestrictInfo **p_restrictinfo, JoinDomain *jdomain)
List * generate_join_implied_equalities_for_ecs(PlannerInfo *root, List *eclasses, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
static EquivalenceMember * add_eq_member(EquivalenceClass *ec, Expr *expr, Relids relids, JoinDomain *jdomain, EquivalenceMember *parent, Oid datatype)
EquivalenceClass * get_eclass_for_sort_expr(PlannerInfo *root, Expr *expr, List *opfamilies, Oid opcintype, Oid collation, Index sortref, Relids rel, bool create_it)
bool have_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
static Bitmapset * get_common_eclass_indexes(PlannerInfo *root, Relids relids1, Relids relids2)
List * generate_implied_equalities_for_column(PlannerInfo *root, RelOptInfo *rel, ec_matches_callback_type callback, void *callback_arg, Relids prohibited_rels)
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)
EquivalenceClass * match_eclasses_to_foreign_key_col(PlannerInfo *root, ForeignKeyOptInfo *fkinfo, int colno)
static Bitmapset * get_eclass_indexes_for_relids(PlannerInfo *root, Relids relids)
bool is_redundant_derived_clause(RestrictInfo *rinfo, List *clauselist)
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)
static bool is_exprlist_member(Expr *node, List *exprs)
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, Index ojrelid)
EquivalenceMember * find_computable_ec_member(PlannerInfo *root, EquivalenceClass *ec, List *exprs, Relids relids, bool require_parallel_safe)
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)
void distribute_restrictinfo_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo)
void add_vars_to_targetlist(PlannerInfo *root, List *vars, Relids where_needed)
RestrictInfo * build_implied_join_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level)
RestrictInfo * process_implied_equality(PlannerInfo *root, Oid opno, Oid collation, Expr *item1, Expr *item2, Relids qualscope, Index security_level, bool both_const)
if(TABLE==NULL||TABLE_index==NULL)
Assert(fmt[strlen(fmt) - 1] !='\n')
List * lappend(List *list, void *datum)
List * list_copy(const List *oldlist)
List * list_delete_nth_cell(List *list, int n)
void list_free(List *list)
List * list_concat(List *list1, const List *list2)
List * get_mergejoin_opfamilies(Oid opno)
bool op_hashjoinable(Oid opno, Oid inputtype)
RegProcedure get_opcode(Oid opno)
Oid get_opfamily_member(Oid opfamily, Oid lefttype, Oid righttype, int16 strategy)
bool func_strict(Oid funcid)
bool get_func_leakproof(Oid funcid)
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 bool is_opclause(const void *clause)
static Node * get_rightop(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_AGGREGATES
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
#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)
static void * list_nth(const List *list, int n)
#define foreach_delete_current(lst, cell)
#define foreach_current_index(cell)
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 pseudoconstant, Index security_level, Relids required_relids, Relids outer_relids)
Node * remove_nulling_relids(Node *node, const Bitmapset *removable_relids, const Bitmapset *except_relids)
#define BTEqualStrategyNumber
struct EquivalenceClass * ec_merged
struct EquivalenceClass * eclass[INDEX_MAX_KEYS]
struct EquivalenceMember * fk_eclass_member[INDEX_MAX_KEYS]
struct RestrictInfo * rinfo
NullTestType nulltesttype
int simple_rel_array_size
List * right_join_clauses
struct PathTarget * reltarget
Bitmapset * eclass_indexes
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
List * pull_var_clause(Node *node, int flags)
Relids pull_varnos(PlannerInfo *root, Node *node)