PostgreSQL Source Code  git master
 All Data Structures Namespaces Files Functions Variables Typedefs Enumerations Enumerator Macros
Go to the documentation of this file.
1 /*-------------------------------------------------------------------------
2  *
3  * paths.h
4  * prototypes for various files in optimizer/path
5  *
6  *
7  * Portions Copyright (c) 1996-2017, PostgreSQL Global Development Group
8  * Portions Copyright (c) 1994, Regents of the University of California
9  *
10  * src/include/optimizer/paths.h
11  *
12  *-------------------------------------------------------------------------
13  */
14 #ifndef PATHS_H
15 #define PATHS_H
17 #include "nodes/relation.h"
20 /*
21  * allpaths.c
22  */
23 extern bool enable_geqo;
24 extern int geqo_threshold;
28 /* Hook for plugins to get control in set_rel_pathlist() */
29 typedef void (*set_rel_pathlist_hook_type) (PlannerInfo *root,
30  RelOptInfo *rel,
31  Index rti,
32  RangeTblEntry *rte);
35 /* Hook for plugins to get control in add_paths_to_joinrel() */
37  RelOptInfo *joinrel,
38  RelOptInfo *outerrel,
39  RelOptInfo *innerrel,
40  JoinType jointype,
41  JoinPathExtraData *extra);
44 /* Hook for plugins to replace standard_join_search() */
45 typedef RelOptInfo *(*join_search_hook_type) (PlannerInfo *root,
46  int levels_needed,
47  List *initial_rels);
51 extern RelOptInfo *make_one_rel(PlannerInfo *root, List *joinlist);
52 extern void set_dummy_rel_pathlist(RelOptInfo *rel);
53 extern RelOptInfo *standard_join_search(PlannerInfo *root, int levels_needed,
54  List *initial_rels);
56 extern void generate_gather_paths(PlannerInfo *root, RelOptInfo *rel);
57 extern int compute_parallel_worker(RelOptInfo *rel, double heap_pages,
58  double index_pages);
59 extern void create_partial_bitmap_paths(PlannerInfo *root, RelOptInfo *rel,
60  Path *bitmapqual);
63 extern void debug_print_rel(PlannerInfo *root, RelOptInfo *rel);
64 #endif
66 /*
67  * indxpath.c
68  * routines to generate index paths
69  */
70 extern void create_index_paths(PlannerInfo *root, RelOptInfo *rel);
72  List *restrictlist,
73  List *exprlist, List *oprlist);
75  int indexcol);
76 extern bool match_index_to_operand(Node *operand, int indexcol,
79  List *indexclauses, List *indexclausecols,
80  List **indexquals_p, List **indexqualcols_p);
81 extern void check_index_predicates(PlannerInfo *root, RelOptInfo *rel);
84  int indexcol,
85  List **indexcolnos,
86  bool *var_on_left_p);
88 /*
89  * tidpath.h
90  * routines to generate tid paths
91  */
92 extern void create_tidscan_paths(PlannerInfo *root, RelOptInfo *rel);
94 /*
95  * joinpath.c
96  * routines to create join paths
97  */
98 extern void add_paths_to_joinrel(PlannerInfo *root, RelOptInfo *joinrel,
99  RelOptInfo *outerrel, RelOptInfo *innerrel,
100  JoinType jointype, SpecialJoinInfo *sjinfo,
101  List *restrictlist);
103 /*
104  * joinrels.c
105  * routines to determine which relations to join
106  */
107 extern void join_search_one_level(PlannerInfo *root, int level);
108 extern RelOptInfo *make_join_rel(PlannerInfo *root,
109  RelOptInfo *rel1, RelOptInfo *rel2);
110 extern bool have_join_order_restriction(PlannerInfo *root,
111  RelOptInfo *rel1, RelOptInfo *rel2);
112 extern bool have_dangerous_phv(PlannerInfo *root,
113  Relids outer_relids, Relids inner_params);
115 /*
116  * equivclass.c
117  * routines for managing EquivalenceClasses
118  */
120  RelOptInfo *rel,
121  EquivalenceClass *ec,
122  EquivalenceMember *em,
123  void *arg);
125 extern bool process_equivalence(PlannerInfo *root, RestrictInfo *restrictinfo,
126  bool below_outer_join);
127 extern Expr *canonicalize_ec_expression(Expr *expr,
128  Oid req_type, Oid req_collation);
129 extern void reconsider_outer_join_clauses(PlannerInfo *root);
131  Expr *expr,
132  Relids nullable_relids,
133  List *opfamilies,
134  Oid opcintype,
135  Oid collation,
136  Index sortref,
137  Relids rel,
138  bool create_it);
141  Relids join_relids,
142  Relids outer_relids,
143  RelOptInfo *inner_rel);
145  List *eclasses,
146  Relids join_relids,
147  Relids outer_relids,
148  RelOptInfo *inner_rel);
149 extern bool exprs_known_equal(PlannerInfo *root, Node *item1, Node *item2);
151  ForeignKeyOptInfo *fkinfo,
152  int colno);
153 extern void add_child_rel_equivalences(PlannerInfo *root,
154  AppendRelInfo *appinfo,
155  RelOptInfo *parent_rel,
156  RelOptInfo *child_rel);
158  RelOptInfo *rel,
160  void *callback_arg,
161  Relids prohibited_rels);
163  RelOptInfo *rel1, RelOptInfo *rel2);
165  RelOptInfo *rel1);
166 extern bool eclass_useful_for_merging(PlannerInfo *root,
168  RelOptInfo *rel);
169 extern bool is_redundant_derived_clause(RestrictInfo *rinfo, List *clauselist);
171 /*
172  * pathkeys.c
173  * utilities for matching and building path keys
174  */
175 typedef enum
176 {
177  PATHKEYS_EQUAL, /* pathkeys are identical */
178  PATHKEYS_BETTER1, /* pathkey 1 is a superset of pathkey 2 */
179  PATHKEYS_BETTER2, /* vice versa */
180  PATHKEYS_DIFFERENT /* neither pathkey includes the other */
183 extern PathKeysComparison compare_pathkeys(List *keys1, List *keys2);
184 extern bool pathkeys_contained_in(List *keys1, List *keys2);
185 extern Path *get_cheapest_path_for_pathkeys(List *paths, List *pathkeys,
186  Relids required_outer,
187  CostSelector cost_criterion,
188  bool require_parallel_safe);
190  List *pathkeys,
191  Relids required_outer,
192  double fraction);
195  ScanDirection scandir);
196 extern List *build_expression_pathkey(PlannerInfo *root, Expr *expr,
197  Relids nullable_relids, Oid opno,
198  Relids rel, bool create_it);
200  List *subquery_pathkeys,
201  List *subquery_tlist);
202 extern List *build_join_pathkeys(PlannerInfo *root,
203  RelOptInfo *joinrel,
204  JoinType jointype,
205  List *outer_pathkeys);
207  List *sortclauses,
208  List *tlist);
210  RestrictInfo *restrictinfo);
211 extern void update_mergeclause_eclasses(PlannerInfo *root,
212  RestrictInfo *restrictinfo);
214  List *pathkeys,
215  bool outer_keys,
216  List *restrictinfos);
218  List *mergeclauses,
219  RelOptInfo *joinrel);
221  List *mergeclauses,
222  List *outer_pathkeys);
224  RelOptInfo *rel,
225  List *pathkeys);
226 extern bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel);
228  EquivalenceClass *eclass, Oid opfamily,
229  int strategy, bool nulls_first);
231 #endif /* PATHS_H */
bool is_redundant_derived_clause(RestrictInfo *rinfo, List *clauselist)
Definition: equivclass.c:2456
bool eclass_useful_for_merging(PlannerInfo *root, EquivalenceClass *eclass, RelOptInfo *rel)
Definition: equivclass.c:2398
void generate_gather_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: allpaths.c:2235
int compute_parallel_worker(RelOptInfo *rel, double heap_pages, double index_pages)
Definition: allpaths.c:3103
void create_tidscan_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: tidpath.c:253
RelOptInfo *(* join_search_hook_type)(PlannerInfo *root, int levels_needed, List *initial_rels)
Definition: paths.h:45
RelOptInfo * make_join_rel(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
Definition: joinrels.c:657
List * truncate_useless_pathkeys(PlannerInfo *root, RelOptInfo *rel, List *pathkeys)
Definition: pathkeys.c:1518
List * generate_join_implied_equalities_for_ecs(PlannerInfo *root, List *eclasses, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
Definition: equivclass.c:1050
void set_dummy_rel_pathlist(RelOptInfo *rel)
Definition: allpaths.c:1742
bool enable_geqo
Definition: allpaths.c:59
Path * get_cheapest_path_for_pathkeys(List *paths, List *pathkeys, Relids required_outer, CostSelector cost_criterion, bool require_parallel_safe)
Definition: pathkeys.c:343
List * build_join_pathkeys(PlannerInfo *root, RelOptInfo *joinrel, JoinType jointype, List *outer_pathkeys)
Definition: pathkeys.c:822
bool have_join_order_restriction(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
Definition: joinrels.c:919
Definition: nodes.h:509
PathKeysComparison compare_pathkeys(List *keys1, List *keys2)
Definition: pathkeys.c:278
bool relation_has_unique_index_for(PlannerInfo *root, RelOptInfo *rel, List *restrictlist, List *exprlist, List *oprlist)
Definition: indxpath.c:2960
unsigned int Oid
Definition: postgres_ext.h:31
RelOptInfo * make_one_rel(PlannerInfo *root, List *joinlist)
Definition: allpaths.c:146
bool pathkeys_contained_in(List *keys1, List *keys2)
Definition: pathkeys.c:317
int min_parallel_index_scan_size
Definition: allpaths.c:62
Expr * canonicalize_ec_expression(Expr *expr, Oid req_type, Oid req_collation)
Definition: equivclass.c:456
Expr * adjust_rowcompare_for_index(RowCompareExpr *clause, IndexOptInfo *index, int indexcol, List **indexcolnos, bool *var_on_left_p)
Definition: indxpath.c:3824
void create_index_paths(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:232
Definition: c.h:1052
char bool
Definition: c.h:202
static struct cvec * eclass(struct vars *v, chr c, int cases)
Definition: regc_locale.c:508
Definition: nodes.h:673
bool(* ec_matches_callback_type)(PlannerInfo *root, RelOptInfo *rel, EquivalenceClass *ec, EquivalenceMember *em, void *arg)
Definition: paths.h:119
Definition: type.h:89
void add_child_rel_equivalences(PlannerInfo *root, AppendRelInfo *appinfo, RelOptInfo *parent_rel, RelOptInfo *child_rel)
Definition: equivclass.c:2070
bool exprs_known_equal(PlannerInfo *root, Node *item1, Node *item2)
Definition: equivclass.c:1945
void(* set_join_pathlist_hook_type)(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outerrel, RelOptInfo *innerrel, JoinType jointype, JoinPathExtraData *extra)
Definition: paths.h:36
void initialize_mergeclause_eclasses(PlannerInfo *root, RestrictInfo *restrictinfo)
Definition: pathkeys.c:919
List * generate_implied_equalities_for_column(PlannerInfo *root, RelOptInfo *rel, ec_matches_callback_type callback, void *callback_arg, Relids prohibited_rels)
Definition: equivclass.c:2174
List * build_index_pathkeys(PlannerInfo *root, IndexOptInfo *index, ScanDirection scandir)
Definition: pathkeys.c:460
void generate_base_implied_equalities(PlannerInfo *root)
Definition: equivclass.c:762
static void callback(struct sockaddr *addr, struct sockaddr *mask, void *unused)
Definition: test_ifaddrs.c:48
Path * get_cheapest_fractional_path_for_pathkeys(List *paths, List *pathkeys, Relids required_outer, double fraction)
Definition: pathkeys.c:388
PGDLLIMPORT join_search_hook_type join_search_hook
Definition: allpaths.c:68
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)
Definition: equivclass.c:581
bool match_index_to_operand(Node *operand, int indexcol, IndexOptInfo *index)
Definition: indxpath.c:3180
Definition: sdir.h:22
PGDLLIMPORT set_join_pathlist_hook_type set_join_pathlist_hook
Definition: joinpath.c:27
void reconsider_outer_join_clauses(PlannerInfo *root)
Definition: equivclass.c:1534
List * build_expression_pathkey(PlannerInfo *root, Expr *expr, Relids nullable_relids, Oid opno, Relids rel, bool create_it)
Definition: pathkeys.c:553
bool process_equivalence(PlannerInfo *root, RestrictInfo *restrictinfo, bool below_outer_join)
Definition: equivclass.c:107
bool has_useful_pathkeys(PlannerInfo *root, RelOptInfo *rel)
Definition: pathkeys.c:1558
bool have_dangerous_phv(PlannerInfo *root, Relids outer_relids, Relids inner_params)
Definition: joinrels.c:1152
void(* set_rel_pathlist_hook_type)(PlannerInfo *root, RelOptInfo *rel, Index rti, RangeTblEntry *rte)
Definition: paths.h:29
unsigned int Index
Definition: c.h:359
List * find_mergeclauses_for_pathkeys(PlannerInfo *root, List *pathkeys, bool outer_keys, List *restrictinfos)
Definition: pathkeys.c:1003
void create_partial_bitmap_paths(PlannerInfo *root, RelOptInfo *rel, Path *bitmapqual)
Definition: allpaths.c:3071
RelOptInfo * standard_join_search(PlannerInfo *root, int levels_needed, List *initial_rels)
Definition: allpaths.c:2387
List * make_inner_pathkeys_for_merge(PlannerInfo *root, List *mergeclauses, List *outer_pathkeys)
Definition: pathkeys.c:1292
void add_paths_to_joinrel(PlannerInfo *root, RelOptInfo *joinrel, RelOptInfo *outerrel, RelOptInfo *innerrel, JoinType jointype, SpecialJoinInfo *sjinfo, List *restrictlist)
Definition: joinpath.c:107
Definition: relation.h:34
bool have_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1, RelOptInfo *rel2)
Definition: equivclass.c:2305
Path * get_cheapest_parallel_safe_total_inner(List *paths)
Definition: pathkeys.c:421
void check_index_predicates(PlannerInfo *root, RelOptInfo *rel)
Definition: indxpath.c:2774
List * convert_subquery_pathkeys(PlannerInfo *root, RelOptInfo *rel, List *subquery_pathkeys, List *subquery_tlist)
Definition: pathkeys.c:607
void join_search_one_level(PlannerInfo *root, int level)
Definition: joinrels.c:54
int geqo_threshold
Definition: allpaths.c:60
Definition: paths.h:175
bool has_relevant_eclass_joinclause(PlannerInfo *root, RelOptInfo *rel1)
Definition: equivclass.c:2359
EquivalenceClass * match_eclasses_to_foreign_key_col(PlannerInfo *root, ForeignKeyOptInfo *fkinfo, int colno)
Definition: equivclass.c:1992
bool indexcol_is_bool_constant_for_query(IndexOptInfo *index, int indexcol)
Definition: indxpath.c:3131
void * arg
List * select_outer_pathkeys_for_merge(PlannerInfo *root, List *mergeclauses, RelOptInfo *joinrel)
Definition: pathkeys.c:1120
PGDLLIMPORT set_rel_pathlist_hook_type set_rel_pathlist_hook
Definition: allpaths.c:65
void expand_indexqual_conditions(IndexOptInfo *index, List *indexclauses, List *indexclausecols, List **indexquals_p, List **indexqualcols_p)
Definition: indxpath.c:3526
void update_mergeclause_eclasses(PlannerInfo *root, RestrictInfo *restrictinfo)
Definition: pathkeys.c:968
Definition: pg_list.h:45
int min_parallel_table_scan_size
Definition: allpaths.c:61
List * make_pathkeys_for_sortclauses(PlannerInfo *root, List *sortclauses, List *tlist)
Definition: pathkeys.c:865
List * generate_join_implied_equalities(PlannerInfo *root, Relids join_relids, Relids outer_relids, RelOptInfo *inner_rel)
Definition: equivclass.c:1033
PathKey * make_canonical_pathkey(PlannerInfo *root, EquivalenceClass *eclass, Oid opfamily, int strategy, bool nulls_first)
Definition: pathkeys.c:51