%PDF- %PDF-
Direktori : /home/vacivi36/vittasync.vacivitta.com.br/vittasync/node/deps/v8/src/objects/ |
Current File : /home/vacivi36/vittasync.vacivitta.com.br/vittasync/node/deps/v8/src/objects/feedback-vector.cc |
// Copyright 2014 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. #include "src/objects/feedback-vector.h" #include "src/base/optional.h" #include "src/common/globals.h" #include "src/deoptimizer/deoptimizer.h" #include "src/diagnostics/code-tracer.h" #include "src/heap/heap-inl.h" #include "src/heap/local-factory-inl.h" #include "src/ic/handler-configuration-inl.h" #include "src/ic/ic-inl.h" #include "src/objects/data-handler-inl.h" #include "src/objects/feedback-vector-inl.h" #include "src/objects/hash-table-inl.h" #include "src/objects/map-inl.h" #include "src/objects/object-macros.h" #include "src/objects/objects.h" namespace v8 { namespace internal { FeedbackSlot FeedbackVectorSpec::AddSlot(FeedbackSlotKind kind) { int slot = slot_count(); int entries_per_slot = FeedbackMetadata::GetSlotSize(kind); append(kind); for (int i = 1; i < entries_per_slot; i++) { append(FeedbackSlotKind::kInvalid); } return FeedbackSlot(slot); } static bool IsPropertyNameFeedback(MaybeObject feedback) { Tagged<HeapObject> heap_object; if (!feedback.GetHeapObjectIfStrong(&heap_object)) return false; if (IsString(heap_object)) { DCHECK(IsInternalizedString(heap_object)); return true; } if (!IsSymbol(heap_object)) return false; Tagged<Symbol> symbol = Symbol::cast(heap_object); ReadOnlyRoots roots = symbol->GetReadOnlyRoots(); return symbol != roots.uninitialized_symbol() && symbol != roots.mega_dom_symbol() && symbol != roots.megamorphic_symbol(); } std::ostream& operator<<(std::ostream& os, FeedbackSlotKind kind) { return os << FeedbackMetadata::Kind2String(kind); } FeedbackSlotKind FeedbackMetadata::GetKind(FeedbackSlot slot) const { int index = VectorICComputer::index(0, slot.ToInt()); int data = get(index); return VectorICComputer::decode(data, slot.ToInt()); } void FeedbackMetadata::SetKind(FeedbackSlot slot, FeedbackSlotKind kind) { int index = VectorICComputer::index(0, slot.ToInt()); int data = get(index); int new_data = VectorICComputer::encode(data, slot.ToInt(), kind); set(index, new_data); } // static template <typename IsolateT> Handle<FeedbackMetadata> FeedbackMetadata::New(IsolateT* isolate, const FeedbackVectorSpec* spec) { auto* factory = isolate->factory(); const int slot_count = spec == nullptr ? 0 : spec->slot_count(); const int create_closure_slot_count = spec == nullptr ? 0 : spec->create_closure_slot_count(); if (slot_count == 0 && create_closure_slot_count == 0) { return factory->empty_feedback_metadata(); } #ifdef DEBUG for (int i = 0; i < slot_count;) { DCHECK(spec); FeedbackSlotKind kind = spec->GetKind(FeedbackSlot(i)); int entry_size = FeedbackMetadata::GetSlotSize(kind); for (int j = 1; j < entry_size; j++) { kind = spec->GetKind(FeedbackSlot(i + j)); DCHECK_EQ(FeedbackSlotKind::kInvalid, kind); } i += entry_size; } #endif Handle<FeedbackMetadata> metadata = factory->NewFeedbackMetadata(slot_count, create_closure_slot_count); // Initialize the slots. The raw data section has already been pre-zeroed in // NewFeedbackMetadata. for (int i = 0; i < slot_count; i++) { DCHECK(spec); FeedbackSlot slot(i); FeedbackSlotKind kind = spec->GetKind(slot); metadata->SetKind(slot, kind); } return metadata; } template Handle<FeedbackMetadata> FeedbackMetadata::New( Isolate* isolate, const FeedbackVectorSpec* spec); template Handle<FeedbackMetadata> FeedbackMetadata::New( LocalIsolate* isolate, const FeedbackVectorSpec* spec); bool FeedbackMetadata::SpecDiffersFrom( const FeedbackVectorSpec* other_spec) const { if (other_spec->slot_count() != slot_count()) { return true; } int slots = slot_count(); for (int i = 0; i < slots;) { FeedbackSlot slot(i); FeedbackSlotKind kind = GetKind(slot); int entry_size = FeedbackMetadata::GetSlotSize(kind); if (kind != other_spec->GetKind(slot)) { return true; } i += entry_size; } return false; } const char* FeedbackMetadata::Kind2String(FeedbackSlotKind kind) { switch (kind) { case FeedbackSlotKind::kInvalid: return "Invalid"; case FeedbackSlotKind::kCall: return "Call"; case FeedbackSlotKind::kLoadProperty: return "LoadProperty"; case FeedbackSlotKind::kLoadGlobalInsideTypeof: return "LoadGlobalInsideTypeof"; case FeedbackSlotKind::kLoadGlobalNotInsideTypeof: return "LoadGlobalNotInsideTypeof"; case FeedbackSlotKind::kLoadKeyed: return "LoadKeyed"; case FeedbackSlotKind::kHasKeyed: return "HasKeyed"; case FeedbackSlotKind::kSetNamedSloppy: return "SetNamedSloppy"; case FeedbackSlotKind::kSetNamedStrict: return "SetNamedStrict"; case FeedbackSlotKind::kDefineNamedOwn: return "DefineNamedOwn"; case FeedbackSlotKind::kDefineKeyedOwn: return "DefineKeyedOwn"; case FeedbackSlotKind::kStoreGlobalSloppy: return "StoreGlobalSloppy"; case FeedbackSlotKind::kStoreGlobalStrict: return "StoreGlobalStrict"; case FeedbackSlotKind::kSetKeyedSloppy: return "StoreKeyedSloppy"; case FeedbackSlotKind::kSetKeyedStrict: return "StoreKeyedStrict"; case FeedbackSlotKind::kStoreInArrayLiteral: return "StoreInArrayLiteral"; case FeedbackSlotKind::kBinaryOp: return "BinaryOp"; case FeedbackSlotKind::kCompareOp: return "CompareOp"; case FeedbackSlotKind::kDefineKeyedOwnPropertyInLiteral: return "DefineKeyedOwnPropertyInLiteral"; case FeedbackSlotKind::kLiteral: return "Literal"; case FeedbackSlotKind::kForIn: return "ForIn"; case FeedbackSlotKind::kInstanceOf: return "InstanceOf"; case FeedbackSlotKind::kCloneObject: return "CloneObject"; case FeedbackSlotKind::kJumpLoop: return "JumpLoop"; } } FeedbackSlotKind FeedbackVector::GetKind(FeedbackSlot slot) const { DCHECK(!is_empty()); return metadata()->GetKind(slot); } FeedbackSlotKind FeedbackVector::GetKind(FeedbackSlot slot, AcquireLoadTag tag) const { DCHECK(!is_empty()); return metadata(tag)->GetKind(slot); } // static Handle<ClosureFeedbackCellArray> ClosureFeedbackCellArray::New( Isolate* isolate, Handle<SharedFunctionInfo> shared) { Factory* factory = isolate->factory(); int num_feedback_cells = shared->feedback_metadata()->create_closure_slot_count(); Handle<ClosureFeedbackCellArray> feedback_cell_array = factory->NewClosureFeedbackCellArray(num_feedback_cells); for (int i = 0; i < num_feedback_cells; i++) { Handle<FeedbackCell> cell = factory->NewNoClosuresCell(factory->undefined_value()); feedback_cell_array->set(i, *cell); } return feedback_cell_array; } // static Handle<FeedbackVector> FeedbackVector::New( Isolate* isolate, Handle<SharedFunctionInfo> shared, Handle<ClosureFeedbackCellArray> closure_feedback_cell_array, Handle<FeedbackCell> parent_feedback_cell, IsCompiledScope* is_compiled_scope) { DCHECK(is_compiled_scope->is_compiled()); Factory* factory = isolate->factory(); Handle<FeedbackMetadata> feedback_metadata(shared->feedback_metadata(), isolate); const int slot_count = feedback_metadata->slot_count(); Handle<FeedbackVector> vector = factory->NewFeedbackVector( shared, closure_feedback_cell_array, parent_feedback_cell); DCHECK_EQ(vector->length(), slot_count); DCHECK_EQ(vector->shared_function_info(), *shared); DCHECK_EQ(vector->tiering_state(), TieringState::kNone); DCHECK(!vector->maybe_has_maglev_code()); DCHECK(!vector->maybe_has_turbofan_code()); DCHECK_EQ(vector->invocation_count(), 0); DCHECK(vector->maybe_optimized_code()->IsCleared()); // Ensure we can skip the write barrier Handle<Symbol> uninitialized_sentinel = UninitializedSentinel(isolate); DCHECK_EQ(ReadOnlyRoots(isolate).uninitialized_symbol(), *uninitialized_sentinel); for (int i = 0; i < slot_count;) { FeedbackSlot slot(i); FeedbackSlotKind kind = feedback_metadata->GetKind(slot); int entry_size = FeedbackMetadata::GetSlotSize(kind); MaybeObject extra_value = MaybeObject::FromObject(*uninitialized_sentinel); switch (kind) { case FeedbackSlotKind::kLoadGlobalInsideTypeof: case FeedbackSlotKind::kLoadGlobalNotInsideTypeof: case FeedbackSlotKind::kStoreGlobalSloppy: case FeedbackSlotKind::kStoreGlobalStrict: case FeedbackSlotKind::kJumpLoop: vector->Set(slot, HeapObjectReference::ClearedValue(isolate), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kForIn: case FeedbackSlotKind::kCompareOp: case FeedbackSlotKind::kBinaryOp: vector->Set(slot, Smi::zero(), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kLiteral: vector->Set(slot, Smi::zero(), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kCall: vector->Set(slot, *uninitialized_sentinel, SKIP_WRITE_BARRIER); extra_value = MaybeObject::FromObject(Smi::zero()); break; case FeedbackSlotKind::kCloneObject: case FeedbackSlotKind::kLoadProperty: case FeedbackSlotKind::kLoadKeyed: case FeedbackSlotKind::kHasKeyed: case FeedbackSlotKind::kSetNamedSloppy: case FeedbackSlotKind::kSetNamedStrict: case FeedbackSlotKind::kDefineNamedOwn: case FeedbackSlotKind::kDefineKeyedOwn: case FeedbackSlotKind::kSetKeyedSloppy: case FeedbackSlotKind::kSetKeyedStrict: case FeedbackSlotKind::kStoreInArrayLiteral: case FeedbackSlotKind::kDefineKeyedOwnPropertyInLiteral: case FeedbackSlotKind::kInstanceOf: vector->Set(slot, *uninitialized_sentinel, SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kInvalid: UNREACHABLE(); } for (int j = 1; j < entry_size; j++) { vector->Set(slot.WithOffset(j), extra_value, SKIP_WRITE_BARRIER); } i += entry_size; } if (!isolate->is_best_effort_code_coverage()) { AddToVectorsForProfilingTools(isolate, vector); } parent_feedback_cell->set_value(*vector, kReleaseStore); return vector; } // static Handle<FeedbackVector> FeedbackVector::NewForTesting( Isolate* isolate, const FeedbackVectorSpec* spec) { Handle<FeedbackMetadata> metadata = FeedbackMetadata::New(isolate, spec); Handle<SharedFunctionInfo> shared = isolate->factory()->NewSharedFunctionInfoForBuiltin( isolate->factory()->empty_string(), Builtin::kIllegal); // Set the raw feedback metadata to circumvent checks that we are not // overwriting existing metadata. shared->set_raw_outer_scope_info_or_feedback_metadata(*metadata); Handle<ClosureFeedbackCellArray> closure_feedback_cell_array = ClosureFeedbackCellArray::New(isolate, shared); Handle<FeedbackCell> parent_cell = isolate->factory()->NewNoClosuresCell( isolate->factory()->undefined_value()); IsCompiledScope is_compiled_scope(shared->is_compiled_scope(isolate)); return FeedbackVector::New(isolate, shared, closure_feedback_cell_array, parent_cell, &is_compiled_scope); } // static Handle<FeedbackVector> FeedbackVector::NewWithOneBinarySlotForTesting( Zone* zone, Isolate* isolate) { FeedbackVectorSpec one_slot(zone); one_slot.AddBinaryOpICSlot(); return NewForTesting(isolate, &one_slot); } // static Handle<FeedbackVector> FeedbackVector::NewWithOneCompareSlotForTesting( Zone* zone, Isolate* isolate) { FeedbackVectorSpec one_slot(zone); one_slot.AddCompareICSlot(); return NewForTesting(isolate, &one_slot); } // static void FeedbackVector::AddToVectorsForProfilingTools( Isolate* isolate, Handle<FeedbackVector> vector) { DCHECK(!isolate->is_best_effort_code_coverage()); if (!vector->shared_function_info()->IsSubjectToDebugging()) return; Handle<ArrayList> list = Handle<ArrayList>::cast( isolate->factory()->feedback_vectors_for_profiling_tools()); list = ArrayList::Add(isolate, list, vector); isolate->SetFeedbackVectorsForProfilingTools(*list); } void FeedbackVector::SetOptimizedCode(Tagged<Code> code) { DCHECK(CodeKindIsOptimizedJSFunction(code->kind())); int32_t state = flags(); // Skip setting optimized code if it would cause us to tier down. if (!has_optimized_code()) { state = MaybeHasTurbofanCodeBit::update(state, false); } else if (!CodeKindCanTierUp(optimized_code()->kind()) || optimized_code()->kind() > code->kind()) { if (!v8_flags.stress_concurrent_inlining_attach_code && !optimized_code()->marked_for_deoptimization()) { return; } // If we fall through, we may be tiering down. This is fine since we only do // that when the current code is marked for deoptimization, or because we're // stress testing. state = MaybeHasTurbofanCodeBit::update(state, false); } // TODO(mythria): We could see a CompileOptimized state here either from // tests that use %OptimizeFunctionOnNextCall, --always-turbofan or because we // re-mark the function for non-concurrent optimization after an OSR. We // should avoid these cases and also check that marker isn't // TieringState::kRequestTurbofan*. set_maybe_optimized_code(HeapObjectReference::Weak(code)); // TODO(leszeks): Reconsider whether this could clear the tiering state vs. // the callers doing so. state = TieringStateBits::update(state, TieringState::kNone); if (code->is_maglevved()) { DCHECK(!MaybeHasTurbofanCodeBit::decode(state)); state = MaybeHasMaglevCodeBit::update(state, true); } else { DCHECK(code->is_turbofanned()); state = MaybeHasTurbofanCodeBit::update(state, true); state = MaybeHasMaglevCodeBit::update(state, false); } set_flags(state); } void FeedbackVector::ClearOptimizedCode() { DCHECK(has_optimized_code()); DCHECK(maybe_has_maglev_code() || maybe_has_turbofan_code()); set_maybe_optimized_code(HeapObjectReference::ClearedValue(GetIsolate())); set_maybe_has_maglev_code(false); set_maybe_has_turbofan_code(false); } void FeedbackVector::SetOptimizedOsrCode(Isolate* isolate, FeedbackSlot slot, Tagged<Code> code) { DCHECK(CodeKindIsOptimizedJSFunction(code->kind())); DCHECK(!slot.IsInvalid()); auto current = GetOptimizedOsrCode(isolate, slot); if (V8_UNLIKELY(current && current.value()->kind() > code->kind())) { return; } Set(slot, HeapObjectReference::Weak(code)); set_maybe_has_optimized_osr_code(true, code->kind()); } void FeedbackVector::reset_tiering_state() { set_tiering_state(TieringState::kNone); } void FeedbackVector::set_tiering_state(TieringState state) { int32_t new_flags = flags(); new_flags = TieringStateBits::update(new_flags, state); set_flags(new_flags); } void FeedbackVector::reset_flags() { set_flags(TieringStateBits::encode(TieringState::kNone) | LogNextExecutionBit::encode(false) | MaybeHasMaglevCodeBit::encode(false) | MaybeHasTurbofanCodeBit::encode(false) | OsrTieringStateBit::encode(TieringState::kNone) | MaybeHasMaglevOsrCodeBit::encode(false) | MaybeHasTurbofanOsrCodeBit::encode(false)); } TieringState FeedbackVector::osr_tiering_state() { return OsrTieringStateBit::decode(flags()); } void FeedbackVector::set_osr_tiering_state(TieringState marker) { DCHECK(marker == TieringState::kNone || marker == TieringState::kInProgress); static_assert(TieringState::kNone <= OsrTieringStateBit::kMax); static_assert(TieringState::kInProgress <= OsrTieringStateBit::kMax); int32_t state = flags(); state = OsrTieringStateBit::update(state, marker); set_flags(state); } void FeedbackVector::EvictOptimizedCodeMarkedForDeoptimization( Isolate* isolate, Tagged<SharedFunctionInfo> shared, const char* reason) { MaybeObject slot = maybe_optimized_code(); if (slot->IsCleared()) { set_maybe_has_maglev_code(false); set_maybe_has_turbofan_code(false); return; } Tagged<Code> code = Code::cast(slot.GetHeapObject()); if (code->marked_for_deoptimization()) { Deoptimizer::TraceEvictFromOptimizedCodeCache(isolate, shared, reason); ClearOptimizedCode(); } } bool FeedbackVector::ClearSlots(Isolate* isolate, ClearBehavior behavior) { if (!shared_function_info()->HasFeedbackMetadata()) return false; MaybeObject uninitialized_sentinel = MaybeObject::FromObject( FeedbackVector::RawUninitializedSentinel(isolate)); bool feedback_updated = false; FeedbackMetadataIterator iter(metadata()); while (iter.HasNext()) { FeedbackSlot slot = iter.Next(); MaybeObject obj = Get(slot); if (obj != uninitialized_sentinel) { FeedbackNexus nexus(*this, slot); feedback_updated |= nexus.Clear(behavior); } } return feedback_updated; } MaybeObjectHandle NexusConfig::NewHandle(MaybeObject object) const { if (mode() == Mode::MainThread) { return handle(object, isolate_); } DCHECK_EQ(mode(), Mode::BackgroundThread); return handle(object, local_heap_); } template <typename T> Handle<T> NexusConfig::NewHandle(Tagged<T> object) const { if (mode() == Mode::MainThread) { return handle(object, isolate_); } DCHECK_EQ(mode(), Mode::BackgroundThread); return handle(object, local_heap_); } void NexusConfig::SetFeedbackPair(Tagged<FeedbackVector> vector, FeedbackSlot start_slot, MaybeObject feedback, WriteBarrierMode mode, MaybeObject feedback_extra, WriteBarrierMode mode_extra) const { CHECK(can_write()); CHECK_GT(vector->length(), start_slot.WithOffset(1).ToInt()); base::SharedMutexGuard<base::kExclusive> shared_mutex_guard( isolate()->feedback_vector_access()); vector->Set(start_slot, feedback, mode); vector->Set(start_slot.WithOffset(1), feedback_extra, mode_extra); } std::pair<MaybeObject, MaybeObject> NexusConfig::GetFeedbackPair( Tagged<FeedbackVector> vector, FeedbackSlot slot) const { base::SharedMutexGuardIf<base::kShared> scope( isolate()->feedback_vector_access(), mode() == BackgroundThread); MaybeObject feedback = vector->Get(slot); MaybeObject feedback_extra = vector->Get(slot.WithOffset(1)); return std::make_pair(feedback, feedback_extra); } FeedbackNexus::FeedbackNexus(Handle<FeedbackVector> vector, FeedbackSlot slot) : vector_handle_(vector), slot_(slot), config_(NexusConfig::FromMainThread( vector.is_null() ? nullptr : vector->GetIsolate())) { kind_ = vector.is_null() ? FeedbackSlotKind::kInvalid : vector->GetKind(slot); } FeedbackNexus::FeedbackNexus(Tagged<FeedbackVector> vector, FeedbackSlot slot) : vector_(vector), slot_(slot), config_(NexusConfig::FromMainThread( vector.is_null() ? nullptr : vector->GetIsolate())) { kind_ = vector.is_null() ? FeedbackSlotKind::kInvalid : vector->GetKind(slot); } FeedbackNexus::FeedbackNexus(Handle<FeedbackVector> vector, FeedbackSlot slot, const NexusConfig& config) : vector_handle_(vector), slot_(slot), kind_(vector->GetKind(slot, kAcquireLoad)), config_(config) {} Handle<WeakFixedArray> FeedbackNexus::CreateArrayOfSize(int length) { DCHECK(config()->can_write()); Handle<WeakFixedArray> array = GetIsolate()->factory()->NewWeakFixedArray(length); return array; } void FeedbackNexus::ConfigureUninitialized() { Isolate* isolate = GetIsolate(); switch (kind()) { case FeedbackSlotKind::kStoreGlobalSloppy: case FeedbackSlotKind::kStoreGlobalStrict: case FeedbackSlotKind::kLoadGlobalNotInsideTypeof: case FeedbackSlotKind::kLoadGlobalInsideTypeof: SetFeedback(HeapObjectReference::ClearedValue(isolate), SKIP_WRITE_BARRIER, UninitializedSentinel(), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kCloneObject: case FeedbackSlotKind::kCall: SetFeedback(UninitializedSentinel(), SKIP_WRITE_BARRIER, Smi::zero(), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kInstanceOf: SetFeedback(UninitializedSentinel(), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kSetNamedSloppy: case FeedbackSlotKind::kSetNamedStrict: case FeedbackSlotKind::kSetKeyedSloppy: case FeedbackSlotKind::kSetKeyedStrict: case FeedbackSlotKind::kStoreInArrayLiteral: case FeedbackSlotKind::kDefineNamedOwn: case FeedbackSlotKind::kDefineKeyedOwn: case FeedbackSlotKind::kLoadProperty: case FeedbackSlotKind::kLoadKeyed: case FeedbackSlotKind::kHasKeyed: case FeedbackSlotKind::kDefineKeyedOwnPropertyInLiteral: SetFeedback(UninitializedSentinel(), SKIP_WRITE_BARRIER, UninitializedSentinel(), SKIP_WRITE_BARRIER); break; case FeedbackSlotKind::kJumpLoop: SetFeedback(HeapObjectReference::ClearedValue(isolate), SKIP_WRITE_BARRIER); break; default: UNREACHABLE(); } } bool FeedbackNexus::Clear(ClearBehavior behavior) { bool feedback_updated = false; switch (kind()) { case FeedbackSlotKind::kCompareOp: case FeedbackSlotKind::kForIn: case FeedbackSlotKind::kBinaryOp: if (V8_LIKELY(behavior == ClearBehavior::kDefault)) { // We don't clear these, either. } else if (!IsCleared()) { DCHECK_EQ(behavior, ClearBehavior::kClearAll); SetFeedback(Smi::zero(), SKIP_WRITE_BARRIER); feedback_updated = true; } break; case FeedbackSlotKind::kLiteral: if (!IsCleared()) { SetFeedback(Smi::zero(), SKIP_WRITE_BARRIER); feedback_updated = true; } break; case FeedbackSlotKind::kSetNamedSloppy: case FeedbackSlotKind::kSetNamedStrict: case FeedbackSlotKind::kSetKeyedSloppy: case FeedbackSlotKind::kSetKeyedStrict: case FeedbackSlotKind::kStoreInArrayLiteral: case FeedbackSlotKind::kDefineNamedOwn: case FeedbackSlotKind::kDefineKeyedOwn: case FeedbackSlotKind::kLoadProperty: case FeedbackSlotKind::kLoadKeyed: case FeedbackSlotKind::kHasKeyed: case FeedbackSlotKind::kStoreGlobalSloppy: case FeedbackSlotKind::kStoreGlobalStrict: case FeedbackSlotKind::kLoadGlobalNotInsideTypeof: case FeedbackSlotKind::kLoadGlobalInsideTypeof: case FeedbackSlotKind::kCall: case FeedbackSlotKind::kInstanceOf: case FeedbackSlotKind::kDefineKeyedOwnPropertyInLiteral: case FeedbackSlotKind::kCloneObject: case FeedbackSlotKind::kJumpLoop: if (!IsCleared()) { ConfigureUninitialized(); feedback_updated = true; } break; case FeedbackSlotKind::kInvalid: UNREACHABLE(); } return feedback_updated; } bool FeedbackNexus::ConfigureMegamorphic() { DisallowGarbageCollection no_gc; Isolate* isolate = GetIsolate(); MaybeObject sentinel = MegamorphicSentinel(); if (GetFeedback() != sentinel) { SetFeedback(sentinel, SKIP_WRITE_BARRIER, HeapObjectReference::ClearedValue(isolate)); return true; } return false; } void FeedbackNexus::ConfigureMegaDOM(const MaybeObjectHandle& handler) { DisallowGarbageCollection no_gc; MaybeObject sentinel = MegaDOMSentinel(); SetFeedback(sentinel, SKIP_WRITE_BARRIER, *handler, UPDATE_WRITE_BARRIER); } bool FeedbackNexus::ConfigureMegamorphic(IcCheckType property_type) { DisallowGarbageCollection no_gc; MaybeObject sentinel = MegamorphicSentinel(); MaybeObject maybe_extra = MaybeObject::FromSmi(Smi::FromInt(static_cast<int>(property_type))); auto feedback = GetFeedbackPair(); bool update_required = feedback.first != sentinel || feedback.second != maybe_extra; if (update_required) { SetFeedback(sentinel, SKIP_WRITE_BARRIER, maybe_extra, SKIP_WRITE_BARRIER); } return update_required; } Tagged<Map> FeedbackNexus::GetFirstMap() const { FeedbackIterator it(this); if (!it.done()) { return it.map(); } return Map(); } InlineCacheState FeedbackNexus::ic_state() const { MaybeObject feedback, extra; std::tie(feedback, extra) = GetFeedbackPair(); switch (kind()) { case FeedbackSlotKind::kLiteral: if (IsSmi(feedback)) return InlineCacheState::UNINITIALIZED; return InlineCacheState::MONOMORPHIC; case FeedbackSlotKind::kStoreGlobalSloppy: case FeedbackSlotKind::kStoreGlobalStrict: case FeedbackSlotKind::kLoadGlobalNotInsideTypeof: case FeedbackSlotKind::kLoadGlobalInsideTypeof: case FeedbackSlotKind::kJumpLoop: { if (IsSmi(feedback)) return InlineCacheState::MONOMORPHIC; DCHECK(feedback->IsWeakOrCleared()); if (!feedback->IsCleared() || extra != UninitializedSentinel()) { return InlineCacheState::MONOMORPHIC; } return InlineCacheState::UNINITIALIZED; } case FeedbackSlotKind::kSetNamedSloppy: case FeedbackSlotKind::kSetNamedStrict: case FeedbackSlotKind::kSetKeyedSloppy: case FeedbackSlotKind::kSetKeyedStrict: case FeedbackSlotKind::kStoreInArrayLiteral: case FeedbackSlotKind::kDefineNamedOwn: case FeedbackSlotKind::kDefineKeyedOwn: case FeedbackSlotKind::kLoadProperty: case FeedbackSlotKind::kLoadKeyed: case FeedbackSlotKind::kHasKeyed: { if (feedback == UninitializedSentinel()) { return InlineCacheState::UNINITIALIZED; } if (feedback == MegamorphicSentinel()) { return InlineCacheState::MEGAMORPHIC; } if (feedback == MegaDOMSentinel()) { DCHECK(IsLoadICKind(kind())); return InlineCacheState::MEGADOM; } if (feedback->IsWeakOrCleared()) { // Don't check if the map is cleared. return InlineCacheState::MONOMORPHIC; } Tagged<HeapObject> heap_object; if (feedback.GetHeapObjectIfStrong(&heap_object)) { if (IsWeakFixedArray(heap_object)) { // Determine state purely by our structure, don't check if the maps // are cleared. return InlineCacheState::POLYMORPHIC; } if (IsName(heap_object)) { DCHECK(IsKeyedLoadICKind(kind()) || IsKeyedStoreICKind(kind()) || IsKeyedHasICKind(kind()) || IsDefineKeyedOwnICKind(kind())); Tagged<Object> extra_object = extra.GetHeapObjectAssumeStrong(); Tagged<WeakFixedArray> extra_array = WeakFixedArray::cast(extra_object); return extra_array->length() > 2 ? InlineCacheState::POLYMORPHIC : InlineCacheState::MONOMORPHIC; } } // TODO(1393773): Remove once the issue is solved. Address vector_ptr = vector().ptr(); config_.isolate()->PushParamsAndDie( reinterpret_cast<void*>(feedback.ptr()), reinterpret_cast<void*>(extra.ptr()), reinterpret_cast<void*>(vector_ptr), reinterpret_cast<void*>(static_cast<intptr_t>(slot_.ToInt())), reinterpret_cast<void*>(static_cast<intptr_t>(kind())), // Include part of the feedback vector containing the slot. reinterpret_cast<void*>( vector_ptr + FeedbackVector::OffsetOfElementAt(slot_.ToInt()))); UNREACHABLE(); } case FeedbackSlotKind::kCall: { Tagged<HeapObject> heap_object; if (feedback == MegamorphicSentinel()) { return InlineCacheState::GENERIC; } else if (feedback->IsWeakOrCleared()) { if (feedback.GetHeapObjectIfWeak(&heap_object)) { if (IsFeedbackCell(heap_object)) { return InlineCacheState::POLYMORPHIC; } CHECK(IsJSFunction(heap_object) || IsJSBoundFunction(heap_object)); } return InlineCacheState::MONOMORPHIC; } else if (feedback.GetHeapObjectIfStrong(&heap_object) && IsAllocationSite(heap_object)) { return InlineCacheState::MONOMORPHIC; } CHECK_EQ(feedback, UninitializedSentinel()); return InlineCacheState::UNINITIALIZED; } case FeedbackSlotKind::kBinaryOp: { BinaryOperationHint hint = GetBinaryOperationFeedback(); if (hint == BinaryOperationHint::kNone) { return InlineCacheState::UNINITIALIZED; } else if (hint == BinaryOperationHint::kAny) { return InlineCacheState::GENERIC; } return InlineCacheState::MONOMORPHIC; } case FeedbackSlotKind::kCompareOp: { CompareOperationHint hint = GetCompareOperationFeedback(); if (hint == CompareOperationHint::kNone) { return InlineCacheState::UNINITIALIZED; } else if (hint == CompareOperationHint::kAny) { return InlineCacheState::GENERIC; } return InlineCacheState::MONOMORPHIC; } case FeedbackSlotKind::kForIn: { ForInHint hint = GetForInFeedback(); if (hint == ForInHint::kNone) { return InlineCacheState::UNINITIALIZED; } else if (hint == ForInHint::kAny) { return InlineCacheState::GENERIC; } return InlineCacheState::MONOMORPHIC; } case FeedbackSlotKind::kInstanceOf: { if (feedback == UninitializedSentinel()) { return InlineCacheState::UNINITIALIZED; } else if (feedback == MegamorphicSentinel()) { return InlineCacheState::MEGAMORPHIC; } return InlineCacheState::MONOMORPHIC; } case FeedbackSlotKind::kDefineKeyedOwnPropertyInLiteral: { if (feedback == UninitializedSentinel()) { return InlineCacheState::UNINITIALIZED; } else if (feedback->IsWeakOrCleared()) { // Don't check if the map is cleared. return InlineCacheState::MONOMORPHIC; } return InlineCacheState::MEGAMORPHIC; } case FeedbackSlotKind::kCloneObject: { if (feedback == UninitializedSentinel()) { return InlineCacheState::UNINITIALIZED; } if (feedback == MegamorphicSentinel()) { return InlineCacheState::MEGAMORPHIC; } if (feedback->IsWeakOrCleared()) { return InlineCacheState::MONOMORPHIC; } DCHECK(IsWeakFixedArray(feedback.GetHeapObjectAssumeStrong())); return InlineCacheState::POLYMORPHIC; } case FeedbackSlotKind::kInvalid: UNREACHABLE(); } return InlineCacheState::UNINITIALIZED; } void FeedbackNexus::ConfigurePropertyCellMode(Handle<PropertyCell> cell) { DCHECK(IsGlobalICKind(kind())); SetFeedback(HeapObjectReference::Weak(*cell), UPDATE_WRITE_BARRIER, UninitializedSentinel(), SKIP_WRITE_BARRIER); } bool FeedbackNexus::ConfigureLexicalVarMode(int script_context_index, int context_slot_index, bool immutable) { DCHECK(IsGlobalICKind(kind())); DCHECK_LE(0, script_context_index); DCHECK_LE(0, context_slot_index); if (!ContextIndexBits::is_valid(script_context_index) || !SlotIndexBits::is_valid(context_slot_index) || !ImmutabilityBit::is_valid(immutable)) { return false; } int config = ContextIndexBits::encode(script_context_index) | SlotIndexBits::encode(context_slot_index) | ImmutabilityBit::encode(immutable); SetFeedback(Smi::From31BitPattern(config), SKIP_WRITE_BARRIER, UninitializedSentinel(), SKIP_WRITE_BARRIER); return true; } void FeedbackNexus::ConfigureHandlerMode(const MaybeObjectHandle& handler) { DCHECK(IsGlobalICKind(kind())); DCHECK(IC::IsHandler(*handler)); SetFeedback(HeapObjectReference::ClearedValue(GetIsolate()), UPDATE_WRITE_BARRIER, *handler, UPDATE_WRITE_BARRIER); } void FeedbackNexus::ConfigureCloneObject( Handle<Map> source_map, const MaybeObjectHandle& handler_handle) { // TODO(olivf): Introduce a CloneHandler to deal with all the logic of this // state machine which is now spread between Runtime_CloneObjectIC_Miss and // this method. auto GetHandler = [=]() { if (handler_handle->IsSmi()) { return *handler_handle; } return HeapObjectReference::MakeWeak(*handler_handle); }; DCHECK(config()->can_write()); Isolate* isolate = GetIsolate(); Handle<HeapObject> feedback; { MaybeObject maybe_feedback = GetFeedback(); if (maybe_feedback->IsStrongOrWeak()) { feedback = handle(maybe_feedback.GetHeapObject(), isolate); } else { DCHECK(maybe_feedback->IsCleared()); } } switch (ic_state()) { case InlineCacheState::UNINITIALIZED: // Cache the first map seen which meets the fast case requirements. SetFeedback(HeapObjectReference::Weak(*source_map), UPDATE_WRITE_BARRIER, GetHandler()); break; case InlineCacheState::MONOMORPHIC: if (feedback.is_null() || feedback.is_identical_to(source_map) || Map::cast(*feedback)->is_deprecated()) { SetFeedback(HeapObjectReference::Weak(*source_map), UPDATE_WRITE_BARRIER, GetHandler()); } else { // Transition to POLYMORPHIC. Handle<WeakFixedArray> array = CreateArrayOfSize(2 * kCloneObjectPolymorphicEntrySize); DisallowGarbageCollection no_gc; Tagged<WeakFixedArray> raw_array = *array; raw_array->Set(0, HeapObjectReference::Weak(*feedback)); raw_array->Set(1, GetFeedbackExtra()); raw_array->Set(2, HeapObjectReference::Weak(*source_map)); raw_array->Set(3, GetHandler()); SetFeedback(raw_array, UPDATE_WRITE_BARRIER, HeapObjectReference::ClearedValue(isolate)); } break; case InlineCacheState::POLYMORPHIC: { const int kMaxElements = v8_flags.max_valid_polymorphic_map_count * kCloneObjectPolymorphicEntrySize; Handle<WeakFixedArray> array = Handle<WeakFixedArray>::cast(feedback); int i = 0; for (; i < array->length(); i += kCloneObjectPolymorphicEntrySize) { MaybeObject feedback_map = array->Get(i); if (feedback_map->IsCleared()) break; Handle<Map> cached_map(Map::cast(feedback_map.GetHeapObject()), isolate); if (cached_map.is_identical_to(source_map) || cached_map->is_deprecated()) break; } if (i >= array->length()) { if (i == kMaxElements) { // Transition to MEGAMORPHIC. MaybeObject sentinel = MegamorphicSentinel(); SetFeedback(sentinel, SKIP_WRITE_BARRIER, HeapObjectReference::ClearedValue(isolate)); break; } // Grow polymorphic feedback array. Handle<WeakFixedArray> new_array = CreateArrayOfSize( array->length() + kCloneObjectPolymorphicEntrySize); for (int j = 0; j < array->length(); ++j) { new_array->Set(j, array->Get(j)); } SetFeedback(*new_array); array = new_array; } array->Set(i, HeapObjectReference::Weak(*source_map)); array->Set(i + 1, GetHandler()); break; } default: UNREACHABLE(); } } int FeedbackNexus::GetCallCount() { DCHECK(IsCallICKind(kind())); Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>(); CHECK(IsSmi(call_count)); uint32_t value = static_cast<uint32_t>(Smi::ToInt(call_count)); return CallCountField::decode(value); } void FeedbackNexus::SetSpeculationMode(SpeculationMode mode) { DCHECK(IsCallICKind(kind())); Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>(); CHECK(IsSmi(call_count)); uint32_t count = static_cast<uint32_t>(Smi::ToInt(call_count)); count = SpeculationModeField::update(count, mode); MaybeObject feedback = GetFeedback(); // We could've skipped WB here (since we set the slot to the same value again) // but we don't to make WB verification happy. SetFeedback(feedback, UPDATE_WRITE_BARRIER, Smi::FromInt(count), SKIP_WRITE_BARRIER); } SpeculationMode FeedbackNexus::GetSpeculationMode() { DCHECK(IsCallICKind(kind())); Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>(); CHECK(IsSmi(call_count)); uint32_t value = static_cast<uint32_t>(Smi::ToInt(call_count)); return SpeculationModeField::decode(value); } CallFeedbackContent FeedbackNexus::GetCallFeedbackContent() { DCHECK(IsCallICKind(kind())); Tagged<Object> call_count = GetFeedbackExtra()->cast<Object>(); CHECK(IsSmi(call_count)); uint32_t value = static_cast<uint32_t>(Smi::ToInt(call_count)); return CallFeedbackContentField::decode(value); } float FeedbackNexus::ComputeCallFrequency() { DCHECK(IsCallICKind(kind())); double const invocation_count = vector()->invocation_count(kRelaxedLoad); double const call_count = GetCallCount(); if (invocation_count == 0.0) { // Prevent division by 0. return 0.0f; } return static_cast<float>(call_count / invocation_count); } void FeedbackNexus::ConfigureMonomorphic(Handle<Name> name, Handle<Map> receiver_map, const MaybeObjectHandle& handler) { DCHECK(handler.is_null() || IC::IsHandler(*handler)); if (kind() == FeedbackSlotKind::kDefineKeyedOwnPropertyInLiteral) { SetFeedback(HeapObjectReference::Weak(*receiver_map), UPDATE_WRITE_BARRIER, *name); } else { if (name.is_null()) { SetFeedback(HeapObjectReference::Weak(*receiver_map), UPDATE_WRITE_BARRIER, *handler); } else { Handle<WeakFixedArray> array = CreateArrayOfSize(2); array->Set(0, HeapObjectReference::Weak(*receiver_map)); array->Set(1, *handler); SetFeedback(*name, UPDATE_WRITE_BARRIER, *array); } } } void FeedbackNexus::ConfigurePolymorphic( Handle<Name> name, std::vector<MapAndHandler> const& maps_and_handlers) { int receiver_count = static_cast<int>(maps_and_handlers.size()); DCHECK_GT(receiver_count, 1); Handle<WeakFixedArray> array = CreateArrayOfSize(receiver_count * 2); for (int current = 0; current < receiver_count; ++current) { Handle<Map> map = maps_and_handlers[current].first; array->Set(current * 2, HeapObjectReference::Weak(*map)); MaybeObjectHandle handler = maps_and_handlers[current].second; DCHECK(IC::IsHandler(*handler)); array->Set(current * 2 + 1, *handler); } if (name.is_null()) { SetFeedback(*array, UPDATE_WRITE_BARRIER, UninitializedSentinel(), SKIP_WRITE_BARRIER); } else { SetFeedback(*name, UPDATE_WRITE_BARRIER, *array); } } int FeedbackNexus::ExtractMaps(MapHandles* maps) const { DisallowGarbageCollection no_gc; int found = 0; for (FeedbackIterator it(this); !it.done(); it.Advance()) { maps->push_back(config()->NewHandle(it.map())); found++; } return found; } int FeedbackNexus::ExtractMapsAndFeedback( std::vector<MapAndFeedback>* maps_and_feedback) const { DisallowGarbageCollection no_gc; int found = 0; for (FeedbackIterator it(this); !it.done(); it.Advance()) { Handle<Map> map = config()->NewHandle(it.map()); MaybeObject maybe_handler = it.handler(); if (!maybe_handler->IsCleared()) { DCHECK(IC::IsHandler(maybe_handler) || IsDefineKeyedOwnPropertyInLiteralKind(kind())); MaybeObjectHandle handler = config()->NewHandle(maybe_handler); maps_and_feedback->push_back(MapAndHandler(map, handler)); found++; } } return found; } MaybeObjectHandle FeedbackNexus::ExtractMegaDOMHandler() { DCHECK(ic_state() == InlineCacheState::MEGADOM); DisallowGarbageCollection no_gc; auto pair = GetFeedbackPair(); MaybeObject maybe_handler = pair.second; if (!maybe_handler->IsCleared()) { MaybeObjectHandle handler = config()->NewHandle(maybe_handler); return handler; } return MaybeObjectHandle(); } int FeedbackNexus::ExtractMapsAndHandlers( std::vector<MapAndHandler>* maps_and_handlers, TryUpdateHandler map_handler) const { DCHECK(!IsDefineKeyedOwnPropertyInLiteralKind(kind())); DisallowGarbageCollection no_gc; int found = 0; for (FeedbackIterator it(this); !it.done(); it.Advance()) { Handle<Map> map = config()->NewHandle(it.map()); MaybeObject maybe_handler = it.handler(); if (!maybe_handler->IsCleared()) { DCHECK(IC::IsHandler(maybe_handler)); MaybeObjectHandle handler = config()->NewHandle(maybe_handler); if (map_handler && !(map_handler(map).ToHandle(&map))) { continue; } maps_and_handlers->push_back(MapAndHandler(map, handler)); found++; } } return found; } MaybeObjectHandle FeedbackNexus::FindHandlerForMap(Handle<Map> map) const { DCHECK(!IsStoreInArrayLiteralICKind(kind())); for (FeedbackIterator it(this); !it.done(); it.Advance()) { if (it.map() == *map && !it.handler()->IsCleared()) { return config()->NewHandle(it.handler()); } } return MaybeObjectHandle(); } Tagged<Name> FeedbackNexus::GetName() const { if (IsKeyedStoreICKind(kind()) || IsKeyedLoadICKind(kind()) || IsKeyedHasICKind(kind()) || IsDefineKeyedOwnICKind(kind())) { MaybeObject feedback = GetFeedback(); if (IsPropertyNameFeedback(feedback)) { return Name::cast(feedback.GetHeapObjectAssumeStrong()); } } if (IsDefineKeyedOwnPropertyInLiteralKind(kind())) { MaybeObject extra = GetFeedbackExtra(); if (IsPropertyNameFeedback(extra)) { return Name::cast(extra.GetHeapObjectAssumeStrong()); } } return Name(); } KeyedAccessLoadMode FeedbackNexus::GetKeyedAccessLoadMode() const { DCHECK(IsKeyedLoadICKind(kind()) || IsKeyedHasICKind(kind())); if (GetKeyType() == IcCheckType::kProperty) return STANDARD_LOAD; std::vector<MapAndHandler> maps_and_handlers; ExtractMapsAndHandlers(&maps_and_handlers); for (MapAndHandler map_and_handler : maps_and_handlers) { KeyedAccessLoadMode mode = LoadHandler::GetKeyedAccessLoadMode(*map_and_handler.second); if (mode != STANDARD_LOAD) return mode; } return STANDARD_LOAD; } namespace { bool BuiltinHasKeyedAccessStoreMode(Builtin builtin) { DCHECK(Builtins::IsBuiltinId(builtin)); switch (builtin) { case Builtin::kKeyedStoreIC_SloppyArguments_Standard: case Builtin::kKeyedStoreIC_SloppyArguments_GrowNoTransitionHandleCOW: case Builtin::kKeyedStoreIC_SloppyArguments_NoTransitionIgnoreOOB: case Builtin::kKeyedStoreIC_SloppyArguments_NoTransitionHandleCOW: case Builtin::kStoreFastElementIC_Standard: case Builtin::kStoreFastElementIC_GrowNoTransitionHandleCOW: case Builtin::kStoreFastElementIC_NoTransitionIgnoreOOB: case Builtin::kStoreFastElementIC_NoTransitionHandleCOW: case Builtin::kElementsTransitionAndStore_Standard: case Builtin::kElementsTransitionAndStore_GrowNoTransitionHandleCOW: case Builtin::kElementsTransitionAndStore_NoTransitionIgnoreOOB: case Builtin::kElementsTransitionAndStore_NoTransitionHandleCOW: return true; default: return false; } UNREACHABLE(); } KeyedAccessStoreMode KeyedAccessStoreModeForBuiltin(Builtin builtin) { DCHECK(BuiltinHasKeyedAccessStoreMode(builtin)); switch (builtin) { case Builtin::kKeyedStoreIC_SloppyArguments_Standard: case Builtin::kStoreFastElementIC_Standard: case Builtin::kElementsTransitionAndStore_Standard: return STANDARD_STORE; case Builtin::kKeyedStoreIC_SloppyArguments_GrowNoTransitionHandleCOW: case Builtin::kStoreFastElementIC_GrowNoTransitionHandleCOW: case Builtin::kElementsTransitionAndStore_GrowNoTransitionHandleCOW: return STORE_AND_GROW_HANDLE_COW; case Builtin::kKeyedStoreIC_SloppyArguments_NoTransitionIgnoreOOB: case Builtin::kStoreFastElementIC_NoTransitionIgnoreOOB: case Builtin::kElementsTransitionAndStore_NoTransitionIgnoreOOB: return STORE_IGNORE_OUT_OF_BOUNDS; case Builtin::kKeyedStoreIC_SloppyArguments_NoTransitionHandleCOW: case Builtin::kStoreFastElementIC_NoTransitionHandleCOW: case Builtin::kElementsTransitionAndStore_NoTransitionHandleCOW: return STORE_HANDLE_COW; default: UNREACHABLE(); } } } // namespace KeyedAccessStoreMode FeedbackNexus::GetKeyedAccessStoreMode() const { DCHECK(IsKeyedStoreICKind(kind()) || IsStoreInArrayLiteralICKind(kind()) || IsDefineKeyedOwnPropertyInLiteralKind(kind()) || IsDefineKeyedOwnICKind(kind())); KeyedAccessStoreMode mode = STANDARD_STORE; if (GetKeyType() == IcCheckType::kProperty) return mode; std::vector<MapAndHandler> maps_and_handlers; ExtractMapsAndHandlers(&maps_and_handlers); for (const MapAndHandler& map_and_handler : maps_and_handlers) { const MaybeObjectHandle maybe_code_handler = map_and_handler.second; // The first handler that isn't the slow handler will have the bits we need. Builtin builtin_handler = Builtin::kNoBuiltinId; if (IsStoreHandler(*maybe_code_handler.object())) { Handle<StoreHandler> data_handler = Handle<StoreHandler>::cast(maybe_code_handler.object()); if (IsSmi(data_handler->smi_handler())) { // Decode the KeyedAccessStoreMode information from the Handler. mode = StoreHandler::GetKeyedAccessStoreMode( MaybeObject::FromObject(data_handler->smi_handler())); if (mode != STANDARD_STORE) return mode; continue; } else { Tagged<Code> code = Code::cast(data_handler->smi_handler()); builtin_handler = code->builtin_id(); } } else if (IsSmi(*maybe_code_handler.object())) { // Skip for Proxy Handlers. if (*maybe_code_handler.object() == StoreHandler::StoreProxy()) { continue; } // Decode the KeyedAccessStoreMode information from the Handler. mode = StoreHandler::GetKeyedAccessStoreMode(*maybe_code_handler); if (mode != STANDARD_STORE) return mode; continue; } else if (IsDefineKeyedOwnICKind(kind())) { mode = StoreHandler::GetKeyedAccessStoreMode(*maybe_code_handler); if (mode != STANDARD_STORE) return mode; continue; } else { // Element store without prototype chain check. Tagged<Code> code = Code::cast(*maybe_code_handler.object()); builtin_handler = code->builtin_id(); } if (Builtins::IsBuiltinId(builtin_handler)) { if (!BuiltinHasKeyedAccessStoreMode(builtin_handler)) continue; mode = KeyedAccessStoreModeForBuiltin(builtin_handler); break; } } return mode; } IcCheckType FeedbackNexus::GetKeyType() const { DCHECK(IsKeyedStoreICKind(kind()) || IsKeyedLoadICKind(kind()) || IsStoreInArrayLiteralICKind(kind()) || IsKeyedHasICKind(kind()) || IsDefineKeyedOwnPropertyInLiteralKind(kind()) || IsDefineKeyedOwnICKind(kind())); auto pair = GetFeedbackPair(); MaybeObject feedback = pair.first; if (feedback == MegamorphicSentinel()) { return static_cast<IcCheckType>( Smi::ToInt(pair.second->template cast<Object>())); } MaybeObject maybe_name = IsDefineKeyedOwnPropertyInLiteralKind(kind()) || IsDefineKeyedOwnICKind(kind()) ? pair.second : feedback; return IsPropertyNameFeedback(maybe_name) ? IcCheckType::kProperty : IcCheckType::kElement; } BinaryOperationHint FeedbackNexus::GetBinaryOperationFeedback() const { DCHECK_EQ(kind(), FeedbackSlotKind::kBinaryOp); int feedback = GetFeedback().ToSmi().value(); return BinaryOperationHintFromFeedback(feedback); } CompareOperationHint FeedbackNexus::GetCompareOperationFeedback() const { DCHECK_EQ(kind(), FeedbackSlotKind::kCompareOp); int feedback = GetFeedback().ToSmi().value(); return CompareOperationHintFromFeedback(feedback); } ForInHint FeedbackNexus::GetForInFeedback() const { DCHECK_EQ(kind(), FeedbackSlotKind::kForIn); int feedback = GetFeedback().ToSmi().value(); return ForInHintFromFeedback(static_cast<ForInFeedback>(feedback)); } MaybeHandle<JSObject> FeedbackNexus::GetConstructorFeedback() const { DCHECK_EQ(kind(), FeedbackSlotKind::kInstanceOf); MaybeObject feedback = GetFeedback(); Tagged<HeapObject> heap_object; if (feedback.GetHeapObjectIfWeak(&heap_object)) { return config()->NewHandle(JSObject::cast(heap_object)); } return MaybeHandle<JSObject>(); } FeedbackIterator::FeedbackIterator(const FeedbackNexus* nexus) : done_(false), index_(-1), state_(kOther) { DCHECK( IsLoadICKind(nexus->kind()) || IsSetNamedICKind(nexus->kind()) || IsKeyedLoadICKind(nexus->kind()) || IsKeyedStoreICKind(nexus->kind()) || IsDefineNamedOwnICKind(nexus->kind()) || IsDefineKeyedOwnPropertyInLiteralKind(nexus->kind()) || IsStoreInArrayLiteralICKind(nexus->kind()) || IsKeyedHasICKind(nexus->kind()) || IsDefineKeyedOwnICKind(nexus->kind())); DisallowGarbageCollection no_gc; auto pair = nexus->GetFeedbackPair(); MaybeObject feedback = pair.first; bool is_named_feedback = IsPropertyNameFeedback(feedback); Tagged<HeapObject> heap_object; if ((feedback.GetHeapObjectIfStrong(&heap_object) && IsWeakFixedArray(heap_object)) || is_named_feedback) { index_ = 0; state_ = kPolymorphic; heap_object = feedback.GetHeapObjectAssumeStrong(); if (is_named_feedback) { polymorphic_feedback_ = nexus->config()->NewHandle( WeakFixedArray::cast(pair.second.GetHeapObjectAssumeStrong())); } else { polymorphic_feedback_ = nexus->config()->NewHandle(WeakFixedArray::cast(heap_object)); } AdvancePolymorphic(); } else if (feedback.GetHeapObjectIfWeak(&heap_object)) { state_ = kMonomorphic; MaybeObject handler = pair.second; map_ = Map::cast(heap_object); handler_ = handler; } else { done_ = true; } } void FeedbackIterator::Advance() { CHECK(!done_); if (state_ == kMonomorphic) { done_ = true; return; } CHECK_EQ(state_, kPolymorphic); AdvancePolymorphic(); } void FeedbackIterator::AdvancePolymorphic() { CHECK(!done_); CHECK_EQ(state_, kPolymorphic); int length = polymorphic_feedback_->length(); Tagged<HeapObject> heap_object; while (index_ < length) { if (polymorphic_feedback_->Get(index_).GetHeapObjectIfWeak(&heap_object)) { MaybeObject handler = polymorphic_feedback_->Get(index_ + kHandlerOffset); map_ = Map::cast(heap_object); handler_ = handler; index_ += kEntrySize; return; } index_ += kEntrySize; } CHECK_EQ(index_, length); done_ = true; } } // namespace internal } // namespace v8