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 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326 327 328 329 330 331 332 333
|
/*
* Copyright (C) 2011, 2012, 2013 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.
*/
#ifndef DFGVariableAccessData_h
#define DFGVariableAccessData_h
#include "DFGDoubleFormatState.h"
#include "DFGNodeFlags.h"
#include "Operands.h"
#include "SpeculatedType.h"
#include "VirtualRegister.h"
#include <wtf/Platform.h>
#include <wtf/UnionFind.h>
#include <wtf/Vector.h>
namespace JSC { namespace DFG {
enum DoubleBallot { VoteValue, VoteDouble };
class VariableAccessData : public UnionFind<VariableAccessData> {
public:
VariableAccessData()
: m_local(static_cast<VirtualRegister>(std::numeric_limits<int>::min()))
, m_prediction(SpecNone)
, m_argumentAwarePrediction(SpecNone)
, m_flags(0)
, m_isCaptured(false)
, m_shouldNeverUnbox(false)
, m_isArgumentsAlias(false)
, m_structureCheckHoistingFailed(false)
, m_isProfitableToUnbox(false)
, m_isLoadedFrom(false)
, m_doubleFormatState(EmptyDoubleFormatState)
{
clearVotes();
}
VariableAccessData(VirtualRegister local, bool isCaptured)
: m_local(local)
, m_prediction(SpecNone)
, m_argumentAwarePrediction(SpecNone)
, m_flags(0)
, m_isCaptured(isCaptured)
, m_shouldNeverUnbox(isCaptured)
, m_isArgumentsAlias(false)
, m_structureCheckHoistingFailed(false)
, m_isProfitableToUnbox(false)
, m_doubleFormatState(EmptyDoubleFormatState)
{
clearVotes();
}
VirtualRegister local()
{
ASSERT(m_local == find()->m_local);
return m_local;
}
int operand()
{
return static_cast<int>(local());
}
bool mergeIsCaptured(bool isCaptured)
{
return checkAndSet(m_shouldNeverUnbox, m_shouldNeverUnbox | isCaptured)
| checkAndSet(m_isCaptured, m_isCaptured | isCaptured);
}
bool isCaptured()
{
return m_isCaptured;
}
bool mergeIsProfitableToUnbox(bool isProfitableToUnbox)
{
return checkAndSet(m_isProfitableToUnbox, m_isProfitableToUnbox | isProfitableToUnbox);
}
bool isProfitableToUnbox()
{
return m_isProfitableToUnbox;
}
bool mergeShouldNeverUnbox(bool shouldNeverUnbox)
{
bool newShouldNeverUnbox = m_shouldNeverUnbox | shouldNeverUnbox;
if (newShouldNeverUnbox == m_shouldNeverUnbox)
return false;
m_shouldNeverUnbox = newShouldNeverUnbox;
return true;
}
// Returns true if it would be unsound to store the value in an unboxed fashion.
// If this returns false, it simply means that it is sound to unbox; it doesn't
// mean that we have actually done so.
bool shouldNeverUnbox()
{
ASSERT(!(m_isCaptured && !m_shouldNeverUnbox));
return m_shouldNeverUnbox;
}
// Returns true if we should be unboxing the value provided that the predictions
// and double format vote say so. This may return false even if shouldNeverUnbox()
// returns false, since this incorporates heuristics of profitability.
bool shouldUnboxIfPossible()
{
return !shouldNeverUnbox() && isProfitableToUnbox();
}
bool mergeStructureCheckHoistingFailed(bool failed)
{
return checkAndSet(m_structureCheckHoistingFailed, m_structureCheckHoistingFailed | failed);
}
bool structureCheckHoistingFailed()
{
return m_structureCheckHoistingFailed;
}
bool mergeIsArgumentsAlias(bool isArgumentsAlias)
{
return checkAndSet(m_isArgumentsAlias, m_isArgumentsAlias | isArgumentsAlias);
}
bool isArgumentsAlias()
{
return m_isArgumentsAlias;
}
bool mergeIsLoadedFrom(bool isLoadedFrom)
{
return checkAndSet(m_isLoadedFrom, m_isLoadedFrom | isLoadedFrom);
}
void setIsLoadedFrom(bool isLoadedFrom)
{
m_isLoadedFrom = isLoadedFrom;
}
bool isLoadedFrom()
{
return m_isLoadedFrom;
}
bool predict(SpeculatedType prediction)
{
VariableAccessData* self = find();
bool result = mergeSpeculation(self->m_prediction, prediction);
if (result)
mergeSpeculation(m_argumentAwarePrediction, m_prediction);
return result;
}
SpeculatedType nonUnifiedPrediction()
{
return m_prediction;
}
SpeculatedType prediction()
{
return find()->m_prediction;
}
SpeculatedType argumentAwarePrediction()
{
return find()->m_argumentAwarePrediction;
}
bool mergeArgumentAwarePrediction(SpeculatedType prediction)
{
return mergeSpeculation(find()->m_argumentAwarePrediction, prediction);
}
void clearVotes()
{
ASSERT(find() == this);
m_votes[0] = 0;
m_votes[1] = 0;
}
void vote(unsigned ballot)
{
ASSERT(ballot < 2);
m_votes[ballot]++;
}
double voteRatio()
{
ASSERT(find() == this);
return static_cast<double>(m_votes[1]) / m_votes[0];
}
bool shouldUseDoubleFormatAccordingToVote()
{
// We don't support this facility for arguments, yet.
// FIXME: make this work for arguments.
if (operandIsArgument(operand()))
return false;
// If the variable is not a number prediction, then this doesn't
// make any sense.
if (!isNumberSpeculation(prediction())) {
// FIXME: we may end up forcing a local in inlined argument position to be a double even
// if it is sometimes not even numeric, since this never signals the fact that it doesn't
// want doubles. https://bugs.webkit.org/show_bug.cgi?id=109511
return false;
}
// If the variable is predicted to hold only doubles, then it's a
// no-brainer: it should be formatted as a double.
if (isDoubleSpeculation(prediction()))
return true;
// If the variable is known to be used as an integer, then be safe -
// don't force it to be a double.
if (flags() & NodeUsedAsInt)
return false;
// If the variable has been voted to become a double, then make it a
// double.
if (voteRatio() >= Options::doubleVoteRatioForDoubleFormat())
return true;
return false;
}
DoubleFormatState doubleFormatState()
{
return find()->m_doubleFormatState;
}
bool shouldUseDoubleFormat()
{
ASSERT(isRoot());
bool doubleState = m_doubleFormatState == UsingDoubleFormat;
ASSERT(!(doubleState && shouldNeverUnbox()));
ASSERT(!(doubleState && isCaptured()));
return doubleState && isProfitableToUnbox();
}
bool tallyVotesForShouldUseDoubleFormat()
{
ASSERT(isRoot());
if (operandIsArgument(local()) || shouldNeverUnbox())
return DFG::mergeDoubleFormatState(m_doubleFormatState, NotUsingDoubleFormat);
if (m_doubleFormatState == CantUseDoubleFormat)
return false;
bool newValueOfShouldUseDoubleFormat = shouldUseDoubleFormatAccordingToVote();
if (!newValueOfShouldUseDoubleFormat) {
// We monotonically convert to double. Hence, if the fixpoint leads us to conclude that we should
// switch back to int, we instead ignore this and stick with double.
return false;
}
if (m_doubleFormatState == UsingDoubleFormat)
return false;
return DFG::mergeDoubleFormatState(m_doubleFormatState, UsingDoubleFormat);
}
bool mergeDoubleFormatState(DoubleFormatState doubleFormatState)
{
return DFG::mergeDoubleFormatState(find()->m_doubleFormatState, doubleFormatState);
}
bool makePredictionForDoubleFormat()
{
ASSERT(isRoot());
if (m_doubleFormatState != UsingDoubleFormat)
return false;
return mergeSpeculation(m_prediction, SpecDouble);
}
NodeFlags flags() const { return m_flags; }
bool mergeFlags(NodeFlags newFlags)
{
return checkAndSet(m_flags, m_flags | newFlags);
}
private:
// This is slightly space-inefficient, since anything we're unified with
// will have the same operand and should have the same prediction. But
// putting them here simplifies the code, and we don't expect DFG space
// usage for variable access nodes do be significant.
VirtualRegister m_local;
SpeculatedType m_prediction;
SpeculatedType m_argumentAwarePrediction;
NodeFlags m_flags;
bool m_isCaptured;
bool m_shouldNeverUnbox;
bool m_isArgumentsAlias;
bool m_structureCheckHoistingFailed;
bool m_isProfitableToUnbox;
bool m_isLoadedFrom;
float m_votes[2]; // Used primarily for double voting but may be reused for other purposes.
DoubleFormatState m_doubleFormatState;
};
} } // namespace JSC::DFG
#endif // DFGVariableAccessData_h
|