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.11 1999/02/10 03:52:54 momjian Exp $
11 *-------------------------------------------------------------------------
16 #include "nodes/nodes.h"
17 #include "nodes/relation.h"
18 #include "nodes/parsenodes.h"
21 * prototypes for pathnode.c
23 extern bool path_is_cheaper(Path *path1, Path *path2);
24 extern Path *set_cheapest(RelOptInfo * parent_rel, List *pathlist);
25 extern List *add_pathlist(RelOptInfo * parent_rel, List *unique_paths,
27 extern Path *create_seqscan_path(RelOptInfo * rel);
28 extern IndexPath *create_index_path(Query *root, RelOptInfo * rel, RelOptInfo * index,
29 List *restriction_clauses, bool is_join_scan);
30 extern JoinPath *create_nestloop_path(RelOptInfo * joinrel, RelOptInfo * outer_rel,
31 Path *outer_path, Path *inner_path, List *pathkeys);
32 extern MergePath *create_mergejoin_path(RelOptInfo * joinrel, int outersize,
33 int innersize, int outerwidth, int innerwidth, Path *outer_path,
34 Path *inner_path, List *pathkeys, MergeOrder *order,
35 List *mergeclauses, List *outersortkeys, List *innersortkeys);
37 extern HashPath *create_hashjoin_path(RelOptInfo * joinrel, int outersize,
38 int innersize, int outerwidth, int innerwidth, Path *outer_path,
39 Path *inner_path, List *pathkeys, Oid operator, List *hashclauses,
40 List *outerkeys, List *innerkeys);
43 * prototypes for rel.c
45 extern RelOptInfo *rel_member(List *relid, List *rels);
46 extern RelOptInfo *get_base_rel(Query *root, int relid);
47 extern RelOptInfo *get_join_rel(Query *root, List *relid);
50 * prototypes for indexnode.h
52 extern List *find_relation_indices(Query *root, RelOptInfo * rel);
54 #endif /* PATHNODE_H */