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 a31ad27fc5 Simplify the planner's join clause management by storing join clauses 21 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 Marginal hack to avoid spending a lot of time in find_join_rel during 21 years ago
copyfuncs.c Simplify the planner's join clause management by storing join clauses 21 years ago
equalfuncs.c Simplify the planner's join clause management by storing join clauses 21 years ago
list.c Trivial comment tweak. 21 years ago
makefuncs.c Merge Resdom nodes into TargetEntry nodes to simplify code and save a 21 years ago
nodeFuncs.c Tag appropriate files for rc3 21 years ago
nodes.c Tag appropriate files for rc3 21 years ago
outfuncs.c Simplify the planner's join clause management by storing join clauses 21 years ago
params.c Tag appropriate files for rc3 21 years ago
print.c Change CREATE TYPE to require datatype output and send functions to have 21 years ago
read.c Tag appropriate files for rc3 21 years ago
readfuncs.c Remove planner's private fields from Query struct, and put them into 21 years ago
tidbitmap.c Modify hash_search() API to prevent future occurrences of the error 21 years ago
value.c Some more missed copyright notices. Many of these look like they 21 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