postgresql/src/backend/nodes
Tom Lane 55f7c3300d Reimplement CASE val WHEN compval1 THEN ... WHEN compval2 THEN ... END
so that the 'val' is computed only once, per recent discussion.  The
speedup is not much when 'val' is just a simple variable, but could be
significant for larger expressions.  More importantly this avoids issues
with multiple evaluations of a volatile 'val', and it allows the CASE
expression to be reverse-listed in its original form by ruleutils.c.
2004-03-17 20:48:43 +00:00
..
bitmapset.c $Header: -> $PostgreSQL Changes ... 2003-11-29 19:52:15 +00:00
copyfuncs.c Reimplement CASE val WHEN compval1 THEN ... WHEN compval2 THEN ... END 2004-03-17 20:48:43 +00:00
equalfuncs.c Reimplement CASE val WHEN compval1 THEN ... WHEN compval2 THEN ... END 2004-03-17 20:48:43 +00:00
list.c Cleanup: move the 'Value' node into a separate file, rather than putting 2004-01-07 18:43:36 +00:00
Makefile Cleanup: move the 'Value' node into a separate file, rather than putting 2004-01-07 18:43:36 +00:00
makefuncs.c $Header: -> $PostgreSQL Changes ... 2003-11-29 19:52:15 +00:00
nodeFuncs.c $Header: -> $PostgreSQL Changes ... 2003-11-29 19:52:15 +00:00
nodes.c $Header: -> $PostgreSQL Changes ... 2003-11-29 19:52:15 +00:00
outfuncs.c Reimplement CASE val WHEN compval1 THEN ... WHEN compval2 THEN ... END 2004-03-17 20:48:43 +00:00
print.c $Header: -> $PostgreSQL Changes ... 2003-11-29 19:52:15 +00:00
read.c Remove duplicate include of value.h. I think it got in because Tom and I both added it. 2004-01-09 03:07:32 +00:00
readfuncs.c Reimplement CASE val WHEN compval1 THEN ... WHEN compval2 THEN ... END 2004-03-17 20:48:43 +00:00
README make sure the $Id tags are converted to $PostgreSQL as well ... 2003-11-29 22:41:33 +00:00
value.c Cleanup: move the 'Value' node into a separate file, rather than putting 2004-01-07 18:43:36 +00:00

*******************************************************************************
*                                                                             *
* EXPLANATION OF THE NODE STRUCTURES                                          *
*    - Andrew Yu (11/94)                                                      *
*                                                                             *
* Copyright (c) 1994, Regents of the University of California                 *
*                                                                             *
* $PostgreSQL: pgsql/src/backend/nodes/README,v 1.2 2003/11/29 22:39:45 pgsql 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