blob: 3b1083f6181b57d97c9e9fffbce7cad7e18148f1 [file] [log] [blame]
/*
* Copyright (C) 2013-2021 Apple Inc. All rights reserved.
*
* Redistribution and use in source and binary forms, with or without
* modification, are permitted provided that the following conditions
* are met:
* 1. Redistributions of source code must retain the above copyright
* notice, this list of conditions and the following disclaimer.
* 2. Redistributions in binary form must reproduce the above copyright
* notice, this list of conditions and the following disclaimer in the
* documentation and/or other materials provided with the distribution.
*
* THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
* EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
* PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
* CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
* EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
* PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
* PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
* OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
* (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
* OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
*/
#include "config.h"
#include "DFGOSREntrypointCreationPhase.h"
#if ENABLE(DFG_JIT)
#include "DFGBasicBlockInlines.h"
#include "DFGBlockInsertionSet.h"
#include "DFGGraph.h"
#include "DFGLoopPreHeaderCreationPhase.h"
#include "DFGPhase.h"
#include "JSCJSValueInlines.h"
namespace JSC { namespace DFG {
class OSREntrypointCreationPhase : public Phase {
public:
OSREntrypointCreationPhase(Graph& graph)
: Phase(graph, "OSR entrypoint creation")
{
}
bool run()
{
RELEASE_ASSERT(m_graph.m_plan.mode() == JITCompilationMode::FTLForOSREntry);
RELEASE_ASSERT(m_graph.m_form == ThreadedCPS);
BytecodeIndex bytecodeIndex = m_graph.m_plan.osrEntryBytecodeIndex();
RELEASE_ASSERT(bytecodeIndex);
RELEASE_ASSERT(bytecodeIndex.offset());
// Needed by createPreHeader().
m_graph.ensureCPSDominators();
CodeBlock* baseline = m_graph.m_profiledBlock;
BasicBlock* target = nullptr;
for (unsigned blockIndex = m_graph.numBlocks(); blockIndex--;) {
BasicBlock* block = m_graph.block(blockIndex);
if (!block)
continue;
unsigned nodeIndex = 0;
Node* firstNode = block->at(0);
while (firstNode->isSemanticallySkippable())
firstNode = block->at(++nodeIndex);
if (firstNode->op() == LoopHint
&& firstNode->origin.semantic == CodeOrigin(bytecodeIndex)) {
target = block;
break;
}
}
if (!target) {
// This is a terrible outcome. It shouldn't often happen but it might
// happen and so we should defend against it. If it happens, then this
// compilation is a failure.
return false;
}
BlockInsertionSet insertionSet(m_graph);
// We say that the execution count of the entry block is 1, because we know for sure
// that this must be the case. Under our definition of executionCount, "1" means "once
// per invocation". We could have said NaN here, since that would ask any clients of
// executionCount to use best judgement - but that seems unnecessary since we know for
// sure what the executionCount should be in this case.
BasicBlock* newRoot = insertionSet.insert(0, 1);
// We'd really like to use an unset origin, but ThreadedCPS won't allow that.
NodeOrigin origin = NodeOrigin(CodeOrigin(BytecodeIndex(0)), CodeOrigin(BytecodeIndex(0)), false);
Vector<Node*> locals(baseline->numCalleeLocals());
for (unsigned local = 0; local < baseline->numCalleeLocals(); ++local) {
Node* previousHead = target->variablesAtHead.local(local);
if (!previousHead)
continue;
VariableAccessData* variable = previousHead->variableAccessData();
locals[local] = newRoot->appendNode(
m_graph, variable->prediction(), ExtractOSREntryLocal, origin,
OpInfo(variable->operand().virtualRegister()));
newRoot->appendNode(
m_graph, SpecNone, MovHint, origin, OpInfo(variable->operand().virtualRegister()),
Edge(locals[local]));
}
// Now use the origin of the target, since it's not OK to exit, and we will probably hoist
// type checks to here.
origin = target->at(0)->origin;
ArgumentsVector newArguments = m_graph.m_rootToArguments.find(m_graph.block(0))->value;
for (unsigned argument = 0; argument < baseline->numParameters(); ++argument) {
Node* oldNode = target->variablesAtHead.argument(argument);
if (!oldNode) {
// Just for sanity, always have a SetArgumentDefinitely even if it's not needed.
oldNode = newArguments[argument];
}
Node* node = newRoot->appendNode(
m_graph, SpecNone, SetArgumentDefinitely, origin,
OpInfo(oldNode->variableAccessData()));
newArguments[argument] = node;
}
for (unsigned local = 0; local < baseline->numCalleeLocals(); ++local) {
Node* previousHead = target->variablesAtHead.local(local);
if (!previousHead)
continue;
VariableAccessData* variable = previousHead->variableAccessData();
Node* node = locals[local];
newRoot->appendNode(
m_graph, SpecNone, SetLocal, origin, OpInfo(variable), Edge(node));
}
newRoot->appendNode(
m_graph, SpecNone, Jump, origin,
OpInfo(createPreHeader(m_graph, insertionSet, target)));
insertionSet.execute();
RELEASE_ASSERT(m_graph.m_roots.size() == 1);
m_graph.m_roots[0] = newRoot;
m_graph.m_rootToArguments.clear();
m_graph.m_rootToArguments.add(newRoot, newArguments);
m_graph.invalidateCFG();
m_graph.resetReachability();
m_graph.killUnreachableBlocks();
return true;
}
};
bool performOSREntrypointCreation(Graph& graph)
{
return runPhase<OSREntrypointCreationPhase>(graph);
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)