postgresql/src/backend/nodes
Tom Lane 6c59886942 Second try at fixing join alias variables. Instead of attaching miscellaneous
lists to join RTEs, attach a list of Vars and COALESCE expressions that will
replace the join's alias variables during planning.  This simplifies
flatten_join_alias_vars while still making it easy to fix up varno references
when transforming the query tree.  Add regression test cases for interactions
of subqueries with outer joins.
2002-04-28 19:54:29 +00:00
..
Makefile Fix relative path references so that make knowns which dependencies refer 2000-08-31 16:12:35 +00:00
README Postgres95 1.01 Distribution - Virgin Sources 1996-07-09 06:22:35 +00:00
copyfuncs.c Second try at fixing join alias variables. Instead of attaching miscellaneous 2002-04-28 19:54:29 +00:00
equalfuncs.c Second try at fixing join alias variables. Instead of attaching miscellaneous 2002-04-28 19:54:29 +00:00
list.c Functions live in namespaces. Qualified function names work, eg 2002-04-09 20:35:55 +00:00
makefuncs.c Operators live in namespaces. CREATE/DROP/COMMENT ON OPERATOR take 2002-04-16 23:08:12 +00:00
nodeFuncs.c First phase of SCHEMA changes, concentrating on fixing the grammar and 2002-03-21 16:02:16 +00:00
nodes.c Change Copyright from PostgreSQL, Inc to PostgreSQL Global Development Group. 2001-01-24 19:43:33 +00:00
outfuncs.c Second try at fixing join alias variables. Instead of attaching miscellaneous 2002-04-28 19:54:29 +00:00
print.c EXPLAIN output now comes out as a query result, not a NOTICE message. 2002-03-24 04:31:09 +00:00
read.c pgindent run on all C files. Java run to follow. initdb/regression 2001-10-25 05:50:21 +00:00
readfuncs.c Second try at fixing join alias variables. Instead of attaching miscellaneous 2002-04-28 19:54:29 +00:00

README

*******************************************************************************
*                                                                             *
* EXPLANATION OF THE NODE STRUCTURES                                          *
*    - Andrew Yu (11/94)                                                      *
*                                                                             *
* Copyright (c) 1994, Regents of the University of California                 *
*                                                                             *
* $Id: README,v 1.1.1.1 1996/07/09 06:21:32 scrappy 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