diff options
| author | Mark Mitchell <mmitchel@gcc.gnu.org> | 1999-09-09 06:17:13 +0000 |
|---|---|---|
| committer | Mark Mitchell <mmitchel@gcc.gnu.org> | 1999-09-09 06:17:13 +0000 |
| commit | e1b3e07d15a82f07afc3ebd6ecf4ee0334a90d65 (patch) | |
| tree | 5953ca2b981b4fba376c0372f43a13e5ce7fa27d /gcc/cp/decl2.c | |
| parent | fc009f966c98317401b51127f59de4ad37bb7d19 (diff) | |
| download | gcc-e1b3e07d15a82f07afc3ebd6ecf4ee0334a90d65.zip gcc-e1b3e07d15a82f07afc3ebd6ecf4ee0334a90d65.tar.gz gcc-e1b3e07d15a82f07afc3ebd6ecf4ee0334a90d65.tar.bz2 | |
cp-tree.h (scratch_tree_cons): Remove.
* cp-tree.h (scratch_tree_cons): Remove.
* call.c: Replace all uses of expr_tree_cons, saveable_tree_cons,
and perm_tree_cons with plain tree_cons.
* class.c: Likewise.
* decl.c: Likewise.
* decl2.c: Likewise.
* except.c: Likewise.
* expr.c: Likewise.
* init.c: Likewise.
* lex.c: Likewise.
* method.c: Likewise.
* parse.y: Likewise.
* pt.c: Likewise.
* repo.c: Likewise.
* rtti.c: Likewise.
* search.c: Likewise.
* typeck.c: Likewise.
* parse.c: Regenerated.
* tree.c (build_srcloc): Simplify.
From-SVN: r29225
Diffstat (limited to 'gcc/cp/decl2.c')
| -rw-r--r-- | gcc/cp/decl2.c | 18 |
1 files changed, 9 insertions, 9 deletions
diff --git a/gcc/cp/decl2.c b/gcc/cp/decl2.c index 6ca93f9..332fca5 100644 --- a/gcc/cp/decl2.c +++ b/gcc/cp/decl2.c @@ -2151,7 +2151,7 @@ build_anon_union_vars (anon_decl, elems, static_p, external_p) /* If there's a cleanup to do, it belongs in the TREE_PURPOSE of the following TREE_LIST. */ - *elems = scratch_tree_cons (NULL_TREE, decl, *elems); + *elems = tree_cons (NULL_TREE, decl, *elems); TREE_TYPE (*elems) = type; } @@ -2952,8 +2952,8 @@ start_static_storage_duration_function () /* Create the parameters. */ parm_types = void_list_node; - parm_types = perm_tree_cons (NULL_TREE, integer_type_node, parm_types); - parm_types = perm_tree_cons (NULL_TREE, integer_type_node, parm_types); + parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types); + parm_types = tree_cons (NULL_TREE, integer_type_node, parm_types); type = build_function_type (void_type_node, parm_types); /* Create the FUNCTION_DECL itself. */ @@ -3986,7 +3986,7 @@ build_expr_from_tree (t) chain = TREE_CHAIN (t); if (chain && chain != void_type_node) chain = build_expr_from_tree (chain); - return expr_tree_cons (purpose, value, chain); + return tree_cons (purpose, value, chain); } case COMPONENT_REF: @@ -4185,14 +4185,14 @@ add_using_namespace (user, used, indirect) /* Add used to the user's using list. */ DECL_NAMESPACE_USING (user) - = perm_tree_cons (used, namespace_ancestor (user, used), - DECL_NAMESPACE_USING (user)); + = tree_cons (used, namespace_ancestor (user, used), + DECL_NAMESPACE_USING (user)); TREE_INDIRECT_USING (DECL_NAMESPACE_USING (user)) = indirect; /* Add user to the used's users list. */ DECL_NAMESPACE_USERS (used) - = perm_tree_cons (user, 0, DECL_NAMESPACE_USERS (used)); + = tree_cons (user, 0, DECL_NAMESPACE_USERS (used)); /* Recursively add all namespaces used. */ for (t = DECL_NAMESPACE_USING (used); t; t = TREE_CHAIN (t)) @@ -4335,8 +4335,8 @@ lookup_using_namespace (name, val, usings, scope, flags, spacesp) if (TREE_VALUE (iter) == scope) { if (spacesp) - *spacesp = scratch_tree_cons (TREE_PURPOSE (iter), NULL_TREE, - *spacesp); + *spacesp = tree_cons (TREE_PURPOSE (iter), NULL_TREE, + *spacesp); val1 = binding_for_name (name, TREE_PURPOSE (iter)); /* Resolve ambiguities. */ val = ambiguous_decl (name, val, val1, flags); |