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
|
/*
* Copyright (C) 2011-2023 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.
* 3. Neither the name of Apple Inc. ("Apple") nor the names of
* its contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
*
* THIS SOFTWARE IS PROVIDED BY APPLE AND ITS CONTRIBUTORS "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 OR ITS 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.
*/
#pragma once
#include "ConcurrentJSLock.h"
#include "SpeculatedType.h"
#include "Structure.h"
#include "VirtualRegister.h"
#include <span>
#include <wtf/PrintStream.h>
#include <wtf/StringPrintStream.h>
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
namespace JSC {
class UnlinkedValueProfile;
template<unsigned numberOfBucketsArgument, unsigned numberOfSpecFailBucketsArgument>
struct ValueProfileBase {
friend class UnlinkedValueProfile;
static constexpr unsigned numberOfBuckets = numberOfBucketsArgument;
static constexpr unsigned numberOfSpecFailBuckets = numberOfSpecFailBucketsArgument;
static constexpr unsigned totalNumberOfBuckets = numberOfBuckets + numberOfSpecFailBuckets;
ValueProfileBase()
{
clearBuckets();
}
EncodedJSValue* specFailBucket(unsigned i)
{
ASSERT(numberOfBuckets + i < totalNumberOfBuckets);
return m_buckets + numberOfBuckets + i;
}
void clearBuckets()
{
for (unsigned i = 0; i < totalNumberOfBuckets; ++i)
clearEncodedJSValueConcurrent(m_buckets[i]);
}
const ClassInfo* classInfo(unsigned bucket) const
{
JSValue value = JSValue::decodeConcurrent(&m_buckets[bucket]);
if (!!value) {
if (!value.isCell())
return nullptr;
return value.asCell()->classInfo();
}
return nullptr;
}
unsigned numberOfSamples() const
{
unsigned result = 0;
for (unsigned i = 0; i < totalNumberOfBuckets; ++i) {
if (!!JSValue::decodeConcurrent(&m_buckets[i]))
result++;
}
return result;
}
unsigned totalNumberOfSamples() const
{
return numberOfSamples() + isSampledBefore();
}
bool isSampledBefore() const { return m_prediction != SpecNone; }
bool isLive() const
{
for (unsigned i = 0; i < totalNumberOfBuckets; ++i) {
if (!!JSValue::decodeConcurrent(&m_buckets[i]))
return true;
}
return false;
}
CString briefDescription(const ConcurrentJSLocker& locker)
{
SpeculatedType prediction = computeUpdatedPrediction(locker);
StringPrintStream out;
out.print("predicting ", SpeculationDump(prediction));
return out.toCString();
}
void dump(PrintStream& out)
{
out.print("sampled before = ", isSampledBefore(), " live samples = ", numberOfSamples(), " prediction = ", SpeculationDump(m_prediction));
bool first = true;
for (unsigned i = 0; i < totalNumberOfBuckets; ++i) {
JSValue value = JSValue::decode(m_buckets[i]);
if (!!value) {
if (first) {
out.printf(": ");
first = false;
} else
out.printf(", ");
out.print(value);
}
}
}
SpeculatedType computeUpdatedPrediction(const ConcurrentJSLocker&)
{
SpeculatedType merged = SpecNone;
for (unsigned i = 0; i < totalNumberOfBuckets; ++i) {
JSValue value = JSValue::decodeConcurrent(&m_buckets[i]);
if (!value)
continue;
mergeSpeculation(merged, speculationFromValue(value));
updateEncodedJSValueConcurrent(m_buckets[i], JSValue::encode(JSValue()));
}
mergeSpeculation(m_prediction, merged);
return m_prediction;
}
void computeUpdatedPredictionForExtraValue(const ConcurrentJSLocker&, JSValue& value)
{
if (value)
mergeSpeculation(m_prediction, speculationFromValue(value));
value = JSValue();
}
EncodedJSValue m_buckets[totalNumberOfBuckets];
SpeculatedType m_prediction { SpecNone };
};
struct MinimalValueProfile : public ValueProfileBase<0, 1> {
MinimalValueProfile(): ValueProfileBase<0, 1>() { }
};
struct ValueProfile : public ValueProfileBase<1, 0> {
ValueProfile() : ValueProfileBase<1, 0>() { }
static constexpr ptrdiff_t offsetOfFirstBucket() { return OBJECT_OFFSETOF(ValueProfile, m_buckets[0]); }
};
struct ArgumentValueProfile : public ValueProfileBase<1, 1> {
ArgumentValueProfile() : ValueProfileBase<1, 1>() { }
static constexpr ptrdiff_t offsetOfFirstBucket() { return OBJECT_OFFSETOF(ValueProfile, m_buckets[0]); }
};
struct ValueProfileAndVirtualRegister : public ValueProfile {
VirtualRegister m_operand;
};
static_assert(sizeof(ValueProfileAndVirtualRegister) >= sizeof(unsigned));
class alignas(ValueProfileAndVirtualRegister) ValueProfileAndVirtualRegisterBuffer final {
WTF_MAKE_NONCOPYABLE(ValueProfileAndVirtualRegisterBuffer);
public:
static ValueProfileAndVirtualRegisterBuffer* create(unsigned size)
{
void* buffer = VMMalloc::malloc(sizeof(ValueProfileAndVirtualRegisterBuffer) + size * sizeof(ValueProfileAndVirtualRegister));
return new (buffer) ValueProfileAndVirtualRegisterBuffer(size);
}
static void destroy(ValueProfileAndVirtualRegisterBuffer* buffer)
{
buffer->~ValueProfileAndVirtualRegisterBuffer();
VMMalloc::free(buffer);
}
template <typename Function>
void forEach(Function function)
{
for (unsigned i = 0; i < m_size; ++i)
function(data()[i]);
}
unsigned size() const { return m_size; }
ValueProfileAndVirtualRegister* data() const
{
return std::bit_cast<ValueProfileAndVirtualRegister*>(this + 1);
}
std::span<ValueProfileAndVirtualRegister> span() { return { data(), size() }; }
private:
ValueProfileAndVirtualRegisterBuffer(unsigned size)
: m_size(size)
{
// FIXME: ValueProfile has more stuff than we need. We could optimize these value profiles
// to be more space efficient.
// https://bugs.webkit.org/show_bug.cgi?id=175413
for (unsigned i = 0; i < m_size; ++i)
new (&data()[i]) ValueProfileAndVirtualRegister();
}
~ValueProfileAndVirtualRegisterBuffer()
{
for (unsigned i = 0; i < m_size; ++i)
data()[i].~ValueProfileAndVirtualRegister();
}
unsigned m_size;
};
class UnlinkedValueProfile {
public:
UnlinkedValueProfile() = default;
void update(ValueProfile& profile)
{
SpeculatedType newType = profile.m_prediction | m_prediction;
profile.m_prediction = newType;
m_prediction = newType;
}
void update(ArgumentValueProfile& profile)
{
SpeculatedType newType = profile.m_prediction | m_prediction;
profile.m_prediction = newType;
m_prediction = newType;
}
private:
SpeculatedType m_prediction { SpecNone };
};
} // namespace JSC
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
|