postgresql/src/backend/nodes
Tom Lane e6381966c1 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
..
copyfuncs.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
equalfuncs.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
freefuncs.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
list.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
Makefile Rearrange order of subdirectory creation to help generate parse.h 1999-02-23 07:24:08 +00:00
makefuncs.c Remove unused #includes in *.c files. 1999-07-15 22:40:16 +00:00
nodeFuncs.c Remove unused #includes in *.c files. 1999-07-15 22:40:16 +00:00
nodes.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
outfuncs.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
print.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
read.c Move some system includes into c.h, and remove duplicates. 1999-07-17 20:18:55 +00:00
readfuncs.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
README Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00

*******************************************************************************
*                                                                             *
* EXPLANATION OF THE NODE STRUCTURES                                          *
*    - Andrew Yu (11/94)                                                      *
*                                                                             *
* Copyright (c) 1994, Regents of the University of California                 *
*                                                                             *
* $Id: README,v 1.1.1.1 1996/07/09 06:21:32 scrappy Exp $
*                                                                             *
*******************************************************************************

INTRODUCTION

The current node structures are plain old C structures. "Inheritance" is
achieved by convention. No additional functions will be generated. Functions
that manipulate node structures reside in this directory.


FILES IN THIS DIRECTORY

    Node manipulation functions:
	copyfuncs.c	- copying a node
	equalfuncs.c	- comparing a node
	outfuncs.c	- convert a node to ascii representation
	readfuncs.c	- convert ascii representation back to a node
	makefuncs.c	- creator functions for primitive nodes

    Node definitions:
	nodes.h		- define node tags (NodeTag)
	pg_list.h	- generic list 
	primnodes.h	- primitive nodes
	parsenodes.h	- parse tree nodes
	plannodes.h	- plan tree nodes
	relation.h	- inner plan tree nodes
	execnodes.h	- executor nodes
	memnodes.h	- memory nodes


STEPS TO ADD A NODE

Suppose you wana define a node Foo:

1. add a tag (T_Foo) to the enum NodeTag in nodes.h (You may have to
   recompile the whole tree after doing this.)
2. add the structure definition to the appropriate ???nodes.h file. If you
   intend to inherit from, say a Plan node, put Plan as the first field of
   you definition.
3. if you intend to use copyObject, equal, nodeToString or stringToNode,
   add an appropriate function to copyfuncs.c, equalfuncs.c, outfuncs.c
   and readfuncs.c accordingly. (Except for frequently used nodes, don't
   bother writing a creator function in makefuncs.c)


HISTORICAL NOTE

Prior to the current simple C structure definitions, the Node structures 
uses a pseudo-inheritance system which automatically generates creator and
accessor functions. Since every node inherits from LispValue, the whole thing
is a mess. Here's a little anecdote:

    LispValue definition -- class used to support lisp structures
    in C.  This is here because we did not want to totally rewrite
    planner and executor code which depended on lisp structures when
    we ported postgres V1 from lisp to C. -cim 4/23/90