mirror of
https://github.com/zebrajr/postgres.git
synced 2025-12-07 00:20:24 +01:00
012abebab1
not likely ever to be implemented seeing it's been removed from SQL2003. This allows getting rid of the 'filter' version of yylex() that we had in parser.c, which should save at least a few microseconds in parsing.
481 lines
10 KiB
C
481 lines
10 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* nodes.h
|
|
* Definitions for tagged nodes.
|
|
*
|
|
*
|
|
* Portions Copyright (c) 1996-2006, PostgreSQL Global Development Group
|
|
* Portions Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $PostgreSQL: pgsql/src/include/nodes/nodes.h,v 1.184 2006/03/07 01:00:18 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef NODES_H
|
|
#define NODES_H
|
|
|
|
/*
|
|
* 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 numbers of the node tags are not contiguous. We left holes
|
|
* here so that we can add more tags without changing the existing enum's.
|
|
* (Since node tag numbers never exist outside backend memory, there's no
|
|
* real harm in renumbering, it just costs a full rebuild ...)
|
|
*/
|
|
typedef enum NodeTag
|
|
{
|
|
T_Invalid = 0,
|
|
|
|
/*
|
|
* TAGS FOR EXECUTOR NODES (execnodes.h)
|
|
*/
|
|
T_IndexInfo = 10,
|
|
T_ExprContext,
|
|
T_ProjectionInfo,
|
|
T_JunkFilter,
|
|
T_ResultRelInfo,
|
|
T_EState,
|
|
T_TupleTableSlot,
|
|
|
|
/*
|
|
* TAGS FOR PLAN NODES (plannodes.h)
|
|
*/
|
|
T_Plan = 100,
|
|
T_Result,
|
|
T_Append,
|
|
T_BitmapAnd,
|
|
T_BitmapOr,
|
|
T_Scan,
|
|
T_SeqScan,
|
|
T_IndexScan,
|
|
T_BitmapIndexScan,
|
|
T_BitmapHeapScan,
|
|
T_TidScan,
|
|
T_SubqueryScan,
|
|
T_FunctionScan,
|
|
T_Join,
|
|
T_NestLoop,
|
|
T_MergeJoin,
|
|
T_HashJoin,
|
|
T_Material,
|
|
T_Sort,
|
|
T_Group,
|
|
T_Agg,
|
|
T_Unique,
|
|
T_Hash,
|
|
T_SetOp,
|
|
T_Limit,
|
|
|
|
/*
|
|
* TAGS FOR PLAN STATE NODES (execnodes.h)
|
|
*
|
|
* These should correspond one-to-one with Plan node types.
|
|
*/
|
|
T_PlanState = 200,
|
|
T_ResultState,
|
|
T_AppendState,
|
|
T_BitmapAndState,
|
|
T_BitmapOrState,
|
|
T_ScanState,
|
|
T_SeqScanState,
|
|
T_IndexScanState,
|
|
T_BitmapIndexScanState,
|
|
T_BitmapHeapScanState,
|
|
T_TidScanState,
|
|
T_SubqueryScanState,
|
|
T_FunctionScanState,
|
|
T_JoinState,
|
|
T_NestLoopState,
|
|
T_MergeJoinState,
|
|
T_HashJoinState,
|
|
T_MaterialState,
|
|
T_SortState,
|
|
T_GroupState,
|
|
T_AggState,
|
|
T_UniqueState,
|
|
T_HashState,
|
|
T_SetOpState,
|
|
T_LimitState,
|
|
|
|
/*
|
|
* TAGS FOR PRIMITIVE NODES (primnodes.h)
|
|
*/
|
|
T_Alias = 300,
|
|
T_RangeVar,
|
|
T_Expr,
|
|
T_Var,
|
|
T_Const,
|
|
T_Param,
|
|
T_Aggref,
|
|
T_ArrayRef,
|
|
T_FuncExpr,
|
|
T_OpExpr,
|
|
T_DistinctExpr,
|
|
T_ScalarArrayOpExpr,
|
|
T_BoolExpr,
|
|
T_SubLink,
|
|
T_SubPlan,
|
|
T_FieldSelect,
|
|
T_FieldStore,
|
|
T_RelabelType,
|
|
T_ConvertRowtypeExpr,
|
|
T_CaseExpr,
|
|
T_CaseWhen,
|
|
T_CaseTestExpr,
|
|
T_ArrayExpr,
|
|
T_RowExpr,
|
|
T_RowCompareExpr,
|
|
T_CoalesceExpr,
|
|
T_MinMaxExpr,
|
|
T_NullIfExpr,
|
|
T_NullTest,
|
|
T_BooleanTest,
|
|
T_CoerceToDomain,
|
|
T_CoerceToDomainValue,
|
|
T_SetToDefault,
|
|
T_TargetEntry,
|
|
T_RangeTblRef,
|
|
T_JoinExpr,
|
|
T_FromExpr,
|
|
|
|
/*
|
|
* TAGS FOR EXPRESSION STATE NODES (execnodes.h)
|
|
*
|
|
* These correspond (not always one-for-one) to primitive nodes derived
|
|
* from Expr.
|
|
*/
|
|
T_ExprState = 400,
|
|
T_GenericExprState,
|
|
T_AggrefExprState,
|
|
T_ArrayRefExprState,
|
|
T_FuncExprState,
|
|
T_ScalarArrayOpExprState,
|
|
T_BoolExprState,
|
|
T_SubPlanState,
|
|
T_FieldSelectState,
|
|
T_FieldStoreState,
|
|
T_ConvertRowtypeExprState,
|
|
T_CaseExprState,
|
|
T_CaseWhenState,
|
|
T_ArrayExprState,
|
|
T_RowExprState,
|
|
T_RowCompareExprState,
|
|
T_CoalesceExprState,
|
|
T_MinMaxExprState,
|
|
T_CoerceToDomainState,
|
|
T_DomainConstraintState,
|
|
|
|
/*
|
|
* TAGS FOR PLANNER NODES (relation.h)
|
|
*/
|
|
T_PlannerInfo = 500,
|
|
T_RelOptInfo,
|
|
T_IndexOptInfo,
|
|
T_Path,
|
|
T_IndexPath,
|
|
T_BitmapHeapPath,
|
|
T_BitmapAndPath,
|
|
T_BitmapOrPath,
|
|
T_NestPath,
|
|
T_MergePath,
|
|
T_HashPath,
|
|
T_TidPath,
|
|
T_AppendPath,
|
|
T_ResultPath,
|
|
T_MaterialPath,
|
|
T_UniquePath,
|
|
T_PathKeyItem,
|
|
T_RestrictInfo,
|
|
T_InnerIndexscanInfo,
|
|
T_OuterJoinInfo,
|
|
T_InClauseInfo,
|
|
T_AppendRelInfo,
|
|
|
|
/*
|
|
* TAGS FOR MEMORY NODES (memnodes.h)
|
|
*/
|
|
T_MemoryContext = 600,
|
|
T_AllocSetContext,
|
|
|
|
/*
|
|
* TAGS FOR VALUE NODES (value.h)
|
|
*/
|
|
T_Value = 650,
|
|
T_Integer,
|
|
T_Float,
|
|
T_String,
|
|
T_BitString,
|
|
T_Null,
|
|
|
|
/*
|
|
* TAGS FOR LIST NODES (pg_list.h)
|
|
*/
|
|
T_List,
|
|
T_IntList,
|
|
T_OidList,
|
|
|
|
/*
|
|
* TAGS FOR PARSE TREE NODES (parsenodes.h)
|
|
*/
|
|
T_Query = 700,
|
|
T_InsertStmt,
|
|
T_DeleteStmt,
|
|
T_UpdateStmt,
|
|
T_SelectStmt,
|
|
T_AlterTableStmt,
|
|
T_AlterTableCmd,
|
|
T_AlterDomainStmt,
|
|
T_SetOperationStmt,
|
|
T_GrantStmt,
|
|
T_GrantRoleStmt,
|
|
T_ClosePortalStmt,
|
|
T_ClusterStmt,
|
|
T_CopyStmt,
|
|
T_CreateStmt,
|
|
T_DefineStmt,
|
|
T_DropStmt,
|
|
T_TruncateStmt,
|
|
T_CommentStmt,
|
|
T_FetchStmt,
|
|
T_IndexStmt,
|
|
T_CreateFunctionStmt,
|
|
T_AlterFunctionStmt,
|
|
T_RemoveAggrStmt,
|
|
T_RemoveFuncStmt,
|
|
T_RemoveOperStmt,
|
|
T_RenameStmt,
|
|
T_RuleStmt,
|
|
T_NotifyStmt,
|
|
T_ListenStmt,
|
|
T_UnlistenStmt,
|
|
T_TransactionStmt,
|
|
T_ViewStmt,
|
|
T_LoadStmt,
|
|
T_CreateDomainStmt,
|
|
T_CreatedbStmt,
|
|
T_DropdbStmt,
|
|
T_VacuumStmt,
|
|
T_ExplainStmt,
|
|
T_CreateSeqStmt,
|
|
T_AlterSeqStmt,
|
|
T_VariableSetStmt,
|
|
T_VariableShowStmt,
|
|
T_VariableResetStmt,
|
|
T_CreateTrigStmt,
|
|
T_DropPropertyStmt,
|
|
T_CreatePLangStmt,
|
|
T_DropPLangStmt,
|
|
T_CreateRoleStmt,
|
|
T_AlterRoleStmt,
|
|
T_DropRoleStmt,
|
|
T_LockStmt,
|
|
T_ConstraintsSetStmt,
|
|
T_ReindexStmt,
|
|
T_CheckPointStmt,
|
|
T_CreateSchemaStmt,
|
|
T_AlterDatabaseStmt,
|
|
T_AlterDatabaseSetStmt,
|
|
T_AlterRoleSetStmt,
|
|
T_CreateConversionStmt,
|
|
T_CreateCastStmt,
|
|
T_DropCastStmt,
|
|
T_CreateOpClassStmt,
|
|
T_RemoveOpClassStmt,
|
|
T_PrepareStmt,
|
|
T_ExecuteStmt,
|
|
T_DeallocateStmt,
|
|
T_DeclareCursorStmt,
|
|
T_CreateTableSpaceStmt,
|
|
T_DropTableSpaceStmt,
|
|
T_AlterObjectSchemaStmt,
|
|
T_AlterOwnerStmt,
|
|
T_DropOwnedStmt,
|
|
T_ReassignOwnedStmt,
|
|
|
|
T_A_Expr = 800,
|
|
T_ColumnRef,
|
|
T_ParamRef,
|
|
T_A_Const,
|
|
T_FuncCall,
|
|
T_A_Indices,
|
|
T_A_Indirection,
|
|
T_ResTarget,
|
|
T_TypeCast,
|
|
T_SortBy,
|
|
T_RangeSubselect,
|
|
T_RangeFunction,
|
|
T_TypeName,
|
|
T_ColumnDef,
|
|
T_IndexElem,
|
|
T_Constraint,
|
|
T_DefElem,
|
|
T_RangeTblEntry,
|
|
T_SortClause,
|
|
T_GroupClause,
|
|
T_FkConstraint,
|
|
T_PrivGrantee,
|
|
T_FuncWithArgs,
|
|
T_PrivTarget,
|
|
T_CreateOpClassItem,
|
|
T_CompositeTypeStmt,
|
|
T_InhRelation,
|
|
T_FunctionParameter,
|
|
T_LockingClause,
|
|
|
|
/*
|
|
* TAGS FOR RANDOM OTHER STUFF
|
|
*
|
|
* These are objects that aren't part of parse/plan/execute node tree
|
|
* structures, but we give them NodeTags anyway for identification
|
|
* purposes (usually because they are involved in APIs where we want to
|
|
* pass multiple object types through the same pointer).
|
|
*/
|
|
T_TriggerData = 900, /* in commands/trigger.h */
|
|
T_ReturnSetInfo, /* in nodes/execnodes.h */
|
|
T_TIDBitmap /* in nodes/tidbitmap.h */
|
|
} NodeTag;
|
|
|
|
/*
|
|
* The first field of a node of any type is guaranteed 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.
|
|
*/
|
|
typedef struct Node
|
|
{
|
|
NodeTag type;
|
|
} Node;
|
|
|
|
#define nodeTag(nodeptr) (((Node*)(nodeptr))->type)
|
|
|
|
/*
|
|
* newNode -
|
|
* create a new node of the specified size and tag the node with the
|
|
* specified tag.
|
|
*
|
|
* !WARNING!: Avoid using newNode directly. You should be using the
|
|
* macro makeNode. eg. to create a Query node, use makeNode(Query)
|
|
*
|
|
* There is no way to dereference the palloc'ed pointer to assign the
|
|
* tag, and also return the pointer itself, so we need a holder variable.
|
|
* Fortunately, this macro isn't recursive so we just define
|
|
* a global variable for this purpose.
|
|
*/
|
|
extern DLLIMPORT Node *newNodeMacroHolder;
|
|
|
|
#define newNode(size, tag) \
|
|
( \
|
|
AssertMacro((size) >= sizeof(Node)), /* need the tag, at least */ \
|
|
newNodeMacroHolder = (Node *) palloc0fast(size), \
|
|
newNodeMacroHolder->type = (tag), \
|
|
newNodeMacroHolder \
|
|
)
|
|
|
|
|
|
#define makeNode(_type_) ((_type_ *) newNode(sizeof(_type_),T_##_type_))
|
|
#define NodeSetTag(nodeptr,t) (((Node*)(nodeptr))->type = (t))
|
|
|
|
#define IsA(nodeptr,_type_) (nodeTag(nodeptr) == T_##_type_)
|
|
|
|
/* ----------------------------------------------------------------
|
|
* extern declarations follow
|
|
* ----------------------------------------------------------------
|
|
*/
|
|
|
|
/*
|
|
* nodes/{outfuncs.c,print.c}
|
|
*/
|
|
extern char *nodeToString(void *obj);
|
|
|
|
/*
|
|
* nodes/{readfuncs.c,read.c}
|
|
*/
|
|
extern void *stringToNode(char *str);
|
|
|
|
/*
|
|
* nodes/copyfuncs.c
|
|
*/
|
|
extern void *copyObject(void *obj);
|
|
|
|
/*
|
|
* nodes/equalfuncs.c
|
|
*/
|
|
extern bool equal(void *a, void *b);
|
|
|
|
|
|
/*
|
|
* Typedefs for identifying qualifier selectivities and plan costs as such.
|
|
* These are just plain "double"s, but declaring a variable as Selectivity
|
|
* or Cost makes the intent more obvious.
|
|
*
|
|
* These could have gone into plannodes.h or some such, but many files
|
|
* depend on them...
|
|
*/
|
|
typedef double Selectivity; /* fraction of tuples a qualifier will pass */
|
|
typedef double Cost; /* execution cost (in page-access units) */
|
|
|
|
|
|
/*
|
|
* CmdType -
|
|
* enums for type of operation represented by a Query
|
|
*
|
|
* ??? could have put this in parsenodes.h but many files not in the
|
|
* optimizer also need this...
|
|
*/
|
|
typedef enum CmdType
|
|
{
|
|
CMD_UNKNOWN,
|
|
CMD_SELECT, /* select stmt */
|
|
CMD_UPDATE, /* update stmt */
|
|
CMD_INSERT, /* insert stmt */
|
|
CMD_DELETE,
|
|
CMD_UTILITY, /* cmds like create, destroy, copy, vacuum,
|
|
* etc. */
|
|
CMD_NOTHING /* dummy command for instead nothing rules
|
|
* with qual */
|
|
} CmdType;
|
|
|
|
|
|
/*
|
|
* JoinType -
|
|
* enums for types of relation joins
|
|
*
|
|
* JoinType determines the exact semantics of joining two relations using
|
|
* a matching qualification. For example, it tells what to do with a tuple
|
|
* that has no match in the other relation.
|
|
*
|
|
* This is needed in both parsenodes.h and plannodes.h, so put it here...
|
|
*/
|
|
typedef enum JoinType
|
|
{
|
|
/*
|
|
* The canonical kinds of joins
|
|
*/
|
|
JOIN_INNER, /* matching tuple pairs only */
|
|
JOIN_LEFT, /* pairs + unmatched outer tuples */
|
|
JOIN_FULL, /* pairs + unmatched outer + unmatched inner */
|
|
JOIN_RIGHT, /* pairs + unmatched inner tuples */
|
|
|
|
/*
|
|
* These are used for queries like WHERE foo IN (SELECT bar FROM ...).
|
|
* Only JOIN_IN is actually implemented in the executor; the others are
|
|
* defined for internal use in the planner.
|
|
*/
|
|
JOIN_IN, /* at most one result per outer row */
|
|
JOIN_REVERSE_IN, /* at most one result per inner row */
|
|
JOIN_UNIQUE_OUTER, /* outer path must be made unique */
|
|
JOIN_UNIQUE_INNER /* inner path must be made unique */
|
|
|
|
/*
|
|
* We might need additional join types someday.
|
|
*/
|
|
} JoinType;
|
|
|
|
#define IS_OUTER_JOIN(jointype) \
|
|
((jointype) == JOIN_LEFT || \
|
|
(jointype) == JOIN_FULL || \
|
|
(jointype) == JOIN_RIGHT)
|
|
|
|
#endif /* NODES_H */
|