Repository navigation
Expand file tree
/
Copy pathProbeStack.cpp
More file actions
134 lines (118 loc) · 4.54 KB
/
Copy pathProbeStack.cpp
File metadata and controls
134 lines (118 loc) · 4.54 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
126
127
128
129
130
131
132
133
134
/*
* Copyright (C) 2017 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.
*/
#include "config.h"
#include "ProbeStack.h"
#include <memory>
#include <wtf/StdLibExtras.h>
#if ENABLE(MASM_PROBE)
namespace JSC {
namespace Probe {
#if ASAN_ENABLED
// FIXME: we should consider using the copy function for both ASan and non-ASan builds.
// https://bugs.webkit.org/show_bug.cgi?id=176961
SUPPRESS_ASAN
static void copyStackPage(void* dst, void* src, size_t size)
{
ASSERT(roundUpToMultipleOf<sizeof(uintptr_t)>(dst) == dst);
ASSERT(roundUpToMultipleOf<sizeof(uintptr_t)>(src) == src);
uintptr_t* dstPointer = reinterpret_cast<uintptr_t*>(dst);
uintptr_t* srcPointer = reinterpret_cast<uintptr_t*>(src);
for (; size; size -= sizeof(uintptr_t))
*dstPointer++ = *srcPointer++;
}
#else
#define copyStackPage(dst, src, size) std::memcpy(dst, src, size);
#endif
Page::Page(void* baseAddress)
: m_baseLogicalAddress(baseAddress)
, m_physicalAddressOffset(reinterpret_cast<uint8_t*>(&m_buffer) - reinterpret_cast<uint8_t*>(baseAddress))
{
copyStackPage(&m_buffer, baseAddress, s_pageSize);
}
void Page::flushWrites()
{
uint64_t dirtyBits = m_dirtyBits;
size_t offset = 0;
while (dirtyBits) {
// Find start.
if (dirtyBits & 1) {
size_t startOffset = offset;
// Find end.
do {
dirtyBits = dirtyBits >> 1;
offset += s_chunkSize;
} while (dirtyBits & 1);
size_t size = offset - startOffset;
uint8_t* src = reinterpret_cast<uint8_t*>(&m_buffer) + startOffset;
uint8_t* dst = reinterpret_cast<uint8_t*>(m_baseLogicalAddress) + startOffset;
copyStackPage(dst, src, size);
}
dirtyBits = dirtyBits >> 1;
offset += s_chunkSize;
}
m_dirtyBits = 0;
}
Stack::Stack(Stack&& other)
: m_newStackPointer(other.m_newStackPointer)
, m_lowWatermark(other.m_lowWatermark)
, m_stackBounds(WTFMove(other.m_stackBounds))
, m_pages(WTFMove(other.m_pages))
{
#if !ASSERT_DISABLED
other.m_isValid = false;
#endif
}
bool Stack::hasWritesToFlush()
{
return std::any_of(m_pages.begin(), m_pages.end(), [] (auto& it) { return it.value->hasWritesToFlush(); });
}
void Stack::flushWrites()
{
for (auto it = m_pages.begin(); it != m_pages.end(); ++it)
it->value->flushWritesIfNeeded();
}
Page* Stack::ensurePageFor(void* address)
{
// Since the machine stack is always allocated in units of whole pages, asserting
// that the address is contained in the stack is sufficient to infer that its page
// is also contained in the stack.
RELEASE_ASSERT(m_stackBounds.contains(address));
// We may have gotten here because of a cache miss. So, look up the page first
// before allocating a new one,
void* baseAddress = Page::baseAddressFor(address);
auto it = m_pages.find(baseAddress);
if (LIKELY(it != m_pages.end()))
m_lastAccessedPage = it->value.get();
else {
std::unique_ptr<Page> page = std::make_unique<Page>(baseAddress);
auto result = m_pages.add(baseAddress, WTFMove(page));
m_lastAccessedPage = result.iterator->value.get();
}
m_lastAccessedPageBaseAddress = baseAddress;
return m_lastAccessedPage;
}
} // namespace Probe
} // namespace JSC
#endif // ENABLE(MASM_PROBE)