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
|
/*
* Copyright (C) 2008, 2009, 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.
* 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 JSStack_h
#define JSStack_h
#include "ExecutableAllocator.h"
#include "Register.h"
#include <wtf/Noncopyable.h>
#include <wtf/PageReservation.h>
#include <wtf/VMTags.h>
#define ENABLE_DEBUG_JSSTACK 0
#if !defined(NDEBUG) && !defined(ENABLE_DEBUG_JSSTACK)
#define ENABLE_DEBUG_JSSTACK 1
#endif
namespace JSC {
class CodeBlockSet;
class ConservativeRoots;
class ExecState;
class JITStubRoutineSet;
class VM;
class LLIntOffsetsExtractor;
struct Instruction;
typedef ExecState CallFrame;
struct CallerFrameAndPC {
CallFrame* callerFrame;
Instruction* pc;
};
class JSStack {
WTF_MAKE_NONCOPYABLE(JSStack);
public:
enum CallFrameHeaderEntry {
CodeBlock = sizeof(CallerFrameAndPC) / sizeof(Register),
ScopeChain,
Callee,
ArgumentCount,
CallFrameHeaderSize,
// The following entries are not part of the CallFrameHeader but are provided here as a convenience:
ThisArgument = CallFrameHeaderSize,
FirstArgument,
};
static const size_t defaultCapacity = 512 * 1024;
static const size_t commitSize = 16 * 1024;
// Allow 8k of excess registers before we start trying to reap the stack
static const ptrdiff_t maxExcessCapacity = 8 * 1024;
JSStack(VM&, size_t capacity = defaultCapacity);
~JSStack();
void gatherConservativeRoots(ConservativeRoots&);
void gatherConservativeRoots(ConservativeRoots&, JITStubRoutineSet&, CodeBlockSet&);
Register* getBaseOfStack() const
{
return highAddress() - 1;
}
size_t size() const { return highAddress() - lowAddress(); }
bool grow(Register*);
static size_t committedByteCount();
static void initializeThreading();
Register* getTopOfFrame(CallFrame*);
Register* getStartOfFrame(CallFrame*);
Register* getTopOfStack();
bool entryCheck(class CodeBlock*, int);
CallFrame* pushFrame(class CodeBlock*, JSScope*, int argsCount, JSObject* callee);
void popFrame(CallFrame*);
bool containsAddress(Register* address) { return (lowAddress() <= address && address <= highAddress()); }
void enableErrorStackReserve();
void disableErrorStackReserve();
#if ENABLE(DEBUG_JSSTACK)
void installFence(CallFrame*, const char *function = "", int lineNo = 0);
void validateFence(CallFrame*, const char *function = "", int lineNo = 0);
static const int FenceSize = 4;
#else // !ENABLE(DEBUG_JSSTACK)
void installFence(CallFrame*, const char* = "", int = 0) { }
void validateFence(CallFrame*, const char* = "", int = 0) { }
#endif // !ENABLE(DEBUG_JSSTACK)
private:
Register* lowAddress() const
{
return m_end;
}
Register* highAddress() const
{
return reinterpret_cast_ptr<Register*>(static_cast<char*>(m_reservation.base()) + m_reservation.size());
}
Register* reservationEnd() const
{
char* reservationEnd = static_cast<char*>(m_reservation.base());
return reinterpret_cast_ptr<Register*>(reservationEnd);
}
#if ENABLE(DEBUG_JSSTACK)
static JSValue generateFenceValue(size_t argIndex);
void installTrapsAfterFrame(CallFrame*);
#else
void installTrapsAfterFrame(CallFrame*) { }
#endif
bool growSlowCase(Register*);
void shrink(Register*);
void releaseExcessCapacity();
void addToCommittedByteCount(long);
void updateStackLimit(Register* newEnd);
VM& m_vm;
Register* m_end;
Register* m_commitEnd;
Register* m_useableEnd;
PageReservation m_reservation;
CallFrame*& m_topCallFrame;
friend class LLIntOffsetsExtractor;
};
} // namespace JSC
#endif // JSStack_h
|
