nodes.h 5.9 KB
Newer Older
1 2 3
/*-------------------------------------------------------------------------
 *
 * nodes.h--
4
 *	  Definitions for tagged nodes.
5 6 7 8
 *
 *
 * Copyright (c) 1994, Regents of the University of California
 *
M
 
Marc G. Fournier 已提交
9
 * $Id: nodes.h,v 1.27 1998/08/18 00:49:01 scrappy Exp $
10 11 12 13
 *
 *-------------------------------------------------------------------------
 */
#ifndef NODES_H
14
#define NODES_H
15 16 17 18 19 20 21 22

/*
 * The first field of every node is NodeTag. Each node created (with makeNode)
 * will have one of the following tags as the value of its first field.
 *
 * Note that the number of the node tags are not contiguous. We left holes
 * here so that we can add more tags without changing the existing enum's.
 */
23 24 25
typedef enum NodeTag
{
	T_Invalid = 0,
26

27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49
	/*---------------------
	 * TAGS FOR PLAN NODES (plannodes.h)
	 *---------------------
	 */
	T_Plan = 10,
	T_Result,
	T_Append,
	T_Scan,
	T_SeqScan,
	T_IndexScan,
	T_Join,
	T_NestLoop,
	T_MergeJoin,
	T_HashJoin,
	T_Temp,
	T_Material,
	T_Sort,
	T_Agg,
	T_Unique,
	T_Hash,
	T_Choose,
	T_Tee,
	T_Group,
50
	T_SubPlan,
51

52 53 54 55 56 57 58 59 60 61 62 63
	/*---------------------
	 * TAGS FOR PRIMITIVE NODES (primnodes.h)
	 *---------------------
	 */
	T_Resdom = 100,
	T_Fjoin,
	T_Expr,
	T_Var,
	T_Oper,
	T_Const,
	T_Param,
	T_Aggreg,
64
	T_SubLink,
65 66 67
	T_Func,
	T_Array,
	T_ArrayRef,
68

69 70 71 72
	/*---------------------
	 * TAGS FOR INNER PLAN NODES (relation.h)
	 *---------------------
	 */
B
Bruce Momjian 已提交
73
	T_RelOptInfo = 200,
74 75 76 77 78 79 80 81 82 83 84 85 86 87 88
	T_Path,
	T_IndexPath,
	T_JoinPath,
	T_MergePath,
	T_HashPath,
	T_OrderKey,
	T_JoinKey,
	T_MergeOrder,
	T_CInfo,
	T_JoinMethod,
	T_HInfo,
	T_MInfo,
	T_JInfo,
	T_Iter,
	T_Stream,
89

90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119
	/*---------------------
	 * TAGS FOR EXECUTOR NODES (execnodes.h)
	 *---------------------
	 */
	T_IndexInfo = 300,
	T_RelationInfo,
	T_TupleCount,
	T_TupleTableSlot,
	T_ExprContext,
	T_ProjectionInfo,
	T_JunkFilter,
	T_EState,
	T_BaseNode,
	T_CommonState,
	T_ResultState,
	T_AppendState,
	T_CommonScanState,
	T_ScanState,
	T_IndexScanState,
	T_JoinState,
	T_NestLoopState,
	T_MergeJoinState,
	T_HashJoinState,
	T_MaterialState,
	T_AggState,
	T_GroupState,
	T_SortState,
	T_UniqueState,
	T_HashState,
	T_TeeState,
120

121 122 123 124 125 126 127 128 129
	/*---------------------
	 * TAGS FOR MEMORY NODES (memnodes.h)
	 *---------------------
	 */
	T_MemoryContext = 400,
	T_GlobalMemory,
	T_PortalMemoryContext,
	T_PortalVariableMemory,
	T_PortalHeapMemory,
130

131 132 133 134 135 136 137 138 139 140
	/*---------------------
	 * TAGS FOR VALUE NODES (pg_list.h)
	 *---------------------
	 */
	T_Value = 500,
	T_List,
	T_Integer,
	T_Float,
	T_String,
	T_Null,
141

142 143 144 145 146
	/*---------------------
	 * TAGS FOR PARSE TREE NODES (parsenode.h)
	 *---------------------
	 */
	T_Query = 600,
B
Bruce Momjian 已提交
147
	T_InsertStmt,
148
	T_DeleteStmt,
B
Bruce Momjian 已提交
149 150
	T_UpdateStmt,
	T_SelectStmt,
151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186
	T_AddAttrStmt,
	T_AggregateStmt,
	T_ChangeACLStmt,
	T_ClosePortalStmt,
	T_ClusterStmt,
	T_CopyStmt,
	T_CreateStmt,
	T_VersionStmt,
	T_DefineStmt,
	T_DestroyStmt,
	T_ExtendStmt,
	T_FetchStmt,
	T_IndexStmt,
	T_ProcedureStmt,
	T_RecipeStmt,
	T_RemoveAggrStmt,
	T_RemoveFuncStmt,
	T_RemoveOperStmt,
	T_RemoveStmt,
	T_RenameStmt,
	T_RuleStmt,
	T_NotifyStmt,
	T_ListenStmt,
	T_TransactionStmt,
	T_ViewStmt,
	T_LoadStmt,
	T_CreatedbStmt,
	T_DestroydbStmt,
	T_VacuumStmt,
	T_ExplainStmt,
	T_CreateSeqStmt,
	T_VariableSetStmt,
	T_VariableShowStmt,
	T_VariableResetStmt,
	T_CreateTrigStmt,
	T_DropTrigStmt,
187 188
	T_CreatePLangStmt,
	T_DropPLangStmt,
189 190 191
	T_CreateUserStmt,
	T_AlterUserStmt,
	T_DropUserStmt,
192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207

	T_A_Expr = 700,
	T_Attr,
	T_A_Const,
	T_ParamNo,
	T_Ident,
	T_FuncCall,
	T_A_Indices,
	T_ResTarget,
	T_ParamString,
	T_RelExpr,
	T_SortGroupBy,
	T_RangeVar,
	T_TypeName,
	T_IndexElem,
	T_ColumnDef,
T
Thomas G. Lockhart 已提交
208
	T_Constraint,
209 210 211 212 213
	T_DefElem,
	T_TargetEntry,
	T_RangeTblEntry,
	T_SortClause,
	T_GroupClause,
M
 
Marc G. Fournier 已提交
214 215
	T_SubSelect,
	T_JoinUsing
216
} NodeTag;
217 218 219 220 221 222 223

