From 0ef08bc588a22e4a98adfc92dd63e753ebc27d3d Mon Sep 17 00:00:00 2001 From: Richard Sandiford Date: Thu, 25 Jun 2015 17:16:59 +0000 Subject: [PATCH] hash-map-traits.h (unbounded_hashmap_traits): New class. gcc/ * hash-map-traits.h (unbounded_hashmap_traits): New class. (unbounded_int_hashmap_traits): Likewise. * cfgexpand.c (part_traits): Use unbounded_int_hashmap_traits. From-SVN: r224975 --- gcc/ChangeLog | 6 ++++ gcc/cfgexpand.c | 20 +---------- gcc/hash-map-traits.h | 80 +++++++++++++++++++++++++++++++++++++++++++ 3 files changed, 87 insertions(+), 19 deletions(-) diff --git a/gcc/ChangeLog b/gcc/ChangeLog index 68b7b027b47..70f14f66ff9 100644 --- a/gcc/ChangeLog +++ b/gcc/ChangeLog @@ -1,3 +1,9 @@ +2015-06-25 Richard Sandiford + + * hash-map-traits.h (unbounded_hashmap_traits): New class. + (unbounded_int_hashmap_traits): Likewise. + * cfgexpand.c (part_traits): Use unbounded_int_hashmap_traits. + 2015-06-25 Richard Sandiford * ipa-icf.h (symbol_compare_hash): New class. diff --git a/gcc/cfgexpand.c b/gcc/cfgexpand.c index 6b79b1dae77..a2b9977ebb1 100644 --- a/gcc/cfgexpand.c +++ b/gcc/cfgexpand.c @@ -610,25 +610,7 @@ stack_var_cmp (const void *a, const void *b) return 0; } -struct part_traits : default_hashmap_traits -{ - template - static bool - is_deleted (T &e) - { return e.m_value == reinterpret_cast (1); } - - template static bool is_empty (T &e) { return e.m_value == NULL; } - template - static void - mark_deleted (T &e) - { e.m_value = reinterpret_cast (1); } - - template - static void - mark_empty (T &e) - { e.m_value = NULL; } -}; - +struct part_traits : unbounded_int_hashmap_traits {}; typedef hash_map part_hashmap; /* If the points-to solution *PI points to variables that are in a partition diff --git a/gcc/hash-map-traits.h b/gcc/hash-map-traits.h index 669a6379702..9cab0ec66c7 100644 --- a/gcc/hash-map-traits.h +++ b/gcc/hash-map-traits.h @@ -174,4 +174,84 @@ simple_hashmap_traits ::mark_deleted (T &entry) H::mark_deleted (entry.m_key); } +/* Implement traits for a hash_map with values of type Value for cases + in which the key cannot represent empty and deleted slots. Instead + record empty and deleted entries in Value. Derived classes must + implement the hash and equal_keys functions. */ + +template +struct unbounded_hashmap_traits +{ + template static inline void remove (T &); + template static inline bool is_empty (const T &); + template static inline bool is_deleted (const T &); + template static inline void mark_empty (T &); + template static inline void mark_deleted (T &); +}; + +template +template +inline void +unbounded_hashmap_traits ::remove (T &entry) +{ + default_hash_traits ::remove (entry.m_value); +} + +template +template +inline bool +unbounded_hashmap_traits ::is_empty (const T &entry) +{ + return default_hash_traits ::is_empty (entry.m_value); +} + +template +template +inline bool +unbounded_hashmap_traits ::is_deleted (const T &entry) +{ + return default_hash_traits ::is_deleted (entry.m_value); +} + +template +template +inline void +unbounded_hashmap_traits ::mark_empty (T &entry) +{ + default_hash_traits ::mark_empty (entry.m_value); +} + +template +template +inline void +unbounded_hashmap_traits ::mark_deleted (T &entry) +{ + default_hash_traits ::mark_deleted (entry.m_value); +} + +/* Implement traits for a hash_map from integer type Key to Value in + cases where Key has no spare values for recording empty and deleted + slots. */ + +template +struct unbounded_int_hashmap_traits : unbounded_hashmap_traits +{ + static inline hashval_t hash (Key); + static inline bool equal_keys (Key, Key); +}; + +template +inline hashval_t +unbounded_int_hashmap_traits ::hash (Key k) +{ + return k; +} + +template +inline bool +unbounded_int_hashmap_traits ::equal_keys (Key k1, Key k2) +{ + return k1 == k2; +} + #endif // HASH_MAP_TRAITS_H -- 2.30.2