blob: 8f3401d7ca556070a40d6814050e781dde2c700d (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
|
/* Stack of data placed on obstacks. */
struct stack_level
{
/* Pointer back to previous such level. */
struct stack_level *prev;
/* Point to obstack we should return to. */
struct obstack *obstack;
/* First place we start putting data. */
tree *first;
/* Number of entries we can have from `first'.
Right now we are dumb: if we overflow, abort. */
int limit;
};
struct stack_level *push_stack_level ();
struct stack_level *pop_stack_level ();
|