blob: 9905ae2f52f14e1ca5f5cab6053c8c8aa9711b5a (
plain)
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
|
//
// VMime library (http://vmime.sourceforge.net)
// Copyright (C) 2002-2004 Vincent Richard <[email protected]>
//
// This program is free software; you can redistribute it and/or
// modify it under the terms of the GNU General Public License as
// published by the Free Software Foundation; either version 2 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
// General Public License for more details.
//
// You should have received a copy of the GNU General Public License
// along with this program; if not, write to the Free Software
// Foundation, Inc., 675 Mass Ave, Cambridge, MA 02139, USA.
//
#ifndef VMIME_UTILITY_SMARTPTR_HPP_INCLUDED
#define VMIME_UTILITY_SMARTPTR_HPP_INCLUDED
namespace vmime {
namespace utility {
/** Simple auto-delete pointer.
*/
template <class T>
class auto_ptr
{
private:
T* const m_ptr;
public:
auto_ptr(T* const ptr) : m_ptr(ptr) { }
~auto_ptr() { delete (m_ptr); }
operator T*() { return (m_ptr); }
T* const operator ->() { return (m_ptr); }
T& operator *() { return (*m_ptr); }
};
/** Smart auto-delete, referencable and copiable pointer.
*/
template <class T>
class smart_ptr
{
private:
struct data
{
int refCount;
T* ptr;
};
data* m_data;
typedef std::map <T*, data*> MapType;
static MapType sm_map;
public:
smart_ptr() : m_data(NULL) { }
smart_ptr(T* const ptr) : m_data(NULL) { if (ptr) { attach(ptr); } }
smart_ptr(smart_ptr& ptr) : m_data(NULL) { if (ptr.m_data) { attach(ptr); } }
~smart_ptr() { detach(); }
smart_ptr& operator=(smart_ptr& ptr)
{
attach(ptr);
return (*this);
}
smart_ptr& operator=(T* const ptr)
{
if (!ptr)
detach();
else
attach(ptr);
return (*this);
}
operator T*() { return (m_data ? m_data->ptr : NULL); }
operator const T*() { return (m_data ? m_data->ptr : NULL); }
T& operator *() { return (*(m_data->ptr)); }
T* operator ->() { return (m_data->ptr); }
const T* const ptr() const { return (m_data ? m_data->ptr : NULL); }
T* const ptr() { return (m_data ? m_data->ptr : NULL); }
private:
void detach()
{
if (m_data)
{
if (m_data->refCount == 1)
{
typename MapType::iterator it = sm_map.find(m_data->ptr);
if (it != sm_map.end()) sm_map.erase(it);
delete (m_data->ptr);
delete (m_data);
}
else
{
m_data->refCount--;
}
m_data = NULL;
}
}
void attach(T* const ptr)
{
detach();
typename MapType::iterator it = sm_map.find(ptr);
if (it != sm_map.end())
{
(*it).second->refCount++;
}
else
{
m_data = new data;
m_data->refCount = 1;
m_data->ptr = ptr;
sm_map.insert(typename MapType::value_type(ptr, m_data));
}
}
void attach(smart_ptr <T>& ptr)
{
data* newData = ptr.m_data;
if (newData) newData->refCount++;
detach();
m_data = newData;
}
};
template <class T>
typename smart_ptr <T>::MapType smart_ptr <T>::sm_map;
} // utility
} // vmime
#endif // VMIME_UTILITY_SMARTPTR_HPP_INCLUDED
|
