postgres/src/include/optimizer/pathnode.h

/*-------------------------------------------------------------------------
 *
 * pathnode.h
 *	  prototypes for pathnode.c, indexnode.c, relnode.c.
 *
 *
 * Portions Copyright (c) 1996-2000, PostgreSQL, Inc
 * Portions Copyright (c) 1994, Regents of the University of California
 *
 * $Id: pathnode.h,v 1.24 2000/01/26 05:58:20 momjian Exp $
 *
 *-------------------------------------------------------------------------
 */
#ifndef PATHNODE_H
#define PATHNODE_H

#include "nodes/relation.h"

/*
 * prototypes for pathnode.c
 */
extern bool path_is_cheaper(Path *path1, Path *path2);
extern Path *set_cheapest(RelOptInfo *parent_rel, List *pathlist);
extern List *add_pathlist(RelOptInfo *parent_rel, List *old_paths,
						  List *new_paths);

extern Path *create_seqscan_path(RelOptInfo *rel);
extern IndexPath *create_index_path(Query *root, RelOptInfo *rel,
									IndexOptInfo *index,
									List *restriction_clauses);
extern TidPath *create_tidscan_path(RelOptInfo *rel, List *tideval);

extern NestPath *create_nestloop_path(RelOptInfo *joinrel,
									  Path *outer_path, Path *inner_path,
									  List *pathkeys);

extern MergePath *create_mergejoin_path(RelOptInfo *joinrel, Path *outer_path,
										Path *inner_path, List *pathkeys,
										List *mergeclauses,
										List *outersortkeys,
										List *innersortkeys);

extern HashPath *create_hashjoin_path(RelOptInfo *joinrel, Path *outer_path,
									  Path *inner_path, List *hashclauses,
									  Selectivity innerdisbursion);

/*
 * prototypes for rel.c
 */
extern RelOptInfo *rel_member(Relids relid, List *rels);
extern RelOptInfo *get_base_rel(Query *root, int relid);
extern RelOptInfo *get_join_rel(Query *root, Relids relid);

/*
 * prototypes for indexnode.h
 */
extern List *find_relation_indices(Query *root, RelOptInfo *rel);

#endif	 /* PATHNODE_H */
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00			`/*-------------------------------------------------------------------------`
			`*`
Change my-function-name-- to my_function_name, and optimizer renames. 1999-02-13 23:22:53 +00:00			`* pathnode.h`
Massive commit to run PGINDENT on all .c and .h files. 1997-09-07 05:04:48 +00:00			`* prototypes for pathnode.c, indexnode.c, relnode.c.`
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00			`*`
			`*`
Add: * Portions Copyright (c) 1996-2000, PostgreSQL, Inc to all files copyright Regents of Berkeley. Man, that's a lot of files. 2000-01-26 05:58:53 +00:00			`* Portions Copyright (c) 1996-2000, PostgreSQL, Inc`
			`* Portions Copyright (c) 1994, Regents of the University of California`
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00			`*`
Add: * Portions Copyright (c) 1996-2000, PostgreSQL, Inc to all files copyright Regents of Berkeley. Man, that's a lot of files. 2000-01-26 05:58:53 +00:00			`* $Id: pathnode.h,v 1.24 2000/01/26 05:58:20 momjian Exp $`
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00			`*`
			`*-------------------------------------------------------------------------`
			`*/`
			`#ifndef PATHNODE_H`
			`#define PATHNODE_H`

Cleanup up include files. 1997-11-26 01:14:33 +00:00			`#include "nodes/relation.h"`

Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00			`/*`
			`* prototypes for pathnode.c`
			`*/`
