-
Notifications
You must be signed in to change notification settings - Fork 2k
Expand file tree
/
Copy pathCLoopStack.h
More file actions
125 lines (99 loc) · 4.56 KB
/
CLoopStack.h
File metadata and controls
125 lines (99 loc) · 4.56 KB
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
/*
* Copyright (C) 2008-2025 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 <wtf/Platform.h>
#if ENABLE(C_LOOP)
#include <JavaScriptCore/Register.h>
#include <wtf/Noncopyable.h>
#include <wtf/PageReservation.h>
namespace JSC {
class CodeBlockSet;
class ConservativeRoots;
class JITStubRoutineSet;
class StackManager;
class VM;
class LLIntOffsetsExtractor;
class CLoopStack {
WTF_MAKE_NONCOPYABLE(CLoopStack);
public:
// Allow 8k of excess registers before we start trying to reap the stack
static constexpr ptrdiff_t maxExcessCapacity = 8 * 1024;
CLoopStack();
~CLoopStack();
bool ensureCapacityFor(Register* newTopOfStack);
bool containsAddress(Register* address) { return (lowAddress() <= address && address < highAddress()); }
static size_t committedByteCount();
void gatherConservativeRoots(ConservativeRoots&, JITStubRoutineSet&, CodeBlockSet&);
void sanitizeStack();
inline void* currentStackPointer() const
{
// One might be tempted to assert that m_currentStackPointer <= m_topCallFrame->topOfFrame()
// here. That assertion would be incorrect because this function may be called from function
// prologues (e.g. during a stack check) where m_currentStackPointer may be higher than
// m_topCallFrame->topOfFrame() because the stack pointer has not been initialized to point
// to frame top yet.
return m_currentStackPointer;
}
void setCurrentStackPointer(void* sp) { m_currentStackPointer = sp; }
size_t size() const { return highAddress() - lowAddress(); }
void setSoftReservedZoneSize(size_t);
bool isSafeToRecurse() const;
private:
StackManager& stackManager() const;
VM& vm() const;
Register* lowAddress() const
{
return m_end;
}
WTF_ALLOW_UNSAFE_BUFFER_USAGE_BEGIN
Register* highAddress() const
{
return reinterpret_cast_ptr<Register*>(static_cast<char*>(m_reservation.base()) + m_reservation.size());
}
WTF_ALLOW_UNSAFE_BUFFER_USAGE_END
Register* reservationTop() const
{
char* reservationTop = static_cast<char*>(m_reservation.base());
return reinterpret_cast_ptr<Register*>(reservationTop);
}
bool grow(Register* newTopOfStack);
void releaseExcessCapacity();
void addToCommittedByteCount(long);
void setCLoopStackLimit(Register* newTopOfStack);
// The following is always true:
// reservationTop() <= m_commitTop <= m_end <= m_currentStackPointer <= highAddress()
Register* m_end; // lowest address of JS allocatable stack memory.
Register* m_commitTop; // lowest address of committed memory.
PageReservation m_reservation;
void* m_lastStackPointer;
void* m_currentStackPointer;
ptrdiff_t m_softReservedZoneSizeInRegisters;
friend class LLIntOffsetsExtractor;
};
} // namespace JSC
#endif // ENABLE(C_LOOP)