1 /*-------------------------------------------------------------------------
4 * prototypes for pathnode.c, indexnode.c, relnode.c.
7 * Copyright (c) 1994, Regents of the University of California
9 * $Id: pathnode.h,v 1.2 1997/09/07 04:59:11 momjian Exp $
11 *-------------------------------------------------------------------------
17 * prototypes for pathnode.c
19 extern bool path_is_cheaper(Path * path1, Path * path2);
20 extern Path *set_cheapest(Rel * parent_rel, List * pathlist);
22 add_pathlist(Rel * parent_rel, List * unique_paths,
24 extern Path *create_seqscan_path(Rel * rel);
26 create_index_path(Query * root, Rel * rel, Rel * index,
27 List * restriction_clauses, bool is_join_scan);
29 create_nestloop_path(Rel * joinrel, Rel * outer_rel,
30 Path * outer_path, Path * inner_path, List * keys);
32 create_mergesort_path(Rel * joinrel, int outersize,
33 int innersize, int outerwidth, int innerwidth, Path * outer_path,
34 Path * inner_path, List * keys, MergeOrder * order,
35 List * mergeclauses, List * outersortkeys, List * innersortkeys);
38 create_hashjoin_path(Rel * joinrel, int outersize,
39 int innersize, int outerwidth, int innerwidth, Path * outer_path,
40 Path * inner_path, List * keys, Oid operator, List * hashclauses,
41 List * outerkeys, List * innerkeys);
44 * prototypes for rel.c
46 extern Rel *rel_member(List * relid, List * rels);
47 extern Rel *get_base_rel(Query * root, int relid);
48 extern Rel *get_join_rel(Query * root, List * relid);
51 * prototypes for indexnode.h
53 extern List *find_relation_indices(Query * root, Rel * rel);
55 #endif /* PATHNODE_H */