| // Copyright 2012 the V8 project authors. All rights reserved. |
| // Use of this source code is governed by a BSD-style license that can be |
| // found in the LICENSE file. |
| |
| #ifndef V8_TRANSITIONS_INL_H_ |
| #define V8_TRANSITIONS_INL_H_ |
| |
| #include "src/transitions.h" |
| |
| #include "src/ic/handler-configuration-inl.h" |
| #include "src/objects/fixed-array-inl.h" |
| #include "src/objects/maybe-object-inl.h" |
| |
| // Has to be the last include (doesn't have include guards): |
| #include "src/objects/object-macros.h" |
| |
| namespace v8 { |
| namespace internal { |
| |
| TransitionArray* TransitionsAccessor::transitions() { |
| DCHECK_EQ(kFullTransitionArray, encoding()); |
| return TransitionArray::cast(raw_transitions_->ToStrongHeapObject()); |
| } |
| |
| CAST_ACCESSOR(TransitionArray) |
| |
| bool TransitionArray::HasPrototypeTransitions() { |
| return Get(kPrototypeTransitionsIndex) != MaybeObject::FromSmi(Smi::kZero); |
| } |
| |
| WeakFixedArray* TransitionArray::GetPrototypeTransitions() { |
| DCHECK(HasPrototypeTransitions()); // Callers must check first. |
| Object* prototype_transitions = |
| Get(kPrototypeTransitionsIndex)->ToStrongHeapObject(); |
| return WeakFixedArray::cast(prototype_transitions); |
| } |
| |
| HeapObjectReference** TransitionArray::GetKeySlot(int transition_number) { |
| DCHECK(transition_number < number_of_transitions()); |
| return reinterpret_cast<HeapObjectReference**>( |
| RawFieldOfElementAt(ToKeyIndex(transition_number))); |
| } |
| |
| void TransitionArray::SetPrototypeTransitions(WeakFixedArray* transitions) { |
| DCHECK(transitions->IsWeakFixedArray()); |
| WeakFixedArray::Set(kPrototypeTransitionsIndex, |
| HeapObjectReference::Strong(transitions)); |
| } |
| |
| int TransitionArray::NumberOfPrototypeTransitions( |
| WeakFixedArray* proto_transitions) { |
| if (proto_transitions->length() == 0) return 0; |
| MaybeObject* raw = |
| proto_transitions->Get(kProtoTransitionNumberOfEntriesOffset); |
| return Smi::ToInt(raw->ToSmi()); |
| } |
| |
| Name* TransitionArray::GetKey(int transition_number) { |
| DCHECK(transition_number < number_of_transitions()); |
| return Name::cast(Get(ToKeyIndex(transition_number))->ToStrongHeapObject()); |
| } |
| |
| Name* TransitionsAccessor::GetKey(int transition_number) { |
| switch (encoding()) { |
| case kPrototypeInfo: |
| case kUninitialized: |
| UNREACHABLE(); |
| return nullptr; |
| case kWeakRef: { |
| Map* map = Map::cast(raw_transitions_->ToWeakHeapObject()); |
| return GetSimpleTransitionKey(map); |
| } |
| case kFullTransitionArray: |
| return transitions()->GetKey(transition_number); |
| } |
| UNREACHABLE(); |
| } |
| |
| void TransitionArray::SetKey(int transition_number, Name* key) { |
| DCHECK(transition_number < number_of_transitions()); |
| WeakFixedArray::Set(ToKeyIndex(transition_number), |
| HeapObjectReference::Strong(key)); |
| } |
| |
| HeapObjectReference** TransitionArray::GetTargetSlot(int transition_number) { |
| DCHECK(transition_number < number_of_transitions()); |
| return reinterpret_cast<HeapObjectReference**>( |
| RawFieldOfElementAt(ToTargetIndex(transition_number))); |
| } |
| |
| // static |
| PropertyDetails TransitionsAccessor::GetTargetDetails(Isolate* isolate, |
| Name* name, Map* target) { |
| DCHECK(!IsSpecialTransition(isolate, name)); |
| int descriptor = target->LastAdded(); |
| DescriptorArray* descriptors = target->instance_descriptors(); |
| // Transitions are allowed only for the last added property. |
| DCHECK(descriptors->GetKey(descriptor)->Equals(name)); |
| return descriptors->GetDetails(descriptor); |
| } |
| |
| // static |
| Map* TransitionsAccessor::GetTargetFromRaw(MaybeObject* raw) { |
| return Map::cast(raw->ToWeakHeapObject()); |
| } |
| |
| MaybeObject* TransitionArray::GetRawTarget(int transition_number) { |
| DCHECK(transition_number < number_of_transitions()); |
| return Get(ToTargetIndex(transition_number)); |
| } |
| |
| Map* TransitionArray::GetTarget(int transition_number) { |
| MaybeObject* raw = GetRawTarget(transition_number); |
| return TransitionsAccessor::GetTargetFromRaw(raw); |
| } |
| |
| Map* TransitionsAccessor::GetTarget(int transition_number) { |
| switch (encoding()) { |
| case kPrototypeInfo: |
| case kUninitialized: |
| UNREACHABLE(); |
| return nullptr; |
| case kWeakRef: |
| return Map::cast(raw_transitions_->ToWeakHeapObject()); |
| case kFullTransitionArray: |
| return transitions()->GetTarget(transition_number); |
| } |
| UNREACHABLE(); |
| } |
| |
| void TransitionArray::SetRawTarget(int transition_number, MaybeObject* value) { |
| DCHECK(transition_number < number_of_transitions()); |
| DCHECK(value->IsWeakHeapObject() && value->ToWeakHeapObject()->IsMap()); |
| WeakFixedArray::Set(ToTargetIndex(transition_number), value); |
| } |
| |
| bool TransitionArray::GetTargetIfExists(int transition_number, Isolate* isolate, |
| Map** target) { |
| MaybeObject* raw = GetRawTarget(transition_number); |
| HeapObject* heap_object; |
| if (raw->ToStrongHeapObject(&heap_object) && |
| heap_object->IsUndefined(isolate)) { |
| return false; |
| } |
| *target = TransitionsAccessor::GetTargetFromRaw(raw); |
| return true; |
| } |
| |
| int TransitionArray::SearchName(Name* name, int* out_insertion_index) { |
| DCHECK(name->IsUniqueName()); |
| return internal::Search<ALL_ENTRIES>(this, name, number_of_entries(), |
| out_insertion_index); |
| } |
| |
| int TransitionArray::number_of_transitions() const { |
| if (length() < kFirstIndex) return 0; |
| return Smi::ToInt(Get(kTransitionLengthIndex)->ToSmi()); |
| } |
| |
| int TransitionArray::CompareKeys(Name* key1, uint32_t hash1, PropertyKind kind1, |
| PropertyAttributes attributes1, Name* key2, |
| uint32_t hash2, PropertyKind kind2, |
| PropertyAttributes attributes2) { |
| int cmp = CompareNames(key1, hash1, key2, hash2); |
| if (cmp != 0) return cmp; |
| |
| return CompareDetails(kind1, attributes1, kind2, attributes2); |
| } |
| |
| int TransitionArray::CompareNames(Name* key1, uint32_t hash1, Name* key2, |
| uint32_t hash2) { |
| if (key1 != key2) { |
| // In case of hash collisions key1 is always "less" than key2. |
| return hash1 <= hash2 ? -1 : 1; |
| } |
| |
| return 0; |
| } |
| |
| int TransitionArray::CompareDetails(PropertyKind kind1, |
| PropertyAttributes attributes1, |
| PropertyKind kind2, |
| PropertyAttributes attributes2) { |
| if (kind1 != kind2) { |
| return static_cast<int>(kind1) < static_cast<int>(kind2) ? -1 : 1; |
| } |
| |
| if (attributes1 != attributes2) { |
| return static_cast<int>(attributes1) < static_cast<int>(attributes2) ? -1 |
| : 1; |
| } |
| |
| return 0; |
| } |
| |
| void TransitionArray::Set(int transition_number, Name* key, |
| MaybeObject* target) { |
| WeakFixedArray::Set(ToKeyIndex(transition_number), |
| MaybeObject::FromObject(key)); |
| WeakFixedArray::Set(ToTargetIndex(transition_number), target); |
| } |
| |
| int TransitionArray::Capacity() { |
| if (length() <= kFirstIndex) return 0; |
| return (length() - kFirstIndex) / kEntrySize; |
| } |
| |
| void TransitionArray::SetNumberOfTransitions(int number_of_transitions) { |
| DCHECK(number_of_transitions <= Capacity()); |
| WeakFixedArray::Set( |
| kTransitionLengthIndex, |
| MaybeObject::FromSmi(Smi::FromInt(number_of_transitions))); |
| } |
| |
| } // namespace internal |
| } // namespace v8 |
| |
| #include "src/objects/object-macros-undef.h" |
| |
| #endif // V8_TRANSITIONS_INL_H_ |