You can not select more than 25 topics Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
 
 
 
 
 
 
postgres/src/backend/nodes
Tom Lane 986085a7f0 Improve the representation of FOR UPDATE/FOR SHARE so that we can 20 years ago
..
Makefile Initial implementation of lossy-tuple-bitmap data structures. 21 years ago
README make sure the $Id tags are converted to $PostgreSQL as well ... 22 years ago
bitmapset.c Update copyright for 2006. Update scripts. 20 years ago
copyfuncs.c Improve the representation of FOR UPDATE/FOR SHARE so that we can 20 years ago
equalfuncs.c Improve the representation of FOR UPDATE/FOR SHARE so that we can 20 years ago
list.c Update copyright for 2006. Update scripts. 20 years ago
makefuncs.c Improve parser so that we can show an error cursor position for errors 20 years ago
nodeFuncs.c Update copyright for 2006. Update scripts. 20 years ago
nodes.c Update copyright for 2006. Update scripts. 20 years ago
outfuncs.c Improve the representation of FOR UPDATE/FOR SHARE so that we can 20 years ago
params.c Simplify ParamListInfo data structure to support only numbered parameters, 20 years ago
print.c Modify all callers of datatype input and receive functions so that if these 20 years ago
read.c Update copyright for 2006. Update scripts. 20 years ago
readfuncs.c Improve the representation of FOR UPDATE/FOR SHARE so that we can 20 years ago
tidbitmap.c Update copyright for 2006. Update scripts. 20 years ago
value.c Update copyright for 2006. Update scripts. 20 years ago

README

*******************************************************************************
* *
* 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