1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306
|
/*
* Copyright (C) 2012-2019 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 "DFGVariableEventStream.h"
#if ENABLE(DFG_JIT)
#include "CodeBlock.h"
#include "DFGValueSource.h"
#include "InlineCallFrame.h"
#include "JSCJSValueInlines.h"
#include "OperandsInlines.h"
#include <wtf/DataLog.h>
#include <wtf/HashMap.h>
namespace JSC { namespace DFG {
void VariableEventStreamBuilder::logEvent(const VariableEvent& event)
{
dataLog("seq#", static_cast<unsigned>(m_stream.size()), ":");
event.dump(WTF::dataFile());
dataLogLn(" ");
}
namespace {
struct MinifiedGenerationInfo {
bool filled; // true -> in gpr/fpr/pair, false -> spilled
bool alive;
VariableRepresentation u;
DataFormat format;
MinifiedGenerationInfo()
: filled(false)
, alive(false)
, format(DataFormatNone)
{
}
void update(const VariableEvent& event)
{
switch (event.kind()) {
case BirthToFill:
case Fill:
filled = true;
alive = true;
break;
case BirthToSpill:
case Spill:
filled = false;
alive = true;
break;
case Birth:
alive = true;
return;
case Death:
format = DataFormatNone;
alive = false;
return;
default:
return;
}
u = event.variableRepresentation();
format = event.dataFormat();
}
};
} // namespace
static bool tryToSetConstantRecovery(ValueRecovery& recovery, MinifiedNode* node)
{
if (!node)
return false;
if (node->hasConstant()) {
recovery = ValueRecovery::constant(node->constant());
return true;
}
if (node->isPhantomDirectArguments()) {
recovery = ValueRecovery::directArgumentsThatWereNotCreated(node->id());
return true;
}
if (node->isPhantomClonedArguments()) {
recovery = ValueRecovery::clonedArgumentsThatWereNotCreated(node->id());
return true;
}
return false;
}
template<VariableEventStream::ReconstructionStyle style>
unsigned VariableEventStream::reconstruct(
CodeBlock* codeBlock, CodeOrigin codeOrigin, MinifiedGraph& graph,
unsigned index, Operands<ValueRecovery>& valueRecoveries, Vector<UndefinedOperandSpan>* undefinedOperandSpans) const
{
constexpr bool verbose = false;
ASSERT(codeBlock->jitType() == JITType::DFGJIT);
CodeBlock* baselineCodeBlock = codeBlock->baselineVersion();
unsigned numVariables;
unsigned numTmps;
static constexpr unsigned invalidIndex = std::numeric_limits<unsigned>::max();
unsigned firstUndefined = invalidIndex;
bool firstUndefinedIsArgument = false;
auto flushUndefinedOperandSpan = [&] (unsigned i) {
if (firstUndefined == invalidIndex)
return;
int firstOffset = valueRecoveries.operandForIndex(firstUndefined).virtualRegister().offset();
int lastOffset = valueRecoveries.operandForIndex(i - 1).virtualRegister().offset();
int minOffset = std::min(firstOffset, lastOffset);
undefinedOperandSpans->append({ firstUndefined, minOffset, i - firstUndefined });
firstUndefined = invalidIndex;
};
auto recordUndefinedOperand = [&] (unsigned i) {
// We want to separate the span of arguments from the span of locals even if they have adjacent operands indexes.
if (firstUndefined != invalidIndex && firstUndefinedIsArgument != valueRecoveries.operandForIndex(i).isArgument())
flushUndefinedOperandSpan(i);
if (firstUndefined == invalidIndex) {
firstUndefined = i;
firstUndefinedIsArgument = valueRecoveries.operandForIndex(i).isArgument();
}
};
auto* inlineCallFrame = codeOrigin.inlineCallFrame();
if (inlineCallFrame) {
CodeBlock* codeBlock = baselineCodeBlockForInlineCallFrame(inlineCallFrame);
numVariables = codeBlock->numCalleeLocals() + VirtualRegister(inlineCallFrame->stackOffset).toLocal() + 1;
numTmps = codeBlock->numTmps() + inlineCallFrame->tmpOffset;
} else {
numVariables = baselineCodeBlock->numCalleeLocals();
numTmps = baselineCodeBlock->numTmps();
}
// Crazy special case: if we're at index == 0 then this must be an argument check
// failure, in which case all variables are already set up. The recoveries should
// reflect this.
if (!index) {
// We don't include tmps here because they can't be used yet.
valueRecoveries = Operands<ValueRecovery>(codeBlock->numParameters(), numVariables, 0);
for (size_t i = 0; i < valueRecoveries.size(); ++i) {
valueRecoveries[i] = ValueRecovery::displacedInJSStack(
valueRecoveries.operandForIndex(i).virtualRegister(), DataFormatJS);
}
return numVariables;
}
// Step 1: Find the last checkpoint, and figure out the number of virtual registers as we go.
unsigned startIndex = index - 1;
while (m_stream.at(startIndex).kind() != Reset)
startIndex--;
// Step 2: Create a mock-up of the DFG's state and execute the events.
Operands<ValueSource> operandSources(codeBlock->numParameters(), numVariables, numTmps);
for (unsigned i = operandSources.size(); i--;)
operandSources[i] = ValueSource(SourceIsDead);
UncheckedKeyHashMap<MinifiedID, MinifiedGenerationInfo> generationInfos;
for (unsigned i = startIndex; i < index; ++i) {
const VariableEvent& event = m_stream.at(i);
dataLogLnIf(verbose, "Processing event ", event);
switch (event.kind()) {
case Reset:
// nothing to do.
break;
case BirthToFill:
case BirthToSpill:
case Birth: {
MinifiedGenerationInfo info;
info.update(event);
generationInfos.add(event.id(), info);
break;
}
case Fill:
case Spill:
case Death: {
UncheckedKeyHashMap<MinifiedID, MinifiedGenerationInfo>::iterator iter = generationInfos.find(event.id());
ASSERT(iter != generationInfos.end());
iter->value.update(event);
break;
}
case MovHintEvent:
if (operandSources.hasOperand(event.operand()))
operandSources.setOperand(event.operand(), ValueSource(event.id()));
break;
case SetLocalEvent:
if (operandSources.hasOperand(event.operand()))
operandSources.setOperand(event.operand(), ValueSource::forDataFormat(event.machineRegister(), event.dataFormat()));
break;
default:
RELEASE_ASSERT_NOT_REACHED();
break;
}
}
dataLogLnIf(verbose, "Operand sources: ", operandSources);
// Step 3: Compute value recoveries!
valueRecoveries = Operands<ValueRecovery>(OperandsLike, operandSources);
for (unsigned i = 0; i < operandSources.size(); ++i) {
ValueSource& source = operandSources[i];
if (source.isTriviallyRecoverable()) {
valueRecoveries[i] = source.valueRecovery();
if (style == ReconstructionStyle::Separated) {
if (valueRecoveries[i].isConstant() && valueRecoveries[i].constant() == jsUndefined())
recordUndefinedOperand(i);
else
flushUndefinedOperandSpan(i);
}
continue;
}
ASSERT(source.kind() == HaveNode);
MinifiedNode* node = graph.at(source.id());
MinifiedGenerationInfo info = generationInfos.get(source.id());
if (!info.alive) {
dataLogLnIf(verbose, "Operand ", valueRecoveries.operandForIndex(i), " is dead.");
valueRecoveries[i] = ValueRecovery::constant(jsUndefined());
if (style == ReconstructionStyle::Separated)
recordUndefinedOperand(i);
continue;
}
if (tryToSetConstantRecovery(valueRecoveries[i], node)) {
dataLogLnIf(verbose, "Operand ", valueRecoveries.operandForIndex(i), " is constant.");
if (style == ReconstructionStyle::Separated) {
if (node->hasConstant() && node->constant() == jsUndefined())
recordUndefinedOperand(i);
else
flushUndefinedOperandSpan(i);
}
continue;
}
ASSERT(info.format != DataFormatNone);
if (style == ReconstructionStyle::Separated)
flushUndefinedOperandSpan(i);
if (info.filled) {
if (info.format == DataFormatDouble) {
valueRecoveries[i] = ValueRecovery::inFPR(info.u.fpr, DataFormatDouble);
continue;
}
#if USE(JSVALUE32_64)
if (info.format & DataFormatJS) {
valueRecoveries[i] = ValueRecovery::inPair(info.u.pair.tagGPR, info.u.pair.payloadGPR);
continue;
}
#endif
valueRecoveries[i] = ValueRecovery::inGPR(info.u.gpr, info.format);
continue;
}
valueRecoveries[i] =
ValueRecovery::displacedInJSStack(info.u.operand.virtualRegister(), info.format);
}
if (style == ReconstructionStyle::Separated)
flushUndefinedOperandSpan(operandSources.size());
return numVariables;
}
unsigned VariableEventStream::reconstruct(
CodeBlock* codeBlock, CodeOrigin codeOrigin, MinifiedGraph& graph,
unsigned index, Operands<ValueRecovery>& valueRecoveries) const
{
return reconstruct<ReconstructionStyle::Combined>(codeBlock, codeOrigin, graph, index, valueRecoveries, nullptr);
}
unsigned VariableEventStream::reconstruct(
CodeBlock* codeBlock, CodeOrigin codeOrigin, MinifiedGraph& graph,
unsigned index, Operands<ValueRecovery>& valueRecoveries, Vector<UndefinedOperandSpan>* undefinedOperandSpans) const
{
return reconstruct<ReconstructionStyle::Separated>(codeBlock, codeOrigin, graph, index, valueRecoveries, undefinedOperandSpans);
}
} } // namespace JSC::DFG
#endif // ENABLE(DFG_JIT)
|