cgraph.h (constant_pool_htab): New function.
* cgraph.h (constant_pool_htab): New function. (constant_descriptor_tree): Move from varasm.c. * varasm.c (constant_pool_htab): New function. (constant_descriptor_tree): Move to cgraph.h. From-SVN: r149834
This commit is contained in:
parent
9c8e65c30f
commit
d48e9ceac9
@ -1,3 +1,10 @@
|
||||
2009-07-20 Olatunji Ruwase <tjruwase@google.com>
|
||||
|
||||
* cgraph.h (constant_pool_htab): New function.
|
||||
(constant_descriptor_tree): Move from varasm.c.
|
||||
* varasm.c (constant_pool_htab): New function.
|
||||
(constant_descriptor_tree): Move to cgraph.h.
|
||||
|
||||
2009-07-20 Olatunji Ruwase <tjruwase@google.com>
|
||||
|
||||
* toplev.c: Invoke FINISH_UNIT callbacks before call to
|
||||
|
19
gcc/cgraph.h
19
gcc/cgraph.h
@ -606,5 +606,24 @@ cgraph_node_set_size (cgraph_node_set set)
|
||||
return htab_elements (set->hashtab);
|
||||
}
|
||||
|
||||
/* Uniquize all constants that appear in memory.
|
||||
Each constant in memory thus far output is recorded
|
||||
in `const_desc_table'. */
|
||||
|
||||
struct GTY(()) constant_descriptor_tree {
|
||||
/* A MEM for the constant. */
|
||||
rtx rtl;
|
||||
|
||||
/* The value of the constant. */
|
||||
tree value;
|
||||
|
||||
/* Hash of value. Computing the hash from value each time
|
||||
hashfn is called can't work properly, as that means recursive
|
||||
use of the hash table during hash table expansion. */
|
||||
hashval_t hash;
|
||||
};
|
||||
|
||||
/* Constant pool accessor function. */
|
||||
htab_t constant_pool_htab (void);
|
||||
|
||||
#endif /* GCC_CGRAPH_H */
|
||||
|
24
gcc/varasm.c
24
gcc/varasm.c
@ -2782,22 +2782,6 @@ decode_addr_const (tree exp, struct addr_const *value)
|
||||
value->offset = offset;
|
||||
}
|
||||
|
||||
/* Uniquize all constants that appear in memory.
|
||||
Each constant in memory thus far output is recorded
|
||||
in `const_desc_table'. */
|
||||
|
||||
struct GTY(()) constant_descriptor_tree {
|
||||
/* A MEM for the constant. */
|
||||
rtx rtl;
|
||||
|
||||
/* The value of the constant. */
|
||||
tree value;
|
||||
|
||||
/* Hash of value. Computing the hash from value each time
|
||||
hashfn is called can't work properly, as that means recursive
|
||||
use of the hash table during hash table expansion. */
|
||||
hashval_t hash;
|
||||
};
|
||||
|
||||
static GTY((param_is (struct constant_descriptor_tree)))
|
||||
htab_t const_desc_htab;
|
||||
@ -2805,6 +2789,14 @@ static GTY((param_is (struct constant_descriptor_tree)))
|
||||
static struct constant_descriptor_tree * build_constant_desc (tree);
|
||||
static void maybe_output_constant_def_contents (struct constant_descriptor_tree *, int);
|
||||
|
||||
/* Constant pool accessor function. */
|
||||
|
||||
htab_t
|
||||
constant_pool_htab (void)
|
||||
{
|
||||
return const_desc_htab;
|
||||
}
|
||||
|
||||
/* Compute a hash code for a constant expression. */
|
||||
|
||||
static hashval_t
|
||||
|
Loading…
Reference in New Issue
Block a user