95 elog(
ERROR,
"failed to find relation %d in joinlist", innerrelid);
283 clause_list =
lappend(clause_list, restrictinfo);
334 if (otherrel == NULL)
416 foreach(l, joininfos)
459 foreach(jl, joinlist)
470 result =
lappend(result, jlnode);
481 result =
lappend(result, sublist);
485 elog(
ERROR,
"unrecognized joinlist node type: %d",
605 if (
ind->unique &&
ind->immediate &&
677 foreach(l, clause_list)
711 if (!var || !
IsA(var,
Var) ||
929 forboth(lc1, colnos, lc2, opids)
976 if (restrictlist ==
NIL)
1015 jointype, restrictlist))
1089 foreach(lc, restrictlist)
1115 clause_list =
lappend(clause_list, restrictinfo);
List * remove_useless_joins(PlannerInfo *root, List *joinlist)
static bool clause_sides_match_join(RestrictInfo *rinfo, Relids outerrelids, Relids innerrelids)
bool innerrel_is_unique(PlannerInfo *root, Relids joinrelids, Relids outerrelids, RelOptInfo *innerrel, JoinType jointype, List *restrictlist, bool force_cache)
static void remove_rel_from_query(PlannerInfo *root, int relid, Relids joinrelids)
static List * remove_rel_from_joinlist(List *joinlist, int relid, int *nremoved)
bool query_is_distinct_for(Query *query, List *colnos, List *opids)
static Oid distinct_col_search(int colno, List *colnos, List *opids)
bool query_supports_distinctness(Query *query)
static bool rel_is_distinct_for(PlannerInfo *root, RelOptInfo *rel, List *clause_list)
static bool join_is_removable(PlannerInfo *root, SpecialJoinInfo *sjinfo)
void reduce_unique_semijoins(PlannerInfo *root)
static bool is_innerrel_unique_for(PlannerInfo *root, Relids joinrelids, Relids outerrelids, RelOptInfo *innerrel, JoinType jointype, List *restrictlist)
static bool rel_supports_distinctness(PlannerInfo *root, RelOptInfo *rel)
bool bms_is_subset(const Bitmapset *a, const Bitmapset *b)
int bms_singleton_member(const Bitmapset *a)
bool bms_is_member(int x, const Bitmapset *a)
Bitmapset * bms_union(const Bitmapset *a, const Bitmapset *b)
Bitmapset * bms_del_member(Bitmapset *a, int x)
bool bms_is_empty(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)
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
bool relation_has_unique_index_for(PlannerInfo *root, RelOptInfo *rel, List *restrictlist, List *exprlist, List *oprlist)
void distribute_restrictinfo_to_rels(PlannerInfo *root, RestrictInfo *restrictinfo)
void remove_join_clause_from_rels(PlannerInfo *root, RestrictInfo *restrictinfo, Relids join_relids)
Assert(fmt[strlen(fmt) - 1] !='\n')
List * lappend(List *list, void *datum)
List * lappend_int(List *list, int datum)
List * lappend_oid(List *list, Oid datum)
List * list_copy(const List *oldlist)
List * list_delete_cell(List *list, ListCell *cell)
List * list_concat(List *list1, const List *list2)
bool equality_ops_are_compatible(Oid opno1, Oid opno2)
static Node * get_rightop(const void *clause)
static Node * get_leftop(const void *clause)
#define IsA(nodeptr, _type_)
#define IS_OUTER_JOIN(jointype)
#define castNode(_type_, nodeptr)
static MemoryContext MemoryContextSwitchTo(MemoryContext context)
#define RINFO_IS_PUSHED_DOWN(rinfo, joinrelids)
#define lfirst_node(type, lc)
static int list_length(const List *l)
#define forboth(cell1, list1, cell2, list2)
static ListCell * list_head(const List *l)
static ListCell * lnext(const List *l, const ListCell *c)
#define foreach_delete_current(lst, cell)
RelOptInfo * find_base_rel(PlannerInfo *root, int relid)
MemoryContext planner_cxt
int simple_rel_array_size
void * join_search_private
struct RelOptInfo ** simple_rel_array
RangeTblEntry ** simple_rte_array
List * non_unique_for_rels
TargetEntry * get_sortgroupclause_tle(SortGroupClause *sgClause, List *targetList)
Relids pull_varnos(PlannerInfo *root, Node *node)