williamr@2
|
1 |
#ifndef BOOST_DETAIL_SP_COUNTED_BASE_CW_PPC_HPP_INCLUDED
|
williamr@2
|
2 |
#define BOOST_DETAIL_SP_COUNTED_BASE_CW_PPC_HPP_INCLUDED
|
williamr@2
|
3 |
|
williamr@2
|
4 |
// MS compatible compilers support #pragma once
|
williamr@2
|
5 |
|
williamr@2
|
6 |
#if defined(_MSC_VER) && (_MSC_VER >= 1020)
|
williamr@2
|
7 |
# pragma once
|
williamr@2
|
8 |
#endif
|
williamr@2
|
9 |
|
williamr@2
|
10 |
//
|
williamr@2
|
11 |
// detail/sp_counted_base_cw_ppc.hpp - CodeWarrior on PowerPC
|
williamr@2
|
12 |
//
|
williamr@2
|
13 |
// Copyright (c) 2001, 2002, 2003 Peter Dimov and Multi Media Ltd.
|
williamr@2
|
14 |
// Copyright 2004-2005 Peter Dimov
|
williamr@2
|
15 |
//
|
williamr@2
|
16 |
// Distributed under the Boost Software License, Version 1.0. (See
|
williamr@2
|
17 |
// accompanying file LICENSE_1_0.txt or copy at
|
williamr@2
|
18 |
// http://www.boost.org/LICENSE_1_0.txt)
|
williamr@2
|
19 |
//
|
williamr@2
|
20 |
//
|
williamr@2
|
21 |
// Lock-free algorithm by Alexander Terekhov
|
williamr@2
|
22 |
//
|
williamr@2
|
23 |
// Thanks to Ben Hitchings for the #weak + (#shared != 0)
|
williamr@2
|
24 |
// formulation
|
williamr@2
|
25 |
//
|
williamr@2
|
26 |
|
williamr@2
|
27 |
#include <typeinfo>
|
williamr@2
|
28 |
|
williamr@2
|
29 |
namespace boost
|
williamr@2
|
30 |
{
|
williamr@2
|
31 |
|
williamr@2
|
32 |
namespace detail
|
williamr@2
|
33 |
{
|
williamr@2
|
34 |
|
williamr@2
|
35 |
inline void atomic_increment( register long * pw )
|
williamr@2
|
36 |
{
|
williamr@2
|
37 |
register int a;
|
williamr@2
|
38 |
|
williamr@2
|
39 |
asm
|
williamr@2
|
40 |
{
|
williamr@2
|
41 |
loop:
|
williamr@2
|
42 |
|
williamr@2
|
43 |
lwarx a, 0, pw
|
williamr@2
|
44 |
addi a, a, 1
|
williamr@2
|
45 |
stwcx. a, 0, pw
|
williamr@2
|
46 |
bne- loop
|
williamr@2
|
47 |
}
|
williamr@2
|
48 |
}
|
williamr@2
|
49 |
|
williamr@2
|
50 |
inline long atomic_decrement( register long * pw )
|
williamr@2
|
51 |
{
|
williamr@2
|
52 |
register int a;
|
williamr@2
|
53 |
|
williamr@2
|
54 |
asm
|
williamr@2
|
55 |
{
|
williamr@2
|
56 |
sync
|
williamr@2
|
57 |
|
williamr@2
|
58 |
loop:
|
williamr@2
|
59 |
|
williamr@2
|
60 |
lwarx a, 0, pw
|
williamr@2
|
61 |
addi a, a, -1
|
williamr@2
|
62 |
stwcx. a, 0, pw
|
williamr@2
|
63 |
bne- loop
|
williamr@2
|
64 |
|
williamr@2
|
65 |
isync
|
williamr@2
|
66 |
}
|
williamr@2
|
67 |
|
williamr@2
|
68 |
return a;
|
williamr@2
|
69 |
}
|
williamr@2
|
70 |
|
williamr@2
|
71 |
inline long atomic_conditional_increment( register long * pw )
|
williamr@2
|
72 |
{
|
williamr@2
|
73 |
register int a;
|
williamr@2
|
74 |
|
williamr@2
|
75 |
asm
|
williamr@2
|
76 |
{
|
williamr@2
|
77 |
loop:
|
williamr@2
|
78 |
|
williamr@2
|
79 |
lwarx a, 0, pw
|
williamr@2
|
80 |
cmpwi a, 0
|
williamr@2
|
81 |
beq store
|
williamr@2
|
82 |
|
williamr@2
|
83 |
addi a, a, 1
|
williamr@2
|
84 |
|
williamr@2
|
85 |
store:
|
williamr@2
|
86 |
|
williamr@2
|
87 |
stwcx. a, 0, pw
|
williamr@2
|
88 |
bne- loop
|
williamr@2
|
89 |
}
|
williamr@2
|
90 |
|
williamr@2
|
91 |
return a;
|
williamr@2
|
92 |
}
|
williamr@2
|
93 |
|
williamr@2
|
94 |
class sp_counted_base
|
williamr@2
|
95 |
{
|
williamr@2
|
96 |
private:
|
williamr@2
|
97 |
|
williamr@2
|
98 |
sp_counted_base( sp_counted_base const & );
|
williamr@2
|
99 |
sp_counted_base & operator= ( sp_counted_base const & );
|
williamr@2
|
100 |
|
williamr@2
|
101 |
long use_count_; // #shared
|
williamr@2
|
102 |
long weak_count_; // #weak + (#shared != 0)
|
williamr@2
|
103 |
|
williamr@2
|
104 |
public:
|
williamr@2
|
105 |
|
williamr@2
|
106 |
sp_counted_base(): use_count_( 1 ), weak_count_( 1 )
|
williamr@2
|
107 |
{
|
williamr@2
|
108 |
}
|
williamr@2
|
109 |
|
williamr@2
|
110 |
virtual ~sp_counted_base() // nothrow
|
williamr@2
|
111 |
{
|
williamr@2
|
112 |
}
|
williamr@2
|
113 |
|
williamr@2
|
114 |
// dispose() is called when use_count_ drops to zero, to release
|
williamr@2
|
115 |
// the resources managed by *this.
|
williamr@2
|
116 |
|
williamr@2
|
117 |
virtual void dispose() = 0; // nothrow
|
williamr@2
|
118 |
|
williamr@2
|
119 |
// destroy() is called when weak_count_ drops to zero.
|
williamr@2
|
120 |
|
williamr@2
|
121 |
virtual void destroy() // nothrow
|
williamr@2
|
122 |
{
|
williamr@2
|
123 |
delete this;
|
williamr@2
|
124 |
}
|
williamr@2
|
125 |
|
williamr@2
|
126 |
virtual void * get_deleter( std::type_info const & ti ) = 0;
|
williamr@2
|
127 |
|
williamr@2
|
128 |
void add_ref_copy()
|
williamr@2
|
129 |
{
|
williamr@2
|
130 |
atomic_increment( &use_count_ );
|
williamr@2
|
131 |
}
|
williamr@2
|
132 |
|
williamr@2
|
133 |
bool add_ref_lock() // true on success
|
williamr@2
|
134 |
{
|
williamr@2
|
135 |
return atomic_conditional_increment( &use_count_ ) != 0;
|
williamr@2
|
136 |
}
|
williamr@2
|
137 |
|
williamr@2
|
138 |
void release() // nothrow
|
williamr@2
|
139 |
{
|
williamr@2
|
140 |
if( atomic_decrement( &use_count_ ) == 0 )
|
williamr@2
|
141 |
{
|
williamr@2
|
142 |
dispose();
|
williamr@2
|
143 |
weak_release();
|
williamr@2
|
144 |
}
|
williamr@2
|
145 |
}
|
williamr@2
|
146 |
|
williamr@2
|
147 |
void weak_add_ref() // nothrow
|
williamr@2
|
148 |
{
|
williamr@2
|
149 |
atomic_increment( &weak_count_ );
|
williamr@2
|
150 |
}
|
williamr@2
|
151 |
|
williamr@2
|
152 |
void weak_release() // nothrow
|
williamr@2
|
153 |
{
|
williamr@2
|
154 |
if( atomic_decrement( &weak_count_ ) == 0 )
|
williamr@2
|
155 |
{
|
williamr@2
|
156 |
destroy();
|
williamr@2
|
157 |
}
|
williamr@2
|
158 |
}
|
williamr@2
|
159 |
|
williamr@2
|
160 |
long use_count() const // nothrow
|
williamr@2
|
161 |
{
|
williamr@2
|
162 |
return static_cast<long const volatile &>( use_count_ );
|
williamr@2
|
163 |
}
|
williamr@2
|
164 |
};
|
williamr@2
|
165 |
|
williamr@2
|
166 |
} // namespace detail
|
williamr@2
|
167 |
|
williamr@2
|
168 |
} // namespace boost
|
williamr@2
|
169 |
|
williamr@2
|
170 |
#endif // #ifndef BOOST_DETAIL_SP_COUNTED_BASE_CW_PPC_HPP_INCLUDED
|