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
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
|
/*
* Copyright (C) 2010 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. 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 INC. 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 WKRetainPtr_h
#define WKRetainPtr_h
#include <WebKit/WKType.h>
#include <algorithm>
#include <wtf/GetPtr.h>
#include <wtf/HashFunctions.h>
#include <wtf/HashTraits.h>
#include <wtf/RefPtr.h>
namespace WebKit {
enum WKAdoptTag { AdoptWK };
template<typename T> class WKRetainPtr {
public:
typedef T PtrType;
WKRetainPtr()
: m_ptr(0)
{
}
WKRetainPtr(PtrType ptr)
: m_ptr(ptr)
{
if (ptr)
WKRetain(ptr);
}
WKRetainPtr(WKAdoptTag, PtrType ptr)
: m_ptr(ptr)
{
}
template<typename U> WKRetainPtr(const WKRetainPtr<U>& o)
: m_ptr(o.get())
{
if (PtrType ptr = m_ptr)
WKRetain(ptr);
}
WKRetainPtr(const WKRetainPtr& o)
: m_ptr(o.m_ptr)
{
if (PtrType ptr = m_ptr)
WKRetain(ptr);
}
template<typename U> WKRetainPtr(WKRetainPtr<U>&& o)
: m_ptr(o.leakRef())
{
}
WKRetainPtr(WKRetainPtr&& o)
: m_ptr(o.leakRef())
{
}
~WKRetainPtr()
{
if (PtrType ptr = m_ptr)
WKRelease(ptr);
}
// Hash table deleted values, which are only constructed and never copied or destroyed.
WKRetainPtr(WTF::HashTableDeletedValueType)
: m_ptr(hashTableDeletedValue())
{
}
bool isHashTableDeletedValue() const { return m_ptr == hashTableDeletedValue(); }
constexpr static T hashTableDeletedValue() { return reinterpret_cast<T>(-1); }
PtrType get() const { return m_ptr; }
void clear()
{
PtrType ptr = m_ptr;
m_ptr = 0;
if (ptr)
WKRelease(ptr);
}
PtrType leakRef()
{
PtrType ptr = m_ptr;
m_ptr = 0;
return ptr;
}
PtrType operator->() const { return m_ptr; }
bool operator!() const { return !m_ptr; }
// This conversion operator allows implicit conversion to bool but not to other integer types.
typedef PtrType WKRetainPtr::*UnspecifiedBoolType;
operator UnspecifiedBoolType() const { return m_ptr ? &WKRetainPtr::m_ptr : 0; }
WKRetainPtr& operator=(const WKRetainPtr&);
template<typename U> WKRetainPtr& operator=(const WKRetainPtr<U>&);
WKRetainPtr& operator=(PtrType);
template<typename U> WKRetainPtr& operator=(U*);
WKRetainPtr& operator=(WKRetainPtr&&);
template<typename U> WKRetainPtr& operator=(WKRetainPtr<U>&&);
void adopt(PtrType);
void swap(WKRetainPtr&);
private:
PtrType m_ptr;
};
template<typename T> inline WKRetainPtr<T>& WKRetainPtr<T>::operator=(const WKRetainPtr<T>& o)
{
PtrType optr = o.get();
if (optr)
WKRetain(optr);
PtrType ptr = m_ptr;
m_ptr = optr;
if (ptr)
WKRelease(ptr);
return *this;
}
template<typename T> template<typename U> inline WKRetainPtr<T>& WKRetainPtr<T>::operator=(const WKRetainPtr<U>& o)
{
PtrType optr = o.get();
if (optr)
WKRetain(optr);
PtrType ptr = m_ptr;
m_ptr = optr;
if (ptr)
WKRelease(ptr);
return *this;
}
template<typename T> inline WKRetainPtr<T>& WKRetainPtr<T>::operator=(PtrType optr)
{
if (optr)
WKRetain(optr);
PtrType ptr = m_ptr;
m_ptr = optr;
if (ptr)
WKRelease(ptr);
return *this;
}
template<typename T> template<typename U> inline WKRetainPtr<T>& WKRetainPtr<T>::operator=(U* optr)
{
if (optr)
WKRetain(optr);
PtrType ptr = m_ptr;
m_ptr = optr;
if (ptr)
WKRelease(ptr);
return *this;
}
template<typename T> inline WKRetainPtr<T>& WKRetainPtr<T>::operator=(WKRetainPtr<T>&& o)
{
adopt(o.leakRef());
return *this;
}
template<typename T> template<typename U> inline WKRetainPtr<T>& WKRetainPtr<T>::operator=(WKRetainPtr<U>&& o)
{
adopt(o.leakRef());
return *this;
}
template<typename T> inline void WKRetainPtr<T>::adopt(PtrType optr)
{
PtrType ptr = m_ptr;
m_ptr = optr;
if (ptr)
WKRelease(ptr);
}
template<typename T> inline void WKRetainPtr<T>::swap(WKRetainPtr<T>& o)
{
std::swap(m_ptr, o.m_ptr);
}
template<typename T> inline void swap(WKRetainPtr<T>& a, WKRetainPtr<T>& b)
{
a.swap(b);
}
template<typename T, typename U> inline bool operator==(const WKRetainPtr<T>& a, const WKRetainPtr<U>& b)
{
return a.get() == b.get();
}
template<typename T, typename U> inline bool operator==(const WKRetainPtr<T>& a, U* b)
{
return a.get() == b;
}
template<typename T, typename U> inline bool operator==(T* a, const WKRetainPtr<U>& b)
{
return a == b.get();
}
template<typename T, typename U> inline bool operator!=(const WKRetainPtr<T>& a, const WKRetainPtr<U>& b)
{
return a.get() != b.get();
}
template<typename T, typename U> inline bool operator!=(const WKRetainPtr<T>& a, U* b)
{
return a.get() != b;
}
template<typename T, typename U> inline bool operator!=(T* a, const WKRetainPtr<U>& b)
{
return a != b.get();
}
template<typename T> inline WKRetainPtr<T> adoptWK(T) WARN_UNUSED_RETURN;
template<typename T> inline WKRetainPtr<T> adoptWK(T o)
{
return WKRetainPtr<T>(AdoptWK, o);
}
} // namespace WebKit
using WebKit::WKRetainPtr;
using WebKit::AdoptWK;
using WebKit::adoptWK;
namespace WTF {
template <typename T> struct IsSmartPtr<WKRetainPtr<T>> {
static const bool value = true;
};
template<typename P> struct DefaultHash<WKRetainPtr<P>> {
typedef PtrHash<WKRetainPtr<P>> Hash;
};
template<typename P> struct HashTraits<WKRetainPtr<P>> : SimpleClassHashTraits<WKRetainPtr<P>> {
static P emptyValue() { return nullptr; }
typedef P PeekType;
static PeekType peek(const WKRetainPtr<P>& value) { return value.get(); }
static PeekType peek(P value) { return value; }
};
} // namespace WTF
#endif // WKRetainPtr_h
|
