stack.h: Remove.

	* stack.h: Remove.

cp/
	* Make-lang.in (cp/decl.o, cp/search.o): Don't depend on stack.h.
	* search.c: Don't include it.

From-SVN: r90724

diff --git a/gcc/ChangeLog b/gcc/ChangeLog
index e7f37450d4ec3501d05ce844077de09adf0064b4..006fd8024026a6814249504672e401c31622c56a 100644 (file)
--- a/gcc/ChangeLog
+++ b/gcc/ChangeLog
@@ -1,3 +1,7 @@
+2004-11-16  Steven Bosscher  <stevenb@suse.de>
+
+       * stack.h: Remove.
+
 2004-11-16  Steven Bosscher  <stevenb@suse.de>
 
        * config/i386/i386.c (x86_schedule): Fix typo, m_K6 intead of m_K8.

diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index f6252236b66c3bd69d26766066f0c27bf31c7005..a538e5e14f2d8b4f3502d5c924772986b584e527 100644 (file)
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -1,3 +1,8 @@
+2004-11-16  Steven Bosscher  <stevenb@suse.de>
+
+       * Make-lang.in (cp/decl.o, cp/search.o): Don't depend on stack.h.
+       * search.c: Don't include it.
+
 2004-11-15  Andrew Pinski  <pinskia@physics.uc.edu>
 
        * cp-gimplify.c: Include pointer-set.h

diff --git a/gcc/cp/Make-lang.in b/gcc/cp/Make-lang.in
index 641a34e87dd4680349047b801521233539cb8c80..245f4063962e645f9d245a0354564d3ced746b83 100644 (file)
--- a/gcc/cp/Make-lang.in
+++ b/gcc/cp/Make-lang.in
@@ -227,7 +227,7 @@ cp/lex.o: cp/lex.c $(CXX_TREE_H) $(TM_H) flags.h \
 cp/cp-lang.o: cp/cp-lang.c $(CXX_TREE_H) $(TM_H) toplev.h debug.h langhooks.h \
   $(LANGHOOKS_DEF_H) c-common.h gtype-cp.h $(CXX_PRETTY_PRINT_H) $(DIAGNOSTIC_H) \
   cp/cp-objcp-common.h
-cp/decl.o: cp/decl.c $(CXX_TREE_H) $(TM_H) flags.h cp/decl.h stack.h \
+cp/decl.o: cp/decl.c $(CXX_TREE_H) $(TM_H) flags.h cp/decl.h \
   output.h $(EXPR_H) except.h toplev.h $(HASHTAB_H) $(RTL_H) \
   cp/operators.def $(TM_P_H) tree-inline.h diagnostic.h c-pragma.h \
   debug.h gt-cp-decl.h timevar.h $(TREE_FLOW_H)
@@ -250,7 +250,7 @@ cp/init.o: cp/init.c $(CXX_TREE_H) $(TM_H) flags.h $(RTL_H) $(EXPR_H) toplev.h \
 cp/method.o: cp/method.c $(CXX_TREE_H) $(TM_H) toplev.h $(RTL_H) $(EXPR_H) \
   $(TM_P_H) $(TARGET_H) gt-cp-method.h
 cp/cvt.o: cp/cvt.c $(CXX_TREE_H) $(TM_H) cp/decl.h flags.h toplev.h convert.h
-cp/search.o: cp/search.c $(CXX_TREE_H) $(TM_H) stack.h flags.h toplev.h $(RTL_H)
+cp/search.o: cp/search.c $(CXX_TREE_H) $(TM_H) flags.h toplev.h $(RTL_H)
 cp/tree.o: cp/tree.c $(CXX_TREE_H) $(TM_H) flags.h toplev.h $(RTL_H) \
   insn-config.h integrate.h tree-inline.h real.h gt-cp-tree.h $(TARGET_H)
 cp/ptree.o: cp/ptree.c $(CXX_TREE_H) $(TM_H)

diff --git a/gcc/cp/search.c b/gcc/cp/search.c
index a95bde3e095c234a1cf2aaf3656e11f1cd473c39..cedf1da6d2b72a5b6ed27fcd2313540851d45093 100644 (file)
--- a/gcc/cp/search.c
+++ b/gcc/cp/search.c
@@ -34,7 +34,6 @@ Boston, MA 02111-1307, USA.  */
 #include "rtl.h"
 #include "output.h"
 #include "toplev.h"
-#include "stack.h"
 
 static int is_subobject_of_p (tree, tree);
 static tree dfs_lookup_base (tree, void *);

diff --git a/gcc/stack.h b/gcc/stack.h
deleted file mode 100644 (file)
index 1216103..0000000
--- a/gcc/stack.h
+++ /dev/null
@@ -1,42 +0,0 @@
-/* stack.h - structed access to object stacks
-   Copyright (C) 1988, 2000, 2003 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, 59 Temple Place - Suite 330,
-Boston, MA 02111-1307, 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 obstack *, char *, int);
-struct stack_level *pop_stack_level (struct stack_level *);