blob: 7223090f97822f44b23072e581ca3cd002a4018a (
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
|
/* This file is part of mhmake.
*
* Copyright (C) 2001-2010 marha@sourceforge.net
*
* Mhmake 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 3 of the License, or
* (at your option) any later version.
*
* Mhmake 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 Mhmake. If not, see <http://www.gnu.org/licenses/>.
*/
/* $Rev$ */
#ifndef __REFPTR_H__
#define __REFPTR_H__
#ifdef _DEBUG
#define PRINTF(arg) if (g_PrintLexYacc) printf arg
#else
#define PRINTF(arg)
#endif
template <class T> class iterstack: public stack<T>
{
public:
typedef typename deque<T>::iterator iterator;
typedef typename deque<T>::reverse_iterator reverse_iterator;
iterator begin()
{
return stack<T>::c.begin();
}
iterator end()
{
return stack<T>::c.end();
}
reverse_iterator rbegin()
{
return stack<T>::c.rbegin();
}
reverse_iterator rend()
{
return stack<T>::c.rend();
}
};
struct refbase
{
int m_Count;
refbase()
{
m_Count=1;
}
};
// Template class T needs to be derived from refbase;
template <class T> class refptr
{
T *m_RefPtr;
public:
refptr()
{
m_RefPtr=NULL;
}
refptr(T *Ptr) {
m_RefPtr=Ptr;
}
refptr(const refptr<T> &RefPtr)
{
m_RefPtr=RefPtr.m_RefPtr;
if (m_RefPtr)
m_RefPtr->m_Count++;
}
~refptr()
{
if (m_RefPtr && !--m_RefPtr->m_Count)
{
delete m_RefPtr;
}
}
refptr<T> &operator=(const refptr<T>& Src)
{
if (Src.m_RefPtr!=m_RefPtr)
{
this->~refptr();
new (this) refptr<T>(Src);
}
return *this;
}
refptr<T> &operator=(T *pPtr) // Assumes that T has reference count 1 and has no other users
{
#if defined(_DEBUG) && defined(_MSC_VER)
if (pPtr && pPtr->m_Count!=1)
DebugBreak();
#endif
this->~refptr();
m_RefPtr=pPtr;
return *this;
}
T & operator*() const
{
return *m_RefPtr;
}
T * operator->() const
{
return m_RefPtr;
}
operator T*() const
{
return m_RefPtr;
}
};
#endif
|
