mirror of
https://github.com/postgres/postgres.git
synced 2025-07-02 09:02:37 +03:00
Rip out QueryTreeList structure, root and branch. Querytree
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.
This commit is contained in:
@ -5,7 +5,7 @@
|
||||
*
|
||||
* Copyright (c) 1994, Regents of the University of California
|
||||
*
|
||||
* $Id: parse_node.h,v 1.11 1998/09/01 04:37:35 momjian Exp $
|
||||
* $Id: parse_node.h,v 1.12 1999/05/13 07:29:19 tgl Exp $
|
||||
*
|
||||
*-------------------------------------------------------------------------
|
||||
*/
|
||||
@ -19,12 +19,6 @@
|
||||
#include <parser/parse_type.h>
|
||||
#include <utils/rel.h>
|
||||
|
||||
typedef struct QueryTreeList
|
||||
{
|
||||
int len; /* number of queries */
|
||||
Query **qtrees;
|
||||
} QueryTreeList;
|
||||
|
||||
/* state information used during parse analysis */
|
||||
typedef struct ParseState
|
||||
{
|
||||
|
Reference in New Issue
Block a user