* lto-symtab.c (lto_symtab_entry_hash): Use IDENTIFIER_HASH_VALUE.
* optabs.c (libfunc_decl_hash): Likewise.
* varasm.c (emutls_decl): Likewise.
fortran/
* trans-decl.c (module_htab_decls_hash): Use IDENTIFIER_HASH_VALUE.
git-svn-id: svn+ssh://gcc.gnu.org/svn/gcc/trunk@159455
138bc75d-0d04-0410-961f-
82ee72b054a4
+2010-05-16 Richard Guenther <rguenther@suse.de>
+
+ * lto-symtab.c (lto_symtab_entry_hash): Use IDENTIFIER_HASH_VALUE.
+ * optabs.c (libfunc_decl_hash): Likewise.
+ * varasm.c (emutls_decl): Likewise.
+
2010-05-16 Steven Bosscher <steven@gcc.gnu.org>
* c-decl.c: Don't include gimple.h.
2010-05-16 Steven Bosscher <steven@gcc.gnu.org>
* c-decl.c: Don't include gimple.h.
+2010-05-16 Richard Guenther <rguenther@suse.de>
+
+ * trans-decl.c (module_htab_decls_hash): Use IDENTIFIER_HASH_VALUE.
+
2010-05-16 Manuel López-Ibáñez <manu@gcc.gnu.org>
* options.c (set_Wall): Remove special logic for Wuninitialized
2010-05-16 Manuel López-Ibáñez <manu@gcc.gnu.org>
* options.c (set_Wall): Remove special logic for Wuninitialized
const_tree n = DECL_NAME (t);
if (n == NULL_TREE)
n = TYPE_NAME (TREE_TYPE (t));
const_tree n = DECL_NAME (t);
if (n == NULL_TREE)
n = TYPE_NAME (TREE_TYPE (t));
- return htab_hash_string (IDENTIFIER_POINTER (n));
+ return IDENTIFIER_HASH_VALUE (n);
{
const struct lto_symtab_entry_def *base =
(const struct lto_symtab_entry_def *) p;
{
const struct lto_symtab_entry_def *base =
(const struct lto_symtab_entry_def *) p;
- return htab_hash_string (IDENTIFIER_POINTER (base->id));
+ return IDENTIFIER_HASH_VALUE (base->id);
}
/* Return non-zero if P1 and P2 points to lto_symtab_entry_def structs
}
/* Return non-zero if P1 and P2 points to lto_symtab_entry_def structs
static hashval_t
libfunc_decl_hash (const void *entry)
{
static hashval_t
libfunc_decl_hash (const void *entry)
{
- return htab_hash_string (IDENTIFIER_POINTER (DECL_NAME ((const_tree) entry)));
+ return IDENTIFIER_HASH_VALUE (DECL_NAME ((const_tree) entry));
/* Note that we use the hash of the decl's name, rather than a hash
of the decl's pointer. In emutls_finish we iterate through the
hash table, and we want this traversal to be predictable. */
/* Note that we use the hash of the decl's name, rather than a hash
of the decl's pointer. In emutls_finish we iterate through the
hash table, and we want this traversal to be predictable. */
- in.hash = htab_hash_string (IDENTIFIER_POINTER (name));
+ in.hash = IDENTIFIER_HASH_VALUE (name);
in.base.from = decl;
loc = htab_find_slot_with_hash (emutls_htab, &in, in.hash, INSERT);
h = (struct tree_map *) *loc;
in.base.from = decl;
loc = htab_find_slot_with_hash (emutls_htab, &in, in.hash, INSERT);
h = (struct tree_map *) *loc;