aboutsummaryrefslogtreecommitdiff
path: root/gcc
diff options
context:
space:
mode:
authorKazu Hirata <kazu@cs.umass.edu>2005-01-17 08:13:09 +0000
committerKazu Hirata <kazu@gcc.gnu.org>2005-01-17 08:13:09 +0000
commitfbf53020b5a62deb6f105aaca0b62906b8fe49ea (patch)
treef3bbea103c06b971c651934d5f96ea6f2e852243 /gcc
parent2e6da5d7da73a62dec7c48d008bd2d4045546aa0 (diff)
downloadgcc-fbf53020b5a62deb6f105aaca0b62906b8fe49ea.zip
gcc-fbf53020b5a62deb6f105aaca0b62906b8fe49ea.tar.gz
gcc-fbf53020b5a62deb6f105aaca0b62906b8fe49ea.tar.bz2
tree.c (hash_chainon): Remove.
* tree.c (hash_chainon): Remove. * cp-tree.h: Remove the corresponding prototypes. From-SVN: r93757
Diffstat (limited to 'gcc')
-rw-r--r--gcc/cp/ChangeLog3
-rw-r--r--gcc/cp/cp-tree.h1
-rw-r--r--gcc/cp/tree.c15
3 files changed, 3 insertions, 16 deletions
diff --git a/gcc/cp/ChangeLog b/gcc/cp/ChangeLog
index 0f7f6b4..56974b6 100644
--- a/gcc/cp/ChangeLog
+++ b/gcc/cp/ChangeLog
@@ -9,6 +9,9 @@
* pt.c (tinst_for_decl): Remove.
* cp-tree.h: Remove the corresponding prototypes.
+ * tree.c (hash_chainon): Remove.
+ * cp-tree.h: Remove the corresponding prototypes.
+
2005-01-15 Jakub Jelinek <jakub@redhat.com>
PR c++/19263
diff --git a/gcc/cp/cp-tree.h b/gcc/cp/cp-tree.h
index 5f091db..ffb76d5 100644
--- a/gcc/cp/cp-tree.h
+++ b/gcc/cp/cp-tree.h
@@ -4242,7 +4242,6 @@ extern tree build_cplus_staticfn_type (tree, tree, tree);
extern tree build_cplus_array_type (tree, tree);
extern tree hash_tree_cons (tree, tree, tree);
extern tree hash_tree_chain (tree, tree);
-extern tree hash_chainon (tree, tree);
extern int count_functions (tree);
extern int is_overloaded_fn (tree);
extern tree get_first_fn (tree);
diff --git a/gcc/cp/tree.c b/gcc/cp/tree.c
index b9a7a25..2b6c96e 100644
--- a/gcc/cp/tree.c
+++ b/gcc/cp/tree.c
@@ -736,21 +736,6 @@ hash_tree_chain (tree value, tree chain)
{
return hash_tree_cons (NULL_TREE, value, chain);
}
-
-/* Similar, but used for concatenating two lists. */
-
-tree
-hash_chainon (tree list1, tree list2)
-{
- if (list2 == 0)
- return list1;
- if (list1 == 0)
- return list2;
- if (TREE_CHAIN (list1) == NULL_TREE)
- return hash_tree_chain (TREE_VALUE (list1), list2);
- return hash_tree_chain (TREE_VALUE (list1),
- hash_chainon (TREE_CHAIN (list1), list2));
-}
void
debug_binfo (tree elem)