postgresql/src/backend/nodes
Tom Lane 0f4ff460c4 Fix up the remaining places where the expression node structure would lose
available information about the typmod of an expression; namely, Const,
ArrayRef, ArrayExpr, and EXPR and ARRAY SubLinks.  In the ArrayExpr and
SubLink cases it wasn't really the data structure's fault, but exprTypmod()
being lazy.  This seems like a good idea in view of the expected increase in
typmod usage from Teodor's work to allow user-defined types to have typmods.
In particular this responds to the concerns we had about eliminating the
special-purpose hack that exprTypmod() used to have for BPCHAR Consts.
We can now tell whether or not such a Const has been cast to a specific
length, and report or display properly if so.

initdb forced due to changes in stored rules.
2007-03-17 00:11:05 +00:00
..
bitmapset.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
copyfuncs.c Fix up the remaining places where the expression node structure would lose 2007-03-17 00:11:05 +00:00
equalfuncs.c Fix up the remaining places where the expression node structure would lose 2007-03-17 00:11:05 +00:00
list.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
Makefile Remove remains of old depend target. 2007-01-20 17:16:17 +00:00
makefuncs.c Fix up the remaining places where the expression node structure would lose 2007-03-17 00:11:05 +00:00
nodeFuncs.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
nodes.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
outfuncs.c Fix up the remaining places where the expression node structure would lose 2007-03-17 00:11:05 +00:00
params.c First phase of plan-invalidation project: create a plan cache management 2007-03-13 00:33:44 +00:00
print.c Turn the rangetable used by the executor into a flat list, and avoid storing 2007-02-22 22:00:26 +00:00
read.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
readfuncs.c Fix up the remaining places where the expression node structure would lose 2007-03-17 00:11:05 +00:00
README make sure the $Id tags are converted to $PostgreSQL as well ... 2003-11-29 22:41:33 +00:00
tidbitmap.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +00:00
value.c Update CVS HEAD for 2007 copyright. Back branches are typically not 2007-01-05 22:20:05 +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