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 5968 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
5979 | 5979 |
5980 | 5980 |
5981 void JSProxy::InitializeBody(int object_size, Object* value) { | 5981 void JSProxy::InitializeBody(int object_size, Object* value) { |
5982 ASSERT(!value->IsHeapObject() || !GetHeap()->InNewSpace(value)); | 5982 ASSERT(!value->IsHeapObject() || !GetHeap()->InNewSpace(value)); |
5983 for (int offset = kHeaderSize; offset < object_size; offset += kPointerSize) { | 5983 for (int offset = kHeaderSize; offset < object_size; offset += kPointerSize) { |
5984 WRITE_FIELD(this, offset, value); | 5984 WRITE_FIELD(this, offset, value); |
5985 } | 5985 } |
5986 } | 5986 } |
5987 | 5987 |
5988 | 5988 |
5989 ACCESSORS(JSSet, table, Object, kTableOffset) | 5989 ACCESSORS(JSCollection, table, Object, kTableOffset) |
5990 ACCESSORS(JSMap, table, Object, kTableOffset) | |
5991 | 5990 |
5992 | 5991 |
5993 #define ORDERED_HASH_TABLE_ITERATOR_ACCESSORS(name, type, offset) \ | 5992 #define ORDERED_HASH_TABLE_ITERATOR_ACCESSORS(name, type, offset) \ |
5994 template<class Derived, class TableType> \ | 5993 template<class Derived, class TableType> \ |
5995 type* OrderedHashTableIterator<Derived, TableType>::name() const { \ | 5994 type* OrderedHashTableIterator<Derived, TableType>::name() const { \ |
5996 return type::cast(READ_FIELD(this, offset)); \ | 5995 return type::cast(READ_FIELD(this, offset)); \ |
5997 } \ | 5996 } \ |
5998 template<class Derived, class TableType> \ | 5997 template<class Derived, class TableType> \ |
5999 void OrderedHashTableIterator<Derived, TableType>::set_##name( \ | 5998 void OrderedHashTableIterator<Derived, TableType>::set_##name( \ |
6000 type* value, WriteBarrierMode mode) { \ | 5999 type* value, WriteBarrierMode mode) { \ |
(...skipping 1140 matching lines...) Expand 10 before | Expand all | Expand 10 after Loading... |
7141 #undef READ_SHORT_FIELD | 7140 #undef READ_SHORT_FIELD |
7142 #undef WRITE_SHORT_FIELD | 7141 #undef WRITE_SHORT_FIELD |
7143 #undef READ_BYTE_FIELD | 7142 #undef READ_BYTE_FIELD |
7144 #undef WRITE_BYTE_FIELD | 7143 #undef WRITE_BYTE_FIELD |
7145 #undef NOBARRIER_READ_BYTE_FIELD | 7144 #undef NOBARRIER_READ_BYTE_FIELD |
7146 #undef NOBARRIER_WRITE_BYTE_FIELD | 7145 #undef NOBARRIER_WRITE_BYTE_FIELD |
7147 | 7146 |
7148 } } // namespace v8::internal | 7147 } } // namespace v8::internal |
7149 | 7148 |
7150 #endif // V8_OBJECTS_INL_H_ | 7149 #endif // V8_OBJECTS_INL_H_ |
OLD | NEW |