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
|
/*
* Copyright (C) 2012 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 LazyOperandValueProfile_h
#define LazyOperandValueProfile_h
#include <wtf/Platform.h>
#if ENABLE(VALUE_PROFILER)
#include "ValueProfile.h"
#include <wtf/HashMap.h>
#include <wtf/Noncopyable.h>
#include <wtf/OwnPtr.h>
#include <wtf/SegmentedVector.h>
namespace JSC {
class ScriptExecutable;
class LazyOperandValueProfileKey {
public:
LazyOperandValueProfileKey()
: m_bytecodeOffset(0) // 0 = empty value
, m_operand(-1) // not a valid operand index in our current scheme
{
}
LazyOperandValueProfileKey(WTF::HashTableDeletedValueType)
: m_bytecodeOffset(1) // 1 = deleted value
, m_operand(-1) // not a valid operand index in our current scheme
{
}
LazyOperandValueProfileKey(unsigned bytecodeOffset, int operand)
: m_bytecodeOffset(bytecodeOffset)
, m_operand(operand)
{
ASSERT(operand != -1);
}
bool operator!() const
{
return m_operand == -1;
}
bool operator==(const LazyOperandValueProfileKey& other) const
{
return m_bytecodeOffset == other.m_bytecodeOffset
&& m_operand == other.m_operand;
}
unsigned hash() const
{
return WTF::intHash(m_bytecodeOffset) + m_operand;
}
unsigned bytecodeOffset() const
{
ASSERT(!!*this);
return m_bytecodeOffset;
}
int operand() const
{
ASSERT(!!*this);
return m_operand;
}
bool isHashTableDeletedValue() const
{
return m_operand == -1 && m_bytecodeOffset;
}
private:
unsigned m_bytecodeOffset;
int m_operand;
};
struct LazyOperandValueProfileKeyHash {
static unsigned hash(const LazyOperandValueProfileKey& key) { return key.hash(); }
static bool equal(
const LazyOperandValueProfileKey& a,
const LazyOperandValueProfileKey& b) { return a == b; }
static const bool safeToCompareToEmptyOrDeleted = true;
};
} // namespace JSC
namespace WTF {
template<typename T> struct DefaultHash;
template<> struct DefaultHash<JSC::LazyOperandValueProfileKey> {
typedef JSC::LazyOperandValueProfileKeyHash Hash;
};
template<typename T> struct HashTraits;
template<> struct HashTraits<JSC::LazyOperandValueProfileKey> : public GenericHashTraits<JSC::LazyOperandValueProfileKey> {
static void constructDeletedValue(JSC::LazyOperandValueProfileKey& slot) { new (NotNull, &slot) JSC::LazyOperandValueProfileKey(HashTableDeletedValue); }
static bool isDeletedValue(const JSC::LazyOperandValueProfileKey& value) { return value.isHashTableDeletedValue(); }
};
} // namespace WTF
namespace JSC {
struct LazyOperandValueProfile : public MinimalValueProfile {
LazyOperandValueProfile()
: MinimalValueProfile()
, m_operand(-1)
{
}
explicit LazyOperandValueProfile(const LazyOperandValueProfileKey& key)
: MinimalValueProfile(key.bytecodeOffset())
, m_operand(key.operand())
{
}
LazyOperandValueProfileKey key() const
{
return LazyOperandValueProfileKey(m_bytecodeOffset, m_operand);
}
int m_operand;
typedef SegmentedVector<LazyOperandValueProfile, 8> List;
};
class LazyOperandValueProfileParser;
class CompressedLazyOperandValueProfileHolder {
WTF_MAKE_NONCOPYABLE(CompressedLazyOperandValueProfileHolder);
public:
CompressedLazyOperandValueProfileHolder();
~CompressedLazyOperandValueProfileHolder();
void computeUpdatedPredictions(OperationInProgress);
LazyOperandValueProfile* add(const LazyOperandValueProfileKey& key);
private:
friend class LazyOperandValueProfileParser;
OwnPtr<LazyOperandValueProfile::List> m_data;
};
class LazyOperandValueProfileParser {
WTF_MAKE_NONCOPYABLE(LazyOperandValueProfileParser);
public:
explicit LazyOperandValueProfileParser(
CompressedLazyOperandValueProfileHolder& holder);
~LazyOperandValueProfileParser();
LazyOperandValueProfile* getIfPresent(
const LazyOperandValueProfileKey& key) const;
SpeculatedType prediction(const LazyOperandValueProfileKey& key) const;
private:
CompressedLazyOperandValueProfileHolder& m_holder;
HashMap<LazyOperandValueProfileKey, LazyOperandValueProfile*> m_map;
};
} // namespace JSC
#endif // ENABLE(VALUE_PROFILER)
#endif // LazyOperandValueProfile_h
|
