blob: a3fc0249093088e4ccf7f73a31f8896f69eb0827 [file] [log] [blame]
/* Traits for hashing trees.
Copyright (C) 2014-2019 Free Software Foundation, Inc.
This file is part of GCC.
GCC is free software; you can redistribute it and/or modify it under
the terms of the GNU General Public License as published by the Free
Software Foundation; either version 3, or (at your option) any later
version.
GCC is distributed in the hope that it will be useful, but WITHOUT ANY
WARRANTY; without even the implied warranty of MERCHANTABILITY or
FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License
for more details.
You should have received a copy of the GNU General Public License
along with GCC; see the file COPYING3. If not see
<http://www.gnu.org/licenses/>. */
#ifndef tree_hash_traits_h
#define tree_hash_traits_h
/* Hash for trees based on operand_equal_p. */
struct tree_operand_hash : ggc_ptr_hash <tree_node>
{
static inline hashval_t hash (const value_type &);
static inline bool equal (const value_type &,
const compare_type &);
};
inline hashval_t
tree_operand_hash::hash (const value_type &t)
{
return iterative_hash_expr (t, 0);
}
inline bool
tree_operand_hash::equal (const value_type &t1,
const compare_type &t2)
{
return operand_equal_p (t1, t2, 0);
}
/* Hasher for tree decls. Pointer equality is enough here, but the DECL_UID
is a better hash than the pointer value and gives a predictable traversal
order. */
struct tree_decl_hash : ggc_ptr_hash <tree_node>
{
static inline hashval_t hash (tree);
};
inline hashval_t
tree_decl_hash::hash (tree t)
{
return DECL_UID (t);
}
/* Hash for SSA_NAMEs in the same function. Pointer equality is enough
here, but the SSA_NAME_VERSION is a better hash than the pointer
value and gives a predictable traversal order. */
struct tree_ssa_name_hash : ggc_ptr_hash <tree_node>
{
static inline hashval_t hash (tree);
};
inline hashval_t
tree_ssa_name_hash::hash (tree t)
{
return SSA_NAME_VERSION (t);
}
/* Hasher for general trees, based on their TREE_HASH. */
struct tree_hash : ggc_ptr_hash <tree_node>
{
static hashval_t hash (tree);
};
inline hashval_t
tree_hash::hash (tree t)
{
return TREE_HASH (t);
}
#endif