Repository navigation
Expand file tree
/
Copy pathCopiedAllocator.h
More file actions
166 lines (136 loc) · 5.34 KB
/
Copy pathCopiedAllocator.h
File metadata and controls
166 lines (136 loc) · 5.34 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
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
/*
* Copyright (C) 2011 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 CopiedAllocator_h
#define CopiedAllocator_h
#include "CopiedBlock.h"
#include <wtf/CheckedBoolean.h>
#include <wtf/DataLog.h>
namespace JSC {
class CopiedAllocator {
public:
CopiedAllocator();
bool fastPathShouldSucceed(size_t bytes) const;
CheckedBoolean tryAllocate(size_t bytes, void** outPtr);
CheckedBoolean tryAllocateDuringCopying(size_t bytes, void** outPtr);
CheckedBoolean tryReallocate(void *oldPtr, size_t oldBytes, size_t newBytes);
void* forceAllocate(size_t bytes);
CopiedBlock* resetCurrentBlock();
void setCurrentBlock(CopiedBlock*);
size_t currentCapacity();
bool isValid() { return !!m_currentBlock; }
CopiedBlock* currentBlock() { return m_currentBlock; }
// Yes, these are public. No, that doesn't mean you can play with them.
// If I had made them private then I'd have to list off all of the JIT
// classes and functions that are entitled to modify these directly, and
// that would have been gross.
size_t m_currentRemaining;
char* m_currentPayloadEnd;
CopiedBlock* m_currentBlock;
};
inline CopiedAllocator::CopiedAllocator()
: m_currentRemaining(0)
, m_currentPayloadEnd(0)
, m_currentBlock(0)
{
}
inline bool CopiedAllocator::fastPathShouldSucceed(size_t bytes) const
{
ASSERT(is8ByteAligned(reinterpret_cast<void*>(bytes)));
return bytes <= m_currentRemaining;
}
inline CheckedBoolean CopiedAllocator::tryAllocate(size_t bytes, void** outPtr)
{
ASSERT(is8ByteAligned(reinterpret_cast<void*>(bytes)));
// This code is written in a gratuitously low-level manner, in order to
// serve as a kind of template for what the JIT would do. Note that the
// way it's written it ought to only require one register, which doubles
// as the result, provided that the compiler does a minimal amount of
// control flow simplification and the bytes argument is a constant.
size_t currentRemaining = m_currentRemaining;
if (bytes > currentRemaining)
return false;
currentRemaining -= bytes;
m_currentRemaining = currentRemaining;
*outPtr = m_currentPayloadEnd - currentRemaining - bytes;
ASSERT(is8ByteAligned(*outPtr));
return true;
}
inline CheckedBoolean CopiedAllocator::tryAllocateDuringCopying(size_t bytes, void** outPtr)
{
if (!tryAllocate(bytes, outPtr))
return false;
m_currentBlock->reportLiveBytesDuringCopying(bytes);
return true;
}
inline CheckedBoolean CopiedAllocator::tryReallocate(
void* oldPtr, size_t oldBytes, size_t newBytes)
{
ASSERT(is8ByteAligned(oldPtr));
ASSERT(is8ByteAligned(reinterpret_cast<void*>(oldBytes)));
ASSERT(is8ByteAligned(reinterpret_cast<void*>(newBytes)));
ASSERT(newBytes > oldBytes);
size_t additionalBytes = newBytes - oldBytes;
size_t currentRemaining = m_currentRemaining;
if (m_currentPayloadEnd - currentRemaining - oldBytes != static_cast<char*>(oldPtr))
return false;
if (additionalBytes > currentRemaining)
return false;
m_currentRemaining = currentRemaining - additionalBytes;
return true;
}
inline void* CopiedAllocator::forceAllocate(size_t bytes)
{
void* result = 0; // Needed because compilers don't realize this will always be assigned.
CheckedBoolean didSucceed = tryAllocate(bytes, &result);
ASSERT(didSucceed);
return result;
}
inline CopiedBlock* CopiedAllocator::resetCurrentBlock()
{
CopiedBlock* result = m_currentBlock;
if (result) {
result->m_remaining = m_currentRemaining;
m_currentBlock = 0;
m_currentRemaining = 0;
m_currentPayloadEnd = 0;
}
return result;
}
inline void CopiedAllocator::setCurrentBlock(CopiedBlock* newBlock)
{
ASSERT(!m_currentBlock);
m_currentBlock = newBlock;
ASSERT(newBlock);
m_currentRemaining = newBlock->m_remaining;
m_currentPayloadEnd = newBlock->payloadEnd();
}
inline size_t CopiedAllocator::currentCapacity()
{
if (!m_currentBlock)
return 0;
return m_currentBlock->capacity();
}
} // namespace JSC
#endif