]> git.saurik.com Git - apple/javascriptcore.git/blame - heap/CopiedAllocator.h
JavaScriptCore-1218.34.tar.gz
[apple/javascriptcore.git] / heap / CopiedAllocator.h
CommitLineData
6fe7ccc8
A
1/*
2 * Copyright (C) 2011 Apple Inc. All rights reserved.
3 *
4 * Redistribution and use in source and binary forms, with or without
5 * modification, are permitted provided that the following conditions
6 * are met:
7 * 1. Redistributions of source code must retain the above copyright
8 * notice, this list of conditions and the following disclaimer.
9 * 2. Redistributions in binary form must reproduce the above copyright
10 * notice, this list of conditions and the following disclaimer in the
11 * documentation and/or other materials provided with the distribution.
12 *
13 * THIS SOFTWARE IS PROVIDED BY APPLE INC. ``AS IS'' AND ANY
14 * EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15 * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16 * PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL APPLE INC. OR
17 * CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18 * EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19 * PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20 * PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21 * OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22 * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23 * OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24 */
25
26#ifndef CopiedAllocator_h
27#define CopiedAllocator_h
28
29#include "CopiedBlock.h"
93a37866
A
30#include <wtf/CheckedBoolean.h>
31#include <wtf/DataLog.h>
6fe7ccc8
A
32
33namespace JSC {
34
35class CopiedAllocator {
6fe7ccc8
A
36public:
37 CopiedAllocator();
93a37866
A
38
39 bool fastPathShouldSucceed(size_t bytes) const;
40 CheckedBoolean tryAllocate(size_t bytes, void** outPtr);
41 CheckedBoolean tryReallocate(void *oldPtr, size_t oldBytes, size_t newBytes);
42 void* forceAllocate(size_t bytes);
43 CopiedBlock* resetCurrentBlock();
44 void setCurrentBlock(CopiedBlock*);
6fe7ccc8 45 size_t currentCapacity();
93a37866
A
46
47 bool isValid() { return !!m_currentBlock; }
6fe7ccc8 48
6fe7ccc8
A
49 CopiedBlock* currentBlock() { return m_currentBlock; }
50
93a37866
A
51 // Yes, these are public. No, that doesn't mean you can play with them.
52 // If I had made them private then I'd have to list off all of the JIT
53 // classes and functions that are entitled to modify these directly, and
54 // that would have been gross.
55 size_t m_currentRemaining;
56 char* m_currentPayloadEnd;
6fe7ccc8
A
57 CopiedBlock* m_currentBlock;
58};
59
60inline CopiedAllocator::CopiedAllocator()
93a37866
A
61 : m_currentRemaining(0)
62 , m_currentPayloadEnd(0)
6fe7ccc8
A
63 , m_currentBlock(0)
64{
65}
66
93a37866 67inline bool CopiedAllocator::fastPathShouldSucceed(size_t bytes) const
6fe7ccc8 68{
6fe7ccc8 69 ASSERT(is8ByteAligned(reinterpret_cast<void*>(bytes)));
93a37866
A
70
71 return bytes <= m_currentRemaining;
6fe7ccc8
A
72}
73
93a37866 74inline CheckedBoolean CopiedAllocator::tryAllocate(size_t bytes, void** outPtr)
6fe7ccc8 75{
93a37866
A
76 ASSERT(is8ByteAligned(reinterpret_cast<void*>(bytes)));
77
78 // This code is written in a gratuitously low-level manner, in order to
79 // serve as a kind of template for what the JIT would do. Note that the
80 // way it's written it ought to only require one register, which doubles
81 // as the result, provided that the compiler does a minimal amount of
82 // control flow simplification and the bytes argument is a constant.
83
84 size_t currentRemaining = m_currentRemaining;
85 if (bytes > currentRemaining)
86 return false;
87 currentRemaining -= bytes;
88 m_currentRemaining = currentRemaining;
89 *outPtr = m_currentPayloadEnd - currentRemaining - bytes;
90
91 ASSERT(is8ByteAligned(*outPtr));
92
93 return true;
94}
95
96inline CheckedBoolean CopiedAllocator::tryReallocate(
97 void* oldPtr, size_t oldBytes, size_t newBytes)
98{
99 ASSERT(is8ByteAligned(oldPtr));
100 ASSERT(is8ByteAligned(reinterpret_cast<void*>(oldBytes)));
101 ASSERT(is8ByteAligned(reinterpret_cast<void*>(newBytes)));
102
103 ASSERT(newBytes > oldBytes);
104
105 size_t additionalBytes = newBytes - oldBytes;
106
107 size_t currentRemaining = m_currentRemaining;
108 if (m_currentPayloadEnd - currentRemaining - oldBytes != static_cast<char*>(oldPtr))
109 return false;
110
111 if (additionalBytes > currentRemaining)
112 return false;
113
114 m_currentRemaining = currentRemaining - additionalBytes;
115
116 return true;
6fe7ccc8
A
117}
118
93a37866 119inline void* CopiedAllocator::forceAllocate(size_t bytes)
6fe7ccc8 120{
93a37866
A
121 void* result = 0; // Needed because compilers don't realize this will always be assigned.
122 CheckedBoolean didSucceed = tryAllocate(bytes, &result);
123 ASSERT(didSucceed);
124 return result;
6fe7ccc8
A
125}
126
93a37866 127inline CopiedBlock* CopiedAllocator::resetCurrentBlock()
6fe7ccc8 128{
93a37866
A
129 CopiedBlock* result = m_currentBlock;
130 if (result) {
131 result->m_remaining = m_currentRemaining;
132 m_currentBlock = 0;
133 m_currentRemaining = 0;
134 m_currentPayloadEnd = 0;
135 }
136 return result;
6fe7ccc8
A
137}
138
93a37866 139inline void CopiedAllocator::setCurrentBlock(CopiedBlock* newBlock)
6fe7ccc8 140{
93a37866 141 ASSERT(!m_currentBlock);
6fe7ccc8 142 m_currentBlock = newBlock;
93a37866
A
143 ASSERT(newBlock);
144 m_currentRemaining = newBlock->m_remaining;
145 m_currentPayloadEnd = newBlock->payloadEnd();
6fe7ccc8
A
146}
147
148inline size_t CopiedAllocator::currentCapacity()
149{
93a37866
A
150 if (!m_currentBlock)
151 return 0;
6fe7ccc8
A
152 return m_currentBlock->capacity();
153}
154
155} // namespace JSC
156
157#endif