/usr/share/doc/libpion-net-doc/html/fifo_8hpp-source.html is in libpion-net-doc 4.0.7+dfsg-3.1ubuntu2.
This file is owned by root:root, with mode 0o644.
The actual contents of the file can be viewed below.
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 278 279 280 281 282 283 284 285 286 287 288 289 | <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
<html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
<title>pion-net: common/include/boost/lockfree/fifo.hpp Source File</title>
<link href="doxygen.css" rel="stylesheet" type="text/css">
<link href="tabs.css" rel="stylesheet" type="text/css">
</head><body>
<!-- Generated by Doxygen 1.4.7 -->
<div class="tabs">
<ul>
<li><a href="index.html"><span>Main Page</span></a></li>
<li><a href="namespaces.html"><span>Namespaces</span></a></li>
<li><a href="annotated.html"><span>Classes</span></a></li>
<li id="current"><a href="files.html"><span>Files</span></a></li>
</ul></div>
<h1>common/include/boost/lockfree/fifo.hpp</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">// lock-free fifo queue from</span>
<a name="l00002"></a>00002 <span class="comment">// Michael, M. M. and Scott, M. L.,</span>
<a name="l00003"></a>00003 <span class="comment">// "simple, fast and practical non-blocking and blocking concurrent queue algorithms"</span>
<a name="l00004"></a>00004 <span class="comment">//</span>
<a name="l00005"></a>00005 <span class="comment">// implementation for c++</span>
<a name="l00006"></a>00006 <span class="comment">//</span>
<a name="l00007"></a>00007 <span class="comment">// Copyright (C) 2008 Tim Blechmann</span>
<a name="l00008"></a>00008 <span class="comment">//</span>
<a name="l00009"></a>00009 <span class="comment">// Distributed under the Boost Software License, Version 1.0. (See</span>
<a name="l00010"></a>00010 <span class="comment">// accompanying file LICENSE_1_0.txt or copy at</span>
<a name="l00011"></a>00011 <span class="comment">// http://www.boost.org/LICENSE_1_0.txt)</span>
<a name="l00012"></a>00012
<a name="l00013"></a>00013 <span class="comment">// Disclaimer: Not a Boost library.</span>
<a name="l00014"></a>00014
<a name="l00015"></a>00015 <span class="preprocessor">#ifndef BOOST_LOCKFREE_FIFO_HPP_INCLUDED</span>
<a name="l00016"></a>00016 <span class="preprocessor"></span><span class="preprocessor">#define BOOST_LOCKFREE_FIFO_HPP_INCLUDED</span>
<a name="l00017"></a>00017 <span class="preprocessor"></span>
<a name="l00018"></a>00018 <span class="preprocessor">#include <boost/lockfree/atomic_int.hpp></span>
<a name="l00019"></a>00019 <span class="preprocessor">#include <boost/lockfree/detail/tagged_ptr.hpp></span>
<a name="l00020"></a>00020 <span class="preprocessor">#include <boost/lockfree/detail/freelist.hpp></span>
<a name="l00021"></a>00021
<a name="l00022"></a>00022 <span class="preprocessor">#include <boost/static_assert.hpp></span>
<a name="l00023"></a>00023 <span class="preprocessor">#include <boost/type_traits/is_pod.hpp></span>
<a name="l00024"></a>00024
<a name="l00025"></a>00025 <span class="preprocessor">#include <memory></span> <span class="comment">/* std::auto_ptr */</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include <boost/scoped_ptr.hpp></span>
<a name="l00027"></a>00027 <span class="preprocessor">#include <boost/shared_ptr.hpp></span>
<a name="l00028"></a>00028 <span class="preprocessor">#include <boost/noncopyable.hpp></span>
<a name="l00029"></a>00029
<a name="l00030"></a>00030 <span class="keyword">namespace </span>boost
<a name="l00031"></a>00031 {
<a name="l00032"></a>00032 <span class="keyword">namespace </span>lockfree
<a name="l00033"></a>00033 {
<a name="l00034"></a>00034
<a name="l00035"></a>00035 <span class="keyword">namespace </span>detail
<a name="l00036"></a>00036 {
<a name="l00037"></a>00037
<a name="l00038"></a>00038 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> freelist_t, <span class="keyword">typename</span> Alloc>
<a name="l00039"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html">00039</a> <span class="keyword">class </span><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html">fifo</a>:
<a name="l00040"></a>00040 boost::noncopyable
<a name="l00041"></a>00041 {
<a name="l00042"></a>00042 BOOST_STATIC_ASSERT(boost::is_pod<T>::value);
<a name="l00043"></a>00043
<a name="l00044"></a>00044 <span class="keyword">struct </span>BOOST_LOCKFREE_CACHELINE_ALIGNMENT node
<a name="l00045"></a>00045 {
<a name="l00046"></a>00046 <span class="keyword">typedef</span> <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">tagged_ptr<node></a> tagged_ptr_t;
<a name="l00047"></a>00047
<a name="l00048"></a>00048 node(T <span class="keyword">const</span> & v):
<a name="l00049"></a>00049 data(v)
<a name="l00050"></a>00050 {
<a name="l00051"></a>00051 next.set(NULL, next.get_tag()+1); <span class="comment">/* increment tag to avoid ABA problem */</span>
<a name="l00052"></a>00052 }
<a name="l00053"></a>00053
<a name="l00054"></a>00054 node (<span class="keywordtype">void</span>):
<a name="l00055"></a>00055 next(NULL)
<a name="l00056"></a>00056 {}
<a name="l00057"></a>00057
<a name="l00058"></a>00058 tagged_ptr_t next;
<a name="l00059"></a>00059 T data;
<a name="l00060"></a>00060 };
<a name="l00061"></a>00061
<a name="l00062"></a>00062 <span class="keyword">typedef</span> <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">tagged_ptr<node></a> <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">atomic_node_ptr</a>;
<a name="l00063"></a>00063
<a name="l00064"></a>00064 <span class="keyword">typedef</span> <span class="keyword">typename</span> Alloc::template rebind<node>::other node_allocator;
<a name="l00065"></a>00065 <span class="comment">/* typedef typename select_freelist<node, node_allocator, freelist_t>::type pool_t; */</span>
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keyword">typedef</span> <span class="keyword">typename</span> boost::mpl::if_<boost::is_same<freelist_t, caching_freelist_t>,
<a name="l00068"></a>00068 <a class="code" href="classboost_1_1lockfree_1_1caching__freelist.html">caching_freelist<node, node_allocator></a>,
<a name="l00069"></a>00069 <a class="code" href="classboost_1_1lockfree_1_1static__freelist.html">static_freelist<node, node_allocator></a>
<a name="l00070"></a>00070 >::type pool_t;
<a name="l00071"></a>00071
<a name="l00072"></a>00072 <span class="keyword">public</span>:
<a name="l00073"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#c71bf12ec8ae713cd7e4b0d16fc78d4b">00073</a> <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">bool</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#c71bf12ec8ae713cd7e4b0d16fc78d4b">is_lockfree</a> = <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#8415cbe9d903f984d7a82c78cca20590">node::tagged_ptr_t::is_lockfree</a>;
<a name="l00074"></a>00074
<a name="l00075"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#d1dc3f0389c839c0827a7b65230b1186">00075</a> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#d1dc3f0389c839c0827a7b65230b1186">fifo</a>(<span class="keywordtype">void</span>):
<a name="l00076"></a>00076 pool(128)
<a name="l00077"></a>00077 {
<a name="l00078"></a>00078 node * n = alloc_node();
<a name="l00079"></a>00079 head_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#92f6e29528609695332ea88cfb8e4210">set_ptr</a>(n);
<a name="l00080"></a>00080 tail_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#92f6e29528609695332ea88cfb8e4210">set_ptr</a>(n);
<a name="l00081"></a>00081 }
<a name="l00082"></a>00082
<a name="l00083"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#3c56256079e299d7387b9425b50065e4">00083</a> <span class="keyword">explicit</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#d1dc3f0389c839c0827a7b65230b1186">fifo</a>(std::size_t initial_nodes):
<a name="l00084"></a>00084 pool(initial_nodes)
<a name="l00085"></a>00085 {
<a name="l00086"></a>00086 node * n = alloc_node();
<a name="l00087"></a>00087 head_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#92f6e29528609695332ea88cfb8e4210">set_ptr</a>(n);
<a name="l00088"></a>00088 tail_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#92f6e29528609695332ea88cfb8e4210">set_ptr</a>(n);
<a name="l00089"></a>00089 }
<a name="l00090"></a>00090
<a name="l00091"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#29c07b74a9401c9d08d184d6c1d3631a">00091</a> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#29c07b74a9401c9d08d184d6c1d3631a">~fifo</a>(<span class="keywordtype">void</span>)
<a name="l00092"></a>00092 {
<a name="l00093"></a>00093 assert(<a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#13fed95d870b40a27f5503cc3556c145">empty</a>());
<a name="l00094"></a>00094 dealloc_node(head_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#465f241e8e107c36cd75237aca02aeb1">get_ptr</a>());
<a name="l00095"></a>00095 }
<a name="l00096"></a>00096
<a name="l00097"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#13fed95d870b40a27f5503cc3556c145">00097</a> <span class="keywordtype">bool</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#13fed95d870b40a27f5503cc3556c145">empty</a>(<span class="keywordtype">void</span>)
<a name="l00098"></a>00098 {
<a name="l00099"></a>00099 <span class="keywordflow">return</span> head_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#465f241e8e107c36cd75237aca02aeb1">get_ptr</a>() == tail_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#465f241e8e107c36cd75237aca02aeb1">get_ptr</a>();
<a name="l00100"></a>00100 }
<a name="l00101"></a>00101
<a name="l00102"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#ac4b595f38ad6015f58df3d78bcd7b5c">00102</a> <span class="keywordtype">bool</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#ac4b595f38ad6015f58df3d78bcd7b5c">enqueue</a>(T <span class="keyword">const</span> & t)
<a name="l00103"></a>00103 {
<a name="l00104"></a>00104 node * n = alloc_node(t);
<a name="l00105"></a>00105
<a name="l00106"></a>00106 <span class="keywordflow">if</span> (n == NULL)
<a name="l00107"></a>00107 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00108"></a>00108
<a name="l00109"></a>00109 <span class="keywordflow">for</span> (;;)
<a name="l00110"></a>00110 {
<a name="l00111"></a>00111 <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">atomic_node_ptr</a> tail (tail_);
<a name="l00112"></a>00112 <a class="code" href="namespaceboost_1_1lockfree.html#f41d0a217b42ed77a1a6469c64049645">read_memory_barrier</a>();
<a name="l00113"></a>00113 <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">atomic_node_ptr</a> next (tail->next);
<a name="l00114"></a>00114
<a name="l00115"></a>00115 <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1lockfree.html#7edfb617a8010d8d5f322a46f6eda1be">likely</a>(tail == tail_))
<a name="l00116"></a>00116 {
<a name="l00117"></a>00117 <span class="keywordflow">if</span> (next.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#465f241e8e107c36cd75237aca02aeb1">get_ptr</a>() == 0)
<a name="l00118"></a>00118 {
<a name="l00119"></a>00119 <span class="keywordflow">if</span> ( tail->next.cas(next, n) )
<a name="l00120"></a>00120 {
<a name="l00121"></a>00121 tail_.cas(tail, n);
<a name="l00122"></a>00122 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00123"></a>00123 }
<a name="l00124"></a>00124 }
<a name="l00125"></a>00125 <span class="keywordflow">else</span>
<a name="l00126"></a>00126 tail_.cas(tail, next.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#465f241e8e107c36cd75237aca02aeb1">get_ptr</a>());
<a name="l00127"></a>00127 }
<a name="l00128"></a>00128 }
<a name="l00129"></a>00129 }
<a name="l00130"></a>00130
<a name="l00131"></a><a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#acaa7b2a94f9d77f60131c4e16d6a0ce">00131</a> <span class="keywordtype">bool</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html#acaa7b2a94f9d77f60131c4e16d6a0ce">dequeue</a> (T * ret)
<a name="l00132"></a>00132 {
<a name="l00133"></a>00133 <span class="keywordflow">for</span> (;;)
<a name="l00134"></a>00134 {
<a name="l00135"></a>00135 <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">atomic_node_ptr</a> head (head_);
<a name="l00136"></a>00136 <a class="code" href="namespaceboost_1_1lockfree.html#f41d0a217b42ed77a1a6469c64049645">read_memory_barrier</a>();
<a name="l00137"></a>00137
<a name="l00138"></a>00138 <a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html">atomic_node_ptr</a> tail(tail_);
<a name="l00139"></a>00139 node * next = head->next.get_ptr();
<a name="l00140"></a>00140
<a name="l00141"></a>00141 <span class="keywordflow">if</span> (<a class="code" href="namespaceboost_1_1lockfree.html#7edfb617a8010d8d5f322a46f6eda1be">likely</a>(head == head_))
<a name="l00142"></a>00142 {
<a name="l00143"></a>00143 <span class="keywordflow">if</span> (head.get_ptr() == tail.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#465f241e8e107c36cd75237aca02aeb1">get_ptr</a>())
<a name="l00144"></a>00144 {
<a name="l00145"></a>00145 <span class="keywordflow">if</span> (next == 0)
<a name="l00146"></a>00146 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00147"></a>00147
<a name="l00148"></a>00148 tail_.<a class="code" href="classboost_1_1lockfree_1_1tagged__ptr.html#e11125fd877dc6ccde2cd38ba76061a4">cas</a>(tail, next);
<a name="l00149"></a>00149 }
<a name="l00150"></a>00150 <span class="keywordflow">else</span>
<a name="l00151"></a>00151 {
<a name="l00152"></a>00152 *ret = next->data;
<a name="l00153"></a>00153 <span class="keywordflow">if</span> (head_.cas(head, next))
<a name="l00154"></a>00154 {
<a name="l00155"></a>00155 dealloc_node(head.get_ptr());
<a name="l00156"></a>00156
<a name="l00157"></a>00157 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00158"></a>00158 }
<a name="l00159"></a>00159 }
<a name="l00160"></a>00160 }
<a name="l00161"></a>00161 }
<a name="l00162"></a>00162 }
<a name="l00163"></a>00163
<a name="l00164"></a>00164 <span class="keyword">private</span>:
<a name="l00165"></a>00165 node * alloc_node(<span class="keywordtype">void</span>)
<a name="l00166"></a>00166 {
<a name="l00167"></a>00167 node * chunk = pool.allocate();
<a name="l00168"></a>00168 <span class="keyword">new</span>(chunk) node();
<a name="l00169"></a>00169 <span class="keywordflow">return</span> chunk;
<a name="l00170"></a>00170 }
<a name="l00171"></a>00171
<a name="l00172"></a>00172 node * alloc_node(T <span class="keyword">const</span> & t)
<a name="l00173"></a>00173 {
<a name="l00174"></a>00174 node * chunk = pool.allocate();
<a name="l00175"></a>00175 <span class="keyword">new</span>(chunk) node(t);
<a name="l00176"></a>00176 <span class="keywordflow">return</span> chunk;
<a name="l00177"></a>00177 }
<a name="l00178"></a>00178
<a name="l00179"></a>00179 <span class="keywordtype">void</span> dealloc_node(node * n)
<a name="l00180"></a>00180 {
<a name="l00181"></a>00181 n->~node();
<a name="l00182"></a>00182 pool.deallocate(n);
<a name="l00183"></a>00183 }
<a name="l00184"></a>00184
<a name="l00185"></a>00185 atomic_node_ptr head_;
<a name="l00186"></a>00186 <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> padding_size = 64 - <span class="keyword">sizeof</span>(atomic_node_ptr); <span class="comment">/* cache lines on current cpus seem to</span>
<a name="l00187"></a>00187 <span class="comment"> * be 64 byte */</span>
<a name="l00188"></a>00188 <span class="keywordtype">char</span> padding1[padding_size];
<a name="l00189"></a>00189 atomic_node_ptr tail_;
<a name="l00190"></a>00190 <span class="keywordtype">char</span> padding2[padding_size];
<a name="l00191"></a>00191
<a name="l00192"></a>00192 pool_t pool;
<a name="l00193"></a>00193 };
<a name="l00194"></a>00194
<a name="l00195"></a>00195 } <span class="comment">/* namespace detail */</span>
<a name="l00196"></a>00196
<a name="l00201"></a>00201 <span class="keyword">template</span> <<span class="keyword">typename</span> T,
<a name="l00202"></a>00202 <span class="keyword">typename</span> freelist_t = caching_freelist_t,
<a name="l00203"></a>00203 <span class="keyword">typename</span> Alloc = std::allocator<T>
<a name="l00204"></a>00204 >
<a name="l00205"></a><a class="code" href="classboost_1_1lockfree_1_1fifo.html">00205</a> <span class="keyword">class </span><a class="code" href="classboost_1_1lockfree_1_1fifo.html">fifo</a>:
<a name="l00206"></a>00206 <span class="keyword">public</span> detail::<a class="code" href="classboost_1_1lockfree_1_1fifo.html">fifo</a><T, freelist_t, Alloc>
<a name="l00207"></a>00207 {
<a name="l00208"></a>00208 <span class="keyword">public</span>:
<a name="l00209"></a><a class="code" href="classboost_1_1lockfree_1_1fifo.html#2394c38cbec2b5e0121010103e8118e0">00209</a> <a class="code" href="classboost_1_1lockfree_1_1fifo.html#2394c38cbec2b5e0121010103e8118e0">fifo</a>(<span class="keywordtype">void</span>)
<a name="l00210"></a>00210 {}
<a name="l00211"></a>00211
<a name="l00212"></a><a class="code" href="classboost_1_1lockfree_1_1fifo.html#b72a1ea076243c457e28d95beb413578">00212</a> <span class="keyword">explicit</span> <a class="code" href="classboost_1_1lockfree_1_1fifo.html#2394c38cbec2b5e0121010103e8118e0">fifo</a>(std::size_t initial_nodes):
<a name="l00213"></a>00213 detail::<a class="code" href="classboost_1_1lockfree_1_1fifo.html">fifo</a><T, freelist_t, Alloc>(initial_nodes)
<a name="l00214"></a>00214 {}
<a name="l00215"></a>00215 };
<a name="l00216"></a>00216
<a name="l00217"></a>00217
<a name="l00223"></a>00223 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> freelist_t, <span class="keyword">typename</span> Alloc>
<a name="l00224"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html">00224</a> <span class="keyword">class </span><a class="code" href="classboost_1_1lockfree_1_1fifo.html">fifo</a><T*, freelist_t, Alloc>:
<a name="l00225"></a>00225 <span class="keyword">public</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html">detail::fifo<T*, freelist_t, Alloc></a>
<a name="l00226"></a>00226 {
<a name="l00227"></a>00227 <span class="keyword">typedef</span> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html">detail::fifo<T*, freelist_t, Alloc></a> <a class="code" href="classboost_1_1lockfree_1_1detail_1_1fifo.html">fifo_t</a>;
<a name="l00228"></a>00228
<a name="l00229"></a>00229 <span class="keyword">template</span> <<span class="keyword">typename</span> smart_ptr>
<a name="l00230"></a>00230 <span class="keywordtype">bool</span> dequeue_smart_ptr(smart_ptr & ptr)
<a name="l00231"></a>00231 {
<a name="l00232"></a>00232 T * result = 0;
<a name="l00233"></a>00233 <span class="keywordtype">bool</span> success = fifo_t::dequeue(&result);
<a name="l00234"></a>00234
<a name="l00235"></a>00235 <span class="keywordflow">if</span> (success)
<a name="l00236"></a>00236 ptr.reset(result);
<a name="l00237"></a>00237 <span class="keywordflow">return</span> success;
<a name="l00238"></a>00238 }
<a name="l00239"></a>00239
<a name="l00240"></a>00240 <span class="keyword">public</span>:
<a name="l00241"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#e1c13a579f8413b76d2441a5ae707bb9">00241</a> <a class="code" href="classboost_1_1lockfree_1_1fifo.html">fifo</a>(<span class="keywordtype">void</span>)
<a name="l00242"></a>00242 {}
<a name="l00243"></a>00243
<a name="l00244"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#66123f49550a1e023d0057c4fd066aa2">00244</a> <span class="keyword">explicit</span> <a class="code" href="classboost_1_1lockfree_1_1fifo.html">fifo</a>(std::size_t initial_nodes):
<a name="l00245"></a>00245 fifo_t(initial_nodes)
<a name="l00246"></a>00246 {}
<a name="l00247"></a>00247
<a name="l00248"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#06ded6b7cd740e1e14fde50dc0fa72e2">00248</a> <span class="keywordtype">bool</span> enqueue(T * t)
<a name="l00249"></a>00249 {
<a name="l00250"></a>00250 <span class="keywordflow">return</span> fifo_t::enqueue(t);
<a name="l00251"></a>00251 }
<a name="l00252"></a>00252
<a name="l00253"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#2d4b25e777bf7a2542882adb304a0b5b">00253</a> <span class="keywordtype">bool</span> dequeue (T ** ret)
<a name="l00254"></a>00254 {
<a name="l00255"></a>00255 <span class="keywordflow">return</span> fifo_t::dequeue(ret);
<a name="l00256"></a>00256 }
<a name="l00257"></a>00257
<a name="l00258"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#60742f54d2c1714c9c34f0020e38f37c">00258</a> <span class="keywordtype">bool</span> dequeue (std::auto_ptr<T> & ret)
<a name="l00259"></a>00259 {
<a name="l00260"></a>00260 <span class="keywordflow">return</span> dequeue_smart_ptr(ret);
<a name="l00261"></a>00261 }
<a name="l00262"></a>00262
<a name="l00263"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#b083f7d30c88eb45017729abdc772e3c">00263</a> <span class="keywordtype">bool</span> dequeue (boost::scoped_ptr<T> & ret)
<a name="l00264"></a>00264 {
<a name="l00265"></a>00265 BOOST_STATIC_ASSERT(<span class="keyword">sizeof</span>(boost::scoped_ptr<T>) == <span class="keyword">sizeof</span>(T*));
<a name="l00266"></a>00266 <span class="keywordflow">return</span> dequeue(reinterpret_cast<T**>(&ret));
<a name="l00267"></a>00267 }
<a name="l00268"></a>00268
<a name="l00269"></a><a class="code" href="classboost_1_1lockfree_1_1fifo_3_01_t_01_5_00_01freelist__t_00_01_alloc_01_4.html#674e7766acf9b2cb735c9f999c44e3cc">00269</a> <span class="keywordtype">bool</span> dequeue (boost::shared_ptr<T> & ret)
<a name="l00270"></a>00270 {
<a name="l00271"></a>00271 <span class="keywordflow">return</span> dequeue_smart_ptr(ret);
<a name="l00272"></a>00272 }
<a name="l00273"></a>00273 };
<a name="l00274"></a>00274
<a name="l00275"></a>00275 } <span class="comment">/* namespace lockfree */</span>
<a name="l00276"></a>00276 } <span class="comment">/* namespace boost */</span>
<a name="l00277"></a>00277
<a name="l00278"></a>00278
<a name="l00279"></a>00279 <span class="preprocessor">#endif </span><span class="comment">/* BOOST_LOCKFREE_FIFO_HPP_INCLUDED */</span>
</pre></div><hr size="1"><address style="align: right;"><small>Generated on Tue Sep 27 16:06:43 2011 for pion-net by
<a href="http://www.doxygen.org/index.html">
<img src="doxygen.png" alt="doxygen" align="middle" border="0"></a> 1.4.7 </small></address>
</body>
</html>
|