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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
|
/*
* Copyright (C) 2010 Google 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 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 PODArena_h
#define PODArena_h
#include <stdint.h>
#include <wtf/Assertions.h>
#include <wtf/FastMalloc.h>
#include <wtf/Noncopyable.h>
#include <wtf/OwnPtr.h>
#include <wtf/PassOwnPtr.h>
#include <wtf/RefCounted.h>
#include <wtf/Vector.h>
namespace WebCore {
// An arena which allocates only Plain Old Data (POD), or classes and
// structs bottoming out in Plain Old Data. NOTE: the constructors of
// the objects allocated in this arena are called, but _not_ their
// destructors.
class PODArena : public RefCounted<PODArena> {
public:
// The arena is configured with an allocator, which is responsible
// for allocating and freeing chunks of memory at a time.
class Allocator : public RefCounted<Allocator> {
public:
virtual void* allocate(size_t size) = 0;
virtual void free(void* ptr) = 0;
protected:
virtual ~Allocator() { }
friend class WTF::RefCounted<Allocator>;
};
// The Arena's default allocator, which uses fastMalloc and
// fastFree to allocate chunks of storage.
class FastMallocAllocator : public Allocator {
public:
static PassRefPtr<FastMallocAllocator> create()
{
return adoptRef(new FastMallocAllocator);
}
virtual void* allocate(size_t size) { return fastMalloc(size); }
virtual void free(void* ptr) { fastFree(ptr); }
protected:
FastMallocAllocator() { }
};
// Creates a new PODArena configured with a FastMallocAllocator.
static PassRefPtr<PODArena> create()
{
return adoptRef(new PODArena);
}
// Creates a new PODArena configured with the given Allocator.
static PassRefPtr<PODArena> create(PassRefPtr<Allocator> allocator)
{
return adoptRef(new PODArena(allocator));
}
// Allocates an object from the arena.
template<class T> T* allocateObject()
{
void* ptr = allocateBase<T>();
if (ptr) {
// Use placement operator new to allocate a T at this location.
new(ptr) T();
}
return static_cast<T*>(ptr);
}
// Allocates an object from the arena, calling a single-argument constructor.
template<class T, class Argument1Type> T* allocateObject(const Argument1Type& argument1)
{
void* ptr = allocateBase<T>();
if (ptr) {
// Use placement operator new to allocate a T at this location.
new(ptr) T(argument1);
}
return static_cast<T*>(ptr);
}
// The initial size of allocated chunks; increases as necessary to
// satisfy large allocations. Mainly public for unit tests.
enum {
DefaultChunkSize = 16384
};
protected:
~PODArena() { }
friend class WTF::RefCounted<PODArena>;
private:
PODArena()
: m_allocator(FastMallocAllocator::create())
, m_current(0)
, m_currentChunkSize(DefaultChunkSize) { }
explicit PODArena(PassRefPtr<Allocator> allocator)
: m_allocator(allocator)
, m_current(0)
, m_currentChunkSize(DefaultChunkSize) { }
// Returns the alignment requirement for classes and structs on the
// current platform.
template <class T> static size_t minAlignment()
{
return WTF_ALIGN_OF(T);
}
template<class T> void* allocateBase()
{
void* ptr = 0;
size_t roundedSize = roundUp(sizeof(T), minAlignment<T>());
if (m_current)
ptr = m_current->allocate(roundedSize);
if (!ptr) {
if (roundedSize > m_currentChunkSize)
m_currentChunkSize = roundedSize;
m_chunks.append(adoptPtr(new Chunk(m_allocator.get(), m_currentChunkSize)));
m_current = m_chunks.last().get();
ptr = m_current->allocate(roundedSize);
}
return ptr;
}
// Rounds up the given allocation size to the specified alignment.
size_t roundUp(size_t size, size_t alignment)
{
ASSERT(!(alignment % 2));
return (size + alignment - 1) & ~(alignment - 1);
}
// Manages a chunk of memory and individual allocations out of it.
class Chunk {
WTF_MAKE_NONCOPYABLE(Chunk);
public:
// Allocates a block of memory of the given size from the passed
// Allocator.
Chunk(Allocator* allocator, size_t size)
: m_allocator(allocator)
, m_size(size)
, m_currentOffset(0)
{
m_base = static_cast<uint8_t*>(m_allocator->allocate(size));
}
// Frees the memory allocated from the Allocator in the
// constructor.
~Chunk()
{
m_allocator->free(m_base);
}
// Returns a pointer to "size" bytes of storage, or 0 if this
// Chunk could not satisfy the allocation.
void* allocate(size_t size)
{
// Check for overflow
if (m_currentOffset + size < m_currentOffset)
return 0;
if (m_currentOffset + size > m_size)
return 0;
void* result = m_base + m_currentOffset;
m_currentOffset += size;
return result;
}
private:
Allocator* m_allocator;
uint8_t* m_base;
size_t m_size;
size_t m_currentOffset;
};
RefPtr<Allocator> m_allocator;
Chunk* m_current;
size_t m_currentChunkSize;
Vector<OwnPtr<Chunk> > m_chunks;
};
} // namespace WebCore
#endif // PODArena_h
|
