postgresql/src/backend/nodes
Tom Lane 472d3935a2 Rethink representation of index clauses' mapping to index columns.
In commit e2c2c2e8b1 I made use of nested
list structures to show which clauses went with which index columns, but
on reflection that's a data structure that only an old-line Lisp hacker
could love.  Worse, it adds unnecessary complication to the many places
that don't much care which clauses go with which index columns.  Revert
to the previous arrangement of flat lists of clauses, and instead add a
parallel integer list of column numbers.  The places that care about the
pairing can chase both lists with forboth(), while the places that don't
care just examine one list the same as before.

The only real downside to this is that there are now two more lists that
need to be passed to amcostestimate functions in case they care about
column matching (which btcostestimate does, so not passing the info is not
an option).  Rather than deal with 11-argument amcostestimate functions,
pass just the IndexPath and expect the functions to extract fields from it.
That gets us down to 7 arguments which is better than 11, and it seems
more future-proof against likely additions to the information we keep
about an index path.
2011-12-24 19:03:21 -05:00
..
Makefile Remove cvs keywords from all files. 2010-09-20 22:08:53 +02:00
README Remove useless whitespace at end of lines 2010-11-23 22:34:55 +02:00
bitmapset.c Remove unnecessary #include references, per pgrminclude script. 2011-09-01 10:04:27 -04:00
copyfuncs.c Add a security_barrier option for views. 2011-12-22 16:16:31 -05:00
equalfuncs.c Add a security_barrier option for views. 2011-12-22 16:16:31 -05:00
list.c Add const qualifiers to node inspection functions 2011-12-07 21:46:56 +02:00
makefuncs.c Ensure that whole-row junk Vars are always of composite type. 2011-11-27 22:27:24 -05:00
nodeFuncs.c Add const qualifiers to node inspection functions 2011-12-07 21:46:56 +02:00
nodes.c Stamp copyrights for year 2011. 2011-01-01 13:18:15 -05:00
outfuncs.c Rethink representation of index clauses' mapping to index columns. 2011-12-24 19:03:21 -05:00
params.c Remove unnecessary #include references, per pgrminclude script. 2011-09-01 10:04:27 -04:00
print.c Add const qualifiers to node inspection functions 2011-12-07 21:46:56 +02:00
read.c Avoid compiler warnings due to possibly unused variables 2011-06-16 23:43:56 +03:00
readfuncs.c Add a security_barrier option for views. 2011-12-22 16:16:31 -05:00
tidbitmap.c Remove many -Wcast-qual warnings 2011-09-11 21:54:32 +03:00
value.c Stamp copyrights for year 2011. 2011-01-01 13:18:15 -05:00

README

src/backend/nodes/README

Node Structures
===============

Andrew Yu (11/94)

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 (src/backend/nodes/)

    General-purpose node manipulation functions:
	copyfuncs.c	- copy a node tree
	equalfuncs.c	- compare two node trees
	outfuncs.c	- convert a node tree to text representation
	readfuncs.c	- convert text representation back to a node tree
	makefuncs.c	- creator functions for some common node types
	nodeFuncs.c	- some other general-purpose manipulation functions

    Specialized manipulation functions:
	bitmapset.c	- Bitmapset support
	list.c		- generic list support
	params.c	- Param support
	tidbitmap.c	- TIDBitmap support
	value.c		- support for Value nodes

FILES IN src/include/nodes/

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


Steps to Add a Node
-------------------

Suppose you wanna define a node Foo:

1. Add a tag (T_Foo) to the enum NodeTag in nodes.h.  (If you insert the
   tag in a way that moves the numbers associated with existing tags,
   you'll need to recompile the whole tree after doing this.  It doesn't
   force initdb though, because the numbers never go to disk.)
2. Add the structure definition to the appropriate include/nodes/???.h file.
   If you intend to inherit from, say a Plan node, put Plan as the first field
   of your struct 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)  The header comments
   in those files give general rules for whether you need to add support.
4. Add cases to the functions in nodeFuncs.c as needed.  There are many
   other places you'll probably also need to teach about your new node
   type.  Best bet is to grep for references to one or two similar existing
   node types to find all the places to touch.


Historical Note
---------------

Prior to the current simple C structure definitions, the Node structures
used a pseudo-inheritance system which automatically generated creator and
accessor functions. Since every node inherited from LispValue, the whole thing
was 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