postgresql/src/backend/nodes
Tom Lane 3eb1c82277 Fix planner and rewriter to follow SQL semantics for tables that are
mentioned in FROM but not elsewhere in the query: such tables should be
joined over anyway.  Aside from being more standards-compliant, this allows
removal of some very ugly hacks for COUNT(*) processing.  Also, allow
HAVING clause without aggregate functions, since SQL does.  Clean up
CREATE RULE statement-list syntax the same way Bruce just fixed the
main stmtmulti production.
CAUTION: addition of a field to RangeTblEntry nodes breaks stored rules;
you will have to initdb if you have any rules.
1999-10-07 04:23:24 +00:00
..
copyfuncs.c Fix planner and rewriter to follow SQL semantics for tables that are 1999-10-07 04:23:24 +00:00
equalfuncs.c Fix planner and rewriter to follow SQL semantics for tables that are 1999-10-07 04:23:24 +00:00
freefuncs.c Major revision of sort-node handling: push knowledge of query 1999-08-21 03:49:17 +00:00
list.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
Makefile Rearrange order of subdirectory creation to help generate parse.h 1999-02-23 07:24:08 +00:00
makefuncs.c Further planner/optimizer cleanups. Move all set_tlist_references 1999-08-22 20:15:04 +00:00
nodeFuncs.c Remove unused #includes in *.c files. 1999-07-15 22:40:16 +00:00
nodes.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
outfuncs.c Fix planner and rewriter to follow SQL semantics for tables that are 1999-10-07 04:23:24 +00:00
print.c Major planner/optimizer revision: get rid of PathOrder node type, 1999-08-16 02:17:58 +00:00
read.c Move some system includes into c.h, and remove duplicates. 1999-07-17 20:18:55 +00:00
readfuncs.c Fix planner and rewriter to follow SQL semantics for tables that are 1999-10-07 04:23:24 +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