postgresql/src/backend/nodes
Tom Lane 2cf57c8f8d Implement feature of new FE/BE protocol whereby RowDescription identifies
the column by table OID and column number, if it's a simple column
reference.  Along the way, get rid of reskey/reskeyop fields in Resdoms.
Turns out that representation was not convenient for either the planner
or the executor; we can make the planner deliver exactly what the
executor wants with no more effort.
initdb forced due to change in stored rule representation.
2003-05-06 00:20:33 +00:00
..
bitmapset.c Replace planner's representation of relation sets, per pghackers discussion. 2003-02-08 20:20:55 +00:00
copyfuncs.c Implement feature of new FE/BE protocol whereby RowDescription identifies 2003-05-06 00:20:33 +00:00
equalfuncs.c Implement feature of new FE/BE protocol whereby RowDescription identifies 2003-05-06 00:20:33 +00:00
list.c Create a distinction between Lists of integers and Lists of OIDs, to get 2003-02-09 06:56:28 +00:00
Makefile Replace planner's representation of relation sets, per pghackers discussion. 2003-02-08 20:20:55 +00:00
makefuncs.c Implement feature of new FE/BE protocol whereby RowDescription identifies 2003-05-06 00:20:33 +00:00
nodeFuncs.c Phase 3 of read-only-plans project: ExecInitExpr now builds expression 2002-12-13 19:46:01 +00:00
nodes.c Code review for palloc0 patch --- avoid dangerous and unnecessary 2002-12-16 16:22:46 +00:00
outfuncs.c Implement feature of new FE/BE protocol whereby RowDescription identifies 2003-05-06 00:20:33 +00:00
print.c Implement feature of new FE/BE protocol whereby RowDescription identifies 2003-05-06 00:20:33 +00:00
read.c Restructure outfuncs and readfuncs to use macros in the same style as 2002-11-25 18:12:12 +00:00
readfuncs.c Implement feature of new FE/BE protocol whereby RowDescription identifies 2003-05-06 00:20:33 +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