| <a href="blockingconcurrentqueue_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno"> 1</span> <span class="comment">// Provides an efficient blocking version of moodycamel::ConcurrentQueue.</span></div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// ©2015-2016 Cameron Desrochers. Distributed under the terms of the simplified</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// BSD license, available at the top of concurrentqueue.h.</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// Uses Jeff Preshing's semaphore implementation (under the terms of its</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// separate zlib license, embedded below).</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> </div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="preprocessor">#ifndef DMLC_BLOCKINGCONCURRENTQUEUE_H_</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="preprocessor">#define DMLC_BLOCKINGCONCURRENTQUEUE_H_</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="preprocessor">#pragma once</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> </div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="preprocessor">#include "<a class="code" href="concurrentqueue_8h.html">concurrentqueue.h</a>"</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="preprocessor">#include <type_traits></span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="preprocessor">#include <cerrno></span></div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="preprocessor">#include <memory></span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="preprocessor">#include <chrono></span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="preprocessor">#include <ctime></span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="preprocessor">#if defined(_WIN32)</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// Avoid including windows.h in a header; we only need a handful of</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// items, so we'll redeclare them here (this is relatively safe since</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// the API generally has to remain stable between Windows versions).</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// I know this is an ugly hack but it still beats polluting the global</span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// namespace with thousands of generic names or adding a .cpp for nothing.</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> {</div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span>  <span class="keyword">struct </span>_SECURITY_ATTRIBUTES;</div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span>  __declspec(dllimport) <span class="keywordtype">void</span>* __stdcall CreateSemaphoreW(_SECURITY_ATTRIBUTES* lpSemaphoreAttributes, <span class="keywordtype">long</span> lInitialCount, <span class="keywordtype">long</span> lMaximumCount, <span class="keyword">const</span> <span class="keywordtype">wchar_t</span>* lpName);</div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span>  __declspec(dllimport) <span class="keywordtype">int</span> __stdcall CloseHandle(<span class="keywordtype">void</span>* hObject);</div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span>  __declspec(dllimport) <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __stdcall WaitForSingleObject(<span class="keywordtype">void</span>* hHandle, <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> dwMilliseconds);</div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span>  __declspec(dllimport) <span class="keywordtype">int</span> __stdcall ReleaseSemaphore(<span class="keywordtype">void</span>* hSemaphore, <span class="keywordtype">long</span> lReleaseCount, <span class="keywordtype">long</span>* lpPreviousCount);</div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> }</div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#elif defined(__MACH__)</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#include <mach/mach.h></span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#elif defined(__unix__)</span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <semaphore.h></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> </div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="keyword">namespace </span><a class="code" href="namespacedmlc.html">dmlc</a> {</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="keyword">namespace </span>moodycamel</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="keyword">namespace </span>details</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> {</div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  <span class="comment">// Code in the mpmc_sema namespace below is an adaptation of Jeff Preshing's</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span>  <span class="comment">// portable + lightweight semaphore implementations, originally from</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span>  <span class="comment">// https://github.com/preshing/cpp11-on-multicore/blob/master/common/sema.h</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span>  <span class="comment">// LICENSE:</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  <span class="comment">// Copyright (c) 2015 Jeff Preshing</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span>  <span class="comment">//</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="comment">// This software is provided 'as-is', without any express or implied</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span>  <span class="comment">// warranty. In no event will the authors be held liable for any damages</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  <span class="comment">// arising from the use of this software.</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="comment">//</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="comment">// Permission is granted to anyone to use this software for any purpose,</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="comment">// including commercial applications, and to alter it and redistribute it</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  <span class="comment">// freely, subject to the following restrictions:</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span>  <span class="comment">//</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <span class="comment">// 1. The origin of this software must not be misrepresented; you must not</span></div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  <span class="comment">// claim that you wrote the original software. If you use this software</span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="comment">// in a product, an acknowledgement in the product documentation would be</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="comment">// appreciated but is not required.</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="comment">// 2. Altered source versions must be plainly marked as such, and must not be</span></div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="comment">// misrepresented as being the original software.</span></div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="comment">// 3. This notice may not be removed or altered from any source distribution.</span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keyword">namespace </span>mpmc_sema</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#if defined(_WIN32)</span></div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  <span class="keyword">class </span>Semaphore</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  {</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keywordtype">void</span>* m_hSema;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> </div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  Semaphore(<span class="keyword">const</span> Semaphore& other) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  Semaphore& operator=(<span class="keyword">const</span> Semaphore& other) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> </div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  Semaphore(<span class="keywordtype">int</span> initialCount = 0)</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>  assert(initialCount >= 0);</div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span>  <span class="keyword">const</span> <span class="keywordtype">long</span> maxLong = 0x7fffffff;</div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  m_hSema = CreateSemaphoreW(<span class="keyword">nullptr</span>, initialCount, maxLong, <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  }</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>  ~Semaphore()</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  {</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  CloseHandle(m_hSema);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  }</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> </div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keywordtype">void</span> wait()</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  {</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> infinite = 0xffffffff;</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  WaitForSingleObject(m_hSema, infinite);</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  }</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span> </div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keywordtype">bool</span> try_wait()</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  {</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> RC_WAIT_TIMEOUT = 0x00000102;</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> WaitForSingleObject(m_hSema, 0) != RC_WAIT_TIMEOUT;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  }</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span> </div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">bool</span> timed_wait(std::uint64_t usecs)</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  {</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">const</span> <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> RC_WAIT_TIMEOUT = 0x00000102;</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">return</span> WaitForSingleObject(m_hSema, (<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>)(usecs / 1000)) != RC_WAIT_TIMEOUT;</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  }</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span> </div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <span class="keywordtype">void</span> signal(<span class="keywordtype">int</span> count = 1)</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  {</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  ReleaseSemaphore(m_hSema, count, <span class="keyword">nullptr</span>);</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  }</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  };</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span> <span class="preprocessor">#elif defined(__MACH__)</span></div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">//---------------------------------------------------------</span></div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// Semaphore (Apple iOS and OSX)</span></div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="comment">// Can't use POSIX semaphores due to http://lists.apple.com/archives/darwin-kernel/2009/Apr/msg00010.html</span></div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  <span class="comment">//---------------------------------------------------------</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">class </span>Semaphore</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  {</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  semaphore_t m_sema;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span> </div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  Semaphore(<span class="keyword">const</span> Semaphore& other) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span>  Semaphore& operator=(<span class="keyword">const</span> Semaphore& other) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  Semaphore(<span class="keywordtype">int</span> initialCount = 0)</div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  assert(initialCount >= 0);</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  semaphore_create(mach_task_self(), &m_sema, SYNC_POLICY_FIFO, initialCount);</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  }</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span> </div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  ~Semaphore()</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  {</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  semaphore_destroy(mach_task_self(), m_sema);</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  }</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> </div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  <span class="keywordtype">void</span> wait()</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  {</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  semaphore_wait(m_sema);</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  }</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span> </div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordtype">bool</span> try_wait()</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  {</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span>  <span class="keywordflow">return</span> timed_wait(0);</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  }</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span> </div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordtype">bool</span> timed_wait(std::uint64_t timeout_usecs)</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  {</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  mach_timespec_t ts;</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  ts.tv_sec = <span class="keyword">static_cast<</span><span class="keywordtype">unsigned</span> <span class="keywordtype">int</span><span class="keyword">></span>(timeout_usecs / 1000000);</div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span>  ts.tv_nsec = (timeout_usecs % 1000000) * 1000;</div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> </div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <span class="comment">// added in OSX 10.10: https://developer.apple.com/library/prerelease/mac/documentation/General/Reference/APIDiffsMacOSX10_10SeedDiff/modules/Darwin.html</span></div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  kern_return_t rc = semaphore_timedwait(m_sema, ts);</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span> </div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  <span class="keywordflow">return</span> rc != KERN_OPERATION_TIMED_OUT;</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  }</div><div class="line"><a name="l00159"></a><span class="lineno"> 159</span> </div><div class="line"><a name="l00160"></a><span class="lineno"> 160</span>  <span class="keywordtype">void</span> signal()</div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  semaphore_signal(m_sema);</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  }</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span> </div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  <span class="keywordtype">void</span> signal(<span class="keywordtype">int</span> count)</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  {</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  <span class="keywordflow">while</span> (count-- > 0)</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  {</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  semaphore_signal(m_sema);</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span>  }</div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span>  }</div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span>  };</div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor">#elif defined(__unix__)</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <span class="comment">//---------------------------------------------------------</span></div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  <span class="comment">// Semaphore (POSIX, Linux)</span></div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span>  <span class="comment">//---------------------------------------------------------</span></div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  <span class="keyword">class </span>Semaphore</div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span>  {</div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="keyword">private</span>:</div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  sem_t m_sema;</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span> </div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  Semaphore(<span class="keyword">const</span> Semaphore& other) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  Semaphore& operator=(<span class="keyword">const</span> Semaphore& other) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span> </div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  Semaphore(<span class="keywordtype">int</span> initialCount = 0)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  {</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  assert(initialCount >= 0);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span>  sem_init(&m_sema, 0, initialCount);</div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  }</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  ~Semaphore()</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  {</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span>  sem_destroy(&m_sema);</div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span>  }</div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> </div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span>  <span class="keywordtype">void</span> wait()</div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span>  {</div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  <span class="comment">// http://stackoverflow.com/questions/2013181/gdb-causes-sem-wait-to-fail-with-eintr-error</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span>  <span class="keywordtype">int</span> rc;</div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  rc = sem_wait(&m_sema);</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  } <span class="keywordflow">while</span> (rc == -1 && errno == EINTR);</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> </div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  <span class="keywordtype">bool</span> try_wait()</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <span class="keywordtype">int</span> rc;</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  rc = sem_trywait(&m_sema);</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  } <span class="keywordflow">while</span> (rc == -1 && errno == EINTR);</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keywordflow">return</span> !(rc == -1 && errno == EAGAIN);</div><div class="line"><a name="l00213"></a><span class="lineno"> 213</span>  }</div><div class="line"><a name="l00214"></a><span class="lineno"> 214</span> </div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span>  <span class="keywordtype">bool</span> timed_wait(std::uint64_t usecs)</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>  <span class="keyword">struct </span>timespec ts;</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> usecs_in_1_sec = 1000000;</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="keyword">const</span> <span class="keywordtype">int</span> nsecs_in_1_sec = 1000000000;</div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  clock_gettime(CLOCK_REALTIME, &ts);</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  ts.tv_sec += usecs / usecs_in_1_sec;</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  ts.tv_nsec += (usecs % usecs_in_1_sec) * 1000;</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// sem_timedwait bombs if you have more than 1e9 in tv_nsec</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  <span class="comment">// so we have to clean things up before passing it in</span></div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">if</span> (ts.tv_nsec >= nsecs_in_1_sec) {</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  ts.tv_nsec -= nsecs_in_1_sec;</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  ++ts.tv_sec;</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span>  }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span>  <span class="keywordtype">int</span> rc;</div><div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keywordflow">do</span> {</div><div class="line"><a name="l00232"></a><span class="lineno"> 232</span>  rc = sem_timedwait(&m_sema, &ts);</div><div class="line"><a name="l00233"></a><span class="lineno"> 233</span>  } <span class="keywordflow">while</span> (rc == -1 && errno == EINTR);</div><div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  <span class="keywordflow">return</span> !(rc == -1 && errno == ETIMEDOUT);</div><div class="line"><a name="l00235"></a><span class="lineno"> 235</span>  }</div><div class="line"><a name="l00236"></a><span class="lineno"> 236</span> </div><div class="line"><a name="l00237"></a><span class="lineno"> 237</span>  <span class="keywordtype">void</span> signal()</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>  sem_post(&m_sema);</div><div class="line"><a name="l00240"></a><span class="lineno"> 240</span>  }</div><div class="line"><a name="l00241"></a><span class="lineno"> 241</span> </div><div class="line"><a name="l00242"></a><span class="lineno"> 242</span>  <span class="keywordtype">void</span> signal(<span class="keywordtype">int</span> count)</div><div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  {</div><div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keywordflow">while</span> (count-- > 0)</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>  sem_post(&m_sema);</div><div class="line"><a name="l00247"></a><span class="lineno"> 247</span>  }</div><div class="line"><a name="l00248"></a><span class="lineno"> 248</span>  }</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="preprocessor">#else</span></div><div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="preprocessor">#error Unsupported platform! (No semaphore wrapper available)</span></div><div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00253"></a><span class="lineno"> 253</span> </div><div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  <span class="comment">//---------------------------------------------------------</span></div><div class="line"><a name="l00255"></a><span class="lineno"> 255</span>  <span class="comment">// LightweightSemaphore</span></div><div class="line"><a name="l00256"></a><span class="lineno"> 256</span>  <span class="comment">//---------------------------------------------------------</span></div><div class="line"><a name="l00257"></a><span class="lineno"> 257</span>  <span class="keyword">class </span>LightweightSemaphore</div><div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  {</div><div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keyword">typedef</span> std::make_signed<std::size_t>::type ssize_t;</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="keyword">private</span>:</div><div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  std::atomic<ssize_t> m_count;</div><div class="line"><a name="l00264"></a><span class="lineno"> 264</span>  Semaphore m_sema;</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>  <span class="keywordtype">bool</span> waitWithPartialSpinning(std::int64_t timeout_usecs = -1)</div><div class="line"><a name="l00267"></a><span class="lineno"> 267</span>  {</div><div class="line"><a name="l00268"></a><span class="lineno"> 268</span>  ssize_t oldCount;</div><div class="line"><a name="l00269"></a><span class="lineno"> 269</span>  <span class="comment">// Is there a better way to set the initial spin count?</span></div><div class="line"><a name="l00270"></a><span class="lineno"> 270</span>  <span class="comment">// If we lower it to 1000, testBenaphore becomes 15x slower on my Core i7-5930K Windows PC,</span></div><div class="line"><a name="l00271"></a><span class="lineno"> 271</span>  <span class="comment">// as threads start hitting the kernel semaphore.</span></div><div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="keywordtype">int</span> spin = 10000;</div><div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keywordflow">while</span> (--spin >= 0)</div><div class="line"><a name="l00274"></a><span class="lineno"> 274</span>  {</div><div class="line"><a name="l00275"></a><span class="lineno"> 275</span>  oldCount = m_count.load(std::memory_order_relaxed);</div><div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="keywordflow">if</span> ((oldCount > 0) && m_count.compare_exchange_strong(oldCount, oldCount - 1, std::memory_order_acquire, std::memory_order_relaxed))</div><div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  std::atomic_signal_fence(std::memory_order_acquire); <span class="comment">// Prevent the compiler from collapsing the loop.</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>  oldCount = m_count.fetch_sub(1, std::memory_order_acquire);</div><div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="keywordflow">if</span> (oldCount > 0)</div><div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="keywordflow">if</span> (timeout_usecs < 0)</div><div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  {</div><div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  m_sema.wait();</div><div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  }</div><div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="keywordflow">if</span> (m_sema.timed_wait((std::uint64_t)timeout_usecs))</div><div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// At this point, we've timed out waiting for the semaphore, but the</span></div><div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// count is still decremented indicating we may still be waiting on</span></div><div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="comment">// it. So we have to re-adjust the count, but only if the semaphore</span></div><div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  <span class="comment">// wasn't signaled enough times for us too since then. If it was, we</span></div><div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// need to release the semaphore too.</span></div><div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>)</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>  oldCount = m_count.load(std::memory_order_acquire);</div><div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="keywordflow">if</span> (oldCount >= 0 && m_sema.try_wait())</div><div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  <span class="keywordflow">if</span> (oldCount < 0 && m_count.compare_exchange_strong(oldCount, oldCount + 1, std::memory_order_relaxed, std::memory_order_relaxed))</div><div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="keywordflow">return</span> <span class="keyword">false</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>  ssize_t waitManyWithPartialSpinning(ssize_t max, std::int64_t timeout_usecs = -1)</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>  assert(max > 0);</div><div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  ssize_t oldCount;</div><div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="keywordtype">int</span> spin = 10000;</div><div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="keywordflow">while</span> (--spin >= 0)</div><div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  {</div><div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  oldCount = m_count.load(std::memory_order_relaxed);</div><div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keywordflow">if</span> (oldCount > 0)</div><div class="line"><a name="l00314"></a><span class="lineno"> 314</span>  {</div><div class="line"><a name="l00315"></a><span class="lineno"> 315</span>  ssize_t newCount = oldCount > max ? oldCount - max : 0;</div><div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="keywordflow">if</span> (m_count.compare_exchange_strong(oldCount, newCount, std::memory_order_acquire, std::memory_order_relaxed))</div><div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="keywordflow">return</span> oldCount - newCount;</div><div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  }</div><div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  std::atomic_signal_fence(std::memory_order_acquire);</div><div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  }</div><div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  oldCount = m_count.fetch_sub(1, std::memory_order_acquire);</div><div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="keywordflow">if</span> (oldCount <= 0)</div><div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  {</div><div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keywordflow">if</span> (timeout_usecs < 0)</div><div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  m_sema.wait();</div><div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  <span class="keywordflow">else</span> <span class="keywordflow">if</span> (!m_sema.timed_wait((std::uint64_t)timeout_usecs))</div><div class="line"><a name="l00327"></a><span class="lineno"> 327</span>  {</div><div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="keywordflow">while</span> (<span class="keyword">true</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>  oldCount = m_count.load(std::memory_order_acquire);</div><div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="keywordflow">if</span> (oldCount >= 0 && m_sema.try_wait())</div><div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="keywordflow">break</span>;</div><div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keywordflow">if</span> (oldCount < 0 && m_count.compare_exchange_strong(oldCount, oldCount + 1, std::memory_order_relaxed, std::memory_order_relaxed))</div><div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keywordflow">return</span> 0;</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">if</span> (max > 1)</div><div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keywordflow">return</span> 1 + tryWaitMany(max - 1);</div><div class="line"><a name="l00340"></a><span class="lineno"> 340</span>  <span class="keywordflow">return</span> 1;</div><div class="line"><a name="l00341"></a><span class="lineno"> 341</span>  }</div><div class="line"><a name="l00342"></a><span class="lineno"> 342</span> </div><div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="keyword">public</span>:</div><div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  LightweightSemaphore(ssize_t initialCount = 0) : m_count(initialCount)</div><div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  {</div><div class="line"><a name="l00346"></a><span class="lineno"> 346</span>  assert(initialCount >= 0);</div><div class="line"><a name="l00347"></a><span class="lineno"> 347</span>  }</div><div class="line"><a name="l00348"></a><span class="lineno"> 348</span> </div><div class="line"><a name="l00349"></a><span class="lineno"> 349</span>  <span class="keywordtype">bool</span> tryWait()</div><div class="line"><a name="l00350"></a><span class="lineno"> 350</span>  {</div><div class="line"><a name="l00351"></a><span class="lineno"> 351</span>  ssize_t oldCount = m_count.load(std::memory_order_relaxed);</div><div class="line"><a name="l00352"></a><span class="lineno"> 352</span>  <span class="keywordflow">while</span> (oldCount > 0)</div><div class="line"><a name="l00353"></a><span class="lineno"> 353</span>  {</div><div class="line"><a name="l00354"></a><span class="lineno"> 354</span>  <span class="keywordflow">if</span> (m_count.compare_exchange_weak(oldCount, oldCount - 1, std::memory_order_acquire, std::memory_order_relaxed))</div><div class="line"><a name="l00355"></a><span class="lineno"> 355</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00356"></a><span class="lineno"> 356</span>  }</div><div class="line"><a name="l00357"></a><span class="lineno"> 357</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00358"></a><span class="lineno"> 358</span>  }</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="keywordtype">void</span> wait()</div><div class="line"><a name="l00361"></a><span class="lineno"> 361</span>  {</div><div class="line"><a name="l00362"></a><span class="lineno"> 362</span>  <span class="keywordflow">if</span> (!tryWait())</div><div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  waitWithPartialSpinning();</div><div class="line"><a name="l00364"></a><span class="lineno"> 364</span>  }</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>  <span class="keywordtype">bool</span> wait(std::int64_t timeout_usecs)</div><div class="line"><a name="l00367"></a><span class="lineno"> 367</span>  {</div><div class="line"><a name="l00368"></a><span class="lineno"> 368</span>  <span class="keywordflow">return</span> tryWait() || waitWithPartialSpinning(timeout_usecs);</div><div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  }</div><div class="line"><a name="l00370"></a><span class="lineno"> 370</span> </div><div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  <span class="comment">// Acquires between 0 and (greedily) max, inclusive</span></div><div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  ssize_t tryWaitMany(ssize_t max)</div><div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  {</div><div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  assert(max >= 0);</div><div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  ssize_t oldCount = m_count.load(std::memory_order_relaxed);</div><div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  <span class="keywordflow">while</span> (oldCount > 0)</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>  ssize_t newCount = oldCount > max ? oldCount - max : 0;</div><div class="line"><a name="l00379"></a><span class="lineno"> 379</span>  <span class="keywordflow">if</span> (m_count.compare_exchange_weak(oldCount, newCount, std::memory_order_acquire, std::memory_order_relaxed))</div><div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keywordflow">return</span> oldCount - newCount;</div><div class="line"><a name="l00381"></a><span class="lineno"> 381</span>  }</div><div class="line"><a name="l00382"></a><span class="lineno"> 382</span>  <span class="keywordflow">return</span> 0;</div><div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  }</div><div class="line"><a name="l00384"></a><span class="lineno"> 384</span> </div><div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// Acquires at least one, and (greedily) at most max</span></div><div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  ssize_t waitMany(ssize_t max, std::int64_t timeout_usecs)</div><div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  {</div><div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  assert(max >= 0);</div><div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  ssize_t result = tryWaitMany(max);</div><div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">if</span> (result == 0 && max > 0)</div><div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  result = waitManyWithPartialSpinning(max, timeout_usecs);</div><div class="line"><a name="l00392"></a><span class="lineno"> 392</span>  <span class="keywordflow">return</span> result;</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>  ssize_t waitMany(ssize_t max)</div><div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  {</div><div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  ssize_t result = waitMany(max, -1);</div><div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  assert(result > 0);</div><div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  <span class="keywordflow">return</span> result;</div><div class="line"><a name="l00400"></a><span class="lineno"> 400</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="keywordtype">void</span> signal(ssize_t count = 1)</div><div class="line"><a name="l00403"></a><span class="lineno"> 403</span>  {</div><div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  assert(count >= 0);</div><div class="line"><a name="l00405"></a><span class="lineno"> 405</span>  ssize_t oldCount = m_count.fetch_add(count, std::memory_order_release);</div><div class="line"><a name="l00406"></a><span class="lineno"> 406</span>  ssize_t toRelease = -oldCount < count ? -oldCount : count;</div><div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  <span class="keywordflow">if</span> (toRelease > 0)</div><div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  {</div><div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  m_sema.signal((<span class="keywordtype">int</span>)toRelease);</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>  }</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>  ssize_t availableApprox()<span class="keyword"> const</span></div><div class="line"><a name="l00414"></a><span class="lineno"> 414</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00415"></a><span class="lineno"> 415</span>  ssize_t count = m_count.load(std::memory_order_relaxed);</div><div class="line"><a name="l00416"></a><span class="lineno"> 416</span>  <span class="keywordflow">return</span> count > 0 ? count : 0;</div><div class="line"><a name="l00417"></a><span class="lineno"> 417</span>  }</div><div class="line"><a name="l00418"></a><span class="lineno"> 418</span>  };</div><div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  } <span class="comment">// end namespace mpmc_sema</span></div><div class="line"><a name="l00420"></a><span class="lineno"> 420</span> } <span class="comment">// end namespace details</span></div><div class="line"><a name="l00421"></a><span class="lineno"> 421</span> </div><div class="line"><a name="l00422"></a><span class="lineno"> 422</span> </div><div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="comment">// This is a blocking version of the queue. It has an almost identical interface to</span></div><div class="line"><a name="l00424"></a><span class="lineno"> 424</span> <span class="comment">// the normal non-blocking version, with the addition of various wait_dequeue() methods</span></div><div class="line"><a name="l00425"></a><span class="lineno"> 425</span> <span class="comment">// and the removal of producer-specific dequeue methods.</span></div><div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits = ConcurrentQueueDefaultTraits></div><div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="keyword">class </span>BlockingConcurrentQueue</div><div class="line"><a name="l00428"></a><span class="lineno"> 428</span> {</div><div class="line"><a name="l00429"></a><span class="lineno"> 429</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  typedef ::dmlc::moodycamel::ConcurrentQueue<T, Traits> ConcurrentQueue;</div><div class="line"><a name="l00431"></a><span class="lineno"> 431</span>  <span class="keyword">typedef</span> details::mpmc_sema::LightweightSemaphore LightweightSemaphore;</div><div class="line"><a name="l00432"></a><span class="lineno"> 432</span> </div><div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00434"></a><span class="lineno"> 434</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> ConcurrentQueue::producer_token_t producer_token_t;</div><div class="line"><a name="l00435"></a><span class="lineno"> 435</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> ConcurrentQueue::consumer_token_t consumer_token_t;</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>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">ConcurrentQueue::index_t</a> <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a>;</div><div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> ConcurrentQueue::size_t size_t;</div><div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> std::make_signed<size_t>::type ssize_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>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> BLOCK_SIZE = ConcurrentQueue::BLOCK_SIZE;</div><div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD = ConcurrentQueue::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD;</div><div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> EXPLICIT_INITIAL_INDEX_SIZE = ConcurrentQueue::EXPLICIT_INITIAL_INDEX_SIZE;</div><div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> IMPLICIT_INITIAL_INDEX_SIZE = ConcurrentQueue::IMPLICIT_INITIAL_INDEX_SIZE;</div><div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> INITIAL_IMPLICIT_PRODUCER_HASH_SIZE = ConcurrentQueue::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE;</div><div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::uint32_t EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE = ConcurrentQueue::EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE;</div><div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> MAX_SUBQUEUE_SIZE = ConcurrentQueue::MAX_SUBQUEUE_SIZE;</div><div class="line"><a name="l00448"></a><span class="lineno"> 448</span> </div><div class="line"><a name="l00449"></a><span class="lineno"> 449</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00450"></a><span class="lineno"> 450</span>  <span class="comment">// Creates a queue with at least `capacity` element slots; note that the</span></div><div class="line"><a name="l00451"></a><span class="lineno"> 451</span>  <span class="comment">// actual number of elements that can be inserted without additional memory</span></div><div class="line"><a name="l00452"></a><span class="lineno"> 452</span>  <span class="comment">// allocation depends on the number of producers and the block size (e.g. if</span></div><div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  <span class="comment">// the block size is equal to `capacity`, only a single block will be allocated</span></div><div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  <span class="comment">// up-front, which means only a single producer will be able to enqueue elements</span></div><div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  <span class="comment">// without an extra allocation -- blocks aren't shared between producers).</span></div><div class="line"><a name="l00456"></a><span class="lineno"> 456</span>  <span class="comment">// This method is not thread safe -- it is up to the user to ensure that the</span></div><div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  <span class="comment">// queue is fully constructed before it starts being used by other threads (this</span></div><div class="line"><a name="l00458"></a><span class="lineno"> 458</span>  <span class="comment">// includes making the memory effects of construction visible, possibly with a</span></div><div class="line"><a name="l00459"></a><span class="lineno"> 459</span>  <span class="comment">// memory barrier).</span></div><div class="line"><a name="l00460"></a><span class="lineno"> 460</span>  <span class="keyword">explicit</span> BlockingConcurrentQueue(<span class="keywordtype">size_t</span> capacity = 6 * BLOCK_SIZE)</div><div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  : inner(capacity), sema(create<LightweightSemaphore>(), &BlockingConcurrentQueue::template destroy<LightweightSemaphore>)</div><div class="line"><a name="l00462"></a><span class="lineno"> 462</span>  {</div><div class="line"><a name="l00463"></a><span class="lineno"> 463</span>  assert(reinterpret_cast<ConcurrentQueue*>((BlockingConcurrentQueue*)1) == &((BlockingConcurrentQueue*)1)->inner && <span class="stringliteral">"BlockingConcurrentQueue must have ConcurrentQueue as its first member"</span>);</div><div class="line"><a name="l00464"></a><span class="lineno"> 464</span>  <span class="keywordflow">if</span> (!sema) {</div><div class="line"><a name="l00465"></a><span class="lineno"> 465</span>  MOODYCAMEL_THROW(std::bad_alloc());</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>  }</div><div class="line"><a name="l00468"></a><span class="lineno"> 468</span> </div><div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  BlockingConcurrentQueue(<span class="keywordtype">size_t</span> minCapacity, <span class="keywordtype">size_t</span> maxExplicitProducers, <span class="keywordtype">size_t</span> maxImplicitProducers)</div><div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  : inner(minCapacity, maxExplicitProducers, maxImplicitProducers), sema(create<LightweightSemaphore>(), &BlockingConcurrentQueue::template destroy<LightweightSemaphore>)</div><div class="line"><a name="l00471"></a><span class="lineno"> 471</span>  {</div><div class="line"><a name="l00472"></a><span class="lineno"> 472</span>  assert(reinterpret_cast<ConcurrentQueue*>((BlockingConcurrentQueue*)1) == &((BlockingConcurrentQueue*)1)->inner && <span class="stringliteral">"BlockingConcurrentQueue must have ConcurrentQueue as its first member"</span>);</div><div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  <span class="keywordflow">if</span> (!sema) {</div><div class="line"><a name="l00474"></a><span class="lineno"> 474</span>  MOODYCAMEL_THROW(std::bad_alloc());</div><div class="line"><a name="l00475"></a><span class="lineno"> 475</span>  }</div><div class="line"><a name="l00476"></a><span class="lineno"> 476</span>  }</div><div class="line"><a name="l00477"></a><span class="lineno"> 477</span> </div><div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="comment">// Disable copying and copy assignment</span></div><div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  BlockingConcurrentQueue(BlockingConcurrentQueue <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  BlockingConcurrentQueue& operator=(BlockingConcurrentQueue <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div><div class="line"><a name="l00481"></a><span class="lineno"> 481</span> </div><div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  <span class="comment">// Moving is supported, but note that it is *not* a thread-safe operation.</span></div><div class="line"><a name="l00483"></a><span class="lineno"> 483</span>  <span class="comment">// Nobody can use the queue while it's being moved, and the memory effects</span></div><div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  <span class="comment">// of that move must be propagated to other threads before they can use it.</span></div><div class="line"><a name="l00485"></a><span class="lineno"> 485</span>  <span class="comment">// Note: When a queue is moved, its tokens are still valid but can only be</span></div><div class="line"><a name="l00486"></a><span class="lineno"> 486</span>  <span class="comment">// used with the destination queue (i.e. semantically they are moved along</span></div><div class="line"><a name="l00487"></a><span class="lineno"> 487</span>  <span class="comment">// with the queue itself).</span></div><div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  BlockingConcurrentQueue(BlockingConcurrentQueue&& other) MOODYCAMEL_NOEXCEPT</div><div class="line"><a name="l00489"></a><span class="lineno"> 489</span>  : inner(std::move(other.inner)), sema(std::move(other.sema))</div><div class="line"><a name="l00490"></a><span class="lineno"> 490</span>  { }</div><div class="line"><a name="l00491"></a><span class="lineno"> 491</span> </div><div class="line"><a name="l00492"></a><span class="lineno"> 492</span>  <span class="keyword">inline</span> BlockingConcurrentQueue& operator=(BlockingConcurrentQueue&& other) MOODYCAMEL_NOEXCEPT</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="keywordflow">return</span> swap_internal(other);</div><div class="line"><a name="l00495"></a><span class="lineno"> 495</span>  }</div><div class="line"><a name="l00496"></a><span class="lineno"> 496</span> </div><div class="line"><a name="l00497"></a><span class="lineno"> 497</span>  <span class="comment">// Swaps this queue's state with the other's. Not thread-safe.</span></div><div class="line"><a name="l00498"></a><span class="lineno"> 498</span>  <span class="comment">// Swapping two queues does not invalidate their tokens, however</span></div><div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="comment">// the tokens that were created for one queue must be used with</span></div><div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="comment">// only the swapped queue (i.e. the tokens are tied to the</span></div><div class="line"><a name="l00501"></a><span class="lineno"> 501</span>  <span class="comment">// queue's movable state, not the object itself).</span></div><div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(BlockingConcurrentQueue& other) MOODYCAMEL_NOEXCEPT</div><div class="line"><a name="l00503"></a><span class="lineno"> 503</span>  {</div><div class="line"><a name="l00504"></a><span class="lineno"> 504</span>  swap_internal(other);</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> </div><div class="line"><a name="l00507"></a><span class="lineno"> 507</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  BlockingConcurrentQueue& swap_internal(BlockingConcurrentQueue& other)</div><div class="line"><a name="l00509"></a><span class="lineno"> 509</span>  {</div><div class="line"><a name="l00510"></a><span class="lineno"> 510</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> == &other) {</div><div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div><div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  }</div><div class="line"><a name="l00513"></a><span class="lineno"> 513</span> </div><div class="line"><a name="l00514"></a><span class="lineno"> 514</span>  inner.swap(other.inner);</div><div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  sema.swap(other.sema);</div><div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  <span class="keywordflow">return</span> *<span class="keyword">this</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> </div><div class="line"><a name="l00519"></a><span class="lineno"> 519</span> <span class="keyword">public</span>:</div><div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  <span class="comment">// Enqueues a single item (by copying it).</span></div><div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or implicit</span></div><div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="comment">// production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0,</span></div><div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  <span class="comment">// or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div><div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(T <span class="keyword">const</span>& item)</div><div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  {</div><div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (details::likely(inner.enqueue(item))) {</div><div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  sema->signal();</div><div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00530"></a><span class="lineno"> 530</span>  }</div><div class="line"><a name="l00531"></a><span class="lineno"> 531</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> </div><div class="line"><a name="l00534"></a><span class="lineno"> 534</span>  <span class="comment">// Enqueues a single item (by moving it, if possible).</span></div><div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or implicit</span></div><div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  <span class="comment">// production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0,</span></div><div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  <span class="comment">// or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div><div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(T&& item)</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>  <span class="keywordflow">if</span> (details::likely(inner.enqueue(std::move(item)))) {</div><div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  sema->signal();</div><div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  }</div><div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00546"></a><span class="lineno"> 546</span>  }</div><div class="line"><a name="l00547"></a><span class="lineno"> 547</span> </div><div class="line"><a name="l00548"></a><span class="lineno"> 548</span>  <span class="comment">// Enqueues a single item (by copying it) using an explicit producer token.</span></div><div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or</span></div><div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="comment">// Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div><div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(producer_token_t <span class="keyword">const</span>& token, T <span class="keyword">const</span>& item)</div><div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  {</div><div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  <span class="keywordflow">if</span> (details::likely(inner.enqueue(token, item))) {</div><div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  sema->signal();</div><div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  }</div><div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  <span class="keywordflow">return</span> <span class="keyword">false</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> </div><div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  <span class="comment">// Enqueues a single item (by moving it, if possible) using an explicit producer token.</span></div><div class="line"><a name="l00562"></a><span class="lineno"> 562</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or</span></div><div class="line"><a name="l00563"></a><span class="lineno"> 563</span>  <span class="comment">// Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div><div class="line"><a name="l00564"></a><span class="lineno"> 564</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00565"></a><span class="lineno"> 565</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(producer_token_t <span class="keyword">const</span>& token, T&& item)</div><div class="line"><a name="l00566"></a><span class="lineno"> 566</span>  {</div><div class="line"><a name="l00567"></a><span class="lineno"> 567</span>  <span class="keywordflow">if</span> (details::likely(inner.enqueue(token, std::move(item)))) {</div><div class="line"><a name="l00568"></a><span class="lineno"> 568</span>  sema->signal();</div><div class="line"><a name="l00569"></a><span class="lineno"> 569</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00570"></a><span class="lineno"> 570</span>  }</div><div class="line"><a name="l00571"></a><span class="lineno"> 571</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00572"></a><span class="lineno"> 572</span>  }</div><div class="line"><a name="l00573"></a><span class="lineno"> 573</span> </div><div class="line"><a name="l00574"></a><span class="lineno"> 574</span>  <span class="comment">// Enqueues several items.</span></div><div class="line"><a name="l00575"></a><span class="lineno"> 575</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or</span></div><div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="comment">// implicit production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE</span></div><div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="comment">// is 0, or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div><div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved instead of copied.</span></div><div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count)</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="keywordflow">if</span> (details::likely(inner.enqueue_bulk(std::forward<It>(itemFirst), count))) {</div><div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  sema->signal((LightweightSemaphore::ssize_t)(ssize_t)count);</div><div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  }</div><div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> </div><div class="line"><a name="l00590"></a><span class="lineno"> 590</span>  <span class="comment">// Enqueues several items using an explicit producer token.</span></div><div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails</span></div><div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  <span class="comment">// (or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div><div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved</span></div><div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="comment">// instead of copied.</span></div><div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue_bulk(producer_token_t <span class="keyword">const</span>& token, It itemFirst, <span class="keywordtype">size_t</span> count)</div><div class="line"><a name="l00598"></a><span class="lineno"> 598</span>  {</div><div class="line"><a name="l00599"></a><span class="lineno"> 599</span>  <span class="keywordflow">if</span> (details::likely(inner.enqueue_bulk(token, std::forward<It>(itemFirst), count))) {</div><div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  sema->signal((LightweightSemaphore::ssize_t)(ssize_t)count);</div><div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00602"></a><span class="lineno"> 602</span>  }</div><div class="line"><a name="l00603"></a><span class="lineno"> 603</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  }</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>  <span class="comment">// Enqueues a single item (by copying it).</span></div><div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue (or implicit</span></div><div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE</span></div><div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// is 0).</span></div><div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue(T <span class="keyword">const</span>& item)</div><div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  {</div><div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="keywordflow">if</span> (inner.try_enqueue(item)) {</div><div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  sema->signal();</div><div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  }</div><div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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> </div><div class="line"><a name="l00620"></a><span class="lineno"> 620</span>  <span class="comment">// Enqueues a single item (by moving it, if possible).</span></div><div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  <span class="comment">// Does not allocate memory (except for one-time implicit producer).</span></div><div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  <span class="comment">// Fails if not enough room to enqueue (or implicit production is</span></div><div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  <span class="comment">// disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0).</span></div><div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue(T&& item)</div><div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  {</div><div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  <span class="keywordflow">if</span> (inner.try_enqueue(std::move(item))) {</div><div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  sema->signal();</div><div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  }</div><div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  <span class="comment">// Enqueues a single item (by copying it) using an explicit producer token.</span></div><div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue.</span></div><div class="line"><a name="l00636"></a><span class="lineno"> 636</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue(producer_token_t <span class="keyword">const</span>& token, T <span class="keyword">const</span>& item)</div><div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  {</div><div class="line"><a name="l00639"></a><span class="lineno"> 639</span>  <span class="keywordflow">if</span> (inner.try_enqueue(token, item)) {</div><div class="line"><a name="l00640"></a><span class="lineno"> 640</span>  sema->signal();</div><div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  }</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>  <span class="comment">// Enqueues a single item (by moving it, if possible) using an explicit producer token.</span></div><div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue.</span></div><div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue(producer_token_t <span class="keyword">const</span>& token, T&& item)</div><div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  {</div><div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  <span class="keywordflow">if</span> (inner.try_enqueue(token, std::move(item))) {</div><div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  sema->signal();</div><div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  }</div><div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00656"></a><span class="lineno"> 656</span>  }</div><div class="line"><a name="l00657"></a><span class="lineno"> 657</span> </div><div class="line"><a name="l00658"></a><span class="lineno"> 658</span>  <span class="comment">// Enqueues several items.</span></div><div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  <span class="comment">// Does not allocate memory (except for one-time implicit producer).</span></div><div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  <span class="comment">// Fails if not enough room to enqueue (or implicit production is</span></div><div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  <span class="comment">// disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0).</span></div><div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved</span></div><div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  <span class="comment">// instead of copied.</span></div><div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count)</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>  <span class="keywordflow">if</span> (inner.try_enqueue_bulk(std::forward<It>(itemFirst), count)) {</div><div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  sema->signal((LightweightSemaphore::ssize_t)(ssize_t)count);</div><div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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>  <span class="keywordflow">return</span> <span class="keyword">false</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> </div><div class="line"><a name="l00675"></a><span class="lineno"> 675</span>  <span class="comment">// Enqueues several items using an explicit producer token.</span></div><div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue.</span></div><div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved</span></div><div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  <span class="comment">// instead of copied.</span></div><div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00681"></a><span class="lineno"> 681</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue_bulk(producer_token_t <span class="keyword">const</span>& token, It itemFirst, <span class="keywordtype">size_t</span> count)</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="keywordflow">if</span> (inner.try_enqueue_bulk(token, std::forward<It>(itemFirst), count)) {</div><div class="line"><a name="l00684"></a><span class="lineno"> 684</span>  sema->signal((LightweightSemaphore::ssize_t)(ssize_t)count);</div><div class="line"><a name="l00685"></a><span class="lineno"> 685</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00686"></a><span class="lineno"> 686</span>  }</div><div class="line"><a name="l00687"></a><span class="lineno"> 687</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00688"></a><span class="lineno"> 688</span>  }</div><div class="line"><a name="l00689"></a><span class="lineno"> 689</span> </div><div class="line"><a name="l00690"></a><span class="lineno"> 690</span> </div><div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="comment">// Attempts to dequeue from the queue.</span></div><div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  <span class="comment">// Returns false if all producer streams appeared empty at the time they</span></div><div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div><div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_dequeue(U& item)</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>  <span class="keywordflow">if</span> (sema->tryWait()) {</div><div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keywordflow">while</span> (!inner.try_dequeue(item)) {</div><div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keywordflow">continue</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">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  }</div><div class="line"><a name="l00704"></a><span class="lineno"> 704</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00705"></a><span class="lineno"> 705</span>  }</div><div class="line"><a name="l00706"></a><span class="lineno"> 706</span> </div><div class="line"><a name="l00707"></a><span class="lineno"> 707</span>  <span class="comment">// Attempts to dequeue from the queue using an explicit consumer token.</span></div><div class="line"><a name="l00708"></a><span class="lineno"> 708</span>  <span class="comment">// Returns false if all producer streams appeared empty at the time they</span></div><div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div><div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_dequeue(consumer_token_t& token, U& item)</div><div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  {</div><div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  <span class="keywordflow">if</span> (sema->tryWait()) {</div><div class="line"><a name="l00715"></a><span class="lineno"> 715</span>  <span class="keywordflow">while</span> (!inner.try_dequeue(token, item)) {</div><div class="line"><a name="l00716"></a><span class="lineno"> 716</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00717"></a><span class="lineno"> 717</span>  }</div><div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  }</div><div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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>  <span class="comment">// Attempts to dequeue several elements from the queue.</span></div><div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="comment">// Returns the number of items actually dequeued.</span></div><div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  <span class="comment">// Returns 0 if all producer streams appeared empty at the time they</span></div><div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div><div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> try_dequeue_bulk(It itemFirst, <span class="keywordtype">size_t</span> max)</div><div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  {</div><div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  <span class="keywordtype">size_t</span> count = 0;</div><div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  max = (size_t)sema->tryWaitMany((LightweightSemaphore::ssize_t)(ssize_t)max);</div><div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="keywordflow">while</span> (count != max) {</div><div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  count += inner.template try_dequeue_bulk<It&>(itemFirst, max - count);</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>  <span class="keywordflow">return</span> count;</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> </div><div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="comment">// Attempts to dequeue several elements from the queue using an explicit consumer token.</span></div><div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  <span class="comment">// Returns the number of items actually dequeued.</span></div><div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  <span class="comment">// Returns 0 if all producer streams appeared empty at the time they</span></div><div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div><div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> try_dequeue_bulk(consumer_token_t& token, It itemFirst, <span class="keywordtype">size_t</span> max)</div><div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  {</div><div class="line"><a name="l00747"></a><span class="lineno"> 747</span>  <span class="keywordtype">size_t</span> count = 0;</div><div class="line"><a name="l00748"></a><span class="lineno"> 748</span>  max = (size_t)sema->tryWaitMany((LightweightSemaphore::ssize_t)(ssize_t)max);</div><div class="line"><a name="l00749"></a><span class="lineno"> 749</span>  <span class="keywordflow">while</span> (count != max) {</div><div class="line"><a name="l00750"></a><span class="lineno"> 750</span>  count += inner.template try_dequeue_bulk<It&>(token, itemFirst, max - count);</div><div class="line"><a name="l00751"></a><span class="lineno"> 751</span>  }</div><div class="line"><a name="l00752"></a><span class="lineno"> 752</span>  <span class="keywordflow">return</span> count;</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> </div><div class="line"><a name="l00756"></a><span class="lineno"> 756</span> </div><div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  <span class="comment">// Blocks the current thread until there's something to dequeue, then</span></div><div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  <span class="comment">// dequeues it.</span></div><div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> wait_dequeue(U& item)</div><div class="line"><a name="l00762"></a><span class="lineno"> 762</span>  {</div><div class="line"><a name="l00763"></a><span class="lineno"> 763</span>  sema->wait();</div><div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="keywordflow">while</span> (!inner.try_dequeue(item)) {</div><div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="keywordflow">continue</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>  }</div><div class="line"><a name="l00768"></a><span class="lineno"> 768</span> </div><div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  <span class="comment">// Blocks the current thread until either there's something to dequeue</span></div><div class="line"><a name="l00770"></a><span class="lineno"> 770</span>  <span class="comment">// or the timeout (specified in microseconds) expires. Returns false</span></div><div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  <span class="comment">// without setting `item` if the timeout expires, otherwise assigns</span></div><div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  <span class="comment">// to `item` and returns true.</span></div><div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// Using a negative timeout indicates an indefinite timeout,</span></div><div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// and is thus functionally equivalent to calling wait_dequeue.</span></div><div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00777"></a><span class="lineno"> 777</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> wait_dequeue_timed(U& item, std::int64_t timeout_usecs)</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="keywordflow">if</span> (!sema->wait(timeout_usecs)) {</div><div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</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="keywordflow">while</span> (!inner.try_dequeue(item)) {</div><div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  <span class="keywordflow">continue</span>;</div><div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  }</div><div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00786"></a><span class="lineno"> 786</span>  }</div><div class="line"><a name="l00787"></a><span class="lineno"> 787</span> </div><div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  <span class="comment">// Blocks the current thread until either there's something to dequeue</span></div><div class="line"><a name="l00789"></a><span class="lineno"> 789</span>  <span class="comment">// or the timeout expires. Returns false without setting `item` if the</span></div><div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  <span class="comment">// timeout expires, otherwise assigns to `item` and returns true.</span></div><div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> Rep, <span class="keyword">typename</span> Period></div><div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> wait_dequeue_timed(U& item, std::chrono::duration<Rep, Period> <span class="keyword">const</span>& timeout)</div><div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  {</div><div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  <span class="keywordflow">return</span> wait_dequeue_timed(item, std::chrono::duration_cast<std::chrono::microseconds>(timeout).count());</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>  <span class="comment">// Blocks the current thread until there's something to dequeue, then</span></div><div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="comment">// dequeues it using an explicit consumer token.</span></div><div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> wait_dequeue(consumer_token_t& token, U& item)</div><div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  {</div><div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  sema->wait();</div><div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  <span class="keywordflow">while</span> (!inner.try_dequeue(token, item)) {</div><div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  <span class="keywordflow">continue</span>;</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> </div><div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="comment">// Blocks the current thread until either there's something to dequeue</span></div><div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="comment">// or the timeout (specified in microseconds) expires. Returns false</span></div><div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="comment">// without setting `item` if the timeout expires, otherwise assigns</span></div><div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="comment">// to `item` and returns true.</span></div><div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="comment">// Using a negative timeout indicates an indefinite timeout,</span></div><div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  <span class="comment">// and is thus functionally equivalent to calling wait_dequeue.</span></div><div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> wait_dequeue_timed(consumer_token_t& token, U& item, std::int64_t timeout_usecs)</div><div class="line"><a name="l00819"></a><span class="lineno"> 819</span>  {</div><div class="line"><a name="l00820"></a><span class="lineno"> 820</span>  <span class="keywordflow">if</span> (!sema->wait(timeout_usecs)) {</div><div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div><div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  <span class="keywordflow">while</span> (!inner.try_dequeue(token, item)) {</div><div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="keywordflow">continue</span>;</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="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  }</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>  <span class="comment">// Blocks the current thread until either there's something to dequeue</span></div><div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  <span class="comment">// or the timeout expires. Returns false without setting `item` if the</span></div><div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  <span class="comment">// timeout expires, otherwise assigns to `item` and returns true.</span></div><div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> Rep, <span class="keyword">typename</span> Period></div><div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> wait_dequeue_timed(consumer_token_t& token, U& item, std::chrono::duration<Rep, Period> <span class="keyword">const</span>& timeout)</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>  <span class="keywordflow">return</span> wait_dequeue_timed(token, item, std::chrono::duration_cast<std::chrono::microseconds>(timeout).count());</div><div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  }</div><div class="line"><a name="l00838"></a><span class="lineno"> 838</span> </div><div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  <span class="comment">// Attempts to dequeue several elements from the queue.</span></div><div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  <span class="comment">// Returns the number of items actually dequeued, which will</span></div><div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  <span class="comment">// always be at least one (this method blocks until the queue</span></div><div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  <span class="comment">// is non-empty) and at most max.</span></div><div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00844"></a><span class="lineno"> 844</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00845"></a><span class="lineno"> 845</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> wait_dequeue_bulk(It itemFirst, <span class="keywordtype">size_t</span> max)</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>  <span class="keywordtype">size_t</span> count = 0;</div><div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  max = (size_t)sema->waitMany((LightweightSemaphore::ssize_t)(ssize_t)max);</div><div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  <span class="keywordflow">while</span> (count != max) {</div><div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  count += inner.template try_dequeue_bulk<It&>(itemFirst, max - count);</div><div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  }</div><div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  <span class="keywordflow">return</span> count;</div><div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  }</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">// Attempts to dequeue several elements from the queue.</span></div><div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  <span class="comment">// Returns the number of items actually dequeued, which can</span></div><div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="comment">// be 0 if the timeout expires while waiting for elements,</span></div><div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  <span class="comment">// and at most max.</span></div><div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  <span class="comment">// Using a negative timeout indicates an indefinite timeout,</span></div><div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  <span class="comment">// and is thus functionally equivalent to calling wait_dequeue_bulk.</span></div><div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> wait_dequeue_bulk_timed(It itemFirst, <span class="keywordtype">size_t</span> max, std::int64_t timeout_usecs)</div><div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  {</div><div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  <span class="keywordtype">size_t</span> count = 0;</div><div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  max = (size_t)sema->waitMany((LightweightSemaphore::ssize_t)(ssize_t)max, timeout_usecs);</div><div class="line"><a name="l00867"></a><span class="lineno"> 867</span>  <span class="keywordflow">while</span> (count != max) {</div><div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  count += inner.template try_dequeue_bulk<It&>(itemFirst, max - count);</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">return</span> count;</div><div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  }</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>  <span class="comment">// Attempts to dequeue several elements from the queue.</span></div><div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  <span class="comment">// Returns the number of items actually dequeued, which can</span></div><div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  <span class="comment">// be 0 if the timeout expires while waiting for elements,</span></div><div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  <span class="comment">// and at most max.</span></div><div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It, <span class="keyword">typename</span> Rep, <span class="keyword">typename</span> Period></div><div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> wait_dequeue_bulk_timed(It itemFirst, <span class="keywordtype">size_t</span> max, std::chrono::duration<Rep, Period> <span class="keyword">const</span>& timeout)</div><div class="line"><a name="l00880"></a><span class="lineno"> 880</span>  {</div><div class="line"><a name="l00881"></a><span class="lineno"> 881</span>  <span class="keywordflow">return</span> wait_dequeue_bulk_timed<It&>(itemFirst, max, std::chrono::duration_cast<std::chrono::microseconds>(timeout).count());</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> </div><div class="line"><a name="l00884"></a><span class="lineno"> 884</span>  <span class="comment">// Attempts to dequeue several elements from the queue using an explicit consumer token.</span></div><div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="comment">// Returns the number of items actually dequeued, which will</span></div><div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="comment">// always be at least one (this method blocks until the queue</span></div><div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="comment">// is non-empty) and at most max.</span></div><div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> wait_dequeue_bulk(consumer_token_t& token, It itemFirst, <span class="keywordtype">size_t</span> max)</div><div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  {</div><div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  <span class="keywordtype">size_t</span> count = 0;</div><div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  max = (size_t)sema->waitMany((LightweightSemaphore::ssize_t)(ssize_t)max);</div><div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keywordflow">while</span> (count != max) {</div><div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  count += inner.template try_dequeue_bulk<It&>(token, itemFirst, max - count);</div><div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  }</div><div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">return</span> count;</div><div class="line"><a name="l00898"></a><span class="lineno"> 898</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>  <span class="comment">// Attempts to dequeue several elements from the queue using an explicit consumer token.</span></div><div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  <span class="comment">// Returns the number of items actually dequeued, which can</span></div><div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  <span class="comment">// be 0 if the timeout expires while waiting for elements,</span></div><div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  <span class="comment">// and at most max.</span></div><div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  <span class="comment">// Using a negative timeout indicates an indefinite timeout,</span></div><div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  <span class="comment">// and is thus functionally equivalent to calling wait_dequeue_bulk.</span></div><div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div><div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> wait_dequeue_bulk_timed(consumer_token_t& token, It itemFirst, <span class="keywordtype">size_t</span> max, std::int64_t timeout_usecs)</div><div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  {</div><div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  <span class="keywordtype">size_t</span> count = 0;</div><div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  max = (size_t)sema->waitMany((LightweightSemaphore::ssize_t)(ssize_t)max, timeout_usecs);</div><div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  <span class="keywordflow">while</span> (count != max) {</div><div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  count += inner.template try_dequeue_bulk<It&>(token, itemFirst, max - count);</div><div class="line"><a name="l00914"></a><span class="lineno"> 914</span>  }</div><div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  <span class="keywordflow">return</span> count;</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">// Attempts to dequeue several elements from the queue using an explicit consumer token.</span></div><div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="comment">// Returns the number of items actually dequeued, which can</span></div><div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  <span class="comment">// be 0 if the timeout expires while waiting for elements,</span></div><div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  <span class="comment">// and at most max.</span></div><div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="comment">// Never allocates. Thread-safe.</span></div><div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It, <span class="keyword">typename</span> Rep, <span class="keyword">typename</span> Period></div><div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> wait_dequeue_bulk_timed(consumer_token_t& token, It itemFirst, <span class="keywordtype">size_t</span> max, std::chrono::duration<Rep, Period> <span class="keyword">const</span>& timeout)</div><div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  {</div><div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="keywordflow">return</span> wait_dequeue_bulk_timed<It&>(token, itemFirst, max, std::chrono::duration_cast<std::chrono::microseconds>(timeout).count());</div><div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  }</div><div class="line"><a name="l00928"></a><span class="lineno"> 928</span> </div><div class="line"><a name="l00929"></a><span class="lineno"> 929</span> </div><div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="comment">// Returns an estimate of the total number of elements currently in the queue. This</span></div><div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  <span class="comment">// estimate is only accurate if the queue has completely stabilized before it is called</span></div><div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  <span class="comment">// (i.e. all enqueue and dequeue operations have completed and their memory effects are</span></div><div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="comment">// visible on the calling thread, and no further operations start while this method is</span></div><div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// being called).</span></div><div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> size_approx()<span class="keyword"> const</span></div><div class="line"><a name="l00937"></a><span class="lineno"> 937</span> <span class="keyword"> </span>{</div><div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keywordflow">return</span> (<span class="keywordtype">size_t</span>)sema->availableApprox();</div><div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  }</div><div class="line"><a name="l00940"></a><span class="lineno"> 940</span> </div><div class="line"><a name="l00941"></a><span class="lineno"> 941</span> </div><div class="line"><a name="l00942"></a><span class="lineno"> 942</span>  <span class="comment">// Returns true if the underlying atomic variables used by</span></div><div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="comment">// the queue are lock-free (they should be on most platforms).</span></div><div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="comment">// Thread-safe.</span></div><div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> is_lock_free()</div><div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  {</div><div class="line"><a name="l00947"></a><span class="lineno"> 947</span>  <span class="keywordflow">return</span> ConcurrentQueue::is_lock_free();</div><div class="line"><a name="l00948"></a><span class="lineno"> 948</span>  }</div><div class="line"><a name="l00949"></a><span class="lineno"> 949</span> </div><div class="line"><a name="l00950"></a><span class="lineno"> 950</span> </div><div class="line"><a name="l00951"></a><span class="lineno"> 951</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="keyword">static</span> <span class="keyword">inline</span> U* create()</div><div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  {</div><div class="line"><a name="l00955"></a><span class="lineno"> 955</span>  <span class="keyword">auto</span> p = (Traits::malloc)(<span class="keyword">sizeof</span>(U));</div><div class="line"><a name="l00956"></a><span class="lineno"> 956</span>  <span class="keywordflow">return</span> p != <span class="keyword">nullptr</span> ? <span class="keyword">new</span> (p) U : <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00957"></a><span class="lineno"> 957</span>  }</div><div class="line"><a name="l00958"></a><span class="lineno"> 958</span> </div><div class="line"><a name="l00959"></a><span class="lineno"> 959</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> A1></div><div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="keyword">static</span> <span class="keyword">inline</span> U* create(A1&& a1)</div><div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  {</div><div class="line"><a name="l00962"></a><span class="lineno"> 962</span>  <span class="keyword">auto</span> p = (Traits::malloc)(<span class="keyword">sizeof</span>(U));</div><div class="line"><a name="l00963"></a><span class="lineno"> 963</span>  <span class="keywordflow">return</span> p != <span class="keyword">nullptr</span> ? <span class="keyword">new</span> (p) U(std::forward<A1>(a1)) : <span class="keyword">nullptr</span>;</div><div class="line"><a name="l00964"></a><span class="lineno"> 964</span>  }</div><div class="line"><a name="l00965"></a><span class="lineno"> 965</span> </div><div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div><div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> destroy(U* p)</div><div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  {</div><div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  <span class="keywordflow">if</span> (p != <span class="keyword">nullptr</span>) {</div><div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  p->~U();</div><div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  }</div><div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  (Traits::free)(p);</div><div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  }</div><div class="line"><a name="l00974"></a><span class="lineno"> 974</span> </div><div class="line"><a name="l00975"></a><span class="lineno"> 975</span> <span class="keyword">private</span>:</div><div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  ConcurrentQueue inner;</div><div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  std::unique_ptr<LightweightSemaphore, void (*)(LightweightSemaphore*)> sema;</div><div class="line"><a name="l00978"></a><span class="lineno"> 978</span> };</div><div class="line"><a name="l00979"></a><span class="lineno"> 979</span> </div><div class="line"><a name="l00980"></a><span class="lineno"> 980</span> </div><div class="line"><a name="l00981"></a><span class="lineno"> 981</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div><div class="line"><a name="l00982"></a><span class="lineno"> 982</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(BlockingConcurrentQueue<T, Traits>& a, BlockingConcurrentQueue<T, Traits>& b) MOODYCAMEL_NOEXCEPT</div><div class="line"><a name="l00983"></a><span class="lineno"> 983</span> {</div><div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  a.swap(b);</div><div class="line"><a name="l00985"></a><span class="lineno"> 985</span> }</div><div class="line"><a name="l00986"></a><span class="lineno"> 986</span> </div><div class="line"><a name="l00987"></a><span class="lineno"> 987</span> } <span class="comment">// end namespace moodycamel</span></div><div class="line"><a name="l00988"></a><span class="lineno"> 988</span> } <span class="comment">// namespace dmlc</span></div><div class="line"><a name="l00989"></a><span class="lineno"> 989</span> </div><div class="line"><a name="l00990"></a><span class="lineno"> 990</span> <span class="preprocessor">#endif // DMLC_BLOCKINGCONCURRENTQUEUE_H_</span></div><div class="line"><a name="l00991"></a><span class="lineno"> 991</span> <div class="ttc" id="namespacedmlc_html_a7a89c6e0909617034aa818dafe83a361"><div class="ttname"><a href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">dmlc::index_t</a></div><div class="ttdeci">unsigned index_t</div><div class="ttdoc">this defines the unsigned integer type that can normally be used to store feature index ...</div><div class="ttdef"><b>Definition:</b> data.h:32</div></div> |
