| <!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>enumerable_thread_specific.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 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 Pages</span></a></li> |
| </ul></div> |
| <div class="tabs"> |
| <ul> |
| <li><a href="files.html"><span>File List</span></a></li> |
| <li><a href="globals.html"><span>File Members</span></a></li> |
| </ul></div> |
| <h1>enumerable_thread_specific.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_enumerable_thread_specific_H</span> |
| <a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define __TBB_enumerable_thread_specific_H</span> |
| <a name="l00023"></a>00023 <span class="preprocessor"></span> |
| <a name="l00024"></a>00024 <span class="preprocessor">#include "concurrent_vector.h"</span> |
| <a name="l00025"></a>00025 <span class="preprocessor">#include "tbb_thread.h"</span> |
| <a name="l00026"></a>00026 <span class="preprocessor">#include "cache_aligned_allocator.h"</span> |
| <a name="l00027"></a>00027 <span class="preprocessor">#if __SUNPRO_CC</span> |
| <a name="l00028"></a>00028 <span class="preprocessor"></span><span class="preprocessor">#include <string.h></span> <span class="comment">// for memcpy</span> |
| <a name="l00029"></a>00029 <span class="preprocessor">#endif</span> |
| <a name="l00030"></a>00030 <span class="preprocessor"></span> |
| <a name="l00031"></a>00031 <span class="preprocessor">#if _WIN32||_WIN64</span> |
| <a name="l00032"></a>00032 <span class="preprocessor"></span><span class="preprocessor">#include <windows.h></span> |
| <a name="l00033"></a>00033 <span class="preprocessor">#else</span> |
| <a name="l00034"></a>00034 <span class="preprocessor"></span><span class="preprocessor">#include <pthread.h></span> |
| <a name="l00035"></a>00035 <span class="preprocessor">#endif</span> |
| <a name="l00036"></a>00036 <span class="preprocessor"></span> |
| <a name="l00037"></a>00037 <span class="keyword">namespace </span>tbb { |
| <a name="l00038"></a>00038 |
| <a name="l00040"></a><a class="code" href="a00267.html#a8622ae61b7e7737dac26542e181178e">00040</a> <span class="keyword">enum</span> <a class="code" href="a00267.html#a8622ae61b7e7737dac26542e181178e">ets_key_usage_type</a> { ets_key_per_instance, ets_no_key }; |
| <a name="l00041"></a>00041 |
| <a name="l00042"></a>00042 <span class="keyword">namespace </span>interface5 { |
| <a name="l00043"></a>00043 |
| <a name="l00045"></a>00045 <span class="keyword">namespace </span>internal { |
| <a name="l00046"></a>00046 |
| <a name="l00047"></a>00047 <span class="keyword">template</span><ets_key_usage_type ETS_key_type> |
| <a name="l00048"></a>00048 <span class="keyword">class </span>ets_base: tbb::internal::no_copy { |
| <a name="l00049"></a>00049 <span class="keyword">protected</span>: |
| <a name="l00050"></a>00050 <span class="preprocessor">#if _WIN32||_WIN64</span> |
| <a name="l00051"></a>00051 <span class="preprocessor"></span> <span class="keyword">typedef</span> DWORD key_type; |
| <a name="l00052"></a>00052 <span class="preprocessor">#else</span> |
| <a name="l00053"></a>00053 <span class="preprocessor"></span> <span class="keyword">typedef</span> pthread_t key_type; |
| <a name="l00054"></a>00054 <span class="preprocessor">#endif</span> |
| <a name="l00055"></a>00055 <span class="preprocessor"></span><span class="preprocessor">#if __TBB_GCC_3_3_PROTECTED_BROKEN</span> |
| <a name="l00056"></a>00056 <span class="preprocessor"></span> <span class="keyword">public</span>: |
| <a name="l00057"></a>00057 <span class="preprocessor">#endif</span> |
| <a name="l00058"></a>00058 <span class="preprocessor"></span> <span class="keyword">struct </span>slot; |
| <a name="l00059"></a>00059 |
| <a name="l00060"></a>00060 <span class="keyword">struct </span>array { |
| <a name="l00061"></a>00061 array* next; |
| <a name="l00062"></a>00062 size_t lg_size; |
| <a name="l00063"></a>00063 slot& at( size_t k ) { |
| <a name="l00064"></a>00064 <span class="keywordflow">return</span> ((slot*)(<span class="keywordtype">void</span>*)(<span class="keyword">this</span>+1))[k]; |
| <a name="l00065"></a>00065 } |
| <a name="l00066"></a>00066 size_t size()<span class="keyword"> const </span>{<span class="keywordflow">return</span> (size_t)1<<lg_size;} |
| <a name="l00067"></a>00067 size_t mask()<span class="keyword"> const </span>{<span class="keywordflow">return</span> size()-1;} |
| <a name="l00068"></a>00068 size_t start( size_t h )<span class="keyword"> const </span>{ |
| <a name="l00069"></a>00069 <span class="keywordflow">return</span> h>>(8*<span class="keyword">sizeof</span>(size_t)-lg_size); |
| <a name="l00070"></a>00070 } |
| <a name="l00071"></a>00071 }; |
| <a name="l00072"></a>00072 <span class="keyword">struct </span>slot { |
| <a name="l00073"></a>00073 key_type key; |
| <a name="l00074"></a>00074 <span class="keywordtype">void</span>* ptr; |
| <a name="l00075"></a>00075 <span class="keywordtype">bool</span> empty()<span class="keyword"> const </span>{<span class="keywordflow">return</span> !key;} |
| <a name="l00076"></a>00076 <span class="keywordtype">bool</span> match( key_type k )<span class="keyword"> const </span>{<span class="keywordflow">return</span> key==k;} |
| <a name="l00077"></a>00077 <span class="keywordtype">bool</span> claim( key_type k ) { |
| <a name="l00078"></a>00078 __TBB_ASSERT(<span class="keyword">sizeof</span>(<a class="code" href="a00143.html">tbb::atomic<key_type></a>)==<span class="keyword">sizeof</span>(key_type), NULL); |
| <a name="l00079"></a>00079 __TBB_ASSERT(<span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)==<span class="keyword">sizeof</span>(tbb::atomic<key_type>*), NULL); |
| <a name="l00080"></a>00080 <span class="keyword">union </span>{ <span class="keywordtype">void</span>* space; tbb::atomic<key_type>* key_atomic; } helper; |
| <a name="l00081"></a>00081 helper.space = &key; |
| <a name="l00082"></a>00082 <span class="keywordflow">return</span> helper.key_atomic->compare_and_swap(k,0)==0; |
| <a name="l00083"></a>00083 } |
| <a name="l00084"></a>00084 }; |
| <a name="l00085"></a>00085 <span class="preprocessor">#if __TBB_GCC_3_3_PROTECTED_BROKEN</span> |
| <a name="l00086"></a>00086 <span class="preprocessor"></span> <span class="keyword">protected</span>: |
| <a name="l00087"></a>00087 <span class="preprocessor">#endif</span> |
| <a name="l00088"></a>00088 <span class="preprocessor"></span> |
| <a name="l00089"></a>00089 <span class="keyword">static</span> key_type key_of_current_thread() { |
| <a name="l00090"></a>00090 tbb::tbb_thread::id <span class="keywordtype">id</span> = tbb::this_tbb_thread::get_id(); |
| <a name="l00091"></a>00091 key_type k; |
| <a name="l00092"></a>00092 memcpy( &k, &<span class="keywordtype">id</span>, <span class="keyword">sizeof</span>(k) ); |
| <a name="l00093"></a>00093 <span class="keywordflow">return</span> k; |
| <a name="l00094"></a>00094 } |
| <a name="l00095"></a>00095 |
| <a name="l00097"></a>00097 |
| <a name="l00099"></a>00099 atomic<array*> my_root; |
| <a name="l00100"></a>00100 atomic<size_t> my_count; |
| <a name="l00101"></a>00101 <span class="keyword">virtual</span> <span class="keywordtype">void</span>* create_local() = 0; |
| <a name="l00102"></a>00102 <span class="keyword">virtual</span> <span class="keywordtype">void</span>* create_array(size_t _size) = 0; <span class="comment">// _size in bytes</span> |
| <a name="l00103"></a>00103 <span class="keyword">virtual</span> <span class="keywordtype">void</span> free_array(<span class="keywordtype">void</span>* ptr, size_t _size) = 0; <span class="comment">// _size in bytes</span> |
| <a name="l00104"></a>00104 array* allocate( size_t lg_size ) { |
| <a name="l00105"></a>00105 size_t n = 1<<lg_size; |
| <a name="l00106"></a>00106 array* a = static_cast<array*>(create_array( <span class="keyword">sizeof</span>(array)+n*<span class="keyword">sizeof</span>(slot) )); |
| <a name="l00107"></a>00107 a->lg_size = lg_size; |
| <a name="l00108"></a>00108 std::memset( a+1, 0, n*<span class="keyword">sizeof</span>(slot) ); |
| <a name="l00109"></a>00109 <span class="keywordflow">return</span> a; |
| <a name="l00110"></a>00110 } |
| <a name="l00111"></a>00111 <span class="keywordtype">void</span> free(array* a) { |
| <a name="l00112"></a>00112 size_t n = 1<<(a->lg_size); |
| <a name="l00113"></a>00113 free_array( (<span class="keywordtype">void</span> *)a, size_t(<span class="keyword">sizeof</span>(array)+n*<span class="keyword">sizeof</span>(slot)) ); |
| <a name="l00114"></a>00114 } |
| <a name="l00115"></a>00115 <span class="keyword">static</span> size_t hash( key_type k ) { |
| <a name="l00116"></a>00116 <span class="comment">// Multiplicative hashing. Client should use *upper* bits.</span> |
| <a name="l00117"></a>00117 <span class="comment">// casts required for Mac gcc4.* compiler</span> |
| <a name="l00118"></a>00118 <span class="preprocessor">#if __TBB_WORDSIZE == 4</span> |
| <a name="l00119"></a>00119 <span class="preprocessor"></span> <span class="keywordflow">return</span> uintptr_t(k)*0x9E3779B9; |
| <a name="l00120"></a>00120 <span class="preprocessor">#else</span> |
| <a name="l00121"></a>00121 <span class="preprocessor"></span> <span class="keywordflow">return</span> uintptr_t(k)*0x9E3779B97F4A7C15; |
| <a name="l00122"></a>00122 <span class="preprocessor">#endif </span> |
| <a name="l00123"></a>00123 <span class="preprocessor"></span> } |
| <a name="l00124"></a>00124 |
| <a name="l00125"></a>00125 ets_base() {my_root=NULL; my_count=0;} |
| <a name="l00126"></a>00126 <span class="keyword">virtual</span> ~ets_base(); <span class="comment">// g++ complains if this is not virtual...</span> |
| <a name="l00127"></a>00127 <span class="keywordtype">void</span>* table_lookup( <span class="keywordtype">bool</span>& exists ); |
| <a name="l00128"></a>00128 <span class="keywordtype">void</span> table_clear(); |
| <a name="l00129"></a>00129 slot& table_find( key_type k ) { |
| <a name="l00130"></a>00130 size_t h = hash(k); |
| <a name="l00131"></a>00131 array* r = my_root; |
| <a name="l00132"></a>00132 size_t mask = r->mask(); |
| <a name="l00133"></a>00133 <span class="keywordflow">for</span>(size_t i = r->start(h);;i=(i+1)&mask) { |
| <a name="l00134"></a>00134 slot& s = r->at(i); |
| <a name="l00135"></a>00135 <span class="keywordflow">if</span>( s.empty() || s.match(k) ) |
| <a name="l00136"></a>00136 <span class="keywordflow">return</span> s; |
| <a name="l00137"></a>00137 } |
| <a name="l00138"></a>00138 } |
| <a name="l00139"></a>00139 <span class="keywordtype">void</span> table_reserve_for_copy( <span class="keyword">const</span> ets_base& other ) { |
| <a name="l00140"></a>00140 __TBB_ASSERT(!my_root,NULL); |
| <a name="l00141"></a>00141 __TBB_ASSERT(!my_count,NULL); |
| <a name="l00142"></a>00142 <span class="keywordflow">if</span>( other.my_root ) { |
| <a name="l00143"></a>00143 array* a = allocate(other.my_root->lg_size); |
| <a name="l00144"></a>00144 a->next = NULL; |
| <a name="l00145"></a>00145 my_root = a; |
| <a name="l00146"></a>00146 my_count = other.my_count; |
| <a name="l00147"></a>00147 } |
| <a name="l00148"></a>00148 } |
| <a name="l00149"></a>00149 }; |
| <a name="l00150"></a>00150 |
| <a name="l00151"></a>00151 <span class="keyword">template</span><ets_key_usage_type ETS_key_type> |
| <a name="l00152"></a>00152 ets_base<ETS_key_type>::~ets_base() { |
| <a name="l00153"></a>00153 __TBB_ASSERT(!my_root, NULL); |
| <a name="l00154"></a>00154 } |
| <a name="l00155"></a>00155 |
| <a name="l00156"></a>00156 <span class="keyword">template</span><ets_key_usage_type ETS_key_type> |
| <a name="l00157"></a>00157 <span class="keywordtype">void</span> ets_base<ETS_key_type>::table_clear() { |
| <a name="l00158"></a>00158 <span class="keywordflow">while</span>( array* r = my_root ) { |
| <a name="l00159"></a>00159 my_root = r->next; |
| <a name="l00160"></a>00160 free(r); |
| <a name="l00161"></a>00161 } |
| <a name="l00162"></a>00162 my_count = 0; |
| <a name="l00163"></a>00163 } |
| <a name="l00164"></a>00164 |
| <a name="l00165"></a>00165 <span class="keyword">template</span><ets_key_usage_type ETS_key_type> |
| <a name="l00166"></a>00166 <span class="keywordtype">void</span>* ets_base<ETS_key_type>::table_lookup( <span class="keywordtype">bool</span>& exists ) { |
| <a name="l00167"></a>00167 <span class="keyword">const</span> key_type k = key_of_current_thread(); |
| <a name="l00168"></a>00168 |
| <a name="l00169"></a>00169 __TBB_ASSERT(k!=0,NULL); |
| <a name="l00170"></a>00170 <span class="keywordtype">void</span>* found; |
| <a name="l00171"></a>00171 size_t h = hash(k); |
| <a name="l00172"></a>00172 <span class="keywordflow">for</span>( array* r=my_root; r; r=r->next ) { |
| <a name="l00173"></a>00173 size_t mask=r->mask(); |
| <a name="l00174"></a>00174 <span class="keywordflow">for</span>(size_t i = r->start(h); ;i=(i+1)&mask) { |
| <a name="l00175"></a>00175 slot& s = r->at(i); |
| <a name="l00176"></a>00176 <span class="keywordflow">if</span>( s.empty() ) <span class="keywordflow">break</span>; |
| <a name="l00177"></a>00177 <span class="keywordflow">if</span>( s.match(k) ) { |
| <a name="l00178"></a>00178 <span class="keywordflow">if</span>( r==my_root ) { |
| <a name="l00179"></a>00179 <span class="comment">// Success at top level</span> |
| <a name="l00180"></a>00180 exists = <span class="keyword">true</span>; |
| <a name="l00181"></a>00181 <span class="keywordflow">return</span> s.ptr; |
| <a name="l00182"></a>00182 } <span class="keywordflow">else</span> { |
| <a name="l00183"></a>00183 <span class="comment">// Success at some other level. Need to insert at top level.</span> |
| <a name="l00184"></a>00184 exists = <span class="keyword">true</span>; |
| <a name="l00185"></a>00185 found = s.ptr; |
| <a name="l00186"></a>00186 <span class="keywordflow">goto</span> insert; |
| <a name="l00187"></a>00187 } |
| <a name="l00188"></a>00188 } |
| <a name="l00189"></a>00189 } |
| <a name="l00190"></a>00190 } |
| <a name="l00191"></a>00191 <span class="comment">// Key does not yet exist</span> |
| <a name="l00192"></a>00192 exists = <span class="keyword">false</span>; |
| <a name="l00193"></a>00193 found = create_local(); |
| <a name="l00194"></a>00194 { |
| <a name="l00195"></a>00195 size_t c = ++my_count; |
| <a name="l00196"></a>00196 array* r = my_root; |
| <a name="l00197"></a>00197 <span class="keywordflow">if</span>( !r || c>r->size()/2 ) { |
| <a name="l00198"></a>00198 size_t s = r ? r->lg_size : 2; |
| <a name="l00199"></a>00199 <span class="keywordflow">while</span>( c>size_t(1)<<(s-1) ) ++s; |
| <a name="l00200"></a>00200 array* a = allocate(s); |
| <a name="l00201"></a>00201 <span class="keywordflow">for</span>(;;) { |
| <a name="l00202"></a>00202 a->next = my_root; |
| <a name="l00203"></a>00203 array* new_r = my_root.compare_and_swap(a,r); |
| <a name="l00204"></a>00204 <span class="keywordflow">if</span>( new_r==r ) <span class="keywordflow">break</span>; |
| <a name="l00205"></a>00205 <span class="keywordflow">if</span>( new_r->lg_size>=s ) { |
| <a name="l00206"></a>00206 <span class="comment">// Another thread inserted an equal or bigger array, so our array is superfluous.</span> |
| <a name="l00207"></a>00207 free(a); |
| <a name="l00208"></a>00208 <span class="keywordflow">break</span>; |
| <a name="l00209"></a>00209 } |
| <a name="l00210"></a>00210 r = new_r; |
| <a name="l00211"></a>00211 } |
| <a name="l00212"></a>00212 } |
| <a name="l00213"></a>00213 } |
| <a name="l00214"></a>00214 insert: |
| <a name="l00215"></a>00215 <span class="comment">// Guaranteed to be room for it, and it is not present, so search for empty slot and grab it.</span> |
| <a name="l00216"></a>00216 array* ir = my_root; |
| <a name="l00217"></a>00217 size_t mask = ir->mask(); |
| <a name="l00218"></a>00218 <span class="keywordflow">for</span>(size_t i = ir->start(h);;i=(i+1)&mask) { |
| <a name="l00219"></a>00219 slot& s = ir->at(i); |
| <a name="l00220"></a>00220 <span class="keywordflow">if</span>( s.empty() ) { |
| <a name="l00221"></a>00221 <span class="keywordflow">if</span>( s.claim(k) ) { |
| <a name="l00222"></a>00222 s.ptr = found; |
| <a name="l00223"></a>00223 <span class="keywordflow">return</span> found; |
| <a name="l00224"></a>00224 } |
| <a name="l00225"></a>00225 } |
| <a name="l00226"></a>00226 } |
| <a name="l00227"></a>00227 }; |
| <a name="l00228"></a>00228 |
| <a name="l00230"></a>00230 <span class="keyword">template</span> <> |
| <a name="l00231"></a>00231 <span class="keyword">class </span>ets_base<ets_key_per_instance>: <span class="keyword">protected</span> ets_base<ets_no_key> { |
| <a name="l00232"></a>00232 <span class="keyword">typedef</span> ets_base<ets_no_key> super; |
| <a name="l00233"></a>00233 <span class="preprocessor">#if _WIN32||_WIN64</span> |
| <a name="l00234"></a>00234 <span class="preprocessor"></span> <span class="keyword">typedef</span> DWORD tls_key_t; |
| <a name="l00235"></a>00235 <span class="keywordtype">void</span> create_key() { my_key = TlsAlloc(); } |
| <a name="l00236"></a>00236 <span class="keywordtype">void</span> destroy_key() { TlsFree(my_key); } |
| <a name="l00237"></a>00237 <span class="keywordtype">void</span> set_tls(<span class="keywordtype">void</span> * value) { TlsSetValue(my_key, (LPVOID)value); } |
| <a name="l00238"></a>00238 <span class="keywordtype">void</span>* get_tls() { <span class="keywordflow">return</span> (<span class="keywordtype">void</span> *)TlsGetValue(my_key); } |
| <a name="l00239"></a>00239 <span class="preprocessor">#else</span> |
| <a name="l00240"></a>00240 <span class="preprocessor"></span> <span class="keyword">typedef</span> pthread_key_t tls_key_t; |
| <a name="l00241"></a>00241 <span class="keywordtype">void</span> create_key() { pthread_key_create(&my_key, NULL); } |
| <a name="l00242"></a>00242 <span class="keywordtype">void</span> destroy_key() { pthread_key_delete(my_key); } |
| <a name="l00243"></a>00243 <span class="keywordtype">void</span> set_tls( <span class="keywordtype">void</span> * value )<span class="keyword"> const </span>{ pthread_setspecific(my_key, value); } |
| <a name="l00244"></a>00244 <span class="keywordtype">void</span>* get_tls()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> pthread_getspecific(my_key); } |
| <a name="l00245"></a>00245 <span class="preprocessor">#endif</span> |
| <a name="l00246"></a>00246 <span class="preprocessor"></span> tls_key_t my_key; |
| <a name="l00247"></a>00247 <span class="keyword">virtual</span> <span class="keywordtype">void</span>* create_local() = 0; |
| <a name="l00248"></a>00248 <span class="keyword">virtual</span> <span class="keywordtype">void</span>* create_array(size_t _size) = 0; <span class="comment">// _size in bytes</span> |
| <a name="l00249"></a>00249 <span class="keyword">virtual</span> <span class="keywordtype">void</span> free_array(<span class="keywordtype">void</span>* ptr, size_t _size) = 0; <span class="comment">// size in bytes</span> |
| <a name="l00250"></a>00250 <span class="keyword">public</span>: |
| <a name="l00251"></a>00251 ets_base() {create_key();} |
| <a name="l00252"></a>00252 ~ets_base() {destroy_key();} |
| <a name="l00253"></a>00253 <span class="keywordtype">void</span>* table_lookup( <span class="keywordtype">bool</span>& exists ) { |
| <a name="l00254"></a>00254 <span class="keywordtype">void</span>* found = get_tls(); |
| <a name="l00255"></a>00255 <span class="keywordflow">if</span>( found ) { |
| <a name="l00256"></a>00256 exists=<span class="keyword">true</span>; |
| <a name="l00257"></a>00257 } <span class="keywordflow">else</span> { |
| <a name="l00258"></a>00258 found = super::table_lookup(exists); |
| <a name="l00259"></a>00259 set_tls(found); |
| <a name="l00260"></a>00260 } |
| <a name="l00261"></a>00261 <span class="keywordflow">return</span> found; |
| <a name="l00262"></a>00262 } |
| <a name="l00263"></a>00263 <span class="keywordtype">void</span> table_clear() { |
| <a name="l00264"></a>00264 destroy_key(); |
| <a name="l00265"></a>00265 create_key(); |
| <a name="l00266"></a>00266 super::table_clear(); |
| <a name="l00267"></a>00267 } |
| <a name="l00268"></a>00268 }; |
| <a name="l00269"></a>00269 |
| <a name="l00271"></a>00271 <span class="keyword">template</span>< <span class="keyword">typename</span> Container, <span class="keyword">typename</span> Value > |
| <a name="l00272"></a>00272 <span class="keyword">class </span>enumerable_thread_specific_iterator |
| <a name="l00273"></a>00273 #if defined(_WIN64) && defined(_MSC_VER) |
| <a name="l00274"></a>00274 <span class="comment">// Ensure that Microsoft's internal template function _Val_type works correctly.</span> |
| <a name="l00275"></a>00275 : public std::iterator<std::random_access_iterator_tag,Value> |
| <a name="l00276"></a>00276 #endif <span class="comment">/* defined(_WIN64) && defined(_MSC_VER) */</span> |
| <a name="l00277"></a>00277 { |
| <a name="l00279"></a>00279 |
| <a name="l00280"></a>00280 Container *my_container; |
| <a name="l00281"></a>00281 <span class="keyword">typename</span> Container::size_type my_index; |
| <a name="l00282"></a>00282 <span class="keyword">mutable</span> Value *my_value; |
| <a name="l00283"></a>00283 |
| <a name="l00284"></a>00284 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> T> |
| <a name="l00285"></a>00285 <span class="keyword">friend</span> enumerable_thread_specific_iterator<C,T> operator+( ptrdiff_t offset, |
| <a name="l00286"></a>00286 <span class="keyword">const</span> enumerable_thread_specific_iterator<C,T>& v ); |
| <a name="l00287"></a>00287 |
| <a name="l00288"></a>00288 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00289"></a>00289 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> enumerable_thread_specific_iterator<C,T>& i, |
| <a name="l00290"></a>00290 <span class="keyword">const</span> enumerable_thread_specific_iterator<C,U>& j ); |
| <a name="l00291"></a>00291 |
| <a name="l00292"></a>00292 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00293"></a>00293 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator<( const enumerable_thread_specific_iterator<C,T>& i, |
| <a name="l00294"></a>00294 <span class="keyword">const</span> enumerable_thread_specific_iterator<C,U>& j ); |
| <a name="l00295"></a>00295 |
| <a name="l00296"></a>00296 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00297"></a>00297 <span class="keyword">friend</span> ptrdiff_t operator-( <span class="keyword">const</span> enumerable_thread_specific_iterator<C,T>& i, <span class="keyword">const</span> enumerable_thread_specific_iterator<C,U>& j ); |
| <a name="l00298"></a>00298 |
| <a name="l00299"></a>00299 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> U> |
| <a name="l00300"></a>00300 <span class="keyword">friend</span> <span class="keyword">class </span>enumerable_thread_specific_iterator; |
| <a name="l00301"></a>00301 |
| <a name="l00302"></a>00302 <span class="keyword">public</span>: |
| <a name="l00303"></a>00303 |
| <a name="l00304"></a>00304 enumerable_thread_specific_iterator( <span class="keyword">const</span> Container &container, <span class="keyword">typename</span> Container::size_type index ) : |
| <a name="l00305"></a>00305 my_container(&const_cast<Container &>(container)), my_index(index), my_value(NULL) {} |
| <a name="l00306"></a>00306 |
| <a name="l00308"></a>00308 enumerable_thread_specific_iterator() : my_container(NULL), my_index(0), my_value(NULL) {} |
| <a name="l00309"></a>00309 |
| <a name="l00310"></a>00310 <span class="keyword">template</span><<span class="keyword">typename</span> U> |
| <a name="l00311"></a>00311 enumerable_thread_specific_iterator( <span class="keyword">const</span> enumerable_thread_specific_iterator<Container, U>& other ) : |
| <a name="l00312"></a>00312 my_container( other.my_container ), my_index( other.my_index), my_value( const_cast<Value *>(other.my_value) ) {} |
| <a name="l00313"></a>00313 |
| <a name="l00314"></a>00314 enumerable_thread_specific_iterator operator+( ptrdiff_t offset )<span class="keyword"> const </span>{ |
| <a name="l00315"></a>00315 <span class="keywordflow">return</span> enumerable_thread_specific_iterator(*my_container, my_index + offset); |
| <a name="l00316"></a>00316 } |
| <a name="l00317"></a>00317 |
| <a name="l00318"></a>00318 enumerable_thread_specific_iterator &operator+=( ptrdiff_t offset ) { |
| <a name="l00319"></a>00319 my_index += offset; |
| <a name="l00320"></a>00320 my_value = NULL; |
| <a name="l00321"></a>00321 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00322"></a>00322 } |
| <a name="l00323"></a>00323 |
| <a name="l00324"></a>00324 enumerable_thread_specific_iterator operator-( ptrdiff_t offset )<span class="keyword"> const </span>{ |
| <a name="l00325"></a>00325 <span class="keywordflow">return</span> enumerable_thread_specific_iterator( *my_container, my_index-offset ); |
| <a name="l00326"></a>00326 } |
| <a name="l00327"></a>00327 |
| <a name="l00328"></a>00328 enumerable_thread_specific_iterator &operator-=( ptrdiff_t offset ) { |
| <a name="l00329"></a>00329 my_index -= offset; |
| <a name="l00330"></a>00330 my_value = NULL; |
| <a name="l00331"></a>00331 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00332"></a>00332 } |
| <a name="l00333"></a>00333 |
| <a name="l00334"></a>00334 Value& operator*()<span class="keyword"> const </span>{ |
| <a name="l00335"></a>00335 Value* value = my_value; |
| <a name="l00336"></a>00336 <span class="keywordflow">if</span>( !value ) { |
| <a name="l00337"></a>00337 value = my_value = reinterpret_cast<Value *>(&(*my_container)[my_index].value); |
| <a name="l00338"></a>00338 } |
| <a name="l00339"></a>00339 __TBB_ASSERT( value==reinterpret_cast<Value *>(&(*my_container)[my_index].value), <span class="stringliteral">"corrupt cache"</span> ); |
| <a name="l00340"></a>00340 <span class="keywordflow">return</span> *value; |
| <a name="l00341"></a>00341 } |
| <a name="l00342"></a>00342 |
| <a name="l00343"></a>00343 Value& operator[]( ptrdiff_t k )<span class="keyword"> const </span>{ |
| <a name="l00344"></a>00344 <span class="keywordflow">return</span> (*my_container)[my_index + k].value; |
| <a name="l00345"></a>00345 } |
| <a name="l00346"></a>00346 |
| <a name="l00347"></a>00347 Value* operator->()<span class="keyword"> const </span>{<span class="keywordflow">return</span> &operator*();} |
| <a name="l00348"></a>00348 |
| <a name="l00349"></a>00349 enumerable_thread_specific_iterator& operator++() { |
| <a name="l00350"></a>00350 ++my_index; |
| <a name="l00351"></a>00351 my_value = NULL; |
| <a name="l00352"></a>00352 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00353"></a>00353 } |
| <a name="l00354"></a>00354 |
| <a name="l00355"></a>00355 enumerable_thread_specific_iterator& operator--() { |
| <a name="l00356"></a>00356 --my_index; |
| <a name="l00357"></a>00357 my_value = NULL; |
| <a name="l00358"></a>00358 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00359"></a>00359 } |
| <a name="l00360"></a>00360 |
| <a name="l00362"></a>00362 enumerable_thread_specific_iterator operator++(<span class="keywordtype">int</span>) { |
| <a name="l00363"></a>00363 enumerable_thread_specific_iterator result = *<span class="keyword">this</span>; |
| <a name="l00364"></a>00364 ++my_index; |
| <a name="l00365"></a>00365 my_value = NULL; |
| <a name="l00366"></a>00366 <span class="keywordflow">return</span> result; |
| <a name="l00367"></a>00367 } |
| <a name="l00368"></a>00368 |
| <a name="l00370"></a>00370 enumerable_thread_specific_iterator operator--(<span class="keywordtype">int</span>) { |
| <a name="l00371"></a>00371 enumerable_thread_specific_iterator result = *<span class="keyword">this</span>; |
| <a name="l00372"></a>00372 --my_index; |
| <a name="l00373"></a>00373 my_value = NULL; |
| <a name="l00374"></a>00374 <span class="keywordflow">return</span> result; |
| <a name="l00375"></a>00375 } |
| <a name="l00376"></a>00376 |
| <a name="l00377"></a>00377 <span class="comment">// STL support</span> |
| <a name="l00378"></a>00378 <span class="keyword">typedef</span> ptrdiff_t difference_type; |
| <a name="l00379"></a>00379 <span class="keyword">typedef</span> Value value_type; |
| <a name="l00380"></a>00380 <span class="keyword">typedef</span> Value* pointer; |
| <a name="l00381"></a>00381 <span class="keyword">typedef</span> Value& reference; |
| <a name="l00382"></a>00382 <span class="keyword">typedef</span> std::random_access_iterator_tag iterator_category; |
| <a name="l00383"></a>00383 }; |
| <a name="l00384"></a>00384 |
| <a name="l00385"></a>00385 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T> |
| <a name="l00386"></a>00386 enumerable_thread_specific_iterator<Container,T> operator+( ptrdiff_t offset, |
| <a name="l00387"></a>00387 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,T>& v ) { |
| <a name="l00388"></a>00388 <span class="keywordflow">return</span> enumerable_thread_specific_iterator<Container,T>( v.my_container, v.my_index + offset ); |
| <a name="l00389"></a>00389 } |
| <a name="l00390"></a>00390 |
| <a name="l00391"></a>00391 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00392"></a>00392 <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00393"></a>00393 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00394"></a>00394 <span class="keywordflow">return</span> i.my_index==j.my_index && i.my_container == j.my_container; |
| <a name="l00395"></a>00395 } |
| <a name="l00396"></a>00396 |
| <a name="l00397"></a>00397 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00398"></a>00398 <span class="keywordtype">bool</span> operator!=( <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00399"></a>00399 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00400"></a>00400 <span class="keywordflow">return</span> !(i==j); |
| <a name="l00401"></a>00401 } |
| <a name="l00402"></a>00402 |
| <a name="l00403"></a>00403 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00404"></a>00404 <span class="keywordtype">bool</span> operator<( const enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00405"></a>00405 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00406"></a>00406 <span class="keywordflow">return</span> i.my_index<j.my_index; |
| <a name="l00407"></a>00407 } |
| <a name="l00408"></a>00408 |
| <a name="l00409"></a>00409 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00410"></a>00410 <span class="keywordtype">bool</span> operator>( <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00411"></a>00411 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00412"></a>00412 <span class="keywordflow">return</span> j<i; |
| <a name="l00413"></a>00413 } |
| <a name="l00414"></a>00414 |
| <a name="l00415"></a>00415 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00416"></a>00416 <span class="keywordtype">bool</span> operator>=( <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00417"></a>00417 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00418"></a>00418 <span class="keywordflow">return</span> !(i<j); |
| <a name="l00419"></a>00419 } |
| <a name="l00420"></a>00420 |
| <a name="l00421"></a>00421 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00422"></a>00422 <span class="keywordtype">bool</span> operator<=( const enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00423"></a>00423 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00424"></a>00424 <span class="keywordflow">return</span> !(j<i); |
| <a name="l00425"></a>00425 } |
| <a name="l00426"></a>00426 |
| <a name="l00427"></a>00427 <span class="keyword">template</span><<span class="keyword">typename</span> Container, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00428"></a>00428 ptrdiff_t operator-( <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,T>& i, |
| <a name="l00429"></a>00429 <span class="keyword">const</span> enumerable_thread_specific_iterator<Container,U>& j ) { |
| <a name="l00430"></a>00430 <span class="keywordflow">return</span> i.my_index-j.my_index; |
| <a name="l00431"></a>00431 } |
| <a name="l00432"></a>00432 |
| <a name="l00433"></a>00433 <span class="keyword">template</span><<span class="keyword">typename</span> SegmentedContainer, <span class="keyword">typename</span> Value > |
| <a name="l00434"></a>00434 <span class="keyword">class </span>segmented_iterator |
| <a name="l00435"></a>00435 #if defined(_WIN64) && defined(_MSC_VER) |
| <a name="l00436"></a>00436 : public std::iterator<std::input_iterator_tag, Value> |
| <a name="l00437"></a>00437 #endif |
| <a name="l00438"></a>00438 { |
| <a name="l00439"></a>00439 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00440"></a>00440 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> segmented_iterator<C,T>& i, <span class="keyword">const</span> segmented_iterator<C,U>& j); |
| <a name="l00441"></a>00441 |
| <a name="l00442"></a>00442 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00443"></a>00443 <span class="keyword">friend</span> <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> segmented_iterator<C,T>& i, <span class="keyword">const</span> segmented_iterator<C,U>& j); |
| <a name="l00444"></a>00444 |
| <a name="l00445"></a>00445 <span class="keyword">template</span><<span class="keyword">typename</span> C, <span class="keyword">typename</span> U> |
| <a name="l00446"></a>00446 <span class="keyword">friend</span> <span class="keyword">class </span>segmented_iterator; |
| <a name="l00447"></a>00447 |
| <a name="l00448"></a>00448 <span class="keyword">public</span>: |
| <a name="l00449"></a>00449 |
| <a name="l00450"></a>00450 segmented_iterator() {my_segcont = NULL;} |
| <a name="l00451"></a>00451 |
| <a name="l00452"></a>00452 segmented_iterator( <span class="keyword">const</span> SegmentedContainer& _segmented_container ) : |
| <a name="l00453"></a>00453 my_segcont(const_cast<SegmentedContainer*>(&_segmented_container)), |
| <a name="l00454"></a>00454 outer_iter(my_segcont->end()) { } |
| <a name="l00455"></a>00455 |
| <a name="l00456"></a>00456 ~segmented_iterator() {} |
| <a name="l00457"></a>00457 |
| <a name="l00458"></a>00458 <span class="keyword">typedef</span> <span class="keyword">typename</span> SegmentedContainer::iterator outer_iterator; |
| <a name="l00459"></a>00459 <span class="keyword">typedef</span> <span class="keyword">typename</span> SegmentedContainer::value_type InnerContainer; |
| <a name="l00460"></a>00460 <span class="keyword">typedef</span> <span class="keyword">typename</span> InnerContainer::iterator inner_iterator; |
| <a name="l00461"></a>00461 |
| <a name="l00462"></a>00462 <span class="comment">// STL support</span> |
| <a name="l00463"></a>00463 <span class="keyword">typedef</span> ptrdiff_t difference_type; |
| <a name="l00464"></a>00464 <span class="keyword">typedef</span> Value value_type; |
| <a name="l00465"></a>00465 <span class="keyword">typedef</span> <span class="keyword">typename</span> SegmentedContainer::size_type size_type; |
| <a name="l00466"></a>00466 <span class="keyword">typedef</span> Value* pointer; |
| <a name="l00467"></a>00467 <span class="keyword">typedef</span> Value& reference; |
| <a name="l00468"></a>00468 <span class="keyword">typedef</span> std::input_iterator_tag iterator_category; |
| <a name="l00469"></a>00469 |
| <a name="l00470"></a>00470 <span class="comment">// Copy Constructor</span> |
| <a name="l00471"></a>00471 <span class="keyword">template</span><<span class="keyword">typename</span> U> |
| <a name="l00472"></a>00472 segmented_iterator(<span class="keyword">const</span> segmented_iterator<SegmentedContainer, U>& other) : |
| <a name="l00473"></a>00473 my_segcont(other.my_segcont), |
| <a name="l00474"></a>00474 outer_iter(other.outer_iter), |
| <a name="l00475"></a>00475 <span class="comment">// can we assign a default-constructed iterator to inner if we're at the end?</span> |
| <a name="l00476"></a>00476 inner_iter(other.inner_iter) |
| <a name="l00477"></a>00477 {} |
| <a name="l00478"></a>00478 |
| <a name="l00479"></a>00479 <span class="comment">// assignment</span> |
| <a name="l00480"></a>00480 <span class="keyword">template</span><<span class="keyword">typename</span> U> |
| <a name="l00481"></a>00481 segmented_iterator& operator=( <span class="keyword">const</span> segmented_iterator<SegmentedContainer, U>& other) { |
| <a name="l00482"></a>00482 <span class="keywordflow">if</span>(<span class="keyword">this</span> != &other) { |
| <a name="l00483"></a>00483 my_segcont = other.my_segcont; |
| <a name="l00484"></a>00484 outer_iter = other.outer_iter; |
| <a name="l00485"></a>00485 <span class="keywordflow">if</span>(outer_iter != my_segcont->end()) inner_iter = other.inner_iter; |
| <a name="l00486"></a>00486 } |
| <a name="l00487"></a>00487 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00488"></a>00488 } |
| <a name="l00489"></a>00489 |
| <a name="l00490"></a>00490 <span class="comment">// allow assignment of outer iterator to segmented iterator. Once it is</span> |
| <a name="l00491"></a>00491 <span class="comment">// assigned, move forward until a non-empty inner container is found or</span> |
| <a name="l00492"></a>00492 <span class="comment">// the end of the outer container is reached.</span> |
| <a name="l00493"></a>00493 segmented_iterator& operator=(<span class="keyword">const</span> outer_iterator& new_outer_iter) { |
| <a name="l00494"></a>00494 __TBB_ASSERT(my_segcont != NULL, NULL); |
| <a name="l00495"></a>00495 <span class="comment">// check that this iterator points to something inside the segmented container</span> |
| <a name="l00496"></a>00496 <span class="keywordflow">for</span>(outer_iter = new_outer_iter ;outer_iter!=my_segcont->end(); ++outer_iter) { |
| <a name="l00497"></a>00497 <span class="keywordflow">if</span>( !outer_iter->empty() ) { |
| <a name="l00498"></a>00498 inner_iter = outer_iter->begin(); |
| <a name="l00499"></a>00499 <span class="keywordflow">break</span>; |
| <a name="l00500"></a>00500 } |
| <a name="l00501"></a>00501 } |
| <a name="l00502"></a>00502 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00503"></a>00503 } |
| <a name="l00504"></a>00504 |
| <a name="l00505"></a>00505 <span class="comment">// pre-increment</span> |
| <a name="l00506"></a>00506 segmented_iterator& operator++() { |
| <a name="l00507"></a>00507 advance_me(); |
| <a name="l00508"></a>00508 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00509"></a>00509 } |
| <a name="l00510"></a>00510 |
| <a name="l00511"></a>00511 <span class="comment">// post-increment</span> |
| <a name="l00512"></a>00512 segmented_iterator operator++(<span class="keywordtype">int</span>) { |
| <a name="l00513"></a>00513 segmented_iterator tmp = *<span class="keyword">this</span>; |
| <a name="l00514"></a>00514 operator++(); |
| <a name="l00515"></a>00515 <span class="keywordflow">return</span> tmp; |
| <a name="l00516"></a>00516 } |
| <a name="l00517"></a>00517 |
| <a name="l00518"></a>00518 <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> outer_iterator& other_outer)<span class="keyword"> const </span>{ |
| <a name="l00519"></a>00519 __TBB_ASSERT(my_segcont != NULL, NULL); |
| <a name="l00520"></a>00520 <span class="keywordflow">return</span> (outer_iter == other_outer && |
| <a name="l00521"></a>00521 (outer_iter == my_segcont->end() || inner_iter == outer_iter->begin())); |
| <a name="l00522"></a>00522 } |
| <a name="l00523"></a>00523 |
| <a name="l00524"></a>00524 <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> outer_iterator& other_outer)<span class="keyword"> const </span>{ |
| <a name="l00525"></a>00525 <span class="keywordflow">return</span> !operator==(other_outer); |
| <a name="l00526"></a>00526 |
| <a name="l00527"></a>00527 } |
| <a name="l00528"></a>00528 |
| <a name="l00529"></a>00529 <span class="comment">// (i)* RHS</span> |
| <a name="l00530"></a>00530 reference operator*()<span class="keyword"> const </span>{ |
| <a name="l00531"></a>00531 __TBB_ASSERT(my_segcont != NULL, NULL); |
| <a name="l00532"></a>00532 __TBB_ASSERT(outer_iter != my_segcont->end(), <span class="stringliteral">"Dereferencing a pointer at end of container"</span>); |
| <a name="l00533"></a>00533 __TBB_ASSERT(inner_iter != outer_iter->end(), NULL); <span class="comment">// should never happen</span> |
| <a name="l00534"></a>00534 <span class="keywordflow">return</span> *inner_iter; |
| <a name="l00535"></a>00535 } |
| <a name="l00536"></a>00536 |
| <a name="l00537"></a>00537 <span class="comment">// i-></span> |
| <a name="l00538"></a>00538 pointer operator->()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> &operator*();} |
| <a name="l00539"></a>00539 |
| <a name="l00540"></a>00540 <span class="keyword">private</span>: |
| <a name="l00541"></a>00541 SegmentedContainer* my_segcont; |
| <a name="l00542"></a>00542 outer_iterator outer_iter; |
| <a name="l00543"></a>00543 inner_iterator inner_iter; |
| <a name="l00544"></a>00544 |
| <a name="l00545"></a>00545 <span class="keywordtype">void</span> advance_me() { |
| <a name="l00546"></a>00546 __TBB_ASSERT(my_segcont != NULL, NULL); |
| <a name="l00547"></a>00547 __TBB_ASSERT(outer_iter != my_segcont->end(), NULL); <span class="comment">// not true if there are no inner containers</span> |
| <a name="l00548"></a>00548 __TBB_ASSERT(inner_iter != outer_iter->end(), NULL); <span class="comment">// not true if the inner containers are all empty.</span> |
| <a name="l00549"></a>00549 ++inner_iter; |
| <a name="l00550"></a>00550 <span class="keywordflow">while</span>(inner_iter == outer_iter->end() && ++outer_iter != my_segcont->end()) { |
| <a name="l00551"></a>00551 inner_iter = outer_iter->begin(); |
| <a name="l00552"></a>00552 } |
| <a name="l00553"></a>00553 } |
| <a name="l00554"></a>00554 }; <span class="comment">// segmented_iterator</span> |
| <a name="l00555"></a>00555 |
| <a name="l00556"></a>00556 <span class="keyword">template</span><<span class="keyword">typename</span> SegmentedContainer, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00557"></a>00557 <span class="keywordtype">bool</span> operator==( <span class="keyword">const</span> segmented_iterator<SegmentedContainer,T>& i, |
| <a name="l00558"></a>00558 <span class="keyword">const</span> segmented_iterator<SegmentedContainer,U>& j ) { |
| <a name="l00559"></a>00559 <span class="keywordflow">if</span>(i.my_segcont != j.my_segcont) <span class="keywordflow">return</span> <span class="keyword">false</span>; |
| <a name="l00560"></a>00560 <span class="keywordflow">if</span>(i.my_segcont == NULL) <span class="keywordflow">return</span> <span class="keyword">true</span>; |
| <a name="l00561"></a>00561 <span class="keywordflow">if</span>(i.outer_iter != j.outer_iter) <span class="keywordflow">return</span> <span class="keyword">false</span>; |
| <a name="l00562"></a>00562 <span class="keywordflow">if</span>(i.outer_iter == i.my_segcont->end()) <span class="keywordflow">return</span> <span class="keyword">true</span>; |
| <a name="l00563"></a>00563 <span class="keywordflow">return</span> i.inner_iter == j.inner_iter; |
| <a name="l00564"></a>00564 } |
| <a name="l00565"></a>00565 |
| <a name="l00566"></a>00566 <span class="comment">// !=</span> |
| <a name="l00567"></a>00567 <span class="keyword">template</span><<span class="keyword">typename</span> SegmentedContainer, <span class="keyword">typename</span> T, <span class="keyword">typename</span> U> |
| <a name="l00568"></a>00568 <span class="keywordtype">bool</span> operator!=( <span class="keyword">const</span> segmented_iterator<SegmentedContainer,T>& i, |
| <a name="l00569"></a>00569 <span class="keyword">const</span> segmented_iterator<SegmentedContainer,U>& j ) { |
| <a name="l00570"></a>00570 <span class="keywordflow">return</span> !(i==j); |
| <a name="l00571"></a>00571 } |
| <a name="l00572"></a>00572 |
| <a name="l00573"></a>00573 <span class="comment">// storage for initialization function pointer</span> |
| <a name="l00574"></a>00574 <span class="keyword">template</span><<span class="keyword">typename</span> T> |
| <a name="l00575"></a>00575 <span class="keyword">struct </span>callback_base { |
| <a name="l00576"></a>00576 <span class="keyword">virtual</span> T apply( ) = 0; |
| <a name="l00577"></a>00577 <span class="keyword">virtual</span> <span class="keywordtype">void</span> destroy( ) = 0; |
| <a name="l00578"></a>00578 <span class="comment">// need to be able to create copies of callback_base for copy constructor</span> |
| <a name="l00579"></a>00579 <span class="keyword">virtual</span> callback_base* make_copy() = 0; |
| <a name="l00580"></a>00580 <span class="comment">// need virtual destructor to satisfy GCC compiler warning</span> |
| <a name="l00581"></a>00581 <span class="keyword">virtual</span> ~callback_base() { } |
| <a name="l00582"></a>00582 }; |
| <a name="l00583"></a>00583 |
| <a name="l00584"></a>00584 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Functor> |
| <a name="l00585"></a>00585 <span class="keyword">struct </span>callback_leaf : <span class="keyword">public</span> callback_base<T>, <span class="keyword">public</span> tbb::internal::no_copy { |
| <a name="l00586"></a>00586 <span class="keyword">typedef</span> Functor my_callback_type; |
| <a name="l00587"></a>00587 <span class="keyword">typedef</span> callback_leaf<T,Functor> my_type; |
| <a name="l00588"></a>00588 <span class="keyword">typedef</span> my_type* callback_pointer; |
| <a name="l00589"></a>00589 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00204.html">tbb::tbb_allocator<my_type></a> my_allocator_type; |
| <a name="l00590"></a>00590 Functor f; |
| <a name="l00591"></a>00591 callback_leaf( <span class="keyword">const</span> Functor& f_) : f(f_) { |
| <a name="l00592"></a>00592 } |
| <a name="l00593"></a>00593 |
| <a name="l00594"></a>00594 <span class="keyword">static</span> callback_pointer new_callback(<span class="keyword">const</span> Functor& f_ ) { |
| <a name="l00595"></a>00595 <span class="keywordtype">void</span>* new_void = my_allocator_type().allocate(1); |
| <a name="l00596"></a>00596 callback_pointer new_cb = <span class="keyword">new</span> (new_void) callback_leaf<T,Functor>(f_); <span class="comment">// placement new</span> |
| <a name="l00597"></a>00597 <span class="keywordflow">return</span> new_cb; |
| <a name="l00598"></a>00598 } |
| <a name="l00599"></a>00599 |
| <a name="l00600"></a>00600 <span class="comment">/* override */</span> callback_pointer make_copy() { |
| <a name="l00601"></a>00601 <span class="keywordflow">return</span> new_callback( f ); |
| <a name="l00602"></a>00602 } |
| <a name="l00603"></a>00603 |
| <a name="l00604"></a>00604 <span class="comment">/* override */</span> <span class="keywordtype">void</span> destroy( ) { |
| <a name="l00605"></a>00605 callback_pointer my_ptr = <span class="keyword">this</span>; |
| <a name="l00606"></a>00606 my_allocator_type().destroy(my_ptr); |
| <a name="l00607"></a>00607 my_allocator_type().deallocate(my_ptr,1); |
| <a name="l00608"></a>00608 } |
| <a name="l00609"></a>00609 <span class="comment">/* override */</span> T apply() { <span class="keywordflow">return</span> f(); } <span class="comment">// does copy construction of returned value.</span> |
| <a name="l00610"></a>00610 }; |
| <a name="l00611"></a>00611 |
| <a name="l00612"></a>00612 |
| <a name="l00614"></a>00614 |
| <a name="l00619"></a>00619 <span class="keyword">template</span><<span class="keyword">typename</span> U, size_t ModularSize> |
| <a name="l00620"></a>00620 <span class="keyword">struct </span>ets_element { |
| <a name="l00621"></a>00621 <span class="keywordtype">char</span> value[<span class="keyword">sizeof</span>(U) + tbb::internal::NFS_MaxLineSize-ModularSize]; |
| <a name="l00622"></a>00622 <span class="keywordtype">void</span> unconstruct() { |
| <a name="l00623"></a>00623 <span class="comment">// "reinterpret_cast<U*>(&value)->~U();" causes type-punning warning with gcc 4.4,</span> |
| <a name="l00624"></a>00624 <span class="comment">// "U* u = reinterpret_cast<U*>(&value); u->~U();" causes unused variable warning with VS2010.</span> |
| <a name="l00625"></a>00625 <span class="comment">// Thus another "casting via union" hack.</span> |
| <a name="l00626"></a>00626 __TBB_ASSERT(<span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)==<span class="keyword">sizeof</span>(U*),NULL); |
| <a name="l00627"></a>00627 <span class="keyword">union </span>{ <span class="keywordtype">void</span>* space; U* val; } helper; |
| <a name="l00628"></a>00628 helper.space = &value; |
| <a name="l00629"></a>00629 helper.val->~U(); |
| <a name="l00630"></a>00630 } |
| <a name="l00631"></a>00631 }; |
| <a name="l00632"></a>00632 |
| <a name="l00634"></a>00634 <span class="keyword">template</span><<span class="keyword">typename</span> U> |
| <a name="l00635"></a>00635 <span class="keyword">struct </span>ets_element<U,0> { |
| <a name="l00636"></a>00636 <span class="keywordtype">char</span> value[<span class="keyword">sizeof</span>(U)]; |
| <a name="l00637"></a>00637 <span class="keywordtype">void</span> unconstruct() { <span class="comment">// Same implementation as in general case</span> |
| <a name="l00638"></a>00638 __TBB_ASSERT(<span class="keyword">sizeof</span>(<span class="keywordtype">void</span>*)==<span class="keyword">sizeof</span>(U*),NULL); |
| <a name="l00639"></a>00639 <span class="keyword">union </span>{ <span class="keywordtype">void</span>* space; U* val; } helper; |
| <a name="l00640"></a>00640 helper.space = &value; |
| <a name="l00641"></a>00641 helper.val->~U(); |
| <a name="l00642"></a>00642 } |
| <a name="l00643"></a>00643 }; |
| <a name="l00644"></a>00644 |
| <a name="l00645"></a>00645 } <span class="comment">// namespace internal</span> |
| <a name="l00647"></a>00647 <span class="comment"></span> |
| <a name="l00649"></a>00649 |
| <a name="l00668"></a>00668 <span class="keyword">template</span> <<span class="keyword">typename</span> T, |
| <a name="l00669"></a>00669 <span class="keyword">typename</span> Allocator=cache_aligned_allocator<T>, |
| <a name="l00670"></a><a class="code" href="a00164.html">00670</a> <a class="code" href="a00267.html#a8622ae61b7e7737dac26542e181178e">ets_key_usage_type</a> ETS_key_type=ets_no_key > |
| <a name="l00671"></a>00671 <span class="keyword">class </span><a class="code" href="a00164.html">enumerable_thread_specific</a>: internal::ets_base<ETS_key_type> { |
| <a name="l00672"></a>00672 |
| <a name="l00673"></a>00673 <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> A, ets_key_usage_type C> <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00164.html">enumerable_thread_specific</a>; |
| <a name="l00674"></a>00674 |
| <a name="l00675"></a>00675 <span class="keyword">typedef</span> internal::ets_element<T,sizeof(T)%tbb::internal::NFS_MaxLineSize> padded_element; |
| <a name="l00676"></a>00676 |
| <a name="l00678"></a>00678 <span class="keyword">template</span><<span class="keyword">typename</span> I> |
| <a name="l00679"></a>00679 <span class="keyword">class </span>generic_range_type: <span class="keyword">public</span> <a class="code" href="a00148.html">blocked_range</a><I> { |
| <a name="l00680"></a>00680 <span class="keyword">public</span>: |
| <a name="l00681"></a>00681 <span class="keyword">typedef</span> T value_type; |
| <a name="l00682"></a>00682 <span class="keyword">typedef</span> T& reference; |
| <a name="l00683"></a>00683 <span class="keyword">typedef</span> <span class="keyword">const</span> T& const_reference; |
| <a name="l00684"></a>00684 <span class="keyword">typedef</span> I iterator; |
| <a name="l00685"></a>00685 <span class="keyword">typedef</span> ptrdiff_t difference_type; |
| <a name="l00686"></a>00686 generic_range_type( I begin_, I end_, size_t grainsize_ = 1) : <a class="code" href="a00148.html">blocked_range<I></a>(begin_,end_,grainsize_) {} |
| <a name="l00687"></a>00687 template<typename U> |
| <a name="l00688"></a>00688 generic_range_type( <span class="keyword">const</span> generic_range_type<U>& r) : <a class="code" href="a00148.html">blocked_range<I></a>(r.begin(),r.end(),r.grainsize()) {} |
| <a name="l00689"></a>00689 generic_range_type( generic_range_type& r, <a class="code" href="a00198.html">split</a> ) : <a class="code" href="a00148.html">blocked_range<I></a>(r,<a class="code" href="a00198.html">split</a>()) {} |
| <a name="l00690"></a>00690 }; |
| <a name="l00691"></a>00691 |
| <a name="l00692"></a>00692 <span class="keyword">typedef</span> <span class="keyword">typename</span> Allocator::template rebind< padded_element >::other padded_allocator_type; |
| <a name="l00693"></a>00693 <span class="keyword">typedef</span> <a class="code" href="a00162.html">tbb::concurrent_vector< padded_element, padded_allocator_type ></a> <a class="code" href="a00162.html">internal_collection_type</a>; |
| <a name="l00694"></a>00694 |
| <a name="l00695"></a>00695 internal::callback_base<T> *my_finit_callback; |
| <a name="l00696"></a>00696 |
| <a name="l00697"></a>00697 <span class="comment">// need to use a pointed-to exemplar because T may not be assignable.</span> |
| <a name="l00698"></a>00698 <span class="comment">// using tbb_allocator instead of padded_element_allocator because we may be</span> |
| <a name="l00699"></a>00699 <span class="comment">// copying an exemplar from one instantiation of ETS to another with a different</span> |
| <a name="l00700"></a>00700 <span class="comment">// allocator.</span> |
| <a name="l00701"></a>00701 <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00204.html">tbb::tbb_allocator<padded_element ></a> <a class="code" href="a00204.html">exemplar_allocator_type</a>; |
| <a name="l00702"></a>00702 <span class="keyword">static</span> padded_element * create_exemplar(<span class="keyword">const</span> T& my_value) { |
| <a name="l00703"></a>00703 padded_element *new_exemplar = reinterpret_cast<padded_element *>(exemplar_allocator_type().allocate(1)); |
| <a name="l00704"></a>00704 <span class="keyword">new</span>(new_exemplar->value) T(my_value); |
| <a name="l00705"></a>00705 <span class="keywordflow">return</span> new_exemplar; |
| <a name="l00706"></a>00706 } |
| <a name="l00707"></a>00707 |
| <a name="l00708"></a>00708 <span class="keyword">static</span> padded_element *create_exemplar( ) { |
| <a name="l00709"></a>00709 padded_element *new_exemplar = reinterpret_cast<padded_element *>(exemplar_allocator_type().allocate(1)); |
| <a name="l00710"></a>00710 <span class="keyword">new</span>(new_exemplar->value) T( ); |
| <a name="l00711"></a>00711 <span class="keywordflow">return</span> new_exemplar; |
| <a name="l00712"></a>00712 } |
| <a name="l00713"></a>00713 |
| <a name="l00714"></a>00714 <span class="keyword">static</span> <span class="keywordtype">void</span> free_exemplar(padded_element *my_ptr) { |
| <a name="l00715"></a>00715 my_ptr->unconstruct(); |
| <a name="l00716"></a>00716 exemplar_allocator_type().destroy(my_ptr); |
| <a name="l00717"></a>00717 exemplar_allocator_type().deallocate(my_ptr,1); |
| <a name="l00718"></a>00718 } |
| <a name="l00719"></a>00719 |
| <a name="l00720"></a>00720 padded_element* my_exemplar_ptr; |
| <a name="l00721"></a>00721 |
| <a name="l00722"></a>00722 internal_collection_type my_locals; |
| <a name="l00723"></a>00723 |
| <a name="l00724"></a>00724 <span class="comment">/*override*/</span> <span class="keywordtype">void</span>* create_local() { |
| <a name="l00725"></a>00725 <span class="preprocessor">#if TBB_DEPRECATED</span> |
| <a name="l00726"></a>00726 <span class="preprocessor"></span> <span class="keywordtype">void</span>* lref = &my_locals[my_locals.<a class="code" href="a00162.html#e94e038f915c0268fdf2d3d7f87d81b8">push_back</a>(padded_element())]; |
| <a name="l00727"></a>00727 <span class="preprocessor">#else</span> |
| <a name="l00728"></a>00728 <span class="preprocessor"></span> <span class="keywordtype">void</span>* lref = &*my_locals.<a class="code" href="a00162.html#e94e038f915c0268fdf2d3d7f87d81b8">push_back</a>(padded_element()); |
| <a name="l00729"></a>00729 <span class="preprocessor">#endif</span> |
| <a name="l00730"></a>00730 <span class="preprocessor"></span> <span class="keywordflow">if</span>(my_finit_callback) { |
| <a name="l00731"></a>00731 <span class="keyword">new</span>(lref) T(my_finit_callback->apply()); |
| <a name="l00732"></a>00732 } <span class="keywordflow">else</span> <span class="keywordflow">if</span>(my_exemplar_ptr) { |
| <a name="l00733"></a>00733 pointer t_exemp = reinterpret_cast<T *>(&(my_exemplar_ptr->value)); |
| <a name="l00734"></a>00734 <span class="keyword">new</span>(lref) T(*t_exemp); |
| <a name="l00735"></a>00735 } <span class="keywordflow">else</span> { |
| <a name="l00736"></a>00736 <span class="keyword">new</span>(lref) T(); |
| <a name="l00737"></a>00737 } |
| <a name="l00738"></a>00738 <span class="keywordflow">return</span> lref; |
| <a name="l00739"></a>00739 } |
| <a name="l00740"></a>00740 |
| <a name="l00741"></a>00741 <span class="keywordtype">void</span> unconstruct_locals() { |
| <a name="l00742"></a>00742 <span class="keywordflow">for</span>(<span class="keyword">typename</span> internal_collection_type::iterator cvi = my_locals.<a class="code" href="a00162.html#730b23a251ecb6d37f692fb22f38e029">begin</a>(); cvi != my_locals.<a class="code" href="a00162.html#c0b51160e5a764982ec97a455f94f2c6">end</a>(); ++cvi) { |
| <a name="l00743"></a>00743 cvi->unconstruct(); |
| <a name="l00744"></a>00744 } |
| <a name="l00745"></a>00745 } |
| <a name="l00746"></a>00746 |
| <a name="l00747"></a>00747 <span class="keyword">typedef</span> <span class="keyword">typename</span> Allocator::template rebind< uintptr_t >::other array_allocator_type; |
| <a name="l00748"></a>00748 |
| <a name="l00749"></a>00749 <span class="comment">// _size is in bytes</span> |
| <a name="l00750"></a>00750 <span class="comment">/*override*/</span> <span class="keywordtype">void</span>* create_array(size_t _size) { |
| <a name="l00751"></a>00751 size_t nelements = (_size + <span class="keyword">sizeof</span>(uintptr_t) -1) / <span class="keyword">sizeof</span>(uintptr_t); |
| <a name="l00752"></a>00752 <span class="keywordflow">return</span> array_allocator_type().allocate(nelements); |
| <a name="l00753"></a>00753 } |
| <a name="l00754"></a>00754 |
| <a name="l00755"></a>00755 <span class="comment">/*override*/</span> <span class="keywordtype">void</span> free_array( <span class="keywordtype">void</span>* _ptr, size_t _size) { |
| <a name="l00756"></a>00756 size_t nelements = (_size + <span class="keyword">sizeof</span>(uintptr_t) -1) / <span class="keyword">sizeof</span>(uintptr_t); |
| <a name="l00757"></a>00757 array_allocator_type().deallocate( reinterpret_cast<uintptr_t *>(_ptr),nelements); |
| <a name="l00758"></a>00758 } |
| <a name="l00759"></a>00759 |
| <a name="l00760"></a>00760 <span class="keyword">public</span>: |
| <a name="l00761"></a>00761 |
| <a name="l00763"></a>00763 <span class="keyword">typedef</span> Allocator allocator_type; |
| <a name="l00764"></a>00764 <span class="keyword">typedef</span> T value_type; |
| <a name="l00765"></a>00765 <span class="keyword">typedef</span> T& reference; |
| <a name="l00766"></a>00766 <span class="keyword">typedef</span> <span class="keyword">const</span> T& const_reference; |
| <a name="l00767"></a>00767 <span class="keyword">typedef</span> T* pointer; |
| <a name="l00768"></a>00768 <span class="keyword">typedef</span> <span class="keyword">const</span> T* const_pointer; |
| <a name="l00769"></a>00769 <span class="keyword">typedef</span> <span class="keyword">typename</span> internal_collection_type::size_type size_type; |
| <a name="l00770"></a>00770 <span class="keyword">typedef</span> <span class="keyword">typename</span> internal_collection_type::difference_type difference_type; |
| <a name="l00771"></a>00771 |
| <a name="l00772"></a>00772 <span class="comment">// Iterator types</span> |
| <a name="l00773"></a>00773 <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::enumerable_thread_specific_iterator< internal_collection_type, value_type > iterator; |
| <a name="l00774"></a>00774 <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::enumerable_thread_specific_iterator< internal_collection_type, const value_type > const_iterator; |
| <a name="l00775"></a>00775 |
| <a name="l00776"></a>00776 <span class="comment">// Parallel range types</span> |
| <a name="l00777"></a>00777 <span class="keyword">typedef</span> generic_range_type< iterator > range_type; |
| <a name="l00778"></a>00778 <span class="keyword">typedef</span> generic_range_type< const_iterator > const_range_type; |
| <a name="l00779"></a>00779 |
| <a name="l00781"></a>00781 <a class="code" href="a00164.html">enumerable_thread_specific</a>() : my_finit_callback(0) { |
| <a name="l00782"></a>00782 my_exemplar_ptr = 0; |
| <a name="l00783"></a>00783 } |
| <a name="l00784"></a>00784 |
| <a name="l00786"></a>00786 <span class="comment">// Finit should be a function taking 0 parameters and returning a T</span> |
| <a name="l00787"></a><a class="code" href="a00164.html#724ed4c846493da62b4efe032e16eb4a">00787</a> <span class="keyword">template</span> <<span class="keyword">typename</span> Finit> |
| <a name="l00788"></a>00788 <a class="code" href="a00164.html">enumerable_thread_specific</a>( Finit _finit ) |
| <a name="l00789"></a>00789 { |
| <a name="l00790"></a>00790 my_finit_callback = internal::callback_leaf<T,Finit>::new_callback( _finit ); |
| <a name="l00791"></a>00791 my_exemplar_ptr = 0; <span class="comment">// don't need exemplar if function is provided</span> |
| <a name="l00792"></a>00792 } |
| <a name="l00793"></a>00793 |
| <a name="l00795"></a>00795 <a class="code" href="a00164.html">enumerable_thread_specific</a>(<span class="keyword">const</span> T &_exemplar) : my_finit_callback(0) { |
| <a name="l00796"></a>00796 my_exemplar_ptr = create_exemplar(_exemplar); |
| <a name="l00797"></a>00797 } |
| <a name="l00798"></a>00798 |
| <a name="l00800"></a>00800 ~<a class="code" href="a00164.html">enumerable_thread_specific</a>() { |
| <a name="l00801"></a>00801 <span class="keywordflow">if</span>(my_finit_callback) { |
| <a name="l00802"></a>00802 my_finit_callback->destroy(); |
| <a name="l00803"></a>00803 } |
| <a name="l00804"></a>00804 <span class="keywordflow">if</span>(my_exemplar_ptr) { |
| <a name="l00805"></a>00805 free_exemplar(my_exemplar_ptr); |
| <a name="l00806"></a>00806 } |
| <a name="l00807"></a>00807 this->clear(); <span class="comment">// deallocation before the derived class is finished destructing</span> |
| <a name="l00808"></a>00808 <span class="comment">// So free(array *) is still accessible</span> |
| <a name="l00809"></a>00809 } |
| <a name="l00810"></a>00810 |
| <a name="l00812"></a>00812 reference local() { |
| <a name="l00813"></a>00813 <span class="keywordtype">bool</span> exists; |
| <a name="l00814"></a>00814 <span class="keywordflow">return</span> local(exists); |
| <a name="l00815"></a>00815 } |
| <a name="l00816"></a>00816 |
| <a name="l00818"></a>00818 reference local(<span class="keywordtype">bool</span>& exists) { |
| <a name="l00819"></a>00819 __TBB_ASSERT(ETS_key_type==ets_no_key,<span class="stringliteral">"ets_key_per_instance not yet implemented"</span>); |
| <a name="l00820"></a>00820 <span class="keywordtype">void</span>* ptr = this->table_lookup(exists); |
| <a name="l00821"></a>00821 <span class="keywordflow">return</span> *(T*)ptr; |
| <a name="l00822"></a>00822 } |
| <a name="l00823"></a>00823 |
| <a name="l00825"></a>00825 size_type size()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> my_locals.<a class="code" href="a00162.html#715fe313c4a9c22731cc404dd80c9ec9">size</a>(); } |
| <a name="l00826"></a>00826 |
| <a name="l00828"></a>00828 <span class="keywordtype">bool</span> empty()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> my_locals.<a class="code" href="a00162.html#c6426cb93cf20d3af40f3c90f1f0481a">empty</a>(); } |
| <a name="l00829"></a>00829 |
| <a name="l00831"></a>00831 iterator begin() { <span class="keywordflow">return</span> iterator( my_locals, 0 ); } |
| <a name="l00833"></a>00833 iterator end() { <span class="keywordflow">return</span> iterator(my_locals, my_locals.<a class="code" href="a00162.html#715fe313c4a9c22731cc404dd80c9ec9">size</a>() ); } |
| <a name="l00834"></a>00834 |
| <a name="l00836"></a>00836 const_iterator begin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(my_locals, 0); } |
| <a name="l00837"></a>00837 |
| <a name="l00839"></a>00839 const_iterator end()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(my_locals, my_locals.<a class="code" href="a00162.html#715fe313c4a9c22731cc404dd80c9ec9">size</a>()); } |
| <a name="l00840"></a>00840 |
| <a name="l00842"></a>00842 range_type range( size_t grainsize=1 ) { <span class="keywordflow">return</span> range_type( begin(), end(), grainsize ); } |
| <a name="l00843"></a>00843 |
| <a name="l00845"></a>00845 const_range_type range( size_t grainsize=1 )<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_range_type( begin(), end(), grainsize ); } |
| <a name="l00846"></a>00846 |
| <a name="l00848"></a>00848 <span class="keywordtype">void</span> clear() { |
| <a name="l00849"></a>00849 unconstruct_locals(); |
| <a name="l00850"></a>00850 my_locals.<a class="code" href="a00162.html#26f937a359a66b6aae904c3cd9a3c444">clear</a>(); |
| <a name="l00851"></a>00851 this->table_clear(); |
| <a name="l00852"></a>00852 <span class="comment">// callback is not destroyed</span> |
| <a name="l00853"></a>00853 <span class="comment">// exemplar is not destroyed</span> |
| <a name="l00854"></a>00854 } |
| <a name="l00855"></a>00855 |
| <a name="l00856"></a>00856 <span class="keyword">private</span>: |
| <a name="l00857"></a>00857 |
| <a name="l00858"></a>00858 <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> A2, ets_key_usage_type C2> |
| <a name="l00859"></a>00859 <span class="keywordtype">void</span> internal_copy( <span class="keyword">const</span> enumerable_thread_specific<U, A2, C2>& other); |
| <a name="l00860"></a>00860 |
| <a name="l00861"></a>00861 <span class="keyword">public</span>: |
| <a name="l00862"></a>00862 |
| <a name="l00863"></a>00863 <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> Alloc, ets_key_usage_type Cachetype> |
| <a name="l00864"></a>00864 enumerable_thread_specific( <span class="keyword">const</span> enumerable_thread_specific<U, Alloc, Cachetype>& other ) : internal::ets_base<ETS_key_type> () |
| <a name="l00865"></a>00865 { |
| <a name="l00866"></a>00866 internal_copy(other); |
| <a name="l00867"></a>00867 } |
| <a name="l00868"></a>00868 |
| <a name="l00869"></a>00869 enumerable_thread_specific( <span class="keyword">const</span> enumerable_thread_specific& other ) : internal::ets_base<ETS_key_type> () |
| <a name="l00870"></a>00870 { |
| <a name="l00871"></a>00871 internal_copy(other); |
| <a name="l00872"></a>00872 } |
| <a name="l00873"></a>00873 |
| <a name="l00874"></a>00874 <span class="keyword">private</span>: |
| <a name="l00875"></a>00875 |
| <a name="l00876"></a>00876 <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> A2, ets_key_usage_type C2> |
| <a name="l00877"></a>00877 enumerable_thread_specific & |
| <a name="l00878"></a>00878 internal_assign(<span class="keyword">const</span> enumerable_thread_specific<U, A2, C2>& other) { |
| <a name="l00879"></a>00879 <span class="keywordflow">if</span>(static_cast<void *>( <span class="keyword">this</span> ) != static_cast<const void *>( &other )) { |
| <a name="l00880"></a>00880 this->clear(); |
| <a name="l00881"></a>00881 <span class="keywordflow">if</span>(my_finit_callback) { |
| <a name="l00882"></a>00882 my_finit_callback->destroy(); |
| <a name="l00883"></a>00883 my_finit_callback = 0; |
| <a name="l00884"></a>00884 } |
| <a name="l00885"></a>00885 <span class="keywordflow">if</span>(my_exemplar_ptr) { |
| <a name="l00886"></a>00886 free_exemplar(my_exemplar_ptr); |
| <a name="l00887"></a>00887 my_exemplar_ptr = 0; |
| <a name="l00888"></a>00888 } |
| <a name="l00889"></a>00889 internal_copy( other ); |
| <a name="l00890"></a>00890 } |
| <a name="l00891"></a>00891 <span class="keywordflow">return</span> *<span class="keyword">this</span>; |
| <a name="l00892"></a>00892 } |
| <a name="l00893"></a>00893 |
| <a name="l00894"></a>00894 <span class="keyword">public</span>: |
| <a name="l00895"></a>00895 |
| <a name="l00896"></a>00896 <span class="comment">// assignment</span> |
| <a name="l00897"></a>00897 enumerable_thread_specific& operator=(<span class="keyword">const</span> enumerable_thread_specific& other) { |
| <a name="l00898"></a>00898 <span class="keywordflow">return</span> internal_assign(other); |
| <a name="l00899"></a>00899 } |
| <a name="l00900"></a>00900 |
| <a name="l00901"></a>00901 <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> Alloc, ets_key_usage_type Cachetype> |
| <a name="l00902"></a>00902 enumerable_thread_specific& operator=(<span class="keyword">const</span> enumerable_thread_specific<U, Alloc, Cachetype>& other) |
| <a name="l00903"></a>00903 { |
| <a name="l00904"></a>00904 <span class="keywordflow">return</span> internal_assign(other); |
| <a name="l00905"></a>00905 } |
| <a name="l00906"></a>00906 |
| <a name="l00907"></a>00907 <span class="comment">// combine_func_t has signature T(T,T) or T(const T&, const T&)</span> |
| <a name="l00908"></a>00908 <span class="keyword">template</span> <<span class="keyword">typename</span> combine_func_t> |
| <a name="l00909"></a>00909 T combine(combine_func_t f_combine) { |
| <a name="l00910"></a>00910 <span class="keywordflow">if</span>(begin() == end()) { |
| <a name="l00911"></a>00911 <span class="keywordflow">if</span>(my_finit_callback) { |
| <a name="l00912"></a>00912 <span class="keywordflow">return</span> my_finit_callback->apply(); |
| <a name="l00913"></a>00913 } |
| <a name="l00914"></a>00914 pointer local_ref = reinterpret_cast<T*>((my_exemplar_ptr->value)); |
| <a name="l00915"></a>00915 <span class="keywordflow">return</span> T(*local_ref); |
| <a name="l00916"></a>00916 } |
| <a name="l00917"></a>00917 const_iterator ci = begin(); |
| <a name="l00918"></a>00918 T my_result = *ci; |
| <a name="l00919"></a>00919 <span class="keywordflow">while</span>(++ci != end()) |
| <a name="l00920"></a>00920 my_result = f_combine( my_result, *ci ); |
| <a name="l00921"></a>00921 <span class="keywordflow">return</span> my_result; |
| <a name="l00922"></a>00922 } |
| <a name="l00923"></a>00923 |
| <a name="l00924"></a>00924 <span class="comment">// combine_func_t has signature void(T) or void(const T&)</span> |
| <a name="l00925"></a>00925 <span class="keyword">template</span> <<span class="keyword">typename</span> combine_func_t> |
| <a name="l00926"></a>00926 <span class="keywordtype">void</span> combine_each(combine_func_t f_combine) { |
| <a name="l00927"></a>00927 <span class="keywordflow">for</span>(const_iterator ci = begin(); ci != end(); ++ci) { |
| <a name="l00928"></a>00928 f_combine( *ci ); |
| <a name="l00929"></a>00929 } |
| <a name="l00930"></a>00930 } |
| <a name="l00931"></a>00931 |
| <a name="l00932"></a>00932 }; <span class="comment">// enumerable_thread_specific</span> |
| <a name="l00933"></a>00933 |
| <a name="l00934"></a>00934 |
| <a name="l00935"></a>00935 <span class="keyword">template</span> <<span class="keyword">typename</span> T, <span class="keyword">typename</span> Allocator, ets_key_usage_type ETS_key_type> |
| <a name="l00936"></a>00936 <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> A2, ets_key_usage_type C2> |
| <a name="l00937"></a>00937 <span class="keywordtype">void</span> enumerable_thread_specific<T,Allocator,ETS_key_type>::internal_copy( <span class="keyword">const</span> enumerable_thread_specific<U, A2, C2>& other) { |
| <a name="l00938"></a>00938 <span class="keyword">typedef</span> internal::ets_base<ets_no_key> base; |
| <a name="l00939"></a>00939 __TBB_ASSERT(my_locals.<a class="code" href="a00162.html#715fe313c4a9c22731cc404dd80c9ec9">size</a>()==0,NULL); |
| <a name="l00940"></a>00940 this->table_reserve_for_copy( other ); |
| <a name="l00941"></a>00941 <span class="keywordflow">for</span>( base::array* r=other.my_root; r; r=r->next ) { |
| <a name="l00942"></a>00942 <span class="keywordflow">for</span>( size_t i=0; i<r-><a class="code" href="a00148.html#9eaa0b6beff1420f688570bbf6b8c462">size</a>(); ++i ) { |
| <a name="l00943"></a>00943 base::slot& s1 = r->at(i); |
| <a name="l00944"></a>00944 <span class="keywordflow">if</span>( !s1.empty() ) { |
| <a name="l00945"></a>00945 base::slot& s2 = this->table_find(s1.key); |
| <a name="l00946"></a>00946 <span class="keywordflow">if</span>( s2.empty() ) { |
| <a name="l00947"></a>00947 #<span class="keywordflow">if</span> TBB_DEPRECATED |
| <a name="l00948"></a>00948 <span class="keywordtype">void</span>* lref = &my_locals[my_locals.<a class="code" href="a00162.html#e94e038f915c0268fdf2d3d7f87d81b8">push_back</a>(padded_element())]; |
| <a name="l00949"></a>00949 <span class="preprocessor">#else</span> |
| <a name="l00950"></a>00950 <span class="preprocessor"></span> <span class="keywordtype">void</span>* lref = &*my_locals.<a class="code" href="a00162.html#e94e038f915c0268fdf2d3d7f87d81b8">push_back</a>(padded_element()); |
| <a name="l00951"></a>00951 <span class="preprocessor">#endif</span> |
| <a name="l00952"></a>00952 <span class="preprocessor"></span> s2.ptr = <span class="keyword">new</span>(lref) T(*(U*)s1.ptr); |
| <a name="l00953"></a>00953 s2.key = s1.key; |
| <a name="l00954"></a>00954 } <span class="keywordflow">else</span> { |
| <a name="l00955"></a>00955 <span class="comment">// Skip the duplicate</span> |
| <a name="l00956"></a>00956 } |
| <a name="l00957"></a>00957 } |
| <a name="l00958"></a>00958 } |
| <a name="l00959"></a>00959 } |
| <a name="l00960"></a>00960 <span class="keywordflow">if</span>(other.my_finit_callback) { |
| <a name="l00961"></a>00961 my_finit_callback = other.my_finit_callback->make_copy(); |
| <a name="l00962"></a>00962 } <span class="keywordflow">else</span> { |
| <a name="l00963"></a>00963 my_finit_callback = 0; |
| <a name="l00964"></a>00964 } |
| <a name="l00965"></a>00965 <span class="keywordflow">if</span>(other.my_exemplar_ptr) { |
| <a name="l00966"></a>00966 pointer local_ref = reinterpret_cast<U*>(other.my_exemplar_ptr->value); |
| <a name="l00967"></a>00967 my_exemplar_ptr = create_exemplar(*local_ref); |
| <a name="l00968"></a>00968 } <span class="keywordflow">else</span> { |
| <a name="l00969"></a>00969 my_exemplar_ptr = 0; |
| <a name="l00970"></a>00970 } |
| <a name="l00971"></a>00971 } |
| <a name="l00972"></a>00972 |
| <a name="l00973"></a>00973 <span class="keyword">template</span>< <span class="keyword">typename</span> Container > |
| <a name="l00974"></a>00974 <span class="keyword">class </span>flattened2d { |
| <a name="l00975"></a>00975 |
| <a name="l00976"></a>00976 <span class="comment">// This intermediate typedef is to address issues with VC7.1 compilers</span> |
| <a name="l00977"></a>00977 <span class="keyword">typedef</span> <span class="keyword">typename</span> Container::value_type conval_type; |
| <a name="l00978"></a>00978 |
| <a name="l00979"></a>00979 <span class="keyword">public</span>: |
| <a name="l00980"></a>00980 |
| <a name="l00982"></a>00982 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::size_type size_type; |
| <a name="l00983"></a>00983 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::difference_type difference_type; |
| <a name="l00984"></a>00984 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::allocator_type allocator_type; |
| <a name="l00985"></a>00985 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::value_type value_type; |
| <a name="l00986"></a>00986 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::reference reference; |
| <a name="l00987"></a>00987 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::const_reference const_reference; |
| <a name="l00988"></a>00988 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::pointer pointer; |
| <a name="l00989"></a>00989 <span class="keyword">typedef</span> <span class="keyword">typename</span> conval_type::const_pointer const_pointer; |
| <a name="l00990"></a>00990 |
| <a name="l00991"></a>00991 <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::segmented_iterator<Container, value_type> iterator; |
| <a name="l00992"></a>00992 <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::segmented_iterator<Container, const value_type> const_iterator; |
| <a name="l00993"></a>00993 |
| <a name="l00994"></a>00994 flattened2d( <span class="keyword">const</span> Container &c, <span class="keyword">typename</span> Container::const_iterator b, <span class="keyword">typename</span> Container::const_iterator e ) : |
| <a name="l00995"></a>00995 my_container(const_cast<Container*>(&c)), my_begin(b), my_end(e) { } |
| <a name="l00996"></a>00996 |
| <a name="l00997"></a>00997 flattened2d( <span class="keyword">const</span> Container &c ) : |
| <a name="l00998"></a>00998 my_container(const_cast<Container*>(&c)), my_begin(c.begin()), my_end(c.end()) { } |
| <a name="l00999"></a>00999 |
| <a name="l01000"></a>01000 iterator begin() { <span class="keywordflow">return</span> iterator(*my_container) = my_begin; } |
| <a name="l01001"></a>01001 iterator end() { <span class="keywordflow">return</span> iterator(*my_container) = my_end; } |
| <a name="l01002"></a>01002 const_iterator begin()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(*my_container) = my_begin; } |
| <a name="l01003"></a>01003 const_iterator end()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(*my_container) = my_end; } |
| <a name="l01004"></a>01004 |
| <a name="l01005"></a>01005 size_type size()<span class="keyword"> const </span>{ |
| <a name="l01006"></a>01006 size_type tot_size = 0; |
| <a name="l01007"></a>01007 <span class="keywordflow">for</span>(<span class="keyword">typename</span> Container::const_iterator i = my_begin; i != my_end; ++i) { |
| <a name="l01008"></a>01008 tot_size += i->size(); |
| <a name="l01009"></a>01009 } |
| <a name="l01010"></a>01010 <span class="keywordflow">return</span> tot_size; |
| <a name="l01011"></a>01011 } |
| <a name="l01012"></a>01012 |
| <a name="l01013"></a>01013 <span class="keyword">private</span>: |
| <a name="l01014"></a>01014 |
| <a name="l01015"></a>01015 Container *my_container; |
| <a name="l01016"></a>01016 <span class="keyword">typename</span> Container::const_iterator my_begin; |
| <a name="l01017"></a>01017 <span class="keyword">typename</span> Container::const_iterator my_end; |
| <a name="l01018"></a>01018 |
| <a name="l01019"></a>01019 }; |
| <a name="l01020"></a>01020 |
| <a name="l01021"></a>01021 <span class="keyword">template</span> <<span class="keyword">typename</span> Container> |
| <a name="l01022"></a>01022 flattened2d<Container> flatten2d(<span class="keyword">const</span> Container &c, <span class="keyword">const</span> <span class="keyword">typename</span> Container::const_iterator b, <span class="keyword">const</span> <span class="keyword">typename</span> Container::const_iterator e) { |
| <a name="l01023"></a>01023 <span class="keywordflow">return</span> flattened2d<Container>(c, b, e); |
| <a name="l01024"></a>01024 } |
| <a name="l01025"></a>01025 |
| <a name="l01026"></a>01026 <span class="keyword">template</span> <<span class="keyword">typename</span> Container> |
| <a name="l01027"></a>01027 flattened2d<Container> flatten2d(<span class="keyword">const</span> Container &c) { |
| <a name="l01028"></a>01028 <span class="keywordflow">return</span> flattened2d<Container>(c); |
| <a name="l01029"></a>01029 } |
| <a name="l01030"></a>01030 |
| <a name="l01031"></a>01031 } <span class="comment">// interface5</span> |
| <a name="l01032"></a>01032 |
| <a name="l01033"></a>01033 <span class="keyword">namespace </span>internal { |
| <a name="l01034"></a>01034 <span class="keyword">using</span> interface5::internal::segmented_iterator; |
| <a name="l01035"></a>01035 } |
| <a name="l01036"></a>01036 |
| <a name="l01037"></a>01037 <span class="keyword">using</span> interface5::enumerable_thread_specific; |
| <a name="l01038"></a>01038 <span class="keyword">using</span> interface5::flattened2d; |
| <a name="l01039"></a>01039 <span class="keyword">using</span> interface5::flatten2d; |
| <a name="l01040"></a>01040 |
| <a name="l01041"></a>01041 } <span class="comment">// namespace tbb</span> |
| <a name="l01042"></a>01042 |
| <a name="l01043"></a>01043 <span class="preprocessor">#endif</span> |
| </pre></div><hr> |
| <p></p> |
| Copyright © 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. |