Used modified version of indent that understands over 100 typedefs. 1997-09-08 21:56:23 +00:00			`extern bool path_is_cheaper(Path path1, Path path2);`
Another pgindent run. Sorry folks. 1999-05-25 22:43:53 +00:00			`extern Path set_cheapest(RelOptInfo parent_rel, List *pathlist);`
Major planner/optimizer revision: get rid of PathOrder node type, store all ordering information in pathkeys lists (which are now lists of lists of PathKeyItem nodes, not just lists of lists of vars). This was a big win --- the code is smaller and IMHO more understandable than it was, even though it handles more cases. I believe the node changes will not force an initdb for anyone; planner nodes don't show up in stored rules. 1999-08-16 02:17:58 +00:00			`extern List add_pathlist(RelOptInfo parent_rel, List *old_paths,`
Another round of planner/optimizer work. This is just restructuring and code cleanup; no major improvements yet. However, EXPLAIN does produce more intuitive outputs for nested loops with indexscans now... 2000-01-09 00:26:47 +00:00			`List *new_paths);`
Major planner/optimizer revision: get rid of PathOrder node type, store all ordering information in pathkeys lists (which are now lists of lists of PathKeyItem nodes, not just lists of lists of vars). This was a big win --- the code is smaller and IMHO more understandable than it was, even though it handles more cases. I believe the node changes will not force an initdb for anyone; planner nodes don't show up in stored rules. 1999-08-16 02:17:58 +00:00
Another pgindent run. Sorry folks. 1999-05-25 22:43:53 +00:00			`extern Path create_seqscan_path(RelOptInfo rel);`
Major planner/optimizer revision: get rid of PathOrder node type, store all ordering information in pathkeys lists (which are now lists of lists of PathKeyItem nodes, not just lists of lists of vars). This was a big win --- the code is smaller and IMHO more understandable than it was, even though it handles more cases. I believe the node changes will not force an initdb for anyone; planner nodes don't show up in stored rules. 1999-08-16 02:17:58 +00:00			`extern IndexPath create_index_path(Query root, RelOptInfo *rel,`
Another round of planner/optimizer work. This is just restructuring and code cleanup; no major improvements yet. However, EXPLAIN does produce more intuitive outputs for nested loops with indexscans now... 2000-01-09 00:26:47 +00:00			`IndexOptInfo *index,`
			`List *restriction_clauses);`
Tid access method feature from Hiroshi Inoue, Inoue@tpf.co.jp 1999-11-23 20:07:06 +00:00			`extern TidPath create_tidscan_path(RelOptInfo rel, List *tideval);`
Major planner/optimizer revision: get rid of PathOrder node type, store all ordering information in pathkeys lists (which are now lists of lists of PathKeyItem nodes, not just lists of lists of vars). This was a big win --- the code is smaller and IMHO more understandable than it was, even though it handles more cases. I believe the node changes will not force an initdb for anyone; planner nodes don't show up in stored rules. 1999-08-16 02:17:58 +00:00
			`extern NestPath create_nestloop_path(RelOptInfo joinrel,`
Another round of planner/optimizer work. This is just restructuring and code cleanup; no major improvements yet. However, EXPLAIN does produce more intuitive outputs for nested loops with indexscans now... 2000-01-09 00:26:47 +00:00			`Path outer_path, Path inner_path,`
			`List *pathkeys);`

			`extern MergePath create_mergejoin_path(RelOptInfo joinrel, Path *outer_path,`
			`Path inner_path, List pathkeys,`
			`List *mergeclauses,`
			`List *outersortkeys,`
			`List *innersortkeys);`

			`extern HashPath create_hashjoin_path(RelOptInfo joinrel, Path *outer_path,`
			`Path inner_path, List hashclauses,`
			`Selectivity innerdisbursion);`
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00
			`/*`
			`* prototypes for rel.c`
			`*/`
Fix bushy plans. Cleanup. 1999-02-18 00:49:48 +00:00			`extern RelOptInfo rel_member(Relids relid, List rels);`
Rename Rel to RelOptInfo. 1998-07-18 04:22:52 +00:00			`extern RelOptInfo get_base_rel(Query root, int relid);`
Fix bushy plans. Cleanup. 1999-02-18 00:49:48 +00:00			`extern RelOptInfo get_join_rel(Query root, Relids relid);`
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00
			`/*`
			`* prototypes for indexnode.h`
			`*/`
Another pgindent run. Sorry folks. 1999-05-25 22:43:53 +00:00			`extern List find_relation_indices(Query root, RelOptInfo *rel);`
Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00
OK, folks, here is the pgindent output. 1998-09-01 04:40:42 +00:00			`#endif /* PATHNODE_H */`