bool run() { ASSERT(m_graph.m_form == ThreadedCPS); ASSERT(m_graph.m_unificationState == GloballyUnified); ASSERT(codeBlock()->numParameters() >= 1); { ConcurrentJSLocker locker(profiledBlock()->m_lock); // We only do this for the arguments at the first block. The arguments from // other entrypoints have already been populated with their predictions. auto& arguments = m_graph.m_rootToArguments.find(m_graph.block(0))->value; for (size_t arg = 0; arg < static_cast<size_t>(codeBlock()->numParameters()); ++arg) { ValueProfile& profile = profiledBlock()->valueProfileForArgument(arg); arguments[arg]->variableAccessData()->predict( profile.computeUpdatedPrediction(locker)); } } for (BlockIndex blockIndex = 0; blockIndex < m_graph.numBlocks(); ++blockIndex) { BasicBlock* block = m_graph.block(blockIndex); if (!block) continue; if (!block->isOSRTarget) continue; if (block->bytecodeBegin != m_graph.m_plan.osrEntryBytecodeIndex()) continue; const Operands<Optional<JSValue>>& mustHandleValues = m_graph.m_plan.mustHandleValues(); for (size_t i = 0; i < mustHandleValues.size(); ++i) { int operand = mustHandleValues.operandForIndex(i); Optional<JSValue> value = mustHandleValues[i]; if (!value) continue; Node* node = block->variablesAtHead.operand(operand); if (!node) continue; ASSERT(node->accessesStack(m_graph)); node->variableAccessData()->predict(speculationFromValue(value.value())); } } return true; }
bool run() { ASSERT(m_graph.m_form == ThreadedCPS); ASSERT(m_graph.m_unificationState == GloballyUnified); ASSERT(codeBlock()->numParameters() >= 1); { ConcurrentJITLocker locker(profiledBlock()->m_lock); for (size_t arg = 0; arg < static_cast<size_t>(codeBlock()->numParameters()); ++arg) { ValueProfile* profile = profiledBlock()->valueProfileForArgument(arg); if (!profile) continue; m_graph.m_arguments[arg]->variableAccessData()->predict( profile->computeUpdatedPrediction(locker)); } } for (BlockIndex blockIndex = 0; blockIndex < m_graph.numBlocks(); ++blockIndex) { BasicBlock* block = m_graph.block(blockIndex); if (!block) continue; if (!block->isOSRTarget) continue; if (block->bytecodeBegin != m_graph.m_plan.osrEntryBytecodeIndex) continue; for (size_t i = 0; i < m_graph.m_plan.mustHandleValues.size(); ++i) { int operand = m_graph.m_plan.mustHandleValues.operandForIndex(i); Node* node = block->variablesAtHead.operand(operand); if (!node) continue; ASSERT(node->hasLocal(m_graph)); node->variableAccessData()->predict( speculationFromValue(m_graph.m_plan.mustHandleValues[i])); } } return true; }
bool run() { ASSERT(m_graph.m_form == ThreadedCPS); ASSERT(m_graph.m_unificationState == GloballyUnified); ASSERT(codeBlock()->numParameters() >= 1); for (size_t arg = 0; arg < static_cast<size_t>(codeBlock()->numParameters()); ++arg) { ValueProfile* profile = profiledBlock()->valueProfileForArgument(arg); if (!profile) continue; m_graph.m_arguments[arg]->variableAccessData()->predict(profile->computeUpdatedPrediction()); #if DFG_ENABLE(DEBUG_VERBOSE) dataLog( "Argument [", arg, "] prediction: ", SpeculationDump(m_graph.m_arguments[arg]->variableAccessData()->prediction()), "\n"); #endif } for (BlockIndex blockIndex = 0; blockIndex < m_graph.m_blocks.size(); ++blockIndex) { BasicBlock* block = m_graph.m_blocks[blockIndex].get(); if (!block) continue; if (!block->isOSRTarget) continue; if (block->bytecodeBegin != m_graph.m_osrEntryBytecodeIndex) continue; for (size_t i = 0; i < m_graph.m_mustHandleValues.size(); ++i) { Node* node = block->variablesAtHead.operand( m_graph.m_mustHandleValues.operandForIndex(i)); if (!node) continue; ASSERT(node->hasLocal()); node->variableAccessData()->predict( speculationFromValue(m_graph.m_mustHandleValues[i])); } } return true; }