| OLD | NEW | 
|---|
| 1 // Copyright 2012 the V8 project authors. All rights reserved. | 1 // Copyright 2012 the V8 project authors. All rights reserved. | 
| 2 // Use of this source code is governed by a BSD-style license that can be | 2 // Use of this source code is governed by a BSD-style license that can be | 
| 3 // found in the LICENSE file. | 3 // found in the LICENSE file. | 
| 4 // | 4 // | 
| 5 // Review notes: | 5 // Review notes: | 
| 6 // | 6 // | 
| 7 // - The use of macros in these inline functions may seem superfluous | 7 // - The use of macros in these inline functions may seem superfluous | 
| 8 // but it is absolutely needed to make sure gcc generates optimal | 8 // but it is absolutely needed to make sure gcc generates optimal | 
| 9 // code. gcc is not happy when attempting to inline too deep. | 9 // code. gcc is not happy when attempting to inline too deep. | 
| 10 // | 10 // | 
| (...skipping 6557 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 6568   return key; | 6568   return key; | 
| 6569 } | 6569 } | 
| 6570 | 6570 | 
| 6571 | 6571 | 
| 6572 Handle<ObjectHashTable> ObjectHashTable::Shrink( | 6572 Handle<ObjectHashTable> ObjectHashTable::Shrink( | 
| 6573     Handle<ObjectHashTable> table, Handle<Object> key) { | 6573     Handle<ObjectHashTable> table, Handle<Object> key) { | 
| 6574   return DerivedHashTable::Shrink(table, key); | 6574   return DerivedHashTable::Shrink(table, key); | 
| 6575 } | 6575 } | 
| 6576 | 6576 | 
| 6577 | 6577 | 
|  | 6578 template<class Derived, class Iterator, int entrysize> | 
|  | 6579 Handle<Derived> OrderedHashTable<Derived, Iterator, entrysize>::Remove( | 
|  | 6580     Handle<Derived> table, Handle<Object> key) { | 
|  | 6581   bool was_present; | 
|  | 6582   return Remove(table, key, &was_present); | 
|  | 6583 } | 
|  | 6584 | 
|  | 6585 | 
| 6578 template <int entrysize> | 6586 template <int entrysize> | 
| 6579 bool WeakHashTableShape<entrysize>::IsMatch(Handle<Object> key, Object* other) { | 6587 bool WeakHashTableShape<entrysize>::IsMatch(Handle<Object> key, Object* other) { | 
| 6580   return key->SameValue(other); | 6588   return key->SameValue(other); | 
| 6581 } | 6589 } | 
| 6582 | 6590 | 
| 6583 | 6591 | 
| 6584 template <int entrysize> | 6592 template <int entrysize> | 
| 6585 uint32_t WeakHashTableShape<entrysize>::Hash(Handle<Object> key) { | 6593 uint32_t WeakHashTableShape<entrysize>::Hash(Handle<Object> key) { | 
| 6586   intptr_t hash = reinterpret_cast<intptr_t>(*key); | 6594   intptr_t hash = reinterpret_cast<intptr_t>(*key); | 
| 6587   return (uint32_t)(hash & 0xFFFFFFFF); | 6595   return (uint32_t)(hash & 0xFFFFFFFF); | 
| (...skipping 281 matching lines...) Expand 10 before | Expand all | Expand 10 after  Loading... | 
| 6869 #undef READ_SHORT_FIELD | 6877 #undef READ_SHORT_FIELD | 
| 6870 #undef WRITE_SHORT_FIELD | 6878 #undef WRITE_SHORT_FIELD | 
| 6871 #undef READ_BYTE_FIELD | 6879 #undef READ_BYTE_FIELD | 
| 6872 #undef WRITE_BYTE_FIELD | 6880 #undef WRITE_BYTE_FIELD | 
| 6873 #undef NOBARRIER_READ_BYTE_FIELD | 6881 #undef NOBARRIER_READ_BYTE_FIELD | 
| 6874 #undef NOBARRIER_WRITE_BYTE_FIELD | 6882 #undef NOBARRIER_WRITE_BYTE_FIELD | 
| 6875 | 6883 | 
| 6876 } }  // namespace v8::internal | 6884 } }  // namespace v8::internal | 
| 6877 | 6885 | 
| 6878 #endif  // V8_OBJECTS_INL_H_ | 6886 #endif  // V8_OBJECTS_INL_H_ | 
| OLD | NEW | 
|---|