Google Git
Sign in
gem5 / public / gem5-resources / 8ccd059d5dcaaeffe15cd93c17f1e76e92907662 / . / src / parsec / disk-image / parsec / parsec-benchmark / pkgs / libs / tbblib / src / doc / html / a00280.html
blob: 94ec69533897b6becb9593c448f1ed6be18f568b [file] [log] [blame]
<!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>_concurrent_queue_internal.h 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&nbsp;Page</span></a></li>
<li><a href="modules.html"><span>Modules</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>
<li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
</ul></div>
<div class="tabs">
<ul>
<li><a href="files.html"><span>File&nbsp;List</span></a></li>
<li><a href="globals.html"><span>File&nbsp;Members</span></a></li>
</ul></div>
<h1>_concurrent_queue_internal.h</h1><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
<a name="l00002"></a>00002 <span class="comment"> Copyright 2005-2010 Intel Corporation. All Rights Reserved.</span>
<a name="l00003"></a>00003 <span class="comment"></span>
<a name="l00004"></a>00004 <span class="comment"> The source code contained or described herein and all documents related</span>
<a name="l00005"></a>00005 <span class="comment"> to the source code ("Material") are owned by Intel Corporation or its</span>
<a name="l00006"></a>00006 <span class="comment"> suppliers or licensors. Title to the Material remains with Intel</span>
<a name="l00007"></a>00007 <span class="comment"> Corporation or its suppliers and licensors. The Material is protected</span>
<a name="l00008"></a>00008 <span class="comment"> by worldwide copyright laws and treaty provisions. No part of the</span>
<a name="l00009"></a>00009 <span class="comment"> Material may be used, copied, reproduced, modified, published, uploaded,</span>
<a name="l00010"></a>00010 <span class="comment"> posted, transmitted, distributed, or disclosed in any way without</span>
<a name="l00011"></a>00011 <span class="comment"> Intel's prior express written permission.</span>
<a name="l00012"></a>00012 <span class="comment"></span>
<a name="l00013"></a>00013 <span class="comment"> No license under any patent, copyright, trade secret or other</span>
<a name="l00014"></a>00014 <span class="comment"> intellectual property right is granted to or conferred upon you by</span>
<a name="l00015"></a>00015 <span class="comment"> disclosure or delivery of the Materials, either expressly, by</span>
<a name="l00016"></a>00016 <span class="comment"> implication, inducement, estoppel or otherwise. Any license under such</span>
<a name="l00017"></a>00017 <span class="comment"> intellectual property rights must be express and approved by Intel in</span>
<a name="l00018"></a>00018 <span class="comment"> writing.</span>
<a name="l00019"></a>00019 <span class="comment">*/</span>
<a name="l00020"></a>00020
<a name="l00021"></a>00021 <span class="preprocessor">#ifndef __TBB_concurrent_queue_internal_H</span>
<a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define __TBB_concurrent_queue_internal_H</span>
<a name="l00023"></a>00023 <span class="preprocessor"></span>
<a name="l00024"></a>00024 <span class="preprocessor">#include "tbb_stddef.h"</span>
<a name="l00025"></a>00025 <span class="preprocessor">#include "tbb_machine.h"</span>
<a name="l00026"></a>00026 <span class="preprocessor">#include "atomic.h"</span>
<a name="l00027"></a>00027 <span class="preprocessor">#include "spin_mutex.h"</span>
<a name="l00028"></a>00028 <span class="preprocessor">#include "cache_aligned_allocator.h"</span>
<a name="l00029"></a>00029 <span class="preprocessor">#include "tbb_exception.h"</span>
<a name="l00030"></a>00030 <span class="preprocessor">#include &lt;new&gt;</span>
<a name="l00031"></a>00031
<a name="l00032"></a>00032 <span class="preprocessor">#if !TBB_USE_EXCEPTIONS &amp;&amp; _MSC_VER</span>
<a name="l00033"></a>00033 <span class="preprocessor"></span> <span class="comment">// Suppress "C++ exception handler used, but unwind semantics are not enabled" warning in STL headers</span>
<a name="l00034"></a>00034 <span class="preprocessor"> #pragma warning (push)</span>
<a name="l00035"></a>00035 <span class="preprocessor"></span><span class="preprocessor"> #pragma warning (disable: 4530)</span>
<a name="l00036"></a>00036 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00037"></a>00037 <span class="preprocessor"></span>
<a name="l00038"></a>00038 <span class="preprocessor">#include &lt;iterator&gt;</span>
<a name="l00039"></a>00039
<a name="l00040"></a>00040 <span class="preprocessor">#if !TBB_USE_EXCEPTIONS &amp;&amp; _MSC_VER</span>
<a name="l00041"></a>00041 <span class="preprocessor"></span><span class="preprocessor"> #pragma warning (pop)</span>
<a name="l00042"></a>00042 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00043"></a>00043 <span class="preprocessor"></span>
<a name="l00044"></a>00044
<a name="l00045"></a><a class="code" href="a00267.html">00045</a> <span class="keyword">namespace </span>tbb {
<a name="l00046"></a>00046
<a name="l00047"></a>00047 <span class="preprocessor">#if !__TBB_TEMPLATE_FRIENDS_BROKEN</span>
<a name="l00048"></a>00048 <span class="preprocessor"></span>
<a name="l00049"></a>00049 <span class="comment">// forward declaration</span>
<a name="l00050"></a><a class="code" href="a00273.html">00050</a> <span class="keyword">namespace </span>strict_ppl {
<a name="l00051"></a>00051 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt; <span class="keyword">class </span><a class="code" href="a00160.html">concurrent_queue</a>;
<a name="l00052"></a>00052 }
<a name="l00053"></a>00053
<a name="l00054"></a>00054 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt; <span class="keyword">class </span><a class="code" href="a00155.html">concurrent_bounded_queue</a>;
<a name="l00055"></a>00055
<a name="l00056"></a>00056 <span class="keyword">namespace </span>deprecated {
<a name="l00057"></a>00057 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A&gt; <span class="keyword">class </span><a class="code" href="a00160.html">concurrent_queue</a>;
<a name="l00058"></a>00058 }
<a name="l00059"></a>00059 <span class="preprocessor">#endif</span>
<a name="l00060"></a>00060 <span class="preprocessor"></span>
<a name="l00062"></a>00062 <span class="keyword">namespace </span>strict_ppl {
<a name="l00063"></a>00063
<a name="l00065"></a>00065 <span class="keyword">namespace </span>internal {
<a name="l00066"></a>00066
<a name="l00067"></a>00067 <span class="keyword">using namespace </span>tbb::internal;
<a name="l00068"></a>00068
<a name="l00069"></a>00069 <span class="keyword">typedef</span> size_t ticket;
<a name="l00070"></a>00070
<a name="l00071"></a>00071 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>micro_queue ;
<a name="l00072"></a>00072 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>micro_queue_pop_finalizer ;
<a name="l00073"></a>00073 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>concurrent_queue_base_v3;
<a name="l00074"></a>00074
<a name="l00076"></a>00076
<a name="l00079"></a>00079 <span class="keyword">struct </span>concurrent_queue_rep_base : no_copy {
<a name="l00080"></a>00080 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">friend</span> <span class="keyword">class </span>micro_queue;
<a name="l00081"></a>00081 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">friend</span> <span class="keyword">class </span>concurrent_queue_base_v3;
<a name="l00082"></a>00082
<a name="l00083"></a>00083 <span class="keyword">protected</span>:
<a name="l00085"></a>00085 <span class="keyword">static</span> <span class="keyword">const</span> size_t phi = 3;
<a name="l00086"></a>00086
<a name="l00087"></a>00087 <span class="keyword">public</span>:
<a name="l00088"></a>00088 <span class="comment">// must be power of 2</span>
<a name="l00089"></a>00089 <span class="keyword">static</span> <span class="keyword">const</span> size_t n_queue = 8;
<a name="l00090"></a>00090
<a name="l00092"></a>00092 <span class="keyword">struct </span>page {
<a name="l00093"></a>00093 page* next;
<a name="l00094"></a>00094 uintptr_t mask;
<a name="l00095"></a>00095 };
<a name="l00096"></a>00096
<a name="l00097"></a>00097 atomic&lt;ticket&gt; head_counter;
<a name="l00098"></a>00098 <span class="keywordtype">char</span> pad1[NFS_MaxLineSize-<span class="keyword">sizeof</span>(atomic&lt;ticket&gt;)];
<a name="l00099"></a>00099 atomic&lt;ticket&gt; tail_counter;
<a name="l00100"></a>00100 <span class="keywordtype">char</span> pad2[NFS_MaxLineSize-<span class="keyword">sizeof</span>(atomic&lt;ticket&gt;)];
<a name="l00101"></a>00101
<a name="l00103"></a>00103 size_t items_per_page;
<a name="l00104"></a>00104
<a name="l00106"></a>00106 size_t item_size;
<a name="l00107"></a>00107
<a name="l00109"></a>00109 atomic&lt;size_t&gt; n_invalid_entries;
<a name="l00110"></a>00110
<a name="l00111"></a>00111 <span class="keywordtype">char</span> pad3[NFS_MaxLineSize-<span class="keyword">sizeof</span>(size_t)-<span class="keyword">sizeof</span>(size_t)-<span class="keyword">sizeof</span>(atomic&lt;size_t&gt;)];
<a name="l00112"></a>00112 } ;
<a name="l00113"></a>00113
<a name="l00114"></a>00114 <span class="keyword">inline</span> <span class="keywordtype">bool</span> is_valid_page(<span class="keyword">const</span> concurrent_queue_rep_base::page* p) {
<a name="l00115"></a>00115 <span class="keywordflow">return</span> uintptr_t(p)&gt;1;
<a name="l00116"></a>00116 }
<a name="l00117"></a>00117
<a name="l00119"></a>00119
<a name="l00122"></a>00122 <span class="keyword">class </span>concurrent_queue_page_allocator
<a name="l00123"></a>00123 {
<a name="l00124"></a>00124 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">friend</span> <span class="keyword">class </span>micro_queue ;
<a name="l00125"></a>00125 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">friend</span> <span class="keyword">class </span>micro_queue_pop_finalizer ;
<a name="l00126"></a>00126 <span class="keyword">protected</span>:
<a name="l00127"></a>00127 <span class="keyword">virtual</span> ~concurrent_queue_page_allocator() {}
<a name="l00128"></a>00128 <span class="keyword">private</span>:
<a name="l00129"></a>00129 <span class="keyword">virtual</span> concurrent_queue_rep_base::page* allocate_page() = 0;
<a name="l00130"></a>00130 <span class="keyword">virtual</span> <span class="keywordtype">void</span> deallocate_page( concurrent_queue_rep_base::page* p ) = 0;
<a name="l00131"></a>00131 } ;
<a name="l00132"></a>00132
<a name="l00133"></a>00133 <span class="preprocessor">#if _MSC_VER &amp;&amp; !defined(__INTEL_COMPILER)</span>
<a name="l00134"></a>00134 <span class="preprocessor"></span><span class="comment">// unary minus operator applied to unsigned type, result still unsigned</span>
<a name="l00135"></a>00135 <span class="preprocessor">#pragma warning( push )</span>
<a name="l00136"></a>00136 <span class="preprocessor"></span><span class="preprocessor">#pragma warning( disable: 4146 )</span>
<a name="l00137"></a>00137 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00138"></a>00138 <span class="preprocessor"></span>
<a name="l00140"></a>00140
<a name="l00142"></a>00142 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00143"></a>00143 <span class="keyword">class </span>micro_queue : no_copy {
<a name="l00144"></a>00144 <span class="keyword">typedef</span> concurrent_queue_rep_base::page page;
<a name="l00145"></a>00145
<a name="l00147"></a>00147 <span class="keyword">class </span>destroyer: no_copy {
<a name="l00148"></a>00148 T&amp; my_value;
<a name="l00149"></a>00149 <span class="keyword">public</span>:
<a name="l00150"></a>00150 destroyer( T&amp; value ) : my_value(value) {}
<a name="l00151"></a>00151 ~destroyer() {my_value.~T();}
<a name="l00152"></a>00152 };
<a name="l00153"></a>00153
<a name="l00154"></a>00154 <span class="keywordtype">void</span> copy_item( page&amp; dst, size_t index, <span class="keyword">const</span> <span class="keywordtype">void</span>* src ) {
<a name="l00155"></a>00155 <span class="keyword">new</span>( &amp;get_ref(dst,index) ) T(*static_cast&lt;const T*&gt;(src));
<a name="l00156"></a>00156 }
<a name="l00157"></a>00157
<a name="l00158"></a>00158 <span class="keywordtype">void</span> copy_item( page&amp; dst, size_t dindex, <span class="keyword">const</span> page&amp; src, size_t sindex ) {
<a name="l00159"></a>00159 <span class="keyword">new</span>( &amp;get_ref(dst,dindex) ) T( get_ref(const_cast&lt;page&amp;&gt;(src),sindex) );
<a name="l00160"></a>00160 }
<a name="l00161"></a>00161
<a name="l00162"></a>00162 <span class="keywordtype">void</span> assign_and_destroy_item( <span class="keywordtype">void</span>* dst, page&amp; src, size_t index ) {
<a name="l00163"></a>00163 T&amp; from = get_ref(src,index);
<a name="l00164"></a>00164 destroyer d(from);
<a name="l00165"></a>00165 *static_cast&lt;T*&gt;(dst) = from;
<a name="l00166"></a>00166 }
<a name="l00167"></a>00167
<a name="l00168"></a>00168 <span class="keywordtype">void</span> spin_wait_until_my_turn( atomic&lt;ticket&gt;&amp; counter, ticket k, concurrent_queue_rep_base&amp; rb ) <span class="keyword">const </span>;
<a name="l00169"></a>00169
<a name="l00170"></a>00170 <span class="keyword">public</span>:
<a name="l00171"></a>00171 <span class="keyword">friend</span> <span class="keyword">class </span>micro_queue_pop_finalizer&lt;T&gt;;
<a name="l00172"></a>00172
<a name="l00173"></a>00173 <span class="keyword">struct </span>padded_page: page {
<a name="l00175"></a>00175 padded_page();
<a name="l00177"></a>00177 <span class="keywordtype">void</span> operator=( <span class="keyword">const</span> padded_page&amp; );
<a name="l00179"></a>00179 T last;
<a name="l00180"></a>00180 };
<a name="l00181"></a>00181
<a name="l00182"></a>00182 <span class="keyword">static</span> T&amp; get_ref( page&amp; p, size_t index ) {
<a name="l00183"></a>00183 <span class="keywordflow">return</span> (&amp;static_cast&lt;padded_page*&gt;(static_cast&lt;void*&gt;(&amp;p))-&gt;last)[index];
<a name="l00184"></a>00184 }
<a name="l00185"></a>00185
<a name="l00186"></a>00186 atomic&lt;page*&gt; head_page;
<a name="l00187"></a>00187 atomic&lt;ticket&gt; head_counter;
<a name="l00188"></a>00188
<a name="l00189"></a>00189 atomic&lt;page*&gt; tail_page;
<a name="l00190"></a>00190 atomic&lt;ticket&gt; tail_counter;
<a name="l00191"></a>00191
<a name="l00192"></a>00192 spin_mutex page_mutex;
<a name="l00193"></a>00193
<a name="l00194"></a>00194 <span class="keywordtype">void</span> push( <span class="keyword">const</span> <span class="keywordtype">void</span>* item, ticket k, concurrent_queue_base_v3&lt;T&gt;&amp; base ) ;
<a name="l00195"></a>00195
<a name="l00196"></a>00196 <span class="keywordtype">bool</span> pop( <span class="keywordtype">void</span>* dst, ticket k, concurrent_queue_base_v3&lt;T&gt;&amp; base ) ;
<a name="l00197"></a>00197
<a name="l00198"></a>00198 micro_queue&amp; assign( <span class="keyword">const</span> micro_queue&amp; src, concurrent_queue_base_v3&lt;T&gt;&amp; base ) ;
<a name="l00199"></a>00199
<a name="l00200"></a>00200 page* make_copy( concurrent_queue_base_v3&lt;T&gt;&amp; base, <span class="keyword">const</span> page* src_page, size_t begin_in_page, size_t end_in_page, ticket&amp; g_index ) ;
<a name="l00201"></a>00201
<a name="l00202"></a>00202 <span class="keywordtype">void</span> invalidate_page_and_rethrow( ticket k ) ;
<a name="l00203"></a>00203 };
<a name="l00204"></a>00204
<a name="l00205"></a>00205 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00206"></a>00206 <span class="keywordtype">void</span> micro_queue&lt;T&gt;::spin_wait_until_my_turn( atomic&lt;ticket&gt;&amp; counter, ticket k, concurrent_queue_rep_base&amp; rb )<span class="keyword"> const </span>{
<a name="l00207"></a>00207 atomic_backoff backoff;
<a name="l00208"></a>00208 <span class="keywordflow">do</span> {
<a name="l00209"></a>00209 backoff.pause();
<a name="l00210"></a>00210 <span class="keywordflow">if</span>( counter&amp;1 ) {
<a name="l00211"></a>00211 ++rb.n_invalid_entries;
<a name="l00212"></a>00212 throw_exception( eid_bad_last_alloc );
<a name="l00213"></a>00213 }
<a name="l00214"></a>00214 } <span class="keywordflow">while</span>( counter!=k ) ;
<a name="l00215"></a>00215 }
<a name="l00216"></a>00216
<a name="l00217"></a>00217 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00218"></a>00218 <span class="keywordtype">void</span> micro_queue&lt;T&gt;::push( <span class="keyword">const</span> <span class="keywordtype">void</span>* item, ticket k, concurrent_queue_base_v3&lt;T&gt;&amp; base ) {
<a name="l00219"></a>00219 k &amp;= -concurrent_queue_rep_base::n_queue;
<a name="l00220"></a>00220 page* p = NULL;
<a name="l00221"></a>00221 size_t index = k/concurrent_queue_rep_base::n_queue &amp; (base.my_rep-&gt;items_per_page-1);
<a name="l00222"></a>00222 <span class="keywordflow">if</span>( !index ) {
<a name="l00223"></a>00223 __TBB_TRY {
<a name="l00224"></a>00224 concurrent_queue_page_allocator&amp; pa = base;
<a name="l00225"></a>00225 p = pa.allocate_page();
<a name="l00226"></a>00226 } __TBB_CATCH (...) {
<a name="l00227"></a>00227 ++base.my_rep-&gt;n_invalid_entries;
<a name="l00228"></a>00228 invalidate_page_and_rethrow( k );
<a name="l00229"></a>00229 }
<a name="l00230"></a>00230 p-&gt;mask = 0;
<a name="l00231"></a>00231 p-&gt;next = NULL;
<a name="l00232"></a>00232 }
<a name="l00233"></a>00233
<a name="l00234"></a>00234 <span class="keywordflow">if</span>( tail_counter!=k ) spin_wait_until_my_turn( tail_counter, k, *base.my_rep );
<a name="l00235"></a>00235
<a name="l00236"></a>00236 <span class="keywordflow">if</span>( p ) {
<a name="l00237"></a>00237 spin_mutex::scoped_lock lock( page_mutex );
<a name="l00238"></a>00238 page* q = tail_page;
<a name="l00239"></a>00239 <span class="keywordflow">if</span>( is_valid_page(q) )
<a name="l00240"></a>00240 q-&gt;next = p;
<a name="l00241"></a>00241 <span class="keywordflow">else</span>
<a name="l00242"></a>00242 head_page = p;
<a name="l00243"></a>00243 tail_page = p;
<a name="l00244"></a>00244 } <span class="keywordflow">else</span> {
<a name="l00245"></a>00245 p = tail_page;
<a name="l00246"></a>00246 }
<a name="l00247"></a>00247
<a name="l00248"></a>00248 __TBB_TRY {
<a name="l00249"></a>00249 copy_item( *p, index, item );
<a name="l00250"></a>00250 <span class="comment">// If no exception was thrown, mark item as present.</span>
<a name="l00251"></a>00251 p-&gt;mask |= uintptr_t(1)&lt;&lt;index;
<a name="l00252"></a>00252 tail_counter += concurrent_queue_rep_base::n_queue;
<a name="l00253"></a>00253 } __TBB_CATCH (...) {
<a name="l00254"></a>00254 ++base.my_rep-&gt;n_invalid_entries;
<a name="l00255"></a>00255 tail_counter += concurrent_queue_rep_base::n_queue;
<a name="l00256"></a>00256 __TBB_RETHROW();
<a name="l00257"></a>00257 }
<a name="l00258"></a>00258 }
<a name="l00259"></a>00259
<a name="l00260"></a>00260 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00261"></a>00261 <span class="keywordtype">bool</span> micro_queue&lt;T&gt;::pop( <span class="keywordtype">void</span>* dst, ticket k, concurrent_queue_base_v3&lt;T&gt;&amp; base ) {
<a name="l00262"></a>00262 k &amp;= -concurrent_queue_rep_base::n_queue;
<a name="l00263"></a>00263 <span class="keywordflow">if</span>( head_counter!=k ) spin_wait_until_eq( head_counter, k );
<a name="l00264"></a>00264 <span class="keywordflow">if</span>( tail_counter==k ) spin_wait_while_eq( tail_counter, k );
<a name="l00265"></a>00265 page&amp; p = *head_page;
<a name="l00266"></a>00266 __TBB_ASSERT( &amp;p, NULL );
<a name="l00267"></a>00267 size_t index = k/concurrent_queue_rep_base::n_queue &amp; (base.my_rep-&gt;items_per_page-1);
<a name="l00268"></a>00268 <span class="keywordtype">bool</span> success = <span class="keyword">false</span>;
<a name="l00269"></a>00269 {
<a name="l00270"></a>00270 micro_queue_pop_finalizer&lt;T&gt; finalizer( *<span class="keyword">this</span>, base, k+concurrent_queue_rep_base::n_queue, index==base.my_rep-&gt;items_per_page-1 ? &amp;p : NULL );
<a name="l00271"></a>00271 <span class="keywordflow">if</span>( p.mask &amp; uintptr_t(1)&lt;&lt;index ) {
<a name="l00272"></a>00272 success = <span class="keyword">true</span>;
<a name="l00273"></a>00273 assign_and_destroy_item( dst, p, index );
<a name="l00274"></a>00274 } <span class="keywordflow">else</span> {
<a name="l00275"></a>00275 --base.my_rep-&gt;n_invalid_entries;
<a name="l00276"></a>00276 }
<a name="l00277"></a>00277 }
<a name="l00278"></a>00278 <span class="keywordflow">return</span> success;
<a name="l00279"></a>00279 }
<a name="l00280"></a>00280
<a name="l00281"></a>00281 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00282"></a>00282 micro_queue&lt;T&gt;&amp; micro_queue&lt;T&gt;::assign( <span class="keyword">const</span> micro_queue&lt;T&gt;&amp; src, concurrent_queue_base_v3&lt;T&gt;&amp; base ) {
<a name="l00283"></a>00283 head_counter = src.head_counter;
<a name="l00284"></a>00284 tail_counter = src.tail_counter;
<a name="l00285"></a>00285 page_mutex = src.page_mutex;
<a name="l00286"></a>00286
<a name="l00287"></a>00287 <span class="keyword">const</span> page* srcp = src.head_page;
<a name="l00288"></a>00288 <span class="keywordflow">if</span>( is_valid_page(srcp) ) {
<a name="l00289"></a>00289 ticket g_index = head_counter;
<a name="l00290"></a>00290 __TBB_TRY {
<a name="l00291"></a>00291 size_t n_items = (tail_counter-head_counter)/concurrent_queue_rep_base::n_queue;
<a name="l00292"></a>00292 size_t index = head_counter/concurrent_queue_rep_base::n_queue &amp; (base.my_rep-&gt;items_per_page-1);
<a name="l00293"></a>00293 size_t end_in_first_page = (index+n_items&lt;base.my_rep-&gt;items_per_page)?(index+n_items):base.my_rep-&gt;items_per_page;
<a name="l00294"></a>00294
<a name="l00295"></a>00295 head_page = make_copy( base, srcp, index, end_in_first_page, g_index );
<a name="l00296"></a>00296 page* cur_page = head_page;
<a name="l00297"></a>00297
<a name="l00298"></a>00298 <span class="keywordflow">if</span>( srcp != src.tail_page ) {
<a name="l00299"></a>00299 <span class="keywordflow">for</span>( srcp = srcp-&gt;next; srcp!=src.tail_page; srcp=srcp-&gt;next ) {
<a name="l00300"></a>00300 cur_page-&gt;next = make_copy( base, srcp, 0, base.my_rep-&gt;items_per_page, g_index );
<a name="l00301"></a>00301 cur_page = cur_page-&gt;next;
<a name="l00302"></a>00302 }
<a name="l00303"></a>00303
<a name="l00304"></a>00304 __TBB_ASSERT( srcp==src.tail_page, NULL );
<a name="l00305"></a>00305 size_t last_index = tail_counter/concurrent_queue_rep_base::n_queue &amp; (base.my_rep-&gt;items_per_page-1);
<a name="l00306"></a>00306 <span class="keywordflow">if</span>( last_index==0 ) last_index = base.my_rep-&gt;items_per_page;
<a name="l00307"></a>00307
<a name="l00308"></a>00308 cur_page-&gt;next = make_copy( base, srcp, 0, last_index, g_index );
<a name="l00309"></a>00309 cur_page = cur_page-&gt;next;
<a name="l00310"></a>00310 }
<a name="l00311"></a>00311 tail_page = cur_page;
<a name="l00312"></a>00312 } __TBB_CATCH (...) {
<a name="l00313"></a>00313 invalidate_page_and_rethrow( g_index );
<a name="l00314"></a>00314 }
<a name="l00315"></a>00315 } <span class="keywordflow">else</span> {
<a name="l00316"></a>00316 head_page = tail_page = NULL;
<a name="l00317"></a>00317 }
<a name="l00318"></a>00318 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00319"></a>00319 }
<a name="l00320"></a>00320
<a name="l00321"></a>00321 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00322"></a>00322 <span class="keywordtype">void</span> micro_queue&lt;T&gt;::invalidate_page_and_rethrow( ticket k ) {
<a name="l00323"></a>00323 <span class="comment">// Append an invalid page at address 1 so that no more pushes are allowed.</span>
<a name="l00324"></a>00324 page* invalid_page = (page*)uintptr_t(1);
<a name="l00325"></a>00325 {
<a name="l00326"></a>00326 spin_mutex::scoped_lock lock( page_mutex );
<a name="l00327"></a>00327 tail_counter = k+concurrent_queue_rep_base::n_queue+1;
<a name="l00328"></a>00328 page* q = tail_page;
<a name="l00329"></a>00329 <span class="keywordflow">if</span>( is_valid_page(q) )
<a name="l00330"></a>00330 q-&gt;next = invalid_page;
<a name="l00331"></a>00331 <span class="keywordflow">else</span>
<a name="l00332"></a>00332 head_page = invalid_page;
<a name="l00333"></a>00333 tail_page = invalid_page;
<a name="l00334"></a>00334 }
<a name="l00335"></a>00335 __TBB_RETHROW();
<a name="l00336"></a>00336 }
<a name="l00337"></a>00337
<a name="l00338"></a>00338 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00339"></a>00339 concurrent_queue_rep_base::page* micro_queue&lt;T&gt;::make_copy( concurrent_queue_base_v3&lt;T&gt;&amp; base, <span class="keyword">const</span> concurrent_queue_rep_base::page* src_page, size_t begin_in_page, size_t end_in_page, ticket&amp; g_index ) {
<a name="l00340"></a>00340 concurrent_queue_page_allocator&amp; pa = base;
<a name="l00341"></a>00341 page* new_page = pa.allocate_page();
<a name="l00342"></a>00342 new_page-&gt;next = NULL;
<a name="l00343"></a>00343 new_page-&gt;mask = src_page-&gt;mask;
<a name="l00344"></a>00344 <span class="keywordflow">for</span>( ; begin_in_page!=end_in_page; ++begin_in_page, ++g_index )
<a name="l00345"></a>00345 <span class="keywordflow">if</span>( new_page-&gt;mask &amp; uintptr_t(1)&lt;&lt;begin_in_page )
<a name="l00346"></a>00346 copy_item( *new_page, begin_in_page, *src_page, begin_in_page );
<a name="l00347"></a>00347 <span class="keywordflow">return</span> new_page;
<a name="l00348"></a>00348 }
<a name="l00349"></a>00349
<a name="l00350"></a>00350 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00351"></a>00351 <span class="keyword">class </span>micro_queue_pop_finalizer: no_copy {
<a name="l00352"></a>00352 <span class="keyword">typedef</span> concurrent_queue_rep_base::page page;
<a name="l00353"></a>00353 ticket my_ticket;
<a name="l00354"></a>00354 micro_queue&lt;T&gt;&amp; my_queue;
<a name="l00355"></a>00355 page* my_page;
<a name="l00356"></a>00356 concurrent_queue_page_allocator&amp; allocator;
<a name="l00357"></a>00357 <span class="keyword">public</span>:
<a name="l00358"></a>00358 micro_queue_pop_finalizer( micro_queue&lt;T&gt;&amp; queue, concurrent_queue_base_v3&lt;T&gt;&amp; b, ticket k, page* p ) :
<a name="l00359"></a>00359 my_ticket(k), my_queue(queue), my_page(p), allocator(b)
<a name="l00360"></a>00360 {}
<a name="l00361"></a>00361 ~micro_queue_pop_finalizer() ;
<a name="l00362"></a>00362 };
<a name="l00363"></a>00363
<a name="l00364"></a>00364 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00365"></a>00365 micro_queue_pop_finalizer&lt;T&gt;::~micro_queue_pop_finalizer() {
<a name="l00366"></a>00366 page* p = my_page;
<a name="l00367"></a>00367 <span class="keywordflow">if</span>( is_valid_page(p) ) {
<a name="l00368"></a>00368 spin_mutex::scoped_lock lock( my_queue.page_mutex );
<a name="l00369"></a>00369 page* q = p-&gt;next;
<a name="l00370"></a>00370 my_queue.head_page = q;
<a name="l00371"></a>00371 <span class="keywordflow">if</span>( !is_valid_page(q) ) {
<a name="l00372"></a>00372 my_queue.tail_page = NULL;
<a name="l00373"></a>00373 }
<a name="l00374"></a>00374 }
<a name="l00375"></a>00375 my_queue.head_counter = my_ticket;
<a name="l00376"></a>00376 <span class="keywordflow">if</span>( is_valid_page(p) ) {
<a name="l00377"></a>00377 allocator.deallocate_page( p );
<a name="l00378"></a>00378 }
<a name="l00379"></a>00379 }
<a name="l00380"></a>00380
<a name="l00381"></a>00381 <span class="preprocessor">#if _MSC_VER &amp;&amp; !defined(__INTEL_COMPILER)</span>
<a name="l00382"></a>00382 <span class="preprocessor"></span><span class="preprocessor">#pragma warning( pop )</span>
<a name="l00383"></a>00383 <span class="preprocessor"></span><span class="preprocessor">#endif // warning 4146 is back</span>
<a name="l00384"></a>00384 <span class="preprocessor"></span>
<a name="l00385"></a>00385 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>concurrent_queue_iterator_rep ;
<a name="l00386"></a>00386 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span>concurrent_queue_iterator_base_v3;
<a name="l00387"></a>00387
<a name="l00389"></a>00389
<a name="l00392"></a>00392 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00393"></a>00393 <span class="keyword">struct </span>concurrent_queue_rep : <span class="keyword">public</span> concurrent_queue_rep_base {
<a name="l00394"></a>00394 micro_queue&lt;T&gt; array[n_queue];
<a name="l00395"></a>00395
<a name="l00397"></a>00397 <span class="keyword">static</span> size_t index( ticket k ) {
<a name="l00398"></a>00398 <span class="keywordflow">return</span> k*phi%n_queue;
<a name="l00399"></a>00399 }
<a name="l00400"></a>00400
<a name="l00401"></a>00401 micro_queue&lt;T&gt;&amp; choose( ticket k ) {
<a name="l00402"></a>00402 <span class="comment">// The formula here approximates LRU in a cache-oblivious way.</span>
<a name="l00403"></a>00403 <span class="keywordflow">return</span> array[index(k)];
<a name="l00404"></a>00404 }
<a name="l00405"></a>00405 };
<a name="l00406"></a>00406
<a name="l00408"></a>00408
<a name="l00412"></a>00412 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00413"></a>00413 <span class="keyword">class </span>concurrent_queue_base_v3: <span class="keyword">public</span> concurrent_queue_page_allocator {
<a name="l00415"></a>00415 concurrent_queue_rep&lt;T&gt;* my_rep;
<a name="l00416"></a>00416
<a name="l00417"></a>00417 <span class="keyword">friend</span> <span class="keyword">struct </span>concurrent_queue_rep&lt;T&gt;;
<a name="l00418"></a>00418 <span class="keyword">friend</span> <span class="keyword">class </span>micro_queue&lt;T&gt;;
<a name="l00419"></a>00419 <span class="keyword">friend</span> <span class="keyword">class </span>concurrent_queue_iterator_rep&lt;T&gt;;
<a name="l00420"></a>00420 <span class="keyword">friend</span> <span class="keyword">class </span>concurrent_queue_iterator_base_v3&lt;T&gt;;
<a name="l00421"></a>00421
<a name="l00422"></a>00422 <span class="keyword">protected</span>:
<a name="l00423"></a>00423 <span class="keyword">typedef</span> <span class="keyword">typename</span> concurrent_queue_rep&lt;T&gt;::page page;
<a name="l00424"></a>00424
<a name="l00425"></a>00425 <span class="keyword">private</span>:
<a name="l00426"></a>00426 <span class="keyword">typedef</span> <span class="keyword">typename</span> micro_queue&lt;T&gt;::padded_page padded_page;
<a name="l00427"></a>00427
<a name="l00428"></a>00428 <span class="comment">/* override */</span> <span class="keyword">virtual</span> page *allocate_page() {
<a name="l00429"></a>00429 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00430"></a>00430 size_t n = <span class="keyword">sizeof</span>(padded_page) + (r.items_per_page-1)*<span class="keyword">sizeof</span>(T);
<a name="l00431"></a>00431 <span class="keywordflow">return</span> reinterpret_cast&lt;page*&gt;(allocate_block ( n ));
<a name="l00432"></a>00432 }
<a name="l00433"></a>00433
<a name="l00434"></a>00434 <span class="comment">/* override */</span> <span class="keyword">virtual</span> <span class="keywordtype">void</span> deallocate_page( concurrent_queue_rep_base::page *p ) {
<a name="l00435"></a>00435 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00436"></a>00436 size_t n = <span class="keyword">sizeof</span>(padded_page) + (r.items_per_page-1)*<span class="keyword">sizeof</span>(T);
<a name="l00437"></a>00437 deallocate_block( reinterpret_cast&lt;void*&gt;(p), n );
<a name="l00438"></a>00438 }
<a name="l00439"></a>00439
<a name="l00441"></a>00441 <span class="keyword">virtual</span> <span class="keywordtype">void</span> *allocate_block( size_t n ) = 0;
<a name="l00442"></a>00442
<a name="l00444"></a>00444 <span class="keyword">virtual</span> <span class="keywordtype">void</span> deallocate_block( <span class="keywordtype">void</span> *p, size_t n ) = 0;
<a name="l00445"></a>00445
<a name="l00446"></a>00446 <span class="keyword">protected</span>:
<a name="l00447"></a>00447 concurrent_queue_base_v3();
<a name="l00448"></a>00448
<a name="l00449"></a>00449 <span class="comment">/* override */</span> <span class="keyword">virtual</span> ~concurrent_queue_base_v3() {
<a name="l00450"></a>00450 <span class="preprocessor">#if __TBB_USE_ASSERT</span>
<a name="l00451"></a>00451 <span class="preprocessor"></span> size_t nq = my_rep-&gt;n_queue;
<a name="l00452"></a>00452 <span class="keywordflow">for</span>( size_t i=0; i&lt;nq; i++ )
<a name="l00453"></a>00453 __TBB_ASSERT( my_rep-&gt;array[i].tail_page==NULL, <span class="stringliteral">"pages were not freed properly"</span> );
<a name="l00454"></a>00454 #endif <span class="comment">/* __TBB_USE_ASSERT */</span>
<a name="l00455"></a>00455 cache_aligned_allocator&lt;concurrent_queue_rep&lt;T&gt; &gt;().deallocate(my_rep,1);
<a name="l00456"></a>00456 }
<a name="l00457"></a>00457
<a name="l00459"></a>00459 <span class="keywordtype">void</span> internal_push( <span class="keyword">const</span> <span class="keywordtype">void</span>* src ) {
<a name="l00460"></a>00460 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00461"></a>00461 ticket k = r.tail_counter++;
<a name="l00462"></a>00462 r.choose(k).push( src, k, *<span class="keyword">this</span> );
<a name="l00463"></a>00463 }
<a name="l00464"></a>00464
<a name="l00466"></a>00466
<a name="l00467"></a>00467 <span class="keywordtype">bool</span> internal_try_pop( <span class="keywordtype">void</span>* dst ) ;
<a name="l00468"></a>00468
<a name="l00470"></a>00470 size_t internal_size() <span class="keyword">const </span>;
<a name="l00471"></a>00471
<a name="l00473"></a>00473 <span class="keywordtype">bool</span> internal_empty() <span class="keyword">const </span>;
<a name="l00474"></a>00474
<a name="l00476"></a>00476 <span class="comment">/* note that the name may be misleading, but it remains so due to a historical accident. */</span>
<a name="l00477"></a>00477 <span class="keywordtype">void</span> internal_finish_clear() ;
<a name="l00478"></a>00478
<a name="l00480"></a>00480 <span class="keywordtype">void</span> internal_throw_exception()<span class="keyword"> const </span>{
<a name="l00481"></a>00481 throw_exception( eid_bad_alloc );
<a name="l00482"></a>00482 }
<a name="l00483"></a>00483
<a name="l00485"></a>00485 <span class="keywordtype">void</span> assign( <span class="keyword">const</span> concurrent_queue_base_v3&amp; src ) ;
<a name="l00486"></a>00486 };
<a name="l00487"></a>00487
<a name="l00488"></a>00488 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00489"></a>00489 concurrent_queue_base_v3&lt;T&gt;::concurrent_queue_base_v3() {
<a name="l00490"></a>00490 <span class="keyword">const</span> size_t item_size = <span class="keyword">sizeof</span>(T);
<a name="l00491"></a>00491 my_rep = cache_aligned_allocator&lt;concurrent_queue_rep&lt;T&gt; &gt;().allocate(1);
<a name="l00492"></a>00492 __TBB_ASSERT( (size_t)my_rep % NFS_GetLineSize()==0, <span class="stringliteral">"alignment error"</span> );
<a name="l00493"></a>00493 __TBB_ASSERT( (size_t)&amp;my_rep-&gt;head_counter % NFS_GetLineSize()==0, <span class="stringliteral">"alignment error"</span> );
<a name="l00494"></a>00494 __TBB_ASSERT( (size_t)&amp;my_rep-&gt;tail_counter % NFS_GetLineSize()==0, <span class="stringliteral">"alignment error"</span> );
<a name="l00495"></a>00495 __TBB_ASSERT( (size_t)&amp;my_rep-&gt;array % NFS_GetLineSize()==0, <span class="stringliteral">"alignment error"</span> );
<a name="l00496"></a>00496 memset(my_rep,0,<span class="keyword">sizeof</span>(concurrent_queue_rep&lt;T&gt;));
<a name="l00497"></a>00497 my_rep-&gt;item_size = item_size;
<a name="l00498"></a>00498 my_rep-&gt;items_per_page = item_size&lt;=8 ? 32 :
<a name="l00499"></a>00499 item_size&lt;=16 ? 16 :
<a name="l00500"></a>00500 item_size&lt;=32 ? 8 :
<a name="l00501"></a>00501 item_size&lt;=64 ? 4 :
<a name="l00502"></a>00502 item_size&lt;=128 ? 2 :
<a name="l00503"></a>00503 1;
<a name="l00504"></a>00504 }
<a name="l00505"></a>00505
<a name="l00506"></a>00506 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00507"></a>00507 <span class="keywordtype">bool</span> concurrent_queue_base_v3&lt;T&gt;::internal_try_pop( <span class="keywordtype">void</span>* dst ) {
<a name="l00508"></a>00508 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00509"></a>00509 ticket k;
<a name="l00510"></a>00510 <span class="keywordflow">do</span> {
<a name="l00511"></a>00511 k = r.head_counter;
<a name="l00512"></a>00512 <span class="keywordflow">for</span>(;;) {
<a name="l00513"></a>00513 <span class="keywordflow">if</span>( r.tail_counter&lt;=k ) {
<a name="l00514"></a>00514 <span class="comment">// Queue is empty </span>
<a name="l00515"></a>00515 <span class="keywordflow">return</span> <span class="keyword">false</span>;
<a name="l00516"></a>00516 }
<a name="l00517"></a>00517 <span class="comment">// Queue had item with ticket k when we looked. Attempt to get that item.</span>
<a name="l00518"></a>00518 ticket tk=k;
<a name="l00519"></a>00519 <span class="preprocessor">#if defined(_MSC_VER) &amp;&amp; defined(_Wp64)</span>
<a name="l00520"></a>00520 <span class="preprocessor"></span><span class="preprocessor"> #pragma warning (push)</span>
<a name="l00521"></a>00521 <span class="preprocessor"></span><span class="preprocessor"> #pragma warning (disable: 4267)</span>
<a name="l00522"></a>00522 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00523"></a>00523 <span class="preprocessor"></span> k = r.head_counter.compare_and_swap( tk+1, tk );
<a name="l00524"></a>00524 <span class="preprocessor">#if defined(_MSC_VER) &amp;&amp; defined(_Wp64)</span>
<a name="l00525"></a>00525 <span class="preprocessor"></span><span class="preprocessor"> #pragma warning (pop)</span>
<a name="l00526"></a>00526 <span class="preprocessor"></span><span class="preprocessor">#endif</span>
<a name="l00527"></a>00527 <span class="preprocessor"></span> <span class="keywordflow">if</span>( k==tk )
<a name="l00528"></a>00528 <span class="keywordflow">break</span>;
<a name="l00529"></a>00529 <span class="comment">// Another thread snatched the item, retry.</span>
<a name="l00530"></a>00530 }
<a name="l00531"></a>00531 } <span class="keywordflow">while</span>( !r.choose( k ).pop( dst, k, *<span class="keyword">this</span> ) );
<a name="l00532"></a>00532 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00533"></a>00533 }
<a name="l00534"></a>00534
<a name="l00535"></a>00535 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00536"></a>00536 size_t concurrent_queue_base_v3&lt;T&gt;::internal_size()<span class="keyword"> const </span>{
<a name="l00537"></a>00537 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00538"></a>00538 __TBB_ASSERT( <span class="keyword">sizeof</span>(ptrdiff_t)&lt;=<span class="keyword">sizeof</span>(size_t), NULL );
<a name="l00539"></a>00539 ticket hc = r.head_counter;
<a name="l00540"></a>00540 size_t nie = r.n_invalid_entries;
<a name="l00541"></a>00541 ticket tc = r.tail_counter;
<a name="l00542"></a>00542 __TBB_ASSERT( hc!=tc || !nie, NULL );
<a name="l00543"></a>00543 ptrdiff_t sz = tc-hc-nie;
<a name="l00544"></a>00544 <span class="keywordflow">return</span> sz&lt;0 ? 0 : size_t(sz);
<a name="l00545"></a>00545 }
<a name="l00546"></a>00546
<a name="l00547"></a>00547 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00548"></a>00548 <span class="keywordtype">bool</span> concurrent_queue_base_v3&lt;T&gt;::internal_empty()<span class="keyword"> const </span>{
<a name="l00549"></a>00549 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00550"></a>00550 ticket tc = r.tail_counter;
<a name="l00551"></a>00551 ticket hc = r.head_counter;
<a name="l00552"></a>00552 <span class="comment">// if tc!=r.tail_counter, the queue was not empty at some point between the two reads.</span>
<a name="l00553"></a>00553 <span class="keywordflow">return</span> tc==r.tail_counter &amp;&amp; tc==hc+r.n_invalid_entries ;
<a name="l00554"></a>00554 }
<a name="l00555"></a>00555
<a name="l00556"></a>00556 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00557"></a>00557 <span class="keywordtype">void</span> concurrent_queue_base_v3&lt;T&gt;::internal_finish_clear() {
<a name="l00558"></a>00558 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00559"></a>00559 size_t nq = r.n_queue;
<a name="l00560"></a>00560 <span class="keywordflow">for</span>( size_t i=0; i&lt;nq; ++i ) {
<a name="l00561"></a>00561 page* tp = r.array[i].tail_page;
<a name="l00562"></a>00562 <span class="keywordflow">if</span>( is_valid_page(tp) ) {
<a name="l00563"></a>00563 __TBB_ASSERT( r.array[i].head_page==tp, <span class="stringliteral">"at most one page should remain"</span> );
<a name="l00564"></a>00564 deallocate_page( tp );
<a name="l00565"></a>00565 r.array[i].tail_page = NULL;
<a name="l00566"></a>00566 } <span class="keywordflow">else</span>
<a name="l00567"></a>00567 __TBB_ASSERT( !is_valid_page(r.array[i].head_page), <span class="stringliteral">"head page pointer corrupt?"</span> );
<a name="l00568"></a>00568 }
<a name="l00569"></a>00569 }
<a name="l00570"></a>00570
<a name="l00571"></a>00571 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00572"></a>00572 <span class="keywordtype">void</span> concurrent_queue_base_v3&lt;T&gt;::assign( <span class="keyword">const</span> concurrent_queue_base_v3&amp; src ) {
<a name="l00573"></a>00573 concurrent_queue_rep&lt;T&gt;&amp; r = *my_rep;
<a name="l00574"></a>00574 r.items_per_page = src.my_rep-&gt;items_per_page;
<a name="l00575"></a>00575
<a name="l00576"></a>00576 <span class="comment">// copy concurrent_queue_rep.</span>
<a name="l00577"></a>00577 r.head_counter = src.my_rep-&gt;head_counter;
<a name="l00578"></a>00578 r.tail_counter = src.my_rep-&gt;tail_counter;
<a name="l00579"></a>00579 r.n_invalid_entries = src.my_rep-&gt;n_invalid_entries;
<a name="l00580"></a>00580
<a name="l00581"></a>00581 <span class="comment">// copy micro_queues</span>
<a name="l00582"></a>00582 <span class="keywordflow">for</span>( size_t i = 0; i&lt;r.n_queue; ++i )
<a name="l00583"></a>00583 r.array[i].assign( src.my_rep-&gt;array[i], *<span class="keyword">this</span>);
<a name="l00584"></a>00584
<a name="l00585"></a>00585 __TBB_ASSERT( r.head_counter==src.my_rep-&gt;head_counter &amp;&amp; r.tail_counter==src.my_rep-&gt;tail_counter,
<a name="l00586"></a>00586 <span class="stringliteral">"the source concurrent queue should not be concurrently modified."</span> );
<a name="l00587"></a>00587 }
<a name="l00588"></a>00588
<a name="l00589"></a>00589 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Container, <span class="keyword">typename</span> Value&gt; <span class="keyword">class </span>concurrent_queue_iterator;
<a name="l00590"></a>00590
<a name="l00591"></a>00591 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00592"></a>00592 <span class="keyword">class </span>concurrent_queue_iterator_rep: no_assign {
<a name="l00593"></a>00593 <span class="keyword">typedef</span> <span class="keyword">typename</span> micro_queue&lt;T&gt;::padded_page padded_page;
<a name="l00594"></a>00594 <span class="keyword">public</span>:
<a name="l00595"></a>00595 ticket head_counter;
<a name="l00596"></a>00596 <span class="keyword">const</span> concurrent_queue_base_v3&lt;T&gt;&amp; my_queue;
<a name="l00597"></a>00597 <span class="keyword">typename</span> concurrent_queue_base_v3&lt;T&gt;::page* array[concurrent_queue_rep&lt;T&gt;::n_queue];
<a name="l00598"></a>00598 concurrent_queue_iterator_rep( <span class="keyword">const</span> concurrent_queue_base_v3&lt;T&gt;&amp; queue ) :
<a name="l00599"></a>00599 head_counter(queue.my_rep-&gt;head_counter),
<a name="l00600"></a>00600 my_queue(queue)
<a name="l00601"></a>00601 {
<a name="l00602"></a>00602 <span class="keywordflow">for</span>( size_t k=0; k&lt;concurrent_queue_rep&lt;T&gt;::n_queue; ++k )
<a name="l00603"></a>00603 array[k] = queue.my_rep-&gt;array[k].head_page;
<a name="l00604"></a>00604 }
<a name="l00605"></a>00605
<a name="l00607"></a>00607 <span class="keywordtype">bool</span> get_item( T*&amp; item, size_t k ) ;
<a name="l00608"></a>00608 };
<a name="l00609"></a>00609
<a name="l00610"></a>00610 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00611"></a>00611 <span class="keywordtype">bool</span> concurrent_queue_iterator_rep&lt;T&gt;::get_item( T*&amp; item, size_t k ) {
<a name="l00612"></a>00612 <span class="keywordflow">if</span>( k==my_queue.my_rep-&gt;tail_counter ) {
<a name="l00613"></a>00613 item = NULL;
<a name="l00614"></a>00614 <span class="keywordflow">return</span> <span class="keyword">true</span>;
<a name="l00615"></a>00615 } <span class="keywordflow">else</span> {
<a name="l00616"></a>00616 <span class="keyword">typename</span> concurrent_queue_base_v3&lt;T&gt;::page* p = array[concurrent_queue_rep&lt;T&gt;::index(k)];
<a name="l00617"></a>00617 __TBB_ASSERT(p,NULL);
<a name="l00618"></a>00618 size_t i = k/concurrent_queue_rep&lt;T&gt;::n_queue &amp; (my_queue.my_rep-&gt;items_per_page-1);
<a name="l00619"></a>00619 item = &amp;micro_queue&lt;T&gt;::get_ref(*p,i);
<a name="l00620"></a>00620 <span class="keywordflow">return</span> (p-&gt;mask &amp; uintptr_t(1)&lt;&lt;i)!=0;
<a name="l00621"></a>00621 }
<a name="l00622"></a>00622 }
<a name="l00623"></a>00623
<a name="l00625"></a>00625
<a name="l00626"></a>00626 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Value&gt;
<a name="l00627"></a>00627 <span class="keyword">class </span>concurrent_queue_iterator_base_v3 : no_assign {
<a name="l00629"></a>00629
<a name="l00630"></a>00630 concurrent_queue_iterator_rep&lt;Value&gt;* my_rep;
<a name="l00631"></a>00631
<a name="l00632"></a>00632 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00633"></a>00633 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j );
<a name="l00634"></a>00634
<a name="l00635"></a>00635 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00636"></a>00636 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator!=( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j );
<a name="l00637"></a>00637 <span class="keyword">protected</span>:
<a name="l00639"></a>00639 Value* my_item;
<a name="l00640"></a>00640
<a name="l00642"></a>00642 concurrent_queue_iterator_base_v3() : my_rep(NULL), my_item(NULL) {
<a name="l00643"></a>00643 <span class="preprocessor">#if __GNUC__==4&amp;&amp;__GNUC_MINOR__==3</span>
<a name="l00644"></a>00644 <span class="preprocessor"></span> <span class="comment">// to get around a possible gcc 4.3 bug</span>
<a name="l00645"></a>00645 __asm__ __volatile__(<span class="stringliteral">""</span>: : :<span class="stringliteral">"memory"</span>);
<a name="l00646"></a>00646 <span class="preprocessor">#endif</span>
<a name="l00647"></a>00647 <span class="preprocessor"></span> }
<a name="l00648"></a>00648
<a name="l00650"></a>00650 concurrent_queue_iterator_base_v3( <span class="keyword">const</span> concurrent_queue_iterator_base_v3&amp; i )
<a name="l00651"></a>00651 : no_assign(), my_rep(NULL), my_item(NULL) {
<a name="l00652"></a>00652 assign(i);
<a name="l00653"></a>00653 }
<a name="l00654"></a>00654
<a name="l00656"></a>00656 concurrent_queue_iterator_base_v3( <span class="keyword">const</span> concurrent_queue_base_v3&lt;Value&gt;&amp; queue ) ;
<a name="l00657"></a>00657
<a name="l00659"></a>00659 <span class="keywordtype">void</span> assign( <span class="keyword">const</span> concurrent_queue_iterator_base_v3&lt;Value&gt;&amp; other ) ;
<a name="l00660"></a>00660
<a name="l00662"></a>00662 <span class="keywordtype">void</span> advance() ;
<a name="l00663"></a>00663
<a name="l00665"></a>00665 ~concurrent_queue_iterator_base_v3() {
<a name="l00666"></a>00666 cache_aligned_allocator&lt;concurrent_queue_iterator_rep&lt;Value&gt; &gt;().deallocate(my_rep, 1);
<a name="l00667"></a>00667 my_rep = NULL;
<a name="l00668"></a>00668 }
<a name="l00669"></a>00669 };
<a name="l00670"></a>00670
<a name="l00671"></a>00671 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Value&gt;
<a name="l00672"></a>00672 concurrent_queue_iterator_base_v3&lt;Value&gt;::concurrent_queue_iterator_base_v3( <span class="keyword">const</span> concurrent_queue_base_v3&lt;Value&gt;&amp; queue ) {
<a name="l00673"></a>00673 my_rep = cache_aligned_allocator&lt;concurrent_queue_iterator_rep&lt;Value&gt; &gt;().allocate(1);
<a name="l00674"></a>00674 <span class="keyword">new</span>( my_rep ) concurrent_queue_iterator_rep&lt;Value&gt;(queue);
<a name="l00675"></a>00675 size_t k = my_rep-&gt;head_counter;
<a name="l00676"></a>00676 <span class="keywordflow">if</span>( !my_rep-&gt;get_item(my_item, k) ) advance();
<a name="l00677"></a>00677 }
<a name="l00678"></a>00678
<a name="l00679"></a>00679 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Value&gt;
<a name="l00680"></a>00680 <span class="keywordtype">void</span> concurrent_queue_iterator_base_v3&lt;Value&gt;::assign( <span class="keyword">const</span> concurrent_queue_iterator_base_v3&lt;Value&gt;&amp; other ) {
<a name="l00681"></a>00681 <span class="keywordflow">if</span>( my_rep!=other.my_rep ) {
<a name="l00682"></a>00682 <span class="keywordflow">if</span>( my_rep ) {
<a name="l00683"></a>00683 cache_aligned_allocator&lt;concurrent_queue_iterator_rep&lt;Value&gt; &gt;().deallocate(my_rep, 1);
<a name="l00684"></a>00684 my_rep = NULL;
<a name="l00685"></a>00685 }
<a name="l00686"></a>00686 <span class="keywordflow">if</span>( other.my_rep ) {
<a name="l00687"></a>00687 my_rep = cache_aligned_allocator&lt;concurrent_queue_iterator_rep&lt;Value&gt; &gt;().allocate(1);
<a name="l00688"></a>00688 <span class="keyword">new</span>( my_rep ) concurrent_queue_iterator_rep&lt;Value&gt;( *other.my_rep );
<a name="l00689"></a>00689 }
<a name="l00690"></a>00690 }
<a name="l00691"></a>00691 my_item = other.my_item;
<a name="l00692"></a>00692 }
<a name="l00693"></a>00693
<a name="l00694"></a>00694 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Value&gt;
<a name="l00695"></a>00695 <span class="keywordtype">void</span> concurrent_queue_iterator_base_v3&lt;Value&gt;::advance() {
<a name="l00696"></a>00696 __TBB_ASSERT( my_item, <span class="stringliteral">"attempt to increment iterator past end of queue"</span> );
<a name="l00697"></a>00697 size_t k = my_rep-&gt;head_counter;
<a name="l00698"></a>00698 <span class="keyword">const</span> concurrent_queue_base_v3&lt;Value&gt;&amp; queue = my_rep-&gt;my_queue;
<a name="l00699"></a>00699 <span class="preprocessor">#if TBB_USE_ASSERT</span>
<a name="l00700"></a>00700 <span class="preprocessor"></span> Value* tmp;
<a name="l00701"></a>00701 my_rep-&gt;get_item(tmp,k);
<a name="l00702"></a>00702 __TBB_ASSERT( my_item==tmp, NULL );
<a name="l00703"></a>00703 <span class="preprocessor">#endif </span><span class="comment">/* TBB_USE_ASSERT */</span>
<a name="l00704"></a>00704 size_t i = k/concurrent_queue_rep&lt;Value&gt;::n_queue &amp; (queue.my_rep-&gt;items_per_page-1);
<a name="l00705"></a>00705 <span class="keywordflow">if</span>( i==queue.my_rep-&gt;items_per_page-1 ) {
<a name="l00706"></a>00706 <span class="keyword">typename</span> concurrent_queue_base_v3&lt;Value&gt;::page*&amp; root = my_rep-&gt;array[concurrent_queue_rep&lt;Value&gt;::index(k)];
<a name="l00707"></a>00707 root = root-&gt;next;
<a name="l00708"></a>00708 }
<a name="l00709"></a>00709 <span class="comment">// advance k</span>
<a name="l00710"></a>00710 my_rep-&gt;head_counter = ++k;
<a name="l00711"></a>00711 <span class="keywordflow">if</span>( !my_rep-&gt;get_item(my_item, k) ) advance();
<a name="l00712"></a>00712 }
<a name="l00713"></a>00713
<a name="l00715"></a>00715
<a name="l00716"></a>00716 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span>tbb_remove_cv {<span class="keyword">typedef</span> T type;};
<a name="l00717"></a>00717 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span>tbb_remove_cv&lt;const T&gt; {<span class="keyword">typedef</span> T type;};
<a name="l00718"></a>00718 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span>tbb_remove_cv&lt;volatile T&gt; {<span class="keyword">typedef</span> T type;};
<a name="l00719"></a>00719 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">struct </span>tbb_remove_cv&lt;const volatile T&gt; {<span class="keyword">typedef</span> T type;};
<a name="l00720"></a>00720
<a name="l00722"></a>00722
<a name="l00724"></a>00724 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Container, <span class="keyword">typename</span> Value&gt;
<a name="l00725"></a>00725 <span class="keyword">class </span>concurrent_queue_iterator: <span class="keyword">public</span> concurrent_queue_iterator_base_v3&lt;typename tbb_remove_cv&lt;Value&gt;::type&gt;,
<a name="l00726"></a>00726 <span class="keyword">public</span> std::iterator&lt;std::forward_iterator_tag,Value&gt; {
<a name="l00727"></a>00727 <span class="preprocessor">#if !__TBB_TEMPLATE_FRIENDS_BROKEN</span>
<a name="l00728"></a>00728 <span class="preprocessor"></span> <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> A&gt;
<a name="l00729"></a>00729 <span class="keyword">friend</span> class ::tbb::strict_ppl::concurrent_queue;
<a name="l00730"></a>00730 <span class="preprocessor">#else</span>
<a name="l00731"></a>00731 <span class="preprocessor"></span><span class="keyword">public</span>: <span class="comment">// workaround for MSVC</span>
<a name="l00732"></a>00732 <span class="preprocessor">#endif </span>
<a name="l00734"></a>00734 <span class="preprocessor"> concurrent_queue_iterator( const concurrent_queue_base_v3&lt;Value&gt;&amp; queue ) :</span>
<a name="l00735"></a>00735 <span class="preprocessor"></span> concurrent_queue_iterator_base_v3&lt;typename tbb_remove_cv&lt;Value&gt;::type&gt;(queue)
<a name="l00736"></a>00736 {
<a name="l00737"></a>00737 }
<a name="l00738"></a>00738
<a name="l00739"></a>00739 <span class="keyword">public</span>:
<a name="l00740"></a>00740 concurrent_queue_iterator() {}
<a name="l00741"></a>00741
<a name="l00742"></a>00742 concurrent_queue_iterator( <span class="keyword">const</span> concurrent_queue_iterator&lt;Container,typename Container::value_type&gt;&amp; other ) :
<a name="l00743"></a>00743 concurrent_queue_iterator_base_v3&lt;typename tbb_remove_cv&lt;Value&gt;::type&gt;(other)
<a name="l00744"></a>00744 {}
<a name="l00745"></a>00745
<a name="l00747"></a>00747 concurrent_queue_iterator&amp; operator=( <span class="keyword">const</span> concurrent_queue_iterator&amp; other ) {
<a name="l00748"></a>00748 assign(other);
<a name="l00749"></a>00749 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00750"></a>00750 }
<a name="l00751"></a>00751
<a name="l00753"></a>00753 Value&amp; operator*()<span class="keyword"> const </span>{
<a name="l00754"></a>00754 <span class="keywordflow">return</span> *static_cast&lt;Value*&gt;(this-&gt;my_item);
<a name="l00755"></a>00755 }
<a name="l00756"></a>00756
<a name="l00757"></a>00757 Value* operator-&gt;()<span class="keyword"> const </span>{<span class="keywordflow">return</span> &amp;operator*();}
<a name="l00758"></a>00758
<a name="l00760"></a>00760 concurrent_queue_iterator&amp; operator++() {
<a name="l00761"></a>00761 this-&gt;advance();
<a name="l00762"></a>00762 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00763"></a>00763 }
<a name="l00764"></a>00764
<a name="l00766"></a>00766 Value* operator++(<span class="keywordtype">int</span>) {
<a name="l00767"></a>00767 Value* result = &amp;operator*();
<a name="l00768"></a>00768 operator++();
<a name="l00769"></a>00769 <span class="keywordflow">return</span> result;
<a name="l00770"></a>00770 }
<a name="l00771"></a>00771 }; <span class="comment">// concurrent_queue_iterator</span>
<a name="l00772"></a>00772
<a name="l00773"></a>00773
<a name="l00774"></a>00774 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00775"></a>00775 <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j ) {
<a name="l00776"></a>00776 <span class="keywordflow">return</span> i.my_item==j.my_item;
<a name="l00777"></a>00777 }
<a name="l00778"></a>00778
<a name="l00779"></a>00779 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00780"></a>00780 <span class="keywordtype">bool</span> operator!=( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j ) {
<a name="l00781"></a>00781 <span class="keywordflow">return</span> i.my_item!=j.my_item;
<a name="l00782"></a>00782 }
<a name="l00783"></a>00783
<a name="l00784"></a>00784 } <span class="comment">// namespace internal</span>
<a name="l00785"></a>00785
<a name="l00787"></a>00787
<a name="l00788"></a>00788 } <span class="comment">// namespace strict_ppl</span>
<a name="l00789"></a>00789
<a name="l00791"></a>00791 <span class="keyword">namespace </span>internal {
<a name="l00792"></a>00792
<a name="l00793"></a>00793 <span class="keyword">class </span>concurrent_queue_rep;
<a name="l00794"></a>00794 <span class="keyword">class </span>concurrent_queue_iterator_rep;
<a name="l00795"></a>00795 <span class="keyword">class </span>concurrent_queue_iterator_base_v3;
<a name="l00796"></a>00796 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Container, <span class="keyword">typename</span> Value&gt; <span class="keyword">class </span>concurrent_queue_iterator;
<a name="l00797"></a>00797
<a name="l00799"></a>00799
<a name="l00801"></a>00801 <span class="keyword">class </span>concurrent_queue_base_v3: no_copy {
<a name="l00803"></a>00803 concurrent_queue_rep* my_rep;
<a name="l00804"></a>00804
<a name="l00805"></a>00805 <span class="keyword">friend</span> <span class="keyword">class </span>concurrent_queue_rep;
<a name="l00806"></a>00806 <span class="keyword">friend</span> <span class="keyword">struct </span>micro_queue;
<a name="l00807"></a>00807 <span class="keyword">friend</span> <span class="keyword">class </span>micro_queue_pop_finalizer;
<a name="l00808"></a>00808 <span class="keyword">friend</span> <span class="keyword">class </span>concurrent_queue_iterator_rep;
<a name="l00809"></a>00809 <span class="keyword">friend</span> <span class="keyword">class </span>concurrent_queue_iterator_base_v3;
<a name="l00810"></a>00810 <span class="keyword">protected</span>:
<a name="l00812"></a>00812 <span class="keyword">struct </span>page {
<a name="l00813"></a>00813 page* next;
<a name="l00814"></a>00814 uintptr_t mask;
<a name="l00815"></a>00815 };
<a name="l00816"></a>00816
<a name="l00818"></a>00818 ptrdiff_t my_capacity;
<a name="l00819"></a>00819
<a name="l00821"></a>00821 size_t items_per_page;
<a name="l00822"></a>00822
<a name="l00824"></a>00824 size_t item_size;
<a name="l00825"></a>00825
<a name="l00826"></a>00826 <span class="preprocessor">#if __TBB_GCC_3_3_PROTECTED_BROKEN</span>
<a name="l00827"></a>00827 <span class="preprocessor"></span><span class="keyword">public</span>:
<a name="l00828"></a>00828 <span class="preprocessor">#endif</span>
<a name="l00829"></a>00829 <span class="preprocessor"></span> <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;
<a name="l00830"></a>00830 <span class="keyword">struct </span>padded_page: page {
<a name="l00832"></a>00832 padded_page();
<a name="l00834"></a>00834 <span class="keywordtype">void</span> operator=( <span class="keyword">const</span> padded_page&amp; );
<a name="l00836"></a>00836 T last;
<a name="l00837"></a>00837 };
<a name="l00838"></a>00838
<a name="l00839"></a>00839 <span class="keyword">private</span>:
<a name="l00840"></a>00840 <span class="keyword">virtual</span> <span class="keywordtype">void</span> copy_item( page&amp; dst, size_t index, <span class="keyword">const</span> <span class="keywordtype">void</span>* src ) = 0;
<a name="l00841"></a>00841 <span class="keyword">virtual</span> <span class="keywordtype">void</span> assign_and_destroy_item( <span class="keywordtype">void</span>* dst, page&amp; src, size_t index ) = 0;
<a name="l00842"></a>00842 <span class="keyword">protected</span>:
<a name="l00843"></a>00843 __TBB_EXPORTED_METHOD concurrent_queue_base_v3( size_t item_size );
<a name="l00844"></a>00844 <span class="keyword">virtual</span> __TBB_EXPORTED_METHOD ~concurrent_queue_base_v3();
<a name="l00845"></a>00845
<a name="l00847"></a>00847 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD internal_push( <span class="keyword">const</span> <span class="keywordtype">void</span>* src );
<a name="l00848"></a>00848
<a name="l00850"></a>00850 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD internal_pop( <span class="keywordtype">void</span>* dst );
<a name="l00851"></a>00851
<a name="l00853"></a>00853 <span class="keywordtype">bool</span> __TBB_EXPORTED_METHOD internal_push_if_not_full( <span class="keyword">const</span> <span class="keywordtype">void</span>* src );
<a name="l00854"></a>00854
<a name="l00856"></a>00856
<a name="l00857"></a>00857 <span class="keywordtype">bool</span> __TBB_EXPORTED_METHOD internal_pop_if_present( <span class="keywordtype">void</span>* dst );
<a name="l00858"></a>00858
<a name="l00860"></a>00860 ptrdiff_t __TBB_EXPORTED_METHOD internal_size() <span class="keyword">const</span>;
<a name="l00861"></a>00861
<a name="l00863"></a>00863 <span class="keywordtype">bool</span> __TBB_EXPORTED_METHOD internal_empty() <span class="keyword">const</span>;
<a name="l00864"></a>00864
<a name="l00866"></a>00866 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD internal_set_capacity( ptrdiff_t capacity, size_t element_size );
<a name="l00867"></a>00867
<a name="l00869"></a>00869 <span class="keyword">virtual</span> page *allocate_page() = 0;
<a name="l00870"></a>00870
<a name="l00872"></a>00872 <span class="keyword">virtual</span> <span class="keywordtype">void</span> deallocate_page( page *p ) = 0;
<a name="l00873"></a>00873
<a name="l00875"></a>00875 <span class="comment">/* note that the name may be misleading, but it remains so due to a historical accident. */</span>
<a name="l00876"></a>00876 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD internal_finish_clear() ;
<a name="l00877"></a>00877
<a name="l00879"></a>00879 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD internal_throw_exception() <span class="keyword">const</span>;
<a name="l00880"></a>00880
<a name="l00882"></a>00882 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD assign( <span class="keyword">const</span> concurrent_queue_base_v3&amp; src ) ;
<a name="l00883"></a>00883
<a name="l00884"></a>00884 <span class="keyword">private</span>:
<a name="l00885"></a>00885 <span class="keyword">virtual</span> <span class="keywordtype">void</span> copy_page_item( page&amp; dst, size_t dindex, <span class="keyword">const</span> page&amp; src, size_t sindex ) = 0;
<a name="l00886"></a>00886 };
<a name="l00887"></a>00887
<a name="l00889"></a>00889
<a name="l00890"></a>00890 <span class="keyword">class </span>concurrent_queue_iterator_base_v3 {
<a name="l00892"></a>00892
<a name="l00893"></a>00893 concurrent_queue_iterator_rep* my_rep;
<a name="l00894"></a>00894
<a name="l00895"></a>00895 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00896"></a>00896 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j );
<a name="l00897"></a>00897
<a name="l00898"></a>00898 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00899"></a>00899 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator!=( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j );
<a name="l00900"></a>00900
<a name="l00901"></a>00901 <span class="keywordtype">void</span> initialize( <span class="keyword">const</span> concurrent_queue_base_v3&amp; queue, size_t offset_of_data );
<a name="l00902"></a>00902 <span class="keyword">protected</span>:
<a name="l00904"></a>00904 <span class="keywordtype">void</span>* my_item;
<a name="l00905"></a>00905
<a name="l00907"></a>00907 concurrent_queue_iterator_base_v3() : my_rep(NULL), my_item(NULL) {}
<a name="l00908"></a>00908
<a name="l00910"></a>00910 concurrent_queue_iterator_base_v3( <span class="keyword">const</span> concurrent_queue_iterator_base_v3&amp; i ) : my_rep(NULL), my_item(NULL) {
<a name="l00911"></a>00911 assign(i);
<a name="l00912"></a>00912 }
<a name="l00913"></a>00913
<a name="l00915"></a>00915
<a name="l00916"></a>00916 __TBB_EXPORTED_METHOD concurrent_queue_iterator_base_v3( <span class="keyword">const</span> concurrent_queue_base_v3&amp; queue );
<a name="l00917"></a>00917
<a name="l00919"></a>00919 __TBB_EXPORTED_METHOD concurrent_queue_iterator_base_v3( <span class="keyword">const</span> concurrent_queue_base_v3&amp; queue, size_t offset_of_data );
<a name="l00920"></a>00920
<a name="l00922"></a>00922 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD assign( <span class="keyword">const</span> concurrent_queue_iterator_base_v3&amp; i );
<a name="l00923"></a>00923
<a name="l00925"></a>00925 <span class="keywordtype">void</span> __TBB_EXPORTED_METHOD advance();
<a name="l00926"></a>00926
<a name="l00928"></a>00928 __TBB_EXPORTED_METHOD ~concurrent_queue_iterator_base_v3();
<a name="l00929"></a>00929 };
<a name="l00930"></a>00930
<a name="l00931"></a>00931 <span class="keyword">typedef</span> concurrent_queue_iterator_base_v3 concurrent_queue_iterator_base;
<a name="l00932"></a>00932
<a name="l00934"></a>00934
<a name="l00936"></a>00936 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Container, <span class="keyword">typename</span> Value&gt;
<a name="l00937"></a>00937 <span class="keyword">class </span>concurrent_queue_iterator: <span class="keyword">public</span> concurrent_queue_iterator_base,
<a name="l00938"></a>00938 <span class="keyword">public</span> std::iterator&lt;std::forward_iterator_tag,Value&gt; {
<a name="l00939"></a>00939
<a name="l00940"></a>00940 <span class="preprocessor">#if !defined(_MSC_VER) || defined(__INTEL_COMPILER)</span>
<a name="l00941"></a>00941 <span class="preprocessor"></span> <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> A&gt;
<a name="l00942"></a>00942 <span class="keyword">friend</span> class ::tbb::concurrent_bounded_queue;
<a name="l00943"></a>00943
<a name="l00944"></a>00944 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">class</span> A&gt;
<a name="l00945"></a>00945 <span class="keyword">friend</span> class ::tbb::deprecated::concurrent_queue;
<a name="l00946"></a>00946 <span class="preprocessor">#else</span>
<a name="l00947"></a>00947 <span class="preprocessor"></span><span class="keyword">public</span>: <span class="comment">// workaround for MSVC</span>
<a name="l00948"></a>00948 <span class="preprocessor">#endif </span>
<a name="l00950"></a>00950 <span class="preprocessor"> concurrent_queue_iterator( const concurrent_queue_base_v3&amp; queue ) :</span>
<a name="l00951"></a>00951 <span class="preprocessor"></span> concurrent_queue_iterator_base_v3(queue,__TBB_offsetof(concurrent_queue_base_v3::padded_page&lt;Value&gt;,last))
<a name="l00952"></a>00952 {
<a name="l00953"></a>00953 }
<a name="l00954"></a>00954
<a name="l00955"></a>00955 <span class="keyword">public</span>:
<a name="l00956"></a>00956 concurrent_queue_iterator() {}
<a name="l00957"></a>00957
<a name="l00960"></a>00960 concurrent_queue_iterator( <span class="keyword">const</span> concurrent_queue_iterator&lt;Container,typename Container::value_type&gt;&amp; other ) :
<a name="l00961"></a>00961 concurrent_queue_iterator_base_v3(other)
<a name="l00962"></a>00962 {}
<a name="l00963"></a>00963
<a name="l00965"></a>00965 concurrent_queue_iterator&amp; operator=( <span class="keyword">const</span> concurrent_queue_iterator&amp; other ) {
<a name="l00966"></a>00966 assign(other);
<a name="l00967"></a>00967 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00968"></a>00968 }
<a name="l00969"></a>00969
<a name="l00971"></a>00971 Value&amp; operator*()<span class="keyword"> const </span>{
<a name="l00972"></a>00972 <span class="keywordflow">return</span> *static_cast&lt;Value*&gt;(my_item);
<a name="l00973"></a>00973 }
<a name="l00974"></a>00974
<a name="l00975"></a>00975 Value* operator-&gt;()<span class="keyword"> const </span>{<span class="keywordflow">return</span> &amp;operator*();}
<a name="l00976"></a>00976
<a name="l00978"></a>00978 concurrent_queue_iterator&amp; operator++() {
<a name="l00979"></a>00979 advance();
<a name="l00980"></a>00980 <span class="keywordflow">return</span> *<span class="keyword">this</span>;
<a name="l00981"></a>00981 }
<a name="l00982"></a>00982
<a name="l00984"></a>00984 Value* operator++(<span class="keywordtype">int</span>) {
<a name="l00985"></a>00985 Value* result = &amp;operator*();
<a name="l00986"></a>00986 operator++();
<a name="l00987"></a>00987 <span class="keywordflow">return</span> result;
<a name="l00988"></a>00988 }
<a name="l00989"></a>00989 }; <span class="comment">// concurrent_queue_iterator</span>
<a name="l00990"></a>00990
<a name="l00991"></a>00991
<a name="l00992"></a>00992 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00993"></a>00993 <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j ) {
<a name="l00994"></a>00994 <span class="keywordflow">return</span> i.my_item==j.my_item;
<a name="l00995"></a>00995 }
<a name="l00996"></a>00996
<a name="l00997"></a>00997 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U&gt;
<a name="l00998"></a>00998 <span class="keywordtype">bool</span> operator!=( <span class="keyword">const</span> concurrent_queue_iterator&lt;C,T&gt;&amp; i, <span class="keyword">const</span> concurrent_queue_iterator&lt;C,U&gt;&amp; j ) {
<a name="l00999"></a>00999 <span class="keywordflow">return</span> i.my_item!=j.my_item;
<a name="l01000"></a>01000 }
<a name="l01001"></a>01001
<a name="l01002"></a>01002 } <span class="comment">// namespace internal;</span>
<a name="l01003"></a>01003
<a name="l01005"></a>01005
<a name="l01006"></a>01006 } <span class="comment">// namespace tbb</span>
<a name="l01007"></a>01007
<a name="l01008"></a>01008 <span class="preprocessor">#endif </span><span class="comment">/* __TBB_concurrent_queue_internal_H */</span>
</pre></div><hr>
<p></p>
Copyright &copy; 2005-2010 Intel Corporation. All Rights Reserved.
<p></p>
Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
registered trademarks or trademarks of Intel Corporation or its
subsidiaries in the United States and other countries.
<p></p>
* Other names and brands may be claimed as the property of others.