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
|
/*
* 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 RefCountedArray_h
#define RefCountedArray_h
#include <wtf/FastMalloc.h>
#include <wtf/StdLibExtras.h>
#include <wtf/Vector.h>
// This implements a reference counted array for POD** values, which is optimized for:
// - An empty array only uses one word.
// - A copy of the array only uses one word (i.e. assignment means aliasing).
// - The vector can't grow beyond 2^32-1 elements.
// - In all other regards this has similar space usage to a Vector.
//
// ** This could be modified to support non-POD values quite easily. It just
// hasn't been, so far, because there has been no need. Moreover, even now,
// it's used for things that aren't quite POD according to the official
// defintion, such as JSC::Instruction.
namespace WTF {
template<typename T>
class RefCountedArray {
public:
RefCountedArray()
: m_data(0)
{
}
RefCountedArray(const RefCountedArray& other)
: m_data(other.m_data)
{
if (m_data)
Header::fromPayload(m_data)->refCount++;
}
explicit RefCountedArray(size_t size)
{
if (!size) {
m_data = 0;
return;
}
m_data = (static_cast<Header*>(fastMalloc(Header::size() + sizeof(T) * size)))->payload();
Header::fromPayload(m_data)->refCount = 1;
Header::fromPayload(m_data)->length = size;
ASSERT(Header::fromPayload(m_data)->length == size);
VectorTypeOperations<T>::initialize(begin(), end());
}
template<size_t inlineCapacity, typename OverflowHandler>
explicit RefCountedArray(const Vector<T, inlineCapacity, OverflowHandler>& other)
{
if (other.isEmpty()) {
m_data = 0;
return;
}
m_data = (static_cast<Header*>(fastMalloc(Header::size() + sizeof(T) * other.size())))->payload();
Header::fromPayload(m_data)->refCount = 1;
Header::fromPayload(m_data)->length = other.size();
ASSERT(Header::fromPayload(m_data)->length == other.size());
VectorTypeOperations<T>::uninitializedCopy(other.begin(), other.end(), m_data);
}
RefCountedArray& operator=(const RefCountedArray& other)
{
T* oldData = m_data;
m_data = other.m_data;
if (m_data)
Header::fromPayload(m_data)->refCount++;
if (!oldData)
return *this;
if (--Header::fromPayload(oldData)->refCount)
return *this;
VectorTypeOperations<T>::destruct(oldData, oldData + Header::fromPayload(oldData)->length);
fastFree(Header::fromPayload(oldData));
return *this;
}
~RefCountedArray()
{
if (!m_data)
return;
if (--Header::fromPayload(m_data)->refCount)
return;
VectorTypeOperations<T>::destruct(begin(), end());
fastFree(Header::fromPayload(m_data));
}
unsigned refCount() const
{
if (!m_data)
return 0;
return Header::fromPayload(m_data)->refCount;
}
size_t size() const
{
if (!m_data)
return 0;
return Header::fromPayload(m_data)->length;
}
size_t byteSize() const { return size() * sizeof(T); }
T* data() { return m_data; }
T* begin() { return m_data; }
T* end()
{
if (!m_data)
return 0;
return m_data + Header::fromPayload(m_data)->length;
}
const T* data() const { return m_data; }
const T* begin() const { return m_data; }
const T* end() const { return const_cast<RefCountedArray*>(this)->end(); }
T& at(size_t i)
{
ASSERT_WITH_SECURITY_IMPLICATION(i < size());
return begin()[i];
}
const T& at(size_t i) const
{
ASSERT_WITH_SECURITY_IMPLICATION(i < size());
return begin()[i];
}
T& operator[](size_t i) { return at(i); }
const T& operator[](size_t i) const { return at(i); }
bool operator==(const RefCountedArray& other) const
{
if (m_data == other.m_data)
return true;
if (!m_data || !other.m_data)
return false;
unsigned length = Header::fromPayload(m_data)->length;
if (length != Header::fromPayload(other.m_data)->length)
return false;
for (unsigned i = 0; i < length; ++i) {
if (m_data[i] != other.m_data[i])
return false;
}
return true;
}
private:
struct Header {
unsigned refCount;
unsigned length;
static size_t size()
{
return (sizeof(Header) + 7) & ~7;
}
T* payload()
{
char* result = reinterpret_cast<char*>(this) + size();
ASSERT(!(bitwise_cast<uintptr_t>(result) & 7));
return reinterpret_cast_ptr<T*>(result);
}
static Header* fromPayload(T* payload)
{
return reinterpret_cast_ptr<Header*>(reinterpret_cast<char*>(payload) - size());
}
};
T* m_data;
};
} // namespace WTF
using WTF::RefCountedArray;
#endif // RefCountedArray_h
|
