Skip to content
Navigation Menu
{{ message }}
forked from taskflow/taskflow
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathexecutor_8hpp_source.html
More file actions
144 lines (142 loc) · 129 KB
/
Copy pathexecutor_8hpp_source.html
File metadata and controls
144 lines (142 loc) · 129 KB
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
<!-- HTML header for doxygen 1.8.13-->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<meta name="generator" content="Doxygen 1.8.13"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>Cpp-Taskflow</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<link rel="icon" type="image/x-icon" href="favicon.ico" />
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
$(document).ready(initResizable);
</script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/searchdata.js"></script>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
$(document).ready(function() { init_search(); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
<tbody>
<tr style="height: 56px;">
<td id="projectalign" style="padding-left: 0.5em;">
<div id="projectname"><a href="https://github.com/cpp-taskflow/cpp-taskflow">Cpp-Taskflow</a>
 <span id="projectnumber">2.2.0</span>
</div>
</td>
<td> <div id="MSearchBox" class="MSearchBoxInactive">
<span class="left">
<img id="MSearchSelect" src="search/mag_sel.png"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
alt=""/>
<input type="text" id="MSearchField" value="Search" accesskey="S"
onfocus="searchBox.OnSearchFieldFocus(true)"
onblur="searchBox.OnSearchFieldFocus(false)"
onkeyup="searchBox.OnSearchFieldChange(event)"/>
</span><span class="right">
<a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
</span>
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.13 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
$(document).ready(function(){initNavTree('executor_8hpp_source.html','');});
</script>
<div id="doc-content">
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
onmouseover="return searchBox.OnSearchSelectShow()"
onmouseout="return searchBox.OnSearchSelectHide()"
onkeydown="return searchBox.OnSearchSelectKey(event)">
</div>
<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0"
name="MSearchResults" id="MSearchResults">
</iframe>
</div>
<div class="header">
<div class="headertitle">
<div class="title">executor.hpp</div> </div>
</div><!--header-->
<div class="contents">
<div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// 2019/06/18 - modified by Tsung-Wei Huang</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> <span class="comment">// - fixed the cache to enable continuity</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// - TODO: do we need a special optimization for 0 workers?</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// 2019/06/11 - modified by Tsung-Wei Huang</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// - fixed the bug in calling observer while the user</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// may clear the data</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// - added object pool for nodes</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">//</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// 2019/05/17 - modified by Chun-Xun Lin</span></div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// - moved topology to taskflow</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// </span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// 2019/05/14 - modified by Tsung-Wei Huang</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// - isolated the executor from the taskflow</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">//</span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// 2019/04/09 - modified by Tsung-Wei Huang</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// - removed silent_dispatch method</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">//</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// 2019/03/12 - modified by Chun-Xun Lin</span></div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// - added taskflow</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">//</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// 2019/02/11 - modified by Tsung-Wei Huang</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// - refactored run_until</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// - added allocator to topologies</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// - changed to list for topologies</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">//</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// 2019/02/10 - modified by Chun-Xun Lin</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// - added run_n to execute taskflow</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// - finished first peer-review with TW</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">//</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// 2018/07 - 2019/02/09 - missing logs</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="comment">//</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="comment">// 2018/06/30 - created by Tsung-Wei Huang</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="comment">// - added BasicTaskflow template</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// TODO items:</span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// 1. come up with a better way to remove the "joined" links </span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment">// during the execution of a static node (1st layer)</span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">//</span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> </div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#pragma once</span></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> </div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#include <iostream></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#include <vector></span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="preprocessor">#include <cstdlib></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#include <cstdio></span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <random></span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#include <atomic></span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#include <deque></span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include <optional></span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#include <thread></span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="preprocessor">#include <algorithm></span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#include <set></span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#include <numeric></span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#include <cassert></span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> </div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="preprocessor">#include "spmc_queue.hpp"</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#include "notifier.hpp"</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#include "observer.hpp"</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#include "taskflow.hpp"</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> </div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="keyword">namespace </span><a class="code" href="namespacetf.html">tf</a> {</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00073"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html"> 73</a></span> <span class="keyword">class </span><a class="code" href="classtf_1_1Executor.html">Executor</a> {</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  </div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  <span class="keyword">struct </span>Worker {</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a> rdgen { <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a>{}() };</div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <a class="code" href="classtf_1_1WorkStealingQueue.html">WorkStealingQueue<Node*></a> queue;</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  std::optional<Node*> cache;</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  };</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span>  </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">struct </span>PerThread {</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <a class="code" href="classtf_1_1Executor.html">Executor</a>* pool {<span class="keyword">nullptr</span>}; </div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keywordtype">int</span> worker_id {-1};</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  };</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span> </div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">explicit</span> <a class="code" href="classtf_1_1Executor.html#a10e0189c6403293c276b72bb1158557e">Executor</a>(<span class="keywordtype">unsigned</span> n = <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html">std::thread::hardware_concurrency</a>());</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <a class="code" href="classtf_1_1Executor.html#a5a511b0cc23b264826373d3dabcef670">~Executor</a>();</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a81f35d5b0a20ac0646447eb80d97c0aa">run</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& taskflow);</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span> </div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">template</span><<span class="keyword">typename</span> C></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a81f35d5b0a20ac0646447eb80d97c0aa">run</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& taskflow, C&& callable);</div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">run_n</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& taskflow, <span class="keywordtype">size_t</span> N);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keyword">template</span><<span class="keyword">typename</span> C></div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">run_n</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& taskflow, <span class="keywordtype">size_t</span> N, C&& callable);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span> </div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  <span class="keyword">template</span><<span class="keyword">typename</span> P></div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">run_until</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& taskflow, P&& pred);</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> </div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  <span class="keyword">template</span><<span class="keyword">typename</span> P, <span class="keyword">typename</span> C></div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">run_until</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& taskflow, P&& pred, C&& callable);</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <span class="keywordtype">void</span> <a class="code" href="classtf_1_1Executor.html#ab9aa252f70e9a40020a1e5a89d485b85">wait_for_all</a>();</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span> </div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="keywordtype">size_t</span> <a class="code" href="classtf_1_1Executor.html#a79223c7f32c9d715e725b8d775de2d29">num_workers</a>() <span class="keyword">const</span>;</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">template</span><<span class="keyword">typename</span> Observer, <span class="keyword">typename</span>... Args></div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span>  Observer* <a class="code" href="classtf_1_1Executor.html#a7f43cde72d3e0a17e2d006cbe7a41ff3">make_observer</a>(Args&&... args);</div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  </div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span>  <span class="keywordtype">void</span> <a class="code" href="classtf_1_1Executor.html#a3ed11b270f0c7fe1c55a81c60d20411f">remove_observer</a>();</div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> </div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  </div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/condition_variable.html">std::condition_variable</a> _topology_cv;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</a> _topology_mutex;</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span> </div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keywordtype">unsigned</span> _num_topologies {0};</div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  </div><div class="line"><a name="l00205"></a><span class="lineno"> 205</span>  <span class="comment">// scheduler field</span></div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Worker></a> _workers;</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<Notifier::Waiter></a> _waiters;</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector<std::thread></a> _threads;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <a class="code" href="classtf_1_1WorkStealingQueue.html">WorkStealingQueue<Node*></a> _queue;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span> </div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/atomic/atomic.html">std::atomic<size_t></a> _num_actives {0};</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/atomic/atomic.html">std::atomic<size_t></a> _num_thieves {0};</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span>  <span class="comment">//std::atomic<size_t> _num_idlers {0};</span></div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/atomic/atomic.html">std::atomic<bool></a> _done {0};</div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span> </div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  Notifier _notifier;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  </div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr<ExecutorObserverInterface></a> _observer;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  </div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  <span class="keywordtype">unsigned</span> _find_victim(<span class="keywordtype">unsigned</span>);</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span> </div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  PerThread& _per_thread() <span class="keyword">const</span>;</div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span> </div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordtype">bool</span> _wait_for_tasks(<span class="keywordtype">unsigned</span>, std::optional<Node*>&);</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  </div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  <span class="keywordtype">void</span> _spawn(<span class="keywordtype">unsigned</span>);</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  <span class="keywordtype">void</span> _exploit_task(<span class="keywordtype">unsigned</span>, std::optional<Node*>&);</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span>  <span class="keywordtype">void</span> _explore_task(<span class="keywordtype">unsigned</span>, std::optional<Node*>&);</div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordtype">void</span> _schedule(Node*, <span class="keywordtype">bool</span>);</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordtype">void</span> _schedule(PassiveVector<Node*>&);</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  <span class="keywordtype">void</span> _invoke(<span class="keywordtype">unsigned</span>, Node*);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  <span class="keywordtype">void</span> _invoke_static_work(<span class="keywordtype">unsigned</span>, Node*);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordtype">void</span> _invoke_dynamic_work(<span class="keywordtype">unsigned</span>, Node*, <a class="code" href="classtf_1_1Subflow.html">Subflow</a>&);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  <span class="keywordtype">void</span> _init_module_node(Node*);</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span>  <span class="keywordtype">void</span> _tear_down_topology(Topology*); </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span> };</div><div class="line"><a name="l00238"></a><span class="lineno"> 238</span> </div><div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="comment">// Constructor</span></div><div class="line"><a name="l00240"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a10e0189c6403293c276b72bb1158557e"> 240</a></span> <span class="keyword">inline</span> <a class="code" href="classtf_1_1Executor.html#a10e0189c6403293c276b72bb1158557e">Executor::Executor</a>(<span class="keywordtype">unsigned</span> N) : </div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span>  _workers {N},</div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  _waiters {N},</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  _notifier {_waiters} {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  _spawn(N);</div><div class="line"><a name="l00245"></a><span class="lineno"> 245</span> }</div><div class="line"><a name="l00246"></a><span class="lineno"> 246</span> </div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span> <span class="comment">// Destructor</span></div><div class="line"><a name="l00248"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a5a511b0cc23b264826373d3dabcef670"> 248</a></span> <span class="keyword">inline</span> <a class="code" href="classtf_1_1Executor.html#a5a511b0cc23b264826373d3dabcef670">Executor::~Executor</a>() {</div><div class="line"><a name="l00249"></a><span class="lineno"> 249</span>  </div><div class="line"><a name="l00250"></a><span class="lineno"> 250</span>  <span class="comment">// wait for all topologies to complete</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span>  <a class="code" href="classtf_1_1Executor.html#ab9aa252f70e9a40020a1e5a89d485b85">wait_for_all</a>();</div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span>  </div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span>  <span class="comment">// shut down the scheduler</span></div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  _done = <span class="keyword">true</span>;</div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  _notifier.notify(<span class="keyword">true</span>);</div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  </div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span>& t : _threads){</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  t.join();</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  } </div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span> }</div><div class="line"><a name="l00261"></a><span class="lineno"> 261</span> </div><div class="line"><a name="l00262"></a><span class="lineno"> 262</span> <span class="comment">// Function: num_workers</span></div><div class="line"><a name="l00263"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a79223c7f32c9d715e725b8d775de2d29"> 263</a></span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> <a class="code" href="classtf_1_1Executor.html#a79223c7f32c9d715e725b8d775de2d29">Executor::num_workers</a>()<span class="keyword"> const </span>{</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  <span class="keywordflow">return</span> _workers.size();</div><div class="line"><a name="l00265"></a><span class="lineno"> 265</span> }</div><div class="line"><a name="l00266"></a><span class="lineno"> 266</span> </div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// Function: _per_thread</span></div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="keyword">inline</span> Executor::PerThread& Executor::_per_thread()<span class="keyword"> const </span>{</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  thread_local PerThread pt;</div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="keywordflow">return</span> pt;</div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span> }</div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span> </div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span> <span class="comment">// Procedure: _spawn</span></div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_spawn(<span class="keywordtype">unsigned</span> N) {</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span> </div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// Lock to synchronize all workers before creating _worker_maps</span></div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> i=0; i<N; ++i) {</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  _threads.emplace_back([<span class="keyword">this</span>, i] () -> <span class="keywordtype">void</span> {</div><div class="line"><a name="l00279"></a><span class="lineno"> 279</span> </div><div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  PerThread& pt = _per_thread(); </div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  pt.pool = <span class="keyword">this</span>;</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  pt.worker_id = i;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  </div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  std::optional<Node*> t;</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  </div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="comment">// must use 1 as condition instead of !done</span></div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="keywordflow">while</span>(1) {</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  </div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// execute the tasks.</span></div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  run_task:</div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  _exploit_task(i, t);</div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span> </div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// steal loop</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="keywordflow">if</span>(_explore_task(i, t); t) {</div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">goto</span> run_task;</div><div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  }</div><div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  </div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// wait for tasks</span></div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">if</span>(_wait_for_tasks(i, t) == <span class="keyword">false</span>) {</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  }</div><div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  }</div><div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  </div><div class="line"><a name="l00304"></a><span class="lineno"> 304</span>  }); </div><div class="line"><a name="l00305"></a><span class="lineno"> 305</span>  }</div><div class="line"><a name="l00306"></a><span class="lineno"> 306</span> }</div><div class="line"><a name="l00307"></a><span class="lineno"> 307</span> </div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span> <span class="comment">// Function: _find_victim</span></div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span> <span class="keyword">inline</span> <span class="keywordtype">unsigned</span> Executor::_find_victim(<span class="keywordtype">unsigned</span> thief) {</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  </div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">/*unsigned l = 0;</span></div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span> <span class="comment"> unsigned r = _workers.size() - 1;</span></div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span> <span class="comment"> unsigned vtm = std::uniform_int_distribution<unsigned>{l, r}(</span></div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span> <span class="comment"> _workers[thief].rdgen</span></div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span> <span class="comment"> );</span></div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span> <span class="comment"></span></div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span> <span class="comment"> // try to look for a task from other workers</span></div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span> <span class="comment"> for(unsigned i=0; i<_workers.size(); ++i){</span></div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span> <span class="comment"></span></div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span> <span class="comment"> if((thief == vtm && !_queue.empty()) ||</span></div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span> <span class="comment"> (thief != vtm && !_workers[vtm].queue.empty())) {</span></div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span> <span class="comment"> return vtm;</span></div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span> <span class="comment"> }</span></div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span> <span class="comment"></span></div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span> <span class="comment"> if(++vtm; vtm == _workers.size()) {</span></div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span> <span class="comment"> vtm = 0;</span></div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="comment"> }</span></div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span> <span class="comment"> } */</span></div><div class="line"><a name="l00329"></a><span class="lineno"> 329</span> </div><div class="line"><a name="l00330"></a><span class="lineno"> 330</span>  <span class="comment">// try to look for a task from other workers</span></div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">for</span>(<span class="keywordtype">unsigned</span> vtm=0; vtm<_workers.size(); ++vtm){</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">if</span>((thief == vtm && !_queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#adc85682657a3cd6c0fe87a71d350036c">empty</a>()) ||</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  (thief != vtm && !_workers[vtm].queue.empty())) {</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">return</span> vtm;</div><div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  }</div><div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  }</div><div class="line"><a name="l00337"></a><span class="lineno"> 337</span> </div><div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keywordflow">return</span> _workers.size();</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span> }</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span> </div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="comment">// Function: _explore_task</span></div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_explore_task(<span class="keywordtype">unsigned</span> thief, std::optional<Node*>& t) {</div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  </div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="comment">//assert(_workers[thief].queue.empty());</span></div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  assert(!t);</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span> </div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> l = 0;</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> r = _workers.size() - 1;</div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span> </div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> F = (_workers.size() + 1) << 1;</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  <span class="keyword">const</span> <span class="keywordtype">size_t</span> Y = 100;</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span> </div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  steal_loop:</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span> </div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordtype">size_t</span> f = 0;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  <span class="keywordtype">size_t</span> y = 0;</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span> </div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  ++_num_thieves;</div><div class="line"><a name="l00359"></a><span class="lineno"> 359</span>  </div><div class="line"><a name="l00360"></a><span class="lineno"> 360</span>  <span class="comment">// explore</span></div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  <span class="keywordflow">while</span>(!_done) {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  </div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  <span class="keywordtype">unsigned</span> vtm = <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution<unsigned></a>{l, r}(</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  _workers[thief].rdgen</div><div class="line"><a name="l00365"></a><span class="lineno"> 365</span>  );</div><div class="line"><a name="l00366"></a><span class="lineno"> 366</span>  </div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  t = (vtm == thief) ? _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#a6b63dca550a2f576b92f05bdc2e03a74">steal</a>() : _workers[vtm].queue.steal();</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span> </div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  <span class="keywordflow">if</span>(t) {</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  }</div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span> </div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  <span class="keywordflow">if</span>(f++ > F) {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  <span class="keywordflow">if</span>(<a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/yield.html">std::this_thread::yield</a>(); y++ > Y) {</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div><div class="line"><a name="l00377"></a><span class="lineno"> 377</span>  }</div><div class="line"><a name="l00378"></a><span class="lineno"> 378</span> </div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="comment">/*if(auto vtm = _find_victim(thief); vtm != _workers.size()) {</span></div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span> <span class="comment"> t = (vtm == thief) ? _queue.steal() : _workers[vtm].queue.steal();</span></div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span> <span class="comment"> // successful thief</span></div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span> <span class="comment"> if(t) {</span></div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span> <span class="comment"> break;</span></div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> <span class="comment"> }</span></div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span> <span class="comment"> }</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span> <span class="comment"> else {</span></div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span> <span class="comment"> if(f++ > F) {</span></div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span> <span class="comment"> if(std::this_thread::yield(); y++ > Y) {</span></div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span> <span class="comment"> break;</span></div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span> <span class="comment"> }</span></div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span> <span class="comment"> }</span></div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span> <span class="comment"> }*/</span></div><div class="line"><a name="l00393"></a><span class="lineno"> 393</span>  }</div><div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  </div><div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  <span class="comment">// We need to ensure at least one thieve if there is an</span></div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  <span class="comment">// active worker</span></div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  <span class="keywordflow">if</span>(<span class="keyword">auto</span> N = --_num_thieves; N == 0) {</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  <span class="keywordflow">if</span>(t != std::nullopt) {</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  _notifier.notify(<span class="keyword">false</span>);</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00401"></a><span class="lineno"> 401</span>  }</div><div class="line"><a name="l00402"></a><span class="lineno"> 402</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span>(_num_actives > 0) {</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  <span class="keywordflow">goto</span> steal_loop;</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  }</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  }</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span> }</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span> </div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span> <span class="comment">// Procedure: _exploit_task</span></div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_exploit_task(<span class="keywordtype">unsigned</span> i, std::optional<Node*>& t) {</div><div class="line"><a name="l00410"></a><span class="lineno"> 410</span>  </div><div class="line"><a name="l00411"></a><span class="lineno"> 411</span>  assert(!_workers[i].cache);</div><div class="line"><a name="l00412"></a><span class="lineno"> 412</span> </div><div class="line"><a name="l00413"></a><span class="lineno"> 413</span>  <span class="keywordflow">if</span>(t) {</div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> </div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  <span class="keyword">auto</span>& worker = _workers[i];</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span> </div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  <span class="keywordflow">if</span>(++_num_actives; _num_thieves == 0) {</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  _notifier.notify(<span class="keyword">false</span>);</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  }</div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> </div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span>  _invoke(i, *t);</div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> </div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span>  <span class="keywordflow">if</span>(worker.cache) {</div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  t = *worker.cache;</div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span>  worker.cache = std::nullopt;</div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span>  }</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span>  t = worker.queue.pop();</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  }</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span> </div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  } <span class="keywordflow">while</span>(t);</div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> </div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  --_num_actives;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  }</div><div class="line"><a name="l00436"></a><span class="lineno"> 436</span> }</div><div class="line"><a name="l00437"></a><span class="lineno"> 437</span> </div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span> <span class="comment">// Function: _wait_for_tasks</span></div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> Executor::_wait_for_tasks(<span class="keywordtype">unsigned</span> me, std::optional<Node*>& t) {</div><div class="line"><a name="l00440"></a><span class="lineno"> 440</span> </div><div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  assert(!t);</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  </div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  _notifier.prepare_wait(&_waiters[me]);</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  </div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keywordflow">if</span>(<span class="keyword">auto</span> vtm = _find_victim(me); vtm != _workers.size()) {</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  _notifier.cancel_wait(&_waiters[me]);</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  t = (vtm == me) ? _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#a6b63dca550a2f576b92f05bdc2e03a74">steal</a>() : _workers[vtm].queue.steal();</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span>  }</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span> </div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">//if(size_t I = ++_num_idlers; _done && I == _workers.size()) {</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// _notifier.cancel_wait(&_waiters[me]);</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// //if(_find_victim(me) != _workers.size()) {</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// // --_num_idlers;</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="comment">// // return true;</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// //}</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// _notifier.notify(true);</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// return false;</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">//}</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span> </div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">if</span>(_done) {</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  _notifier.cancel_wait(&_waiters[me]);</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  _notifier.notify(<span class="keyword">true</span>);</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  }</div><div class="line"><a name="l00466"></a><span class="lineno"> 466</span>  </div><div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="comment">// Now I really need to relinguish my self to others</span></div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  _notifier.commit_wait(&_waiters[me]);</div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  <span class="comment">//--_num_idlers;</span></div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span> </div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span> }</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span> </div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="comment">// Function: make_observer </span></div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="keyword">template</span><<span class="keyword">typename</span> Observer, <span class="keyword">typename</span>... Args></div><div class="line"><a name="l00476"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a7f43cde72d3e0a17e2d006cbe7a41ff3"> 476</a></span> Observer* <a class="code" href="classtf_1_1Executor.html#a7f43cde72d3e0a17e2d006cbe7a41ff3">Executor::make_observer</a>(Args&&... args) {</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span>  <span class="comment">// use a local variable to mimic the constructor </span></div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">auto</span> tmp = std::make_unique<Observer>(std::forward<Args>(args)...);</div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  tmp->set_up(std::max(<span class="keywordtype">size_t</span>{1}, _workers.size()));</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  _observer = std::move(tmp);</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>Observer*<span class="keyword">></span>(_observer.get());</div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span> }</div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span> </div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span> <span class="comment">// Procedure: remove_observer</span></div><div class="line"><a name="l00485"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a3ed11b270f0c7fe1c55a81c60d20411f"> 485</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classtf_1_1Executor.html#a3ed11b270f0c7fe1c55a81c60d20411f">Executor::remove_observer</a>() {</div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  _observer.reset();</div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span> }</div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span> </div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span> <span class="comment">// Procedure: _schedule</span></div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span> <span class="comment">// The main procedure to schedule a give task node.</span></div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> <span class="comment">// Each task node has two types of tasks - regular and subflow.</span></div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_schedule(Node* node, <span class="keywordtype">bool</span> bypass) {</div><div class="line"><a name="l00493"></a><span class="lineno"> 493</span>  </div><div class="line"><a name="l00494"></a><span class="lineno"> 494</span>  <span class="comment">// module node need another initialization</span></div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  <span class="keywordflow">if</span>(node->_module != <span class="keyword">nullptr</span> && !node->is_spawned()) {</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span>  _init_module_node(node);</div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  }</div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  </div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="comment">//no worker thread available</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keywordflow">if</span>(_workers.size() == 0){</div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#aa54d323bb06b310e133820b60b3379fb">push</a>(node);</div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="comment">//_invoke(0, node);</span></div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  }</div><div class="line"><a name="l00505"></a><span class="lineno"> 505</span> </div><div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="comment">// caller is a worker to this pool</span></div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  <span class="keywordflow">if</span>(<span class="keyword">auto</span>& pt = _per_thread(); pt.pool == <span class="keyword">this</span>) {</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  <span class="keywordflow">if</span>(!bypass) {</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  _workers[pt.worker_id].queue.push(node);</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  }</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  assert(!_workers[pt.worker_id].cache);</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span>  _workers[pt.worker_id].cache = node;</div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  }</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  }</div><div class="line"><a name="l00517"></a><span class="lineno"> 517</span> </div><div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  <span class="comment">// master threads</span></div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#aa54d323bb06b310e133820b60b3379fb">push</a>(node);</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span> </div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  _notifier.notify(<span class="keyword">false</span>);</div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span> }</div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span> </div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span> <span class="comment">// Procedure: _schedule</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span> <span class="comment">// The main procedure to schedule a set of task nodes.</span></div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span> <span class="comment">// Each task node has two types of tasks - regular and subflow.</span></div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_schedule(PassiveVector<Node*>& nodes) {</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  </div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="comment">// We need to cacth the node count to avoid accessing the nodes</span></div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  <span class="comment">// vector while the parent topology is removed!</span></div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_nodes = nodes.size();</div><div class="line"><a name="l00532"></a><span class="lineno"> 532</span>  </div><div class="line"><a name="l00533"></a><span class="lineno"> 533</span>  <span class="keywordflow">if</span>(num_nodes == 0) {</div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  }</div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span> </div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> node : nodes) {</div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="keywordflow">if</span>(node->_module != <span class="keyword">nullptr</span> && !node->is_spawned()) {</div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  _init_module_node(node);</div><div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  }</div><div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  }</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span> </div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="comment">//no worker thread available</span></div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">if</span>(_workers.size() == 0){</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span> node: nodes){</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#aa54d323bb06b310e133820b60b3379fb">push</a>(node);</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span>  <span class="comment">//_invoke(0, node);</span></div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  }</div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  }</div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span> </div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="comment">// worker thread</span></div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">if</span>(<span class="keyword">auto</span>& pt = _per_thread(); pt.pool == <span class="keyword">this</span>) {</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i=0; i<num_nodes; ++i) {</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  _workers[pt.worker_id].queue.push(nodes[i]);</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  }</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  }</div><div class="line"><a name="l00559"></a><span class="lineno"> 559</span>  </div><div class="line"><a name="l00560"></a><span class="lineno"> 560</span>  <span class="comment">// master thread</span></div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> k=0; k<num_nodes; ++k) {</div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#aa54d323bb06b310e133820b60b3379fb">push</a>(nodes[k]);</div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  _notifier.notify(<span class="keyword">false</span>);</div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  }</div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  </div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  <span class="comment">//size_t N = std::max(size_t{1}, std::min(_num_idlers.load(), num_nodes));</span></div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span> </div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  <span class="comment">//if(N >= _workers.size()) {</span></div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="comment">// _notifier.notify(true);</span></div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  <span class="comment">//}</span></div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="comment">//else {</span></div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  <span class="comment">// for(size_t k=0; k<N; ++k) {</span></div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span>  <span class="comment">// _notifier.notify(false);</span></div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// }</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">//}</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span> }</div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span> </div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span> <span class="comment">// Procedure: _init_module_node</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_init_module_node(Node* node) {</div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span> </div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  node->_work = [node=node, <span class="keyword">this</span>, tgt{PassiveVector<Node*>()}] () <span class="keyword">mutable</span> {</div><div class="line"><a name="l00582"></a><span class="lineno"> 582</span> </div><div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  <span class="comment">// second time to enter this context</span></div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  <span class="keywordflow">if</span>(node->is_spawned()) {</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  node->_dependents.resize(node->_dependents.size()-tgt.size());</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span>& t: tgt) {</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  t->_successors.clear();</div><div class="line"><a name="l00588"></a><span class="lineno"> 588</span>  }</div><div class="line"><a name="l00589"></a><span class="lineno"> 589</span>  return ;</div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  }</div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span> </div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// first time to enter this context</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  node->set_spawned();</div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span> </div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  PassiveVector<Node*> src;</div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span> </div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span>& n: node->_module->_graph.nodes()) {</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  n->_topology = node->_topology;</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">if</span>(n->num_dependents() == 0) {</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  src.push_back(n.get());</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  }</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  <span class="keywordflow">if</span>(n->num_successors() == 0) {</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  n->precede(*node);</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  tgt.push_back(n.get());</div><div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  }</div><div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span> </div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  _schedule(src);</div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  };</div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span> }</div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span> </div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span> <span class="comment">// Procedure: _invoke</span></div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_invoke(<span class="keywordtype">unsigned</span> me, Node* node) {</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span> </div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// Here we need to fetch the num_successors first to avoid the invalid memory</span></div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="comment">// access caused by topology clear.</span></div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keyword">const</span> <span class="keyword">auto</span> num_successors = node->num_successors();</div><div class="line"><a name="l00618"></a><span class="lineno"> 618</span> </div><div class="line"><a name="l00619"></a><span class="lineno"> 619</span>  <span class="comment">// static task</span></div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// The default node work type. We only need to execute the callback if any.</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="keywordflow">if</span>(<span class="keyword">auto</span> index=node->_work.index(); index == 1) {</div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="keywordflow">if</span>(node->_module != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="keywordtype">bool</span> first_time = !node->is_spawned();</div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  _invoke_static_work(me, node);</div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keywordflow">if</span>(first_time) {</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  return ;</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  }</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  }</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keywordflow">if</span>(<span class="keyword">auto</span> &f = std::get<Node::StaticWork>(node->_work); f != <span class="keyword">nullptr</span>){</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  _invoke_static_work(me, node);</div><div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  }</div><div class="line"><a name="l00633"></a><span class="lineno"> 633</span>  }</div><div class="line"><a name="l00634"></a><span class="lineno"> 634</span>  }</div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// dynamic task</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (index == 2){</div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  </div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  <span class="comment">// Clear the subgraph before the task execution</span></div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">if</span>(!node->is_spawned()) {</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  <span class="keywordflow">if</span>(node->_subgraph) {</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  node->_subgraph->clear();</div><div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  }</div><div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  node->_subgraph.emplace();</div><div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  }</div><div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  }</div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  </div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <a class="code" href="classtf_1_1Subflow.html">Subflow</a> fb(*(node->_subgraph));</div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span> </div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  _invoke_dynamic_work(me, node, fb);</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  </div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="comment">// Need to create a subflow if first time & subgraph is not empty </span></div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">if</span>(!node->is_spawned()) {</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  node->set_spawned();</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">if</span>(!node->_subgraph->empty()) {</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  <span class="comment">// For storing the source nodes</span></div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span>  PassiveVector<Node*> src; </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="keywordflow">for</span>(<span class="keyword">auto</span>& n: node->_subgraph->nodes()) {</div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  n->_topology = node->_topology;</div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  n->set_subtask();</div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="keywordflow">if</span>(n->num_successors() == 0) {</div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="keywordflow">if</span>(fb.<a class="code" href="classtf_1_1Subflow.html#a185a0cba35c5f208029ea207e9be0b5f">detached</a>()) {</div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  node->_topology->_num_sinks ++;</div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  }</div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  n->precede(*node);</div><div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  }</div><div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  }</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  <span class="keywordflow">if</span>(n->num_dependents() == 0) {</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  src.push_back(n.get());</div><div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  }</div><div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  }</div><div class="line"><a name="l00673"></a><span class="lineno"> 673</span> </div><div class="line"><a name="l00674"></a><span class="lineno"> 674</span>  _schedule(src);</div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span> </div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="keywordflow">if</span>(fb.<a class="code" href="classtf_1_1Subflow.html#afb178f1e81f2d37652803023da5847ce">joined</a>()) {</div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="keywordflow">return</span>;</div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  }</div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  }</div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  }</div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  } <span class="comment">// End of DynamicWork -----------------------------------------------------</span></div><div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  </div><div class="line"><a name="l00683"></a><span class="lineno"> 683</span>  <span class="comment">// Recover the runtime change due to dynamic tasking except the target & spawn tasks </span></div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  <span class="comment">// This must be done before scheduling the successors, otherwise this might cause </span></div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="comment">// race condition on the _dependents</span></div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  <span class="comment">//if(num_successors && !node->_subtask) {</span></div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">if</span>(!node->is_subtask()) {</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  <span class="comment">// Only dynamic tasking needs to restore _dependents</span></div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span>  <span class="comment">// TODO:</span></div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span>  <span class="keywordflow">if</span>(node->_work.index() == 2 && !node->_subgraph->empty()) {</div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keywordflow">while</span>(!node->_dependents.empty() && node->_dependents.back()->is_subtask()) {</div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  node->_dependents.pop_back();</div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  }</div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  }</div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  node->_num_dependents = <span class="keyword">static_cast<</span><span class="keywordtype">int</span><span class="keyword">></span>(node->_dependents.size());</div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  node->unset_spawned();</div><div class="line"><a name="l00697"></a><span class="lineno"> 697</span>  }</div><div class="line"><a name="l00698"></a><span class="lineno"> 698</span> </div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="comment">// At this point, the node storage might be destructed.</span></div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  Node* cache {<span class="keyword">nullptr</span>};</div><div class="line"><a name="l00701"></a><span class="lineno"> 701</span> </div><div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keywordflow">for</span>(<span class="keywordtype">size_t</span> i=0; i<num_successors; ++i) {</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keywordflow">if</span>(--(node->_successors[i]->_num_dependents) == 0) {</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">if</span>(cache) {</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  <span class="comment">//_schedule(node->_successors[i]);</span></div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span>  _schedule(cache, <span class="keyword">false</span>);</div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  }</div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  cache = node->_successors[i];</div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  }</div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  }</div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span> </div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keywordflow">if</span>(cache) {</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  _schedule(cache, <span class="keyword">true</span>);</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  }</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span> </div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="comment">// A node without any successor should check the termination of topology</span></div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  <span class="keywordflow">if</span>(num_successors == 0) {</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">if</span>(--(node->_topology->_num_sinks) == 0) {</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  <span class="keywordflow">if</span>(_workers.size() > 0) { <span class="comment">// finishing this topology</span></div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  _tear_down_topology(node->_topology);</div><div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  }</div><div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  }</div><div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  }</div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span> }</div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span> </div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span> <span class="comment">// Procedure: _invoke_static_work</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_invoke_static_work(<span class="keywordtype">unsigned</span> me, Node* node) {</div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keywordflow">if</span>(_observer) {</div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  _observer->on_entry(me, <a class="code" href="classtf_1_1TaskView.html">TaskView</a>(node));</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  std::invoke(std::get<Node::StaticWork>(node->_work));</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  _observer->on_exit(me, <a class="code" href="classtf_1_1TaskView.html">TaskView</a>(node));</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  }</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  std::invoke(std::get<Node::StaticWork>(node->_work));</div><div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  }</div><div class="line"><a name="l00736"></a><span class="lineno"> 736</span> }</div><div class="line"><a name="l00737"></a><span class="lineno"> 737</span> </div><div class="line"><a name="l00738"></a><span class="lineno"> 738</span> <span class="comment">// Procedure: _invoke_dynamic_work</span></div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_invoke_dynamic_work(<span class="keywordtype">unsigned</span> me, Node* node, <a class="code" href="classtf_1_1Subflow.html">Subflow</a>& sf) {</div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="keywordflow">if</span>(_observer) {</div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  _observer->on_entry(me, <a class="code" href="classtf_1_1TaskView.html">TaskView</a>(node));</div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  std::invoke(std::get<Node::DynamicWork>(node->_work), sf);</div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  _observer->on_exit(me, <a class="code" href="classtf_1_1TaskView.html">TaskView</a>(node));</div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  }</div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  std::invoke(std::get<Node::DynamicWork>(node->_work), sf);</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  }</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span> }</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span> </div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span> <span class="comment">// Function: run</span></div><div class="line"><a name="l00751"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a81f35d5b0a20ac0646447eb80d97c0aa"> 751</a></span> <span class="keyword">inline</span> <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a81f35d5b0a20ac0646447eb80d97c0aa">Executor::run</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& f) {</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">return</span> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">run_n</a>(f, 1, [](){});</div><div class="line"><a name="l00753"></a><span class="lineno"> 753</span> }</div><div class="line"><a name="l00754"></a><span class="lineno"> 754</span> </div><div class="line"><a name="l00755"></a><span class="lineno"> 755</span> <span class="comment">// Function: run</span></div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div><div class="line"><a name="l00757"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a94b45b69dc247c82c2ada8c90424b172"> 757</a></span> <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a81f35d5b0a20ac0646447eb80d97c0aa">Executor::run</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& f, C&& c) {</div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  static_assert(std::is_invocable<C>::value);</div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="keywordflow">return</span> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">run_n</a>(f, 1, std::forward<C>(c));</div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span> }</div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span> </div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span> <span class="comment">// Function: run_n</span></div><div class="line"><a name="l00763"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6"> 763</a></span> <span class="keyword">inline</span> <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">Executor::run_n</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& f, <span class="keywordtype">size_t</span> repeat) {</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">return</span> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">run_n</a>(f, repeat, [](){});</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span> }</div><div class="line"><a name="l00766"></a><span class="lineno"> 766</span> </div><div class="line"><a name="l00767"></a><span class="lineno"> 767</span> <span class="comment">// Function: run_n</span></div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> <span class="keyword">template</span> <<span class="keyword">typename</span> C></div><div class="line"><a name="l00769"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#aff558312e64d19f98f26c91349c317da"> 769</a></span> <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">Executor::run_n</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& f, <span class="keywordtype">size_t</span> repeat, C&& c) {</div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="keywordflow">return</span> <a class="code" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">run_until</a>(f, [repeat]() <span class="keyword">mutable</span> { <span class="keywordflow">return</span> repeat-- == 0; }, std::forward<C>(c));</div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span> }</div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span> </div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span> <span class="comment">// Function: run_until </span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span> <span class="keyword">template</span><<span class="keyword">typename</span> P></div><div class="line"><a name="l00775"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6"> 775</a></span> <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">Executor::run_until</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& f, P&& pred) {</div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keywordflow">return</span> <a class="code" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">run_until</a>(f, std::forward<P>(pred), [](){});</div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span> }</div><div class="line"><a name="l00778"></a><span class="lineno"> 778</span> </div><div class="line"><a name="l00779"></a><span class="lineno"> 779</span> <span class="comment">// Function: _tear_down_topology</span></div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> Executor::_tear_down_topology(Topology* tpg) {</div><div class="line"><a name="l00781"></a><span class="lineno"> 781</span> </div><div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  <span class="keyword">auto</span> &f = tpg->_taskflow;</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span> </div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  <span class="comment">//assert(&tpg == &(f._topologies.front()));</span></div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span> </div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  <span class="comment">// case 1: we still need to run the topology again</span></div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  <span class="keywordflow">if</span>(!std::invoke(tpg->_pred)) {</div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  tpg->_recover_num_sinks();</div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  _schedule(tpg->_sources); </div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// case 2: the final run of this topology</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  </div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="keywordflow">if</span>(tpg->_call != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  std::invoke(tpg->_call);</div><div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  }</div><div class="line"><a name="l00797"></a><span class="lineno"> 797</span> </div><div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  f._mtx.lock();</div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span> </div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="comment">// If there is another run (interleave between lock)</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keywordflow">if</span>(f._topologies.size() > 1) {</div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span> </div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  <span class="comment">// Set the promise</span></div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  tpg->_promise.set_value();</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  f._topologies.pop_front();</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  f._mtx.unlock();</div><div class="line"><a name="l00807"></a><span class="lineno"> 807</span> </div><div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  {</div><div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  std::scoped_lock lock(_topology_mutex);</div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  _num_topologies--;</div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  }</div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span> </div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  f._topologies.front()._bind(f._graph);</div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  _schedule(f._topologies.front()._sources);</div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  }</div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="keywordflow">else</span> {</div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  assert(f._topologies.size() == 1);</div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="comment">// Need to back up the promise first here becuz taskflow might be </span></div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  <span class="comment">// destroy before taskflow leaves</span></div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keyword">auto</span> p {std::move(tpg->_promise)};</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span> </div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  f._topologies.pop_front();</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span> </div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  f._mtx.unlock();</div><div class="line"><a name="l00825"></a><span class="lineno"> 825</span> </div><div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="comment">// We set the promise in the end in case taskflow leaves before taskflow</span></div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  p.set_value();</div><div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  {</div><div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  std::scoped_lock lock(_topology_mutex);</div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  _num_topologies--;</div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  }</div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  _topology_cv.notify_one();</div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  }</div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  }</div><div class="line"><a name="l00835"></a><span class="lineno"> 835</span> }</div><div class="line"><a name="l00836"></a><span class="lineno"> 836</span> </div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span> <span class="comment">// Function: run_until</span></div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> <span class="keyword">template</span> <<span class="keyword">typename</span> P, <span class="keyword">typename</span> C></div><div class="line"><a name="l00839"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#a85f5cd590d2dbe15d1f2f1f8d920a7e6"> 839</a></span> <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> <a class="code" href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">Executor::run_until</a>(<a class="code" href="classtf_1_1Taskflow.html">Taskflow</a>& f, P&& pred, C&& c) {</div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span> </div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">// Predicate must return a boolean value</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  static_assert(std::is_invocable_v<C> && std::is_invocable_v<P>);</div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span> </div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keywordflow">if</span>(std::invoke(pred)) {</div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keywordflow">return</span> std::async(std::launch::deferred, [](){});</div><div class="line"><a name="l00846"></a><span class="lineno"> 846</span>  }</div><div class="line"><a name="l00847"></a><span class="lineno"> 847</span>  </div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// Speicla case of zero workers needs</span></div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="comment">// - iterative execution to avoid stack overflow</span></div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  <span class="comment">// - avoid execution of last_work</span></div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  <span class="keywordflow">if</span>(_workers.size() == 0) {</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  </div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  Topology tpg(f, std::forward<P>(pred), std::forward<C>(c));</div><div class="line"><a name="l00854"></a><span class="lineno"> 854</span> </div><div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  <span class="comment">// Clear last execution data & Build precedence between nodes and target</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  tpg._bind(f._graph);</div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span> </div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  _schedule(tpg._sources);</div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span> </div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="keyword">auto</span> node = _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#a1ba75ce446b149de97e62310851a243d">pop</a>();</div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keywordflow">while</span>(node) {</div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  _invoke(0, *node);</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  node = _queue.<a class="code" href="classtf_1_1WorkStealingQueue.html#a22aac5bd13c0f1120ddfe8289846fd1d">unsync_pop</a>();</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  }</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span> </div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  tpg._recover_num_sinks();</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  } <span class="keywordflow">while</span>(!std::invoke(tpg._pred));</div><div class="line"><a name="l00869"></a><span class="lineno"> 869</span> </div><div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  <span class="keywordflow">if</span>(tpg._call != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  std::invoke(tpg._call);</div><div class="line"><a name="l00872"></a><span class="lineno"> 872</span>  }</div><div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  </div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="keywordflow">return</span> std::async(std::launch::deferred, [](){});</div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  }</div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  </div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="comment">// has worker(s)</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  {</div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  std::scoped_lock lock(_topology_mutex);</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  _num_topologies++;</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  }</div><div class="line"><a name="l00882"></a><span class="lineno"> 882</span> </div><div class="line"><a name="l00883"></a><span class="lineno"> 883</span>  <span class="comment">// Multi-threaded execution.</span></div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="keywordtype">bool</span> run_now {<span class="keyword">false</span>};</div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  Topology* tpg;</div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/future.html">std::future<void></a> future;</div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  </div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  {</div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  std::scoped_lock lock(f._mtx);</div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span> </div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  <span class="comment">// create a topology for this run</span></div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  tpg = &(f._topologies.emplace_back(f, std::forward<P>(pred), std::forward<C>(c)));</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  future = tpg->_promise.get_future();</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  </div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  <span class="keywordflow">if</span>(f._topologies.size() == 1) {</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  run_now = <span class="keyword">true</span>;</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="comment">//tpg->_bind(f._graph);</span></div><div class="line"><a name="l00898"></a><span class="lineno"> 898</span>  <span class="comment">//_schedule(tpg->_sources);</span></div><div class="line"><a name="l00899"></a><span class="lineno"> 899</span>  }</div><div class="line"><a name="l00900"></a><span class="lineno"> 900</span>  }</div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  </div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// Notice here calling schedule may cause the topology to be removed sonner </span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// before the function leaves.</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="keywordflow">if</span>(run_now) {</div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  tpg->_bind(f._graph);</div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  _schedule(tpg->_sources);</div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  }</div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span> </div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  <span class="keywordflow">return</span> future;</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span> }</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span> </div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span> <span class="comment">// Procedure: wait_for_all</span></div><div class="line"><a name="l00913"></a><span class="lineno"><a class="line" href="classtf_1_1Executor.html#ab9aa252f70e9a40020a1e5a89d485b85"> 913</a></span> <span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classtf_1_1Executor.html#ab9aa252f70e9a40020a1e5a89d485b85">Executor::wait_for_all</a>() {</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  <a class="codeRef" doxygen="/home/twhuang/PhD/Code/cpp-taskflow/doxygen/cppreference-doxygen-web.tag.xml:http://en.cppreference.com/w/" href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">std::unique_lock</a> lock(_topology_mutex);</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  _topology_cv.wait(lock, [&](){ <span class="keywordflow">return</span> _num_topologies == 0; });</div><div class="line"><a name="l00916"></a><span class="lineno"> 916</span> }</div><div class="line"><a name="l00917"></a><span class="lineno"> 917</span> </div><div class="line"><a name="l00918"></a><span class="lineno"> 918</span> } <span class="comment">// end of namespace tf -----------------------------------------------------</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span> </div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span> </div><div class="ttc" id="classtf_1_1Executor_html_a81f35d5b0a20ac0646447eb80d97c0aa"><div class="ttname"><a href="classtf_1_1Executor.html#a81f35d5b0a20ac0646447eb80d97c0aa">tf::Executor::run</a></div><div class="ttdeci">std::future< void > run(Taskflow &taskflow)</div><div class="ttdoc">runs the taskflow once </div><div class="ttdef"><b>Definition:</b> executor.hpp:751</div></div>
<div class="ttc" id="classtf_1_1Executor_html_a3ed11b270f0c7fe1c55a81c60d20411f"><div class="ttname"><a href="classtf_1_1Executor.html#a3ed11b270f0c7fe1c55a81c60d20411f">tf::Executor::remove_observer</a></div><div class="ttdeci">void remove_observer()</div><div class="ttdoc">removes the associated observer </div><div class="ttdef"><b>Definition:</b> executor.hpp:485</div></div>
<div class="ttc" id="classtf_1_1WorkStealingQueue_html_adc85682657a3cd6c0fe87a71d350036c"><div class="ttname"><a href="classtf_1_1WorkStealingQueue.html#adc85682657a3cd6c0fe87a71d350036c">tf::WorkStealingQueue::empty</a></div><div class="ttdeci">bool empty() const noexcept</div><div class="ttdoc">queries if the queue is empty at the time of this call </div><div class="ttdef"><b>Definition:</b> spmc_queue.hpp:182</div></div>
<div class="ttc" id="atomic_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/atomic/atomic.html">std::atomic< size_t ></a></div></div>
<div class="ttc" id="uniform_int_distribution_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/uniform_int_distribution.html">std::uniform_int_distribution</a></div></div>
<div class="ttc" id="classtf_1_1Executor_html_a8acf7515e8e8fdda366ace68bcd65aa6"><div class="ttname"><a href="classtf_1_1Executor.html#a8acf7515e8e8fdda366ace68bcd65aa6">tf::Executor::run_until</a></div><div class="ttdeci">std::future< void > run_until(Taskflow &taskflow, P &&pred)</div><div class="ttdoc">runs the taskflow multiple times until the predicate becomes true and then invokes a callback ...</div><div class="ttdef"><b>Definition:</b> executor.hpp:775</div></div>
<div class="ttc" id="classtf_1_1Executor_html_a5a511b0cc23b264826373d3dabcef670"><div class="ttname"><a href="classtf_1_1Executor.html#a5a511b0cc23b264826373d3dabcef670">tf::Executor::~Executor</a></div><div class="ttdeci">~Executor()</div><div class="ttdoc">destructs the executor </div><div class="ttdef"><b>Definition:</b> executor.hpp:248</div></div>
<div class="ttc" id="yield_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/yield.html">std::this_thread::yield</a></div><div class="ttdeci">T yield(T... args)</div></div>
<div class="ttc" id="classtf_1_1WorkStealingQueue_html_aa54d323bb06b310e133820b60b3379fb"><div class="ttname"><a href="classtf_1_1WorkStealingQueue.html#aa54d323bb06b310e133820b60b3379fb">tf::WorkStealingQueue::push</a></div><div class="ttdeci">void push(O &&item)</div><div class="ttdoc">inserts an item to the queue </div><div class="ttdef"><b>Definition:</b> spmc_queue.hpp:199</div></div>
<div class="ttc" id="condition_variable_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/condition_variable.html">std::condition_variable</a></div></div>
<div class="ttc" id="future_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/future.html">std::future</a></div></div>
<div class="ttc" id="namespacetf_html"><div class="ttname"><a href="namespacetf.html">tf</a></div><div class="ttdef"><b>Definition:</b> taskflow.hpp:5</div></div>
<div class="ttc" id="hardware_concurrency_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/thread/hardware_concurrency.html">std::thread::hardware_concurrency</a></div><div class="ttdeci">T hardware_concurrency(T... args)</div></div>
<div class="ttc" id="mutex_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/mutex.html">std::mutex</a></div></div>
<div class="ttc" id="classtf_1_1Subflow_html_a185a0cba35c5f208029ea207e9be0b5f"><div class="ttname"><a href="classtf_1_1Subflow.html#a185a0cba35c5f208029ea207e9be0b5f">tf::Subflow::detached</a></div><div class="ttdeci">bool detached() const</div><div class="ttdoc">queries if the subflow will be detached from its parent task </div><div class="ttdef"><b>Definition:</b> flow_builder.hpp:869</div></div>
<div class="ttc" id="classtf_1_1Executor_html_a7f43cde72d3e0a17e2d006cbe7a41ff3"><div class="ttname"><a href="classtf_1_1Executor.html#a7f43cde72d3e0a17e2d006cbe7a41ff3">tf::Executor::make_observer</a></div><div class="ttdeci">Observer * make_observer(Args &&... args)</div><div class="ttdoc">constructs an observer to inspect the activities of worker threads </div><div class="ttdef"><b>Definition:</b> executor.hpp:476</div></div>
<div class="ttc" id="classtf_1_1WorkStealingQueue_html_a22aac5bd13c0f1120ddfe8289846fd1d"><div class="ttname"><a href="classtf_1_1WorkStealingQueue.html#a22aac5bd13c0f1120ddfe8289846fd1d">tf::WorkStealingQueue::unsync_pop</a></div><div class="ttdeci">std::optional< T > unsync_pop()</div><div class="ttdoc">pops out an item from the queue without synchronization with thieves </div><div class="ttdef"><b>Definition:</b> spmc_queue.hpp:249</div></div>
<div class="ttc" id="classtf_1_1Taskflow_html"><div class="ttname"><a href="classtf_1_1Taskflow.html">tf::Taskflow</a></div><div class="ttdoc">the class to create a task dependency graph </div><div class="ttdef"><b>Definition:</b> core/taskflow.hpp:15</div></div>
<div class="ttc" id="random_device_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/random_device.html">std::random_device</a></div></div>
<div class="ttc" id="classtf_1_1TaskView_html"><div class="ttname"><a href="classtf_1_1TaskView.html">tf::TaskView</a></div><div class="ttdoc">A constant wrapper class to a task node, mainly used in the tf::ExecutorObserver interface. </div><div class="ttdef"><b>Definition:</b> task.hpp:300</div></div>
<div class="ttc" id="unique_lock_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/thread/unique_lock.html">std::unique_lock</a></div></div>
<div class="ttc" id="vector_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/container/vector.html">std::vector< Worker ></a></div></div>
<div class="ttc" id="unique_ptr_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/memory/unique_ptr.html">std::unique_ptr</a></div></div>
<div class="ttc" id="classtf_1_1WorkStealingQueue_html_a1ba75ce446b149de97e62310851a243d"><div class="ttname"><a href="classtf_1_1WorkStealingQueue.html#a1ba75ce446b149de97e62310851a243d">tf::WorkStealingQueue::pop</a></div><div class="ttdeci">std::optional< T > pop()</div><div class="ttdoc">pops out an item from the queue </div><div class="ttdef"><b>Definition:</b> spmc_queue.hpp:219</div></div>
<div class="ttc" id="classtf_1_1Subflow_html_afb178f1e81f2d37652803023da5847ce"><div class="ttname"><a href="classtf_1_1Subflow.html#afb178f1e81f2d37652803023da5847ce">tf::Subflow::joined</a></div><div class="ttdeci">bool joined() const</div><div class="ttdoc">queries if the subflow will join its parent task </div><div class="ttdef"><b>Definition:</b> flow_builder.hpp:874</div></div>
<div class="ttc" id="classtf_1_1WorkStealingQueue_html"><div class="ttname"><a href="classtf_1_1WorkStealingQueue.html">tf::WorkStealingQueue</a></div><div class="ttdoc">Lock-free unbounded single-producer multiple-consumer queue. </div><div class="ttdef"><b>Definition:</b> spmc_queue.hpp:29</div></div>
<div class="ttc" id="classtf_1_1Executor_html"><div class="ttname"><a href="classtf_1_1Executor.html">tf::Executor</a></div><div class="ttdoc">The executor class to run a taskflow graph. </div><div class="ttdef"><b>Definition:</b> executor.hpp:73</div></div>
<div class="ttc" id="classtf_1_1Executor_html_a79223c7f32c9d715e725b8d775de2d29"><div class="ttname"><a href="classtf_1_1Executor.html#a79223c7f32c9d715e725b8d775de2d29">tf::Executor::num_workers</a></div><div class="ttdeci">size_t num_workers() const</div><div class="ttdoc">queries the number of worker threads (can be zero) </div><div class="ttdef"><b>Definition:</b> executor.hpp:263</div></div>
<div class="ttc" id="classtf_1_1WorkStealingQueue_html_a6b63dca550a2f576b92f05bdc2e03a74"><div class="ttname"><a href="classtf_1_1WorkStealingQueue.html#a6b63dca550a2f576b92f05bdc2e03a74">tf::WorkStealingQueue::steal</a></div><div class="ttdeci">std::optional< T > steal()</div><div class="ttdoc">steals an item from the queue </div><div class="ttdef"><b>Definition:</b> spmc_queue.hpp:269</div></div>
<div class="ttc" id="classtf_1_1Executor_html_a10e0189c6403293c276b72bb1158557e"><div class="ttname"><a href="classtf_1_1Executor.html#a10e0189c6403293c276b72bb1158557e">tf::Executor::Executor</a></div><div class="ttdeci">Executor(unsigned n=std::thread::hardware_concurrency())</div><div class="ttdoc">constructs the executor with N worker threads </div><div class="ttdef"><b>Definition:</b> executor.hpp:240</div></div>
<div class="ttc" id="mersenne_twister_engine_html"><div class="ttname"><a href="http://en.cppreference.com/w/cpp/numeric/random/mersenne_twister_engine.html">std::mt19937</a></div></div>
<div class="ttc" id="classtf_1_1Subflow_html"><div class="ttname"><a href="classtf_1_1Subflow.html">tf::Subflow</a></div><div class="ttdoc">The building blocks of dynamic tasking. </div><div class="ttdef"><b>Definition:</b> flow_builder.hpp:817</div></div>
<div class="ttc" id="classtf_1_1Executor_html_adca6cd0ce1bd7e6fa2ed2a55c9ae15e6"><div class="ttname"><a href="classtf_1_1Executor.html#adca6cd0ce1bd7e6fa2ed2a55c9ae15e6">tf::Executor::run_n</a></div><div class="ttdeci">std::future< void > run_n(Taskflow &taskflow, size_t N)</div><div class="ttdoc">runs the taskflow for N times </div><div class="ttdef"><b>Definition:</b> executor.hpp:763</div></div>
<div class="ttc" id="classtf_1_1Executor_html_ab9aa252f70e9a40020a1e5a89d485b85"><div class="ttname"><a href="classtf_1_1Executor.html#ab9aa252f70e9a40020a1e5a89d485b85">tf::Executor::wait_for_all</a></div><div class="ttdeci">void wait_for_all()</div><div class="ttdoc">wait for all pending graphs to complete </div><div class="ttdef"><b>Definition:</b> executor.hpp:913</div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_88dad41ea55ca2177e141d32a93e931c.html">taskflow</a></li><li class="navelem"><a class="el" href="dir_220cd4d9b8cb38c840b455d5d75c25bb.html">core</a></li><li class="navelem"><b>executor.hpp</b></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.13 </li>
</ul>
</div>
</body>
</html>
You can’t perform that action at this time.