mirror of
https://git.postgresql.org/git/postgresql.git
synced 2026-02-16 19:37:00 +08:00
507a0a2ab0
lists are now plain old garden-variety Lists, allocated with palloc, rather than specialized expansible-array data allocated with malloc. This substantially simplifies their handling and eliminates several sources of memory leakage. Several basic types of erroneous queries (syntax error, attempt to insert a duplicate key into a unique index) now demonstrably leak zero bytes per query.
52 lines
1.4 KiB
C
52 lines
1.4 KiB
C
/*-------------------------------------------------------------------------
|
|
*
|
|
* parse_node.h
|
|
*
|
|
*
|
|
* Copyright (c) 1994, Regents of the University of California
|
|
*
|
|
* $Id: parse_node.h,v 1.12 1999/05/13 07:29:19 tgl Exp $
|
|
*
|
|
*-------------------------------------------------------------------------
|
|
*/
|
|
#ifndef PARSE_NODE_H
|
|
#define PARSE_NODE_H
|
|
|
|
#include <nodes/nodes.h>
|
|
#include <nodes/pg_list.h>
|
|
#include <nodes/primnodes.h>
|
|
#include <nodes/parsenodes.h>
|
|
#include <parser/parse_type.h>
|
|
#include <utils/rel.h>
|
|
|
|
/* state information used during parse analysis */
|
|
typedef struct ParseState
|
|
{
|
|
int p_last_resno;
|
|
List *p_rtable;
|
|
List *p_insert_columns;
|
|
struct ParseState *parentParseState;
|
|
bool p_hasAggs;
|
|
bool p_hasSubLinks;
|
|
bool p_is_insert;
|
|
bool p_is_update;
|
|
bool p_is_rule;
|
|
bool p_in_where_clause;
|
|
Relation p_target_relation;
|
|
RangeTblEntry *p_target_rangetblentry;
|
|
} ParseState;
|
|
|
|
extern ParseState *make_parsestate(ParseState *parentParseState);
|
|
extern Expr *make_op(char *opname, Node *ltree, Node *rtree);
|
|
extern Var *make_var(ParseState *pstate, Oid relid, char *refname,
|
|
char *attrname);
|
|
extern ArrayRef *make_array_ref(Node *expr,
|
|
List *indirection);
|
|
extern ArrayRef *make_array_set(Expr *target_expr,
|
|
List *upperIndexpr,
|
|
List *lowerIndexpr,
|
|
Expr *expr);
|
|
extern Const *make_const(Value *value);
|
|
|
|
#endif /* PARSE_NODE_H */
|