/*
 * The first field of a node of any type is gauranteed to be the NodeTag.
 * Hence the type of any node can be gotten by casting it to Node. Declaring
 * a variable to be of Node * (instead of void *) can also facilitate
 * debugging.
 */
224 225
typedef struct Node
{
226
	NodeTag		type;
227
} Node;
228

229
#define nodeTag(_node_)			((Node*)_node_)->type
230

231 232
#define makeNode(_node_)		(_node_*)newNode(sizeof(_node_),T_##_node_)
#define NodeSetTag(n, t)		((Node *)n)->type = t
233

234
#define IsA(_node_,_tag_)		(nodeTag(_node_) == T_##_tag_)
235 236

/* ----------------------------------------------------------------
237
 *					  IsA functions (no inheritence any more)
238 239 240
 * ----------------------------------------------------------------
 */
#define IsA_JoinPath(jp) \
241 242
	(nodeTag(jp)==T_JoinPath || nodeTag(jp)==T_MergePath || \
	 nodeTag(jp)==T_HashPath)
243 244

#define IsA_Join(j) \
245 246
	(nodeTag(j)==T_Join || nodeTag(j)==T_NestLoop || \
	 nodeTag(j)==T_MergeJoin || nodeTag(j)==T_HashJoin)
247 248

#define IsA_Temp(t) \
249 250
	(nodeTag(t)==T_Temp || nodeTag(t)==T_Material || nodeTag(t)==T_Sort || \
	 nodeTag(t)==T_Unique)
251 252

/* ----------------------------------------------------------------
253
 *					  extern declarations follow
254 255 256 257 258 259
 * ----------------------------------------------------------------
 */

/*
 * nodes/nodes.c
 */
260
extern Node *newNode(Size size, NodeTag tag);
261 262 263 264

/*
 * nodes/{outfuncs.c,print.c}
 */
265
#define nodeDisplay		pprint
266

267 268
extern char *nodeToString(void *obj);
extern void print(void *obj);
269 270 271 272

/*
 * nodes/{readfuncs.c,read.c}
 */
273
extern void *stringToNode(char *str);
274 275 276 277

/*
 * nodes/copyfuncs.c
 */
278
extern void *copyObject(void *obj);
279 280 281 282

/*
 * nodes/equalfuncs.c
 */
283
extern bool equal(void *a, void *b);
284 285 286


/* ----------------
287 288
 *		I don't know why this is here.  Most likely a hack..
 *		-cim 6/3/90
289 290
 * ----------------
 */
291
typedef float Cost;
292 293 294

/*
 * CmdType -
295
 *	  enums for type of operation to aid debugging
296 297
 *
 * ??? could have put this in parsenodes.h but many files not in the
298
 *	  optimizer also need this...
299
 */
300 301 302 303 304 305 306 307
typedef enum CmdType
{
	CMD_UNKNOWN,
	CMD_SELECT,					/* select stmt (formerly retrieve) */
	CMD_UPDATE,					/* update stmt (formerly replace) */
	CMD_INSERT,					/* insert stmt (formerly append) */
	CMD_DELETE,
	CMD_NOTIFY,
M
 
Marc G. Fournier 已提交
308
	CMD_UTILITY,					/* cmds like create, destroy, copy,
309
								 * vacuum, etc. */
M
 
Marc G. Fournier 已提交
310 311 312 313
	CMD_NOTHING					/* dummy command for
							 * instead nothing
							 * rules with qual
							 */
314
} CmdType;
315

316

317
#endif							/* NODES_H */