/*------------------------------------------------------------------------- * * paths.h * prototypes for various files in optimizer/path (were separate * header files) * * * Portions Copyright (c) 1996-2000, PostgreSQL, Inc * Portions Copyright (c) 1994, Regents of the University of California * * $Id: paths.h,v 1.46 2000/07/24 03:10:54 tgl Exp $ * *------------------------------------------------------------------------- */ #ifndef PATHS_H #define PATHS_H #include "nodes/relation.h" /* default GEQO threshold (default value for geqo_rels) */ #define DEFAULT_GEQO_RELS 11 /* * allpaths.c */ extern bool enable_geqo; extern int geqo_rels; extern RelOptInfo *make_one_rel(Query *root); /* * indxpath.c * routines to generate index paths */ extern void create_index_paths(Query *root, RelOptInfo *rel, List *indices, List *restrictinfo_list, List *joininfo_list); extern Oid indexable_operator(Expr *clause, Oid opclass, Oid relam, bool indexkey_on_left); extern List *extract_or_indexqual_conditions(RelOptInfo *rel, IndexOptInfo *index, Expr *orsubclause); extern List *expand_indexqual_conditions(List *indexquals); /* * orindxpath.c * additional routines for indexable OR clauses */ extern void create_or_index_paths(Query *root, RelOptInfo *rel, List *clauses); /* * tidpath.h * routines to generate tid paths */ extern void create_tidscan_paths(Query *root, RelOptInfo *rel); /* * joinpath.c * routines to create join paths */ extern void add_paths_to_joinrel(Query *root, RelOptInfo *joinrel, RelOptInfo *outerrel, RelOptInfo *innerrel, List *restrictlist); /* * joinrels.c * routines to determine which relations to join */ extern void make_rels_by_joins(Query *root, int level); extern RelOptInfo *make_rels_by_clause_joins(Query *root, RelOptInfo *old_rel, List *other_rels); extern RelOptInfo *make_rels_by_clauseless_joins(Query *root, RelOptInfo *old_rel, List *other_rels); /* * pathkeys.c * utilities for matching and building path keys */ typedef enum { PATHKEYS_EQUAL, /* pathkeys are identical */ PATHKEYS_BETTER1, /* pathkey 1 is a superset of pathkey 2 */ PATHKEYS_BETTER2, /* vice versa */ PATHKEYS_DIFFERENT /* neither pathkey includes the other */ } PathKeysComparison; extern void add_equijoined_keys(Query *root, RestrictInfo *restrictinfo); extern void generate_implied_equalities(Query *root); extern List *canonicalize_pathkeys(Query *root, List *pathkeys); extern PathKeysComparison compare_pathkeys(List *keys1, List *keys2); extern bool pathkeys_contained_in(List *keys1, List *keys2); extern Path *get_cheapest_path_for_pathkeys(List *paths, List *pathkeys, CostSelector cost_criterion); extern Path *get_cheapest_fractional_path_for_pathkeys(List *paths, List *pathkeys, double fraction); extern List *build_index_pathkeys(Query *root, RelOptInfo *rel, IndexOptInfo *index, ScanDirection scandir); extern List *build_join_pathkeys(List *outer_pathkeys, List *join_rel_tlist, List *equi_key_list); extern List *make_pathkeys_for_sortclauses(List *sortclauses, List *tlist); extern List *find_mergeclauses_for_pathkeys(List *pathkeys, List *restrictinfos); extern List *make_pathkeys_for_mergeclauses(Query *root, List *mergeclauses, List *tlist); #endif /* PATHS_H */