/
smartrefs.h
231 lines (203 loc) · 4.53 KB
/
smartrefs.h
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
/**************************************************************************
Lightspark, a free flash player implementation
Copyright (C) 2009-2011 Alessandro Pignotti (a.pignotti@sssup.it)
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>.
**************************************************************************/
#ifndef _SMARTREFS_H
#define _SMARTREFS_H
namespace lightspark
{
/*
NOTE: _Always_ define both copy constructor and assignment operator in non templated way.
Templated versions must be added if copying should be allowed from compatible types.
The compiler will _not_ use templated versions if the right hand type is the same
as the left hand type */
template<class T> class NullableRef;
template<class T>
class Ref
{
private:
T* m;
public:
explicit Ref(T* o):m(o)
{
assert(m);
}
Ref(const Ref<T>& r):m(r.m)
{
m->incRef();
}
//Constructible from any compatible reference
template<class D> Ref(const Ref<D>& r):m(r.getPtr())
{
m->incRef();
}
template<class D> Ref(const NullableRef<D>& r);
Ref<T>& operator=(const Ref<T>& r)
{
//incRef before decRef to make sure this works even if the pointer is the same
r.m->incRef();
m->decRef();
m=r.m;
return *this;
}
template<class D> Ref<T>& operator=(const Ref<D>& r)
{
//incRef before decRef to make sure this works even if the pointer is the same
r.m->incRef();
m->decRef();
m=r.m;
return *this;
}
template<class D> bool operator==(const Ref<D>& r) const
{
return m==r.getPtr();
}
template<class D> bool operator==(const NullableRef<D>&r) const;
bool operator==(T* r) const
{
return m==r;
}
//Order operator for Dictionary map
bool operator<(const Ref<T>& r) const
{
return m<r.m;
}
~Ref()
{
m->decRef();
}
T* operator->() const {return m;}
T* getPtr() const { return m; }
};
#define _R Ref
template<class T>
Ref<T> _MR(T* a)
{
return Ref<T>(a);
}
class NullRef_t
{
};
extern NullRef_t NullRef;
template<class T>
class NullableRef
{
private:
T* m;
public:
explicit NullableRef(T* o):m(o){}
NullableRef(NullRef_t):m(NULL){}
NullableRef(const NullableRef& r):m(r.m)
{
if(m)
m->incRef();
}
//Constructible from any compatible nullable reference and reference
template<class D> NullableRef(const NullableRef<D>& r):m(r.getPtr())
{
if(m)
m->incRef();
}
template<class D> NullableRef(const Ref<D>& r):m(r.getPtr())
{
//The right hand Ref object is guaranteed to be valid
m->incRef();
}
NullableRef<T>& operator=(const NullableRef<T>& r)
{
if(r.m)
r.m->incRef();
if(m)
m->decRef();
m=r.m;
return *this;
}
template<class D> NullableRef<T>& operator=(const NullableRef<D>& r)
{
if(r.m)
r.m->incRef();
if(m)
m->decRef();
m=r.m;
return *this;
}
template<class D> NullableRef<T>& operator=(const Ref<D>& r)
{
r.getPtr()->incRef();
if(m)
m->decRef();
m=r.getPtr();
return *this;
}
template<class D> bool operator==(const NullableRef<D>& r) const
{
return m==r.getPtr();
}
template<class D> bool operator==(const Ref<D>& r) const
{
return m==r.getPtr();
}
bool operator==(T* r) const
{
return m==r;
}
template<class D> bool operator!=(const NullableRef<D>& r) const
{
return m!=r.getPtr();
}
template<class D> bool operator!=(const Ref<D>& r) const
{
return m!=r.getPtr();
}
~NullableRef()
{
if(m)
m->decRef();
}
T* operator->() const {return m;}
T* getPtr() const { return m; }
bool isNull() const { return m==NULL; }
void reset()
{
if(m)
m->decRef();
m=NULL;
}
void fakeRelease()
{
m=NULL;
}
};
//Shorthand notation
#define _NR NullableRef
template<class T>
Ref<T> _MR(NullableRef<T> a)
{
return Ref<T>(a);
}
template<class T>
NullableRef<T> _MNR(T* a)
{
return NullableRef<T>(a);
}
template<class T> template<class D> Ref<T>::Ref(const NullableRef<D>& r):m(r.getPtr())
{
assert(m);
m->incRef();
}
template<class T> template<class D> bool Ref<T>::operator==(const NullableRef<D>&r) const
{
return m==r.getPtr();
}
};
#endif