summaryrefslogtreecommitdiff
path: root/gcc/stack.h
diff options
context:
space:
mode:
authormycroft <mycroft@138bc75d-0d04-0410-961f-82ee72b054a4>1991-05-31 20:45:39 +0000
committermycroft <mycroft@138bc75d-0d04-0410-961f-82ee72b054a4>1991-05-31 20:45:39 +0000
commitbed4d7330952fc8812d9cdc96dba4fd7735c6eb7 (patch)
tree8a7cecd45159aafc71596bc4583e726d35282318 /gcc/stack.h
parent34af06d14eedc1220bfb44a3a49eb71d1cd7655c (diff)
downloadgcc-bed4d7330952fc8812d9cdc96dba4fd7735c6eb7.tar.gz
entered into RCS
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@27 138bc75d-0d04-0410-961f-82ee72b054a4
Diffstat (limited to 'gcc/stack.h')
-rw-r--r--gcc/stack.h41
1 files changed, 41 insertions, 0 deletions
diff --git a/gcc/stack.h b/gcc/stack.h
new file mode 100644
index 00000000000..ac241541a44
--- /dev/null
+++ b/gcc/stack.h
@@ -0,0 +1,41 @@
+/* stack.h - structed access to object stacks
+ Copyright (C) 1988 Free Software Foundation, Inc.
+ Contributed by Michael Tiemann (tiemann@cygnus.com).
+
+This program is free software; you can redistribute it and/or modify it
+under the terms of the GNU General Public License as published by the
+Free Software Foundation; either version 2, or (at your option) any
+later version.
+
+This program is distributed in the hope that it will be useful,
+but WITHOUT ANY WARRANTY; without even the implied warranty of
+MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+GNU General Public License for more details.
+
+You should have received a copy of the GNU General Public License
+along with this program; if not, write to the Free Software
+Foundation, 675 Mass Ave, Cambridge, MA 02139, USA. */
+
+/* Summary: this file contains additional structures that layer
+ on top of obstacks for GNU C++. */
+
+/* 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 ();