PageRenderTime 55ms CodeModel.GetById 16ms RepoModel.GetById 1ms app.codeStats 0ms

/doc/html/a00521.html

https://bitbucket.org/mikhailr/intel-tbb-cmake
HTML | 1933 lines | 1932 code | 0 blank | 1 comment | 0 complexity | 0fad2469ecc8cd4cee8a6909368ff3b8 MD5 | raw file
Possible License(s): GPL-2.0 
    

  1. <!DOCTYPE HTML PUBLIC "-//W3C//DTD HTML 4.01 Transitional//EN">
    2. 

  2. <html><head><meta http-equiv="Content-Type" content="text/html;charset=iso-8859-1">
    3. 

  3. <title>flow_graph.h Source File</title>
    4. 

  4. <link href="doxygen.css" rel="stylesheet" type="text/css">
    5. 

  5. <link href="tabs.css" rel="stylesheet" type="text/css">
    6. 

  6. </head><body>
    7. 

  7. <!-- Generated by Doxygen 1.4.7 -->
    8. 

  8. <div class="tabs">
    9. 

  9.   <ul>
    10. 

  10.     <li><a href="index.html"><span>Main&nbsp;Page</span></a></li>
    11. 

  11.     <li><a href="modules.html"><span>Modules</span></a></li>
    12. 

  12.     <li><a href="namespaces.html"><span>Namespaces</span></a></li>
    13. 

  13.     <li><a href="annotated.html"><span>Classes</span></a></li>
    14. 

  14.     <li id="current"><a href="files.html"><span>Files</span></a></li>
    15. 

  15.     <li><a href="pages.html"><span>Related&nbsp;Pages</span></a></li>
    16. 

  16.   </ul></div>
    17. 

  17. <div class="tabs">
    18. 

  18.   <ul>
    19. 

  19.     <li><a href="files.html"><span>File&nbsp;List</span></a></li>
    20. 

  20.     <li><a href="globals.html"><span>File&nbsp;Members</span></a></li>
    21. 

  21.   </ul></div>
    22. 

  22. <h1>flow_graph.h</h1><a href="a00380.html">Go to the documentation of this file.</a><div class="fragment"><pre class="fragment"><a name="l00001"></a>00001 <span class="comment">/*</span>
    23. 

  23. <a name="l00002"></a>00002 <span class="comment">    Copyright 2005-2012 Intel Corporation.  All Rights Reserved.</span>
    24. 

  24. <a name="l00003"></a>00003 <span class="comment"></span>
    25. 

  25. <a name="l00004"></a>00004 <span class="comment">    The source code contained or described herein and all documents related</span>
    26. 

  26. <a name="l00005"></a>00005 <span class="comment">    to the source code ("Material") are owned by Intel Corporation or its</span>
    27. 

  27. <a name="l00006"></a>00006 <span class="comment">    suppliers or licensors.  Title to the Material remains with Intel</span>
    28. 

  28. <a name="l00007"></a>00007 <span class="comment">    Corporation or its suppliers and licensors.  The Material is protected</span>
    29. 

  29. <a name="l00008"></a>00008 <span class="comment">    by worldwide copyright laws and treaty provisions.  No part of the</span>
    30. 

  30. <a name="l00009"></a>00009 <span class="comment">    Material may be used, copied, reproduced, modified, published, uploaded,</span>
    31. 

  31. <a name="l00010"></a>00010 <span class="comment">    posted, transmitted, distributed, or disclosed in any way without</span>
    32. 

  32. <a name="l00011"></a>00011 <span class="comment">    Intel's prior express written permission.</span>
    33. 

  33. <a name="l00012"></a>00012 <span class="comment"></span>
    34. 

  34. <a name="l00013"></a>00013 <span class="comment">    No license under any patent, copyright, trade secret or other</span>
    35. 

  35. <a name="l00014"></a>00014 <span class="comment">    intellectual property right is granted to or conferred upon you by</span>
    36. 

  36. <a name="l00015"></a>00015 <span class="comment">    disclosure or delivery of the Materials, either expressly, by</span>
    37. 

  37. <a name="l00016"></a>00016 <span class="comment">    implication, inducement, estoppel or otherwise.  Any license under such</span>
    38. 

  38. <a name="l00017"></a>00017 <span class="comment">    intellectual property rights must be express and approved by Intel in</span>
    39. 

  39. <a name="l00018"></a>00018 <span class="comment">    writing.</span>
    40. 

  40. <a name="l00019"></a>00019 <span class="comment">*/</span>
    41. 

  41. <a name="l00020"></a>00020 
    42. 

  42. <a name="l00021"></a>00021 <span class="preprocessor">#ifndef __TBB_flow_graph_H</span>
    43. 

  43. <a name="l00022"></a>00022 <span class="preprocessor"></span><span class="preprocessor">#define __TBB_flow_graph_H</span>
    44. 

  44. <a name="l00023"></a>00023 <span class="preprocessor"></span>
    45. 

  45. <a name="l00024"></a>00024 <span class="preprocessor">#include "tbb_stddef.h"</span>
    46. 

  46. <a name="l00025"></a>00025 <span class="preprocessor">#include "atomic.h"</span>
    47. 

  47. <a name="l00026"></a>00026 <span class="preprocessor">#include "spin_mutex.h"</span>
    48. 

  48. <a name="l00027"></a>00027 <span class="preprocessor">#include "null_mutex.h"</span>
    49. 

  49. <a name="l00028"></a>00028 <span class="preprocessor">#include "spin_rw_mutex.h"</span>
    50. 

  50. <a name="l00029"></a>00029 <span class="preprocessor">#include "null_rw_mutex.h"</span>
    51. 

  51. <a name="l00030"></a>00030 <span class="preprocessor">#include "task.h"</span>
    52. 

  52. <a name="l00031"></a>00031 <span class="preprocessor">#include "concurrent_vector.h"</span>
    53. 

  53. <a name="l00032"></a>00032 <span class="preprocessor">#include "internal/_aggregator_impl.h"</span>
    54. 

  54. <a name="l00033"></a>00033 
    55. 

  55. <a name="l00034"></a>00034 <span class="comment">// use the VC10 or gcc version of tuple if it is available.</span>
    56. 

  56. <a name="l00035"></a>00035 <span class="preprocessor">#if __TBB_CPP11_TUPLE_PRESENT</span>
    57. 

  57. <a name="l00036"></a>00036 <span class="preprocessor"></span><span class="preprocessor">    #include &lt;tuple&gt;</span>
    58. 

  58. <a name="l00037"></a>00037 <span class="keyword">namespace </span>tbb {
    59. 

  59. <a name="l00038"></a>00038     <span class="keyword">namespace </span>flow {
    60. 

  60. <a name="l00039"></a>00039         <span class="keyword">using</span> std::tuple;
    61. 

  61. <a name="l00040"></a>00040         <span class="keyword">using</span> std::tuple_size;
    62. 

  62. <a name="l00041"></a>00041         <span class="keyword">using</span> std::tuple_element;
    63. 

  63. <a name="l00042"></a>00042         <span class="keyword">using</span> std::get;
    64. 

  64. <a name="l00043"></a>00043     }
    65. 

  65. <a name="l00044"></a>00044 }
    66. 

  66. <a name="l00045"></a>00045 <span class="preprocessor">#else</span>
    67. 

  67. <a name="l00046"></a>00046 <span class="preprocessor"></span><span class="preprocessor">    #include "compat/tuple"</span>
    68. 

  68. <a name="l00047"></a>00047 <span class="preprocessor">#endif</span>
    69. 

  69. <a name="l00048"></a>00048 <span class="preprocessor"></span>
    70. 

  70. <a name="l00049"></a>00049 <span class="preprocessor">#include&lt;list&gt;</span>
    71. 

  71. <a name="l00050"></a>00050 <span class="preprocessor">#include&lt;queue&gt;</span>
    72. 

  72. <a name="l00051"></a>00051 
    73. 

  73. <a name="l00062"></a>00062 <span class="keyword">namespace </span>tbb {
    74. 

  74. <a name="l00063"></a>00063 <span class="keyword">namespace </span>flow {
    75. 

  75. <a name="l00064"></a>00064 
    76. 

  76. <a name="l00066"></a>00066 <span class="keyword">enum</span> concurrency { unlimited = 0, serial = 1 };
    77. 

  77. <a name="l00067"></a>00067 
    78. 

  78. <a name="l00068"></a>00068 <span class="keyword">namespace </span>interface6 {
    79. 

  79. <a name="l00069"></a>00069 
    80. 

  80. <a name="l00070"></a>00070 <span class="keyword">namespace </span>internal {
    81. 

  81. <a name="l00071"></a>00071     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> M&gt; <span class="keyword">class </span>successor_cache;
    82. 

  82. <a name="l00072"></a>00072     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> M&gt; <span class="keyword">class </span>broadcast_cache;
    83. 

  83. <a name="l00073"></a>00073     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> M&gt; <span class="keyword">class </span>round_robin_cache;
    84. 

  84. <a name="l00074"></a>00074 }
    85. 

  85. <a name="l00075"></a>00075 
    86. 

  86. <a name="l00077"></a><a class="code" href="a00284.html">00077</a> <span class="keyword">class </span><a class="code" href="a00284.html">continue_msg</a> {};
    87. 

  87. <a name="l00078"></a>00078 
    88. 

  88. <a name="l00079"></a>00079 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt; <span class="keyword">class </span><a class="code" href="a00334.html">sender</a>;
    89. 

  89. <a name="l00080"></a>00080 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt; <span class="keyword">class </span><a class="code" href="a00328.html">receiver</a>;
    90. 

  90. <a name="l00081"></a>00081 <span class="keyword">class </span><a class="code" href="a00286.html">continue_receiver</a>;
    91. 

  91. <a name="l00082"></a>00082 
    92. 

  92. <a name="l00084"></a>00084 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    93. 

  93. <a name="l00085"></a><a class="code" href="a00334.html">00085</a> <span class="keyword">class </span><a class="code" href="a00334.html">sender</a> {
    94. 

  94. <a name="l00086"></a>00086 <span class="keyword">public</span>:
    95. 

  95. <a name="l00088"></a><a class="code" href="a00334.html#127af99916cc085cd9dbc09c53299928">00088</a>     <span class="keyword">typedef</span> T <a class="code" href="a00334.html#127af99916cc085cd9dbc09c53299928">output_type</a>;
    96. 

  96. <a name="l00089"></a>00089 
    97. 

  97. <a name="l00091"></a><a class="code" href="a00334.html#d690e8a54e358968f0ee4fdf9ee73068">00091</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt;T&gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    98. 

  98. <a name="l00092"></a>00092 
    99. 

  99. <a name="l00093"></a>00093     <span class="keyword">virtual</span> ~<a class="code" href="a00334.html">sender</a>() {}
    100. 

  100. <a name="l00094"></a>00094 
    101. 

  101. <a name="l00096"></a>00096     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#68b8941ad77b9303cf3bcb8cf1f2d28a">register_successor</a>( <a class="code" href="a00334.html#d690e8a54e358968f0ee4fdf9ee73068">successor_type</a> &amp;r ) = 0;
    102. 

  102. <a name="l00097"></a>00097 
    103. 

  103. <a name="l00099"></a>00099     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#82f363bfb1738bb8789e167590b10ef9">remove_successor</a>( <a class="code" href="a00334.html#d690e8a54e358968f0ee4fdf9ee73068">successor_type</a> &amp;r ) = 0;
    104. 

  104. <a name="l00100"></a>00100 
    105. 

  105. <a name="l00102"></a><a class="code" href="a00334.html#922fb56b0aad090b90a98b7d56b76a59">00102</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#922fb56b0aad090b90a98b7d56b76a59">try_get</a>( T &amp; ) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    106. 

  106. <a name="l00103"></a>00103 
    107. 

  107. <a name="l00105"></a><a class="code" href="a00334.html#02c05b472271db1b68a48ea2618fa72f">00105</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#02c05b472271db1b68a48ea2618fa72f">try_reserve</a>( T &amp; ) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    108. 

  108. <a name="l00106"></a>00106 
    109. 

  109. <a name="l00108"></a><a class="code" href="a00334.html#27036b06d6a91e97007e14f400529199">00108</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#27036b06d6a91e97007e14f400529199">try_release</a>( ) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    110. 

  110. <a name="l00109"></a>00109 
    111. 

  111. <a name="l00111"></a><a class="code" href="a00334.html#7b840f50da117a0d6848707c1857ea2e">00111</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#7b840f50da117a0d6848707c1857ea2e">try_consume</a>( ) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    112. 

  112. <a name="l00112"></a>00112 };
    113. 

  113. <a name="l00113"></a>00113 
    114. 

  114. <a name="l00114"></a>00114 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt; <span class="keyword">class </span><a class="code" href="a00299.html">limiter_node</a>;  <span class="comment">// needed for resetting decrementer</span>
    115. 

  115. <a name="l00115"></a>00115 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">class </span>run_and_put_task;
    116. 

  116. <a name="l00116"></a>00116 
    117. 

  117. <a name="l00117"></a>00117 <span class="keyword">static</span> <a class="code" href="a00344.html">tbb::task</a> * <span class="keyword">const</span> SUCCESSFULLY_ENQUEUED = (<a class="code" href="a00344.html">task</a> *)-1;
    118. 

  118. <a name="l00118"></a>00118 
    119. 

  119. <a name="l00119"></a>00119 <span class="comment">// enqueue left task if necessary.  Returns the non-enqueued task if there is one.</span>
    120. 

  120. <a name="l00120"></a>00120 <span class="keyword">static</span> <span class="keyword">inline</span> <a class="code" href="a00344.html">tbb::task</a> *combine_tasks( <a class="code" href="a00344.html">tbb::task</a> * left, <a class="code" href="a00344.html">tbb::task</a> * right) {
    121. 

  121. <a name="l00121"></a>00121     <span class="comment">// if no RHS task, don't change left.</span>
    122. 

  122. <a name="l00122"></a>00122     <span class="keywordflow">if</span>(right == NULL) <span class="keywordflow">return</span> left;
    123. 

  123. <a name="l00123"></a>00123     <span class="comment">// right != NULL</span>
    124. 

  124. <a name="l00124"></a>00124     <span class="keywordflow">if</span>(left == NULL) <span class="keywordflow">return</span> right;
    125. 

  125. <a name="l00125"></a>00125     <span class="keywordflow">if</span>(left == SUCCESSFULLY_ENQUEUED) <span class="keywordflow">return</span> right;
    126. 

  126. <a name="l00126"></a>00126     <span class="comment">// left contains a task</span>
    127. 

  127. <a name="l00127"></a>00127     <span class="keywordflow">if</span>(right != SUCCESSFULLY_ENQUEUED) {
    128. 

  128. <a name="l00128"></a>00128         <span class="comment">// both are valid tasks</span>
    129. 

  129. <a name="l00129"></a>00129         <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">tbb::task::enqueue</a>(*left);
    130. 

  130. <a name="l00130"></a>00130         <span class="keywordflow">return</span> right;
    131. 

  131. <a name="l00131"></a>00131     }
    132. 

  132. <a name="l00132"></a>00132     <span class="keywordflow">return</span> left;
    133. 

  133. <a name="l00133"></a>00133 }
    134. 

  134. <a name="l00134"></a>00134 
    135. 

  135. <a name="l00136"></a>00136 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    136. 

  136. <a name="l00137"></a><a class="code" href="a00328.html">00137</a> <span class="keyword">class </span><a class="code" href="a00328.html">receiver</a> {
    137. 

  137. <a name="l00138"></a>00138 <span class="keyword">public</span>:
    138. 

  138. <a name="l00140"></a><a class="code" href="a00328.html#0d0524c99313dedea1e04464bbf2f7ef">00140</a>     <span class="keyword">typedef</span> T <a class="code" href="a00284.html">input_type</a>;
    139. 

  139. <a name="l00141"></a>00141 
    140. 

  140. <a name="l00143"></a><a class="code" href="a00328.html#7fa8cff811e7c1589b805a4bb4c7a74f">00143</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt;T&gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    141. 

  141. <a name="l00144"></a>00144 
    142. 

  142. <a name="l00146"></a><a class="code" href="a00328.html#b00699b235435f7b65b663d5063624a1">00146</a>     <span class="keyword">virtual</span> <a class="code" href="a00328.html#b00699b235435f7b65b663d5063624a1">~receiver</a>() {}
    143. 

  143. <a name="l00147"></a>00147 
    144. 

  144. <a name="l00149"></a><a class="code" href="a00328.html#e1adb4060a7cbac837cd24da57c5a846">00149</a>     <span class="keywordtype">bool</span> <a class="code" href="a00328.html#e1adb4060a7cbac837cd24da57c5a846">try_put</a>( <span class="keyword">const</span> T&amp; t ) {
    145. 

  145. <a name="l00150"></a>00150             <a class="code" href="a00344.html">task</a> *res = try_put_task(t);
    146. 

  146. <a name="l00151"></a>00151             <span class="keywordflow">if</span>(!res) <span class="keywordflow">return</span> <span class="keyword">false</span>;
    147. 

  147. <a name="l00152"></a>00152             <span class="keywordflow">if</span> (res != SUCCESSFULLY_ENQUEUED) <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>(*res);
    148. 

  148. <a name="l00153"></a>00153             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    149. 

  149. <a name="l00154"></a>00154         }
    150. 

  150. <a name="l00155"></a>00155 
    151. 

  151. <a name="l00157"></a>00157 <span class="keyword">protected</span>:
    152. 

  152. <a name="l00158"></a><a class="code" href="a00328.html#621bab40a858d214db69ef08d88b67c1">00158</a>     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00328.html#621bab40a858d214db69ef08d88b67c1">run_and_put_task</a>;
    153. 

  153. <a name="l00159"></a>00159     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    154. 

  154. <a name="l00160"></a>00160     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    155. 

  155. <a name="l00161"></a>00161     <span class="keyword">virtual</span> <a class="code" href="a00344.html">task</a> *try_put_task(<span class="keyword">const</span> T&amp; t) = 0;
    156. 

  156. <a name="l00162"></a>00162 <span class="keyword">public</span>:
    157. 

  157. <a name="l00163"></a>00163 
    158. 

  158. <a name="l00165"></a><a class="code" href="a00328.html#30e3316466efe3a713c23062b6e806f3">00165</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00328.html#30e3316466efe3a713c23062b6e806f3">register_predecessor</a>( <a class="code" href="a00334.html">predecessor_type</a> &amp; ) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    159. 

  159. <a name="l00166"></a>00166 
    160. 

  160. <a name="l00168"></a><a class="code" href="a00328.html#3bc76547b51d3c9b633e3987d22dce95">00168</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00328.html#3bc76547b51d3c9b633e3987d22dce95">remove_predecessor</a>( <a class="code" href="a00334.html">predecessor_type</a> &amp; ) { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    161. 

  161. <a name="l00169"></a>00169 
    162. 

  162. <a name="l00170"></a>00170 <span class="keyword">protected</span>:
    163. 

  163. <a name="l00172"></a><a class="code" href="a00328.html#3b6d13039c2a8c1e369e5790895b0088">00172</a>     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> U&gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00299.html">limiter_node</a>;
    164. 

  164. <a name="l00173"></a>00173     <span class="keyword">virtual</span> <span class="keywordtype">void</span> reset_receiver() = 0;
    165. 

  165. <a name="l00174"></a>00174 
    166. 

  166. <a name="l00175"></a>00175     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT, <span class="keyword">typename</span> M&gt;
    167. 

  167. <a name="l00176"></a>00176         <span class="keyword">friend</span> <span class="keyword">class </span>internal::successor_cache;
    168. 

  168. <a name="l00177"></a>00177     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> is_continue_receiver() { <span class="keywordflow">return</span> <span class="keyword">false</span>; }
    169. 

  169. <a name="l00178"></a>00178 };
    170. 

  170. <a name="l00179"></a>00179 
    171. 

  171. <a name="l00181"></a>00181 
    172. 

  172. <a name="l00182"></a><a class="code" href="a00286.html">00182</a> <span class="keyword">class </span><a class="code" href="a00286.html">continue_receiver</a> : <span class="keyword">public</span> <a class="code" href="a00328.html">receiver</a>&lt; continue_msg &gt; {
    173. 

  173. <a name="l00183"></a>00183 <span class="keyword">public</span>:
    174. 

  174. <a name="l00184"></a>00184 
    175. 

  175. <a name="l00186"></a><a class="code" href="a00286.html#3c43c166af832d9187035985841e0a7f">00186</a>     <span class="keyword">typedef</span> <a class="code" href="a00284.html">continue_msg</a> <a class="code" href="a00284.html">input_type</a>;
    176. 

  176. <a name="l00187"></a>00187 
    177. 

  177. <a name="l00189"></a><a class="code" href="a00286.html#f9c58b3e9c46afd2518d0fd8957a5a2f">00189</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; continue_msg &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    178. 

  178. <a name="l00190"></a>00190 
    179. 

  179. <a name="l00192"></a><a class="code" href="a00286.html#177db82d548a1f8471371331890b91a8">00192</a>     <a class="code" href="a00286.html#177db82d548a1f8471371331890b91a8">continue_receiver</a>( <span class="keywordtype">int</span> number_of_predecessors = 0 ) {
    180. 

  180. <a name="l00193"></a>00193         my_predecessor_count = my_initial_predecessor_count = number_of_predecessors;
    181. 

  181. <a name="l00194"></a>00194         my_current_count = 0;
    182. 

  182. <a name="l00195"></a>00195     }
    183. 

  183. <a name="l00196"></a>00196 
    184. 

  184. <a name="l00198"></a><a class="code" href="a00286.html#a0b292ed7fa6556b2a735f6d1e82dc74">00198</a>     <a class="code" href="a00286.html#177db82d548a1f8471371331890b91a8">continue_receiver</a>( <span class="keyword">const</span> <a class="code" href="a00286.html">continue_receiver</a>&amp; src ) : <a class="code" href="a00328.html">receiver</a>&lt;<a class="code" href="a00284.html">continue_msg</a>&gt;() {
    185. 

  185. <a name="l00199"></a>00199         my_predecessor_count = my_initial_predecessor_count = src.<a class="code" href="a00286.html#8a0d4c3084fd13902c2d38f31c1dc232">my_initial_predecessor_count</a>;
    186. 

  186. <a name="l00200"></a>00200         my_current_count = 0;
    187. 

  187. <a name="l00201"></a>00201     }
    188. 

  188. <a name="l00202"></a>00202 
    189. 

  189. <a name="l00204"></a><a class="code" href="a00286.html#1e14828fa079b9835ff7267df5ee45d7">00204</a>     <span class="keyword">virtual</span> <a class="code" href="a00286.html#1e14828fa079b9835ff7267df5ee45d7">~continue_receiver</a>() { }
    190. 

  190. <a name="l00205"></a>00205 
    191. 

  191. <a name="l00207"></a><a class="code" href="a00286.html#2fcfa4990a42417bbeb1f3c8b9ac8a22">00207</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00286.html#2fcfa4990a42417bbeb1f3c8b9ac8a22">register_predecessor</a>( <a class="code" href="a00334.html">predecessor_type</a> &amp; ) {
    192. 

  192. <a name="l00208"></a>00208         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> l(my_mutex);
    193. 

  193. <a name="l00209"></a>00209         ++my_predecessor_count;
    194. 

  194. <a name="l00210"></a>00210         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    195. 

  195. <a name="l00211"></a>00211     }
    196. 

  196. <a name="l00212"></a>00212 
    197. 

  197. <a name="l00214"></a>00214 
    198. 

  198. <a name="l00217"></a><a class="code" href="a00286.html#cb691b18416d4742265aed84d496ebbd">00217</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00286.html#cb691b18416d4742265aed84d496ebbd">remove_predecessor</a>( <a class="code" href="a00334.html">predecessor_type</a> &amp; ) {
    199. 

  199. <a name="l00218"></a>00218         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> l(my_mutex);
    200. 

  200. <a name="l00219"></a>00219         --my_predecessor_count;
    201. 

  201. <a name="l00220"></a>00220         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    202. 

  202. <a name="l00221"></a>00221     }
    203. 

  203. <a name="l00222"></a>00222 
    204. 

  204. <a name="l00223"></a>00223 <span class="keyword">protected</span>:
    205. 

  205. <a name="l00224"></a><a class="code" href="a00286.html#621bab40a858d214db69ef08d88b67c1">00224</a>     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00286.html#621bab40a858d214db69ef08d88b67c1">run_and_put_task</a>;
    206. 

  206. <a name="l00225"></a>00225     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    207. 

  207. <a name="l00226"></a>00226     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    208. 

  208. <a name="l00227"></a>00227     <span class="comment">// execute body is supposed to be too small to create a task for.</span>
    209. 

  209. <a name="l00228"></a>00228     <span class="comment">/* override */</span> <a class="code" href="a00344.html">task</a> *try_put_task( <span class="keyword">const</span> <a class="code" href="a00284.html">input_type</a> &amp; ) {
    210. 

  210. <a name="l00229"></a>00229         {
    211. 

  211. <a name="l00230"></a>00230             <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> l(my_mutex);
    212. 

  212. <a name="l00231"></a>00231             <span class="keywordflow">if</span> ( ++my_current_count &lt; my_predecessor_count )
    213. 

  213. <a name="l00232"></a>00232                 <span class="keywordflow">return</span> SUCCESSFULLY_ENQUEUED;
    214. 

  214. <a name="l00233"></a>00233             <span class="keywordflow">else</span>
    215. 

  215. <a name="l00234"></a>00234                 my_current_count = 0;
    216. 

  216. <a name="l00235"></a>00235         }
    217. 

  217. <a name="l00236"></a>00236         <a class="code" href="a00344.html">task</a> * res = <a class="code" href="a00286.html#2165b726212975be532cff7b2f001834">execute</a>();
    218. 

  218. <a name="l00237"></a>00237         <span class="keywordflow">return</span> res;
    219. 

  219. <a name="l00238"></a>00238     }
    220. 

  220. <a name="l00239"></a>00239 
    221. 

  221. <a name="l00240"></a>00240     <a class="code" href="a00338.html">spin_mutex</a> my_mutex;
    222. 

  222. <a name="l00241"></a>00241     <span class="keywordtype">int</span> my_predecessor_count;
    223. 

  223. <a name="l00242"></a>00242     <span class="keywordtype">int</span> my_current_count;
    224. 

  224. <a name="l00243"></a>00243     <span class="keywordtype">int</span> my_initial_predecessor_count;
    225. 

  225. <a name="l00244"></a>00244     <span class="comment">// the friend declaration in the base class did not eliminate the "protected class"</span>
    226. 

  226. <a name="l00245"></a>00245     <span class="comment">// error in gcc 4.1.2</span>
    227. 

  227. <a name="l00246"></a><a class="code" href="a00286.html#3b6d13039c2a8c1e369e5790895b0088">00246</a>     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> U&gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00299.html">limiter_node</a>;
    228. 

  228. <a name="l00247"></a>00247     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset_receiver() {
    229. 

  229. <a name="l00248"></a>00248         my_current_count = 0;
    230. 

  230. <a name="l00249"></a>00249     }
    231. 

  231. <a name="l00250"></a>00250 
    232. 

  232. <a name="l00252"></a>00252 
    233. 

  233. <a name="l00254"></a>00254     <span class="keyword">virtual</span> <a class="code" href="a00344.html">task</a> * <a class="code" href="a00286.html#2165b726212975be532cff7b2f001834">execute</a>() = 0;
    234. 

  234. <a name="l00255"></a>00255     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> TT, <span class="keyword">typename</span> M&gt;
    235. 

  235. <a name="l00256"></a>00256         <span class="keyword">friend</span> <span class="keyword">class </span>internal::successor_cache;
    236. 

  236. <a name="l00257"></a>00257     <span class="comment">/*override*/</span> <span class="keywordtype">bool</span> is_continue_receiver() { <span class="keywordflow">return</span> <span class="keyword">true</span>; }
    237. 

  237. <a name="l00258"></a>00258 };
    238. 

  238. <a name="l00259"></a>00259 
    239. 

  239. <a name="l00260"></a>00260 <span class="preprocessor">#include "internal/_flow_graph_impl.h"</span>
    240. 

  240. <a name="l00261"></a>00261 <span class="keyword">using namespace </span>internal::graph_policy_namespace;
    241. 

  241. <a name="l00262"></a>00262 
    242. 

  242. <a name="l00263"></a>00263 <span class="keyword">class </span>graph;
    243. 

  243. <a name="l00264"></a>00264 <span class="keyword">class </span>graph_node;
    244. 

  244. <a name="l00265"></a>00265 
    245. 

  245. <a name="l00266"></a>00266 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> GraphContainerType, <span class="keyword">typename</span> GraphNodeType&gt;
    246. 

  246. <a name="l00267"></a>00267 <span class="keyword">class </span>graph_iterator {
    247. 

  247. <a name="l00268"></a>00268     <span class="keyword">friend</span> <span class="keyword">class </span>graph;
    248. 

  248. <a name="l00269"></a>00269     <span class="keyword">friend</span> <span class="keyword">class </span>graph_node;
    249. 

  249. <a name="l00270"></a>00270 <span class="keyword">public</span>:
    250. 

  250. <a name="l00271"></a>00271     <span class="keyword">typedef</span> size_t size_type;
    251. 

  251. <a name="l00272"></a>00272     <span class="keyword">typedef</span> GraphNodeType value_type;
    252. 

  252. <a name="l00273"></a>00273     <span class="keyword">typedef</span> GraphNodeType* pointer;
    253. 

  253. <a name="l00274"></a>00274     <span class="keyword">typedef</span> GraphNodeType&amp; reference;
    254. 

  254. <a name="l00275"></a>00275     <span class="keyword">typedef</span> <span class="keyword">const</span> GraphNodeType&amp; const_reference;
    255. 

  255. <a name="l00276"></a>00276     <span class="keyword">typedef</span> std::forward_iterator_tag iterator_category;
    256. 

  256. <a name="l00277"></a>00277 
    257. 

  257. <a name="l00279"></a>00279     graph_iterator() : my_graph(NULL), current_node(NULL) {}
    258. 

  258. <a name="l00280"></a>00280 
    259. 

  259. <a name="l00282"></a>00282     graph_iterator(<span class="keyword">const</span> graph_iterator&amp; other) :
    260. 

  260. <a name="l00283"></a>00283         my_graph(other.my_graph), current_node(other.current_node)
    261. 

  261. <a name="l00284"></a>00284     {}
    262. 

  262. <a name="l00285"></a>00285 
    263. 

  263. <a name="l00287"></a>00287     graph_iterator&amp; operator=(<span class="keyword">const</span> graph_iterator&amp; other) {
    264. 

  264. <a name="l00288"></a>00288         <span class="keywordflow">if</span> (<span class="keyword">this</span> != &amp;other) {
    265. 

  265. <a name="l00289"></a>00289             my_graph = other.my_graph;
    266. 

  266. <a name="l00290"></a>00290             current_node = other.current_node;
    267. 

  267. <a name="l00291"></a>00291         }
    268. 

  268. <a name="l00292"></a>00292         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
    269. 

  269. <a name="l00293"></a>00293     }
    270. 

  270. <a name="l00294"></a>00294 
    271. 

  271. <a name="l00296"></a>00296     reference operator*() <span class="keyword">const</span>;
    272. 

  272. <a name="l00297"></a>00297 
    273. 

  273. <a name="l00299"></a>00299     pointer operator-&gt;() <span class="keyword">const</span>;
    274. 

  274. <a name="l00300"></a>00300 
    275. 

  275. <a name="l00302"></a>00302     <span class="keywordtype">bool</span> operator==(<span class="keyword">const</span> graph_iterator&amp; other)<span class="keyword"> const </span>{
    276. 

  276. <a name="l00303"></a>00303         <span class="keywordflow">return</span> ((my_graph == other.my_graph) &amp;&amp; (current_node == other.current_node));
    277. 

  277. <a name="l00304"></a>00304     }
    278. 

  278. <a name="l00305"></a>00305 
    279. 

  279. <a name="l00307"></a>00307     <span class="keywordtype">bool</span> operator!=(<span class="keyword">const</span> graph_iterator&amp; other)<span class="keyword"> const </span>{ <span class="keywordflow">return</span> !(operator==(other)); }
    280. 

  280. <a name="l00308"></a>00308 
    281. 

  281. <a name="l00310"></a>00310     graph_iterator&amp; operator++() {
    282. 

  282. <a name="l00311"></a>00311         internal_forward();
    283. 

  283. <a name="l00312"></a>00312         <span class="keywordflow">return</span> *<span class="keyword">this</span>;
    284. 

  284. <a name="l00313"></a>00313     }
    285. 

  285. <a name="l00314"></a>00314 
    286. 

  286. <a name="l00316"></a>00316     graph_iterator operator++(<span class="keywordtype">int</span>) {
    287. 

  287. <a name="l00317"></a>00317         graph_iterator result = *<span class="keyword">this</span>;
    288. 

  288. <a name="l00318"></a>00318         operator++();
    289. 

  289. <a name="l00319"></a>00319         <span class="keywordflow">return</span> result;
    290. 

  290. <a name="l00320"></a>00320     }
    291. 

  291. <a name="l00321"></a>00321 
    292. 

  292. <a name="l00322"></a>00322 <span class="keyword">private</span>:
    293. 

  293. <a name="l00323"></a>00323     <span class="comment">// the graph over which we are iterating</span>
    294. 

  294. <a name="l00324"></a>00324     GraphContainerType *my_graph;
    295. 

  295. <a name="l00325"></a>00325     <span class="comment">// pointer into my_graph's my_nodes list</span>
    296. 

  296. <a name="l00326"></a>00326     pointer current_node;
    297. 

  297. <a name="l00327"></a>00327 
    298. 

  298. <a name="l00329"></a>00329     graph_iterator(GraphContainerType *g, <span class="keywordtype">bool</span> begin);
    299. 

  299. <a name="l00330"></a>00330     <span class="keywordtype">void</span> internal_forward();
    300. 

  300. <a name="l00331"></a>00331 };
    301. 

  301. <a name="l00332"></a>00332 
    302. 

  302. <a name="l00334"></a>00334 
    303. 

  303. <a name="l00335"></a><a class="code" href="a00295.html">00335</a> <span class="keyword">class </span><a class="code" href="a00295.html">graph</a> : tbb::internal::no_copy {
    304. 

  304. <a name="l00336"></a>00336     <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00296.html">graph_node</a>;
    305. 

  305. <a name="l00337"></a>00337 
    306. 

  306. <a name="l00338"></a>00338     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Body &gt;
    307. 

  307. <a name="l00339"></a>00339     <span class="keyword">class </span>run_task : <span class="keyword">public</span> <a class="code" href="a00344.html">task</a> {
    308. 

  308. <a name="l00340"></a>00340     <span class="keyword">public</span>:
    309. 

  309. <a name="l00341"></a>00341         run_task( Body&amp; body ) : my_body(body) {}
    310. 

  310. <a name="l00342"></a>00342         <a class="code" href="a00344.html">task</a> *execute() {
    311. 

  311. <a name="l00343"></a>00343             my_body();
    312. 

  312. <a name="l00344"></a>00344             <span class="keywordflow">return</span> NULL;
    313. 

  313. <a name="l00345"></a>00345         }
    314. 

  314. <a name="l00346"></a>00346     <span class="keyword">private</span>:
    315. 

  315. <a name="l00347"></a>00347         Body my_body;
    316. 

  316. <a name="l00348"></a>00348     };
    317. 

  317. <a name="l00349"></a>00349 
    318. 

  318. <a name="l00350"></a>00350     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Receiver, <span class="keyword">typename</span> Body &gt;
    319. 

  319. <a name="l00351"></a>00351     <span class="keyword">class </span>run_and_put_task : <span class="keyword">public</span> <a class="code" href="a00344.html">task</a> {
    320. 

  320. <a name="l00352"></a>00352     <span class="keyword">public</span>:
    321. 

  321. <a name="l00353"></a>00353         run_and_put_task( Receiver &amp;r, Body&amp; body ) : my_receiver(r), my_body(body) {}
    322. 

  322. <a name="l00354"></a>00354         <a class="code" href="a00344.html">task</a> *execute() {
    323. 

  323. <a name="l00355"></a>00355             <a class="code" href="a00344.html">task</a> *res = my_receiver.try_put_task( my_body() );
    324. 

  324. <a name="l00356"></a>00356             <span class="keywordflow">if</span>(res == SUCCESSFULLY_ENQUEUED) res = NULL;
    325. 

  325. <a name="l00357"></a>00357             <span class="keywordflow">return</span> res;
    326. 

  326. <a name="l00358"></a>00358         }
    327. 

  327. <a name="l00359"></a>00359     <span class="keyword">private</span>:
    328. 

  328. <a name="l00360"></a>00360         Receiver &amp;my_receiver;
    329. 

  329. <a name="l00361"></a>00361         Body my_body;
    330. 

  330. <a name="l00362"></a>00362     };
    331. 

  331. <a name="l00363"></a>00363 
    332. 

  332. <a name="l00364"></a>00364 <span class="keyword">public</span>:
    333. 

  333. <a name="l00366"></a><a class="code" href="a00295.html#4ab3d4b5208ece28c4c3ced647e26e12">00366</a>     <span class="keyword">explicit</span> <a class="code" href="a00295.html#4ab3d4b5208ece28c4c3ced647e26e12">graph</a>() : my_nodes(NULL), my_nodes_last(NULL)
    334. 

  334. <a name="l00367"></a>00367     {
    335. 

  335. <a name="l00368"></a>00368         own_context = <span class="keyword">true</span>;
    336. 

  336. <a name="l00369"></a>00369         cancelled = <span class="keyword">false</span>;
    337. 

  337. <a name="l00370"></a>00370         caught_exception = <span class="keyword">false</span>;
    338. 

  338. <a name="l00371"></a>00371         my_context = <span class="keyword">new</span> <a class="code" href="a00347.html">task_group_context</a>();
    339. 

  339. <a name="l00372"></a>00372         my_root_task = ( <span class="keyword">new</span> ( <a class="code" href="a00344.html#23acb0da0afd690da797f9f882027d34">task::allocate_root</a>(*my_context) ) <a class="code" href="a00287.html">empty_task</a> );
    340. 

  340. <a name="l00373"></a>00373         my_root_task-&gt;<a class="code" href="a00344.html#06a4206a57e8e12a439b14d6d41cfd92">set_ref_count</a>(1);
    341. 

  341. <a name="l00374"></a>00374     }
    342. 

  342. <a name="l00375"></a>00375 
    343. 

  343. <a name="l00377"></a><a class="code" href="a00295.html#104d4f3775f596b43177c29e6b7b7656">00377</a>     <span class="keyword">explicit</span> <a class="code" href="a00295.html#4ab3d4b5208ece28c4c3ced647e26e12">graph</a>(<a class="code" href="a00347.html">task_group_context</a>&amp; use_this_context) :
    344. 

  344. <a name="l00378"></a>00378     my_context(&amp;use_this_context), my_nodes(NULL), my_nodes_last(NULL)
    345. 

  345. <a name="l00379"></a>00379     {
    346. 

  346. <a name="l00380"></a>00380         own_context = <span class="keyword">false</span>;
    347. 

  347. <a name="l00381"></a>00381         my_root_task = ( <span class="keyword">new</span> ( <a class="code" href="a00344.html#23acb0da0afd690da797f9f882027d34">task::allocate_root</a>(*my_context) ) <a class="code" href="a00287.html">empty_task</a> );
    348. 

  348. <a name="l00382"></a>00382         my_root_task-&gt;<a class="code" href="a00344.html#06a4206a57e8e12a439b14d6d41cfd92">set_ref_count</a>(1);
    349. 

  349. <a name="l00383"></a>00383     }
    350. 

  350. <a name="l00384"></a>00384 
    351. 

  351. <a name="l00386"></a>00386 
    352. 

  352. <a name="l00387"></a><a class="code" href="a00295.html#8a7d424c0616a1c37a908ead182e2fe5">00387</a>     <a class="code" href="a00295.html#8a7d424c0616a1c37a908ead182e2fe5">~graph</a>() {
    353. 

  353. <a name="l00388"></a>00388         <a class="code" href="a00295.html#a66b0020f7514b86d030fa8aea073d37">wait_for_all</a>();
    354. 

  354. <a name="l00389"></a>00389         my_root_task-&gt;<a class="code" href="a00344.html#06a4206a57e8e12a439b14d6d41cfd92">set_ref_count</a>(0);
    355. 

  355. <a name="l00390"></a>00390         <a class="code" href="a00344.html#dfaacf92685e5f86393bf657b2853bf8">task::destroy</a>( *my_root_task );
    356. 

  356. <a name="l00391"></a>00391         <span class="keywordflow">if</span> (own_context) <span class="keyword">delete</span> my_context;
    357. 

  357. <a name="l00392"></a>00392     }
    358. 

  358. <a name="l00393"></a>00393 
    359. 

  359. <a name="l00395"></a>00395 
    360. 

  360. <a name="l00397"></a><a class="code" href="a00295.html#a993b789d1e488e0c3929135beae560e">00397</a>     <span class="keywordtype">void</span> <a class="code" href="a00295.html#a993b789d1e488e0c3929135beae560e">increment_wait_count</a>() {
    361. 

  361. <a name="l00398"></a>00398         <span class="keywordflow">if</span> (my_root_task)
    362. 

  362. <a name="l00399"></a>00399             my_root_task-&gt;<a class="code" href="a00344.html#f5fb43c7ad0de5a4b95703cebc39e345">increment_ref_count</a>();
    363. 

  363. <a name="l00400"></a>00400     }
    364. 

  364. <a name="l00401"></a>00401 
    365. 

  365. <a name="l00403"></a>00403 
    366. 

  366. <a name="l00405"></a><a class="code" href="a00295.html#29b85506870f13a884a21655aec2a65d">00405</a>     <span class="keywordtype">void</span> <a class="code" href="a00295.html#29b85506870f13a884a21655aec2a65d">decrement_wait_count</a>() {
    367. 

  367. <a name="l00406"></a>00406         <span class="keywordflow">if</span> (my_root_task)
    368. 

  368. <a name="l00407"></a>00407             my_root_task-&gt;<a class="code" href="a00344.html#ef4680f5c148020c5e7e43ddef44cd5d">decrement_ref_count</a>();
    369. 

  369. <a name="l00408"></a>00408     }
    370. 

  370. <a name="l00409"></a>00409 
    371. 

  371. <a name="l00411"></a>00411 
    372. 

  372. <a name="l00413"></a>00413     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Receiver, <span class="keyword">typename</span> Body &gt;
    373. 

  373. <a name="l00414"></a><a class="code" href="a00295.html#50a7938df01b6148ab2c0696835f002e">00414</a>         <span class="keywordtype">void</span> <a class="code" href="a00295.html#50a7938df01b6148ab2c0696835f002e">run</a>( Receiver &amp;r, Body body ) {
    374. 

  374. <a name="l00415"></a>00415        <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>( * <span class="keyword">new</span> ( task::allocate_additional_child_of( *my_root_task ) )
    375. 

  375. <a name="l00416"></a>00416            run_and_put_task&lt; Receiver, Body &gt;( r, body ) );
    376. 

  376. <a name="l00417"></a>00417     }
    377. 

  377. <a name="l00418"></a>00418 
    378. 

  378. <a name="l00420"></a>00420 
    379. 

  379. <a name="l00422"></a>00422     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Body &gt;
    380. 

  380. <a name="l00423"></a><a class="code" href="a00295.html#c1145b00e063793a7e7bf994d202c7a0">00423</a>     <span class="keywordtype">void</span> <a class="code" href="a00295.html#50a7938df01b6148ab2c0696835f002e">run</a>( Body body ) {
    381. 

  381. <a name="l00424"></a>00424        <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>( * <span class="keyword">new</span> ( task::allocate_additional_child_of( *my_root_task ) )
    382. 

  382. <a name="l00425"></a>00425            run_task&lt; Body &gt;( body ) );
    383. 

  383. <a name="l00426"></a>00426     }
    384. 

  384. <a name="l00427"></a>00427 
    385. 

  385. <a name="l00429"></a>00429 
    386. 

  386. <a name="l00430"></a><a class="code" href="a00295.html#a66b0020f7514b86d030fa8aea073d37">00430</a>     <span class="keywordtype">void</span> <a class="code" href="a00295.html#a66b0020f7514b86d030fa8aea073d37">wait_for_all</a>() {
    387. 

  387. <a name="l00431"></a>00431         cancelled = <span class="keyword">false</span>;
    388. 

  388. <a name="l00432"></a>00432         caught_exception = <span class="keyword">false</span>;
    389. 

  389. <a name="l00433"></a>00433         <span class="keywordflow">if</span> (my_root_task) {
    390. 

  390. <a name="l00434"></a>00434 <span class="preprocessor">#if TBB_USE_EXCEPTIONS</span>
    391. 

  391. <a name="l00435"></a>00435 <span class="preprocessor"></span>            <span class="keywordflow">try</span> {
    392. 

  392. <a name="l00436"></a>00436 <span class="preprocessor">#endif</span>
    393. 

  393. <a name="l00437"></a>00437 <span class="preprocessor"></span>                my_root_task-&gt;<a class="code" href="a00344.html#53d2615ad9c38859b4c8080936600283">wait_for_all</a>();
    394. 

  394. <a name="l00438"></a>00438                 cancelled = my_context-&gt;is_group_execution_cancelled();
    395. 

  395. <a name="l00439"></a>00439 <span class="preprocessor">#if TBB_USE_EXCEPTIONS</span>
    396. 

  396. <a name="l00440"></a>00440 <span class="preprocessor"></span>            }
    397. 

  397. <a name="l00441"></a>00441             <span class="keywordflow">catch</span>(...) {
    398. 

  398. <a name="l00442"></a>00442                 my_root_task-&gt;<a class="code" href="a00344.html#06a4206a57e8e12a439b14d6d41cfd92">set_ref_count</a>(1);
    399. 

  399. <a name="l00443"></a>00443                 my_context-&gt;reset();
    400. 

  400. <a name="l00444"></a>00444                 caught_exception = <span class="keyword">true</span>;
    401. 

  401. <a name="l00445"></a>00445                 cancelled = <span class="keyword">true</span>;
    402. 

  402. <a name="l00446"></a>00446                 <span class="keywordflow">throw</span>;
    403. 

  403. <a name="l00447"></a>00447             }
    404. 

  404. <a name="l00448"></a>00448 <span class="preprocessor">#endif</span>
    405. 

  405. <a name="l00449"></a>00449 <span class="preprocessor"></span>            my_context-&gt;reset();  <span class="comment">// consistent with behavior in catch()</span>
    406. 

  406. <a name="l00450"></a>00450             my_root_task-&gt;<a class="code" href="a00344.html#06a4206a57e8e12a439b14d6d41cfd92">set_ref_count</a>(1);
    407. 

  407. <a name="l00451"></a>00451         }
    408. 

  408. <a name="l00452"></a>00452     }
    409. 

  409. <a name="l00453"></a>00453 
    410. 

  410. <a name="l00455"></a><a class="code" href="a00295.html#7f4e3ae90811a5d8b597146b5b586d10">00455</a>     <a class="code" href="a00344.html">task</a> * <a class="code" href="a00295.html#7f4e3ae90811a5d8b597146b5b586d10">root_task</a>() {
    411. 

  411. <a name="l00456"></a>00456         <span class="keywordflow">return</span> my_root_task;
    412. 

  412. <a name="l00457"></a>00457     }
    413. 

  413. <a name="l00458"></a>00458 
    414. 

  414. <a name="l00459"></a>00459     <span class="comment">// ITERATORS</span>
    415. 

  415. <a name="l00460"></a>00460     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> N&gt;
    416. 

  416. <a name="l00461"></a>00461     <span class="keyword">friend</span> <span class="keyword">class </span>graph_iterator;
    417. 

  417. <a name="l00462"></a>00462 
    418. 

  418. <a name="l00463"></a>00463     <span class="comment">// Graph iterator typedefs</span>
    419. 

  419. <a name="l00464"></a>00464     <span class="keyword">typedef</span> graph_iterator&lt;graph,graph_node&gt; iterator;
    420. 

  420. <a name="l00465"></a>00465     <span class="keyword">typedef</span> graph_iterator&lt;const graph,const graph_node&gt; const_iterator;
    421. 

  421. <a name="l00466"></a>00466 
    422. 

  422. <a name="l00467"></a>00467     <span class="comment">// Graph iterator constructors</span>
    423. 

  423. <a name="l00469"></a><a class="code" href="a00295.html#b028cb585ec21e5de523d0075d0fa880">00469</a> <span class="comment"></span>    iterator <a class="code" href="a00295.html#b028cb585ec21e5de523d0075d0fa880">begin</a>() { <span class="keywordflow">return</span> iterator(<span class="keyword">this</span>, <span class="keyword">true</span>); }
    424. 

  424. <a name="l00471"></a><a class="code" href="a00295.html#a167c62511ddacaa152daa64ab2d6aac">00471</a>     iterator <a class="code" href="a00295.html#a167c62511ddacaa152daa64ab2d6aac">end</a>() { <span class="keywordflow">return</span> iterator(<span class="keyword">this</span>, <span class="keyword">false</span>); }
    425. 

  425. <a name="l00473"></a><a class="code" href="a00295.html#f63c3b7d03098b57fc16b71c57b303e5">00473</a>     const_iterator <a class="code" href="a00295.html#b028cb585ec21e5de523d0075d0fa880">begin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(<span class="keyword">this</span>, <span class="keyword">true</span>); }
    426. 

  426. <a name="l00475"></a><a class="code" href="a00295.html#907bd06606818c36f52420fe8d469d35">00475</a>     const_iterator <a class="code" href="a00295.html#a167c62511ddacaa152daa64ab2d6aac">end</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(<span class="keyword">this</span>, <span class="keyword">false</span>); }
    427. 

  427. <a name="l00477"></a><a class="code" href="a00295.html#e183dfc3f89dc8f57c06ba165fb89f66">00477</a>     const_iterator <a class="code" href="a00295.html#e183dfc3f89dc8f57c06ba165fb89f66">cbegin</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(<span class="keyword">this</span>, <span class="keyword">true</span>); }
    428. 

  428. <a name="l00479"></a><a class="code" href="a00295.html#4866156e6a31d0399b61c6eb82ee81fd">00479</a>     const_iterator <a class="code" href="a00295.html#4866156e6a31d0399b61c6eb82ee81fd">cend</a>()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> const_iterator(<span class="keyword">this</span>, <span class="keyword">false</span>); }
    429. 

  429. <a name="l00480"></a>00480 
    430. 

  430. <a name="l00482"></a><a class="code" href="a00295.html#227ea140dc2c68f79a4e5a34a8367b58">00482</a>     <span class="keywordtype">bool</span> <a class="code" href="a00295.html#227ea140dc2c68f79a4e5a34a8367b58">is_cancelled</a>() { <span class="keywordflow">return</span> cancelled; }
    431. 

  431. <a name="l00483"></a>00483     <span class="keywordtype">bool</span> exception_thrown() { <span class="keywordflow">return</span> caught_exception; }
    432. 

  432. <a name="l00484"></a>00484 
    433. 

  433. <a name="l00485"></a>00485     <span class="comment">// un-thread-safe state reset.</span>
    434. 

  434. <a name="l00486"></a>00486     <span class="keywordtype">void</span> reset();
    435. 

  435. <a name="l00487"></a>00487 
    436. 

  436. <a name="l00488"></a>00488 <span class="keyword">private</span>:
    437. 

  437. <a name="l00489"></a>00489     <a class="code" href="a00344.html">task</a> *my_root_task;
    438. 

  438. <a name="l00490"></a>00490     <a class="code" href="a00347.html">task_group_context</a> *my_context;
    439. 

  439. <a name="l00491"></a>00491     <span class="keywordtype">bool</span> own_context;
    440. 

  440. <a name="l00492"></a>00492     <span class="keywordtype">bool</span> cancelled;
    441. 

  441. <a name="l00493"></a>00493     <span class="keywordtype">bool</span> caught_exception;
    442. 

  442. <a name="l00494"></a>00494 
    443. 

  443. <a name="l00495"></a>00495     <a class="code" href="a00296.html">graph_node</a> *my_nodes, *my_nodes_last;
    444. 

  444. <a name="l00496"></a>00496 
    445. 

  445. <a name="l00497"></a>00497     <a class="code" href="a00338.html">spin_mutex</a> nodelist_mutex;
    446. 

  446. <a name="l00498"></a>00498     <span class="keywordtype">void</span> register_node(<a class="code" href="a00296.html">graph_node</a> *n); 
    447. 

  447. <a name="l00499"></a>00499     <span class="keywordtype">void</span> remove_node(<a class="code" href="a00296.html">graph_node</a> *n);
    448. 

  448. <a name="l00500"></a>00500 
    449. 

  449. <a name="l00501"></a>00501 };
    450. 

  450. <a name="l00502"></a>00502 
    451. 

  451. <a name="l00503"></a>00503 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> N&gt;
    452. 

  452. <a name="l00504"></a>00504 graph_iterator&lt;C,N&gt;::graph_iterator(C *g, <span class="keywordtype">bool</span> begin) : my_graph(g), current_node(NULL)
    453. 

  453. <a name="l00505"></a>00505 {
    454. 

  454. <a name="l00506"></a>00506     <span class="keywordflow">if</span> (begin) current_node = my_graph-&gt;my_nodes;
    455. 

  455. <a name="l00507"></a>00507     <span class="comment">//else it is an end iterator by default</span>
    456. 

  456. <a name="l00508"></a>00508 }
    457. 

  457. <a name="l00509"></a>00509 
    458. 

  458. <a name="l00510"></a>00510 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> N&gt;
    459. 

  459. <a name="l00511"></a>00511 <span class="keyword">typename</span> graph_iterator&lt;C,N&gt;::reference graph_iterator&lt;C,N&gt;::operator*()<span class="keyword"> const </span>{
    460. 

  460. <a name="l00512"></a>00512     __TBB_ASSERT(current_node, <span class="stringliteral">"graph_iterator at end"</span>);
    461. 

  461. <a name="l00513"></a>00513     <span class="keywordflow">return</span> *operator-&gt;();
    462. 

  462. <a name="l00514"></a>00514 }
    463. 

  463. <a name="l00515"></a>00515 
    464. 

  464. <a name="l00516"></a>00516 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> N&gt;
    465. 

  465. <a name="l00517"></a>00517 <span class="keyword">typename</span> graph_iterator&lt;C,N&gt;::pointer graph_iterator&lt;C,N&gt;::operator-&gt;()<span class="keyword"> const </span>{ 
    466. 

  466. <a name="l00518"></a>00518     <span class="keywordflow">return</span> current_node;
    467. 

  467. <a name="l00519"></a>00519 }
    468. 

  468. <a name="l00520"></a>00520 
    469. 

  469. <a name="l00521"></a>00521 
    470. 

  470. <a name="l00522"></a>00522 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> N&gt;
    471. 

  471. <a name="l00523"></a>00523 <span class="keywordtype">void</span> graph_iterator&lt;C,N&gt;::internal_forward() {
    472. 

  472. <a name="l00524"></a>00524     <span class="keywordflow">if</span> (current_node) current_node = current_node-&gt;next;
    473. 

  473. <a name="l00525"></a>00525 }
    474. 

  474. <a name="l00526"></a>00526 
    475. 

  475. <a name="l00528"></a><a class="code" href="a00296.html">00528</a> <span class="keyword">class </span><a class="code" href="a00296.html">graph_node</a> : tbb::internal::no_assign {
    476. 

  476. <a name="l00529"></a>00529     <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00295.html">graph</a>;
    477. 

  477. <a name="l00530"></a>00530     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> C, <span class="keyword">typename</span> N&gt;
    478. 

  478. <a name="l00531"></a>00531     <span class="keyword">friend</span> <span class="keyword">class </span>graph_iterator;
    479. 

  479. <a name="l00532"></a>00532 <span class="keyword">protected</span>:
    480. 

  480. <a name="l00533"></a>00533     <a class="code" href="a00295.html">graph</a>&amp; my_graph;
    481. 

  481. <a name="l00534"></a>00534     <a class="code" href="a00296.html">graph_node</a> *next, *prev;
    482. 

  482. <a name="l00535"></a>00535 <span class="keyword">public</span>:
    483. 

  483. <a name="l00536"></a>00536     <a class="code" href="a00296.html">graph_node</a>(<a class="code" href="a00295.html">graph</a>&amp; g) : my_graph(g) {
    484. 

  484. <a name="l00537"></a>00537         my_graph.<a class="code" href="a00295.html#0eca5c8a44b050262cbab2f985d8ac94">register_node</a>(<span class="keyword">this</span>);
    485. 

  485. <a name="l00538"></a>00538     }
    486. 

  486. <a name="l00539"></a>00539     <span class="keyword">virtual</span> ~<a class="code" href="a00296.html">graph_node</a>() {
    487. 

  487. <a name="l00540"></a>00540         my_graph.<a class="code" href="a00295.html#143cf6eb0c555eb100ed8cbad198a207">remove_node</a>(<span class="keyword">this</span>);
    488. 

  488. <a name="l00541"></a>00541     }
    489. 

  489. <a name="l00542"></a>00542 
    490. 

  490. <a name="l00543"></a>00543 <span class="keyword">protected</span>:
    491. 

  491. <a name="l00544"></a>00544     <span class="keyword">virtual</span> <span class="keywordtype">void</span> reset() = 0;
    492. 

  492. <a name="l00545"></a>00545 };
    493. 

  493. <a name="l00546"></a>00546 
    494. 

  494. <a name="l00547"></a>00547 <span class="keyword">inline</span> <span class="keywordtype">void</span> graph::register_node(<a class="code" href="a00296.html">graph_node</a> *n) {
    495. 

  495. <a name="l00548"></a>00548     n-&gt;<a class="code" href="a00296.html#d1ce68896f6d366dcc3fad19f6fd55d1">next</a> = NULL;
    496. 

  496. <a name="l00549"></a>00549     {
    497. 

  497. <a name="l00550"></a>00550         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(nodelist_mutex);
    498. 

  498. <a name="l00551"></a>00551         n-&gt;<a class="code" href="a00296.html#28049e438b241b0d6051767bbeacc0b9">prev</a> = my_nodes_last;
    499. 

  499. <a name="l00552"></a>00552         <span class="keywordflow">if</span> (my_nodes_last) my_nodes_last-&gt;<a class="code" href="a00296.html#d1ce68896f6d366dcc3fad19f6fd55d1">next</a> = n;
    500. 

  500. <a name="l00553"></a>00553         my_nodes_last = n;
    501. 

  501. <a name="l00554"></a>00554         <span class="keywordflow">if</span> (!my_nodes) my_nodes = n;
    502. 

  502. <a name="l00555"></a>00555     }
    503. 

  503. <a name="l00556"></a>00556 }
    504. 

  504. <a name="l00557"></a>00557 
    505. 

  505. <a name="l00558"></a>00558 <span class="keyword">inline</span> <span class="keywordtype">void</span> graph::remove_node(graph_node *n) {
    506. 

  506. <a name="l00559"></a>00559     {
    507. 

  507. <a name="l00560"></a>00560         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(nodelist_mutex);
    508. 

  508. <a name="l00561"></a>00561         __TBB_ASSERT(my_nodes &amp;&amp; my_nodes_last, <span class="stringliteral">"graph::remove_node: Error: no registered nodes"</span>);
    509. 

  509. <a name="l00562"></a>00562         <span class="keywordflow">if</span> (n-&gt;prev) n-&gt;prev-&gt;next = n-&gt;next;
    510. 

  510. <a name="l00563"></a>00563         <span class="keywordflow">if</span> (n-&gt;next) n-&gt;next-&gt;prev = n-&gt;prev;
    511. 

  511. <a name="l00564"></a>00564         <span class="keywordflow">if</span> (my_nodes_last == n) my_nodes_last = n-&gt;prev;
    512. 

  512. <a name="l00565"></a>00565         <span class="keywordflow">if</span> (my_nodes == n) my_nodes = n-&gt;next;
    513. 

  513. <a name="l00566"></a>00566     }
    514. 

  514. <a name="l00567"></a>00567     n-&gt;prev = n-&gt;next = NULL;
    515. 

  515. <a name="l00568"></a>00568 }
    516. 

  516. <a name="l00569"></a>00569 
    517. 

  517. <a name="l00570"></a>00570 <span class="keyword">inline</span> <span class="keywordtype">void</span> graph::reset() {
    518. 

  518. <a name="l00571"></a>00571     <span class="comment">// reset context</span>
    519. 

  519. <a name="l00572"></a>00572     <span class="keywordflow">if</span>(my_context) my_context-&gt;reset();
    520. 

  520. <a name="l00573"></a>00573     cancelled = <span class="keyword">false</span>;
    521. 

  521. <a name="l00574"></a>00574     caught_exception = <span class="keyword">false</span>;
    522. 

  522. <a name="l00575"></a>00575     <span class="comment">// reset all the nodes comprising the graph</span>
    523. 

  523. <a name="l00576"></a>00576     <span class="keywordflow">for</span>(iterator ii = begin(); ii != end(); ++ii) {
    524. 

  524. <a name="l00577"></a>00577         graph_node *my_p = &amp;(*ii);
    525. 

  525. <a name="l00578"></a>00578         my_p-&gt;reset();
    526. 

  526. <a name="l00579"></a>00579     }
    527. 

  527. <a name="l00580"></a>00580 }
    528. 

  528. <a name="l00581"></a>00581 
    529. 

  529. <a name="l00582"></a>00582 
    530. 

  530. <a name="l00583"></a>00583 <span class="preprocessor">#include "internal/_flow_graph_node_impl.h"</span>
    531. 

  531. <a name="l00584"></a>00584 
    532. 

  532. <a name="l00586"></a>00586 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> Output &gt;
    533. 

  533. <a name="l00587"></a><a class="code" href="a00337.html">00587</a> <span class="keyword">class </span><a class="code" href="a00337.html">source_node</a> : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> <a class="code" href="a00334.html">sender</a>&lt; Output &gt; {
    534. 

  534. <a name="l00588"></a>00588 <span class="keyword">protected</span>:
    535. 

  535. <a name="l00589"></a>00589     <span class="keyword">using</span> graph_node::my_graph;
    536. 

  536. <a name="l00590"></a>00590 <span class="keyword">public</span>:
    537. 

  537. <a name="l00592"></a><a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">00592</a>     <span class="keyword">typedef</span> Output <a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">output_type</a>;
    538. 

  538. <a name="l00593"></a>00593 
    539. 

  539. <a name="l00595"></a><a class="code" href="a00337.html#dd7b8fe78f0bec9d6b70cbf1018a69fe">00595</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; Output &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    540. 

  540. <a name="l00596"></a>00596 
    541. 

  541. <a name="l00598"></a>00598     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Body &gt;
    542. 

  542. <a name="l00599"></a><a class="code" href="a00337.html#503c3b395c629296bf5cccd96d6388c1">00599</a>     <a class="code" href="a00337.html#503c3b395c629296bf5cccd96d6388c1">source_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, Body body, <span class="keywordtype">bool</span> is_active = <span class="keyword">true</span> )
    543. 

  543. <a name="l00600"></a>00600         : <a class="code" href="a00296.html">graph_node</a>(g), my_root_task(g.root_task()), my_active(is_active), init_my_active(is_active),
    544. 

  544. <a name="l00601"></a>00601         my_body( new internal::source_body_leaf&lt; <a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">output_type</a>, Body&gt;(body) ),
    545. 

  545. <a name="l00602"></a>00602         my_reserved(false), my_has_cached_item(false)
    546. 

  546. <a name="l00603"></a>00603     {
    547. 

  547. <a name="l00604"></a>00604         my_successors.set_owner(<span class="keyword">this</span>);
    548. 

  548. <a name="l00605"></a>00605     }
    549. 

  549. <a name="l00606"></a>00606 
    550. 

  550. <a name="l00608"></a><a class="code" href="a00337.html#adaac111fbcace95804219a5f2929304">00608</a>     <a class="code" href="a00337.html#503c3b395c629296bf5cccd96d6388c1">source_node</a>( <span class="keyword">const</span> <a class="code" href="a00337.html">source_node</a>&amp; src ) :
    551. 

  551. <a name="l00609"></a>00609         <a class="code" href="a00296.html">graph_node</a>(src.my_graph), <a class="code" href="a00334.html">sender</a>&lt;Output&gt;(),
    552. 

  552. <a name="l00610"></a>00610         my_root_task( src.my_root_task), my_active(src.init_my_active),
    553. 

  553. <a name="l00611"></a>00611         init_my_active(src.init_my_active), my_body( src.my_body-&gt;clone() ),
    554. 

  554. <a name="l00612"></a>00612         my_reserved(false), my_has_cached_item(false)
    555. 

  555. <a name="l00613"></a>00613     {
    556. 

  556. <a name="l00614"></a>00614         my_successors.set_owner(<span class="keyword">this</span>);
    557. 

  557. <a name="l00615"></a>00615     }
    558. 

  558. <a name="l00616"></a>00616 
    559. 

  559. <a name="l00618"></a><a class="code" href="a00337.html#61700b0865fc17188b0abe26bbde65b6">00618</a>     <a class="code" href="a00337.html#61700b0865fc17188b0abe26bbde65b6">~source_node</a>() { <span class="keyword">delete</span> my_body; }
    560. 

  560. <a name="l00619"></a>00619 
    561. 

  561. <a name="l00621"></a><a class="code" href="a00337.html#22960d499df9f1569a9d8a544e35afe3">00621</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00337.html#22960d499df9f1569a9d8a544e35afe3">register_successor</a>( <a class="code" href="a00328.html">receiver&lt;output_type&gt;</a> &amp;r ) {
    562. 

  562. <a name="l00622"></a>00622         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    563. 

  563. <a name="l00623"></a>00623         my_successors.register_successor(r);
    564. 

  564. <a name="l00624"></a>00624         <span class="keywordflow">if</span> ( my_active )
    565. 

  565. <a name="l00625"></a>00625             spawn_put();
    566. 

  566. <a name="l00626"></a>00626         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    567. 

  567. <a name="l00627"></a>00627     }
    568. 

  568. <a name="l00628"></a>00628 
    569. 

  569. <a name="l00630"></a><a class="code" href="a00337.html#222484bf295f39df36415a29e508e5c9">00630</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00337.html#222484bf295f39df36415a29e508e5c9">remove_successor</a>( <a class="code" href="a00328.html">receiver&lt;output_type&gt;</a> &amp;r ) {
    570. 

  570. <a name="l00631"></a>00631         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    571. 

  571. <a name="l00632"></a>00632         my_successors.remove_successor(r);
    572. 

  572. <a name="l00633"></a>00633         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    573. 

  573. <a name="l00634"></a>00634     }
    574. 

  574. <a name="l00635"></a>00635 
    575. 

  575. <a name="l00637"></a><a class="code" href="a00337.html#41073ad4d3510ed5a8b6bda9c0f58636">00637</a>     <span class="comment">/*override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00337.html#41073ad4d3510ed5a8b6bda9c0f58636">try_get</a>( <a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">output_type</a> &amp;v ) {
    576. 

  576. <a name="l00638"></a>00638         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    577. 

  577. <a name="l00639"></a>00639         <span class="keywordflow">if</span> ( my_reserved )
    578. 

  578. <a name="l00640"></a>00640             <span class="keywordflow">return</span> <span class="keyword">false</span>;
    579. 

  579. <a name="l00641"></a>00641 
    580. 

  580. <a name="l00642"></a>00642         <span class="keywordflow">if</span> ( my_has_cached_item ) {
    581. 

  581. <a name="l00643"></a>00643             v = my_cached_item;
    582. 

  582. <a name="l00644"></a>00644             my_has_cached_item = <span class="keyword">false</span>;
    583. 

  583. <a name="l00645"></a>00645             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    584. 

  584. <a name="l00646"></a>00646         }
    585. 

  585. <a name="l00647"></a>00647         <span class="keywordflow">return</span> <span class="keyword">false</span>;
    586. 

  586. <a name="l00648"></a>00648     }
    587. 

  587. <a name="l00649"></a>00649 
    588. 

  588. <a name="l00651"></a><a class="code" href="a00337.html#ad459713ff3c1c9ad0f4826daa141f65">00651</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00337.html#ad459713ff3c1c9ad0f4826daa141f65">try_reserve</a>( <a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">output_type</a> &amp;v ) {
    589. 

  589. <a name="l00652"></a>00652         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    590. 

  590. <a name="l00653"></a>00653         <span class="keywordflow">if</span> ( my_reserved ) {
    591. 

  591. <a name="l00654"></a>00654             <span class="keywordflow">return</span> <span class="keyword">false</span>;
    592. 

  592. <a name="l00655"></a>00655         }
    593. 

  593. <a name="l00656"></a>00656 
    594. 

  594. <a name="l00657"></a>00657         <span class="keywordflow">if</span> ( my_has_cached_item ) {
    595. 

  595. <a name="l00658"></a>00658             v = my_cached_item;
    596. 

  596. <a name="l00659"></a>00659             my_reserved = <span class="keyword">true</span>;
    597. 

  597. <a name="l00660"></a>00660             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    598. 

  598. <a name="l00661"></a>00661         } <span class="keywordflow">else</span> {
    599. 

  599. <a name="l00662"></a>00662             <span class="keywordflow">return</span> <span class="keyword">false</span>;
    600. 

  600. <a name="l00663"></a>00663         }
    601. 

  601. <a name="l00664"></a>00664     }
    602. 

  602. <a name="l00665"></a>00665 
    603. 

  603. <a name="l00667"></a>00667 
    604. 

  604. <a name="l00668"></a><a class="code" href="a00337.html#494678baf9096835268736b800824460">00668</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00337.html#494678baf9096835268736b800824460">try_release</a>( ) {
    605. 

  605. <a name="l00669"></a>00669         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    606. 

  606. <a name="l00670"></a>00670         __TBB_ASSERT( my_reserved &amp;&amp; my_has_cached_item, <span class="stringliteral">"releasing non-existent reservation"</span> );
    607. 

  607. <a name="l00671"></a>00671         my_reserved = <span class="keyword">false</span>;
    608. 

  608. <a name="l00672"></a>00672         <span class="keywordflow">if</span>(!my_successors.empty())
    609. 

  609. <a name="l00673"></a>00673             spawn_put();
    610. 

  610. <a name="l00674"></a>00674         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    611. 

  611. <a name="l00675"></a>00675     }
    612. 

  612. <a name="l00676"></a>00676 
    613. 

  613. <a name="l00678"></a><a class="code" href="a00337.html#2c7fcc29e2894b29138be3c1edce9bc9">00678</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00337.html#2c7fcc29e2894b29138be3c1edce9bc9">try_consume</a>( ) {
    614. 

  614. <a name="l00679"></a>00679         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    615. 

  615. <a name="l00680"></a>00680         __TBB_ASSERT( my_reserved &amp;&amp; my_has_cached_item, <span class="stringliteral">"consuming non-existent reservation"</span> );
    616. 

  616. <a name="l00681"></a>00681         my_reserved = <span class="keyword">false</span>;
    617. 

  617. <a name="l00682"></a>00682         my_has_cached_item = <span class="keyword">false</span>;
    618. 

  618. <a name="l00683"></a>00683         <span class="keywordflow">if</span> ( !my_successors.empty() ) {
    619. 

  619. <a name="l00684"></a>00684             spawn_put();
    620. 

  620. <a name="l00685"></a>00685         }
    621. 

  621. <a name="l00686"></a>00686         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    622. 

  622. <a name="l00687"></a>00687     }
    623. 

  623. <a name="l00688"></a>00688 
    624. 

  624. <a name="l00690"></a><a class="code" href="a00337.html#4b647e4a93d08ccdd8d323279e4eaaa6">00690</a>     <span class="keywordtype">void</span> <a class="code" href="a00337.html#4b647e4a93d08ccdd8d323279e4eaaa6">activate</a>() {
    625. 

  625. <a name="l00691"></a>00691         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    626. 

  626. <a name="l00692"></a>00692         my_active = <span class="keyword">true</span>;
    627. 

  627. <a name="l00693"></a>00693         <span class="keywordflow">if</span> ( !my_successors.empty() )
    628. 

  628. <a name="l00694"></a>00694             spawn_put();
    629. 

  629. <a name="l00695"></a>00695     }
    630. 

  630. <a name="l00696"></a>00696 
    631. 

  631. <a name="l00697"></a>00697     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Body&gt;
    632. 

  632. <a name="l00698"></a>00698     Body copy_function_object() { 
    633. 

  633. <a name="l00699"></a>00699         internal::source_body&lt;output_type&gt; &amp;body_ref = *this-&gt;my_body;
    634. 

  634. <a name="l00700"></a>00700         <span class="keywordflow">return</span> dynamic_cast&lt; internal::source_body_leaf&lt;output_type, Body&gt; &amp; &gt;(body_ref).get_body(); 
    635. 

  635. <a name="l00701"></a>00701     }
    636. 

  636. <a name="l00702"></a>00702 
    637. 

  637. <a name="l00703"></a>00703 <span class="keyword">protected</span>:
    638. 

  638. <a name="l00704"></a>00704 
    639. 

  639. <a name="l00706"></a><a class="code" href="a00337.html#d751cdda02bdaa1dc90c4d9609c05df2">00706</a>     <span class="keywordtype">void</span> <a class="code" href="a00337.html#d751cdda02bdaa1dc90c4d9609c05df2">reset</a>() {
    640. 

  640. <a name="l00707"></a>00707         my_active = init_my_active;
    641. 

  641. <a name="l00708"></a>00708         my_reserved =<span class="keyword">false</span>;
    642. 

  642. <a name="l00709"></a>00709         <span class="keywordflow">if</span>(my_has_cached_item) {
    643. 

  643. <a name="l00710"></a>00710             my_has_cached_item = <span class="keyword">false</span>;
    644. 

  644. <a name="l00711"></a>00711         }
    645. 

  645. <a name="l00712"></a>00712     }
    646. 

  646. <a name="l00713"></a>00713 
    647. 

  647. <a name="l00714"></a>00714 <span class="keyword">private</span>:
    648. 

  648. <a name="l00715"></a>00715     <a class="code" href="a00344.html">task</a> *my_root_task;
    649. 

  649. <a name="l00716"></a>00716     <a class="code" href="a00338.html">spin_mutex</a> my_mutex;
    650. 

  650. <a name="l00717"></a>00717     <span class="keywordtype">bool</span> my_active;
    651. 

  651. <a name="l00718"></a>00718     <span class="keywordtype">bool</span> init_my_active;
    652. 

  652. <a name="l00719"></a>00719     internal::source_body&lt;output_type&gt; *my_body;
    653. 

  653. <a name="l00720"></a>00720     internal::broadcast_cache&lt; output_type &gt; my_successors;
    654. 

  654. <a name="l00721"></a>00721     <span class="keywordtype">bool</span> my_reserved;
    655. 

  655. <a name="l00722"></a>00722     <span class="keywordtype">bool</span> my_has_cached_item;
    656. 

  656. <a name="l00723"></a>00723     <a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">output_type</a> my_cached_item;
    657. 

  657. <a name="l00724"></a>00724 
    658. 

  658. <a name="l00725"></a>00725     <span class="comment">// used by apply_body, can invoke body of node.</span>
    659. 

  659. <a name="l00726"></a>00726     <span class="keywordtype">bool</span> try_reserve_apply_body(<a class="code" href="a00337.html#407533487cc3f6032c1072cba19c609c">output_type</a> &amp;v) {
    660. 

  660. <a name="l00727"></a>00727         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    661. 

  661. <a name="l00728"></a>00728         <span class="keywordflow">if</span> ( my_reserved ) {
    662. 

  662. <a name="l00729"></a>00729             <span class="keywordflow">return</span> <span class="keyword">false</span>;
    663. 

  663. <a name="l00730"></a>00730         }
    664. 

  664. <a name="l00731"></a>00731         <span class="keywordflow">if</span> ( !my_has_cached_item &amp;&amp; (*my_body)(my_cached_item) )
    665. 

  665. <a name="l00732"></a>00732             my_has_cached_item = <span class="keyword">true</span>;
    666. 

  666. <a name="l00733"></a>00733         <span class="keywordflow">if</span> ( my_has_cached_item ) {
    667. 

  667. <a name="l00734"></a>00734             v = my_cached_item;
    668. 

  668. <a name="l00735"></a>00735             my_reserved = <span class="keyword">true</span>;
    669. 

  669. <a name="l00736"></a>00736             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    670. 

  670. <a name="l00737"></a>00737         } <span class="keywordflow">else</span> {
    671. 

  671. <a name="l00738"></a>00738             <span class="keywordflow">return</span> <span class="keyword">false</span>;
    672. 

  672. <a name="l00739"></a>00739         }
    673. 

  673. <a name="l00740"></a>00740     }
    674. 

  674. <a name="l00741"></a>00741 
    675. 

  675. <a name="l00743"></a>00743     <span class="comment">/* override */</span> <span class="keywordtype">void</span> spawn_put( ) {
    676. 

  676. <a name="l00744"></a>00744         <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>( * <span class="keyword">new</span> ( task::allocate_additional_child_of( *my_root_task ) )
    677. 

  677. <a name="l00745"></a>00745            internal:: source_task_bypass &lt; source_node&lt; output_type &gt; &gt;( *<span class="keyword">this</span> ) );
    678. 

  678. <a name="l00746"></a>00746     }
    679. 

  679. <a name="l00747"></a>00747 
    680. 

  680. <a name="l00748"></a>00748     <span class="keyword">friend</span> <span class="keyword">class </span>internal::source_task_bypass&lt; source_node&lt; output_type &gt; &gt;;
    681. 

  681. <a name="l00750"></a>00750     <span class="comment">/* override */</span> task * apply_body_bypass( ) {
    682. 

  682. <a name="l00751"></a>00751         output_type v;
    683. 

  683. <a name="l00752"></a>00752         <span class="keywordflow">if</span> ( !try_reserve_apply_body(v) )
    684. 

  684. <a name="l00753"></a>00753             <span class="keywordflow">return</span> NULL;
    685. 

  685. <a name="l00754"></a>00754 
    686. 

  686. <a name="l00755"></a>00755         task *last_task = my_successors.try_put_task(v);
    687. 

  687. <a name="l00756"></a>00756         <span class="keywordflow">if</span> ( last_task )
    688. 

  688. <a name="l00757"></a>00757             <a class="code" href="a00337.html#2c7fcc29e2894b29138be3c1edce9bc9">try_consume</a>();
    689. 

  689. <a name="l00758"></a>00758         <span class="keywordflow">else</span>
    690. 

  690. <a name="l00759"></a>00759             <a class="code" href="a00337.html#494678baf9096835268736b800824460">try_release</a>();
    691. 

  691. <a name="l00760"></a>00760         <span class="keywordflow">return</span> last_task;
    692. 

  692. <a name="l00761"></a>00761     }
    693. 

  693. <a name="l00762"></a>00762 };  <span class="comment">// source_node</span>
    694. 

  694. <a name="l00763"></a>00763 
    695. 

  695. <a name="l00765"></a>00765 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> Input, <span class="keyword">typename</span> Output = continue_msg, graph_buffer_policy = queueing, <span class="keyword">typename</span> Allocator=cache_aligned_allocator&lt;Input&gt; &gt;
    696. 

  696. <a name="l00766"></a><a class="code" href="a00293.html">00766</a> <span class="keyword">class </span><a class="code" href="a00293.html">function_node</a> : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> internal::function_input&lt;Input,Output,Allocator&gt;, <span class="keyword">public</span> internal::function_output&lt;Output&gt; {
    697. 

  697. <a name="l00767"></a>00767 <span class="keyword">protected</span>:
    698. 

  698. <a name="l00768"></a>00768     <span class="keyword">using</span> graph_node::my_graph;
    699. 

  699. <a name="l00769"></a>00769 <span class="keyword">public</span>:
    700. 

  700. <a name="l00770"></a>00770     <span class="keyword">typedef</span> Input input_type;
    701. 

  701. <a name="l00771"></a>00771     <span class="keyword">typedef</span> Output output_type;
    702. 

  702. <a name="l00772"></a>00772     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    703. 

  703. <a name="l00773"></a>00773     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    704. 

  704. <a name="l00774"></a>00774     <span class="keyword">typedef</span> internal::function_input&lt;input_type,output_type,Allocator&gt; fInput_type;
    705. 

  705. <a name="l00775"></a>00775     <span class="keyword">typedef</span> internal::function_output&lt;output_type&gt; fOutput_type;
    706. 

  706. <a name="l00776"></a>00776 
    707. 

  707. <a name="l00778"></a>00778     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Body &gt;
    708. 

  708. <a name="l00779"></a><a class="code" href="a00293.html#5c215b40e3daf73d1c6802ecb5aded6c">00779</a>     <a class="code" href="a00293.html#5c215b40e3daf73d1c6802ecb5aded6c">function_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, size_t concurrency, Body body ) :
    709. 

  709. <a name="l00780"></a>00780         <a class="code" href="a00296.html">graph_node</a>(g), internal::function_input&lt;input_type,output_type,Allocator&gt;(g, concurrency, body)
    710. 

  710. <a name="l00781"></a>00781     {}
    711. 

  711. <a name="l00782"></a>00782 
    712. 

  712. <a name="l00784"></a><a class="code" href="a00293.html#d5132323fd2ac6a00ea0c78beda78723">00784</a>     <a class="code" href="a00293.html#5c215b40e3daf73d1c6802ecb5aded6c">function_node</a>( <span class="keyword">const</span> <a class="code" href="a00293.html">function_node</a>&amp; src ) :
    713. 

  713. <a name="l00785"></a>00785         <a class="code" href="a00296.html">graph_node</a>(src.my_graph), internal::function_input&lt;input_type,output_type,Allocator&gt;( src ),
    714. 

  714. <a name="l00786"></a>00786         fOutput_type()
    715. 

  715. <a name="l00787"></a>00787     {}
    716. 

  716. <a name="l00788"></a>00788 
    717. 

  717. <a name="l00789"></a>00789 <span class="keyword">protected</span>:
    718. 

  718. <a name="l00790"></a>00790     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span>run_and_put_task;
    719. 

  719. <a name="l00791"></a>00791     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    720. 

  720. <a name="l00792"></a>00792     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    721. 

  721. <a name="l00793"></a>00793     <span class="keyword">using</span> fInput_type::try_put_task;
    722. 

  722. <a name="l00794"></a>00794 
    723. 

  723. <a name="l00795"></a>00795     <span class="comment">// override of graph_node's reset.</span>
    724. 

  724. <a name="l00796"></a>00796     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() {fInput_type::reset_function_input(); }
    725. 

  725. <a name="l00797"></a>00797 
    726. 

  726. <a name="l00798"></a>00798     <span class="comment">/* override */</span> internal::broadcast_cache&lt;output_type&gt; &amp;successors () { <span class="keywordflow">return</span> fOutput_type::my_successors; }
    727. 

  727. <a name="l00799"></a>00799 };
    728. 

  728. <a name="l00800"></a>00800 
    729. 

  729. <a name="l00802"></a>00802 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> Input, <span class="keyword">typename</span> Output, <span class="keyword">typename</span> Allocator &gt;
    730. 

  730. <a name="l00803"></a><a class="code" href="a00294.html">00803</a> <span class="keyword">class </span><a class="code" href="a00293.html">function_node</a>&lt;Input,Output,queueing,Allocator&gt; : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> internal::function_input&lt;Input,Output,Allocator&gt;, <span class="keyword">public</span> internal::function_output&lt;Output&gt; {
    731. 

  731. <a name="l00804"></a>00804 <span class="keyword">protected</span>:
    732. 

  732. <a name="l00805"></a>00805     <span class="keyword">using</span> graph_node::my_graph;
    733. 

  733. <a name="l00806"></a>00806 <span class="keyword">public</span>:
    734. 

  734. <a name="l00807"></a>00807     <span class="keyword">typedef</span> Input input_type;
    735. 

  735. <a name="l00808"></a>00808     <span class="keyword">typedef</span> Output output_type;
    736. 

  736. <a name="l00809"></a>00809     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    737. 

  737. <a name="l00810"></a>00810     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    738. 

  738. <a name="l00811"></a>00811     <span class="keyword">typedef</span> internal::function_input&lt;input_type,output_type,Allocator&gt; fInput_type;
    739. 

  739. <a name="l00812"></a>00812     <span class="keyword">typedef</span> internal::function_input_queue&lt;input_type, Allocator&gt; queue_type;
    740. 

  740. <a name="l00813"></a>00813     <span class="keyword">typedef</span> internal::function_output&lt;output_type&gt; fOutput_type;
    741. 

  741. <a name="l00814"></a>00814 
    742. 

  742. <a name="l00816"></a>00816     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Body &gt;
    743. 

  743. <a name="l00817"></a><a class="code" href="a00294.html#5b9019c1e6e9b2c41c986a384bd179db">00817</a>     <a class="code" href="a00293.html#5c215b40e3daf73d1c6802ecb5aded6c">function_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, size_t concurrency, Body body ) :
    744. 

  744. <a name="l00818"></a>00818         <a class="code" href="a00296.html">graph_node</a>(g), fInput_type( g, concurrency, body, new queue_type() )
    745. 

  745. <a name="l00819"></a>00819     {}
    746. 

  746. <a name="l00820"></a>00820 
    747. 

  747. <a name="l00822"></a><a class="code" href="a00294.html#01055081ed477714503820035db3a965">00822</a>     <a class="code" href="a00293.html#5c215b40e3daf73d1c6802ecb5aded6c">function_node</a>( <span class="keyword">const</span> <a class="code" href="a00293.html">function_node</a>&amp; src ) :
    748. 

  748. <a name="l00823"></a>00823         <a class="code" href="a00296.html">graph_node</a>(src.my_graph), fInput_type( src, new queue_type() ), fOutput_type()
    749. 

  749. <a name="l00824"></a>00824     {}
    750. 

  750. <a name="l00825"></a>00825 
    751. 

  751. <a name="l00826"></a>00826 <span class="keyword">protected</span>:
    752. 

  752. <a name="l00827"></a>00827     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span>run_and_put_task;
    753. 

  753. <a name="l00828"></a>00828     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    754. 

  754. <a name="l00829"></a>00829     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    755. 

  755. <a name="l00830"></a>00830     <span class="keyword">using</span> fInput_type::try_put_task;
    756. 

  756. <a name="l00831"></a>00831 
    757. 

  757. <a name="l00832"></a>00832     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() { fInput_type::reset_function_input(); }
    758. 

  758. <a name="l00833"></a>00833 
    759. 

  759. <a name="l00834"></a>00834     <span class="comment">/* override */</span> internal::broadcast_cache&lt;output_type&gt; &amp;successors () { <span class="keywordflow">return</span> fOutput_type::my_successors; }
    760. 

  760. <a name="l00835"></a>00835 };
    761. 

  761. <a name="l00836"></a>00836 
    762. 

  762. <a name="l00837"></a>00837 <span class="preprocessor">#include "tbb/internal/_flow_graph_types_impl.h"</span>
    763. 

  763. <a name="l00838"></a>00838 
    764. 

  764. <a name="l00840"></a>00840 <span class="comment">// Output is a tuple of output types.</span>
    765. 

  765. <a name="l00841"></a>00841 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> Input, <span class="keyword">typename</span> Output, graph_buffer_policy = queueing, <span class="keyword">typename</span> Allocator=cache_aligned_allocator&lt;Input&gt; &gt;
    766. 

  766. <a name="l00842"></a><a class="code" href="a00307.html">00842</a> <span class="keyword">class </span><a class="code" href="a00307.html">multifunction_node</a> :
    767. 

  767. <a name="l00843"></a>00843     <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>,
    768. 

  768. <a name="l00844"></a>00844     <span class="keyword">public</span> internal::multifunction_input
    769. 

  769. <a name="l00845"></a>00845     &lt;
    770. 

  770. <a name="l00846"></a>00846         Input,
    771. 

  771. <a name="l00847"></a>00847         typename internal::wrap_tuple_elements&lt;
    772. 

  772. <a name="l00848"></a>00848             tbb::flow::tuple_size&lt;Output&gt;::value,  <span class="comment">// #elements in tuple</span>
    773. 

  773. <a name="l00849"></a>00849             internal::multifunction_output,  <span class="comment">// wrap this around each element</span>
    774. 

  774. <a name="l00850"></a>00850             Output <span class="comment">// the tuple providing the types</span>
    775. 

  775. <a name="l00851"></a>00851         &gt;::type,
    776. 

  776. <a name="l00852"></a>00852         Allocator
    777. 

  777. <a name="l00853"></a>00853     &gt; {
    778. 

  778. <a name="l00854"></a>00854 <span class="keyword">protected</span>:
    779. 

  779. <a name="l00855"></a>00855     <span class="keyword">using</span> graph_node::my_graph;
    780. 

  780. <a name="l00856"></a>00856 <span class="keyword">private</span>:
    781. 

  781. <a name="l00857"></a>00857     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;Output&gt;::value;
    782. 

  782. <a name="l00858"></a>00858 <span class="keyword">public</span>:
    783. 

  783. <a name="l00859"></a>00859     <span class="keyword">typedef</span> Input input_type;
    784. 

  784. <a name="l00860"></a>00860     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::wrap_tuple_elements&lt;N,internal::multifunction_output, Output&gt;::type output_ports_type;
    785. 

  785. <a name="l00861"></a>00861 <span class="keyword">private</span>:
    786. 

  786. <a name="l00862"></a>00862     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::multifunction_input&lt;input_type, output_ports_type, Allocator&gt; base_type;
    787. 

  787. <a name="l00863"></a>00863     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::function_input_queue&lt;input_type,Allocator&gt; queue_type;
    788. 

  788. <a name="l00864"></a>00864 <span class="keyword">public</span>:
    789. 

  789. <a name="l00865"></a>00865     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Body&gt;
    790. 

  790. <a name="l00866"></a>00866     <a class="code" href="a00307.html">multifunction_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, size_t concurrency, Body body ) :
    791. 

  791. <a name="l00867"></a>00867         <a class="code" href="a00296.html">graph_node</a>(g), base_type(g,concurrency, body)
    792. 

  792. <a name="l00868"></a>00868     {}
    793. 

  793. <a name="l00869"></a>00869     <a class="code" href="a00307.html">multifunction_node</a>( <span class="keyword">const</span> <a class="code" href="a00307.html">multifunction_node</a> &amp;other) :
    794. 

  794. <a name="l00870"></a>00870         <a class="code" href="a00296.html">graph_node</a>(other.<a class="code" href="a00296.html#6f51137fff91095fa3e6a736b71c27cc">my_graph</a>), base_type(other)
    795. 

  795. <a name="l00871"></a>00871     {}
    796. 

  796. <a name="l00872"></a>00872     <span class="comment">// all the guts are in multifunction_input...</span>
    797. 

  797. <a name="l00873"></a>00873 <span class="keyword">protected</span>:
    798. 

  798. <a name="l00874"></a>00874     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() { base_type::reset(); }
    799. 

  799. <a name="l00875"></a>00875 };  <span class="comment">// multifunction_node</span>
    800. 

  800. <a name="l00876"></a>00876 
    801. 

  801. <a name="l00877"></a>00877 <span class="keyword">template</span> &lt; <span class="keyword">typename</span> Input, <span class="keyword">typename</span> Output, <span class="keyword">typename</span> Allocator &gt;
    802. 

  802. <a name="l00878"></a>00878 <span class="keyword">class </span><a class="code" href="a00307.html">multifunction_node</a>&lt;Input,Output,queueing,Allocator&gt; : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> internal::multifunction_input&lt;Input,
    803. 

  803. <a name="l00879"></a>00879     typename internal::wrap_tuple_elements&lt;tbb::flow::tuple_size&lt;Output&gt;::value, internal::multifunction_output, Output&gt;::type, Allocator&gt; {
    804. 

  804. <a name="l00880"></a>00880 <span class="keyword">protected</span>:
    805. 

  805. <a name="l00881"></a>00881     <span class="keyword">using</span> graph_node::my_graph;
    806. 

  806. <a name="l00882"></a>00882     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;Output&gt;::value;
    807. 

  807. <a name="l00883"></a>00883 <span class="keyword">public</span>:
    808. 

  808. <a name="l00884"></a>00884     <span class="keyword">typedef</span> Input input_type;
    809. 

  809. <a name="l00885"></a>00885     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::wrap_tuple_elements&lt;N, internal::multifunction_output, Output&gt;::type output_ports_type;
    810. 

  810. <a name="l00886"></a>00886 <span class="keyword">private</span>:
    811. 

  811. <a name="l00887"></a>00887     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::multifunction_input&lt;input_type, output_ports_type, Allocator&gt; base_type;
    812. 

  812. <a name="l00888"></a>00888     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::function_input_queue&lt;input_type,Allocator&gt; queue_type;
    813. 

  813. <a name="l00889"></a>00889 <span class="keyword">public</span>:
    814. 

  814. <a name="l00890"></a>00890     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> Body&gt;
    815. 

  815. <a name="l00891"></a>00891     <a class="code" href="a00307.html">multifunction_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, size_t concurrency, Body body) :
    816. 

  816. <a name="l00892"></a>00892         <a class="code" href="a00296.html">graph_node</a>(g), base_type(g,concurrency, body, new queue_type())
    817. 

  817. <a name="l00893"></a>00893     {}
    818. 

  818. <a name="l00894"></a>00894     <a class="code" href="a00307.html">multifunction_node</a>( <span class="keyword">const</span> <a class="code" href="a00307.html">multifunction_node</a> &amp;other) :
    819. 

  819. <a name="l00895"></a>00895         <a class="code" href="a00296.html">graph_node</a>(other.my_graph), base_type(other, new queue_type())
    820. 

  820. <a name="l00896"></a>00896     {}
    821. 

  821. <a name="l00897"></a>00897     <span class="comment">// all the guts are in multifunction_input...</span>
    822. 

  822. <a name="l00898"></a>00898 <span class="keyword">protected</span>:
    823. 

  823. <a name="l00899"></a>00899     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() { base_type::reset(); }
    824. 

  824. <a name="l00900"></a>00900 };  <span class="comment">// multifunction_node</span>
    825. 

  825. <a name="l00901"></a>00901 
    826. 

  826. <a name="l00903"></a>00903 <span class="comment">//  successors.  The node has unlimited concurrency, so though it is marked as</span>
    827. 

  827. <a name="l00904"></a>00904 <span class="comment">//  "rejecting" it does not reject inputs.</span>
    828. 

  828. <a name="l00905"></a>00905 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> TupleType, <span class="keyword">typename</span> Allocator=cache_aligned_allocator&lt;TupleType&gt; &gt;
    829. 

  829. <a name="l00906"></a><a class="code" href="a00343.html">00906</a> <span class="keyword">class </span><a class="code" href="a00343.html">split_node</a> : <span class="keyword">public</span> <a class="code" href="a00307.html">multifunction_node</a>&lt;TupleType, TupleType, rejecting, Allocator&gt; {
    830. 

  830. <a name="l00907"></a>00907     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;TupleType&gt;::value;
    831. 

  831. <a name="l00908"></a>00908     <span class="keyword">typedef</span> <a class="code" href="a00307.html">multifunction_node&lt;TupleType,TupleType,rejecting,Allocator&gt;</a> <a class="code" href="a00307.html">base_type</a>;
    832. 

  832. <a name="l00909"></a>00909 <span class="keyword">public</span>:
    833. 

  833. <a name="l00910"></a>00910     <span class="keyword">typedef</span> <span class="keyword">typename</span> base_type::output_ports_type output_ports_type;
    834. 

  834. <a name="l00911"></a>00911 <span class="keyword">private</span>:
    835. 

  835. <a name="l00912"></a>00912     <span class="keyword">struct </span>splitting_body {
    836. 

  836. <a name="l00913"></a>00913         <span class="keywordtype">void</span> operator()(<span class="keyword">const</span> TupleType&amp; t, output_ports_type &amp;p) {
    837. 

  837. <a name="l00914"></a>00914             internal::emit_element&lt;N&gt;::emit_this(t, p);
    838. 

  838. <a name="l00915"></a>00915         }
    839. 

  839. <a name="l00916"></a>00916     };
    840. 

  840. <a name="l00917"></a>00917 <span class="keyword">public</span>:
    841. 

  841. <a name="l00918"></a>00918     <span class="keyword">typedef</span> TupleType input_type;
    842. 

  842. <a name="l00919"></a>00919     <span class="keyword">typedef</span> Allocator allocator_type;
    843. 

  843. <a name="l00920"></a>00920     <a class="code" href="a00343.html">split_node</a>(<a class="code" href="a00295.html">graph</a> &amp;g) : <a class="code" href="a00307.html">base_type</a>(g, unlimited, splitting_body()) {}
    844. 

  844. <a name="l00921"></a>00921     <a class="code" href="a00343.html">split_node</a>( <span class="keyword">const</span> <a class="code" href="a00343.html">split_node</a> &amp; other) : <a class="code" href="a00307.html">base_type</a>(other) {}
    845. 

  845. <a name="l00922"></a>00922 };
    846. 

  846. <a name="l00923"></a>00923 
    847. 

  847. <a name="l00925"></a>00925 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Output&gt;
    848. 

  848. <a name="l00926"></a><a class="code" href="a00285.html">00926</a> <span class="keyword">class </span><a class="code" href="a00285.html">continue_node</a> : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> internal::continue_input&lt;Output&gt;, <span class="keyword">public</span> internal::function_output&lt;Output&gt; {
    849. 

  849. <a name="l00927"></a>00927 <span class="keyword">protected</span>:
    850. 

  850. <a name="l00928"></a>00928     <span class="keyword">using</span> graph_node::my_graph;
    851. 

  851. <a name="l00929"></a>00929 <span class="keyword">public</span>:
    852. 

  852. <a name="l00930"></a>00930     <span class="keyword">typedef</span> <a class="code" href="a00284.html">continue_msg</a> <a class="code" href="a00284.html">input_type</a>;
    853. 

  853. <a name="l00931"></a>00931     <span class="keyword">typedef</span> Output output_type;
    854. 

  854. <a name="l00932"></a>00932     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    855. 

  855. <a name="l00933"></a>00933     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    856. 

  856. <a name="l00934"></a>00934     <span class="keyword">typedef</span> internal::continue_input&lt;Output&gt; fInput_type;
    857. 

  857. <a name="l00935"></a>00935     <span class="keyword">typedef</span> internal::function_output&lt;output_type&gt; fOutput_type;
    858. 

  858. <a name="l00936"></a>00936 
    859. 

  859. <a name="l00938"></a>00938     <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Body &gt;
    860. 

  860. <a name="l00939"></a><a class="code" href="a00285.html#2f200db877d2f80c08d09422e8bffd5a">00939</a>     <a class="code" href="a00285.html#2f200db877d2f80c08d09422e8bffd5a">continue_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, Body body ) :
    861. 

  861. <a name="l00940"></a>00940         <a class="code" href="a00296.html">graph_node</a>(g), internal::continue_input&lt;output_type&gt;( g, body )
    862. 

  862. <a name="l00941"></a>00941     {}
    863. 

  863. <a name="l00942"></a>00942 
    864. 

  864. <a name="l00944"></a>00944     <span class="keyword">template</span> &lt;<span class="keyword">typename</span> Body &gt;
    865. 

  865. <a name="l00945"></a><a class="code" href="a00285.html#7817aebf22dd125ca04df53ac488d163">00945</a>     <a class="code" href="a00285.html#2f200db877d2f80c08d09422e8bffd5a">continue_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, <span class="keywordtype">int</span> number_of_predecessors, Body body ) :
    866. 

  866. <a name="l00946"></a>00946         <a class="code" href="a00296.html">graph_node</a>(g), internal::continue_input&lt;output_type&gt;( g, number_of_predecessors, body )
    867. 

  867. <a name="l00947"></a>00947     {}
    868. 

  868. <a name="l00948"></a>00948 
    869. 

  869. <a name="l00950"></a><a class="code" href="a00285.html#869562787fcb5c57a90aea120f26d492">00950</a>     <a class="code" href="a00285.html#2f200db877d2f80c08d09422e8bffd5a">continue_node</a>( <span class="keyword">const</span> <a class="code" href="a00285.html">continue_node</a>&amp; src ) :
    870. 

  870. <a name="l00951"></a>00951         <a class="code" href="a00296.html">graph_node</a>(src.my_graph), internal::continue_input&lt;output_type&gt;(src),
    871. 

  871. <a name="l00952"></a>00952         internal::function_output&lt;Output&gt;()
    872. 

  872. <a name="l00953"></a>00953     {}
    873. 

  873. <a name="l00954"></a>00954 
    874. 

  874. <a name="l00955"></a>00955 <span class="keyword">protected</span>:
    875. 

  875. <a name="l00956"></a>00956     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span>run_and_put_task;
    876. 

  876. <a name="l00957"></a>00957     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    877. 

  877. <a name="l00958"></a>00958     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    878. 

  878. <a name="l00959"></a>00959     <span class="keyword">using</span> fInput_type::try_put_task;
    879. 

  879. <a name="l00960"></a>00960 
    880. 

  880. <a name="l00961"></a>00961     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() { internal::continue_input&lt;Output&gt;::reset_receiver(); }
    881. 

  881. <a name="l00962"></a>00962 
    882. 

  882. <a name="l00963"></a>00963     <span class="comment">/* override */</span> internal::broadcast_cache&lt;output_type&gt; &amp;successors () { <span class="keywordflow">return</span> fOutput_type::my_successors; }
    883. 

  883. <a name="l00964"></a>00964 };
    884. 

  884. <a name="l00965"></a>00965 
    885. 

  885. <a name="l00966"></a>00966 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    886. 

  886. <a name="l00967"></a>00967 <span class="keyword">class </span>overwrite_node : <span class="keyword">public</span> graph_node, <span class="keyword">public</span> receiver&lt;T&gt;, <span class="keyword">public</span> sender&lt;T&gt; {
    887. 

  887. <a name="l00968"></a>00968 <span class="keyword">protected</span>:
    888. 

  888. <a name="l00969"></a>00969     <span class="keyword">using</span> graph_node::my_graph;
    889. 

  889. <a name="l00970"></a>00970 <span class="keyword">public</span>:
    890. 

  890. <a name="l00971"></a>00971     <span class="keyword">typedef</span> T input_type;
    891. 

  891. <a name="l00972"></a>00972     <span class="keyword">typedef</span> T output_type;
    892. 

  892. <a name="l00973"></a>00973     <span class="keyword">typedef</span> sender&lt; input_type &gt; predecessor_type;
    893. 

  893. <a name="l00974"></a>00974     <span class="keyword">typedef</span> receiver&lt; output_type &gt; successor_type;
    894. 

  894. <a name="l00975"></a>00975 
    895. 

  895. <a name="l00976"></a>00976     overwrite_node(graph &amp;g) : graph_node(g), my_buffer_is_valid(false) {
    896. 

  896. <a name="l00977"></a>00977         my_successors.set_owner( <span class="keyword">this</span> );
    897. 

  897. <a name="l00978"></a>00978     }
    898. 

  898. <a name="l00979"></a>00979 
    899. 

  899. <a name="l00980"></a>00980     <span class="comment">// Copy constructor; doesn't take anything from src; default won't work</span>
    900. 

  900. <a name="l00981"></a>00981     overwrite_node( <span class="keyword">const</span> overwrite_node&amp; src ) :
    901. 

  901. <a name="l00982"></a>00982         graph_node(src.my_graph), receiver&lt;T&gt;(), sender&lt;T&gt;(), my_buffer_is_valid(false)
    902. 

  902. <a name="l00983"></a>00983     {
    903. 

  903. <a name="l00984"></a>00984         my_successors.set_owner( <span class="keyword">this</span> );
    904. 

  904. <a name="l00985"></a>00985     }
    905. 

  905. <a name="l00986"></a>00986 
    906. 

  906. <a name="l00987"></a>00987     ~overwrite_node() {}
    907. 

  907. <a name="l00988"></a>00988 
    908. 

  908. <a name="l00989"></a>00989     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#68b8941ad77b9303cf3bcb8cf1f2d28a">register_successor</a>( successor_type &amp;s ) {
    909. 

  909. <a name="l00990"></a>00990         spin_mutex::scoped_lock l( my_mutex );
    910. 

  910. <a name="l00991"></a>00991         <span class="keywordflow">if</span> ( my_buffer_is_valid ) {
    911. 

  911. <a name="l00992"></a>00992             <span class="comment">// We have a valid value that must be forwarded immediately.</span>
    912. 

  912. <a name="l00993"></a>00993             <span class="keywordflow">if</span> ( s.try_put( my_buffer ) || !s.register_predecessor( *<span class="keyword">this</span>  ) ) {
    913. 

  913. <a name="l00994"></a>00994                 <span class="comment">// We add the successor: it accepted our put or it rejected it but won't let us become a predecessor</span>
    914. 

  914. <a name="l00995"></a>00995                 my_successors.register_successor( s );
    915. 

  915. <a name="l00996"></a>00996                 <span class="keywordflow">return</span> <span class="keyword">true</span>;
    916. 

  916. <a name="l00997"></a>00997             } <span class="keywordflow">else</span> {
    917. 

  917. <a name="l00998"></a>00998                 <span class="comment">// We don't add the successor: it rejected our put and we became its predecessor instead</span>
    918. 

  918. <a name="l00999"></a>00999                 <span class="keywordflow">return</span> <span class="keyword">false</span>;
    919. 

  919. <a name="l01000"></a>01000             }
    920. 

  920. <a name="l01001"></a>01001         } <span class="keywordflow">else</span> {
    921. 

  921. <a name="l01002"></a>01002             <span class="comment">// No valid value yet, just add as successor</span>
    922. 

  922. <a name="l01003"></a>01003             my_successors.register_successor( s );
    923. 

  923. <a name="l01004"></a>01004             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    924. 

  924. <a name="l01005"></a>01005         }
    925. 

  925. <a name="l01006"></a>01006     }
    926. 

  926. <a name="l01007"></a>01007 
    927. 

  927. <a name="l01008"></a>01008     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00334.html#82f363bfb1738bb8789e167590b10ef9">remove_successor</a>( successor_type &amp;s ) {
    928. 

  928. <a name="l01009"></a>01009         spin_mutex::scoped_lock l( my_mutex );
    929. 

  929. <a name="l01010"></a>01010         my_successors.remove_successor(s);
    930. 

  930. <a name="l01011"></a>01011         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    931. 

  931. <a name="l01012"></a>01012     }
    932. 

  932. <a name="l01013"></a>01013 
    933. 

  933. <a name="l01014"></a>01014     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> try_get( T &amp;v ) {
    934. 

  934. <a name="l01015"></a>01015         spin_mutex::scoped_lock l( my_mutex );
    935. 

  935. <a name="l01016"></a>01016         <span class="keywordflow">if</span> ( my_buffer_is_valid ) {
    936. 

  936. <a name="l01017"></a>01017             v = my_buffer;
    937. 

  937. <a name="l01018"></a>01018             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    938. 

  938. <a name="l01019"></a>01019         } <span class="keywordflow">else</span> {
    939. 

  939. <a name="l01020"></a>01020             <span class="keywordflow">return</span> <span class="keyword">false</span>;
    940. 

  940. <a name="l01021"></a>01021         }
    941. 

  941. <a name="l01022"></a>01022     }
    942. 

  942. <a name="l01023"></a>01023 
    943. 

  943. <a name="l01024"></a>01024     <span class="keywordtype">bool</span> is_valid() {
    944. 

  944. <a name="l01025"></a>01025        spin_mutex::scoped_lock l( my_mutex );
    945. 

  945. <a name="l01026"></a>01026        <span class="keywordflow">return</span> my_buffer_is_valid;
    946. 

  946. <a name="l01027"></a>01027     }
    947. 

  947. <a name="l01028"></a>01028 
    948. 

  948. <a name="l01029"></a>01029     <span class="keywordtype">void</span> clear() {
    949. 

  949. <a name="l01030"></a>01030        spin_mutex::scoped_lock l( my_mutex );
    950. 

  950. <a name="l01031"></a>01031        my_buffer_is_valid = <span class="keyword">false</span>;
    951. 

  951. <a name="l01032"></a>01032     }
    952. 

  952. <a name="l01033"></a>01033 
    953. 

  953. <a name="l01034"></a>01034 <span class="keyword">protected</span>:
    954. 

  954. <a name="l01035"></a>01035     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span>run_and_put_task;
    955. 

  955. <a name="l01036"></a>01036     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    956. 

  956. <a name="l01037"></a>01037     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    957. 

  957. <a name="l01038"></a>01038     <span class="comment">/* override */</span> task * try_put_task( <span class="keyword">const</span> T &amp;v ) {
    958. 

  958. <a name="l01039"></a>01039         spin_mutex::scoped_lock l( my_mutex );
    959. 

  959. <a name="l01040"></a>01040         my_buffer = v;
    960. 

  960. <a name="l01041"></a>01041         my_buffer_is_valid = <span class="keyword">true</span>;
    961. 

  961. <a name="l01042"></a>01042         task * rtask = my_successors.try_put_task(v);
    962. 

  962. <a name="l01043"></a>01043         <span class="keywordflow">if</span>(!rtask) rtask = SUCCESSFULLY_ENQUEUED;
    963. 

  963. <a name="l01044"></a>01044         <span class="keywordflow">return</span> rtask;
    964. 

  964. <a name="l01045"></a>01045     }
    965. 

  965. <a name="l01046"></a>01046 
    966. 

  966. <a name="l01047"></a>01047     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() { my_buffer_is_valid = <span class="keyword">false</span>; }
    967. 

  967. <a name="l01048"></a>01048 
    968. 

  968. <a name="l01049"></a>01049     spin_mutex my_mutex;
    969. 

  969. <a name="l01050"></a>01050     internal::broadcast_cache&lt; T, null_rw_mutex &gt; my_successors;
    970. 

  970. <a name="l01051"></a>01051     T my_buffer;
    971. 

  971. <a name="l01052"></a>01052     <span class="keywordtype">bool</span> my_buffer_is_valid;
    972. 

  972. <a name="l01053"></a>01053     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset_receiver() {}
    973. 

  973. <a name="l01054"></a>01054 };
    974. 

  974. <a name="l01055"></a>01055 
    975. 

  975. <a name="l01056"></a>01056 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    976. 

  976. <a name="l01057"></a>01057 <span class="keyword">class </span>write_once_node : <span class="keyword">public</span> overwrite_node&lt;T&gt; {
    977. 

  977. <a name="l01058"></a>01058 <span class="keyword">public</span>:
    978. 

  978. <a name="l01059"></a>01059     <span class="keyword">typedef</span> T input_type;
    979. 

  979. <a name="l01060"></a>01060     <span class="keyword">typedef</span> T output_type;
    980. 

  980. <a name="l01061"></a>01061     <span class="keyword">typedef</span> sender&lt; input_type &gt; predecessor_type;
    981. 

  981. <a name="l01062"></a>01062     <span class="keyword">typedef</span> receiver&lt; output_type &gt; successor_type;
    982. 

  982. <a name="l01063"></a>01063 
    983. 

  983. <a name="l01065"></a>01065     write_once_node(graph&amp; g) : overwrite_node&lt;T&gt;(g) {}
    984. 

  984. <a name="l01066"></a>01066 
    985. 

  985. <a name="l01068"></a>01068     write_once_node( <span class="keyword">const</span> write_once_node&amp; src ) : overwrite_node&lt;T&gt;(src) {}
    986. 

  986. <a name="l01069"></a>01069 
    987. 

  987. <a name="l01070"></a>01070 <span class="keyword">protected</span>:
    988. 

  988. <a name="l01071"></a>01071     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span>run_and_put_task;
    989. 

  989. <a name="l01072"></a>01072     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    990. 

  990. <a name="l01073"></a>01073     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    991. 

  991. <a name="l01074"></a>01074     <span class="comment">/* override */</span> task *try_put_task( <span class="keyword">const</span> T &amp;v ) {
    992. 

  992. <a name="l01075"></a>01075         spin_mutex::scoped_lock l( this-&gt;my_mutex );
    993. 

  993. <a name="l01076"></a>01076         <span class="keywordflow">if</span> ( this-&gt;my_buffer_is_valid ) {
    994. 

  994. <a name="l01077"></a>01077             <span class="keywordflow">return</span> NULL;
    995. 

  995. <a name="l01078"></a>01078         } <span class="keywordflow">else</span> {
    996. 

  996. <a name="l01079"></a>01079             this-&gt;my_buffer = v;
    997. 

  997. <a name="l01080"></a>01080             this-&gt;my_buffer_is_valid = <span class="keyword">true</span>;
    998. 

  998. <a name="l01081"></a>01081             task *res = this-&gt;my_successors.try_put_task(v);
    999. 

  999. <a name="l01082"></a>01082             <span class="keywordflow">if</span>(!res) res = SUCCESSFULLY_ENQUEUED;
    1000. 

  1000. <a name="l01083"></a>01083             <span class="keywordflow">return</span> res;
    1001. 

  1001. <a name="l01084"></a>01084         }
    1002. 

  1002. <a name="l01085"></a>01085     }
    1003. 

  1003. <a name="l01086"></a>01086 };
    1004. 

  1004. <a name="l01087"></a>01087 
    1005. 

  1005. <a name="l01089"></a>01089 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;
    1006. 

  1006. <a name="l01090"></a><a class="code" href="a00269.html">01090</a> <span class="keyword">class </span><a class="code" href="a00269.html">broadcast_node</a> : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> <a class="code" href="a00328.html">receiver</a>&lt;T&gt;, <span class="keyword">public</span> <a class="code" href="a00334.html">sender</a>&lt;T&gt; {
    1007. 

  1007. <a name="l01091"></a>01091 <span class="keyword">protected</span>:
    1008. 

  1008. <a name="l01092"></a>01092     <span class="keyword">using</span> graph_node::my_graph;
    1009. 

  1009. <a name="l01093"></a>01093 <span class="keyword">private</span>:
    1010. 

  1010. <a name="l01094"></a>01094     internal::broadcast_cache&lt;T&gt; my_successors;
    1011. 

  1011. <a name="l01095"></a>01095 <span class="keyword">public</span>:
    1012. 

  1012. <a name="l01096"></a><a class="code" href="a00269.html#43c775d80e98cc601de69764983319f9">01096</a>     <span class="keyword">typedef</span> T <a class="code" href="a00269.html#43c775d80e98cc601de69764983319f9">input_type</a>;
    1013. 

  1013. <a name="l01097"></a><a class="code" href="a00269.html#8fd8d3075823e08b879be46c1215ab0f">01097</a>     <span class="keyword">typedef</span> T output_type;
    1014. 

  1014. <a name="l01098"></a><a class="code" href="a00269.html#0e2ad9a121cb286aa0d0142fef33c646">01098</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    1015. 

  1015. <a name="l01099"></a><a class="code" href="a00269.html#cc6a0eb1c4ee65465770628d8366f055">01099</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    1016. 

  1016. <a name="l01100"></a>01100 
    1017. 

  1017. <a name="l01101"></a>01101     <a class="code" href="a00269.html">broadcast_node</a>(<a class="code" href="a00295.html">graph</a>&amp; g) : <a class="code" href="a00296.html">graph_node</a>(g) {
    1018. 

  1018. <a name="l01102"></a>01102         my_successors.set_owner( <span class="keyword">this</span> );
    1019. 

  1019. <a name="l01103"></a>01103     }
    1020. 

  1020. <a name="l01104"></a>01104 
    1021. 

  1021. <a name="l01105"></a>01105     <span class="comment">// Copy constructor</span>
    1022. 

  1022. <a name="l01106"></a>01106     <a class="code" href="a00269.html">broadcast_node</a>( <span class="keyword">const</span> <a class="code" href="a00269.html">broadcast_node</a>&amp; src ) :
    1023. 

  1023. <a name="l01107"></a>01107         <a class="code" href="a00296.html">graph_node</a>(src.my_graph), <a class="code" href="a00328.html">receiver</a>&lt;T&gt;(), <a class="code" href="a00334.html">sender</a>&lt;T&gt;()
    1024. 

  1024. <a name="l01108"></a>01108     {
    1025. 

  1025. <a name="l01109"></a>01109         my_successors.set_owner( <span class="keyword">this</span> );
    1026. 

  1026. <a name="l01110"></a>01110     }
    1027. 

  1027. <a name="l01111"></a>01111 
    1028. 

  1028. <a name="l01113"></a><a class="code" href="a00269.html#fd0324c9ddb51fe6f95b3d015d338941">01113</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#fd0324c9ddb51fe6f95b3d015d338941">register_successor</a>( <a class="code" href="a00328.html">receiver&lt;T&gt;</a> &amp;r ) {
    1029. 

  1029. <a name="l01114"></a>01114         my_successors.register_successor( r );
    1030. 

  1030. <a name="l01115"></a>01115         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1031. 

  1031. <a name="l01116"></a>01116     }
    1032. 

  1032. <a name="l01117"></a>01117 
    1033. 

  1033. <a name="l01119"></a><a class="code" href="a00269.html#366efcc046ec08a104281109801ae629">01119</a>     <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="a00269.html#366efcc046ec08a104281109801ae629">remove_successor</a>( <a class="code" href="a00328.html">receiver&lt;T&gt;</a> &amp;r ) {
    1034. 

  1034. <a name="l01120"></a>01120         my_successors.remove_successor( r );
    1035. 

  1035. <a name="l01121"></a>01121         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1036. 

  1036. <a name="l01122"></a>01122     }
    1037. 

  1037. <a name="l01123"></a>01123 
    1038. 

  1038. <a name="l01124"></a>01124 <span class="keyword">protected</span>:
    1039. 

  1039. <a name="l01125"></a><a class="code" href="a00269.html#621bab40a858d214db69ef08d88b67c1">01125</a>     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00269.html#621bab40a858d214db69ef08d88b67c1">run_and_put_task</a>;
    1040. 

  1040. <a name="l01126"></a>01126     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    1041. 

  1041. <a name="l01127"></a>01127     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    1042. 

  1042. <a name="l01129"></a><a class="code" href="a00269.html#b4804d99e0fb0576f1061ab7269e5939">01129</a>     <span class="comment">/*override*/</span> <a class="code" href="a00344.html">task</a> *<a class="code" href="a00269.html#b4804d99e0fb0576f1061ab7269e5939">try_put_task</a>(<span class="keyword">const</span> T&amp; t) {
    1043. 

  1043. <a name="l01130"></a>01130         <a class="code" href="a00344.html">task</a> *new_task = my_successors.try_put_task(t);
    1044. 

  1044. <a name="l01131"></a>01131         <span class="keywordflow">if</span>(!new_task) new_task = SUCCESSFULLY_ENQUEUED;
    1045. 

  1045. <a name="l01132"></a>01132         <span class="keywordflow">return</span> new_task;
    1046. 

  1046. <a name="l01133"></a>01133     }
    1047. 

  1047. <a name="l01134"></a>01134 
    1048. 

  1048. <a name="l01135"></a>01135     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() {}
    1049. 

  1049. <a name="l01136"></a>01136     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset_receiver() {}
    1050. 

  1050. <a name="l01137"></a>01137 };  <span class="comment">// broadcast_node</span>
    1051. 

  1051. <a name="l01138"></a>01138 
    1052. 

  1052. <a name="l01139"></a>01139 <span class="preprocessor">#include "internal/_flow_graph_item_buffer_impl.h"</span>
    1053. 

  1053. <a name="l01140"></a>01140 
    1054. 

  1054. <a name="l01142"></a>01142 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A=cache_aligned_allocator&lt;T&gt; &gt;
    1055. 

  1055. <a name="l01143"></a><a class="code" href="a00270.html">01143</a> <span class="keyword">class </span><a class="code" href="a00270.html">buffer_node</a> : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> reservable_item_buffer&lt;T, A&gt;, <span class="keyword">public</span> <a class="code" href="a00328.html">receiver</a>&lt;T&gt;, <span class="keyword">public</span> <a class="code" href="a00334.html">sender</a>&lt;T&gt; {
    1056. 

  1056. <a name="l01144"></a>01144 <span class="keyword">protected</span>:
    1057. 

  1057. <a name="l01145"></a>01145     <span class="keyword">using</span> graph_node::my_graph;
    1058. 

  1058. <a name="l01146"></a>01146 <span class="keyword">public</span>:
    1059. 

  1059. <a name="l01147"></a><a class="code" href="a00270.html#334efb81b56a2f2b3ae08a16e8d65620">01147</a>     <span class="keyword">typedef</span> T <a class="code" href="a00270.html#334efb81b56a2f2b3ae08a16e8d65620">input_type</a>;
    1060. 

  1060. <a name="l01148"></a><a class="code" href="a00270.html#089520db81f6a1551dc94c01efbdd7be">01148</a>     <span class="keyword">typedef</span> T output_type;
    1061. 

  1061. <a name="l01149"></a><a class="code" href="a00270.html#5fb0ad03a822ca0fc34ad5d56a4093a2">01149</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    1062. 

  1062. <a name="l01150"></a><a class="code" href="a00270.html#66f7eda69b75e08f50726e50a11429cd">01150</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    1063. 

  1063. <a name="l01151"></a>01151     <span class="keyword">typedef</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;</a> <a class="code" href="a00270.html">my_class</a>;
    1064. 

  1064. <a name="l01152"></a>01152 <span class="keyword">protected</span>:
    1065. 

  1065. <a name="l01153"></a>01153     <span class="keyword">typedef</span> size_t size_type;
    1066. 

  1066. <a name="l01154"></a>01154     internal::round_robin_cache&lt; T, null_rw_mutex &gt; my_successors;
    1067. 

  1067. <a name="l01155"></a>01155 
    1068. 

  1068. <a name="l01156"></a>01156     <a class="code" href="a00344.html">task</a> *my_parent;
    1069. 

  1069. <a name="l01157"></a>01157 
    1070. 

  1070. <a name="l01158"></a>01158     <span class="keyword">friend</span> <span class="keyword">class </span>internal::forward_task_bypass&lt; buffer_node&lt; T, A &gt; &gt;;
    1071. 

  1071. <a name="l01159"></a>01159 
    1072. 

  1072. <a name="l01160"></a>01160     <span class="keyword">enum</span> op_type {reg_succ, rem_succ, req_item, res_item, rel_res, con_res, put_item, try_fwd_task };
    1073. 

  1073. <a name="l01161"></a>01161     <span class="keyword">enum</span> op_stat {WAIT=0, SUCCEEDED, FAILED};
    1074. 

  1074. <a name="l01162"></a>01162 
    1075. 

  1075. <a name="l01163"></a>01163     <span class="comment">// implements the aggregator_operation concept</span>
    1076. 

  1076. <a name="l01164"></a>01164     <span class="keyword">class </span>buffer_operation : <span class="keyword">public</span> internal::aggregated_operation&lt; buffer_operation &gt; {
    1077. 

  1077. <a name="l01165"></a>01165     <span class="keyword">public</span>:
    1078. 

  1078. <a name="l01166"></a>01166         <span class="keywordtype">char</span> type;
    1079. 

  1079. <a name="l01167"></a>01167         T *elem;
    1080. 

  1080. <a name="l01168"></a>01168         <a class="code" href="a00344.html">task</a> * ltask;
    1081. 

  1081. <a name="l01169"></a>01169         <a class="code" href="a00270.html#66f7eda69b75e08f50726e50a11429cd">successor_type</a> *r;
    1082. 

  1082. <a name="l01170"></a>01170         buffer_operation(<span class="keyword">const</span> T&amp; e, op_type t) : type(char(t)), elem(const_cast&lt;T*&gt;(&amp;e)) , ltask(NULL) , r(NULL) {}
    1083. 

  1083. <a name="l01171"></a>01171         buffer_operation(op_type t) : type(char(t)) , ltask(NULL) , r(NULL) {}
    1084. 

  1084. <a name="l01172"></a>01172     };
    1085. 

  1085. <a name="l01173"></a>01173 
    1086. 

  1086. <a name="l01174"></a>01174     <span class="keywordtype">bool</span> forwarder_busy;
    1087. 

  1087. <a name="l01175"></a>01175     <span class="keyword">typedef</span> internal::aggregating_functor&lt;my_class, buffer_operation&gt; my_handler;
    1088. 

  1088. <a name="l01176"></a>01176     <span class="keyword">friend</span> <span class="keyword">class </span>internal::aggregating_functor&lt;my_class, buffer_operation&gt;;
    1089. 

  1089. <a name="l01177"></a>01177     internal::aggregator&lt; my_handler, buffer_operation&gt; my_aggregator;
    1090. 

  1090. <a name="l01178"></a>01178 
    1091. 

  1091. <a name="l01179"></a>01179     <span class="keyword">virtual</span> <span class="keywordtype">void</span> handle_operations(buffer_operation *op_list) {
    1092. 

  1092. <a name="l01180"></a>01180         buffer_operation *tmp = NULL;
    1093. 

  1093. <a name="l01181"></a>01181         <span class="keywordtype">bool</span> try_forwarding=<span class="keyword">false</span>;
    1094. 

  1094. <a name="l01182"></a>01182         <span class="keywordflow">while</span> (op_list) {
    1095. 

  1095. <a name="l01183"></a>01183             tmp = op_list;
    1096. 

  1096. <a name="l01184"></a>01184             op_list = op_list-&gt;next;
    1097. 

  1097. <a name="l01185"></a>01185             <span class="keywordflow">switch</span> (tmp-&gt;type) {
    1098. 

  1098. <a name="l01186"></a>01186             <span class="keywordflow">case</span> reg_succ: <a class="code" href="a00270.html#df21388252b8963e839dca29d2c67ea5">internal_reg_succ</a>(tmp);  try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1099. 

  1099. <a name="l01187"></a>01187             <span class="keywordflow">case</span> rem_succ: <a class="code" href="a00270.html#6b6cf76dff80fd679251da93351c1291">internal_rem_succ</a>(tmp); <span class="keywordflow">break</span>;
    1100. 

  1100. <a name="l01188"></a>01188             <span class="keywordflow">case</span> req_item: internal_pop(tmp); <span class="keywordflow">break</span>;
    1101. 

  1101. <a name="l01189"></a>01189             <span class="keywordflow">case</span> res_item: internal_reserve(tmp); <span class="keywordflow">break</span>;
    1102. 

  1102. <a name="l01190"></a>01190             <span class="keywordflow">case</span> rel_res:  internal_release(tmp);  try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1103. 

  1103. <a name="l01191"></a>01191             <span class="keywordflow">case</span> con_res:  internal_consume(tmp);  try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1104. 

  1104. <a name="l01192"></a>01192             <span class="keywordflow">case</span> put_item: internal_push(tmp);  try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1105. 

  1105. <a name="l01193"></a>01193             <span class="keywordflow">case</span> try_fwd_task: <a class="code" href="a00270.html#bc6ef82fe9c28ace2ef6b78abb43ffb8">internal_forward_task</a>(tmp); <span class="keywordflow">break</span>;
    1106. 

  1106. <a name="l01194"></a>01194             }
    1107. 

  1107. <a name="l01195"></a>01195         }
    1108. 

  1108. <a name="l01196"></a>01196         <span class="keywordflow">if</span> (try_forwarding &amp;&amp; !forwarder_busy) {
    1109. 

  1109. <a name="l01197"></a>01197             forwarder_busy = <span class="keyword">true</span>;
    1110. 

  1110. <a name="l01198"></a>01198             task *new_task = <span class="keyword">new</span>(task::allocate_additional_child_of(*my_parent)) internal::
    1111. 

  1111. <a name="l01199"></a>01199                     forward_task_bypass
    1112. 

  1112. <a name="l01200"></a>01200                     &lt; buffer_node&lt;input_type, A&gt; &gt;(*<span class="keyword">this</span>);
    1113. 

  1113. <a name="l01201"></a>01201             <span class="comment">// tmp should point to the last item handled by the aggregator.  This is the operation</span>
    1114. 

  1114. <a name="l01202"></a>01202             <span class="comment">// the handling thread enqueued.  So modifying that record will be okay.</span>
    1115. 

  1115. <a name="l01203"></a>01203             <a class="code" href="a00344.html">tbb::task</a> *z = tmp-&gt;ltask;
    1116. 

  1116. <a name="l01204"></a>01204             tmp-&gt;ltask = combine_tasks(z, new_task);  <span class="comment">// in case the op generated a task</span>
    1117. 

  1117. <a name="l01205"></a>01205         }
    1118. 

  1118. <a name="l01206"></a>01206     }
    1119. 

  1119. <a name="l01207"></a>01207 
    1120. 

  1120. <a name="l01208"></a>01208     <span class="keyword">inline</span> task *grab_forwarding_task( buffer_operation &amp;op_data) {
    1121. 

  1121. <a name="l01209"></a>01209         <span class="keywordflow">return</span> op_data.ltask;
    1122. 

  1122. <a name="l01210"></a>01210     }
    1123. 

  1123. <a name="l01211"></a>01211 
    1124. 

  1124. <a name="l01212"></a>01212     <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue_forwarding_task(buffer_operation &amp;op_data) {
    1125. 

  1125. <a name="l01213"></a>01213         task *ft = grab_forwarding_task(op_data);
    1126. 

  1126. <a name="l01214"></a>01214         <span class="keywordflow">if</span>(ft) {
    1127. 

  1127. <a name="l01215"></a>01215             <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>(*ft);
    1128. 

  1128. <a name="l01216"></a>01216             <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1129. 

  1129. <a name="l01217"></a>01217         }
    1130. 

  1130. <a name="l01218"></a>01218         <span class="keywordflow">return</span> <span class="keyword">false</span>;
    1131. 

  1131. <a name="l01219"></a>01219     }
    1132. 

  1132. <a name="l01220"></a>01220 
    1133. 

  1133. <a name="l01222"></a><a class="code" href="a00270.html#8954338d1a7740f9be80455ba27e8eed">01222</a>     <span class="keyword">virtual</span> <a class="code" href="a00344.html">task</a> *<a class="code" href="a00270.html#8954338d1a7740f9be80455ba27e8eed">forward_task</a>() {
    1134. 

  1134. <a name="l01223"></a>01223         buffer_operation op_data(try_fwd_task);
    1135. 

  1135. <a name="l01224"></a>01224         <a class="code" href="a00344.html">task</a> *last_task = NULL;
    1136. 

  1136. <a name="l01225"></a>01225         <span class="keywordflow">do</span> {
    1137. 

  1137. <a name="l01226"></a>01226             op_data.status = WAIT;
    1138. 

  1138. <a name="l01227"></a>01227             op_data.ltask = NULL;
    1139. 

  1139. <a name="l01228"></a>01228             my_aggregator.execute(&amp;op_data);
    1140. 

  1140. <a name="l01229"></a>01229             <a class="code" href="a00344.html">tbb::task</a> *xtask = op_data.ltask;
    1141. 

  1141. <a name="l01230"></a>01230             last_task = combine_tasks(last_task, xtask);
    1142. 

  1142. <a name="l01231"></a>01231         } <span class="keywordflow">while</span> (op_data.status == SUCCEEDED);
    1143. 

  1143. <a name="l01232"></a>01232         <span class="keywordflow">return</span> last_task;
    1144. 

  1144. <a name="l01233"></a>01233     }
    1145. 

  1145. <a name="l01234"></a>01234 
    1146. 

  1146. <a name="l01236"></a><a class="code" href="a00270.html#df21388252b8963e839dca29d2c67ea5">01236</a>     <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00270.html#df21388252b8963e839dca29d2c67ea5">internal_reg_succ</a>(buffer_operation *op) {
    1147. 

  1147. <a name="l01237"></a>01237         my_successors.register_successor(*(op-&gt;r));
    1148. 

  1148. <a name="l01238"></a>01238         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1149. 

  1149. <a name="l01239"></a>01239     }
    1150. 

  1150. <a name="l01240"></a>01240 
    1151. 

  1151. <a name="l01242"></a><a class="code" href="a00270.html#6b6cf76dff80fd679251da93351c1291">01242</a>     <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00270.html#6b6cf76dff80fd679251da93351c1291">internal_rem_succ</a>(buffer_operation *op) {
    1152. 

  1152. <a name="l01243"></a>01243         my_successors.remove_successor(*(op-&gt;r));
    1153. 

  1153. <a name="l01244"></a>01244         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1154. 

  1154. <a name="l01245"></a>01245     }
    1155. 

  1155. <a name="l01246"></a>01246 
    1156. 

  1156. <a name="l01248"></a><a class="code" href="a00270.html#bc6ef82fe9c28ace2ef6b78abb43ffb8">01248</a>     <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="a00270.html#bc6ef82fe9c28ace2ef6b78abb43ffb8">internal_forward_task</a>(buffer_operation *op) {
    1157. 

  1157. <a name="l01249"></a>01249         <span class="keywordflow">if</span> (this-&gt;my_reserved || !this-&gt;item_valid(this-&gt;my_tail-1)) {
    1158. 

  1158. <a name="l01250"></a>01250             __TBB_store_with_release(op-&gt;status, FAILED);
    1159. 

  1159. <a name="l01251"></a>01251             this-&gt;forwarder_busy = <span class="keyword">false</span>;
    1160. 

  1160. <a name="l01252"></a>01252             <span class="keywordflow">return</span>;
    1161. 

  1161. <a name="l01253"></a>01253         }
    1162. 

  1162. <a name="l01254"></a>01254         T i_copy;
    1163. 

  1163. <a name="l01255"></a>01255         <a class="code" href="a00344.html">task</a> * last_task = NULL;
    1164. 

  1164. <a name="l01256"></a>01256         size_type counter = my_successors.size();
    1165. 

  1165. <a name="l01257"></a>01257         <span class="comment">// Try forwarding, giving each successor a chance</span>
    1166. 

  1166. <a name="l01258"></a>01258         <span class="keywordflow">while</span> (counter&gt;0 &amp;&amp; !this-&gt;buffer_empty() &amp;&amp; this-&gt;item_valid(this-&gt;my_tail-1)) {
    1167. 

  1167. <a name="l01259"></a>01259             this-&gt;fetch_back(i_copy);
    1168. 

  1168. <a name="l01260"></a>01260             <a class="code" href="a00344.html">task</a> *new_task = my_successors.try_put_task(i_copy);
    1169. 

  1169. <a name="l01261"></a>01261             last_task = combine_tasks(last_task, new_task);
    1170. 

  1170. <a name="l01262"></a>01262             <span class="keywordflow">if</span>(new_task) {
    1171. 

  1171. <a name="l01263"></a>01263                 this-&gt;invalidate_back();
    1172. 

  1172. <a name="l01264"></a>01264                 --(this-&gt;my_tail);
    1173. 

  1173. <a name="l01265"></a>01265             }
    1174. 

  1174. <a name="l01266"></a>01266             --counter;
    1175. 

  1175. <a name="l01267"></a>01267         }
    1176. 

  1176. <a name="l01268"></a>01268         op-&gt;ltask = last_task;  <span class="comment">// return task</span>
    1177. 

  1177. <a name="l01269"></a>01269         <span class="keywordflow">if</span> (last_task &amp;&amp; !counter) {
    1178. 

  1178. <a name="l01270"></a>01270             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1179. 

  1179. <a name="l01271"></a>01271         }
    1180. 

  1180. <a name="l01272"></a>01272         <span class="keywordflow">else</span> {
    1181. 

  1181. <a name="l01273"></a>01273             __TBB_store_with_release(op-&gt;status, FAILED);
    1182. 

  1182. <a name="l01274"></a>01274             forwarder_busy = <span class="keyword">false</span>;
    1183. 

  1183. <a name="l01275"></a>01275         }
    1184. 

  1184. <a name="l01276"></a>01276     }
    1185. 

  1185. <a name="l01277"></a>01277 
    1186. 

  1186. <a name="l01278"></a>01278     <span class="keyword">virtual</span> <span class="keywordtype">void</span> internal_push(buffer_operation *op) {
    1187. 

  1187. <a name="l01279"></a>01279         this-&gt;push_back(*(op-&gt;elem));
    1188. 

  1188. <a name="l01280"></a>01280         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1189. 

  1189. <a name="l01281"></a>01281     }
    1190. 

  1190. <a name="l01282"></a>01282 
    1191. 

  1191. <a name="l01283"></a>01283     <span class="keyword">virtual</span> <span class="keywordtype">void</span> internal_pop(buffer_operation *op) {
    1192. 

  1192. <a name="l01284"></a>01284         <span class="keywordflow">if</span>(this-&gt;pop_back(*(op-&gt;elem))) {
    1193. 

  1193. <a name="l01285"></a>01285             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1194. 

  1194. <a name="l01286"></a>01286         }
    1195. 

  1195. <a name="l01287"></a>01287         <span class="keywordflow">else</span> {
    1196. 

  1196. <a name="l01288"></a>01288             __TBB_store_with_release(op-&gt;status, FAILED);
    1197. 

  1197. <a name="l01289"></a>01289         }
    1198. 

  1198. <a name="l01290"></a>01290     }
    1199. 

  1199. <a name="l01291"></a>01291 
    1200. 

  1200. <a name="l01292"></a>01292     <span class="keyword">virtual</span> <span class="keywordtype">void</span> internal_reserve(buffer_operation *op) {
    1201. 

  1201. <a name="l01293"></a>01293         <span class="keywordflow">if</span>(this-&gt;reserve_front(*(op-&gt;elem))) {
    1202. 

  1202. <a name="l01294"></a>01294             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1203. 

  1203. <a name="l01295"></a>01295         }
    1204. 

  1204. <a name="l01296"></a>01296         <span class="keywordflow">else</span> {
    1205. 

  1205. <a name="l01297"></a>01297             __TBB_store_with_release(op-&gt;status, FAILED);
    1206. 

  1206. <a name="l01298"></a>01298         }
    1207. 

  1207. <a name="l01299"></a>01299     }
    1208. 

  1208. <a name="l01300"></a>01300 
    1209. 

  1209. <a name="l01301"></a>01301     <span class="keyword">virtual</span> <span class="keywordtype">void</span> internal_consume(buffer_operation *op) {
    1210. 

  1210. <a name="l01302"></a>01302         this-&gt;consume_front();
    1211. 

  1211. <a name="l01303"></a>01303         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1212. 

  1212. <a name="l01304"></a>01304     }
    1213. 

  1213. <a name="l01305"></a>01305 
    1214. 

  1214. <a name="l01306"></a>01306     <span class="keyword">virtual</span> <span class="keywordtype">void</span> internal_release(buffer_operation *op) {
    1215. 

  1215. <a name="l01307"></a>01307         this-&gt;release_front();
    1216. 

  1216. <a name="l01308"></a>01308         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1217. 

  1217. <a name="l01309"></a>01309     }
    1218. 

  1218. <a name="l01310"></a>01310 
    1219. 

  1219. <a name="l01311"></a>01311 <span class="keyword">public</span>:
    1220. 

  1220. <a name="l01313"></a><a class="code" href="a00270.html#5fe4b79f780586ff66e002ce32a5c60d">01313</a>     <a class="code" href="a00270.html#5fe4b79f780586ff66e002ce32a5c60d">buffer_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g ) : <a class="code" href="a00296.html">graph_node</a>(g), reservable_item_buffer&lt;T&gt;(),
    1221. 

  1221. <a name="l01314"></a>01314         my_parent( g.root_task() ), forwarder_busy(false) {
    1222. 

  1222. <a name="l01315"></a>01315         my_successors.set_owner(<span class="keyword">this</span>);
    1223. 

  1223. <a name="l01316"></a>01316         my_aggregator.initialize_handler(my_handler(<span class="keyword">this</span>));
    1224. 

  1224. <a name="l01317"></a>01317     }
    1225. 

  1225. <a name="l01318"></a>01318 
    1226. 

  1226. <a name="l01320"></a><a class="code" href="a00270.html#03ad7b85a8341437f584af06ad050cdc">01320</a>     <a class="code" href="a00270.html#5fe4b79f780586ff66e002ce32a5c60d">buffer_node</a>( <span class="keyword">const</span> buffer_node&amp; src ) : <a class="code" href="a00296.html">graph_node</a>(src.my_graph),
    1227. 

  1227. <a name="l01321"></a>01321         reservable_item_buffer&lt;T&gt;(), <a class="code" href="a00328.html">receiver</a>&lt;T&gt;(), <a class="code" href="a00334.html">sender</a>&lt;T&gt;(),
    1228. 

  1228. <a name="l01322"></a>01322         my_parent( src.my_parent ) {
    1229. 

  1229. <a name="l01323"></a>01323         forwarder_busy = <span class="keyword">false</span>;
    1230. 

  1230. <a name="l01324"></a>01324         my_successors.set_owner(<span class="keyword">this</span>);
    1231. 

  1231. <a name="l01325"></a>01325         my_aggregator.initialize_handler(my_handler(<span class="keyword">this</span>));
    1232. 

  1232. <a name="l01326"></a>01326     }
    1233. 

  1233. <a name="l01327"></a>01327 
    1234. 

  1234. <a name="l01328"></a>01328     <span class="keyword">virtual</span> ~buffer_node() {}
    1235. 

  1235. <a name="l01329"></a>01329 
    1236. 

  1236. <a name="l01330"></a>01330     <span class="comment">//</span>
    1237. 

  1237. <a name="l01331"></a>01331     <span class="comment">// message sender implementation</span>
    1238. 

  1238. <a name="l01332"></a>01332     <span class="comment">//</span>
    1239. 

  1239. <a name="l01333"></a>01333 
    1240. 

  1240. <a name="l01335"></a>01335 
    1241. 

  1241. <a name="l01336"></a><a class="code" href="a00270.html#f8bf4944ede4fc106423d67715beb695">01336</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00270.html#f8bf4944ede4fc106423d67715beb695">register_successor</a>( <a class="code" href="a00328.html">receiver&lt;output_type&gt;</a> &amp;r ) {
    1242. 

  1242. <a name="l01337"></a>01337         buffer_operation op_data(reg_succ);
    1243. 

  1243. <a name="l01338"></a>01338         op_data.r = &amp;r;
    1244. 

  1244. <a name="l01339"></a>01339         my_aggregator.execute(&amp;op_data);
    1245. 

  1245. <a name="l01340"></a>01340         (void)enqueue_forwarding_task(op_data);
    1246. 

  1246. <a name="l01341"></a>01341         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1247. 

  1247. <a name="l01342"></a>01342     }
    1248. 

  1248. <a name="l01343"></a>01343 
    1249. 

  1249. <a name="l01345"></a>01345 
    1250. 

  1250. <a name="l01347"></a><a class="code" href="a00270.html#2074da0e39b9477c32897d6e5786196f">01347</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00270.html#2074da0e39b9477c32897d6e5786196f">remove_successor</a>( <a class="code" href="a00328.html">receiver&lt;output_type&gt;</a> &amp;r ) {
    1251. 

  1251. <a name="l01348"></a>01348         r.<a class="code" href="a00328.html#3bc76547b51d3c9b633e3987d22dce95">remove_predecessor</a>(*<span class="keyword">this</span>);
    1252. 

  1252. <a name="l01349"></a>01349         buffer_operation op_data(rem_succ);
    1253. 

  1253. <a name="l01350"></a>01350         op_data.r = &amp;r;
    1254. 

  1254. <a name="l01351"></a>01351         my_aggregator.execute(&amp;op_data);
    1255. 

  1255. <a name="l01352"></a>01352         <span class="comment">// even though this operation does not cause a forward, if we are the handler, and</span>
    1256. 

  1256. <a name="l01353"></a>01353         <span class="comment">// a forward is scheduled, we may be the first to reach this point after the aggregator,</span>
    1257. 

  1257. <a name="l01354"></a>01354         <span class="comment">// and so should check for the task.</span>
    1258. 

  1258. <a name="l01355"></a>01355         (void)enqueue_forwarding_task(op_data);
    1259. 

  1259. <a name="l01356"></a>01356         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1260. 

  1260. <a name="l01357"></a>01357     }
    1261. 

  1261. <a name="l01358"></a>01358 
    1262. 

  1262. <a name="l01360"></a>01360 
    1263. 

  1263. <a name="l01362"></a><a class="code" href="a00270.html#aeb8aec46ca99ca022356a792c46735e">01362</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00270.html#aeb8aec46ca99ca022356a792c46735e">try_get</a>( T &amp;v ) {
    1264. 

  1264. <a name="l01363"></a>01363         buffer_operation op_data(req_item);
    1265. 

  1265. <a name="l01364"></a>01364         op_data.elem = &amp;v;
    1266. 

  1266. <a name="l01365"></a>01365         my_aggregator.execute(&amp;op_data);
    1267. 

  1267. <a name="l01366"></a>01366         (void)enqueue_forwarding_task(op_data);
    1268. 

  1268. <a name="l01367"></a>01367         <span class="keywordflow">return</span> (op_data.status==SUCCEEDED);
    1269. 

  1269. <a name="l01368"></a>01368     }
    1270. 

  1270. <a name="l01369"></a>01369 
    1271. 

  1271. <a name="l01371"></a>01371 
    1272. 

  1272. <a name="l01373"></a><a class="code" href="a00270.html#1cc889bb6c38bcb81757d0ebbc3a5e64">01373</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00270.html#1cc889bb6c38bcb81757d0ebbc3a5e64">try_reserve</a>( T &amp;v ) {
    1273. 

  1273. <a name="l01374"></a>01374         buffer_operation op_data(res_item);
    1274. 

  1274. <a name="l01375"></a>01375         op_data.elem = &amp;v;
    1275. 

  1275. <a name="l01376"></a>01376         my_aggregator.execute(&amp;op_data);
    1276. 

  1276. <a name="l01377"></a>01377         (void)enqueue_forwarding_task(op_data);
    1277. 

  1277. <a name="l01378"></a>01378         <span class="keywordflow">return</span> (op_data.status==SUCCEEDED);
    1278. 

  1278. <a name="l01379"></a>01379     }
    1279. 

  1279. <a name="l01380"></a>01380 
    1280. 

  1280. <a name="l01382"></a>01382 
    1281. 

  1281. <a name="l01383"></a><a class="code" href="a00270.html#2c8e8f2f5f4ff5be27136cc1184a3c3e">01383</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00270.html#2c8e8f2f5f4ff5be27136cc1184a3c3e">try_release</a>() {
    1282. 

  1282. <a name="l01384"></a>01384         buffer_operation op_data(rel_res);
    1283. 

  1283. <a name="l01385"></a>01385         my_aggregator.execute(&amp;op_data);
    1284. 

  1284. <a name="l01386"></a>01386         (void)enqueue_forwarding_task(op_data);
    1285. 

  1285. <a name="l01387"></a>01387         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1286. 

  1286. <a name="l01388"></a>01388     }
    1287. 

  1287. <a name="l01389"></a>01389 
    1288. 

  1288. <a name="l01391"></a>01391 
    1289. 

  1289. <a name="l01392"></a><a class="code" href="a00270.html#8ef07c434eb763d947a7b4e80c086a49">01392</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00270.html#8ef07c434eb763d947a7b4e80c086a49">try_consume</a>() {
    1290. 

  1290. <a name="l01393"></a>01393         buffer_operation op_data(con_res);
    1291. 

  1291. <a name="l01394"></a>01394         my_aggregator.execute(&amp;op_data);
    1292. 

  1292. <a name="l01395"></a>01395         (void)enqueue_forwarding_task(op_data);
    1293. 

  1293. <a name="l01396"></a>01396         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1294. 

  1294. <a name="l01397"></a>01397     }
    1295. 

  1295. <a name="l01398"></a>01398 
    1296. 

  1296. <a name="l01399"></a>01399 <span class="keyword">protected</span>:
    1297. 

  1297. <a name="l01400"></a>01400 
    1298. 

  1298. <a name="l01401"></a><a class="code" href="a00270.html#621bab40a858d214db69ef08d88b67c1">01401</a>     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00270.html#621bab40a858d214db69ef08d88b67c1">run_and_put_task</a>;
    1299. 

  1299. <a name="l01402"></a>01402     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    1300. 

  1300. <a name="l01403"></a>01403     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    1301. 

  1301. <a name="l01405"></a><a class="code" href="a00270.html#84d939049fa8c3205aec91ced0980e03">01405</a>     <span class="comment">/* override */</span> <a class="code" href="a00344.html">task</a> *<a class="code" href="a00270.html#84d939049fa8c3205aec91ced0980e03">try_put_task</a>(<span class="keyword">const</span> T &amp;t) {
    1302. 

  1302. <a name="l01406"></a>01406         buffer_operation op_data(t, put_item);
    1303. 

  1303. <a name="l01407"></a>01407         my_aggregator.execute(&amp;op_data);
    1304. 

  1304. <a name="l01408"></a>01408         <a class="code" href="a00344.html">task</a> *ft = grab_forwarding_task(op_data);
    1305. 

  1305. <a name="l01409"></a>01409         <span class="keywordflow">if</span>(!ft) {
    1306. 

  1306. <a name="l01410"></a>01410             ft = SUCCESSFULLY_ENQUEUED;
    1307. 

  1307. <a name="l01411"></a>01411         }
    1308. 

  1308. <a name="l01412"></a>01412         <span class="keywordflow">return</span> ft;
    1309. 

  1309. <a name="l01413"></a>01413     }
    1310. 

  1310. <a name="l01414"></a>01414 
    1311. 

  1311. <a name="l01415"></a>01415     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() {
    1312. 

  1312. <a name="l01416"></a>01416         reservable_item_buffer&lt;T, A&gt;::reset();
    1313. 

  1313. <a name="l01417"></a>01417         forwarder_busy = <span class="keyword">false</span>;
    1314. 

  1314. <a name="l01418"></a>01418     }
    1315. 

  1315. <a name="l01419"></a>01419 
    1316. 

  1316. <a name="l01420"></a>01420     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset_receiver() {
    1317. 

  1317. <a name="l01421"></a>01421         <span class="comment">// nothing to do; no predecesor_cache</span>
    1318. 

  1318. <a name="l01422"></a>01422     }
    1319. 

  1319. <a name="l01423"></a>01423 
    1320. 

  1320. <a name="l01424"></a>01424 };  <span class="comment">// buffer_node</span>
    1321. 

  1321. <a name="l01425"></a>01425 
    1322. 

  1322. <a name="l01427"></a>01427 <span class="keyword">template</span> &lt;<span class="keyword">typename</span> T, <span class="keyword">typename</span> A=cache_aligned_allocator&lt;T&gt; &gt;
    1323. 

  1323. <a name="l01428"></a><a class="code" href="a00320.html">01428</a> <span class="keyword">class </span><a class="code" href="a00320.html">queue_node</a> : <span class="keyword">public</span> buffer_node&lt;T, A&gt; {
    1324. 

  1324. <a name="l01429"></a>01429 <span class="keyword">protected</span>:
    1325. 

  1325. <a name="l01430"></a>01430     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::size_type</a> size_type;
    1326. 

  1326. <a name="l01431"></a>01431     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::buffer_operation</a> queue_operation;
    1327. 

  1327. <a name="l01432"></a>01432 
    1328. 

  1328. <a name="l01433"></a>01433     <span class="keyword">enum</span> op_stat {WAIT=0, SUCCEEDED, FAILED};
    1329. 

  1329. <a name="l01434"></a>01434 
    1330. 

  1330. <a name="l01435"></a><a class="code" href="a00320.html#8eecd6591d7565cbb5b7f1e37bf97979">01435</a>     <span class="comment">/* override */</span> <span class="keywordtype">void</span> <a class="code" href="a00320.html#8eecd6591d7565cbb5b7f1e37bf97979">internal_forward_task</a>(queue_operation *op) {
    1331. 

  1331. <a name="l01436"></a>01436         <span class="keywordflow">if</span> (this-&gt;my_reserved || !this-&gt;item_valid(this-&gt;my_head)) {
    1332. 

  1332. <a name="l01437"></a>01437             __TBB_store_with_release(op-&gt;status, FAILED);
    1333. 

  1333. <a name="l01438"></a>01438             this-&gt;forwarder_busy = <span class="keyword">false</span>;
    1334. 

  1334. <a name="l01439"></a>01439             <span class="keywordflow">return</span>;
    1335. 

  1335. <a name="l01440"></a>01440         }
    1336. 

  1336. <a name="l01441"></a>01441         T i_copy;
    1337. 

  1337. <a name="l01442"></a>01442         <a class="code" href="a00344.html">task</a> *last_task = NULL;
    1338. 

  1338. <a name="l01443"></a>01443         size_type counter = this-&gt;my_successors.size();
    1339. 

  1339. <a name="l01444"></a>01444         <span class="comment">// Keep trying to send items while there is at least one accepting successor</span>
    1340. 

  1340. <a name="l01445"></a>01445         <span class="keywordflow">while</span> (counter&gt;0 &amp;&amp; this-&gt;item_valid(this-&gt;my_head)) {
    1341. 

  1341. <a name="l01446"></a>01446             this-&gt;fetch_front(i_copy);
    1342. 

  1342. <a name="l01447"></a>01447             <a class="code" href="a00344.html">task</a> *new_task = this-&gt;my_successors.try_put_task(i_copy);
    1343. 

  1343. <a name="l01448"></a>01448             <span class="keywordflow">if</span>(new_task) {
    1344. 

  1344. <a name="l01449"></a>01449                 this-&gt;invalidate_front();
    1345. 

  1345. <a name="l01450"></a>01450                 ++(this-&gt;my_head);
    1346. 

  1346. <a name="l01451"></a>01451                 last_task = combine_tasks(last_task, new_task);
    1347. 

  1347. <a name="l01452"></a>01452             }
    1348. 

  1348. <a name="l01453"></a>01453             --counter;
    1349. 

  1349. <a name="l01454"></a>01454         }
    1350. 

  1350. <a name="l01455"></a>01455         op-&gt;ltask = last_task;
    1351. 

  1351. <a name="l01456"></a>01456         <span class="keywordflow">if</span> (last_task &amp;&amp; !counter)
    1352. 

  1352. <a name="l01457"></a>01457             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1353. 

  1353. <a name="l01458"></a>01458         <span class="keywordflow">else</span> {
    1354. 

  1354. <a name="l01459"></a>01459             __TBB_store_with_release(op-&gt;status, FAILED);
    1355. 

  1355. <a name="l01460"></a>01460             this-&gt;forwarder_busy = <span class="keyword">false</span>;
    1356. 

  1356. <a name="l01461"></a>01461         }
    1357. 

  1357. <a name="l01462"></a>01462     }
    1358. 

  1358. <a name="l01463"></a>01463 
    1359. 

  1359. <a name="l01464"></a>01464     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_pop(queue_operation *op) {
    1360. 

  1360. <a name="l01465"></a>01465         <span class="keywordflow">if</span> ( this-&gt;my_reserved || !this-&gt;item_valid(this-&gt;my_head)){
    1361. 

  1361. <a name="l01466"></a>01466             __TBB_store_with_release(op-&gt;status, FAILED);
    1362. 

  1362. <a name="l01467"></a>01467         }
    1363. 

  1363. <a name="l01468"></a>01468         <span class="keywordflow">else</span> {
    1364. 

  1364. <a name="l01469"></a>01469             this-&gt;pop_front(*(op-&gt;elem));
    1365. 

  1365. <a name="l01470"></a>01470             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1366. 

  1366. <a name="l01471"></a>01471         }
    1367. 

  1367. <a name="l01472"></a>01472     }
    1368. 

  1368. <a name="l01473"></a>01473     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_reserve(queue_operation *op) {
    1369. 

  1369. <a name="l01474"></a>01474         <span class="keywordflow">if</span> (this-&gt;my_reserved || !this-&gt;item_valid(this-&gt;my_head)) {
    1370. 

  1370. <a name="l01475"></a>01475             __TBB_store_with_release(op-&gt;status, FAILED);
    1371. 

  1371. <a name="l01476"></a>01476         }
    1372. 

  1372. <a name="l01477"></a>01477         <span class="keywordflow">else</span> {
    1373. 

  1373. <a name="l01478"></a>01478             this-&gt;my_reserved = <span class="keyword">true</span>;
    1374. 

  1374. <a name="l01479"></a>01479             this-&gt;fetch_front(*(op-&gt;elem));
    1375. 

  1375. <a name="l01480"></a>01480             this-&gt;invalidate_front();
    1376. 

  1376. <a name="l01481"></a>01481             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1377. 

  1377. <a name="l01482"></a>01482         }
    1378. 

  1378. <a name="l01483"></a>01483     }
    1379. 

  1379. <a name="l01484"></a>01484     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_consume(queue_operation *op) {
    1380. 

  1380. <a name="l01485"></a>01485         this-&gt;consume_front();
    1381. 

  1381. <a name="l01486"></a>01486         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1382. 

  1382. <a name="l01487"></a>01487     }
    1383. 

  1383. <a name="l01488"></a>01488 
    1384. 

  1384. <a name="l01489"></a>01489 <span class="keyword">public</span>:
    1385. 

  1385. <a name="l01490"></a><a class="code" href="a00320.html#1e71030845210b6c4c7380eb9e11a2ac">01490</a>     <span class="keyword">typedef</span> T <a class="code" href="a00320.html#1e71030845210b6c4c7380eb9e11a2ac">input_type</a>;
    1386. 

  1386. <a name="l01491"></a><a class="code" href="a00320.html#25b5a53ab1f9a342644fa3759bc0b1ad">01491</a>     <span class="keyword">typedef</span> T output_type;
    1387. 

  1387. <a name="l01492"></a><a class="code" href="a00320.html#5e2fdd33c45d44549dee9c1638e19898">01492</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    1388. 

  1388. <a name="l01493"></a><a class="code" href="a00320.html#f35076a19f256f9e7a61bed77ca1ccc5">01493</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    1389. 

  1389. <a name="l01494"></a>01494 
    1390. 

  1390. <a name="l01496"></a><a class="code" href="a00320.html#c716593a92448b0f429d1f3a38e67996">01496</a>     <a class="code" href="a00320.html#c716593a92448b0f429d1f3a38e67996">queue_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g ) : buffer_node&lt;T, A&gt;(g) {}
    1391. 

  1391. <a name="l01497"></a>01497 
    1392. 

  1392. <a name="l01499"></a><a class="code" href="a00320.html#0226762d9ebba28311b7b1518d948ab1">01499</a>     <a class="code" href="a00320.html#c716593a92448b0f429d1f3a38e67996">queue_node</a>( <span class="keyword">const</span> <a class="code" href="a00320.html">queue_node</a>&amp; src) : buffer_node&lt;T, A&gt;(src) {}
    1393. 

  1393. <a name="l01500"></a>01500 };
    1394. 

  1394. <a name="l01501"></a>01501 
    1395. 

  1395. <a name="l01503"></a>01503 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T, <span class="keyword">typename</span> A=cache_aligned_allocator&lt;T&gt; &gt;
    1396. 

  1396. <a name="l01504"></a><a class="code" href="a00335.html">01504</a> <span class="keyword">class </span><a class="code" href="a00335.html">sequencer_node</a> : <span class="keyword">public</span> <a class="code" href="a00320.html">queue_node</a>&lt;T, A&gt; {
    1397. 

  1397. <a name="l01505"></a>01505     internal::function_body&lt; T, size_t &gt; *my_sequencer;
    1398. 

  1398. <a name="l01506"></a>01506 <span class="keyword">public</span>:
    1399. 

  1399. <a name="l01507"></a><a class="code" href="a00335.html#af629f26832ff4e476e240637a78bc0c">01507</a>     <span class="keyword">typedef</span> T <a class="code" href="a00335.html#af629f26832ff4e476e240637a78bc0c">input_type</a>;
    1400. 

  1400. <a name="l01508"></a><a class="code" href="a00335.html#ca026eaef70e35791c407323199031a7">01508</a>     <span class="keyword">typedef</span> T output_type;
    1401. 

  1401. <a name="l01509"></a><a class="code" href="a00335.html#8127e36811832563fe1e9bc3ba391f79">01509</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    1402. 

  1402. <a name="l01510"></a><a class="code" href="a00335.html#795f3ee75f133b9d3b159172fc4a197f">01510</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    1403. 

  1403. <a name="l01511"></a>01511 
    1404. 

  1404. <a name="l01513"></a>01513     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Sequencer &gt;
    1405. 

  1405. <a name="l01514"></a><a class="code" href="a00335.html#7e71cbdf78f989091bc162b89bee7e66">01514</a>     <a class="code" href="a00335.html#7e71cbdf78f989091bc162b89bee7e66">sequencer_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g, <span class="keyword">const</span> Sequencer&amp; s ) : <a class="code" href="a00320.html">queue_node</a>&lt;T, A&gt;(g),
    1406. 

  1406. <a name="l01515"></a>01515         my_sequencer(new internal::function_body_leaf&lt; T, size_t, Sequencer&gt;(s) ) {}
    1407. 

  1407. <a name="l01516"></a>01516 
    1408. 

  1408. <a name="l01518"></a><a class="code" href="a00335.html#b38e7a070552960384bcc1d91af13a5c">01518</a>     <a class="code" href="a00335.html#7e71cbdf78f989091bc162b89bee7e66">sequencer_node</a>( <span class="keyword">const</span> <a class="code" href="a00335.html">sequencer_node</a>&amp; src ) : <a class="code" href="a00320.html">queue_node</a>&lt;T, A&gt;(src),
    1409. 

  1409. <a name="l01519"></a>01519         my_sequencer( src.my_sequencer-&gt;clone() ) {}
    1410. 

  1410. <a name="l01520"></a>01520 
    1411. 

  1411. <a name="l01522"></a><a class="code" href="a00335.html#93d3d8f6a72b3e1387047282116ed6ee">01522</a>     <a class="code" href="a00335.html#93d3d8f6a72b3e1387047282116ed6ee">~sequencer_node</a>() { <span class="keyword">delete</span> my_sequencer; }
    1412. 

  1412. <a name="l01523"></a>01523 <span class="keyword">protected</span>:
    1413. 

  1413. <a name="l01524"></a>01524     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::size_type</a> size_type;
    1414. 

  1414. <a name="l01525"></a>01525     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::buffer_operation</a> sequencer_operation;
    1415. 

  1415. <a name="l01526"></a>01526 
    1416. 

  1416. <a name="l01527"></a>01527     <span class="keyword">enum</span> op_stat {WAIT=0, SUCCEEDED, FAILED};
    1417. 

  1417. <a name="l01528"></a>01528 
    1418. 

  1418. <a name="l01529"></a>01529 <span class="keyword">private</span>:
    1419. 

  1419. <a name="l01530"></a>01530     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_push(sequencer_operation *op) {
    1420. 

  1420. <a name="l01531"></a>01531         size_type tag = (*my_sequencer)(*(op-&gt;elem));
    1421. 

  1421. <a name="l01532"></a>01532 
    1422. 

  1422. <a name="l01533"></a>01533         this-&gt;my_tail = (tag+1 &gt; this-&gt;my_tail) ? tag+1 : this-&gt;my_tail;
    1423. 

  1423. <a name="l01534"></a>01534 
    1424. 

  1424. <a name="l01535"></a>01535         <span class="keywordflow">if</span>(this-&gt;size() &gt; this-&gt;capacity())
    1425. 

  1425. <a name="l01536"></a>01536             this-&gt;grow_my_array(this-&gt;size());  <span class="comment">// tail already has 1 added to it</span>
    1426. 

  1426. <a name="l01537"></a>01537         this-&gt;item(tag) = std::make_pair( *(op-&gt;elem), <span class="keyword">true</span> );
    1427. 

  1427. <a name="l01538"></a>01538         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1428. 

  1428. <a name="l01539"></a>01539     }
    1429. 

  1429. <a name="l01540"></a>01540 };
    1430. 

  1430. <a name="l01541"></a>01541 
    1431. 

  1431. <a name="l01543"></a>01543 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T, <span class="keyword">typename</span> Compare = std::less&lt;T&gt;, <span class="keyword">typename</span> A=cache_aligned_allocator&lt;T&gt; &gt;
    1432. 

  1432. <a name="l01544"></a><a class="code" href="a00319.html">01544</a> <span class="keyword">class </span><a class="code" href="a00319.html">priority_queue_node</a> : <span class="keyword">public</span> buffer_node&lt;T, A&gt; {
    1433. 

  1433. <a name="l01545"></a>01545 <span class="keyword">public</span>:
    1434. 

  1434. <a name="l01546"></a><a class="code" href="a00319.html#b2829b518979874ad3d2a939e14ae7bd">01546</a>     <span class="keyword">typedef</span> T <a class="code" href="a00319.html#b2829b518979874ad3d2a939e14ae7bd">input_type</a>;
    1435. 

  1435. <a name="l01547"></a><a class="code" href="a00319.html#2cb099b590246b6bc93cc15e78c6ee5c">01547</a>     <span class="keyword">typedef</span> T output_type;
    1436. 

  1436. <a name="l01548"></a>01548     <span class="keyword">typedef</span> <a class="code" href="a00270.html">buffer_node&lt;T,A&gt;</a> <a class="code" href="a00270.html">base_type</a>;
    1437. 

  1437. <a name="l01549"></a><a class="code" href="a00319.html#fdea783bf9d5a4c98e794ac7e0f84ccf">01549</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    1438. 

  1438. <a name="l01550"></a><a class="code" href="a00319.html#09ab5064ca8192e68c03da47603e68eb">01550</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    1439. 

  1439. <a name="l01551"></a>01551 
    1440. 

  1440. <a name="l01553"></a><a class="code" href="a00319.html#497ec2612615249bf5a294eb1b7b93b3">01553</a>     <a class="code" href="a00319.html#497ec2612615249bf5a294eb1b7b93b3">priority_queue_node</a>( <a class="code" href="a00295.html">graph</a> &amp;g ) : buffer_node&lt;T, A&gt;(g), mark(0) {}
    1441. 

  1441. <a name="l01554"></a>01554 
    1442. 

  1442. <a name="l01556"></a><a class="code" href="a00319.html#17a4f66e23d54100b64805405e905d62">01556</a>     <a class="code" href="a00319.html#497ec2612615249bf5a294eb1b7b93b3">priority_queue_node</a>( <span class="keyword">const</span> <a class="code" href="a00319.html">priority_queue_node</a> &amp;src ) : buffer_node&lt;T, A&gt;(src), mark(0) {}
    1443. 

  1443. <a name="l01557"></a>01557 
    1444. 

  1444. <a name="l01558"></a>01558 <span class="keyword">protected</span>:
    1445. 

  1445. <a name="l01559"></a>01559 
    1446. 

  1446. <a name="l01560"></a>01560     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() {
    1447. 

  1447. <a name="l01561"></a>01561         mark = 0;
    1448. 

  1448. <a name="l01562"></a>01562         base_type::reset();
    1449. 

  1449. <a name="l01563"></a>01563     }
    1450. 

  1450. <a name="l01564"></a>01564 
    1451. 

  1451. <a name="l01565"></a>01565     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::size_type</a> size_type;
    1452. 

  1452. <a name="l01566"></a>01566     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::item_type</a> item_type;
    1453. 

  1453. <a name="l01567"></a>01567     <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="a00270.html">buffer_node&lt;T, A&gt;::buffer_operation</a> prio_operation;
    1454. 

  1454. <a name="l01568"></a>01568 
    1455. 

  1455. <a name="l01569"></a>01569     <span class="keyword">enum</span> op_stat {WAIT=0, SUCCEEDED, FAILED};
    1456. 

  1456. <a name="l01570"></a>01570 
    1457. 

  1457. <a name="l01571"></a>01571     <span class="comment">/* override */</span> <span class="keywordtype">void</span> handle_operations(prio_operation *op_list) {
    1458. 

  1458. <a name="l01572"></a>01572         prio_operation *tmp = op_list <span class="comment">/*, *pop_list*/</span> ;
    1459. 

  1459. <a name="l01573"></a>01573         <span class="keywordtype">bool</span> try_forwarding=<span class="keyword">false</span>;
    1460. 

  1460. <a name="l01574"></a>01574         <span class="keywordflow">while</span> (op_list) {
    1461. 

  1461. <a name="l01575"></a>01575             tmp = op_list;
    1462. 

  1462. <a name="l01576"></a>01576             op_list = op_list-&gt;next;
    1463. 

  1463. <a name="l01577"></a>01577             <span class="keywordflow">switch</span> (tmp-&gt;type) {
    1464. 

  1464. <a name="l01578"></a>01578             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::reg_succ: this-&gt;<a class="code" href="a00270.html#df21388252b8963e839dca29d2c67ea5">internal_reg_succ</a>(tmp); try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1465. 

  1465. <a name="l01579"></a>01579             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::rem_succ: this-&gt;<a class="code" href="a00270.html#6b6cf76dff80fd679251da93351c1291">internal_rem_succ</a>(tmp); <span class="keywordflow">break</span>;
    1466. 

  1466. <a name="l01580"></a>01580             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::put_item: internal_push(tmp); try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1467. 

  1467. <a name="l01581"></a>01581             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::try_fwd_task: <a class="code" href="a00319.html#9249c25621a6ee7a741a6b7eac710ba4">internal_forward_task</a>(tmp); <span class="keywordflow">break</span>;
    1468. 

  1468. <a name="l01582"></a>01582             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::rel_res: internal_release(tmp); try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1469. 

  1469. <a name="l01583"></a>01583             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::con_res: internal_consume(tmp); try_forwarding = <span class="keyword">true</span>; <span class="keywordflow">break</span>;
    1470. 

  1470. <a name="l01584"></a>01584             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::req_item: internal_pop(tmp); <span class="keywordflow">break</span>;
    1471. 

  1471. <a name="l01585"></a>01585             <span class="keywordflow">case</span> buffer_node&lt;T, A&gt;::res_item: internal_reserve(tmp); <span class="keywordflow">break</span>;
    1472. 

  1472. <a name="l01586"></a>01586             }
    1473. 

  1473. <a name="l01587"></a>01587         }
    1474. 

  1474. <a name="l01588"></a>01588         <span class="comment">// process pops!  for now, no special pop processing</span>
    1475. 

  1475. <a name="l01589"></a>01589         <span class="keywordflow">if</span> (mark&lt;this-&gt;my_tail) heapify();
    1476. 

  1476. <a name="l01590"></a>01590         <span class="keywordflow">if</span> (try_forwarding &amp;&amp; !this-&gt;forwarder_busy) {
    1477. 

  1477. <a name="l01591"></a>01591             this-&gt;forwarder_busy = <span class="keyword">true</span>;
    1478. 

  1478. <a name="l01592"></a>01592             task *new_task = <span class="keyword">new</span>(task::allocate_additional_child_of(*(this-&gt;my_parent))) internal::
    1479. 

  1479. <a name="l01593"></a>01593                     forward_task_bypass
    1480. 

  1480. <a name="l01594"></a>01594                     &lt; buffer_node&lt;input_type, A&gt; &gt;(*<span class="keyword">this</span>);
    1481. 

  1481. <a name="l01595"></a>01595             <span class="comment">// tmp should point to the last item handled by the aggregator.  This is the operation</span>
    1482. 

  1482. <a name="l01596"></a>01596             <span class="comment">// the handling thread enqueued.  So modifying that record will be okay.</span>
    1483. 

  1483. <a name="l01597"></a>01597             <a class="code" href="a00344.html">tbb::task</a> *tmp1 = tmp-&gt;ltask;
    1484. 

  1484. <a name="l01598"></a>01598             tmp-&gt;ltask = combine_tasks(tmp1, new_task);
    1485. 

  1485. <a name="l01599"></a>01599         }
    1486. 

  1486. <a name="l01600"></a>01600     }
    1487. 

  1487. <a name="l01601"></a>01601 
    1488. 

  1488. <a name="l01603"></a><a class="code" href="a00319.html#9249c25621a6ee7a741a6b7eac710ba4">01603</a>     <span class="comment">/* override */</span> <span class="keywordtype">void</span> <a class="code" href="a00319.html#9249c25621a6ee7a741a6b7eac710ba4">internal_forward_task</a>(prio_operation *op) {
    1489. 

  1489. <a name="l01604"></a>01604         T i_copy;
    1490. 

  1490. <a name="l01605"></a>01605         <a class="code" href="a00344.html">task</a> * last_task = NULL; <span class="comment">// flagged when a successor accepts</span>
    1491. 

  1491. <a name="l01606"></a>01606         size_type counter = this-&gt;my_successors.size();
    1492. 

  1492. <a name="l01607"></a>01607 
    1493. 

  1493. <a name="l01608"></a>01608         <span class="keywordflow">if</span> (this-&gt;my_reserved || this-&gt;my_tail == 0) {
    1494. 

  1494. <a name="l01609"></a>01609             __TBB_store_with_release(op-&gt;status, FAILED);
    1495. 

  1495. <a name="l01610"></a>01610             this-&gt;forwarder_busy = <span class="keyword">false</span>;
    1496. 

  1496. <a name="l01611"></a>01611             <span class="keywordflow">return</span>;
    1497. 

  1497. <a name="l01612"></a>01612         }
    1498. 

  1498. <a name="l01613"></a>01613         <span class="comment">// Keep trying to send while there exists an accepting successor</span>
    1499. 

  1499. <a name="l01614"></a>01614         <span class="keywordflow">while</span> (counter&gt;0 &amp;&amp; this-&gt;my_tail &gt; 0) {
    1500. 

  1500. <a name="l01615"></a>01615             i_copy = this-&gt;my_array[0].first;
    1501. 

  1501. <a name="l01616"></a>01616             <a class="code" href="a00344.html">task</a> * new_task = this-&gt;my_successors.try_put_task(i_copy);
    1502. 

  1502. <a name="l01617"></a>01617             last_task = combine_tasks(last_task, new_task);
    1503. 

  1503. <a name="l01618"></a>01618             <span class="keywordflow">if</span> ( new_task ) {
    1504. 

  1504. <a name="l01619"></a>01619                  <span class="keywordflow">if</span> (mark == this-&gt;my_tail) --mark;
    1505. 

  1505. <a name="l01620"></a>01620                 --(this-&gt;my_tail);
    1506. 

  1506. <a name="l01621"></a>01621                 this-&gt;my_array[0].first=this-&gt;my_array[this-&gt;my_tail].first;
    1507. 

  1507. <a name="l01622"></a>01622                 <span class="keywordflow">if</span> (this-&gt;my_tail &gt; 1) <span class="comment">// don't reheap for heap of size 1</span>
    1508. 

  1508. <a name="l01623"></a>01623                     reheap();
    1509. 

  1509. <a name="l01624"></a>01624             }
    1510. 

  1510. <a name="l01625"></a>01625             --counter;
    1511. 

  1511. <a name="l01626"></a>01626         }
    1512. 

  1512. <a name="l01627"></a>01627         op-&gt;ltask = last_task;
    1513. 

  1513. <a name="l01628"></a>01628         <span class="keywordflow">if</span> (last_task &amp;&amp; !counter)
    1514. 

  1514. <a name="l01629"></a>01629             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1515. 

  1515. <a name="l01630"></a>01630         <span class="keywordflow">else</span> {
    1516. 

  1516. <a name="l01631"></a>01631             __TBB_store_with_release(op-&gt;status, FAILED);
    1517. 

  1517. <a name="l01632"></a>01632             this-&gt;forwarder_busy = <span class="keyword">false</span>;
    1518. 

  1518. <a name="l01633"></a>01633         }
    1519. 

  1519. <a name="l01634"></a>01634     }
    1520. 

  1520. <a name="l01635"></a>01635 
    1521. 

  1521. <a name="l01636"></a>01636     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_push(prio_operation *op) {
    1522. 

  1522. <a name="l01637"></a>01637         <span class="keywordflow">if</span> ( this-&gt;my_tail &gt;= this-&gt;my_array_size )
    1523. 

  1523. <a name="l01638"></a>01638             this-&gt;grow_my_array( this-&gt;my_tail + 1 );
    1524. 

  1524. <a name="l01639"></a>01639         this-&gt;my_array[this-&gt;my_tail] = std::make_pair( *(op-&gt;elem), <span class="keyword">true</span> );
    1525. 

  1525. <a name="l01640"></a>01640         ++(this-&gt;my_tail);
    1526. 

  1526. <a name="l01641"></a>01641         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1527. 

  1527. <a name="l01642"></a>01642     }
    1528. 

  1528. <a name="l01643"></a>01643 
    1529. 

  1529. <a name="l01644"></a>01644     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_pop(prio_operation *op) {
    1530. 

  1530. <a name="l01645"></a>01645         <span class="keywordflow">if</span> ( this-&gt;my_reserved == <span class="keyword">true</span> || this-&gt;my_tail == 0 ) {
    1531. 

  1531. <a name="l01646"></a>01646             __TBB_store_with_release(op-&gt;status, FAILED);
    1532. 

  1532. <a name="l01647"></a>01647         }
    1533. 

  1533. <a name="l01648"></a>01648         <span class="keywordflow">else</span> {
    1534. 

  1534. <a name="l01649"></a>01649             <span class="keywordflow">if</span> (mark&lt;this-&gt;my_tail &amp;&amp;
    1535. 

  1535. <a name="l01650"></a>01650                 compare(this-&gt;my_array[0].first,
    1536. 

  1536. <a name="l01651"></a>01651                         this-&gt;my_array[this-&gt;my_tail-1].first)) {
    1537. 

  1537. <a name="l01652"></a>01652                 <span class="comment">// there are newly pushed elems; last one higher than top</span>
    1538. 

  1538. <a name="l01653"></a>01653                 <span class="comment">// copy the data</span>
    1539. 

  1539. <a name="l01654"></a>01654                 *(op-&gt;elem) = this-&gt;my_array[this-&gt;my_tail-1].first;
    1540. 

  1540. <a name="l01655"></a>01655                 --(this-&gt;my_tail);
    1541. 

  1541. <a name="l01656"></a>01656                 __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1542. 

  1542. <a name="l01657"></a>01657             }
    1543. 

  1543. <a name="l01658"></a>01658             <span class="keywordflow">else</span> { <span class="comment">// extract and push the last element down heap</span>
    1544. 

  1544. <a name="l01659"></a>01659                 *(op-&gt;elem) = this-&gt;my_array[0].first; <span class="comment">// copy the data</span>
    1545. 

  1545. <a name="l01660"></a>01660                 if (mark == this-&gt;my_tail) --mark;
    1546. 

  1546. <a name="l01661"></a>01661                 --(this-&gt;my_tail);
    1547. 

  1547. <a name="l01662"></a>01662                 __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1548. 

  1548. <a name="l01663"></a>01663                 this-&gt;my_array[0].first=this-&gt;my_array[this-&gt;my_tail].first;
    1549. 

  1549. <a name="l01664"></a>01664                 <span class="keywordflow">if</span> (this-&gt;my_tail &gt; 1) <span class="comment">// don't reheap for heap of size 1</span>
    1550. 

  1550. <a name="l01665"></a>01665                     reheap();
    1551. 

  1551. <a name="l01666"></a>01666             }
    1552. 

  1552. <a name="l01667"></a>01667         }
    1553. 

  1553. <a name="l01668"></a>01668     }
    1554. 

  1554. <a name="l01669"></a>01669     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_reserve(prio_operation *op) {
    1555. 

  1555. <a name="l01670"></a>01670         <span class="keywordflow">if</span> (this-&gt;my_reserved == <span class="keyword">true</span> || this-&gt;my_tail == 0) {
    1556. 

  1556. <a name="l01671"></a>01671             __TBB_store_with_release(op-&gt;status, FAILED);
    1557. 

  1557. <a name="l01672"></a>01672         }
    1558. 

  1558. <a name="l01673"></a>01673         <span class="keywordflow">else</span> {
    1559. 

  1559. <a name="l01674"></a>01674             this-&gt;my_reserved = <span class="keyword">true</span>;
    1560. 

  1560. <a name="l01675"></a>01675             *(op-&gt;elem) = reserved_item = this-&gt;my_array[0].first;
    1561. 

  1561. <a name="l01676"></a>01676             if (mark == this-&gt;my_tail) --mark;
    1562. 

  1562. <a name="l01677"></a>01677             --(this-&gt;my_tail);
    1563. 

  1563. <a name="l01678"></a>01678             __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1564. 

  1564. <a name="l01679"></a>01679             this-&gt;my_array[0].first = this-&gt;my_array[this-&gt;my_tail].first;
    1565. 

  1565. <a name="l01680"></a>01680             <span class="keywordflow">if</span> (this-&gt;my_tail &gt; 1) <span class="comment">// don't reheap for heap of size 1</span>
    1566. 

  1566. <a name="l01681"></a>01681                 reheap();
    1567. 

  1567. <a name="l01682"></a>01682         }
    1568. 

  1568. <a name="l01683"></a>01683     }
    1569. 

  1569. <a name="l01684"></a>01684     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_consume(prio_operation *op) {
    1570. 

  1570. <a name="l01685"></a>01685         this-&gt;my_reserved = <span class="keyword">false</span>;
    1571. 

  1571. <a name="l01686"></a>01686         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1572. 

  1572. <a name="l01687"></a>01687     }
    1573. 

  1573. <a name="l01688"></a>01688     <span class="comment">/* override */</span> <span class="keywordtype">void</span> internal_release(prio_operation *op) {
    1574. 

  1574. <a name="l01689"></a>01689         <span class="keywordflow">if</span> (this-&gt;my_tail &gt;= this-&gt;my_array_size)
    1575. 

  1575. <a name="l01690"></a>01690             this-&gt;grow_my_array( this-&gt;my_tail + 1 );
    1576. 

  1576. <a name="l01691"></a>01691         this-&gt;my_array[this-&gt;my_tail] = std::make_pair(reserved_item, <span class="keyword">true</span>);
    1577. 

  1577. <a name="l01692"></a>01692         ++(this-&gt;my_tail);
    1578. 

  1578. <a name="l01693"></a>01693         this-&gt;my_reserved = <span class="keyword">false</span>;
    1579. 

  1579. <a name="l01694"></a>01694         __TBB_store_with_release(op-&gt;status, SUCCEEDED);
    1580. 

  1580. <a name="l01695"></a>01695         heapify();
    1581. 

  1581. <a name="l01696"></a>01696     }
    1582. 

  1582. <a name="l01697"></a>01697 <span class="keyword">private</span>:
    1583. 

  1583. <a name="l01698"></a>01698     Compare compare;
    1584. 

  1584. <a name="l01699"></a>01699     size_type mark;
    1585. 

  1585. <a name="l01700"></a>01700     <a class="code" href="a00319.html#b2829b518979874ad3d2a939e14ae7bd">input_type</a> reserved_item;
    1586. 

  1586. <a name="l01701"></a>01701 
    1587. 

  1587. <a name="l01702"></a>01702     <span class="keywordtype">void</span> heapify() {
    1588. 

  1588. <a name="l01703"></a>01703         <span class="keywordflow">if</span> (!mark) mark = 1;
    1589. 

  1589. <a name="l01704"></a>01704         <span class="keywordflow">for</span> (; mark&lt;this-&gt;my_tail; ++mark) { <span class="comment">// for each unheaped element</span>
    1590. 

  1590. <a name="l01705"></a>01705             size_type cur_pos = mark;
    1591. 

  1591. <a name="l01706"></a>01706             <a class="code" href="a00319.html#b2829b518979874ad3d2a939e14ae7bd">input_type</a> to_place = this-&gt;my_array[mark].first;
    1592. 

  1592. <a name="l01707"></a>01707             <span class="keywordflow">do</span> { <span class="comment">// push to_place up the heap</span>
    1593. 

  1593. <a name="l01708"></a>01708                 size_type parent = (cur_pos-1)&gt;&gt;1;
    1594. 

  1594. <a name="l01709"></a>01709                 <span class="keywordflow">if</span> (!compare(this-&gt;my_array[parent].first, to_place))
    1595. 

  1595. <a name="l01710"></a>01710                     <span class="keywordflow">break</span>;
    1596. 

  1596. <a name="l01711"></a>01711                 this-&gt;my_array[cur_pos].first = this-&gt;my_array[parent].first;
    1597. 

  1597. <a name="l01712"></a>01712                 cur_pos = parent;
    1598. 

  1598. <a name="l01713"></a>01713             } <span class="keywordflow">while</span>( cur_pos );
    1599. 

  1599. <a name="l01714"></a>01714             this-&gt;my_array[cur_pos].first = to_place;
    1600. 

  1600. <a name="l01715"></a>01715         }
    1601. 

  1601. <a name="l01716"></a>01716     }
    1602. 

  1602. <a name="l01717"></a>01717 
    1603. 

  1603. <a name="l01718"></a>01718     <span class="keywordtype">void</span> reheap() {
    1604. 

  1604. <a name="l01719"></a>01719         size_type cur_pos=0, child=1;
    1605. 

  1605. <a name="l01720"></a>01720         <span class="keywordflow">while</span> (child &lt; mark) {
    1606. 

  1606. <a name="l01721"></a>01721             size_type target = child;
    1607. 

  1607. <a name="l01722"></a>01722             <span class="keywordflow">if</span> (child+1&lt;mark &amp;&amp;
    1608. 

  1608. <a name="l01723"></a>01723                 compare(this-&gt;my_array[child].first,
    1609. 

  1609. <a name="l01724"></a>01724                         this-&gt;my_array[child+1].first))
    1610. 

  1610. <a name="l01725"></a>01725                 ++target;
    1611. 

  1611. <a name="l01726"></a>01726             <span class="comment">// target now has the higher priority child</span>
    1612. 

  1612. <a name="l01727"></a>01727             <span class="keywordflow">if</span> (compare(this-&gt;my_array[target].first,
    1613. 

  1613. <a name="l01728"></a>01728                         this-&gt;my_array[this-&gt;my_tail].first))
    1614. 

  1614. <a name="l01729"></a>01729                 <span class="keywordflow">break</span>;
    1615. 

  1615. <a name="l01730"></a>01730             this-&gt;my_array[cur_pos].first = this-&gt;my_array[target].first;
    1616. 

  1616. <a name="l01731"></a>01731             cur_pos = target;
    1617. 

  1617. <a name="l01732"></a>01732             child = (cur_pos&lt;&lt;1)+1;
    1618. 

  1618. <a name="l01733"></a>01733         }
    1619. 

  1619. <a name="l01734"></a>01734         this-&gt;my_array[cur_pos].first = this-&gt;my_array[this-&gt;my_tail].first;
    1620. 

  1620. <a name="l01735"></a>01735     }
    1621. 

  1621. <a name="l01736"></a>01736 };
    1622. 

  1622. <a name="l01737"></a>01737 
    1623. 

  1623. <a name="l01739"></a>01739 
    1624. 

  1624. <a name="l01742"></a>01742 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    1625. 

  1625. <a name="l01743"></a><a class="code" href="a00299.html">01743</a> <span class="keyword">class </span><a class="code" href="a00299.html">limiter_node</a> : <span class="keyword">public</span> <a class="code" href="a00296.html">graph_node</a>, <span class="keyword">public</span> <a class="code" href="a00328.html">receiver</a>&lt; T &gt;, <span class="keyword">public</span> <a class="code" href="a00334.html">sender</a>&lt; T &gt; {
    1626. 

  1626. <a name="l01744"></a>01744 <span class="keyword">protected</span>:
    1627. 

  1627. <a name="l01745"></a>01745     <span class="keyword">using</span> graph_node::my_graph;
    1628. 

  1628. <a name="l01746"></a>01746 <span class="keyword">public</span>:
    1629. 

  1629. <a name="l01747"></a><a class="code" href="a00299.html#035196d3c9240ef041f528ebcde8baa7">01747</a>     <span class="keyword">typedef</span> T <a class="code" href="a00299.html#035196d3c9240ef041f528ebcde8baa7">input_type</a>;
    1630. 

  1630. <a name="l01748"></a><a class="code" href="a00299.html#6e67fc480147c0b88a483b85db6457b0">01748</a>     <span class="keyword">typedef</span> T output_type;
    1631. 

  1631. <a name="l01749"></a><a class="code" href="a00299.html#f89fcf44f38eb33f965ee5362d3e68e9">01749</a>     <span class="keyword">typedef</span> <a class="code" href="a00334.html">sender&lt; input_type &gt;</a> <a class="code" href="a00334.html">predecessor_type</a>;
    1632. 

  1632. <a name="l01750"></a><a class="code" href="a00299.html#e8945e4dd6ea759ff9e4735da13f12ef">01750</a>     <span class="keyword">typedef</span> <a class="code" href="a00328.html">receiver&lt; output_type &gt;</a> <a class="code" href="a00328.html">successor_type</a>;
    1633. 

  1633. <a name="l01751"></a>01751 
    1634. 

  1634. <a name="l01752"></a>01752 <span class="keyword">private</span>:
    1635. 

  1635. <a name="l01753"></a>01753     <a class="code" href="a00344.html">task</a> *my_root_task;
    1636. 

  1636. <a name="l01754"></a>01754     size_t my_threshold;
    1637. 

  1637. <a name="l01755"></a>01755     size_t my_count;
    1638. 

  1638. <a name="l01756"></a>01756     internal::predecessor_cache&lt; T &gt; my_predecessors;
    1639. 

  1639. <a name="l01757"></a>01757     <a class="code" href="a00338.html">spin_mutex</a> my_mutex;
    1640. 

  1640. <a name="l01758"></a>01758     internal::broadcast_cache&lt; T &gt; my_successors;
    1641. 

  1641. <a name="l01759"></a>01759     <span class="keywordtype">int</span> init_decrement_predecessors;
    1642. 

  1642. <a name="l01760"></a>01760 
    1643. 

  1643. <a name="l01761"></a>01761     <span class="keyword">friend</span> <span class="keyword">class </span>internal::forward_task_bypass&lt; limiter_node&lt;T&gt; &gt;;
    1644. 

  1644. <a name="l01762"></a>01762 
    1645. 

  1645. <a name="l01763"></a>01763     <span class="comment">// Let decrementer call decrement_counter()</span>
    1646. 

  1646. <a name="l01764"></a>01764     <span class="keyword">friend</span> <span class="keyword">class </span>internal::decrementer&lt; limiter_node&lt;T&gt; &gt;;
    1647. 

  1647. <a name="l01765"></a>01765 
    1648. 

  1648. <a name="l01766"></a>01766     <span class="comment">// only returns a valid task pointer or NULL, never SUCCESSFULLY_ENQUEUED</span>
    1649. 

  1649. <a name="l01767"></a>01767     <a class="code" href="a00344.html">task</a> * decrement_counter() {
    1650. 

  1650. <a name="l01768"></a>01768         <a class="code" href="a00299.html#035196d3c9240ef041f528ebcde8baa7">input_type</a> v;
    1651. 

  1651. <a name="l01769"></a>01769         <a class="code" href="a00344.html">task</a> *rval = NULL;
    1652. 

  1652. <a name="l01770"></a>01770 
    1653. 

  1653. <a name="l01771"></a>01771         <span class="comment">// If we can't get / put an item immediately then drop the count</span>
    1654. 

  1654. <a name="l01772"></a>01772         <span class="keywordflow">if</span> ( my_predecessors.get_item( v ) == <span class="keyword">false</span>
    1655. 

  1655. <a name="l01773"></a>01773              || (rval = my_successors.try_put_task(v)) == NULL ) {
    1656. 

  1656. <a name="l01774"></a>01774             <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    1657. 

  1657. <a name="l01775"></a>01775             --my_count;
    1658. 

  1658. <a name="l01776"></a>01776             <span class="keywordflow">if</span> ( !my_predecessors.empty() ) {
    1659. 

  1659. <a name="l01777"></a>01777                 <a class="code" href="a00344.html">task</a> *rtask = <span class="keyword">new</span> ( task::allocate_additional_child_of( *my_root_task ) )
    1660. 

  1660. <a name="l01778"></a>01778                     internal::forward_task_bypass&lt; limiter_node&lt;T&gt; &gt;( *this );
    1661. 

  1661. <a name="l01779"></a>01779                 __TBB_ASSERT(!rval, <span class="stringliteral">"Have two tasks to handle"</span>);
    1662. 

  1662. <a name="l01780"></a>01780                 <span class="keywordflow">return</span> rtask;
    1663. 

  1663. <a name="l01781"></a>01781             }
    1664. 

  1664. <a name="l01782"></a>01782         }
    1665. 

  1665. <a name="l01783"></a>01783         <span class="keywordflow">return</span> rval;
    1666. 

  1666. <a name="l01784"></a>01784     }
    1667. 

  1667. <a name="l01785"></a>01785 
    1668. 

  1668. <a name="l01786"></a>01786     <span class="keywordtype">void</span> forward() {
    1669. 

  1669. <a name="l01787"></a>01787         {
    1670. 

  1670. <a name="l01788"></a>01788             <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    1671. 

  1671. <a name="l01789"></a>01789             <span class="keywordflow">if</span> ( my_count &lt; my_threshold )
    1672. 

  1672. <a name="l01790"></a>01790                 ++my_count;
    1673. 

  1673. <a name="l01791"></a>01791             <span class="keywordflow">else</span>
    1674. 

  1674. <a name="l01792"></a>01792                 <span class="keywordflow">return</span>;
    1675. 

  1675. <a name="l01793"></a>01793         }
    1676. 

  1676. <a name="l01794"></a>01794         task * rtask = decrement_counter();
    1677. 

  1677. <a name="l01795"></a>01795         <span class="keywordflow">if</span>(rtask) <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>(*rtask);
    1678. 

  1678. <a name="l01796"></a>01796     }
    1679. 

  1679. <a name="l01797"></a>01797 
    1680. 

  1680. <a name="l01798"></a>01798     task *forward_task() {
    1681. 

  1681. <a name="l01799"></a>01799         spin_mutex::scoped_lock lock(my_mutex);
    1682. 

  1682. <a name="l01800"></a>01800         <span class="keywordflow">if</span> ( my_count &gt;= my_threshold )
    1683. 

  1683. <a name="l01801"></a>01801             <span class="keywordflow">return</span> NULL;
    1684. 

  1684. <a name="l01802"></a>01802         ++my_count;
    1685. 

  1685. <a name="l01803"></a>01803         task * rtask = decrement_counter();
    1686. 

  1686. <a name="l01804"></a>01804         <span class="keywordflow">return</span> rtask;
    1687. 

  1687. <a name="l01805"></a>01805     }
    1688. 

  1688. <a name="l01806"></a>01806 
    1689. 

  1689. <a name="l01807"></a>01807 <span class="keyword">public</span>:
    1690. 

  1690. <a name="l01809"></a><a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">01809</a>     internal::decrementer&lt; limiter_node&lt;T&gt; &gt; <a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">decrement</a>;
    1691. 

  1691. <a name="l01810"></a>01810 
    1692. 

  1692. <a name="l01812"></a><a class="code" href="a00299.html#831b06576f46fe2bf3ed0f86b793c1b2">01812</a>     <a class="code" href="a00299.html#831b06576f46fe2bf3ed0f86b793c1b2">limiter_node</a>(<a class="code" href="a00295.html">graph</a> &amp;g, size_t threshold, <span class="keywordtype">int</span> num_decrement_predecessors=0) :
    1693. 

  1693. <a name="l01813"></a>01813         <a class="code" href="a00296.html">graph_node</a>(g), my_root_task(g.root_task()), my_threshold(threshold), my_count(0),
    1694. 

  1694. <a name="l01814"></a>01814         init_decrement_predecessors(num_decrement_predecessors),
    1695. 

  1695. <a name="l01815"></a>01815         <a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">decrement</a>(num_decrement_predecessors)
    1696. 

  1696. <a name="l01816"></a>01816     {
    1697. 

  1697. <a name="l01817"></a>01817         my_predecessors.set_owner(<span class="keyword">this</span>);
    1698. 

  1698. <a name="l01818"></a>01818         my_successors.set_owner(<span class="keyword">this</span>);
    1699. 

  1699. <a name="l01819"></a>01819         <a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">decrement</a>.set_owner(<span class="keyword">this</span>);
    1700. 

  1700. <a name="l01820"></a>01820     }
    1701. 

  1701. <a name="l01821"></a>01821 
    1702. 

  1702. <a name="l01823"></a><a class="code" href="a00299.html#83d3ab884543b070ee5b345a87f241fa">01823</a>     <a class="code" href="a00299.html#831b06576f46fe2bf3ed0f86b793c1b2">limiter_node</a>( <span class="keyword">const</span> limiter_node&amp; src ) :
    1703. 

  1703. <a name="l01824"></a>01824         <a class="code" href="a00296.html">graph_node</a>(src.my_graph), <a class="code" href="a00328.html">receiver</a>&lt;T&gt;(), <a class="code" href="a00334.html">sender</a>&lt;T&gt;(),
    1704. 

  1704. <a name="l01825"></a>01825         my_root_task(src.my_root_task), my_threshold(src.my_threshold), my_count(0),
    1705. 

  1705. <a name="l01826"></a>01826         init_decrement_predecessors(src.init_decrement_predecessors),
    1706. 

  1706. <a name="l01827"></a>01827         <a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">decrement</a>(src.init_decrement_predecessors)
    1707. 

  1707. <a name="l01828"></a>01828     {
    1708. 

  1708. <a name="l01829"></a>01829         my_predecessors.set_owner(<span class="keyword">this</span>);
    1709. 

  1709. <a name="l01830"></a>01830         my_successors.set_owner(<span class="keyword">this</span>);
    1710. 

  1710. <a name="l01831"></a>01831         <a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">decrement</a>.set_owner(<span class="keyword">this</span>);
    1711. 

  1711. <a name="l01832"></a>01832     }
    1712. 

  1712. <a name="l01833"></a>01833 
    1713. 

  1713. <a name="l01835"></a><a class="code" href="a00299.html#c76561d8d871b4769876988a4de12a9b">01835</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00299.html#c76561d8d871b4769876988a4de12a9b">register_successor</a>( <a class="code" href="a00328.html">receiver&lt;output_type&gt;</a> &amp;r ) {
    1714. 

  1714. <a name="l01836"></a>01836         my_successors.register_successor(r);
    1715. 

  1715. <a name="l01837"></a>01837         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1716. 

  1716. <a name="l01838"></a>01838     }
    1717. 

  1717. <a name="l01839"></a>01839 
    1718. 

  1718. <a name="l01841"></a>01841 
    1719. 

  1719. <a name="l01842"></a><a class="code" href="a00299.html#275e328063c121b3e506ccef2a825d28">01842</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00299.html#275e328063c121b3e506ccef2a825d28">remove_successor</a>( <a class="code" href="a00328.html">receiver&lt;output_type&gt;</a> &amp;r ) {
    1720. 

  1720. <a name="l01843"></a>01843         r.<a class="code" href="a00328.html#3bc76547b51d3c9b633e3987d22dce95">remove_predecessor</a>(*<span class="keyword">this</span>);
    1721. 

  1721. <a name="l01844"></a>01844         my_successors.remove_successor(r);
    1722. 

  1722. <a name="l01845"></a>01845         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1723. 

  1723. <a name="l01846"></a>01846     }
    1724. 

  1724. <a name="l01847"></a>01847 
    1725. 

  1725. <a name="l01849"></a><a class="code" href="a00299.html#de70a0e88ce7655d8c14b6af57f7496f">01849</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00299.html#de70a0e88ce7655d8c14b6af57f7496f">register_predecessor</a>( <a class="code" href="a00334.html">predecessor_type</a> &amp;src ) {
    1726. 

  1726. <a name="l01850"></a>01850         <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    1727. 

  1727. <a name="l01851"></a>01851         my_predecessors.add( src );
    1728. 

  1728. <a name="l01852"></a>01852         <span class="keywordflow">if</span> ( my_count &lt; my_threshold &amp;&amp; !my_successors.empty() ) {
    1729. 

  1729. <a name="l01853"></a>01853             <a class="code" href="a00344.html#8365d063c0cc9d7bd616bca47256b93c">task::enqueue</a>( * <span class="keyword">new</span> ( task::allocate_additional_child_of( *my_root_task ) )
    1730. 

  1730. <a name="l01854"></a>01854                            internal::
    1731. 

  1731. <a name="l01855"></a>01855                            forward_task_bypass
    1732. 

  1732. <a name="l01856"></a>01856                            &lt; <a class="code" href="a00299.html">limiter_node&lt;T&gt;</a> &gt;( *<span class="keyword">this</span> ) );
    1733. 

  1733. <a name="l01857"></a>01857         }
    1734. 

  1734. <a name="l01858"></a>01858         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1735. 

  1735. <a name="l01859"></a>01859     }
    1736. 

  1736. <a name="l01860"></a>01860 
    1737. 

  1737. <a name="l01862"></a><a class="code" href="a00299.html#c530e7b469454e2340460795f2da3317">01862</a>     <span class="comment">/* override */</span> <span class="keywordtype">bool</span> <a class="code" href="a00299.html#c530e7b469454e2340460795f2da3317">remove_predecessor</a>( <a class="code" href="a00334.html">predecessor_type</a> &amp;src ) {
    1738. 

  1738. <a name="l01863"></a>01863         my_predecessors.remove( src );
    1739. 

  1739. <a name="l01864"></a>01864         <span class="keywordflow">return</span> <span class="keyword">true</span>;
    1740. 

  1740. <a name="l01865"></a>01865     }
    1741. 

  1741. <a name="l01866"></a>01866 
    1742. 

  1742. <a name="l01867"></a>01867 <span class="keyword">protected</span>:
    1743. 

  1743. <a name="l01868"></a>01868 
    1744. 

  1744. <a name="l01869"></a><a class="code" href="a00299.html#621bab40a858d214db69ef08d88b67c1">01869</a>     <span class="keyword">template</span>&lt; <span class="keyword">typename</span> R, <span class="keyword">typename</span> B &gt; <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="a00299.html#621bab40a858d214db69ef08d88b67c1">run_and_put_task</a>;
    1745. 

  1745. <a name="l01870"></a>01870     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::broadcast_cache;
    1746. 

  1746. <a name="l01871"></a>01871     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> X, <span class="keyword">typename</span> Y&gt; <span class="keyword">friend</span> <span class="keyword">class </span>internal::round_robin_cache;
    1747. 

  1747. <a name="l01873"></a><a class="code" href="a00299.html#ca2ff9f3379b8b5a3de2ababbca4a476">01873</a>     <span class="comment">/* override */</span> <a class="code" href="a00344.html">task</a> *<a class="code" href="a00299.html#ca2ff9f3379b8b5a3de2ababbca4a476">try_put_task</a>( <span class="keyword">const</span> T &amp;t ) {
    1748. 

  1748. <a name="l01874"></a>01874         {
    1749. 

  1749. <a name="l01875"></a>01875             <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    1750. 

  1750. <a name="l01876"></a>01876             <span class="keywordflow">if</span> ( my_count &gt;= my_threshold )
    1751. 

  1751. <a name="l01877"></a>01877                 <span class="keywordflow">return</span> NULL;
    1752. 

  1752. <a name="l01878"></a>01878             <span class="keywordflow">else</span>
    1753. 

  1753. <a name="l01879"></a>01879                 ++my_count;
    1754. 

  1754. <a name="l01880"></a>01880         }
    1755. 

  1755. <a name="l01881"></a>01881 
    1756. 

  1756. <a name="l01882"></a>01882         <a class="code" href="a00344.html">task</a> * rtask = my_successors.try_put_task(t);
    1757. 

  1757. <a name="l01883"></a>01883 
    1758. 

  1758. <a name="l01884"></a>01884         <span class="keywordflow">if</span> ( !rtask ) {  <span class="comment">// try_put_task failed.</span>
    1759. 

  1759. <a name="l01885"></a>01885             <a class="code" href="a00339.html">spin_mutex::scoped_lock</a> lock(my_mutex);
    1760. 

  1760. <a name="l01886"></a>01886             --my_count;
    1761. 

  1761. <a name="l01887"></a>01887             <span class="keywordflow">if</span> ( !my_predecessors.empty() ) {
    1762. 

  1762. <a name="l01888"></a>01888                 rtask = <span class="keyword">new</span> ( task::allocate_additional_child_of( *my_root_task ) )
    1763. 

  1763. <a name="l01889"></a>01889                     internal::forward_task_bypass&lt; limiter_node&lt;T&gt; &gt;( *this );
    1764. 

  1764. <a name="l01890"></a>01890             }
    1765. 

  1765. <a name="l01891"></a>01891         }
    1766. 

  1766. <a name="l01892"></a>01892         <span class="keywordflow">return</span> rtask;
    1767. 

  1767. <a name="l01893"></a>01893     }
    1768. 

  1768. <a name="l01894"></a>01894 
    1769. 

  1769. <a name="l01895"></a>01895     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset() {
    1770. 

  1770. <a name="l01896"></a>01896         my_count = 0;
    1771. 

  1771. <a name="l01897"></a>01897         my_predecessors.reset();
    1772. 

  1772. <a name="l01898"></a>01898         <a class="code" href="a00299.html#a3344b2461966631b6ee34b79fb105c7">decrement</a>.reset_receiver();
    1773. 

  1773. <a name="l01899"></a>01899     }
    1774. 

  1774. <a name="l01900"></a>01900 
    1775. 

  1775. <a name="l01901"></a>01901     <span class="comment">/*override*/</span><span class="keywordtype">void</span> reset_receiver() { my_predecessors.reset(); }
    1776. 

  1776. <a name="l01902"></a>01902 };  <span class="comment">// limiter_node</span>
    1777. 

  1777. <a name="l01903"></a>01903 
    1778. 

  1778. <a name="l01904"></a>01904 <span class="preprocessor">#include "internal/_flow_graph_join_impl.h"</span>
    1779. 

  1779. <a name="l01905"></a>01905 
    1780. 

  1780. <a name="l01906"></a>01906 <span class="keyword">using</span> internal::reserving_port;
    1781. 

  1781. <a name="l01907"></a>01907 <span class="keyword">using</span> internal::queueing_port;
    1782. 

  1782. <a name="l01908"></a>01908 <span class="keyword">using</span> internal::tag_matching_port;
    1783. 

  1783. <a name="l01909"></a>01909 <span class="keyword">using</span> internal::input_port;
    1784. 

  1784. <a name="l01910"></a>01910 <span class="keyword">using</span> internal::tag_value;
    1785. 

  1785. <a name="l01911"></a>01911 <span class="keyword">using</span> internal::NO_TAG;
    1786. 

  1786. <a name="l01912"></a>01912 
    1787. 

  1787. <a name="l01913"></a>01913 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> OutputTuple, graph_buffer_policy JP=queueing&gt; <span class="keyword">class </span>join_node;
    1788. 

  1788. <a name="l01914"></a>01914 
    1789. 

  1789. <a name="l01915"></a>01915 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> OutputTuple&gt;
    1790. 

  1790. <a name="l01916"></a>01916 <span class="keyword">class </span>join_node&lt;OutputTuple,reserving&gt;: <span class="keyword">public</span> internal::unfolded_join_node&lt;tbb::flow::tuple_size&lt;OutputTuple&gt;::value, reserving_port, OutputTuple, reserving&gt; {
    1791. 

  1791. <a name="l01917"></a>01917 <span class="keyword">private</span>:
    1792. 

  1792. <a name="l01918"></a>01918     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;OutputTuple&gt;::value;
    1793. 

  1793. <a name="l01919"></a>01919     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::unfolded_join_node&lt;N, reserving_port, OutputTuple, reserving&gt; unfolded_type;
    1794. 

  1794. <a name="l01920"></a>01920 <span class="keyword">public</span>:
    1795. 

  1795. <a name="l01921"></a>01921     <span class="keyword">typedef</span> OutputTuple output_type;
    1796. 

  1796. <a name="l01922"></a>01922     <span class="keyword">typedef</span> <span class="keyword">typename</span> unfolded_type::input_ports_type input_ports_type;
    1797. 

  1797. <a name="l01923"></a>01923     join_node(graph &amp;g) : unfolded_type(g) { }
    1798. 

  1798. <a name="l01924"></a>01924     join_node(<span class="keyword">const</span> join_node &amp;other) : unfolded_type(other) {}
    1799. 

  1799. <a name="l01925"></a>01925 };
    1800. 

  1800. <a name="l01926"></a>01926 
    1801. 

  1801. <a name="l01927"></a>01927 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> OutputTuple&gt;
    1802. 

  1802. <a name="l01928"></a>01928 <span class="keyword">class </span>join_node&lt;OutputTuple,queueing&gt;: <span class="keyword">public</span> internal::unfolded_join_node&lt;tbb::flow::tuple_size&lt;OutputTuple&gt;::value, queueing_port, OutputTuple, queueing&gt; {
    1803. 

  1803. <a name="l01929"></a>01929 <span class="keyword">private</span>:
    1804. 

  1804. <a name="l01930"></a>01930     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;OutputTuple&gt;::value;
    1805. 

  1805. <a name="l01931"></a>01931     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::unfolded_join_node&lt;N, queueing_port, OutputTuple, queueing&gt; unfolded_type;
    1806. 

  1806. <a name="l01932"></a>01932 <span class="keyword">public</span>:
    1807. 

  1807. <a name="l01933"></a>01933     <span class="keyword">typedef</span> OutputTuple output_type;
    1808. 

  1808. <a name="l01934"></a>01934     <span class="keyword">typedef</span> <span class="keyword">typename</span> unfolded_type::input_ports_type input_ports_type;
    1809. 

  1809. <a name="l01935"></a>01935     join_node(graph &amp;g) : unfolded_type(g) { }
    1810. 

  1810. <a name="l01936"></a>01936     join_node(<span class="keyword">const</span> join_node &amp;other) : unfolded_type(other) {}
    1811. 

  1811. <a name="l01937"></a>01937 };
    1812. 

  1812. <a name="l01938"></a>01938 
    1813. 

  1813. <a name="l01939"></a>01939 <span class="comment">// template for tag_matching join_node</span>
    1814. 

  1814. <a name="l01940"></a>01940 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> OutputTuple&gt;
    1815. 

  1815. <a name="l01941"></a>01941 <span class="keyword">class </span>join_node&lt;OutputTuple, tag_matching&gt; : <span class="keyword">public</span> internal::unfolded_join_node&lt;tbb::flow::tuple_size&lt;OutputTuple&gt;::value,
    1816. 

  1816. <a name="l01942"></a>01942       tag_matching_port, OutputTuple, tag_matching&gt; {
    1817. 

  1817. <a name="l01943"></a>01943 <span class="keyword">private</span>:
    1818. 

  1818. <a name="l01944"></a>01944     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;OutputTuple&gt;::value;
    1819. 

  1819. <a name="l01945"></a>01945     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::unfolded_join_node&lt;N, tag_matching_port, OutputTuple, tag_matching&gt; unfolded_type;
    1820. 

  1820. <a name="l01946"></a>01946 <span class="keyword">public</span>:
    1821. 

  1821. <a name="l01947"></a>01947     <span class="keyword">typedef</span> OutputTuple output_type;
    1822. 

  1822. <a name="l01948"></a>01948     <span class="keyword">typedef</span> <span class="keyword">typename</span> unfolded_type::input_ports_type input_ports_type;
    1823. 

  1823. <a name="l01949"></a>01949     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1&gt;
    1824. 

  1824. <a name="l01950"></a>01950     join_node(graph &amp;g, B0 b0, B1 b1) : unfolded_type(g, b0, b1) { }
    1825. 

  1825. <a name="l01951"></a>01951     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2&gt;
    1826. 

  1826. <a name="l01952"></a>01952     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2) : unfolded_type(g, b0, b1, b2) { }
    1827. 

  1827. <a name="l01953"></a>01953     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3&gt;
    1828. 

  1828. <a name="l01954"></a>01954     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3) : unfolded_type(g, b0, b1, b2, b3) { }
    1829. 

  1829. <a name="l01955"></a>01955     <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3, <span class="keyword">typename</span> B4&gt;
    1830. 

  1830. <a name="l01956"></a>01956     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3, B4 b4) : unfolded_type(g, b0, b1, b2, b3, b4) { }
    1831. 

  1831. <a name="l01957"></a>01957 <span class="preprocessor">#if __TBB_VARIADIC_MAX &gt;= 6</span>
    1832. 

  1832. <a name="l01958"></a>01958 <span class="preprocessor"></span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3, <span class="keyword">typename</span> B4, <span class="keyword">typename</span> B5&gt;
    1833. 

  1833. <a name="l01959"></a>01959     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3, B4 b4, B5 b5) : unfolded_type(g, b0, b1, b2, b3, b4, b5) { }
    1834. 

  1834. <a name="l01960"></a>01960 <span class="preprocessor">#endif</span>
    1835. 

  1835. <a name="l01961"></a>01961 <span class="preprocessor"></span><span class="preprocessor">#if __TBB_VARIADIC_MAX &gt;= 7</span>
    1836. 

  1836. <a name="l01962"></a>01962 <span class="preprocessor"></span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3, <span class="keyword">typename</span> B4, <span class="keyword">typename</span> B5, <span class="keyword">typename</span> B6&gt;
    1837. 

  1837. <a name="l01963"></a>01963     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3, B4 b4, B5 b5, B6 b6) : unfolded_type(g, b0, b1, b2, b3, b4, b5, b6) { }
    1838. 

  1838. <a name="l01964"></a>01964 <span class="preprocessor">#endif</span>
    1839. 

  1839. <a name="l01965"></a>01965 <span class="preprocessor"></span><span class="preprocessor">#if __TBB_VARIADIC_MAX &gt;= 8</span>
    1840. 

  1840. <a name="l01966"></a>01966 <span class="preprocessor"></span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3, <span class="keyword">typename</span> B4, <span class="keyword">typename</span> B5, <span class="keyword">typename</span> B6, <span class="keyword">typename</span> B7&gt;
    1841. 

  1841. <a name="l01967"></a>01967     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3, B4 b4, B5 b5, B6 b6, B7 b7) : unfolded_type(g, b0, b1, b2, b3, b4, b5, b6, b7) { }
    1842. 

  1842. <a name="l01968"></a>01968 <span class="preprocessor">#endif</span>
    1843. 

  1843. <a name="l01969"></a>01969 <span class="preprocessor"></span><span class="preprocessor">#if __TBB_VARIADIC_MAX &gt;= 9</span>
    1844. 

  1844. <a name="l01970"></a>01970 <span class="preprocessor"></span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3, <span class="keyword">typename</span> B4, <span class="keyword">typename</span> B5, <span class="keyword">typename</span> B6, <span class="keyword">typename</span> B7, <span class="keyword">typename</span> B8&gt;
    1845. 

  1845. <a name="l01971"></a>01971     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3, B4 b4, B5 b5, B6 b6, B7 b7, B8 b8) : unfolded_type(g, b0, b1, b2, b3, b4, b5, b6, b7, b8) { }
    1846. 

  1846. <a name="l01972"></a>01972 <span class="preprocessor">#endif</span>
    1847. 

  1847. <a name="l01973"></a>01973 <span class="preprocessor"></span><span class="preprocessor">#if __TBB_VARIADIC_MAX &gt;= 10</span>
    1848. 

  1848. <a name="l01974"></a>01974 <span class="preprocessor"></span>    <span class="keyword">template</span>&lt;<span class="keyword">typename</span> B0, <span class="keyword">typename</span> B1, <span class="keyword">typename</span> B2, <span class="keyword">typename</span> B3, <span class="keyword">typename</span> B4, <span class="keyword">typename</span> B5, <span class="keyword">typename</span> B6, <span class="keyword">typename</span> B7, <span class="keyword">typename</span> B8, <span class="keyword">typename</span> B9&gt;
    1849. 

  1849. <a name="l01975"></a>01975     join_node(graph &amp;g, B0 b0, B1 b1, B2 b2, B3 b3, B4 b4, B5 b5, B6 b6, B7 b7, B8 b8, B9 b9) : unfolded_type(g, b0, b1, b2, b3, b4, b5, b6, b7, b8, b9) { }
    1850. 

  1850. <a name="l01976"></a>01976 <span class="preprocessor">#endif</span>
    1851. 

  1851. <a name="l01977"></a>01977 <span class="preprocessor"></span>    join_node(<span class="keyword">const</span> join_node &amp;other) : unfolded_type(other) {}
    1852. 

  1852. <a name="l01978"></a>01978 };
    1853. 

  1853. <a name="l01979"></a>01979 
    1854. 

  1854. <a name="l01980"></a>01980 <span class="preprocessor">#if TBB_PREVIEW_GRAPH_NODES</span>
    1855. 

  1855. <a name="l01981"></a>01981 <span class="preprocessor"></span><span class="comment">// or node</span>
    1856. 

  1856. <a name="l01982"></a>01982 <span class="preprocessor">#include "internal/_flow_graph_or_impl.h"</span>
    1857. 

  1857. <a name="l01983"></a>01983 
    1858. 

  1858. <a name="l01984"></a>01984 <span class="keyword">template</span>&lt;<span class="keyword">typename</span> InputTuple&gt;
    1859. 

  1859. <a name="l01985"></a>01985 <span class="keyword">class </span>or_node : <span class="keyword">public</span> internal::unfolded_or_node&lt;InputTuple&gt; {
    1860. 

  1860. <a name="l01986"></a>01986 <span class="keyword">private</span>:
    1861. 

  1861. <a name="l01987"></a>01987     <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">int</span> N = tbb::flow::tuple_size&lt;InputTuple&gt;::value;
    1862. 

  1862. <a name="l01988"></a>01988 <span class="keyword">public</span>:
    1863. 

  1863. <a name="l01989"></a>01989     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::or_output_type&lt;InputTuple&gt;::type output_type;
    1864. 

  1864. <a name="l01990"></a>01990     <span class="keyword">typedef</span> <span class="keyword">typename</span> internal::unfolded_or_node&lt;InputTuple&gt; unfolded_type;
    1865. 

  1865. <a name="l01991"></a>01991     or_node(graph&amp; g) : unfolded_type(g) { }
    1866. 

  1866. <a name="l01992"></a>01992     <span class="comment">// Copy constructor</span>
    1867. 

  1867. <a name="l01993"></a>01993     or_node( <span class="keyword">const</span> or_node&amp; other ) : unfolded_type(other) { }
    1868. 

  1868. <a name="l01994"></a>01994 };
    1869. 

  1869. <a name="l01995"></a>01995 <span class="preprocessor">#endif  // TBB_PREVIEW_GRAPH_NODES</span>
    1870. 

  1870. <a name="l01996"></a>01996 <span class="preprocessor"></span>
    1871. 

  1871. <a name="l01998"></a>01998 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    1872. 

  1872. <a name="l01999"></a>01999 <span class="keyword">inline</span> <span class="keywordtype">void</span> make_edge( sender&lt;T&gt; &amp;p, receiver&lt;T&gt; &amp;s ) {
    1873. 

  1873. <a name="l02000"></a>02000     p.register_successor( s );
    1874. 

  1874. <a name="l02001"></a>02001 }
    1875. 

  1875. <a name="l02002"></a>02002 
    1876. 

  1876. <a name="l02004"></a>02004 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> T &gt;
    1877. 

  1877. <a name="l02005"></a>02005 <span class="keyword">inline</span> <span class="keywordtype">void</span> remove_edge( sender&lt;T&gt; &amp;p, receiver&lt;T&gt; &amp;s ) {
    1878. 

  1878. <a name="l02006"></a>02006     p.remove_successor( s );
    1879. 

  1879. <a name="l02007"></a>02007 }
    1880. 

  1880. <a name="l02008"></a>02008 
    1881. 

  1881. <a name="l02010"></a>02010 <span class="keyword">template</span>&lt; <span class="keyword">typename</span> Body, <span class="keyword">typename</span> Node &gt;
    1882. 

  1882. <a name="l02011"></a>02011 Body copy_body( Node &amp;n ) {
    1883. 

  1883. <a name="l02012"></a>02012     <span class="keywordflow">return</span> n.template copy_function_object&lt;Body&gt;();
    1884. 

  1884. <a name="l02013"></a>02013 }
    1885. 

  1885. <a name="l02014"></a>02014 
    1886. 

  1886. <a name="l02015"></a>02015 } <span class="comment">// interface6</span>
    1887. 

  1887. <a name="l02016"></a>02016 
    1888. 

  1888. <a name="l02017"></a>02017     <span class="keyword">using</span> interface6::graph;
    1889. 

  1889. <a name="l02018"></a>02018     <span class="keyword">using</span> interface6::graph_node;
    1890. 

  1890. <a name="l02019"></a>02019     <span class="keyword">using</span> interface6::continue_msg;
    1891. 

  1891. <a name="l02020"></a>02020     <span class="keyword">using</span> interface6::sender;
    1892. 

  1892. <a name="l02021"></a>02021     <span class="keyword">using</span> interface6::receiver;
    1893. 

  1893. <a name="l02022"></a>02022     <span class="keyword">using</span> interface6::continue_receiver;
    1894. 

  1894. <a name="l02023"></a>02023 
    1895. 

  1895. <a name="l02024"></a>02024     <span class="keyword">using</span> interface6::source_node;
    1896. 

  1896. <a name="l02025"></a>02025     <span class="keyword">using</span> interface6::function_node;
    1897. 

  1897. <a name="l02026"></a>02026     <span class="keyword">using</span> interface6::multifunction_node;
    1898. 

  1898. <a name="l02027"></a>02027     <span class="keyword">using</span> interface6::split_node;
    1899. 

  1899. <a name="l02028"></a>02028     <span class="keyword">using</span> interface6::internal::output_port;
    1900. 

  1900. <a name="l02029"></a>02029 <span class="preprocessor">#if TBB_PREVIEW_GRAPH_NODES</span>
    1901. 

  1901. <a name="l02030"></a>02030 <span class="preprocessor"></span>    <span class="keyword">using</span> interface6::or_node;
    1902. 

  1902. <a name="l02031"></a>02031 <span class="preprocessor">#endif</span>
    1903. 

  1903. <a name="l02032"></a>02032 <span class="preprocessor"></span>    <span class="keyword">using</span> interface6::continue_node;
    1904. 

  1904. <a name="l02033"></a>02033     <span class="keyword">using</span> interface6::overwrite_node;
    1905. 

  1905. <a name="l02034"></a>02034     <span class="keyword">using</span> interface6::write_once_node;
    1906. 

  1906. <a name="l02035"></a>02035     <span class="keyword">using</span> interface6::broadcast_node;
    1907. 

  1907. <a name="l02036"></a>02036     <span class="keyword">using</span> interface6::buffer_node;
    1908. 

  1908. <a name="l02037"></a>02037     <span class="keyword">using</span> interface6::queue_node;
    1909. 

  1909. <a name="l02038"></a>02038     <span class="keyword">using</span> interface6::sequencer_node;
    1910. 

  1910. <a name="l02039"></a>02039     <span class="keyword">using</span> interface6::priority_queue_node;
    1911. 

  1911. <a name="l02040"></a>02040     <span class="keyword">using</span> interface6::limiter_node;
    1912. 

  1912. <a name="l02041"></a>02041     <span class="keyword">using namespace </span>interface6::internal::graph_policy_namespace;
    1913. 

  1913. <a name="l02042"></a>02042     <span class="keyword">using</span> interface6::join_node;
    1914. 

  1914. <a name="l02043"></a>02043     <span class="keyword">using</span> interface6::input_port;
    1915. 

  1915. <a name="l02044"></a>02044     <span class="keyword">using</span> interface6::copy_body; 
    1916. 

  1916. <a name="l02045"></a>02045     <span class="keyword">using</span> interface6::make_edge; 
    1917. 

  1917. <a name="l02046"></a>02046     <span class="keyword">using</span> interface6::remove_edge; 
    1918. 

  1918. <a name="l02047"></a>02047     <span class="keyword">using</span> interface6::internal::NO_TAG;
    1919. 

  1919. <a name="l02048"></a>02048     <span class="keyword">using</span> interface6::internal::tag_value;
    1920. 

  1920. <a name="l02049"></a>02049 
    1921. 

  1921. <a name="l02050"></a>02050 } <span class="comment">// flow</span>
    1922. 

  1922. <a name="l02051"></a>02051 } <span class="comment">// tbb</span>
    1923. 

  1923. <a name="l02052"></a>02052 
    1924. 

  1924. <a name="l02053"></a>02053 <span class="preprocessor">#endif // __TBB_flow_graph_H</span>
    1925. 

  1925. </pre></div><hr>
    1926. 

  1926. <p></p>
    1927. 

  1927. Copyright &copy; 2005-2012 Intel Corporation.  All Rights Reserved.
    1928. 

  1928. <p></p>
    1929. 

  1929. Intel, Pentium, Intel Xeon, Itanium, Intel XScale and VTune are
    1930. 

  1930. registered trademarks or trademarks of Intel Corporation or its
    1931. 

  1931. subsidiaries in the United States and other countries.
    1932. 

  1932. <p></p>
    1933. 

  1933. * Other names and brands may be claimed as the property of others.
    1934. 

  1934.