aboutsummaryrefslogtreecommitdiff
path: root/gcc/tree.c
diff options
context:
space:
mode:
authorPaolo Bonzini <bonzini@gnu.org>2007-02-06 13:55:01 +0000
committerPaolo Bonzini <bonzini@gcc.gnu.org>2007-02-06 13:55:01 +0000
commit0802f6a2f718f63c240b0f77c319cd94fc9595c9 (patch)
treea09637fe7757ea3fcdd7c1febda3075bf7765788 /gcc/tree.c
parent427e84f7fea0383ba4bc6f77a014085364896bd3 (diff)
downloadgcc-0802f6a2f718f63c240b0f77c319cd94fc9595c9.zip
gcc-0802f6a2f718f63c240b0f77c319cd94fc9595c9.tar.gz
gcc-0802f6a2f718f63c240b0f77c319cd94fc9595c9.tar.bz2
tree.c (tree_int_map_hash, [...]): Remove prototypes and make them non-static.
gcc: 2007-02-06 Paolo Bonzini <bonzini@gnu.org> * tree.c (tree_int_map_hash, tree_int_map_eq, tree_int_map_marked_p): Remove prototypes and make them non-static. (struct tree_int_map): Remove. * tree.h (struct tree_int_map): Move here, turning TO into an unsigned int. (tree_int_map_hash, tree_int_map_eq, tree_int_map_marked_p): Declare. * tree.h (TREE_COMPLEXITY): Remove. (struct tree_exp): Remove complexity field. * tree.c (build1_stat): Don't set it. gcc/ada: 2007-02-06 Paolo Bonzini <bonzini@gnu.org> * Make-lang.in (ada/decl.o): Add gt-ada-decl.h dependency. * decl.c: Include gt-ada-decl.h. (annotate_value_cache): New. (annotate_value): Use it instead of TREE_COMPLEXITY. From-SVN: r121647
Diffstat (limited to 'gcc/tree.c')
-rw-r--r--gcc/tree.c15
1 files changed, 3 insertions, 12 deletions
diff --git a/gcc/tree.c b/gcc/tree.c
index 6824c14..ae20c251 100644
--- a/gcc/tree.c
+++ b/gcc/tree.c
@@ -150,14 +150,6 @@ static GTY ((if_marked ("tree_int_map_marked_p"), param_is (struct tree_int_map)
static GTY ((if_marked ("tree_map_marked_p"), param_is (struct tree_map)))
htab_t restrict_base_for_decl;
-struct tree_int_map GTY(())
-{
- tree from;
- unsigned short to;
-};
-static unsigned int tree_int_map_hash (const void *);
-static int tree_int_map_eq (const void *, const void *);
-static int tree_int_map_marked_p (const void *);
static void set_type_quals (tree, int);
static int type_hash_eq (const void *, const void *);
static hashval_t type_hash_hash (const void *);
@@ -2931,7 +2923,6 @@ build1_stat (enum tree_code code, tree type, tree node MEM_STAT_DECL)
#else
SET_EXPR_LOCUS (t, NULL);
#endif
- TREE_COMPLEXITY (t) = 0;
TREE_OPERAND (t, 0) = node;
TREE_BLOCK (t) = NULL_TREE;
if (node && !TYPE_P (node))
@@ -4184,7 +4175,7 @@ tree_map_marked_p (const void *p)
/* Return true if the trees in the tree_int_map *'s VA and VB are equal. */
-static int
+int
tree_int_map_eq (const void *va, const void *vb)
{
const struct tree_int_map *a = va, *b = vb;
@@ -4193,7 +4184,7 @@ tree_int_map_eq (const void *va, const void *vb)
/* Hash a from tree in the tree_int_map * ITEM. */
-static unsigned int
+unsigned int
tree_int_map_hash (const void *item)
{
return htab_hash_pointer (((const struct tree_int_map *)item)->from);
@@ -4203,7 +4194,7 @@ tree_int_map_hash (const void *item)
purposes. We simply return true if the from tree_int_map *P's from tree is marked, so that this
structure goes away when the from tree goes away. */
-static int
+int
tree_int_map_marked_p (const void *p)
{
tree from = ((struct tree_int_map *) p)->from;