Commit e4e01495 by Trevor Saunders Committed by Trevor Saunders

playcate old gcc

gcc/

	PR bootstrap/61679
	 * hash-table.h: use hash_table::value_type instead of
       	Descriptor::value_type in the return types of several methods.

From-SVN: r212384
parent 558d2559
2014-07-08 Trevor Saunders <tsaunders@mozilla.com> 2014-07-08 Trevor Saunders <tsaunders@mozilla.com>
PR bootstrap/61679
* hash-table.h: use hash_table::value_type instead of
Descriptor::value_type in the return types of several methods.
2014-07-08 Trevor Saunders <tsaunders@mozilla.com>
* tree-pass.h (pass_data): Remove has_execute member. * tree-pass.h (pass_data): Remove has_execute member.
* passes.c (execute_one_pass): Don't check pass->has_execute. * passes.c (execute_one_pass): Don't check pass->has_execute.
* asan.c, auto-inc-dec.c, bb-reorder.c, bt-load.c, cfgcleanup.c, * asan.c, auto-inc-dec.c, bb-reorder.c, bt-load.c, cfgcleanup.c,
......
...@@ -663,7 +663,7 @@ hash_table<Descriptor, Allocator, false>::~hash_table () ...@@ -663,7 +663,7 @@ hash_table<Descriptor, Allocator, false>::~hash_table ()
HASH is the hash value for the element to be inserted. */ HASH is the hash value for the element to be inserted. */
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
typename Descriptor::value_type ** typename hash_table<Descriptor, Allocator, false>::value_type **
hash_table<Descriptor, Allocator, false> hash_table<Descriptor, Allocator, false>
::find_empty_slot_for_expand (hashval_t hash) ::find_empty_slot_for_expand (hashval_t hash)
{ {
...@@ -803,7 +803,7 @@ hash_table<Descriptor, Allocator, false>::clear_slot (value_type **slot) ...@@ -803,7 +803,7 @@ hash_table<Descriptor, Allocator, false>::clear_slot (value_type **slot)
be used to insert or delete an element. */ be used to insert or delete an element. */
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
typename Descriptor::value_type * typename hash_table<Descriptor, Allocator, false>::value_type *
hash_table<Descriptor, Allocator, false> hash_table<Descriptor, Allocator, false>
::find_with_hash (const compare_type *comparable, hashval_t hash) ::find_with_hash (const compare_type *comparable, hashval_t hash)
{ {
...@@ -841,7 +841,7 @@ hash_table<Descriptor, Allocator, false> ...@@ -841,7 +841,7 @@ hash_table<Descriptor, Allocator, false>
entry, NULL may be returned if memory allocation fails. */ entry, NULL may be returned if memory allocation fails. */
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
typename Descriptor::value_type ** typename hash_table<Descriptor, Allocator, false>::value_type **
hash_table<Descriptor, Allocator, false> hash_table<Descriptor, Allocator, false>
::find_slot_with_hash (const compare_type *comparable, hashval_t hash, ::find_slot_with_hash (const compare_type *comparable, hashval_t hash,
enum insert_option insert) enum insert_option insert)
...@@ -922,7 +922,9 @@ hash_table<Descriptor, Allocator, false> ...@@ -922,7 +922,9 @@ hash_table<Descriptor, Allocator, false>
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
template<typename Argument, template<typename Argument,
int (*Callback) (typename Descriptor::value_type **slot, Argument argument)> int (*Callback) (typename hash_table<Descriptor, Allocator,
false>::value_type **slot,
Argument argument)>
void void
hash_table<Descriptor, Allocator, false>::traverse_noresize (Argument argument) hash_table<Descriptor, Allocator, false>::traverse_noresize (Argument argument)
{ {
...@@ -946,7 +948,8 @@ hash_table<Descriptor, Allocator, false>::traverse_noresize (Argument argument) ...@@ -946,7 +948,8 @@ hash_table<Descriptor, Allocator, false>::traverse_noresize (Argument argument)
template <typename Descriptor, template <typename Descriptor,
template <typename Type> class Allocator> template <typename Type> class Allocator>
template <typename Argument, template <typename Argument,
int (*Callback) (typename Descriptor::value_type **slot, int (*Callback) (typename hash_table<Descriptor, Allocator,
false>::value_type **slot,
Argument argument)> Argument argument)>
void void
hash_table<Descriptor, Allocator, false>::traverse (Argument argument) hash_table<Descriptor, Allocator, false>::traverse (Argument argument)
...@@ -1181,7 +1184,7 @@ hash_table<Descriptor, Allocator, true>::~hash_table () ...@@ -1181,7 +1184,7 @@ hash_table<Descriptor, Allocator, true>::~hash_table ()
HASH is the hash value for the element to be inserted. */ HASH is the hash value for the element to be inserted. */
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
typename Descriptor::value_type * typename hash_table<Descriptor, Allocator, true>::value_type *
hash_table<Descriptor, Allocator, true> hash_table<Descriptor, Allocator, true>
::find_empty_slot_for_expand (hashval_t hash) ::find_empty_slot_for_expand (hashval_t hash)
{ {
...@@ -1321,7 +1324,7 @@ hash_table<Descriptor, Allocator, true>::clear_slot (value_type *slot) ...@@ -1321,7 +1324,7 @@ hash_table<Descriptor, Allocator, true>::clear_slot (value_type *slot)
be used to insert or delete an element. */ be used to insert or delete an element. */
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
typename Descriptor::value_type & typename hash_table<Descriptor, Allocator, true>::value_type &
hash_table<Descriptor, Allocator, true> hash_table<Descriptor, Allocator, true>
::find_with_hash (const compare_type &comparable, hashval_t hash) ::find_with_hash (const compare_type &comparable, hashval_t hash)
{ {
...@@ -1358,7 +1361,7 @@ hash_table<Descriptor, Allocator, true> ...@@ -1358,7 +1361,7 @@ hash_table<Descriptor, Allocator, true>
entry, NULL may be returned if memory allocation fails. */ entry, NULL may be returned if memory allocation fails. */
template<typename Descriptor, template<typename Type> class Allocator> template<typename Descriptor, template<typename Type> class Allocator>
typename Descriptor::value_type * typename hash_table<Descriptor, Allocator, true>::value_type *
hash_table<Descriptor, Allocator, true> hash_table<Descriptor, Allocator, true>
::find_slot_with_hash (const compare_type &comparable, hashval_t hash, ::find_slot_with_hash (const compare_type &comparable, hashval_t hash,
enum insert_option insert) enum insert_option insert)
...@@ -1440,7 +1443,8 @@ hash_table<Descriptor, Allocator, true> ...@@ -1440,7 +1443,8 @@ hash_table<Descriptor, Allocator, true>
template<typename Descriptor, template<typename Descriptor,
template<typename Type> class Allocator> template<typename Type> class Allocator>
template<typename Argument, template<typename Argument,
int (*Callback) (typename Descriptor::value_type *slot, int (*Callback) (typename hash_table<Descriptor, Allocator,
true>::value_type *slot,
Argument argument)> Argument argument)>
void void
hash_table<Descriptor, Allocator, true>::traverse_noresize (Argument argument) hash_table<Descriptor, Allocator, true>::traverse_noresize (Argument argument)
...@@ -1465,7 +1469,8 @@ hash_table<Descriptor, Allocator, true>::traverse_noresize (Argument argument) ...@@ -1465,7 +1469,8 @@ hash_table<Descriptor, Allocator, true>::traverse_noresize (Argument argument)
template <typename Descriptor, template <typename Descriptor,
template <typename Type> class Allocator> template <typename Type> class Allocator>
template <typename Argument, template <typename Argument,
int (*Callback) (typename Descriptor::value_type *slot, int (*Callback) (typename hash_table<Descriptor, Allocator,
true>::value_type *slot,
Argument argument)> Argument argument)>
void void
hash_table<Descriptor, Allocator, true>::traverse (Argument argument) hash_table<Descriptor, Allocator, true>::traverse (Argument argument)
......
Markdown is supported
0% or
You are about to add 0 people to the discussion. Proceed with caution.
Finish editing this message first!
Please register or to comment