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
|
/*
* Copyright (C) 2008 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 Computer, 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.
*/
#ifndef SamplingTool_h
#define SamplingTool_h
#include <wtf/Assertions.h>
#include <wtf/HashMap.h>
#include <wtf/Threading.h>
#include "Nodes.h"
#include "Opcode.h"
namespace JSC {
class CodeBlock;
class ExecState;
class Interpreter;
class ScopeNode;
struct Instruction;
struct ScopeSampleRecord {
ScopeSampleRecord(ScopeNode* scope)
: m_scope(scope)
, m_codeBlock(0)
, m_sampleCount(0)
, m_opcodeSampleCount(0)
, m_samples(0)
, m_size(0)
{
}
~ScopeSampleRecord()
{
if (m_samples)
free(m_samples);
}
void sample(CodeBlock*, Instruction*);
RefPtr<ScopeNode> m_scope;
CodeBlock* m_codeBlock;
int m_sampleCount;
int m_opcodeSampleCount;
int* m_samples;
unsigned m_size;
};
typedef WTF::HashMap<ScopeNode*, ScopeSampleRecord*> ScopeSampleRecordMap;
class SamplingTool {
public:
friend class CallRecord;
friend class HostCallRecord;
#if ENABLE(OPCODE_SAMPLING)
class CallRecord : Noncopyable {
public:
CallRecord(SamplingTool* samplingTool)
: m_samplingTool(samplingTool)
, m_savedSample(samplingTool->m_sample)
, m_savedCodeBlock(samplingTool->m_codeBlock)
{
}
~CallRecord()
{
m_samplingTool->m_sample = m_savedSample;
m_samplingTool->m_codeBlock = m_savedCodeBlock;
}
private:
SamplingTool* m_samplingTool;
intptr_t m_savedSample;
CodeBlock* m_savedCodeBlock;
};
class HostCallRecord : public CallRecord {
public:
HostCallRecord(SamplingTool* samplingTool)
: CallRecord(samplingTool)
{
samplingTool->m_sample |= 0x1;
}
};
#else
class CallRecord : Noncopyable {
public:
CallRecord(SamplingTool*)
{
}
};
class HostCallRecord : public CallRecord {
public:
HostCallRecord(SamplingTool* samplingTool)
: CallRecord(samplingTool)
{
}
};
#endif
SamplingTool(Interpreter* interpreter)
: m_interpreter(interpreter)
, m_running(false)
, m_codeBlock(0)
, m_sample(0)
, m_sampleCount(0)
, m_opcodeSampleCount(0)
, m_scopeSampleMap(new ScopeSampleRecordMap())
{
memset(m_opcodeSamples, 0, sizeof(m_opcodeSamples));
memset(m_opcodeSamplesInCTIFunctions, 0, sizeof(m_opcodeSamplesInCTIFunctions));
}
~SamplingTool()
{
deleteAllValues(*m_scopeSampleMap);
}
void start(unsigned hertz=10000);
void stop();
void dump(ExecState*);
void notifyOfScope(ScopeNode* scope);
void sample(CodeBlock* codeBlock, Instruction* vPC)
{
ASSERT(!(reinterpret_cast<intptr_t>(vPC) & 0x3));
m_codeBlock = codeBlock;
m_sample = reinterpret_cast<intptr_t>(vPC);
}
CodeBlock** codeBlockSlot() { return &m_codeBlock; }
intptr_t* sampleSlot() { return &m_sample; }
unsigned encodeSample(Instruction* vPC, bool inCTIFunction = false, bool inHostFunction = false)
{
ASSERT(!(reinterpret_cast<intptr_t>(vPC) & 0x3));
return reinterpret_cast<intptr_t>(vPC) | (static_cast<intptr_t>(inCTIFunction) << 1) | static_cast<intptr_t>(inHostFunction);
}
private:
class Sample {
public:
Sample(volatile intptr_t sample, CodeBlock* volatile codeBlock)
: m_sample(sample)
, m_codeBlock(codeBlock)
{
}
bool isNull() { return !m_sample || !m_codeBlock; }
CodeBlock* codeBlock() { return m_codeBlock; }
Instruction* vPC() { return reinterpret_cast<Instruction*>(m_sample & ~0x3); }
bool inHostFunction() { return m_sample & 0x1; }
bool inCTIFunction() { return m_sample & 0x2; }
private:
intptr_t m_sample;
CodeBlock* m_codeBlock;
};
static void* threadStartFunc(void*);
void run();
Interpreter* m_interpreter;
// Sampling thread state.
bool m_running;
unsigned m_hertz;
ThreadIdentifier m_samplingThread;
// State tracked by the main thread, used by the sampling thread.
CodeBlock* m_codeBlock;
intptr_t m_sample;
// Gathered sample data.
long long m_sampleCount;
long long m_opcodeSampleCount;
unsigned m_opcodeSamples[numOpcodeIDs];
unsigned m_opcodeSamplesInCTIFunctions[numOpcodeIDs];
Mutex m_scopeSampleMapMutex;
OwnPtr<ScopeSampleRecordMap> m_scopeSampleMap;
};
} // namespace JSC
#endif // SamplingTool_h
|
