| <!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "https://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd"> |
| <html xmlns="http://www.w3.org/1999/xhtml"> |
| <head> |
| <meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/> |
| <meta http-equiv="X-UA-Compatible" content="IE=9"/> |
| <meta name="generator" content="Doxygen 1.8.17"/> |
| <meta name="viewport" content="width=device-width, initial-scale=1"/> |
| <title>mxnet: /work/mxnet/3rdparty/dmlc-core/include/dmlc/concurrentqueue.h Source File</title> |
| <link href="tabs.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="jquery.js"></script> |
| <script type="text/javascript" src="dynsections.js"></script> |
| <link href="search/search.css" rel="stylesheet" type="text/css"/> |
| <script type="text/javascript" src="search/searchdata.js"></script> |
| <script type="text/javascript" src="search/search.js"></script> |
| <link href="doxygen.css" rel="stylesheet" type="text/css" /> |
| </head> |
| <body> |
| <div id="top"><!-- do not remove this div, it is closed by doxygen! --> |
| <div id="titlearea"> |
| <table cellspacing="0" cellpadding="0"> |
| <tbody> |
| <tr style="height: 56px;"> |
| <td id="projectalign" style="padding-left: 0.5em;"> |
| <div id="projectname">mxnet |
| </div> |
| </td> |
| </tr> |
| </tbody> |
| </table> |
| </div> |
| <!-- end header part --> |
| <!-- Generated by Doxygen 1.8.17 --> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| var searchBox = new SearchBox("searchBox", "search",false,'Search'); |
| /* @license-end */ |
| </script> |
| <script type="text/javascript" src="menudata.js"></script> |
| <script type="text/javascript" src="menu.js"></script> |
| <script type="text/javascript"> |
| /* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */ |
| $(function() { |
| initMenu('',true,false,'search.php','Search'); |
| $(document).ready(function() { init_search(); }); |
| }); |
| /* @license-end */</script> |
| <div id="main-nav"></div> |
| <!-- window showing the filter options --> |
| <div id="MSearchSelectWindow" |
| onmouseover="return searchBox.OnSearchSelectShow()" |
| onmouseout="return searchBox.OnSearchSelectHide()" |
| onkeydown="return searchBox.OnSearchSelectKey(event)"> |
| </div> |
| |
| <!-- iframe showing the search results (closed by default) --> |
| <div id="MSearchResultsWindow"> |
| <iframe src="javascript:void(0)" frameborder="0" |
| name="MSearchResults" id="MSearchResults"> |
| </iframe> |
| </div> |
| |
| <div id="nav-path" class="navpath"> |
| <ul> |
| <li class="navelem"><a class="el" href="dir_8cab8f464681f7cc51cee77e79a434cd.html">3rdparty</a></li><li class="navelem"><a class="el" href="dir_82e31a22178767beedddc7597fd1ecb6.html">dmlc-core</a></li><li class="navelem"><a class="el" href="dir_7dd5b88db83ff474628c03c453739a90.html">include</a></li><li class="navelem"><a class="el" href="dir_e30967e3ab51f65ad4b50dd298ccf4e7.html">dmlc</a></li> </ul> |
| </div> |
| </div><!-- top --> |
| <div class="header"> |
| <div class="headertitle"> |
| <div class="title">concurrentqueue.h</div> </div> |
| </div><!--header--> |
| <div class="contents"> |
| <a href="concurrentqueue_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 a C++11 implementation of a multi-producer, multi-consumer lock-free queue.</span></div> |
| <div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// An overview, including benchmark results, is provided here:</span></div> |
| <div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">// http://moodycamel.com/blog/2014/a-fast-general-purpose-lock-free-queue-for-c++</span></div> |
| <div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// The full design is also described in excruciating detail at:</span></div> |
| <div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// http://moodycamel.com/blog/2014/detailed-design-of-a-lock-free-queue</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="comment">// Simplified BSD license:</span></div> |
| <div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// Copyright (c) 2013-2016, Cameron Desrochers.</span></div> |
| <div class="line"><a name="l00010"></a><span class="lineno"> 10</span> <span class="comment">// All rights reserved.</span></div> |
| <div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">//</span></div> |
| <div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// Redistribution and use in source and binary forms, with or without modification,</span></div> |
| <div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// are permitted provided that the following conditions are met:</span></div> |
| <div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">//</span></div> |
| <div class="line"><a name="l00015"></a><span class="lineno"> 15</span> <span class="comment">// - Redistributions of source code must retain the above copyright notice, this list of</span></div> |
| <div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// conditions and the following disclaimer.</span></div> |
| <div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// - Redistributions in binary form must reproduce the above copyright notice, this list of</span></div> |
| <div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// conditions and the following disclaimer in the documentation and/or other materials</span></div> |
| <div class="line"><a name="l00019"></a><span class="lineno"> 19</span> <span class="comment">// provided with the distribution.</span></div> |
| <div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">//</span></div> |
| <div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS "AS IS" AND ANY</span></div> |
| <div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES OF</span></div> |
| <div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL</span></div> |
| <div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment">// THE COPYRIGHT HOLDER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL,</span></div> |
| <div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">// SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT</span></div> |
| <div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment">// OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)</span></div> |
| <div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">// HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR</span></div> |
| <div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment">// TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF THIS SOFTWARE,</span></div> |
| <div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment">// EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.</span></div> |
| <div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="preprocessor">#ifndef DMLC_CONCURRENTQUEUE_H_</span></div> |
| <div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="preprocessor">#define DMLC_CONCURRENTQUEUE_H_</span></div> |
| <div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#pragma once</span></div> |
| <div class="line"><a name="l00033"></a><span class="lineno"> 33</span>  </div> |
| <div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#if defined(__GNUC__)</span></div> |
| <div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="comment">// Disable -Wconversion warnings (spuriously triggered when Traits::size_t and</span></div> |
| <div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="comment">// Traits::index_t are set to < 32 bits, causing integer promotion, causing warnings</span></div> |
| <div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="comment">// upon assigning any computed values)</span></div> |
| <div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#pragma GCC diagnostic push</span></div> |
| <div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#pragma GCC diagnostic ignored "-Wconversion"</span></div> |
| <div class="line"><a name="l00040"></a><span class="lineno"> 40</span>  </div> |
| <div class="line"><a name="l00041"></a><span class="lineno"> 41</span> <span class="preprocessor">#ifdef MCDBGQ_USE_RELACY</span></div> |
| <div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="preprocessor">#pragma GCC diagnostic ignored "-Wint-to-pointer-cast"</span></div> |
| <div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00045"></a><span class="lineno"> 45</span>  </div> |
| <div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="preprocessor">#if defined(_WIN32) || defined(__WINDOWS__) || defined(__WIN32__) || defined(_WIN64)</span></div> |
| <div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="preprocessor">#include <windows.h></span> <span class="comment">// for GetCurrentThreadId()</span></div> |
| <div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00049"></a><span class="lineno"> 49</span>  </div> |
| <div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="preprocessor">#if defined(__APPLE__)</span></div> |
| <div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="preprocessor">#include "TargetConditionals.h"</span></div> |
| <div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00053"></a><span class="lineno"> 53</span>  </div> |
| <div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="preprocessor">#ifdef MCDBGQ_USE_RELACY</span></div> |
| <div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="preprocessor">#include "relacy/relacy_std.hpp"</span></div> |
| <div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="preprocessor">#include "relacy_shims.h"</span></div> |
| <div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment">// We only use malloc/free anyway, and the delete macro messes up `= delete` method declarations.</span></div> |
| <div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment">// We'll override the default trait malloc ourselves without a macro.</span></div> |
| <div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="preprocessor">#undef new</span></div> |
| <div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="preprocessor">#undef delete</span></div> |
| <div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="preprocessor">#undef malloc</span></div> |
| <div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="preprocessor">#undef free</span></div> |
| <div class="line"><a name="l00063"></a><span class="lineno"> 63</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00064"></a><span class="lineno"> 64</span> <span class="preprocessor">#include <atomic></span> <span class="comment">// Requires C++11. Sorry VS2010.</span></div> |
| <div class="line"><a name="l00065"></a><span class="lineno"> 65</span> <span class="preprocessor">#include <cassert></span></div> |
| <div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="preprocessor">#include <cstddef></span> <span class="comment">// for max_align_t</span></div> |
| <div class="line"><a name="l00068"></a><span class="lineno"> 68</span> <span class="preprocessor">#include <cstdint></span></div> |
| <div class="line"><a name="l00069"></a><span class="lineno"> 69</span> <span class="preprocessor">#include <cstdlib></span></div> |
| <div class="line"><a name="l00070"></a><span class="lineno"> 70</span> <span class="preprocessor">#include <type_traits></span></div> |
| <div class="line"><a name="l00071"></a><span class="lineno"> 71</span> <span class="preprocessor">#include <algorithm></span></div> |
| <div class="line"><a name="l00072"></a><span class="lineno"> 72</span> <span class="preprocessor">#include <utility></span></div> |
| <div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor">#include <limits></span></div> |
| <div class="line"><a name="l00074"></a><span class="lineno"> 74</span> <span class="preprocessor">#include <climits></span> <span class="comment">// for CHAR_BIT</span></div> |
| <div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="preprocessor">#include <array></span></div> |
| <div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="preprocessor">#include <thread></span> <span class="comment">// partly for __WINPTHREADS_VERSION if on MinGW-w64 w/ POSIX threading</span></div> |
| <div class="line"><a name="l00077"></a><span class="lineno"> 77</span>  </div> |
| <div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="keyword">namespace </span><a class="code" href="namespacedmlc.html">dmlc</a> {</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> <span class="comment">// Platform-specific definitions of a numeric thread ID type and an invalid value</span></div> |
| <div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="keyword">namespace </span>moodycamel { <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="keyword">template</span><<span class="keyword">typename</span> thread_<span class="keywordtype">id</span>_t> <span class="keyword">struct </span>thread_id_converter {</div> |
| <div class="line"><a name="l00083"></a><span class="lineno"> 83</span>  <span class="keyword">typedef</span> thread_id_t thread_id_numeric_size_t;</div> |
| <div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  <span class="keyword">typedef</span> thread_id_t thread_id_hash_t;</div> |
| <div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">static</span> thread_id_hash_t prehash(thread_id_t <span class="keyword">const</span>& x) { <span class="keywordflow">return</span> x; }</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> } }</div> |
| <div class="line"><a name="l00088"></a><span class="lineno"> 88</span> <span class="preprocessor">#if defined(MCDBGQ_USE_RELACY)</span></div> |
| <div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="keyword">namespace </span>moodycamel { <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="keyword">typedef</span> std::uint32_t thread_id_t;</div> |
| <div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id = 0xFFFFFFFFU;</div> |
| <div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id2 = 0xFFFFFFFEU;</div> |
| <div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="keyword">static</span> <span class="keyword">inline</span> thread_id_t thread_id() { <span class="keywordflow">return</span> rl::thread_index(); }</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> <span class="preprocessor">#elif defined(_WIN32) || defined(__WINDOWS__) || defined(__WIN32__)</span></div> |
| <div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment">// No sense pulling in windows.h in a header, we'll manually declare the function</span></div> |
| <div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment">// we use and rely on backwards-compatibility for this not to break</span></div> |
| <div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="keyword">extern</span> <span class="stringliteral">"C"</span> __declspec(dllimport) <span class="keywordtype">unsigned</span> <span class="keywordtype">long</span> __stdcall GetCurrentThreadId(<span class="keywordtype">void</span>);</div> |
| <div class="line"><a name="l00099"></a><span class="lineno"> 99</span> <span class="keyword">namespace </span>moodycamel { <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  static_assert(<span class="keyword">sizeof</span>(<span class="keywordtype">unsigned</span> <span class="keywordtype">long</span>) == <span class="keyword">sizeof</span>(std::uint32_t), <span class="stringliteral">"Expected size of unsigned long to be 32 bits on Windows"</span>);</div> |
| <div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <span class="keyword">typedef</span> std::uint32_t thread_id_t;</div> |
| <div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id = 0; <span class="comment">// See http://blogs.msdn.com/b/oldnewthing/archive/2004/02/23/78395.aspx</span></div> |
| <div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id2 = 0xFFFFFFFFU; <span class="comment">// Not technically guaranteed to be invalid, but is never used in practice. Note that all Win32 thread IDs are presently multiples of 4.</span></div> |
| <div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keyword">static</span> <span class="keyword">inline</span> thread_id_t thread_id() { <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>thread_id_t<span class="keyword">></span>(::GetCurrentThreadId()); }</div> |
| <div class="line"><a name="l00105"></a><span class="lineno"> 105</span> } }</div> |
| <div class="line"><a name="l00106"></a><span class="lineno"> 106</span> <span class="preprocessor">#elif defined(__arm__) || defined(_M_ARM) || defined(__aarch64__) || (defined(__APPLE__) && TARGET_OS_IPHONE)</span></div> |
| <div class="line"><a name="l00107"></a><span class="lineno"> 107</span> <span class="keyword">namespace </span>moodycamel { <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  static_assert(<span class="keyword">sizeof</span>(std::thread::id) == 4 || <span class="keyword">sizeof</span>(std::thread::id) == 8, <span class="stringliteral">"std::thread::id is expected to be either 4 or 8 bytes"</span>);</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>  <span class="keyword">typedef</span> std::thread::id thread_id_t;</div> |
| <div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id; <span class="comment">// Default ctor creates invalid ID</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="comment">// Note we don't define a invalid_thread_id2 since std::thread::id doesn't have one; it's</span></div> |
| <div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  <span class="comment">// only used if MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED is defined anyway, which it won't</span></div> |
| <div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="comment">// be.</span></div> |
| <div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keyword">static</span> <span class="keyword">inline</span> thread_id_t thread_id() { <span class="keywordflow">return</span> std::this_thread::get_id(); }</div> |
| <div class="line"><a name="l00117"></a><span class="lineno"> 117</span>  </div> |
| <div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  <span class="keyword">template</span><std::<span class="keywordtype">size_t</span>> <span class="keyword">struct </span>thread_id_size { };</div> |
| <div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <span class="keyword">template</span><> <span class="keyword">struct </span>thread_id_size<4> { <span class="keyword">typedef</span> std::uint32_t numeric_t; };</div> |
| <div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keyword">template</span><> <span class="keyword">struct </span>thread_id_size<8> { <span class="keyword">typedef</span> std::uint64_t numeric_t; };</div> |
| <div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  </div> |
| <div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  <span class="keyword">template</span><> <span class="keyword">struct </span>thread_id_converter<thread_id_t> {</div> |
| <div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  <span class="keyword">typedef</span> thread_id_size<<span class="keyword">sizeof</span>(thread_id_t)>::numeric_t thread_id_numeric_size_t;</div> |
| <div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="preprocessor">#ifndef __APPLE__</span></div> |
| <div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keyword">typedef</span> std::size_t thread_id_hash_t;</div> |
| <div class="line"><a name="l00126"></a><span class="lineno"> 126</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keyword">typedef</span> thread_id_numeric_size_t thread_id_hash_t;</div> |
| <div class="line"><a name="l00128"></a><span class="lineno"> 128</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  </div> |
| <div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  <span class="keyword">static</span> thread_id_hash_t prehash(thread_id_t <span class="keyword">const</span>& x)</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> <span class="preprocessor">#ifndef __APPLE__</span></div> |
| <div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  <span class="keywordflow">return</span> std::hash<std::thread::id>()(x);</div> |
| <div class="line"><a name="l00134"></a><span class="lineno"> 134</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <span class="keywordflow">return</span> *<span class="keyword">reinterpret_cast<</span>thread_id_hash_t const*<span class="keyword">></span>(&x);</div> |
| <div class="line"><a name="l00136"></a><span class="lineno"> 136</span> <span class="preprocessor">#endif</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>  };</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> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00141"></a><span class="lineno"> 141</span> <span class="comment">// Use a nice trick from this answer: http://stackoverflow.com/a/8438730/21475</span></div> |
| <div class="line"><a name="l00142"></a><span class="lineno"> 142</span> <span class="comment">// In order to get a numeric thread ID in a platform-independent way, we use a thread-local</span></div> |
| <div class="line"><a name="l00143"></a><span class="lineno"> 143</span> <span class="comment">// static variable's address as a thread identifier :-)</span></div> |
| <div class="line"><a name="l00144"></a><span class="lineno"> 144</span> <span class="preprocessor">#if defined(__GNUC__) || defined(__INTEL_COMPILER)</span></div> |
| <div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor">#define MOODYCAMEL_THREADLOCAL __thread</span></div> |
| <div class="line"><a name="l00146"></a><span class="lineno"> 146</span> <span class="preprocessor">#elif defined(_MSC_VER)</span></div> |
| <div class="line"><a name="l00147"></a><span class="lineno"> 147</span> <span class="preprocessor">#define MOODYCAMEL_THREADLOCAL __declspec(thread)</span></div> |
| <div class="line"><a name="l00148"></a><span class="lineno"> 148</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00149"></a><span class="lineno"> 149</span> <span class="comment">// Assume C++11 compliant compiler</span></div> |
| <div class="line"><a name="l00150"></a><span class="lineno"> 150</span> <span class="preprocessor">#define MOODYCAMEL_THREADLOCAL thread_local</span></div> |
| <div class="line"><a name="l00151"></a><span class="lineno"> 151</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00152"></a><span class="lineno"> 152</span> <span class="keyword">namespace </span>moodycamel { <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="keyword">typedef</span> std::uintptr_t thread_id_t;</div> |
| <div class="line"><a name="l00154"></a><span class="lineno"> 154</span> <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id = 0; <span class="comment">// Address can't be nullptr</span></div> |
| <div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="keyword">static</span> <span class="keyword">const</span> thread_id_t invalid_thread_id2 = 1; <span class="comment">// Member accesses off a null pointer are also generally invalid. Plus it's not aligned.</span></div> |
| <div class="line"><a name="l00156"></a><span class="lineno"> 156</span> <span class="keyword">static</span> <span class="keyword">inline</span> thread_id_t thread_id() { <span class="keyword">static</span> MOODYCAMEL_THREADLOCAL <span class="keywordtype">int</span> x; <span class="keywordflow">return</span> <span class="keyword">reinterpret_cast<</span>thread_id_t<span class="keyword">></span>(&x); }</div> |
| <div class="line"><a name="l00157"></a><span class="lineno"> 157</span> } }</div> |
| <div class="line"><a name="l00158"></a><span class="lineno"> 158</span> <span class="preprocessor">#endif</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="comment">// Exceptions</span></div> |
| <div class="line"><a name="l00161"></a><span class="lineno"> 161</span> <span class="preprocessor">#ifndef MOODYCAMEL_EXCEPTIONS_ENABLED</span></div> |
| <div class="line"><a name="l00162"></a><span class="lineno"> 162</span> <span class="preprocessor">#if (defined(_MSC_VER) && defined(_CPPUNWIND)) || (defined(__GNUC__) && defined(__EXCEPTIONS)) || (!defined(_MSC_VER) && !defined(__GNUC__))</span></div> |
| <div class="line"><a name="l00163"></a><span class="lineno"> 163</span> <span class="preprocessor">#define MOODYCAMEL_EXCEPTIONS_ENABLED</span></div> |
| <div class="line"><a name="l00164"></a><span class="lineno"> 164</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00165"></a><span class="lineno"> 165</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00166"></a><span class="lineno"> 166</span> <span class="preprocessor">#ifdef MOODYCAMEL_EXCEPTIONS_ENABLED</span></div> |
| <div class="line"><a name="l00167"></a><span class="lineno"> 167</span> <span class="preprocessor">#define MOODYCAMEL_TRY try</span></div> |
| <div class="line"><a name="l00168"></a><span class="lineno"> 168</span> <span class="preprocessor">#define MOODYCAMEL_CATCH(...) catch(__VA_ARGS__)</span></div> |
| <div class="line"><a name="l00169"></a><span class="lineno"> 169</span> <span class="preprocessor">#define MOODYCAMEL_RETHROW throw</span></div> |
| <div class="line"><a name="l00170"></a><span class="lineno"> 170</span> <span class="preprocessor">#define MOODYCAMEL_THROW(expr) throw (expr)</span></div> |
| <div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00172"></a><span class="lineno"> 172</span> <span class="preprocessor">#define MOODYCAMEL_TRY if (true)</span></div> |
| <div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor">#define MOODYCAMEL_CATCH(...) else if (false)</span></div> |
| <div class="line"><a name="l00174"></a><span class="lineno"> 174</span> <span class="preprocessor">#define MOODYCAMEL_RETHROW</span></div> |
| <div class="line"><a name="l00175"></a><span class="lineno"> 175</span> <span class="preprocessor">#define MOODYCAMEL_THROW(expr)</span></div> |
| <div class="line"><a name="l00176"></a><span class="lineno"> 176</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00177"></a><span class="lineno"> 177</span>  </div> |
| <div class="line"><a name="l00178"></a><span class="lineno"> 178</span> <span class="preprocessor">#ifndef MOODYCAMEL_NOEXCEPT</span></div> |
| <div class="line"><a name="l00179"></a><span class="lineno"> 179</span> <span class="preprocessor">#if !defined(MOODYCAMEL_EXCEPTIONS_ENABLED)</span></div> |
| <div class="line"><a name="l00180"></a><span class="lineno"> 180</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT</span></div> |
| <div class="line"><a name="l00181"></a><span class="lineno"> 181</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) true</span></div> |
| <div class="line"><a name="l00182"></a><span class="lineno"> 182</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr) true</span></div> |
| <div class="line"><a name="l00183"></a><span class="lineno"> 183</span> <span class="preprocessor">#elif defined(_MSC_VER) && defined(_NOEXCEPT) && _MSC_VER < 1800</span></div> |
| <div class="line"><a name="l00184"></a><span class="lineno"> 184</span> <span class="comment">// VS2012's std::is_nothrow_[move_]constructible is broken and returns true when it shouldn't :-(</span></div> |
| <div class="line"><a name="l00185"></a><span class="lineno"> 185</span> <span class="comment">// We have to assume *all* non-trivial constructors may throw on VS2012!</span></div> |
| <div class="line"><a name="l00186"></a><span class="lineno"> 186</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT _NOEXCEPT</span></div> |
| <div class="line"><a name="l00187"></a><span class="lineno"> 187</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) (std::is_rvalue_reference<valueType>::value && std::is_move_constructible<type>::value ? std::is_trivially_move_constructible<type>::value : std::is_trivially_copy_constructible<type>::value)</span></div> |
| <div class="line"><a name="l00188"></a><span class="lineno"> 188</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr) ((std::is_rvalue_reference<valueType>::value && std::is_move_assignable<type>::value ? std::is_trivially_move_assignable<type>::value || std::is_nothrow_move_assignable<type>::value : std::is_trivially_copy_assignable<type>::value || std::is_nothrow_copy_assignable<type>::value) && MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr))</span></div> |
| <div class="line"><a name="l00189"></a><span class="lineno"> 189</span> <span class="preprocessor">#elif defined(_MSC_VER) && defined(_NOEXCEPT) && _MSC_VER < 1900</span></div> |
| <div class="line"><a name="l00190"></a><span class="lineno"> 190</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT _NOEXCEPT</span></div> |
| <div class="line"><a name="l00191"></a><span class="lineno"> 191</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) (std::is_rvalue_reference<valueType>::value && std::is_move_constructible<type>::value ? std::is_trivially_move_constructible<type>::value || std::is_nothrow_move_constructible<type>::value : std::is_trivially_copy_constructible<type>::value || std::is_nothrow_copy_constructible<type>::value)</span></div> |
| <div class="line"><a name="l00192"></a><span class="lineno"> 192</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr) ((std::is_rvalue_reference<valueType>::value && std::is_move_assignable<type>::value ? std::is_trivially_move_assignable<type>::value || std::is_nothrow_move_assignable<type>::value : std::is_trivially_copy_assignable<type>::value || std::is_nothrow_copy_assignable<type>::value) && MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr))</span></div> |
| <div class="line"><a name="l00193"></a><span class="lineno"> 193</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT noexcept</span></div> |
| <div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_CTOR(type, valueType, expr) noexcept(expr)</span></div> |
| <div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="preprocessor">#define MOODYCAMEL_NOEXCEPT_ASSIGN(type, valueType, expr) noexcept(expr)</span></div> |
| <div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00199"></a><span class="lineno"> 199</span>  </div> |
| <div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="preprocessor">#ifndef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l00201"></a><span class="lineno"> 201</span> <span class="preprocessor">#ifdef MCDBGQ_USE_RELACY</span></div> |
| <div class="line"><a name="l00202"></a><span class="lineno"> 202</span> <span class="preprocessor">#define MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l00203"></a><span class="lineno"> 203</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00204"></a><span class="lineno"> 204</span> <span class="comment">// VS2013 doesn't support `thread_local`, and MinGW-w64 w/ POSIX threading has a crippling bug: http://sourceforge.net/p/mingw-w64/bugs/445</span></div> |
| <div class="line"><a name="l00205"></a><span class="lineno"> 205</span> <span class="comment">// g++ <=4.7 doesn't support thread_local either.</span></div> |
| <div class="line"><a name="l00206"></a><span class="lineno"> 206</span> <span class="comment">// Finally, iOS/ARM doesn't have support for it either, and g++/ARM allows it to compile but it's unconfirmed to actually work</span></div> |
| <div class="line"><a name="l00207"></a><span class="lineno"> 207</span> <span class="preprocessor">#if (!defined(_MSC_VER) || _MSC_VER >= 1900) && (!defined(__MINGW32__) && !defined(__MINGW64__) || !defined(__WINPTHREADS_VERSION)) && (!defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 8)) && (!defined(__APPLE__) || !TARGET_OS_IPHONE) && !defined(__arm__) && !defined(_M_ARM) && !defined(__aarch64__)</span></div> |
| <div class="line"><a name="l00208"></a><span class="lineno"> 208</span> <span class="comment">// Assume `thread_local` is fully supported in all other C++11 compilers/platforms</span></div> |
| <div class="line"><a name="l00209"></a><span class="lineno"> 209</span> <span class="comment">//#define MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED // always disabled for now since several users report having problems with it on</span></div> |
| <div class="line"><a name="l00210"></a><span class="lineno"> 210</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00211"></a><span class="lineno"> 211</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00212"></a><span class="lineno"> 212</span> <span class="preprocessor">#endif</span></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> <span class="comment">// VS2012 doesn't support deleted functions.</span></div> |
| <div class="line"><a name="l00215"></a><span class="lineno"> 215</span> <span class="comment">// In this case, we declare the function normally but don't define it. A link error will be generated if the function is called.</span></div> |
| <div class="line"><a name="l00216"></a><span class="lineno"> 216</span> <span class="preprocessor">#ifndef MOODYCAMEL_DELETE_FUNCTION</span></div> |
| <div class="line"><a name="l00217"></a><span class="lineno"> 217</span> <span class="preprocessor">#if defined(_MSC_VER) && _MSC_VER < 1800</span></div> |
| <div class="line"><a name="l00218"></a><span class="lineno"> 218</span> <span class="preprocessor">#define MOODYCAMEL_DELETE_FUNCTION</span></div> |
| <div class="line"><a name="l00219"></a><span class="lineno"> 219</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00220"></a><span class="lineno"> 220</span> <span class="preprocessor">#define MOODYCAMEL_DELETE_FUNCTION = delete</span></div> |
| <div class="line"><a name="l00221"></a><span class="lineno"> 221</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00222"></a><span class="lineno"> 222</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  </div> |
| <div class="line"><a name="l00224"></a><span class="lineno"> 224</span> <span class="comment">// Compiler-specific likely/unlikely hints</span></div> |
| <div class="line"><a name="l00225"></a><span class="lineno"> 225</span> <span class="keyword">namespace </span>moodycamel { <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00226"></a><span class="lineno"> 226</span> <span class="preprocessor">#if defined(__GNUC__)</span></div> |
| <div class="line"><a name="l00227"></a><span class="lineno"> 227</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> likely(<span class="keywordtype">bool</span> x) { <span class="keywordflow">return</span> __builtin_expect((x), <span class="keyword">true</span>); }</div> |
| <div class="line"><a name="l00228"></a><span class="lineno"> 228</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> unlikely(<span class="keywordtype">bool</span> x) { <span class="keywordflow">return</span> __builtin_expect((x), <span class="keyword">false</span>); }</div> |
| <div class="line"><a name="l00229"></a><span class="lineno"> 229</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> likely(<span class="keywordtype">bool</span> x) { <span class="keywordflow">return</span> x; }</div> |
| <div class="line"><a name="l00231"></a><span class="lineno"> 231</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> unlikely(<span class="keywordtype">bool</span> x) { <span class="keywordflow">return</span> x; }</div> |
| <div class="line"><a name="l00232"></a><span class="lineno"> 232</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00233"></a><span class="lineno"> 233</span> } }</div> |
| <div class="line"><a name="l00234"></a><span class="lineno"> 234</span>  </div> |
| <div class="line"><a name="l00235"></a><span class="lineno"> 235</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l00236"></a><span class="lineno"> 236</span> <span class="preprocessor">#include "internal/concurrentqueue_internal_debug.h"</span></div> |
| <div class="line"><a name="l00237"></a><span class="lineno"> 237</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00238"></a><span class="lineno"> 238</span>  </div> |
| <div class="line"><a name="l00239"></a><span class="lineno"> 239</span> <span class="keyword">namespace </span>moodycamel {</div> |
| <div class="line"><a name="l00240"></a><span class="lineno"> 240</span> <span class="keyword">namespace </span>details {</div> |
| <div class="line"><a name="l00241"></a><span class="lineno"> 241</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00242"></a><span class="lineno"> 242</span> <span class="keyword">struct </span>const_numeric_max {</div> |
| <div class="line"><a name="l00243"></a><span class="lineno"> 243</span>  static_assert(std::is_integral<T>::value, <span class="stringliteral">"const_numeric_max can only be used with integers"</span>);</div> |
| <div class="line"><a name="l00244"></a><span class="lineno"> 244</span>  <span class="keyword">static</span> <span class="keyword">const</span> T value = std::numeric_limits<T>::is_signed</div> |
| <div class="line"><a name="l00245"></a><span class="lineno"> 245</span>  ? (<span class="keyword">static_cast<</span>T<span class="keyword">></span>(1) << (<span class="keyword">sizeof</span>(T) * CHAR_BIT - 1)) - <span class="keyword">static_cast<</span>T<span class="keyword">></span>(1)</div> |
| <div class="line"><a name="l00246"></a><span class="lineno"> 246</span>  : <span class="keyword">static_cast<</span>T<span class="keyword">></span>(-1);</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> <span class="preprocessor">#if defined(__GLIBCXX__)</span></div> |
| <div class="line"><a name="l00250"></a><span class="lineno"> 250</span> typedef ::max_align_t std_max_align_t; <span class="comment">// libstdc++ forgot to add it to std:: for a while</span></div> |
| <div class="line"><a name="l00251"></a><span class="lineno"> 251</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00252"></a><span class="lineno"> 252</span> <span class="keyword">typedef</span> std::max_align_t std_max_align_t; <span class="comment">// Others (e.g. MSVC) insist it can *only* be accessed via std::</span></div> |
| <div class="line"><a name="l00253"></a><span class="lineno"> 253</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00254"></a><span class="lineno"> 254</span>  </div> |
| <div class="line"><a name="l00255"></a><span class="lineno"> 255</span> <span class="comment">// Some platforms have incorrectly set max_align_t to a type with <8 bytes alignment even while supporting</span></div> |
| <div class="line"><a name="l00256"></a><span class="lineno"> 256</span> <span class="comment">// 8-byte aligned scalar values (*cough* 32-bit iOS). Work around this with our own union. See issue #64.</span></div> |
| <div class="line"><a name="l00257"></a><span class="lineno"> 257</span> <span class="keyword">typedef</span> <span class="keyword">union </span>{</div> |
| <div class="line"><a name="l00258"></a><span class="lineno"> 258</span>  std_max_align_t x;</div> |
| <div class="line"><a name="l00259"></a><span class="lineno"> 259</span>  <span class="keywordtype">long</span> <span class="keywordtype">long</span> y;</div> |
| <div class="line"><a name="l00260"></a><span class="lineno"> 260</span>  <span class="keywordtype">void</span>* z;</div> |
| <div class="line"><a name="l00261"></a><span class="lineno"> 261</span> } max_align_t;</div> |
| <div class="line"><a name="l00262"></a><span class="lineno"> 262</span> }</div> |
| <div class="line"><a name="l00263"></a><span class="lineno"> 263</span>  </div> |
| <div class="line"><a name="l00264"></a><span class="lineno"> 264</span> <span class="comment">// Default traits for the ConcurrentQueue. To change some of the</span></div> |
| <div class="line"><a name="l00265"></a><span class="lineno"> 265</span> <span class="comment">// traits without re-implementing all of them, inherit from this</span></div> |
| <div class="line"><a name="l00266"></a><span class="lineno"> 266</span> <span class="comment">// struct and shadow the declarations you wish to be different;</span></div> |
| <div class="line"><a name="l00267"></a><span class="lineno"> 267</span> <span class="comment">// since the traits are used as a template type parameter, the</span></div> |
| <div class="line"><a name="l00268"></a><span class="lineno"> 268</span> <span class="comment">// shadowed declarations will be used where defined, and the defaults</span></div> |
| <div class="line"><a name="l00269"></a><span class="lineno"> 269</span> <span class="comment">// otherwise.</span></div> |
| <div class="line"><a name="l00270"></a><span class="lineno"> 270</span> <span class="keyword">struct </span>ConcurrentQueueDefaultTraits</div> |
| <div class="line"><a name="l00271"></a><span class="lineno"> 271</span> {</div> |
| <div class="line"><a name="l00272"></a><span class="lineno"> 272</span>  <span class="comment">// General-purpose size type. std::size_t is strongly recommended.</span></div> |
| <div class="line"><a name="l00273"></a><span class="lineno"> 273</span>  <span class="keyword">typedef</span> std::size_t size_t;</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>  <span class="comment">// The type used for the enqueue and dequeue indices. Must be at least as</span></div> |
| <div class="line"><a name="l00276"></a><span class="lineno"> 276</span>  <span class="comment">// large as size_t. Should be significantly larger than the number of elements</span></div> |
| <div class="line"><a name="l00277"></a><span class="lineno"> 277</span>  <span class="comment">// you expect to hold at once, especially if you have a high turnover rate;</span></div> |
| <div class="line"><a name="l00278"></a><span class="lineno"> 278</span>  <span class="comment">// for example, on 32-bit x86, if you expect to have over a hundred million</span></div> |
| <div class="line"><a name="l00279"></a><span class="lineno"> 279</span>  <span class="comment">// elements or pump several million elements through your queue in a very</span></div> |
| <div class="line"><a name="l00280"></a><span class="lineno"> 280</span>  <span class="comment">// short space of time, using a 32-bit type *may* trigger a race condition.</span></div> |
| <div class="line"><a name="l00281"></a><span class="lineno"> 281</span>  <span class="comment">// A 64-bit int type is recommended in that case, and in practice will</span></div> |
| <div class="line"><a name="l00282"></a><span class="lineno"> 282</span>  <span class="comment">// prevent a race condition no matter the usage of the queue. Note that</span></div> |
| <div class="line"><a name="l00283"></a><span class="lineno"> 283</span>  <span class="comment">// whether the queue is lock-free with a 64-int type depends on the whether</span></div> |
| <div class="line"><a name="l00284"></a><span class="lineno"> 284</span>  <span class="comment">// std::atomic<std::uint64_t> is lock-free, which is platform-specific.</span></div> |
| <div class="line"><a name="l00285"></a><span class="lineno"> 285</span>  <span class="keyword">typedef</span> std::size_t <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a>;</div> |
| <div class="line"><a name="l00286"></a><span class="lineno"> 286</span>  </div> |
| <div class="line"><a name="l00287"></a><span class="lineno"> 287</span>  <span class="comment">// Internally, all elements are enqueued and dequeued from multi-element</span></div> |
| <div class="line"><a name="l00288"></a><span class="lineno"> 288</span>  <span class="comment">// blocks; this is the smallest controllable unit. If you expect few elements</span></div> |
| <div class="line"><a name="l00289"></a><span class="lineno"> 289</span>  <span class="comment">// but many producers, a smaller block size should be favoured. For few producers</span></div> |
| <div class="line"><a name="l00290"></a><span class="lineno"> 290</span>  <span class="comment">// and/or many elements, a larger block size is preferred. A sane default</span></div> |
| <div class="line"><a name="l00291"></a><span class="lineno"> 291</span>  <span class="comment">// is provided. Must be a power of 2.</span></div> |
| <div class="line"><a name="l00292"></a><span class="lineno"> 292</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> BLOCK_SIZE = 32;</div> |
| <div class="line"><a name="l00293"></a><span class="lineno"> 293</span>  </div> |
| <div class="line"><a name="l00294"></a><span class="lineno"> 294</span>  <span class="comment">// For explicit producers (i.e. when using a producer token), the block is</span></div> |
| <div class="line"><a name="l00295"></a><span class="lineno"> 295</span>  <span class="comment">// checked for being empty by iterating through a list of flags, one per element.</span></div> |
| <div class="line"><a name="l00296"></a><span class="lineno"> 296</span>  <span class="comment">// For large block sizes, this is too inefficient, and switching to an atomic</span></div> |
| <div class="line"><a name="l00297"></a><span class="lineno"> 297</span>  <span class="comment">// counter-based approach is faster. The switch is made for block sizes strictly</span></div> |
| <div class="line"><a name="l00298"></a><span class="lineno"> 298</span>  <span class="comment">// larger than this threshold.</span></div> |
| <div class="line"><a name="l00299"></a><span class="lineno"> 299</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD = 32;</div> |
| <div class="line"><a name="l00300"></a><span class="lineno"> 300</span>  </div> |
| <div class="line"><a name="l00301"></a><span class="lineno"> 301</span>  <span class="comment">// How many full blocks can be expected for a single explicit producer? This should</span></div> |
| <div class="line"><a name="l00302"></a><span class="lineno"> 302</span>  <span class="comment">// reflect that number's maximum for optimal performance. Must be a power of 2.</span></div> |
| <div class="line"><a name="l00303"></a><span class="lineno"> 303</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> EXPLICIT_INITIAL_INDEX_SIZE = 32;</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>  <span class="comment">// How many full blocks can be expected for a single implicit producer? This should</span></div> |
| <div class="line"><a name="l00306"></a><span class="lineno"> 306</span>  <span class="comment">// reflect that number's maximum for optimal performance. Must be a power of 2.</span></div> |
| <div class="line"><a name="l00307"></a><span class="lineno"> 307</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> IMPLICIT_INITIAL_INDEX_SIZE = 32;</div> |
| <div class="line"><a name="l00308"></a><span class="lineno"> 308</span>  </div> |
| <div class="line"><a name="l00309"></a><span class="lineno"> 309</span>  <span class="comment">// The initial size of the hash table mapping thread IDs to implicit producers.</span></div> |
| <div class="line"><a name="l00310"></a><span class="lineno"> 310</span>  <span class="comment">// Note that the hash is resized every time it becomes half full.</span></div> |
| <div class="line"><a name="l00311"></a><span class="lineno"> 311</span>  <span class="comment">// Must be a power of two, and either 0 or at least 1. If 0, implicit production</span></div> |
| <div class="line"><a name="l00312"></a><span class="lineno"> 312</span>  <span class="comment">// (using the enqueue methods without an explicit producer token) is disabled.</span></div> |
| <div class="line"><a name="l00313"></a><span class="lineno"> 313</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> INITIAL_IMPLICIT_PRODUCER_HASH_SIZE = 32;</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>  <span class="comment">// Controls the number of items that an explicit consumer (i.e. one with a token)</span></div> |
| <div class="line"><a name="l00316"></a><span class="lineno"> 316</span>  <span class="comment">// must consume before it causes all consumers to rotate and move on to the next</span></div> |
| <div class="line"><a name="l00317"></a><span class="lineno"> 317</span>  <span class="comment">// internal queue.</span></div> |
| <div class="line"><a name="l00318"></a><span class="lineno"> 318</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::uint32_t EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE = 256;</div> |
| <div class="line"><a name="l00319"></a><span class="lineno"> 319</span>  </div> |
| <div class="line"><a name="l00320"></a><span class="lineno"> 320</span>  <span class="comment">// The maximum number of elements (inclusive) that can be enqueued to a sub-queue.</span></div> |
| <div class="line"><a name="l00321"></a><span class="lineno"> 321</span>  <span class="comment">// Enqueue operations that would cause this limit to be surpassed will fail. Note</span></div> |
| <div class="line"><a name="l00322"></a><span class="lineno"> 322</span>  <span class="comment">// that this limit is enforced at the block level (for performance reasons), i.e.</span></div> |
| <div class="line"><a name="l00323"></a><span class="lineno"> 323</span>  <span class="comment">// it's rounded up to the nearest block size.</span></div> |
| <div class="line"><a name="l00324"></a><span class="lineno"> 324</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> MAX_SUBQUEUE_SIZE = details::const_numeric_max<size_t>::value;</div> |
| <div class="line"><a name="l00325"></a><span class="lineno"> 325</span>  </div> |
| <div class="line"><a name="l00326"></a><span class="lineno"> 326</span>  </div> |
| <div class="line"><a name="l00327"></a><span class="lineno"> 327</span> <span class="preprocessor">#ifndef MCDBGQ_USE_RELACY</span></div> |
| <div class="line"><a name="l00328"></a><span class="lineno"> 328</span>  <span class="comment">// Memory allocation can be customized if needed.</span></div> |
| <div class="line"><a name="l00329"></a><span class="lineno"> 329</span>  <span class="comment">// malloc should return nullptr on failure, and handle alignment like std::malloc.</span></div> |
| <div class="line"><a name="l00330"></a><span class="lineno"> 330</span> <span class="preprocessor">#if defined(malloc) || defined(free)</span></div> |
| <div class="line"><a name="l00331"></a><span class="lineno"> 331</span>  <span class="comment">// Gah, this is 2015, stop defining macros that break standard code already!</span></div> |
| <div class="line"><a name="l00332"></a><span class="lineno"> 332</span>  <span class="comment">// Work around malloc/free being special macros:</span></div> |
| <div class="line"><a name="l00333"></a><span class="lineno"> 333</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>* WORKAROUND_malloc(<span class="keywordtype">size_t</span> size) { <span class="keywordflow">return</span> malloc(size); }</div> |
| <div class="line"><a name="l00334"></a><span class="lineno"> 334</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> WORKAROUND_free(<span class="keywordtype">void</span>* ptr) { <span class="keywordflow">return</span> free(ptr); }</div> |
| <div class="line"><a name="l00335"></a><span class="lineno"> 335</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>* (malloc)(<span class="keywordtype">size_t</span> size) { <span class="keywordflow">return</span> WORKAROUND_malloc(size); }</div> |
| <div class="line"><a name="l00336"></a><span class="lineno"> 336</span>  <span class="keyword">static</span> <span class="keyword">inline</span> void (free)(<span class="keywordtype">void</span>* ptr) { <span class="keywordflow">return</span> WORKAROUND_free(ptr); }</div> |
| <div class="line"><a name="l00337"></a><span class="lineno"> 337</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00338"></a><span class="lineno"> 338</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>* malloc(<span class="keywordtype">size_t</span> size) { <span class="keywordflow">return</span> std::malloc(size); }</div> |
| <div class="line"><a name="l00339"></a><span class="lineno"> 339</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> free(<span class="keywordtype">void</span>* ptr) { <span class="keywordflow">return</span> std::free(ptr); }</div> |
| <div class="line"><a name="l00340"></a><span class="lineno"> 340</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00341"></a><span class="lineno"> 341</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00342"></a><span class="lineno"> 342</span>  <span class="comment">// Debug versions when running under the Relacy race detector (ignore</span></div> |
| <div class="line"><a name="l00343"></a><span class="lineno"> 343</span>  <span class="comment">// these in user code)</span></div> |
| <div class="line"><a name="l00344"></a><span class="lineno"> 344</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span>* malloc(<span class="keywordtype">size_t</span> size) { <span class="keywordflow">return</span> rl::rl_malloc(size, $); }</div> |
| <div class="line"><a name="l00345"></a><span class="lineno"> 345</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> free(<span class="keywordtype">void</span>* ptr) { <span class="keywordflow">return</span> rl::rl_free(ptr, $); }</div> |
| <div class="line"><a name="l00346"></a><span class="lineno"> 346</span> <span class="preprocessor">#endif</span></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>  </div> |
| <div class="line"><a name="l00350"></a><span class="lineno"> 350</span> <span class="comment">// When producing or consuming many elements, the most efficient way is to:</span></div> |
| <div class="line"><a name="l00351"></a><span class="lineno"> 351</span> <span class="comment">// 1) Use one of the bulk-operation methods of the queue with a token</span></div> |
| <div class="line"><a name="l00352"></a><span class="lineno"> 352</span> <span class="comment">// 2) Failing that, use the bulk-operation methods without a token</span></div> |
| <div class="line"><a name="l00353"></a><span class="lineno"> 353</span> <span class="comment">// 3) Failing that, create a token and use that with the single-item methods</span></div> |
| <div class="line"><a name="l00354"></a><span class="lineno"> 354</span> <span class="comment">// 4) Failing that, use the single-parameter methods of the queue</span></div> |
| <div class="line"><a name="l00355"></a><span class="lineno"> 355</span> <span class="comment">// Having said that, don't create tokens willy-nilly -- ideally there should be</span></div> |
| <div class="line"><a name="l00356"></a><span class="lineno"> 356</span> <span class="comment">// a maximum of one token per thread (of each kind).</span></div> |
| <div class="line"><a name="l00357"></a><span class="lineno"> 357</span> <span class="keyword">struct </span>ProducerToken;</div> |
| <div class="line"><a name="l00358"></a><span class="lineno"> 358</span> <span class="keyword">struct </span>ConsumerToken;</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="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits> <span class="keyword">class </span>ConcurrentQueue;</div> |
| <div class="line"><a name="l00361"></a><span class="lineno"> 361</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits> <span class="keyword">class </span>BlockingConcurrentQueue;</div> |
| <div class="line"><a name="l00362"></a><span class="lineno"> 362</span> <span class="keyword">class </span>ConcurrentQueueTests;</div> |
| <div class="line"><a name="l00363"></a><span class="lineno"> 363</span>  </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> <span class="keyword">namespace </span>details</div> |
| <div class="line"><a name="l00366"></a><span class="lineno"> 366</span> {</div> |
| <div class="line"><a name="l00367"></a><span class="lineno"> 367</span> <span class="keyword">struct </span>ConcurrentQueueProducerTypelessBase</div> |
| <div class="line"><a name="l00368"></a><span class="lineno"> 368</span> {</div> |
| <div class="line"><a name="l00369"></a><span class="lineno"> 369</span>  ConcurrentQueueProducerTypelessBase* next;</div> |
| <div class="line"><a name="l00370"></a><span class="lineno"> 370</span>  std::atomic<bool> inactive;</div> |
| <div class="line"><a name="l00371"></a><span class="lineno"> 371</span>  ProducerToken* token;</div> |
| <div class="line"><a name="l00372"></a><span class="lineno"> 372</span>  </div> |
| <div class="line"><a name="l00373"></a><span class="lineno"> 373</span>  ConcurrentQueueProducerTypelessBase()</div> |
| <div class="line"><a name="l00374"></a><span class="lineno"> 374</span>  : next(nullptr), inactive(false), token(nullptr)</div> |
| <div class="line"><a name="l00375"></a><span class="lineno"> 375</span>  {</div> |
| <div class="line"><a name="l00376"></a><span class="lineno"> 376</span>  }</div> |
| <div class="line"><a name="l00377"></a><span class="lineno"> 377</span> };</div> |
| <div class="line"><a name="l00378"></a><span class="lineno"> 378</span>  </div> |
| <div class="line"><a name="l00379"></a><span class="lineno"> 379</span> <span class="keyword">template</span><<span class="keywordtype">bool</span> use32> <span class="keyword">struct </span>_hash_32_or_64 {</div> |
| <div class="line"><a name="l00380"></a><span class="lineno"> 380</span>  <span class="keyword">static</span> <span class="keyword">inline</span> std::uint32_t hash(std::uint32_t h)</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="comment">// MurmurHash3 finalizer -- see https://code.google.com/p/smhasher/source/browse/trunk/MurmurHash3.cpp</span></div> |
| <div class="line"><a name="l00383"></a><span class="lineno"> 383</span>  <span class="comment">// Since the thread ID is already unique, all we really want to do is propagate that</span></div> |
| <div class="line"><a name="l00384"></a><span class="lineno"> 384</span>  <span class="comment">// uniqueness evenly across all the bits, so that we can use a subset of the bits while</span></div> |
| <div class="line"><a name="l00385"></a><span class="lineno"> 385</span>  <span class="comment">// reducing collisions significantly</span></div> |
| <div class="line"><a name="l00386"></a><span class="lineno"> 386</span>  h ^= h >> 16;</div> |
| <div class="line"><a name="l00387"></a><span class="lineno"> 387</span>  h *= 0x85ebca6b;</div> |
| <div class="line"><a name="l00388"></a><span class="lineno"> 388</span>  h ^= h >> 13;</div> |
| <div class="line"><a name="l00389"></a><span class="lineno"> 389</span>  h *= 0xc2b2ae35;</div> |
| <div class="line"><a name="l00390"></a><span class="lineno"> 390</span>  <span class="keywordflow">return</span> h ^ (h >> 16);</div> |
| <div class="line"><a name="l00391"></a><span class="lineno"> 391</span>  }</div> |
| <div class="line"><a name="l00392"></a><span class="lineno"> 392</span> };</div> |
| <div class="line"><a name="l00393"></a><span class="lineno"> 393</span> <span class="keyword">template</span><> <span class="keyword">struct </span>_hash_32_or_64<1> {</div> |
| <div class="line"><a name="l00394"></a><span class="lineno"> 394</span>  <span class="keyword">static</span> <span class="keyword">inline</span> std::uint64_t hash(std::uint64_t h)</div> |
| <div class="line"><a name="l00395"></a><span class="lineno"> 395</span>  {</div> |
| <div class="line"><a name="l00396"></a><span class="lineno"> 396</span>  h ^= h >> 33;</div> |
| <div class="line"><a name="l00397"></a><span class="lineno"> 397</span>  h *= 0xff51afd7ed558ccd;</div> |
| <div class="line"><a name="l00398"></a><span class="lineno"> 398</span>  h ^= h >> 33;</div> |
| <div class="line"><a name="l00399"></a><span class="lineno"> 399</span>  h *= 0xc4ceb9fe1a85ec53;</div> |
| <div class="line"><a name="l00400"></a><span class="lineno"> 400</span>  <span class="keywordflow">return</span> h ^ (h >> 33);</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> };</div> |
| <div class="line"><a name="l00403"></a><span class="lineno"> 403</span> <span class="keyword">template</span><std::<span class="keywordtype">size_t</span> size> <span class="keyword">struct </span>hash_32_or_64 : <span class="keyword">public</span> _hash_32_or_64<(size > 4)> { };</div> |
| <div class="line"><a name="l00404"></a><span class="lineno"> 404</span>  </div> |
| <div class="line"><a name="l00405"></a><span class="lineno"> 405</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">size_t</span> hash_thread_id(thread_id_t <span class="keywordtype">id</span>)</div> |
| <div class="line"><a name="l00406"></a><span class="lineno"> 406</span> {</div> |
| <div class="line"><a name="l00407"></a><span class="lineno"> 407</span>  static_assert(<span class="keyword">sizeof</span>(thread_id_t) <= 8, <span class="stringliteral">"Expected a platform where thread IDs are at most 64-bit values"</span>);</div> |
| <div class="line"><a name="l00408"></a><span class="lineno"> 408</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(hash_32_or_64<<span class="keyword">sizeof</span>(thread_id_converter<thread_id_t>::thread_id_hash_t)>::hash(</div> |
| <div class="line"><a name="l00409"></a><span class="lineno"> 409</span>  thread_id_converter<thread_id_t>::prehash(<span class="keywordtype">id</span>)));</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> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00413"></a><span class="lineno"> 413</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">bool</span> circular_less_than(T a, T b)</div> |
| <div class="line"><a name="l00414"></a><span class="lineno"> 414</span> {</div> |
| <div class="line"><a name="l00415"></a><span class="lineno"> 415</span> <span class="preprocessor">#ifdef _MSC_VER</span></div> |
| <div class="line"><a name="l00416"></a><span class="lineno"> 416</span> <span class="preprocessor"> #pragma warning(push)</span></div> |
| <div class="line"><a name="l00417"></a><span class="lineno"> 417</span> <span class="preprocessor">#pragma warning(disable: 4554)</span></div> |
| <div class="line"><a name="l00418"></a><span class="lineno"> 418</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00419"></a><span class="lineno"> 419</span>  static_assert(std::is_integral<T>::value && !std::numeric_limits<T>::is_signed, <span class="stringliteral">"circular_less_than is intended to be used only with unsigned integer types"</span>);</div> |
| <div class="line"><a name="l00420"></a><span class="lineno"> 420</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>T<span class="keyword">></span>(a - b) > <span class="keyword">static_cast<</span>T<span class="keyword">></span>(<span class="keyword">static_cast<</span>T<span class="keyword">></span>(1) << <span class="keyword">static_cast<</span>T<span class="keyword">></span>(<span class="keyword">sizeof</span>(T) * CHAR_BIT - 1));</div> |
| <div class="line"><a name="l00421"></a><span class="lineno"> 421</span> <span class="preprocessor">#ifdef _MSC_VER</span></div> |
| <div class="line"><a name="l00422"></a><span class="lineno"> 422</span> <span class="preprocessor">#pragma warning(pop)</span></div> |
| <div class="line"><a name="l00423"></a><span class="lineno"> 423</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00424"></a><span class="lineno"> 424</span> }</div> |
| <div class="line"><a name="l00425"></a><span class="lineno"> 425</span>  </div> |
| <div class="line"><a name="l00426"></a><span class="lineno"> 426</span> <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l00427"></a><span class="lineno"> 427</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">char</span>* align_for(<span class="keywordtype">char</span>* ptr)</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">const</span> std::size_t alignment = std::alignment_of<U>::value;</div> |
| <div class="line"><a name="l00430"></a><span class="lineno"> 430</span>  <span class="keywordflow">return</span> ptr + (alignment - (<span class="keyword">reinterpret_cast<</span>std::uintptr_t<span class="keyword">></span>(ptr) % alignment)) % alignment;</div> |
| <div class="line"><a name="l00431"></a><span class="lineno"> 431</span> }</div> |
| <div class="line"><a name="l00432"></a><span class="lineno"> 432</span>  </div> |
| <div class="line"><a name="l00433"></a><span class="lineno"> 433</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00434"></a><span class="lineno"> 434</span> <span class="keyword">static</span> <span class="keyword">inline</span> T ceil_to_pow_2(T x)</div> |
| <div class="line"><a name="l00435"></a><span class="lineno"> 435</span> {</div> |
| <div class="line"><a name="l00436"></a><span class="lineno"> 436</span>  static_assert(std::is_integral<T>::value && !std::numeric_limits<T>::is_signed, <span class="stringliteral">"ceil_to_pow_2 is intended to be used only with unsigned integer types"</span>);</div> |
| <div class="line"><a name="l00437"></a><span class="lineno"> 437</span>  </div> |
| <div class="line"><a name="l00438"></a><span class="lineno"> 438</span>  <span class="comment">// Adapted from http://graphics.stanford.edu/~seander/bithacks.html#RoundUpPowerOf2</span></div> |
| <div class="line"><a name="l00439"></a><span class="lineno"> 439</span>  --x;</div> |
| <div class="line"><a name="l00440"></a><span class="lineno"> 440</span>  x |= x >> 1;</div> |
| <div class="line"><a name="l00441"></a><span class="lineno"> 441</span>  x |= x >> 2;</div> |
| <div class="line"><a name="l00442"></a><span class="lineno"> 442</span>  x |= x >> 4;</div> |
| <div class="line"><a name="l00443"></a><span class="lineno"> 443</span>  <span class="keywordflow">for</span> (std::size_t i = 1; i < <span class="keyword">sizeof</span>(T); i <<= 1) {</div> |
| <div class="line"><a name="l00444"></a><span class="lineno"> 444</span>  x |= x >> (i << 3);</div> |
| <div class="line"><a name="l00445"></a><span class="lineno"> 445</span>  }</div> |
| <div class="line"><a name="l00446"></a><span class="lineno"> 446</span>  ++x;</div> |
| <div class="line"><a name="l00447"></a><span class="lineno"> 447</span>  <span class="keywordflow">return</span> x;</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>  </div> |
| <div class="line"><a name="l00450"></a><span class="lineno"> 450</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00451"></a><span class="lineno"> 451</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap_relaxed(std::atomic<T>& left, std::atomic<T>& right)</div> |
| <div class="line"><a name="l00452"></a><span class="lineno"> 452</span> {</div> |
| <div class="line"><a name="l00453"></a><span class="lineno"> 453</span>  T temp = std::move(left.load(std::memory_order_relaxed));</div> |
| <div class="line"><a name="l00454"></a><span class="lineno"> 454</span>  left.store(std::move(right.load(std::memory_order_relaxed)), std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00455"></a><span class="lineno"> 455</span>  right.store(std::move(temp), std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00456"></a><span class="lineno"> 456</span> }</div> |
| <div class="line"><a name="l00457"></a><span class="lineno"> 457</span>  </div> |
| <div class="line"><a name="l00458"></a><span class="lineno"> 458</span> <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00459"></a><span class="lineno"> 459</span> <span class="keyword">static</span> <span class="keyword">inline</span> T <span class="keyword">const</span>& nomove(T <span class="keyword">const</span>& x)</div> |
| <div class="line"><a name="l00460"></a><span class="lineno"> 460</span> {</div> |
| <div class="line"><a name="l00461"></a><span class="lineno"> 461</span>  <span class="keywordflow">return</span> x;</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>  </div> |
| <div class="line"><a name="l00464"></a><span class="lineno"> 464</span> <span class="keyword">template</span><<span class="keywordtype">bool</span> Enable></div> |
| <div class="line"><a name="l00465"></a><span class="lineno"> 465</span> <span class="keyword">struct </span>nomove_if</div> |
| <div class="line"><a name="l00466"></a><span class="lineno"> 466</span> {</div> |
| <div class="line"><a name="l00467"></a><span class="lineno"> 467</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T></div> |
| <div class="line"><a name="l00468"></a><span class="lineno"> 468</span>  <span class="keyword">static</span> <span class="keyword">inline</span> T <span class="keyword">const</span>& eval(T <span class="keyword">const</span>& x)</div> |
| <div class="line"><a name="l00469"></a><span class="lineno"> 469</span>  {</div> |
| <div class="line"><a name="l00470"></a><span class="lineno"> 470</span>  <span class="keywordflow">return</span> x;</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> };</div> |
| <div class="line"><a name="l00473"></a><span class="lineno"> 473</span>  </div> |
| <div class="line"><a name="l00474"></a><span class="lineno"> 474</span> <span class="keyword">template</span><></div> |
| <div class="line"><a name="l00475"></a><span class="lineno"> 475</span> <span class="keyword">struct </span>nomove_if<false></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>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l00478"></a><span class="lineno"> 478</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keyword">auto</span> eval(U&& x)</div> |
| <div class="line"><a name="l00479"></a><span class="lineno"> 479</span>  -> decltype(std::forward<U>(x))</div> |
| <div class="line"><a name="l00480"></a><span class="lineno"> 480</span>  {</div> |
| <div class="line"><a name="l00481"></a><span class="lineno"> 481</span>  <span class="keywordflow">return</span> std::forward<U>(x);</div> |
| <div class="line"><a name="l00482"></a><span class="lineno"> 482</span>  }</div> |
| <div class="line"><a name="l00483"></a><span class="lineno"> 483</span> };</div> |
| <div class="line"><a name="l00484"></a><span class="lineno"> 484</span>  </div> |
| <div class="line"><a name="l00485"></a><span class="lineno"> 485</span> <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l00486"></a><span class="lineno"> 486</span> <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keyword">auto</span> deref_noexcept(It& it) MOODYCAMEL_NOEXCEPT -> decltype(*it)</div> |
| <div class="line"><a name="l00487"></a><span class="lineno"> 487</span> {</div> |
| <div class="line"><a name="l00488"></a><span class="lineno"> 488</span>  <span class="keywordflow">return</span> *it;</div> |
| <div class="line"><a name="l00489"></a><span class="lineno"> 489</span> }</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> <span class="preprocessor">#if defined(__clang__) || !defined(__GNUC__) || __GNUC__ > 4 || (__GNUC__ == 4 && __GNUC_MINOR__ >= 8)</span></div> |
| <div class="line"><a name="l00492"></a><span class="lineno"> 492</span> <span class="keyword">template</span><<span class="keyword">typename</span> T> <span class="keyword">struct </span>is_trivially_destructible : std::is_trivially_destructible<T> { };</div> |
| <div class="line"><a name="l00493"></a><span class="lineno"> 493</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00494"></a><span class="lineno"> 494</span> <span class="keyword">template</span><<span class="keyword">typename</span> T> <span class="keyword">struct </span>is_trivially_destructible : std::has_trivial_destructor<T> { };</div> |
| <div class="line"><a name="l00495"></a><span class="lineno"> 495</span> <span class="preprocessor">#endif</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="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l00498"></a><span class="lineno"> 498</span> <span class="preprocessor">#ifdef MCDBGQ_USE_RELACY</span></div> |
| <div class="line"><a name="l00499"></a><span class="lineno"> 499</span>  <span class="keyword">typedef</span> RelacyThreadExitListener ThreadExitListener;</div> |
| <div class="line"><a name="l00500"></a><span class="lineno"> 500</span>  <span class="keyword">typedef</span> RelacyThreadExitNotifier ThreadExitNotifier;</div> |
| <div class="line"><a name="l00501"></a><span class="lineno"> 501</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l00502"></a><span class="lineno"> 502</span>  <span class="keyword">struct </span>ThreadExitListener</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>  <span class="keyword">typedef</span> void (*callback_t)(<span class="keywordtype">void</span>*);</div> |
| <div class="line"><a name="l00505"></a><span class="lineno"> 505</span>  callback_t callback;</div> |
| <div class="line"><a name="l00506"></a><span class="lineno"> 506</span>  <span class="keywordtype">void</span>* userData;</div> |
| <div class="line"><a name="l00507"></a><span class="lineno"> 507</span>  </div> |
| <div class="line"><a name="l00508"></a><span class="lineno"> 508</span>  ThreadExitListener* next; <span class="comment">// reserved for use by the ThreadExitNotifier</span></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>  </div> |
| <div class="line"><a name="l00511"></a><span class="lineno"> 511</span>  </div> |
| <div class="line"><a name="l00512"></a><span class="lineno"> 512</span>  <span class="keyword">class </span>ThreadExitNotifier</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>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00515"></a><span class="lineno"> 515</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> subscribe(ThreadExitListener* listener)</div> |
| <div class="line"><a name="l00516"></a><span class="lineno"> 516</span>  {</div> |
| <div class="line"><a name="l00517"></a><span class="lineno"> 517</span>  <span class="keyword">auto</span>& tlsInst = instance();</div> |
| <div class="line"><a name="l00518"></a><span class="lineno"> 518</span>  listener->next = tlsInst.tail;</div> |
| <div class="line"><a name="l00519"></a><span class="lineno"> 519</span>  tlsInst.tail = listener;</div> |
| <div class="line"><a name="l00520"></a><span class="lineno"> 520</span>  }</div> |
| <div class="line"><a name="l00521"></a><span class="lineno"> 521</span>  </div> |
| <div class="line"><a name="l00522"></a><span class="lineno"> 522</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> unsubscribe(ThreadExitListener* listener)</div> |
| <div class="line"><a name="l00523"></a><span class="lineno"> 523</span>  {</div> |
| <div class="line"><a name="l00524"></a><span class="lineno"> 524</span>  <span class="keyword">auto</span>& tlsInst = instance();</div> |
| <div class="line"><a name="l00525"></a><span class="lineno"> 525</span>  ThreadExitListener** prev = &tlsInst.tail;</div> |
| <div class="line"><a name="l00526"></a><span class="lineno"> 526</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = tlsInst.tail; ptr != <span class="keyword">nullptr</span>; ptr = ptr->next) {</div> |
| <div class="line"><a name="l00527"></a><span class="lineno"> 527</span>  <span class="keywordflow">if</span> (ptr == listener) {</div> |
| <div class="line"><a name="l00528"></a><span class="lineno"> 528</span>  *prev = ptr->next;</div> |
| <div class="line"><a name="l00529"></a><span class="lineno"> 529</span>  <span class="keywordflow">break</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>  prev = &ptr->next;</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>  </div> |
| <div class="line"><a name="l00535"></a><span class="lineno"> 535</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00536"></a><span class="lineno"> 536</span>  ThreadExitNotifier() : tail(nullptr) { }</div> |
| <div class="line"><a name="l00537"></a><span class="lineno"> 537</span>  ThreadExitNotifier(ThreadExitNotifier <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00538"></a><span class="lineno"> 538</span>  ThreadExitNotifier& operator=(ThreadExitNotifier <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00539"></a><span class="lineno"> 539</span>  </div> |
| <div class="line"><a name="l00540"></a><span class="lineno"> 540</span>  ~ThreadExitNotifier()</div> |
| <div class="line"><a name="l00541"></a><span class="lineno"> 541</span>  {</div> |
| <div class="line"><a name="l00542"></a><span class="lineno"> 542</span>  <span class="comment">// This thread is about to exit, let everyone know!</span></div> |
| <div class="line"><a name="l00543"></a><span class="lineno"> 543</span>  assert(<span class="keyword">this</span> == &instance() && <span class="stringliteral">"If this assert fails, you likely have a buggy compiler! Change the preprocessor conditions such that MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED is no longer defined."</span>);</div> |
| <div class="line"><a name="l00544"></a><span class="lineno"> 544</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = tail; ptr != <span class="keyword">nullptr</span>; ptr = ptr->next) {</div> |
| <div class="line"><a name="l00545"></a><span class="lineno"> 545</span>  ptr->callback(ptr->userData);</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>  </div> |
| <div class="line"><a name="l00549"></a><span class="lineno"> 549</span>  <span class="comment">// Thread-local</span></div> |
| <div class="line"><a name="l00550"></a><span class="lineno"> 550</span>  <span class="keyword">static</span> <span class="keyword">inline</span> ThreadExitNotifier& instance()</div> |
| <div class="line"><a name="l00551"></a><span class="lineno"> 551</span>  {</div> |
| <div class="line"><a name="l00552"></a><span class="lineno"> 552</span>  <span class="keyword">static</span> thread_local ThreadExitNotifier notifier;</div> |
| <div class="line"><a name="l00553"></a><span class="lineno"> 553</span>  <span class="keywordflow">return</span> notifier;</div> |
| <div class="line"><a name="l00554"></a><span class="lineno"> 554</span>  }</div> |
| <div class="line"><a name="l00555"></a><span class="lineno"> 555</span>  </div> |
| <div class="line"><a name="l00556"></a><span class="lineno"> 556</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00557"></a><span class="lineno"> 557</span>  ThreadExitListener* tail;</div> |
| <div class="line"><a name="l00558"></a><span class="lineno"> 558</span>  };</div> |
| <div class="line"><a name="l00559"></a><span class="lineno"> 559</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00560"></a><span class="lineno"> 560</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00561"></a><span class="lineno"> 561</span>  </div> |
| <div class="line"><a name="l00562"></a><span class="lineno"> 562</span> <span class="keyword">template</span><<span class="keyword">typename</span> T> <span class="keyword">struct </span>static_is_lock_free_num { <span class="keyword">enum</span> { value = 0 }; };</div> |
| <div class="line"><a name="l00563"></a><span class="lineno"> 563</span> <span class="keyword">template</span><> <span class="keyword">struct </span>static_is_lock_free_num<signed char> { <span class="keyword">enum</span> { value = ATOMIC_CHAR_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00564"></a><span class="lineno"> 564</span> <span class="keyword">template</span><> <span class="keyword">struct </span>static_is_lock_free_num<short> { <span class="keyword">enum</span> { value = ATOMIC_SHORT_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00565"></a><span class="lineno"> 565</span> <span class="keyword">template</span><> <span class="keyword">struct </span>static_is_lock_free_num<int> { <span class="keyword">enum</span> { value = ATOMIC_INT_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00566"></a><span class="lineno"> 566</span> <span class="keyword">template</span><> <span class="keyword">struct </span>static_is_lock_free_num<long> { <span class="keyword">enum</span> { value = ATOMIC_LONG_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00567"></a><span class="lineno"> 567</span> <span class="keyword">template</span><> <span class="keyword">struct </span>static_is_lock_free_num<long long> { <span class="keyword">enum</span> { value = ATOMIC_LLONG_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00568"></a><span class="lineno"> 568</span> <span class="keyword">template</span><<span class="keyword">typename</span> T> <span class="keyword">struct </span>static_is_lock_free : static_is_lock_free_num<typename std::make_signed<T>::type> { };</div> |
| <div class="line"><a name="l00569"></a><span class="lineno"> 569</span> <span class="keyword">template</span><> <span class="keyword">struct </span>static_is_lock_free<bool> { <span class="keyword">enum</span> { value = ATOMIC_BOOL_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00570"></a><span class="lineno"> 570</span> <span class="keyword">template</span><<span class="keyword">typename</span> U> <span class="keyword">struct </span>static_is_lock_free<U*> { <span class="keyword">enum</span> { value = ATOMIC_POINTER_LOCK_FREE }; };</div> |
| <div class="line"><a name="l00571"></a><span class="lineno"> 571</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="keyword">struct </span>ProducerToken</div> |
| <div class="line"><a name="l00575"></a><span class="lineno"> 575</span> {</div> |
| <div class="line"><a name="l00576"></a><span class="lineno"> 576</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l00577"></a><span class="lineno"> 577</span>  <span class="keyword">explicit</span> ProducerToken(ConcurrentQueue<T, Traits>& queue);</div> |
| <div class="line"><a name="l00578"></a><span class="lineno"> 578</span>  </div> |
| <div class="line"><a name="l00579"></a><span class="lineno"> 579</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l00580"></a><span class="lineno"> 580</span>  <span class="keyword">explicit</span> ProducerToken(BlockingConcurrentQueue<T, Traits>& queue);</div> |
| <div class="line"><a name="l00581"></a><span class="lineno"> 581</span>  </div> |
| <div class="line"><a name="l00582"></a><span class="lineno"> 582</span>  ProducerToken(ProducerToken&& other) MOODYCAMEL_NOEXCEPT</div> |
| <div class="line"><a name="l00583"></a><span class="lineno"> 583</span>  : producer(other.producer)</div> |
| <div class="line"><a name="l00584"></a><span class="lineno"> 584</span>  {</div> |
| <div class="line"><a name="l00585"></a><span class="lineno"> 585</span>  other.producer = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00586"></a><span class="lineno"> 586</span>  <span class="keywordflow">if</span> (producer != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00587"></a><span class="lineno"> 587</span>  producer->token = <span class="keyword">this</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>  </div> |
| <div class="line"><a name="l00591"></a><span class="lineno"> 591</span>  <span class="keyword">inline</span> ProducerToken& operator=(ProducerToken&& other) MOODYCAMEL_NOEXCEPT</div> |
| <div class="line"><a name="l00592"></a><span class="lineno"> 592</span>  {</div> |
| <div class="line"><a name="l00593"></a><span class="lineno"> 593</span>  swap(other);</div> |
| <div class="line"><a name="l00594"></a><span class="lineno"> 594</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00595"></a><span class="lineno"> 595</span>  }</div> |
| <div class="line"><a name="l00596"></a><span class="lineno"> 596</span>  </div> |
| <div class="line"><a name="l00597"></a><span class="lineno"> 597</span>  <span class="keywordtype">void</span> swap(ProducerToken& other) MOODYCAMEL_NOEXCEPT</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>  std::swap(producer, other.producer);</div> |
| <div class="line"><a name="l00600"></a><span class="lineno"> 600</span>  <span class="keywordflow">if</span> (producer != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00601"></a><span class="lineno"> 601</span>  producer->token = <span class="keyword">this</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">if</span> (other.producer != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00604"></a><span class="lineno"> 604</span>  other.producer->token = &other;</div> |
| <div class="line"><a name="l00605"></a><span class="lineno"> 605</span>  }</div> |
| <div class="line"><a name="l00606"></a><span class="lineno"> 606</span>  }</div> |
| <div class="line"><a name="l00607"></a><span class="lineno"> 607</span>  </div> |
| <div class="line"><a name="l00608"></a><span class="lineno"> 608</span>  <span class="comment">// A token is always valid unless:</span></div> |
| <div class="line"><a name="l00609"></a><span class="lineno"> 609</span>  <span class="comment">// 1) Memory allocation failed during construction</span></div> |
| <div class="line"><a name="l00610"></a><span class="lineno"> 610</span>  <span class="comment">// 2) It was moved via the move constructor</span></div> |
| <div class="line"><a name="l00611"></a><span class="lineno"> 611</span>  <span class="comment">// (Note: assignment does a swap, leaving both potentially valid)</span></div> |
| <div class="line"><a name="l00612"></a><span class="lineno"> 612</span>  <span class="comment">// 3) The associated queue was destroyed</span></div> |
| <div class="line"><a name="l00613"></a><span class="lineno"> 613</span>  <span class="comment">// Note that if valid() returns true, that only indicates</span></div> |
| <div class="line"><a name="l00614"></a><span class="lineno"> 614</span>  <span class="comment">// that the token is valid for use with a specific queue,</span></div> |
| <div class="line"><a name="l00615"></a><span class="lineno"> 615</span>  <span class="comment">// but not which one; that's up to the user to track.</span></div> |
| <div class="line"><a name="l00616"></a><span class="lineno"> 616</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> valid()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> producer != <span class="keyword">nullptr</span>; }</div> |
| <div class="line"><a name="l00617"></a><span class="lineno"> 617</span>  </div> |
| <div class="line"><a name="l00618"></a><span class="lineno"> 618</span>  ~ProducerToken()</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="keywordflow">if</span> (producer != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00621"></a><span class="lineno"> 621</span>  producer->token = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00622"></a><span class="lineno"> 622</span>  producer->inactive.store(<span class="keyword">true</span>, std::memory_order_release);</div> |
| <div class="line"><a name="l00623"></a><span class="lineno"> 623</span>  }</div> |
| <div class="line"><a name="l00624"></a><span class="lineno"> 624</span>  }</div> |
| <div class="line"><a name="l00625"></a><span class="lineno"> 625</span>  </div> |
| <div class="line"><a name="l00626"></a><span class="lineno"> 626</span>  <span class="comment">// Disable copying and assignment</span></div> |
| <div class="line"><a name="l00627"></a><span class="lineno"> 627</span>  ProducerToken(ProducerToken <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00628"></a><span class="lineno"> 628</span>  ProducerToken& operator=(ProducerToken <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00629"></a><span class="lineno"> 629</span>  </div> |
| <div class="line"><a name="l00630"></a><span class="lineno"> 630</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00631"></a><span class="lineno"> 631</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits> <span class="keyword">friend</span> <span class="keyword">class </span>ConcurrentQueue;</div> |
| <div class="line"><a name="l00632"></a><span class="lineno"> 632</span>  <span class="keyword">friend</span> <span class="keyword">class </span>ConcurrentQueueTests;</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="keyword">protected</span>:</div> |
| <div class="line"><a name="l00635"></a><span class="lineno"> 635</span>  details::ConcurrentQueueProducerTypelessBase* producer;</div> |
| <div class="line"><a name="l00636"></a><span class="lineno"> 636</span> };</div> |
| <div class="line"><a name="l00637"></a><span class="lineno"> 637</span>  </div> |
| <div class="line"><a name="l00638"></a><span class="lineno"> 638</span>  </div> |
| <div class="line"><a name="l00639"></a><span class="lineno"> 639</span> <span class="keyword">struct </span>ConsumerToken</div> |
| <div class="line"><a name="l00640"></a><span class="lineno"> 640</span> {</div> |
| <div class="line"><a name="l00641"></a><span class="lineno"> 641</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l00642"></a><span class="lineno"> 642</span>  <span class="keyword">explicit</span> ConsumerToken(ConcurrentQueue<T, Traits>& q);</div> |
| <div class="line"><a name="l00643"></a><span class="lineno"> 643</span>  </div> |
| <div class="line"><a name="l00644"></a><span class="lineno"> 644</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l00645"></a><span class="lineno"> 645</span>  <span class="keyword">explicit</span> ConsumerToken(BlockingConcurrentQueue<T, Traits>& q);</div> |
| <div class="line"><a name="l00646"></a><span class="lineno"> 646</span>  </div> |
| <div class="line"><a name="l00647"></a><span class="lineno"> 647</span>  ConsumerToken(ConsumerToken&& other) MOODYCAMEL_NOEXCEPT</div> |
| <div class="line"><a name="l00648"></a><span class="lineno"> 648</span>  : initialOffset(other.initialOffset), lastKnownGlobalOffset(other.lastKnownGlobalOffset), itemsConsumedFromCurrent(other.itemsConsumedFromCurrent), currentProducer(other.currentProducer), desiredProducer(other.desiredProducer)</div> |
| <div class="line"><a name="l00649"></a><span class="lineno"> 649</span>  {</div> |
| <div class="line"><a name="l00650"></a><span class="lineno"> 650</span>  }</div> |
| <div class="line"><a name="l00651"></a><span class="lineno"> 651</span>  </div> |
| <div class="line"><a name="l00652"></a><span class="lineno"> 652</span>  <span class="keyword">inline</span> ConsumerToken& operator=(ConsumerToken&& other) MOODYCAMEL_NOEXCEPT</div> |
| <div class="line"><a name="l00653"></a><span class="lineno"> 653</span>  {</div> |
| <div class="line"><a name="l00654"></a><span class="lineno"> 654</span>  swap(other);</div> |
| <div class="line"><a name="l00655"></a><span class="lineno"> 655</span>  <span class="keywordflow">return</span> *<span class="keyword">this</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="keywordtype">void</span> swap(ConsumerToken& other) MOODYCAMEL_NOEXCEPT</div> |
| <div class="line"><a name="l00659"></a><span class="lineno"> 659</span>  {</div> |
| <div class="line"><a name="l00660"></a><span class="lineno"> 660</span>  std::swap(initialOffset, other.initialOffset);</div> |
| <div class="line"><a name="l00661"></a><span class="lineno"> 661</span>  std::swap(lastKnownGlobalOffset, other.lastKnownGlobalOffset);</div> |
| <div class="line"><a name="l00662"></a><span class="lineno"> 662</span>  std::swap(itemsConsumedFromCurrent, other.itemsConsumedFromCurrent);</div> |
| <div class="line"><a name="l00663"></a><span class="lineno"> 663</span>  std::swap(currentProducer, other.currentProducer);</div> |
| <div class="line"><a name="l00664"></a><span class="lineno"> 664</span>  std::swap(desiredProducer, other.desiredProducer);</div> |
| <div class="line"><a name="l00665"></a><span class="lineno"> 665</span>  }</div> |
| <div class="line"><a name="l00666"></a><span class="lineno"> 666</span>  </div> |
| <div class="line"><a name="l00667"></a><span class="lineno"> 667</span>  <span class="comment">// Disable copying and assignment</span></div> |
| <div class="line"><a name="l00668"></a><span class="lineno"> 668</span>  ConsumerToken(ConsumerToken <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00669"></a><span class="lineno"> 669</span>  ConsumerToken& operator=(ConsumerToken <span class="keyword">const</span>&) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00670"></a><span class="lineno"> 670</span>  </div> |
| <div class="line"><a name="l00671"></a><span class="lineno"> 671</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00672"></a><span class="lineno"> 672</span>  <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits> <span class="keyword">friend</span> <span class="keyword">class </span>ConcurrentQueue;</div> |
| <div class="line"><a name="l00673"></a><span class="lineno"> 673</span>  <span class="keyword">friend</span> <span class="keyword">class </span>ConcurrentQueueTests;</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="keyword">private</span>: <span class="comment">// but shared with ConcurrentQueue</span></div> |
| <div class="line"><a name="l00676"></a><span class="lineno"> 676</span>  std::uint32_t initialOffset;</div> |
| <div class="line"><a name="l00677"></a><span class="lineno"> 677</span>  std::uint32_t lastKnownGlobalOffset;</div> |
| <div class="line"><a name="l00678"></a><span class="lineno"> 678</span>  std::uint32_t itemsConsumedFromCurrent;</div> |
| <div class="line"><a name="l00679"></a><span class="lineno"> 679</span>  details::ConcurrentQueueProducerTypelessBase* currentProducer;</div> |
| <div class="line"><a name="l00680"></a><span class="lineno"> 680</span>  details::ConcurrentQueueProducerTypelessBase* desiredProducer;</div> |
| <div class="line"><a name="l00681"></a><span class="lineno"> 681</span> };</div> |
| <div class="line"><a name="l00682"></a><span class="lineno"> 682</span>  </div> |
| <div class="line"><a name="l00683"></a><span class="lineno"> 683</span> <span class="comment">// Need to forward-declare this swap because it's in a namespace.</span></div> |
| <div class="line"><a name="l00684"></a><span class="lineno"> 684</span> <span class="comment">// See http://stackoverflow.com/questions/4492062/why-does-a-c-friend-class-need-a-forward-declaration-only-in-other-namespaces</span></div> |
| <div class="line"><a name="l00685"></a><span class="lineno"> 685</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l00686"></a><span class="lineno"> 686</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(<span class="keyword">typename</span> ConcurrentQueue<T, Traits>::ImplicitProducerKVP& a, <span class="keyword">typename</span> ConcurrentQueue<T, Traits>::ImplicitProducerKVP& b) MOODYCAMEL_NOEXCEPT;</div> |
| <div class="line"><a name="l00687"></a><span class="lineno"> 687</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> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits = ConcurrentQueueDefaultTraits></div> |
| <div class="line"><a name="l00690"></a><span class="lineno"> 690</span> <span class="keyword">class </span>ConcurrentQueue {</div> |
| <div class="line"><a name="l00691"></a><span class="lineno"> 691</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00692"></a><span class="lineno"> 692</span>  typedef ::dmlc::moodycamel::ProducerToken producer_token_t;</div> |
| <div class="line"><a name="l00693"></a><span class="lineno"> 693</span>  typedef ::dmlc::moodycamel::ConsumerToken consumer_token_t;</div> |
| <div class="line"><a name="l00694"></a><span class="lineno"> 694</span>  </div> |
| <div class="line"><a name="l00695"></a><span class="lineno"> 695</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">Traits::index_t</a> <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a>;</div> |
| <div class="line"><a name="l00696"></a><span class="lineno"> 696</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> Traits::size_t size_t;</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="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> BLOCK_SIZE = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::BLOCK_SIZE);</div> |
| <div class="line"><a name="l00699"></a><span class="lineno"> 699</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD);</div> |
| <div class="line"><a name="l00700"></a><span class="lineno"> 700</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> EXPLICIT_INITIAL_INDEX_SIZE = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::EXPLICIT_INITIAL_INDEX_SIZE);</div> |
| <div class="line"><a name="l00701"></a><span class="lineno"> 701</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> IMPLICIT_INITIAL_INDEX_SIZE = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::IMPLICIT_INITIAL_INDEX_SIZE);</div> |
| <div class="line"><a name="l00702"></a><span class="lineno"> 702</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> INITIAL_IMPLICIT_PRODUCER_HASH_SIZE = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE);</div> |
| <div class="line"><a name="l00703"></a><span class="lineno"> 703</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::uint32_t EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE = <span class="keyword">static_cast<</span>std::uint32_t<span class="keyword">></span>(Traits::EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE);</div> |
| <div class="line"><a name="l00704"></a><span class="lineno"> 704</span> <span class="preprocessor">#ifdef _MSC_VER</span></div> |
| <div class="line"><a name="l00705"></a><span class="lineno"> 705</span> <span class="preprocessor"> #pragma warning(push)</span></div> |
| <div class="line"><a name="l00706"></a><span class="lineno"> 706</span> <span class="preprocessor">#pragma warning(disable: 4307) // + integral constant overflow (that's what the ternary expression is for!)</span></div> |
| <div class="line"><a name="l00707"></a><span class="lineno"> 707</span> <span class="preprocessor">#pragma warning(disable: 4309) // static_cast: Truncation of constant value</span></div> |
| <div class="line"><a name="l00708"></a><span class="lineno"> 708</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00709"></a><span class="lineno"> 709</span>  <span class="keyword">static</span> <span class="keyword">const</span> <span class="keywordtype">size_t</span> MAX_SUBQUEUE_SIZE = (details::const_numeric_max<size_t>::value -</div> |
| <div class="line"><a name="l00710"></a><span class="lineno"> 710</span>  <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::MAX_SUBQUEUE_SIZE) <</div> |
| <div class="line"><a name="l00711"></a><span class="lineno"> 711</span>  BLOCK_SIZE) ? details::const_numeric_max<size_t>::value</div> |
| <div class="line"><a name="l00712"></a><span class="lineno"> 712</span>  : (</div> |
| <div class="line"><a name="l00713"></a><span class="lineno"> 713</span>  (<span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(Traits::MAX_SUBQUEUE_SIZE) +</div> |
| <div class="line"><a name="l00714"></a><span class="lineno"> 714</span>  (BLOCK_SIZE - 1)) / BLOCK_SIZE * BLOCK_SIZE);</div> |
| <div class="line"><a name="l00715"></a><span class="lineno"> 715</span> <span class="preprocessor">#ifdef _MSC_VER</span></div> |
| <div class="line"><a name="l00716"></a><span class="lineno"> 716</span> <span class="preprocessor">#pragma warning(pop)</span></div> |
| <div class="line"><a name="l00717"></a><span class="lineno"> 717</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00718"></a><span class="lineno"> 718</span>  </div> |
| <div class="line"><a name="l00719"></a><span class="lineno"> 719</span>  static_assert(!std::numeric_limits<size_t>::is_signed && std::is_integral<size_t>::value,</div> |
| <div class="line"><a name="l00720"></a><span class="lineno"> 720</span>  <span class="stringliteral">"Traits::size_t must be an unsigned integral type"</span>);</div> |
| <div class="line"><a name="l00721"></a><span class="lineno"> 721</span>  static_assert(!std::numeric_limits<index_t>::is_signed && std::is_integral<index_t>::value,</div> |
| <div class="line"><a name="l00722"></a><span class="lineno"> 722</span>  <span class="stringliteral">"Traits::index_t must be an unsigned integral type"</span>);</div> |
| <div class="line"><a name="l00723"></a><span class="lineno"> 723</span>  static_assert(<span class="keyword">sizeof</span>(<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a>) >= <span class="keyword">sizeof</span>(<span class="keywordtype">size_t</span>),</div> |
| <div class="line"><a name="l00724"></a><span class="lineno"> 724</span>  <span class="stringliteral">"Traits::index_t must be at least as wide as Traits::size_t"</span>);</div> |
| <div class="line"><a name="l00725"></a><span class="lineno"> 725</span>  static_assert((BLOCK_SIZE > 1) && !(BLOCK_SIZE & (BLOCK_SIZE - 1)),</div> |
| <div class="line"><a name="l00726"></a><span class="lineno"> 726</span>  <span class="stringliteral">"Traits::BLOCK_SIZE must be a power of 2 (and at least 2)"</span>);</div> |
| <div class="line"><a name="l00727"></a><span class="lineno"> 727</span>  static_assert((EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD > 1) &&</div> |
| <div class="line"><a name="l00728"></a><span class="lineno"> 728</span>  !(EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD &</div> |
| <div class="line"><a name="l00729"></a><span class="lineno"> 729</span>  (EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD - 1)),</div> |
| <div class="line"><a name="l00730"></a><span class="lineno"> 730</span>  <span class="stringliteral">"Traits::EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD must be a power of 2 (and greater than 1)"</span>);</div> |
| <div class="line"><a name="l00731"></a><span class="lineno"> 731</span>  static_assert((EXPLICIT_INITIAL_INDEX_SIZE > 1) &&</div> |
| <div class="line"><a name="l00732"></a><span class="lineno"> 732</span>  !(EXPLICIT_INITIAL_INDEX_SIZE & (EXPLICIT_INITIAL_INDEX_SIZE - 1)),</div> |
| <div class="line"><a name="l00733"></a><span class="lineno"> 733</span>  <span class="stringliteral">"Traits::EXPLICIT_INITIAL_INDEX_SIZE must be a power of 2 (and greater than 1)"</span>);</div> |
| <div class="line"><a name="l00734"></a><span class="lineno"> 734</span>  static_assert((IMPLICIT_INITIAL_INDEX_SIZE > 1) &&</div> |
| <div class="line"><a name="l00735"></a><span class="lineno"> 735</span>  !(IMPLICIT_INITIAL_INDEX_SIZE & (IMPLICIT_INITIAL_INDEX_SIZE - 1)),</div> |
| <div class="line"><a name="l00736"></a><span class="lineno"> 736</span>  <span class="stringliteral">"Traits::IMPLICIT_INITIAL_INDEX_SIZE must be a power of 2 (and greater than 1)"</span>);</div> |
| <div class="line"><a name="l00737"></a><span class="lineno"> 737</span>  static_assert((INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) ||</div> |
| <div class="line"><a name="l00738"></a><span class="lineno"> 738</span>  !(INITIAL_IMPLICIT_PRODUCER_HASH_SIZE & (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE - 1)),</div> |
| <div class="line"><a name="l00739"></a><span class="lineno"> 739</span>  <span class="stringliteral">"Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE must be a power of 2"</span>);</div> |
| <div class="line"><a name="l00740"></a><span class="lineno"> 740</span>  static_assert(</div> |
| <div class="line"><a name="l00741"></a><span class="lineno"> 741</span>  INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0 || INITIAL_IMPLICIT_PRODUCER_HASH_SIZE >= 1,</div> |
| <div class="line"><a name="l00742"></a><span class="lineno"> 742</span>  <span class="stringliteral">"Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE must be at least 1 (or 0 to disable implicit enqueueing)"</span>);</div> |
| <div class="line"><a name="l00743"></a><span class="lineno"> 743</span>  </div> |
| <div class="line"><a name="l00744"></a><span class="lineno"> 744</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00745"></a><span class="lineno"> 745</span>  <span class="comment">// Creates a queue with at least `capacity` element slots; note that the</span></div> |
| <div class="line"><a name="l00746"></a><span class="lineno"> 746</span>  <span class="comment">// actual number of elements that can be inserted without additional memory</span></div> |
| <div class="line"><a name="l00747"></a><span class="lineno"> 747</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="l00748"></a><span class="lineno"> 748</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="l00749"></a><span class="lineno"> 749</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="l00750"></a><span class="lineno"> 750</span>  <span class="comment">// without an extra allocation -- blocks aren't shared between producers).</span></div> |
| <div class="line"><a name="l00751"></a><span class="lineno"> 751</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="l00752"></a><span class="lineno"> 752</span>  <span class="comment">// queue is fully constructed before it starts being used by other threads (this</span></div> |
| <div class="line"><a name="l00753"></a><span class="lineno"> 753</span>  <span class="comment">// includes making the memory effects of construction visible, possibly with a</span></div> |
| <div class="line"><a name="l00754"></a><span class="lineno"> 754</span>  <span class="comment">// memory barrier).</span></div> |
| <div class="line"><a name="l00755"></a><span class="lineno"> 755</span>  <span class="keyword">explicit</span> ConcurrentQueue(<span class="keywordtype">size_t</span> capacity = 6 * BLOCK_SIZE)</div> |
| <div class="line"><a name="l00756"></a><span class="lineno"> 756</span>  : producerListTail(nullptr), producerCount(0), initialBlockPoolIndex(0), nextExplicitConsumerId(</div> |
| <div class="line"><a name="l00757"></a><span class="lineno"> 757</span>  0), globalExplicitConsumerOffset(0) {</div> |
| <div class="line"><a name="l00758"></a><span class="lineno"> 758</span>  implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00759"></a><span class="lineno"> 759</span>  populate_initial_implicit_producer_hash();</div> |
| <div class="line"><a name="l00760"></a><span class="lineno"> 760</span>  populate_initial_block_list(</div> |
| <div class="line"><a name="l00761"></a><span class="lineno"> 761</span>  capacity / BLOCK_SIZE + ((capacity & (BLOCK_SIZE - 1)) == 0 ? 0 : 1));</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> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l00764"></a><span class="lineno"> 764</span>  <span class="comment">// Track all the producers using a fully-resolved typed list for</span></div> |
| <div class="line"><a name="l00765"></a><span class="lineno"> 765</span>  <span class="comment">// each kind; this makes it possible to debug them starting from</span></div> |
| <div class="line"><a name="l00766"></a><span class="lineno"> 766</span>  <span class="comment">// the root queue object (otherwise wacky casts are needed that</span></div> |
| <div class="line"><a name="l00767"></a><span class="lineno"> 767</span>  <span class="comment">// don't compile in the debugger's expression evaluator).</span></div> |
| <div class="line"><a name="l00768"></a><span class="lineno"> 768</span>  explicitProducers.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00769"></a><span class="lineno"> 769</span>  implicitProducers.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00770"></a><span class="lineno"> 770</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00771"></a><span class="lineno"> 771</span>  }</div> |
| <div class="line"><a name="l00772"></a><span class="lineno"> 772</span>  </div> |
| <div class="line"><a name="l00773"></a><span class="lineno"> 773</span>  <span class="comment">// Computes the correct amount of pre-allocated blocks for you based</span></div> |
| <div class="line"><a name="l00774"></a><span class="lineno"> 774</span>  <span class="comment">// on the minimum number of elements you want available at any given</span></div> |
| <div class="line"><a name="l00775"></a><span class="lineno"> 775</span>  <span class="comment">// time, and the maximum concurrent number of each type of producer.</span></div> |
| <div class="line"><a name="l00776"></a><span class="lineno"> 776</span>  ConcurrentQueue(<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="l00777"></a><span class="lineno"> 777</span>  : producerListTail(nullptr), producerCount(0), initialBlockPoolIndex(0), nextExplicitConsumerId(</div> |
| <div class="line"><a name="l00778"></a><span class="lineno"> 778</span>  0), globalExplicitConsumerOffset(0) {</div> |
| <div class="line"><a name="l00779"></a><span class="lineno"> 779</span>  implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00780"></a><span class="lineno"> 780</span>  populate_initial_implicit_producer_hash();</div> |
| <div class="line"><a name="l00781"></a><span class="lineno"> 781</span>  <span class="keywordtype">size_t</span> blocks =</div> |
| <div class="line"><a name="l00782"></a><span class="lineno"> 782</span>  (((minCapacity + BLOCK_SIZE - 1) / BLOCK_SIZE) - 1) * (maxExplicitProducers + 1) +</div> |
| <div class="line"><a name="l00783"></a><span class="lineno"> 783</span>  2 * (maxExplicitProducers + maxImplicitProducers);</div> |
| <div class="line"><a name="l00784"></a><span class="lineno"> 784</span>  populate_initial_block_list(blocks);</div> |
| <div class="line"><a name="l00785"></a><span class="lineno"> 785</span>  </div> |
| <div class="line"><a name="l00786"></a><span class="lineno"> 786</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l00787"></a><span class="lineno"> 787</span>  explicitProducers.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00788"></a><span class="lineno"> 788</span>  implicitProducers.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00789"></a><span class="lineno"> 789</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00790"></a><span class="lineno"> 790</span>  }</div> |
| <div class="line"><a name="l00791"></a><span class="lineno"> 791</span>  </div> |
| <div class="line"><a name="l00792"></a><span class="lineno"> 792</span>  <span class="comment">// Note: The queue should not be accessed concurrently while it's</span></div> |
| <div class="line"><a name="l00793"></a><span class="lineno"> 793</span>  <span class="comment">// being deleted. It's up to the user to synchronize this.</span></div> |
| <div class="line"><a name="l00794"></a><span class="lineno"> 794</span>  <span class="comment">// This method is not thread safe.</span></div> |
| <div class="line"><a name="l00795"></a><span class="lineno"> 795</span>  ~ConcurrentQueue() {</div> |
| <div class="line"><a name="l00796"></a><span class="lineno"> 796</span>  <span class="comment">// Destroy producers</span></div> |
| <div class="line"><a name="l00797"></a><span class="lineno"> 797</span>  <span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00798"></a><span class="lineno"> 798</span>  <span class="keywordflow">while</span> (ptr != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00799"></a><span class="lineno"> 799</span>  <span class="keyword">auto</span> next = ptr->next_prod();</div> |
| <div class="line"><a name="l00800"></a><span class="lineno"> 800</span>  <span class="keywordflow">if</span> (ptr->token != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00801"></a><span class="lineno"> 801</span>  ptr->token->producer = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00802"></a><span class="lineno"> 802</span>  }</div> |
| <div class="line"><a name="l00803"></a><span class="lineno"> 803</span>  destroy(ptr);</div> |
| <div class="line"><a name="l00804"></a><span class="lineno"> 804</span>  ptr = next;</div> |
| <div class="line"><a name="l00805"></a><span class="lineno"> 805</span>  }</div> |
| <div class="line"><a name="l00806"></a><span class="lineno"> 806</span>  </div> |
| <div class="line"><a name="l00807"></a><span class="lineno"> 807</span>  <span class="comment">// Destroy implicit producer hash tables</span></div> |
| <div class="line"><a name="l00808"></a><span class="lineno"> 808</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE != 0) {</div> |
| <div class="line"><a name="l00809"></a><span class="lineno"> 809</span>  <span class="keyword">auto</span> hash = implicitProducerHash.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00810"></a><span class="lineno"> 810</span>  <span class="keywordflow">while</span> (hash != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00811"></a><span class="lineno"> 811</span>  <span class="keyword">auto</span> prev = hash->prev;</div> |
| <div class="line"><a name="l00812"></a><span class="lineno"> 812</span>  <span class="keywordflow">if</span> (prev !=</div> |
| <div class="line"><a name="l00813"></a><span class="lineno"> 813</span>  <span class="keyword">nullptr</span>) { <span class="comment">// The last hash is part of this object and was not allocated dynamically</span></div> |
| <div class="line"><a name="l00814"></a><span class="lineno"> 814</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != hash->capacity; ++i) {</div> |
| <div class="line"><a name="l00815"></a><span class="lineno"> 815</span>  hash->entries[i].~ImplicitProducerKVP();</div> |
| <div class="line"><a name="l00816"></a><span class="lineno"> 816</span>  }</div> |
| <div class="line"><a name="l00817"></a><span class="lineno"> 817</span>  hash->~ImplicitProducerHash();</div> |
| <div class="line"><a name="l00818"></a><span class="lineno"> 818</span>  (Traits::free)(hash);</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>  hash = prev;</div> |
| <div class="line"><a name="l00821"></a><span class="lineno"> 821</span>  }</div> |
| <div class="line"><a name="l00822"></a><span class="lineno"> 822</span>  }</div> |
| <div class="line"><a name="l00823"></a><span class="lineno"> 823</span>  </div> |
| <div class="line"><a name="l00824"></a><span class="lineno"> 824</span>  <span class="comment">// Destroy global free list</span></div> |
| <div class="line"><a name="l00825"></a><span class="lineno"> 825</span>  <span class="keyword">auto</span> block = freeList.head_unsafe();</div> |
| <div class="line"><a name="l00826"></a><span class="lineno"> 826</span>  <span class="keywordflow">while</span> (block != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l00827"></a><span class="lineno"> 827</span>  <span class="keyword">auto</span> next = block->freeListNext.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00828"></a><span class="lineno"> 828</span>  <span class="keywordflow">if</span> (block->dynamicallyAllocated) {</div> |
| <div class="line"><a name="l00829"></a><span class="lineno"> 829</span>  destroy(block);</div> |
| <div class="line"><a name="l00830"></a><span class="lineno"> 830</span>  }</div> |
| <div class="line"><a name="l00831"></a><span class="lineno"> 831</span>  block = next;</div> |
| <div class="line"><a name="l00832"></a><span class="lineno"> 832</span>  }</div> |
| <div class="line"><a name="l00833"></a><span class="lineno"> 833</span>  </div> |
| <div class="line"><a name="l00834"></a><span class="lineno"> 834</span>  <span class="comment">// Destroy initial free list</span></div> |
| <div class="line"><a name="l00835"></a><span class="lineno"> 835</span>  destroy_array(initialBlockPool, initialBlockPoolSize);</div> |
| <div class="line"><a name="l00836"></a><span class="lineno"> 836</span>  }</div> |
| <div class="line"><a name="l00837"></a><span class="lineno"> 837</span>  </div> |
| <div class="line"><a name="l00838"></a><span class="lineno"> 838</span>  <span class="comment">// Disable copying and copy assignment</span></div> |
| <div class="line"><a name="l00839"></a><span class="lineno"> 839</span>  ConcurrentQueue(ConcurrentQueue <span class="keyword">const</span> &) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00840"></a><span class="lineno"> 840</span>  </div> |
| <div class="line"><a name="l00841"></a><span class="lineno"> 841</span>  ConcurrentQueue &operator=(ConcurrentQueue <span class="keyword">const</span> &) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l00842"></a><span class="lineno"> 842</span>  </div> |
| <div class="line"><a name="l00843"></a><span class="lineno"> 843</span>  <span class="comment">// Moving is supported, but note that it is *not* a thread-safe operation.</span></div> |
| <div class="line"><a name="l00844"></a><span class="lineno"> 844</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="l00845"></a><span class="lineno"> 845</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="l00846"></a><span class="lineno"> 846</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="l00847"></a><span class="lineno"> 847</span>  <span class="comment">// used with the destination queue (i.e. semantically they are moved along</span></div> |
| <div class="line"><a name="l00848"></a><span class="lineno"> 848</span>  <span class="comment">// with the queue itself).</span></div> |
| <div class="line"><a name="l00849"></a><span class="lineno"> 849</span>  ConcurrentQueue(ConcurrentQueue &&other) MOODYCAMEL_NOEXCEPT</div> |
| <div class="line"><a name="l00850"></a><span class="lineno"> 850</span>  : producerListTail(other.producerListTail.load(std::memory_order_relaxed)), producerCount(</div> |
| <div class="line"><a name="l00851"></a><span class="lineno"> 851</span>  other.producerCount.load(std::memory_order_relaxed)), initialBlockPoolIndex(</div> |
| <div class="line"><a name="l00852"></a><span class="lineno"> 852</span>  other.initialBlockPoolIndex.load(std::memory_order_relaxed)), initialBlockPool(</div> |
| <div class="line"><a name="l00853"></a><span class="lineno"> 853</span>  other.initialBlockPool), initialBlockPoolSize(other.initialBlockPoolSize), freeList(</div> |
| <div class="line"><a name="l00854"></a><span class="lineno"> 854</span>  std::move(other.freeList)), nextExplicitConsumerId(</div> |
| <div class="line"><a name="l00855"></a><span class="lineno"> 855</span>  other.nextExplicitConsumerId.load(std::memory_order_relaxed)), globalExplicitConsumerOffset(</div> |
| <div class="line"><a name="l00856"></a><span class="lineno"> 856</span>  other.globalExplicitConsumerOffset.load(std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l00857"></a><span class="lineno"> 857</span>  <span class="comment">// Move the other one into this, and leave the other one as an empty queue</span></div> |
| <div class="line"><a name="l00858"></a><span class="lineno"> 858</span>  implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00859"></a><span class="lineno"> 859</span>  populate_initial_implicit_producer_hash();</div> |
| <div class="line"><a name="l00860"></a><span class="lineno"> 860</span>  swap_implicit_producer_hashes(other);</div> |
| <div class="line"><a name="l00861"></a><span class="lineno"> 861</span>  </div> |
| <div class="line"><a name="l00862"></a><span class="lineno"> 862</span>  other.producerListTail.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00863"></a><span class="lineno"> 863</span>  other.producerCount.store(0, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00864"></a><span class="lineno"> 864</span>  other.nextExplicitConsumerId.store(0, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00865"></a><span class="lineno"> 865</span>  other.globalExplicitConsumerOffset.store(0, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00866"></a><span class="lineno"> 866</span>  </div> |
| <div class="line"><a name="l00867"></a><span class="lineno"> 867</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l00868"></a><span class="lineno"> 868</span>  explicitProducers.store(other.explicitProducers.load(std::memory_order_relaxed), std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00869"></a><span class="lineno"> 869</span>  other.explicitProducers.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00870"></a><span class="lineno"> 870</span>  implicitProducers.store(other.implicitProducers.load(std::memory_order_relaxed), std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00871"></a><span class="lineno"> 871</span>  other.implicitProducers.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00872"></a><span class="lineno"> 872</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00873"></a><span class="lineno"> 873</span>  </div> |
| <div class="line"><a name="l00874"></a><span class="lineno"> 874</span>  other.initialBlockPoolIndex.store(0, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l00875"></a><span class="lineno"> 875</span>  other.initialBlockPoolSize = 0;</div> |
| <div class="line"><a name="l00876"></a><span class="lineno"> 876</span>  other.initialBlockPool = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l00877"></a><span class="lineno"> 877</span>  </div> |
| <div class="line"><a name="l00878"></a><span class="lineno"> 878</span>  reown_producers();</div> |
| <div class="line"><a name="l00879"></a><span class="lineno"> 879</span>  }</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="keyword">inline</span> ConcurrentQueue &operator=(ConcurrentQueue &&other) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l00882"></a><span class="lineno"> 882</span>  <span class="keywordflow">return</span> swap_internal(other);</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>  </div> |
| <div class="line"><a name="l00885"></a><span class="lineno"> 885</span>  <span class="comment">// Swaps this queue's state with the other's. Not thread-safe.</span></div> |
| <div class="line"><a name="l00886"></a><span class="lineno"> 886</span>  <span class="comment">// Swapping two queues does not invalidate their tokens, however</span></div> |
| <div class="line"><a name="l00887"></a><span class="lineno"> 887</span>  <span class="comment">// the tokens that were created for one queue must be used with</span></div> |
| <div class="line"><a name="l00888"></a><span class="lineno"> 888</span>  <span class="comment">// only the swapped queue (i.e. the tokens are tied to the</span></div> |
| <div class="line"><a name="l00889"></a><span class="lineno"> 889</span>  <span class="comment">// queue's movable state, not the object itself).</span></div> |
| <div class="line"><a name="l00890"></a><span class="lineno"> 890</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(ConcurrentQueue &other) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l00891"></a><span class="lineno"> 891</span>  swap_internal(other);</div> |
| <div class="line"><a name="l00892"></a><span class="lineno"> 892</span>  }</div> |
| <div class="line"><a name="l00893"></a><span class="lineno"> 893</span>  </div> |
| <div class="line"><a name="l00894"></a><span class="lineno"> 894</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l00895"></a><span class="lineno"> 895</span>  ConcurrentQueue &swap_internal(ConcurrentQueue &other) {</div> |
| <div class="line"><a name="l00896"></a><span class="lineno"> 896</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> == &other) {</div> |
| <div class="line"><a name="l00897"></a><span class="lineno"> 897</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</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>  details::swap_relaxed(producerListTail, other.producerListTail);</div> |
| <div class="line"><a name="l00901"></a><span class="lineno"> 901</span>  details::swap_relaxed(producerCount, other.producerCount);</div> |
| <div class="line"><a name="l00902"></a><span class="lineno"> 902</span>  details::swap_relaxed(initialBlockPoolIndex, other.initialBlockPoolIndex);</div> |
| <div class="line"><a name="l00903"></a><span class="lineno"> 903</span>  std::swap(initialBlockPool, other.initialBlockPool);</div> |
| <div class="line"><a name="l00904"></a><span class="lineno"> 904</span>  std::swap(initialBlockPoolSize, other.initialBlockPoolSize);</div> |
| <div class="line"><a name="l00905"></a><span class="lineno"> 905</span>  freeList.swap(other.freeList);</div> |
| <div class="line"><a name="l00906"></a><span class="lineno"> 906</span>  details::swap_relaxed(nextExplicitConsumerId, other.nextExplicitConsumerId);</div> |
| <div class="line"><a name="l00907"></a><span class="lineno"> 907</span>  details::swap_relaxed(globalExplicitConsumerOffset, other.globalExplicitConsumerOffset);</div> |
| <div class="line"><a name="l00908"></a><span class="lineno"> 908</span>  </div> |
| <div class="line"><a name="l00909"></a><span class="lineno"> 909</span>  swap_implicit_producer_hashes(other);</div> |
| <div class="line"><a name="l00910"></a><span class="lineno"> 910</span>  </div> |
| <div class="line"><a name="l00911"></a><span class="lineno"> 911</span>  reown_producers();</div> |
| <div class="line"><a name="l00912"></a><span class="lineno"> 912</span>  other.reown_producers();</div> |
| <div class="line"><a name="l00913"></a><span class="lineno"> 913</span>  </div> |
| <div class="line"><a name="l00914"></a><span class="lineno"> 914</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l00915"></a><span class="lineno"> 915</span>  details::swap_relaxed(explicitProducers, other.explicitProducers);</div> |
| <div class="line"><a name="l00916"></a><span class="lineno"> 916</span>  details::swap_relaxed(implicitProducers, other.implicitProducers);</div> |
| <div class="line"><a name="l00917"></a><span class="lineno"> 917</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l00918"></a><span class="lineno"> 918</span>  </div> |
| <div class="line"><a name="l00919"></a><span class="lineno"> 919</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l00920"></a><span class="lineno"> 920</span>  }</div> |
| <div class="line"><a name="l00921"></a><span class="lineno"> 921</span>  </div> |
| <div class="line"><a name="l00922"></a><span class="lineno"> 922</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l00923"></a><span class="lineno"> 923</span>  <span class="comment">// Enqueues a single item (by copying it).</span></div> |
| <div class="line"><a name="l00924"></a><span class="lineno"> 924</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or implicit</span></div> |
| <div class="line"><a name="l00925"></a><span class="lineno"> 925</span>  <span class="comment">// production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0,</span></div> |
| <div class="line"><a name="l00926"></a><span class="lineno"> 926</span>  <span class="comment">// or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div> |
| <div class="line"><a name="l00927"></a><span class="lineno"> 927</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00928"></a><span class="lineno"> 928</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="l00929"></a><span class="lineno"> 929</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00930"></a><span class="lineno"> 930</span>  <span class="keywordflow">return</span> inner_enqueue<CanAlloc>(item);</div> |
| <div class="line"><a name="l00931"></a><span class="lineno"> 931</span>  }</div> |
| <div class="line"><a name="l00932"></a><span class="lineno"> 932</span>  </div> |
| <div class="line"><a name="l00933"></a><span class="lineno"> 933</span>  <span class="comment">// Enqueues a single item (by moving it, if possible).</span></div> |
| <div class="line"><a name="l00934"></a><span class="lineno"> 934</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or implicit</span></div> |
| <div class="line"><a name="l00935"></a><span class="lineno"> 935</span>  <span class="comment">// production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0,</span></div> |
| <div class="line"><a name="l00936"></a><span class="lineno"> 936</span>  <span class="comment">// or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div> |
| <div class="line"><a name="l00937"></a><span class="lineno"> 937</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00938"></a><span class="lineno"> 938</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(T &&item) {</div> |
| <div class="line"><a name="l00939"></a><span class="lineno"> 939</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00940"></a><span class="lineno"> 940</span>  <span class="keywordflow">return</span> inner_enqueue<CanAlloc>(std::move(item));</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>  </div> |
| <div class="line"><a name="l00943"></a><span class="lineno"> 943</span>  <span class="comment">// Enqueues a single item (by copying it) using an explicit producer token.</span></div> |
| <div class="line"><a name="l00944"></a><span class="lineno"> 944</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or</span></div> |
| <div class="line"><a name="l00945"></a><span class="lineno"> 945</span>  <span class="comment">// Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div> |
| <div class="line"><a name="l00946"></a><span class="lineno"> 946</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00947"></a><span class="lineno"> 947</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="l00948"></a><span class="lineno"> 948</span>  <span class="keywordflow">return</span> inner_enqueue<CanAlloc>(token, item);</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="comment">// Enqueues a single item (by moving it, if possible) using an explicit producer token.</span></div> |
| <div class="line"><a name="l00952"></a><span class="lineno"> 952</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or</span></div> |
| <div class="line"><a name="l00953"></a><span class="lineno"> 953</span>  <span class="comment">// Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div> |
| <div class="line"><a name="l00954"></a><span class="lineno"> 954</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00955"></a><span class="lineno"> 955</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="l00956"></a><span class="lineno"> 956</span>  <span class="keywordflow">return</span> inner_enqueue<CanAlloc>(token, std::move(item));</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="comment">// Enqueues several items.</span></div> |
| <div class="line"><a name="l00960"></a><span class="lineno"> 960</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails (or</span></div> |
| <div class="line"><a name="l00961"></a><span class="lineno"> 961</span>  <span class="comment">// implicit production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE</span></div> |
| <div class="line"><a name="l00962"></a><span class="lineno"> 962</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="l00963"></a><span class="lineno"> 963</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="l00964"></a><span class="lineno"> 964</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00965"></a><span class="lineno"> 965</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l00966"></a><span class="lineno"> 966</span>  <span class="keywordtype">bool</span> enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l00967"></a><span class="lineno"> 967</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00968"></a><span class="lineno"> 968</span>  <span class="keywordflow">return</span> inner_enqueue_bulk<CanAlloc>(itemFirst, count);</div> |
| <div class="line"><a name="l00969"></a><span class="lineno"> 969</span>  }</div> |
| <div class="line"><a name="l00970"></a><span class="lineno"> 970</span>  </div> |
| <div class="line"><a name="l00971"></a><span class="lineno"> 971</span>  <span class="comment">// Enqueues several items using an explicit producer token.</span></div> |
| <div class="line"><a name="l00972"></a><span class="lineno"> 972</span>  <span class="comment">// Allocates memory if required. Only fails if memory allocation fails</span></div> |
| <div class="line"><a name="l00973"></a><span class="lineno"> 973</span>  <span class="comment">// (or Traits::MAX_SUBQUEUE_SIZE has been defined and would be surpassed).</span></div> |
| <div class="line"><a name="l00974"></a><span class="lineno"> 974</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved</span></div> |
| <div class="line"><a name="l00975"></a><span class="lineno"> 975</span>  <span class="comment">// instead of copied.</span></div> |
| <div class="line"><a name="l00976"></a><span class="lineno"> 976</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00977"></a><span class="lineno"> 977</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l00978"></a><span class="lineno"> 978</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="l00979"></a><span class="lineno"> 979</span>  <span class="keywordflow">return</span> inner_enqueue_bulk<CanAlloc>(token, itemFirst, count);</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>  </div> |
| <div class="line"><a name="l00982"></a><span class="lineno"> 982</span>  <span class="comment">// Enqueues a single item (by copying it).</span></div> |
| <div class="line"><a name="l00983"></a><span class="lineno"> 983</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue (or implicit</span></div> |
| <div class="line"><a name="l00984"></a><span class="lineno"> 984</span>  <span class="comment">// production is disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE</span></div> |
| <div class="line"><a name="l00985"></a><span class="lineno"> 985</span>  <span class="comment">// is 0).</span></div> |
| <div class="line"><a name="l00986"></a><span class="lineno"> 986</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00987"></a><span class="lineno"> 987</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="l00988"></a><span class="lineno"> 988</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00989"></a><span class="lineno"> 989</span>  <span class="keywordflow">return</span> inner_enqueue<CannotAlloc>(item);</div> |
| <div class="line"><a name="l00990"></a><span class="lineno"> 990</span>  }</div> |
| <div class="line"><a name="l00991"></a><span class="lineno"> 991</span>  </div> |
| <div class="line"><a name="l00992"></a><span class="lineno"> 992</span>  <span class="comment">// Enqueues a single item (by moving it, if possible).</span></div> |
| <div class="line"><a name="l00993"></a><span class="lineno"> 993</span>  <span class="comment">// Does not allocate memory (except for one-time implicit producer).</span></div> |
| <div class="line"><a name="l00994"></a><span class="lineno"> 994</span>  <span class="comment">// Fails if not enough room to enqueue (or implicit production is</span></div> |
| <div class="line"><a name="l00995"></a><span class="lineno"> 995</span>  <span class="comment">// disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0).</span></div> |
| <div class="line"><a name="l00996"></a><span class="lineno"> 996</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l00997"></a><span class="lineno"> 997</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_enqueue(T &&item) {</div> |
| <div class="line"><a name="l00998"></a><span class="lineno"> 998</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l00999"></a><span class="lineno"> 999</span>  <span class="keywordflow">return</span> inner_enqueue<CannotAlloc>(std::move(item));</div> |
| <div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>  }</div> |
| <div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>  </div> |
| <div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>  <span class="comment">// Enqueues a single item (by copying it) using an explicit producer token.</span></div> |
| <div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue.</span></div> |
| <div class="line"><a name="l01004"></a><span class="lineno"> 1004</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l01005"></a><span class="lineno"> 1005</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="l01006"></a><span class="lineno"> 1006</span>  <span class="keywordflow">return</span> inner_enqueue<CannotAlloc>(token, item);</div> |
| <div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>  }</div> |
| <div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>  </div> |
| <div class="line"><a name="l01009"></a><span class="lineno"> 1009</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="l01010"></a><span class="lineno"> 1010</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue.</span></div> |
| <div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l01012"></a><span class="lineno"> 1012</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="l01013"></a><span class="lineno"> 1013</span>  <span class="keywordflow">return</span> inner_enqueue<CannotAlloc>(token, std::move(item));</div> |
| <div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>  }</div> |
| <div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>  </div> |
| <div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>  <span class="comment">// Enqueues several items.</span></div> |
| <div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>  <span class="comment">// Does not allocate memory (except for one-time implicit producer).</span></div> |
| <div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>  <span class="comment">// Fails if not enough room to enqueue (or implicit production is</span></div> |
| <div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>  <span class="comment">// disabled because Traits::INITIAL_IMPLICIT_PRODUCER_HASH_SIZE is 0).</span></div> |
| <div class="line"><a name="l01020"></a><span class="lineno"> 1020</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved</span></div> |
| <div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>  <span class="comment">// instead of copied.</span></div> |
| <div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>  <span class="keywordtype">bool</span> try_enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l01025"></a><span class="lineno"> 1025</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>  <span class="keywordflow">return</span> inner_enqueue_bulk<CannotAlloc>(itemFirst, count);</div> |
| <div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>  }</div> |
| <div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>  </div> |
| <div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>  <span class="comment">// Enqueues several items using an explicit producer token.</span></div> |
| <div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>  <span class="comment">// Does not allocate memory. Fails if not enough room to enqueue.</span></div> |
| <div class="line"><a name="l01031"></a><span class="lineno"> 1031</span>  <span class="comment">// Note: Use std::make_move_iterator if the elements should be moved</span></div> |
| <div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>  <span class="comment">// instead of copied.</span></div> |
| <div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01035"></a><span class="lineno"> 1035</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="l01036"></a><span class="lineno"> 1036</span>  <span class="keywordflow">return</span> inner_enqueue_bulk<CannotAlloc>(token, itemFirst, count);</div> |
| <div class="line"><a name="l01037"></a><span class="lineno"> 1037</span>  }</div> |
| <div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>  </div> |
| <div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>  </div> |
| <div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>  <span class="comment">// Attempts to dequeue from the queue.</span></div> |
| <div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>  <span class="comment">// Returns false if all producer streams appeared empty at the time they</span></div> |
| <div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01043"></a><span class="lineno"> 1043</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>  <span class="keywordtype">bool</span> try_dequeue(U &item) {</div> |
| <div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>  <span class="comment">// Instead of simply trying each producer in turn (which could cause needless contention on the first</span></div> |
| <div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>  <span class="comment">// producer), we score them heuristically.</span></div> |
| <div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>  <span class="keywordtype">size_t</span> nonEmptyCount = 0;</div> |
| <div class="line"><a name="l01049"></a><span class="lineno"> 1049</span>  ProducerBase *best = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>  <span class="keywordtype">size_t</span> bestSize = 0;</div> |
| <div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>  nonEmptyCount < 3 && ptr != nullptr; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>  <span class="keyword">auto</span> size = ptr->size_approx();</div> |
| <div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>  <span class="keywordflow">if</span> (size > 0) {</div> |
| <div class="line"><a name="l01055"></a><span class="lineno"> 1055</span>  <span class="keywordflow">if</span> (size > bestSize) {</div> |
| <div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>  bestSize = size;</div> |
| <div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>  best = ptr;</div> |
| <div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>  }</div> |
| <div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>  ++nonEmptyCount;</div> |
| <div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>  }</div> |
| <div class="line"><a name="l01061"></a><span class="lineno"> 1061</span>  }</div> |
| <div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>  </div> |
| <div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>  <span class="comment">// If there was at least one non-empty queue but it appears empty at the time</span></div> |
| <div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>  <span class="comment">// we try to dequeue from it, we need to make sure every queue's been tried</span></div> |
| <div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>  <span class="keywordflow">if</span> (nonEmptyCount > 0) {</div> |
| <div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>  <span class="keywordflow">if</span> (details::likely(best->dequeue(item))) {</div> |
| <div class="line"><a name="l01067"></a><span class="lineno"> 1067</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>  }</div> |
| <div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>  ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>  <span class="keywordflow">if</span> (ptr != best && ptr->dequeue(item)) {</div> |
| <div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01073"></a><span class="lineno"> 1073</span>  }</div> |
| <div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>  }</div> |
| <div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>  }</div> |
| <div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>  }</div> |
| <div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>  </div> |
| <div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>  <span class="comment">// Attempts to dequeue from the queue.</span></div> |
| <div class="line"><a name="l01080"></a><span class="lineno"> 1080</span>  <span class="comment">// Returns false if all producer streams appeared empty at the time they</span></div> |
| <div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>  <span class="comment">// This differs from the try_dequeue(item) method in that this one does</span></div> |
| <div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>  <span class="comment">// not attempt to reduce contention by interleaving the order that producer</span></div> |
| <div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>  <span class="comment">// streams are dequeued from. So, using this method can reduce overall throughput</span></div> |
| <div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>  <span class="comment">// under contention, but will give more predictable results in single-threaded</span></div> |
| <div class="line"><a name="l01086"></a><span class="lineno"> 1086</span>  <span class="comment">// consumer scenarios. This is mostly only useful for internal unit tests.</span></div> |
| <div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>  <span class="keywordtype">bool</span> try_dequeue_non_interleaved(U &item) {</div> |
| <div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>  ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l01092"></a><span class="lineno"> 1092</span>  <span class="keywordflow">if</span> (ptr->dequeue(item)) {</div> |
| <div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>  }</div> |
| <div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>  }</div> |
| <div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>  }</div> |
| <div class="line"><a name="l01098"></a><span class="lineno"> 1098</span>  </div> |
| <div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>  <span class="comment">// Attempts to dequeue from the queue using an explicit consumer token.</span></div> |
| <div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>  <span class="comment">// Returns false if all producer streams appeared empty at the time they</span></div> |
| <div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01104"></a><span class="lineno"> 1104</span>  <span class="keywordtype">bool</span> try_dequeue(consumer_token_t &token, U &item) {</div> |
| <div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>  <span class="comment">// The idea is roughly as follows:</span></div> |
| <div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>  <span class="comment">// Every 256 items from one producer, make everyone rotate (increase the global offset) -> this means the highest efficiency consumer dictates the rotation speed of everyone else, more or less</span></div> |
| <div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>  <span class="comment">// If you see that the global offset has changed, you must reset your consumption counter and move to your designated place</span></div> |
| <div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>  <span class="comment">// If there's no items where you're supposed to be, keep moving until you find a producer with some items</span></div> |
| <div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>  <span class="comment">// If the global offset has not changed but you've run out of items to consume, move over from your current position until you find an producer with something in it</span></div> |
| <div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>  </div> |
| <div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>  <span class="keywordflow">if</span> (token.desiredProducer == <span class="keyword">nullptr</span> || token.lastKnownGlobalOffset !=</div> |
| <div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>  globalExplicitConsumerOffset.load(</div> |
| <div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>  std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>  <span class="keywordflow">if</span> (!update_current_producer_after_rotation(token)) {</div> |
| <div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01116"></a><span class="lineno"> 1116</span>  }</div> |
| <div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>  }</div> |
| <div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>  </div> |
| <div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>  <span class="comment">// If there was at least one non-empty queue but it appears empty at the time</span></div> |
| <div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>  <span class="comment">// we try to dequeue from it, we need to make sure every queue's been tried</span></div> |
| <div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>  <span class="keywordflow">if</span> (<span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.currentProducer)->dequeue(item)) {</div> |
| <div class="line"><a name="l01122"></a><span class="lineno"> 1122</span>  <span class="keywordflow">if</span> (++token.itemsConsumedFromCurrent == EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE) {</div> |
| <div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>  globalExplicitConsumerOffset.fetch_add(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>  }</div> |
| <div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>  }</div> |
| <div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>  </div> |
| <div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>  <span class="keyword">auto</span> tail = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>  <span class="keyword">auto</span> ptr = <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.currentProducer)->next_prod();</div> |
| <div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>  <span class="keywordflow">if</span> (ptr == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01131"></a><span class="lineno"> 1131</span>  ptr = tail;</div> |
| <div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>  }</div> |
| <div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>  <span class="keywordflow">while</span> (ptr != <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.currentProducer)) {</div> |
| <div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>  <span class="keywordflow">if</span> (ptr->dequeue(item)) {</div> |
| <div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>  token.currentProducer = ptr;</div> |
| <div class="line"><a name="l01136"></a><span class="lineno"> 1136</span>  token.itemsConsumedFromCurrent = 1;</div> |
| <div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>  }</div> |
| <div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>  ptr = ptr->next_prod();</div> |
| <div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>  <span class="keywordflow">if</span> (ptr == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01141"></a><span class="lineno"> 1141</span>  ptr = tail;</div> |
| <div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>  }</div> |
| <div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>  }</div> |
| <div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>  }</div> |
| <div class="line"><a name="l01146"></a><span class="lineno"> 1146</span>  </div> |
| <div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>  <span class="comment">// Attempts to dequeue several elements from the queue.</span></div> |
| <div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>  <span class="comment">// Returns the number of items actually dequeued.</span></div> |
| <div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>  <span class="comment">// Returns 0 if all producer streams appeared empty at the time they</span></div> |
| <div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01153"></a><span class="lineno"> 1153</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="l01154"></a><span class="lineno"> 1154</span>  <span class="keywordtype">size_t</span> count = 0;</div> |
| <div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>  ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>  count += ptr->dequeue_bulk(itemFirst, max - count);</div> |
| <div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>  <span class="keywordflow">if</span> (count == max) {</div> |
| <div class="line"><a name="l01159"></a><span class="lineno"> 1159</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>  }</div> |
| <div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>  }</div> |
| <div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>  <span class="keywordflow">return</span> count;</div> |
| <div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>  }</div> |
| <div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>  </div> |
| <div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>  <span class="comment">// Attempts to dequeue several elements from the queue using an explicit consumer token.</span></div> |
| <div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>  <span class="comment">// Returns the number of items actually dequeued.</span></div> |
| <div class="line"><a name="l01167"></a><span class="lineno"> 1167</span>  <span class="comment">// Returns 0 if all producer streams appeared empty at the time they</span></div> |
| <div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>  <span class="comment">// were checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01171"></a><span class="lineno"> 1171</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="l01172"></a><span class="lineno"> 1172</span>  <span class="keywordflow">if</span> (token.desiredProducer == <span class="keyword">nullptr</span> || token.lastKnownGlobalOffset !=</div> |
| <div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>  globalExplicitConsumerOffset.load(</div> |
| <div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>  std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>  <span class="keywordflow">if</span> (!update_current_producer_after_rotation(token)) {</div> |
| <div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>  <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>  }</div> |
| <div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>  }</div> |
| <div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>  </div> |
| <div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>  <span class="keywordtype">size_t</span> count = <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.currentProducer)->dequeue_bulk(itemFirst, max);</div> |
| <div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>  <span class="keywordflow">if</span> (count == max) {</div> |
| <div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>  <span class="keywordflow">if</span> ((token.itemsConsumedFromCurrent += <span class="keyword">static_cast<</span>std::uint32_t<span class="keyword">></span>(max)) >=</div> |
| <div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>  EXPLICIT_CONSUMER_CONSUMPTION_QUOTA_BEFORE_ROTATE) {</div> |
| <div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>  globalExplicitConsumerOffset.fetch_add(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>  }</div> |
| <div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>  <span class="keywordflow">return</span> max;</div> |
| <div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>  }</div> |
| <div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>  token.itemsConsumedFromCurrent += <span class="keyword">static_cast<</span>std::uint32_t<span class="keyword">></span>(count);</div> |
| <div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>  max -= count;</div> |
| <div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>  </div> |
| <div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>  <span class="keyword">auto</span> tail = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>  <span class="keyword">auto</span> ptr = <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.currentProducer)->next_prod();</div> |
| <div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>  <span class="keywordflow">if</span> (ptr == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>  ptr = tail;</div> |
| <div class="line"><a name="l01195"></a><span class="lineno"> 1195</span>  }</div> |
| <div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>  <span class="keywordflow">while</span> (ptr != <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.currentProducer)) {</div> |
| <div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>  <span class="keyword">auto</span> dequeued = ptr->dequeue_bulk(itemFirst, max);</div> |
| <div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>  count += dequeued;</div> |
| <div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>  <span class="keywordflow">if</span> (dequeued != 0) {</div> |
| <div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>  token.currentProducer = ptr;</div> |
| <div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>  token.itemsConsumedFromCurrent = <span class="keyword">static_cast<</span>std::uint32_t<span class="keyword">></span>(dequeued);</div> |
| <div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>  }</div> |
| <div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>  <span class="keywordflow">if</span> (dequeued == max) {</div> |
| <div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>  }</div> |
| <div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>  max -= dequeued;</div> |
| <div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>  ptr = ptr->next_prod();</div> |
| <div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>  <span class="keywordflow">if</span> (ptr == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>  ptr = tail;</div> |
| <div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>  }</div> |
| <div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>  }</div> |
| <div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>  <span class="keywordflow">return</span> count;</div> |
| <div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>  }</div> |
| <div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>  </div> |
| <div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>  </div> |
| <div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>  <span class="comment">// Attempts to dequeue from a specific producer's inner queue.</span></div> |
| <div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>  <span class="comment">// If you happen to know which producer you want to dequeue from, this</span></div> |
| <div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>  <span class="comment">// is significantly faster than using the general-case try_dequeue methods.</span></div> |
| <div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>  <span class="comment">// Returns false if the producer's queue appeared empty at the time it</span></div> |
| <div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>  <span class="comment">// was checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> try_dequeue_from_producer(producer_token_t <span class="keyword">const</span> &producer, U &item) {</div> |
| <div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ExplicitProducer *<span class="keyword">></span>(producer.producer)->dequeue(item);</div> |
| <div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>  }</div> |
| <div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>  </div> |
| <div class="line"><a name="l01227"></a><span class="lineno"> 1227</span>  <span class="comment">// Attempts to dequeue several elements from a specific producer's inner queue.</span></div> |
| <div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>  <span class="comment">// Returns the number of items actually dequeued.</span></div> |
| <div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>  <span class="comment">// If you happen to know which producer you want to dequeue from, this</span></div> |
| <div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>  <span class="comment">// is significantly faster than using the general-case try_dequeue methods.</span></div> |
| <div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>  <span class="comment">// Returns 0 if the producer's queue appeared empty at the time it</span></div> |
| <div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>  <span class="comment">// was checked (so, the queue is likely but not guaranteed to be empty).</span></div> |
| <div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>  <span class="comment">// Never allocates. Thread-safe.</span></div> |
| <div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div> |
| <div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>  try_dequeue_bulk_from_producer(producer_token_t <span class="keyword">const</span> &producer, It itemFirst, <span class="keywordtype">size_t</span> max) {</div> |
| <div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ExplicitProducer *<span class="keyword">></span>(producer.producer)->dequeue_bulk(itemFirst, max);</div> |
| <div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>  }</div> |
| <div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>  </div> |
| <div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>  </div> |
| <div class="line"><a name="l01241"></a><span class="lineno"> 1241</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="l01242"></a><span class="lineno"> 1242</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="l01243"></a><span class="lineno"> 1243</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="l01244"></a><span class="lineno"> 1244</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="l01245"></a><span class="lineno"> 1245</span>  <span class="comment">// being called).</span></div> |
| <div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>  <span class="keywordtype">size_t</span> size_approx()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>  <span class="keywordtype">size_t</span> size = 0;</div> |
| <div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>  ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>  size += ptr->size_approx();</div> |
| <div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>  }</div> |
| <div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>  <span class="keywordflow">return</span> size;</div> |
| <div class="line"><a name="l01254"></a><span class="lineno"> 1254</span>  }</div> |
| <div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>  </div> |
| <div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>  </div> |
| <div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>  <span class="comment">// Returns true if the underlying atomic variables used by</span></div> |
| <div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>  <span class="comment">// the queue are lock-free (they should be on most platforms).</span></div> |
| <div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>  <span class="comment">// Thread-safe.</span></div> |
| <div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>  <span class="keyword">static</span> <span class="keywordtype">bool</span> is_lock_free() {</div> |
| <div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>  <span class="keywordflow">return</span></div> |
| <div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>  details::static_is_lock_free<bool>::value == 2 &&</div> |
| <div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>  details::static_is_lock_free<size_t>::value == 2 &&</div> |
| <div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>  details::static_is_lock_free<std::uint32_t>::value == 2 &&</div> |
| <div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>  details::static_is_lock_free<index_t>::value == 2 &&</div> |
| <div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>  details::static_is_lock_free<void *>::value == 2 &&</div> |
| <div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>  details::static_is_lock_free<typename details::thread_id_converter<details::thread_id_t>::thread_id_numeric_size_t>::value ==</div> |
| <div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>  2;</div> |
| <div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>  }</div> |
| <div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>  </div> |
| <div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>  </div> |
| <div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>ProducerToken;</div> |
| <div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>ConsumerToken;</div> |
| <div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>ExplicitProducer;</div> |
| <div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>  </div> |
| <div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>  <span class="keyword">friend</span> <span class="keyword">class </span>ConcurrentQueueTests;</div> |
| <div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>  </div> |
| <div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>  <span class="keyword">enum</span> AllocationMode {</div> |
| <div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>  CanAlloc, CannotAlloc</div> |
| <div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>  };</div> |
| <div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>  </div> |
| <div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>  </div> |
| <div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>  <span class="comment">// Queue methods</span></div> |
| <div class="line"><a name="l01287"></a><span class="lineno"> 1287</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>  <span class="keyword">template</span><AllocationMode canAlloc, <span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> inner_enqueue(producer_token_t <span class="keyword">const</span> &token, U &&element) {</div> |
| <div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ExplicitProducer *<span class="keyword">></span>(token.producer)->ConcurrentQueue::ExplicitProducer::template enqueue<canAlloc>(</div> |
| <div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>  std::forward<U>(element));</div> |
| <div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>  }</div> |
| <div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>  </div> |
| <div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>  <span class="keyword">template</span><AllocationMode canAlloc, <span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> inner_enqueue(U &&element) {</div> |
| <div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>  <span class="keyword">auto</span> producer = get_or_add_implicit_producer();</div> |
| <div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>  <span class="keywordflow">return</span> producer == <span class="keyword">nullptr</span> ? false</div> |
| <div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>  : producer->ConcurrentQueue::ImplicitProducer::template enqueue<canAlloc>(</div> |
| <div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>  std::forward<U>(element));</div> |
| <div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>  }</div> |
| <div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>  </div> |
| <div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>  <span class="keyword">template</span><AllocationMode canAlloc, <span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01303"></a><span class="lineno"> 1303</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> inner_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="l01304"></a><span class="lineno"> 1304</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ExplicitProducer *<span class="keyword">></span>(token.producer)->ConcurrentQueue::ExplicitProducer::template enqueue_bulk<canAlloc>(</div> |
| <div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>  itemFirst, count);</div> |
| <div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>  }</div> |
| <div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>  </div> |
| <div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>  <span class="keyword">template</span><AllocationMode canAlloc, <span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> inner_enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>  <span class="keyword">auto</span> producer = get_or_add_implicit_producer();</div> |
| <div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>  <span class="keywordflow">return</span> producer == <span class="keyword">nullptr</span> ? false</div> |
| <div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>  : producer->ConcurrentQueue::ImplicitProducer::template enqueue_bulk<canAlloc>(</div> |
| <div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>  itemFirst, count);</div> |
| <div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>  }</div> |
| <div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>  </div> |
| <div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> update_current_producer_after_rotation(consumer_token_t &token) {</div> |
| <div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>  <span class="comment">// Ah, there's been a rotation, figure out where we should be!</span></div> |
| <div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>  <span class="keyword">auto</span> tail = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>  <span class="keywordflow">if</span> (token.desiredProducer == <span class="keyword">nullptr</span> && tail == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>  }</div> |
| <div class="line"><a name="l01322"></a><span class="lineno"> 1322</span>  <span class="keyword">auto</span> prodCount = producerCount.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>  <span class="keyword">auto</span> globalOffset = globalExplicitConsumerOffset.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>  <span class="keywordflow">if</span> (details::unlikely(token.desiredProducer == <span class="keyword">nullptr</span>)) {</div> |
| <div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>  <span class="comment">// Aha, first time we're dequeueing anything.</span></div> |
| <div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>  <span class="comment">// Figure out our local position</span></div> |
| <div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>  <span class="comment">// Note: offset is from start, not end, but we're traversing from end -- subtract from count first</span></div> |
| <div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>  std::uint32_t offset = prodCount - 1 - (token.initialOffset % prodCount);</div> |
| <div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>  token.desiredProducer = tail;</div> |
| <div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>  <span class="keywordflow">for</span> (std::uint32_t i = 0; i != offset; ++i) {</div> |
| <div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>  token.desiredProducer = <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.desiredProducer)->next_prod();</div> |
| <div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>  <span class="keywordflow">if</span> (token.desiredProducer == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>  token.desiredProducer = tail;</div> |
| <div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>  }</div> |
| <div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>  }</div> |
| <div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>  }</div> |
| <div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>  </div> |
| <div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>  std::uint32_t delta = globalOffset - token.lastKnownGlobalOffset;</div> |
| <div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>  <span class="keywordflow">if</span> (delta >= prodCount) {</div> |
| <div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>  delta = delta % prodCount;</div> |
| <div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>  }</div> |
| <div class="line"><a name="l01342"></a><span class="lineno"> 1342</span>  <span class="keywordflow">for</span> (std::uint32_t i = 0; i != delta; ++i) {</div> |
| <div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>  token.desiredProducer = <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(token.desiredProducer)->next_prod();</div> |
| <div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>  <span class="keywordflow">if</span> (token.desiredProducer == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>  token.desiredProducer = tail;</div> |
| <div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>  }</div> |
| <div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>  }</div> |
| <div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>  </div> |
| <div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>  token.lastKnownGlobalOffset = globalOffset;</div> |
| <div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>  token.currentProducer = token.desiredProducer;</div> |
| <div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>  token.itemsConsumedFromCurrent = 0;</div> |
| <div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>  }</div> |
| <div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>  </div> |
| <div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>  </div> |
| <div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>  <span class="comment">// Free list</span></div> |
| <div class="line"><a name="l01359"></a><span class="lineno"> 1359</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>  <span class="keyword">template</span><<span class="keyword">typename</span> N></div> |
| <div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>  <span class="keyword">struct </span>FreeListNode {</div> |
| <div class="line"><a name="l01362"></a><span class="lineno"> 1362</span>  FreeListNode()</div> |
| <div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>  : freeListRefs(0), freeListNext(nullptr) {}</div> |
| <div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>  </div> |
| <div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>  std::atomic<std::uint32_t> freeListRefs;</div> |
| <div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>  std::atomic<N *> freeListNext;</div> |
| <div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>  };</div> |
| <div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>  </div> |
| <div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>  <span class="comment">// A simple CAS-based lock-free free list. Not the fastest thing in the world under heavy contention, but</span></div> |
| <div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>  <span class="comment">// simple and correct (assuming nodes are never freed until after the free list is destroyed), and fairly</span></div> |
| <div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>  <span class="comment">// speedy under low contention.</span></div> |
| <div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>  <span class="keyword">template</span><<span class="keyword">typename</span> N> <span class="comment">// N must inherit FreeListNode or have the same fields (and initialization of them)</span></div> |
| <div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>  <span class="keyword">struct </span>FreeList {</div> |
| <div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>  FreeList()</div> |
| <div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>  : freeListHead(nullptr) {}</div> |
| <div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>  </div> |
| <div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>  FreeList(FreeList &&other)</div> |
| <div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>  : freeListHead(other.freeListHead.load(<a class="code" href="namespacestd.html">std</a>::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>  other.freeListHead.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>  }</div> |
| <div class="line"><a name="l01381"></a><span class="lineno"> 1381</span>  </div> |
| <div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>  <span class="keywordtype">void</span> swap(FreeList &other) { details::swap_relaxed(freeListHead, other.freeListHead); }</div> |
| <div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>  </div> |
| <div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>  FreeList(FreeList <span class="keyword">const</span> &) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>  </div> |
| <div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>  FreeList &operator=(FreeList <span class="keyword">const</span> &) MOODYCAMEL_DELETE_FUNCTION;</div> |
| <div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>  </div> |
| <div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> add(N *node) {</div> |
| <div class="line"><a name="l01389"></a><span class="lineno"> 1389</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_FREELIST</span></div> |
| <div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l01391"></a><span class="lineno"> 1391</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>  <span class="comment">// We know that the should-be-on-freelist bit is 0 at this point, so it's safe to</span></div> |
| <div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>  <span class="comment">// set it using a fetch_add</span></div> |
| <div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>  <span class="keywordflow">if</span> (node->freeListRefs.fetch_add(SHOULD_BE_ON_FREELIST, std::memory_order_acq_rel) == 0) {</div> |
| <div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>  <span class="comment">// Oh look! We were the last ones referencing this node, and we know</span></div> |
| <div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>  <span class="comment">// we want to add it to the free list, so let's do it!</span></div> |
| <div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>  add_knowing_refcount_is_zero(node);</div> |
| <div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>  }</div> |
| <div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>  }</div> |
| <div class="line"><a name="l01400"></a><span class="lineno"> 1400</span>  </div> |
| <div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>  <span class="keyword">inline</span> N *try_get() {</div> |
| <div class="line"><a name="l01402"></a><span class="lineno"> 1402</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_FREELIST</span></div> |
| <div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l01404"></a><span class="lineno"> 1404</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>  <span class="keyword">auto</span> head = freeListHead.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>  <span class="keywordflow">while</span> (head != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>  <span class="keyword">auto</span> prevHead = head;</div> |
| <div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>  <span class="keyword">auto</span> refs = head->freeListRefs.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>  <span class="keywordflow">if</span> ((refs & REFS_MASK) == 0 ||</div> |
| <div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>  !head->freeListRefs.compare_exchange_strong(refs, refs + 1, std::memory_order_acquire,</div> |
| <div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>  std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>  head = freeListHead.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>  }</div> |
| <div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>  </div> |
| <div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>  <span class="comment">// Good, reference count has been incremented (it wasn't at zero), which means we can read the</span></div> |
| <div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>  <span class="comment">// next and not worry about it changing between now and the time we do the CAS</span></div> |
| <div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>  <span class="keyword">auto</span> next = head->freeListNext.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01419"></a><span class="lineno"> 1419</span>  <span class="keywordflow">if</span> (freeListHead.compare_exchange_strong(head, next, std::memory_order_acquire,</div> |
| <div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>  std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>  <span class="comment">// Yay, got the node. This means it was on the list, which means shouldBeOnFreeList must be false no</span></div> |
| <div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>  <span class="comment">// matter the refcount (because nobody else knows it's been taken off yet, it can't have been put back on).</span></div> |
| <div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>  assert((head->freeListRefs.load(std::memory_order_relaxed) & SHOULD_BE_ON_FREELIST) == 0);</div> |
| <div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>  </div> |
| <div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>  <span class="comment">// Decrease refcount twice, once for our ref, and once for the list's ref</span></div> |
| <div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>  head->freeListRefs.fetch_sub(2, std::memory_order_release);</div> |
| <div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>  <span class="keywordflow">return</span> head;</div> |
| <div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>  }</div> |
| <div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>  </div> |
| <div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>  <span class="comment">// OK, the head must have changed on us, but we still need to decrease the refcount we increased.</span></div> |
| <div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>  <span class="comment">// Note that we don't need to release any memory effects, but we do need to ensure that the reference</span></div> |
| <div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>  <span class="comment">// count decrement happens-after the CAS on the head.</span></div> |
| <div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>  refs = prevHead->freeListRefs.fetch_sub(1, std::memory_order_acq_rel);</div> |
| <div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>  <span class="keywordflow">if</span> (refs == SHOULD_BE_ON_FREELIST + 1) {</div> |
| <div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>  add_knowing_refcount_is_zero(prevHead);</div> |
| <div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>  }</div> |
| <div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>  }</div> |
| <div class="line"><a name="l01438"></a><span class="lineno"> 1438</span>  </div> |
| <div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>  }</div> |
| <div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>  </div> |
| <div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>  <span class="comment">// Useful for traversing the list when there's no contention (e.g. to destroy remaining nodes)</span></div> |
| <div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>  N *head_unsafe()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> freeListHead.load(std::memory_order_relaxed); }</div> |
| <div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>  </div> |
| <div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> add_knowing_refcount_is_zero(N *node) {</div> |
| <div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>  <span class="comment">// Since the refcount is zero, and nobody can increase it once it's zero (except us, and we run</span></div> |
| <div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>  <span class="comment">// only one copy of this method per node at a time, i.e. the single thread case), then we know</span></div> |
| <div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>  <span class="comment">// we can safely change the next pointer of the node; however, once the refcount is back above</span></div> |
| <div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>  <span class="comment">// zero, then other threads could increase it (happens under heavy contention, when the refcount</span></div> |
| <div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>  <span class="comment">// goes to zero in between a load and a refcount increment of a node in try_get, then back up to</span></div> |
| <div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>  <span class="comment">// something non-zero, then the refcount increment is done by the other thread) -- so, if the CAS</span></div> |
| <div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>  <span class="comment">// to add the node to the actual list fails, decrease the refcount and leave the add operation to</span></div> |
| <div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>  <span class="comment">// the next thread who puts the refcount back at zero (which could be us, hence the loop).</span></div> |
| <div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>  <span class="keyword">auto</span> head = freeListHead.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>  node->freeListNext.store(head, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01458"></a><span class="lineno"> 1458</span>  node->freeListRefs.store(1, std::memory_order_release);</div> |
| <div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>  <span class="keywordflow">if</span> (!freeListHead.compare_exchange_strong(head, node, std::memory_order_release,</div> |
| <div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>  std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>  <span class="comment">// Hmm, the add failed, but we can only try again when the refcount goes back to zero</span></div> |
| <div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>  <span class="keywordflow">if</span> (node->freeListRefs.fetch_add(SHOULD_BE_ON_FREELIST - 1, std::memory_order_release) ==</div> |
| <div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>  1) {</div> |
| <div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>  }</div> |
| <div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>  }</div> |
| <div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>  }</div> |
| <div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>  }</div> |
| <div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>  </div> |
| <div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>  <span class="comment">// Implemented like a stack, but where node order doesn't matter (nodes are inserted out of order under contention)</span></div> |
| <div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>  std::atomic<N *> freeListHead;</div> |
| <div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>  </div> |
| <div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::uint32_t REFS_MASK = 0x7FFFFFFF;</div> |
| <div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>  <span class="keyword">static</span> <span class="keyword">const</span> std::uint32_t SHOULD_BE_ON_FREELIST = 0x80000000;</div> |
| <div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>  </div> |
| <div class="line"><a name="l01478"></a><span class="lineno"> 1478</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_FREELIST</span></div> |
| <div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>  debug::DebugMutex mutex;</div> |
| <div class="line"><a name="l01480"></a><span class="lineno"> 1480</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>  };</div> |
| <div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>  </div> |
| <div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>  </div> |
| <div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>  <span class="comment">// Block</span></div> |
| <div class="line"><a name="l01487"></a><span class="lineno"> 1487</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>  <span class="keyword">enum</span> InnerQueueContext {</div> |
| <div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>  implicit_context = 0, explicit_context = 1</div> |
| <div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>  };</div> |
| <div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>  </div> |
| <div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>  <span class="keyword">struct </span>Block {</div> |
| <div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>  Block()</div> |
| <div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>  : next(nullptr), elementsCompletelyDequeued(0), freeListRefs(0), freeListNext(nullptr)</div> |
| <div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>  , shouldBeOnFreeList(false), dynamicallyAllocated(true) {</div> |
| <div class="line"><a name="l01496"></a><span class="lineno"> 1496</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>  owner = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l01498"></a><span class="lineno"> 1498</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>  }</div> |
| <div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>  </div> |
| <div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>  <span class="keyword">template</span><InnerQueueContext context></div> |
| <div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> is_empty()<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>  <span class="keywordflow">if</span> (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {</div> |
| <div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>  <span class="comment">// Check flags</span></div> |
| <div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < BLOCK_SIZE; ++i) {</div> |
| <div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>  <span class="keywordflow">if</span> (!emptyFlags[i].load(std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>  }</div> |
| <div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>  }</div> |
| <div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>  </div> |
| <div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>  <span class="comment">// Aha, empty; make sure we have all other memory effects that happened before the empty flags were set</span></div> |
| <div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>  std::atomic_thread_fence(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>  <span class="comment">// Check counter</span></div> |
| <div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>  <span class="keywordflow">if</span> (elementsCompletelyDequeued.load(std::memory_order_relaxed) == BLOCK_SIZE) {</div> |
| <div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>  std::atomic_thread_fence(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01518"></a><span class="lineno"> 1518</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>  }</div> |
| <div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>  assert(elementsCompletelyDequeued.load(std::memory_order_relaxed) <= BLOCK_SIZE);</div> |
| <div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>  }</div> |
| <div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>  }</div> |
| <div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>  </div> |
| <div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>  <span class="comment">// Returns true if the block is now empty (does not apply in explicit context)</span></div> |
| <div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>  <span class="keyword">template</span><InnerQueueContext context></div> |
| <div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> set_empty(<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> i) {</div> |
| <div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>  <span class="keywordflow">if</span> (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {</div> |
| <div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>  <span class="comment">// Set flag</span></div> |
| <div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>  assert(!emptyFlags[BLOCK_SIZE - 1 -</div> |
| <div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>  <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(i & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1))].load(</div> |
| <div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>  std::memory_order_relaxed));</div> |
| <div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>  emptyFlags[BLOCK_SIZE - 1 -</div> |
| <div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>  <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(i & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1))].store(<span class="keyword">true</span>,</div> |
| <div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>  std::memory_order_release);</div> |
| <div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01537"></a><span class="lineno"> 1537</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>  <span class="comment">// Increment counter</span></div> |
| <div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>  <span class="keyword">auto</span> prevVal = elementsCompletelyDequeued.fetch_add(1, std::memory_order_release);</div> |
| <div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>  assert(prevVal < BLOCK_SIZE);</div> |
| <div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>  <span class="keywordflow">return</span> prevVal == BLOCK_SIZE - 1;</div> |
| <div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>  }</div> |
| <div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>  }</div> |
| <div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>  </div> |
| <div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>  <span class="comment">// Sets multiple contiguous item statuses to 'empty' (assumes no wrapping and count > 0).</span></div> |
| <div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>  <span class="comment">// Returns true if the block is now empty (does not apply in explicit context).</span></div> |
| <div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>  <span class="keyword">template</span><InnerQueueContext context></div> |
| <div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> set_many_empty(<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> i, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>  <span class="keywordflow">if</span> (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {</div> |
| <div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>  <span class="comment">// Set flags</span></div> |
| <div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>  std::atomic_thread_fence(std::memory_order_release);</div> |
| <div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>  i = BLOCK_SIZE - 1 - <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(i & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) - count +</div> |
| <div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>  1;</div> |
| <div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> j = 0; j != count; ++j) {</div> |
| <div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>  assert(!emptyFlags[i + j].load(std::memory_order_relaxed));</div> |
| <div class="line"><a name="l01556"></a><span class="lineno"> 1556</span>  emptyFlags[i + j].store(<span class="keyword">true</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>  }</div> |
| <div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>  <span class="comment">// Increment counter</span></div> |
| <div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>  <span class="keyword">auto</span> prevVal = elementsCompletelyDequeued.fetch_add(count, std::memory_order_release);</div> |
| <div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>  assert(prevVal + count <= BLOCK_SIZE);</div> |
| <div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>  <span class="keywordflow">return</span> prevVal + count == BLOCK_SIZE;</div> |
| <div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>  }</div> |
| <div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>  }</div> |
| <div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>  </div> |
| <div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>  <span class="keyword">template</span><InnerQueueContext context></div> |
| <div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> set_all_empty() {</div> |
| <div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>  <span class="keywordflow">if</span> (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {</div> |
| <div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>  <span class="comment">// Set all flags</span></div> |
| <div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != BLOCK_SIZE; ++i) {</div> |
| <div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>  emptyFlags[i].store(<span class="keyword">true</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>  }</div> |
| <div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01575"></a><span class="lineno"> 1575</span>  <span class="comment">// Reset counter</span></div> |
| <div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>  elementsCompletelyDequeued.store(BLOCK_SIZE, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>  }</div> |
| <div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>  }</div> |
| <div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>  </div> |
| <div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>  <span class="keyword">template</span><InnerQueueContext context></div> |
| <div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> reset_empty() {</div> |
| <div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>  <span class="keywordflow">if</span> (context == explicit_context && BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD) {</div> |
| <div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>  <span class="comment">// Reset flags</span></div> |
| <div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != BLOCK_SIZE; ++i) {</div> |
| <div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>  emptyFlags[i].store(<span class="keyword">false</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>  }</div> |
| <div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>  <span class="comment">// Reset counter</span></div> |
| <div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>  elementsCompletelyDequeued.store(0, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>  }</div> |
| <div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>  }</div> |
| <div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>  </div> |
| <div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>  <span class="keyword">inline</span> T *operator[](<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> idx) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l01594"></a><span class="lineno"> 1594</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>T *<span class="keyword">></span>(<span class="keyword">static_cast<</span><span class="keywordtype">void</span> *<span class="keyword">></span>(elements)) +</div> |
| <div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>  <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(idx & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1));</div> |
| <div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>  }</div> |
| <div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>  </div> |
| <div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>  <span class="keyword">inline</span> T <span class="keyword">const</span> *operator[](<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> idx) <span class="keyword">const</span> MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>T <span class="keyword">const </span>*<span class="keyword">></span>(<span class="keyword">static_cast<</span><span class="keywordtype">void</span> <span class="keyword">const </span>*<span class="keyword">></span>(elements)) +</div> |
| <div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>  <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(idx & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1));</div> |
| <div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>  }</div> |
| <div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>  </div> |
| <div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>  <span class="comment">// IMPORTANT: This must be the first member in Block, so that if T depends on the alignment of</span></div> |
| <div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>  <span class="comment">// addresses returned by malloc, that alignment will be preserved. Apparently clang actually</span></div> |
| <div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>  <span class="comment">// generates code that uses this assumption for AVX instructions in some cases. Ideally, we</span></div> |
| <div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>  <span class="comment">// should also align Block to the alignment of T in case it's higher than malloc's 16-byte</span></div> |
| <div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>  <span class="comment">// alignment, but this is hard to do in a cross-platform way. Assert for this case:</span></div> |
| <div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>  static_assert(std::alignment_of<T>::value <= std::alignment_of<details::max_align_t>::value,</div> |
| <div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>  <span class="stringliteral">"The queue does not support super-aligned types at this time"</span>);</div> |
| <div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>  <span class="comment">// Additionally, we need the alignment of Block itself to be a multiple of max_align_t since</span></div> |
| <div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>  <span class="comment">// otherwise the appropriate padding will not be added at the end of Block in order to make</span></div> |
| <div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>  <span class="comment">// arrays of Blocks all be properly aligned (not just the first one). We use a union to force</span></div> |
| <div class="line"><a name="l01614"></a><span class="lineno"> 1614</span>  <span class="comment">// this.</span></div> |
| <div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>  <span class="keyword">union </span>{</div> |
| <div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>  <span class="keywordtype">char</span> elements[<span class="keyword">sizeof</span>(T) * BLOCK_SIZE];</div> |
| <div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>  details::max_align_t dummy;</div> |
| <div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>  };</div> |
| <div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>  Block *next;</div> |
| <div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>  std::atomic<size_t> elementsCompletelyDequeued;</div> |
| <div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>  std::atomic<bool> emptyFlags[</div> |
| <div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>  BLOCK_SIZE <= EXPLICIT_BLOCK_EMPTY_COUNTER_THRESHOLD ? BLOCK_SIZE : 1];</div> |
| <div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>  std::atomic<std::uint32_t> freeListRefs;</div> |
| <div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>  std::atomic<Block *> freeListNext;</div> |
| <div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>  std::atomic<bool> shouldBeOnFreeList;</div> |
| <div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>  <span class="keywordtype">bool</span> dynamicallyAllocated; <span class="comment">// Perhaps a better name for this would be 'isNotPartOfInitialBlockPool'</span></div> |
| <div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>  </div> |
| <div class="line"><a name="l01630"></a><span class="lineno"> 1630</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>  <span class="keywordtype">void</span>* owner;</div> |
| <div class="line"><a name="l01632"></a><span class="lineno"> 1632</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>  };</div> |
| <div class="line"><a name="l01634"></a><span class="lineno"> 1634</span>  </div> |
| <div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>  static_assert(std::alignment_of<Block>::value >= std::alignment_of<details::max_align_t>::value,</div> |
| <div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>  <span class="stringliteral">"Internal error: Blocks must be at least as aligned as the type they are wrapping"</span>);</div> |
| <div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>  </div> |
| <div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>  </div> |
| <div class="line"><a name="l01639"></a><span class="lineno"> 1639</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>  <span class="keyword">struct </span>MemStats;</div> |
| <div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l01643"></a><span class="lineno"> 1643</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>  </div> |
| <div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>  <span class="comment">// Producer base</span></div> |
| <div class="line"><a name="l01648"></a><span class="lineno"> 1648</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>  <span class="keyword">struct </span>ProducerBase : <span class="keyword">public</span> details::ConcurrentQueueProducerTypelessBase {</div> |
| <div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>  ProducerBase(ConcurrentQueue *parent_, <span class="keywordtype">bool</span> isExplicit_)</div> |
| <div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>  :</div> |
| <div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>  tailIndex(0), headIndex(0), dequeueOptimisticCount(0), dequeueOvercommit(0), tailBlock(</div> |
| <div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>  nullptr), isExplicit(isExplicit_), parent(parent_) {</div> |
| <div class="line"><a name="l01654"></a><span class="lineno"> 1654</span>  }</div> |
| <div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>  </div> |
| <div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>  <span class="keyword">virtual</span> ~ProducerBase() {};</div> |
| <div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>  </div> |
| <div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> dequeue(U &element) {</div> |
| <div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>  <span class="keywordflow">if</span> (isExplicit) {</div> |
| <div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ExplicitProducer *<span class="keyword">></span>(<span class="keyword">this</span>)->dequeue(element);</div> |
| <div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ImplicitProducer *<span class="keyword">></span>(<span class="keyword">this</span>)->dequeue(element);</div> |
| <div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>  }</div> |
| <div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>  }</div> |
| <div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>  </div> |
| <div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span> dequeue_bulk(It &itemFirst, <span class="keywordtype">size_t</span> max) {</div> |
| <div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>  <span class="keywordflow">if</span> (isExplicit) {</div> |
| <div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ExplicitProducer *<span class="keyword">></span>(<span class="keyword">this</span>)->dequeue_bulk(itemFirst, max);</div> |
| <div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>  <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ImplicitProducer *<span class="keyword">></span>(<span class="keyword">this</span>)->dequeue_bulk(itemFirst, max);</div> |
| <div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>  }</div> |
| <div class="line"><a name="l01674"></a><span class="lineno"> 1674</span>  }</div> |
| <div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>  </div> |
| <div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>  <span class="keyword">inline</span> ProducerBase *next_prod()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(next); }</div> |
| <div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>  </div> |
| <div class="line"><a name="l01678"></a><span class="lineno"> 1678</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="l01679"></a><span class="lineno"> 1679</span>  <span class="keyword">auto</span> tail = tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>  <span class="keyword">auto</span> head = headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>  <span class="keywordflow">return</span> details::circular_less_than(head, tail) ? <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(tail - head) : 0;</div> |
| <div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>  }</div> |
| <div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>  </div> |
| <div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>  <span class="keyword">inline</span> <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> getTail()<span class="keyword"> const </span>{ <span class="keywordflow">return</span> tailIndex.load(std::memory_order_relaxed); }</div> |
| <div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>  </div> |
| <div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>  <span class="keyword">protected</span>:</div> |
| <div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>  std::atomic<index_t> tailIndex; <span class="comment">// Where to enqueue to next</span></div> |
| <div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>  std::atomic<index_t> headIndex; <span class="comment">// Where to dequeue from next</span></div> |
| <div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>  </div> |
| <div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>  std::atomic<index_t> dequeueOptimisticCount;</div> |
| <div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>  std::atomic<index_t> dequeueOvercommit;</div> |
| <div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>  </div> |
| <div class="line"><a name="l01693"></a><span class="lineno"> 1693</span>  Block *tailBlock;</div> |
| <div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>  </div> |
| <div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>  <span class="keywordtype">bool</span> isExplicit;</div> |
| <div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>  ConcurrentQueue *parent;</div> |
| <div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>  </div> |
| <div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>  <span class="keyword">protected</span>:</div> |
| <div class="line"><a name="l01700"></a><span class="lineno"> 1700</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>MemStats;</div> |
| <div class="line"><a name="l01702"></a><span class="lineno"> 1702</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>  };</div> |
| <div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>  </div> |
| <div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>  </div> |
| <div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>  <span class="comment">// Explicit queue</span></div> |
| <div class="line"><a name="l01709"></a><span class="lineno"> 1709</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>  <span class="keyword">struct </span>ExplicitProducer : <span class="keyword">public</span> ProducerBase {</div> |
| <div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>  <span class="keyword">explicit</span> ExplicitProducer(ConcurrentQueue *parent)</div> |
| <div class="line"><a name="l01712"></a><span class="lineno"> 1712</span>  :</div> |
| <div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>  ProducerBase(parent, true), blockIndex(nullptr), pr_blockIndexSlotsUsed(0), pr_blockIndexSize(</div> |
| <div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>  EXPLICIT_INITIAL_INDEX_SIZE >> 1), pr_blockIndexFront(0), pr_blockIndexEntries(nullptr)</div> |
| <div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>  , pr_blockIndexRaw(nullptr) {</div> |
| <div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>  <span class="keywordtype">size_t</span> poolBasedIndexSize = details::ceil_to_pow_2(parent->initialBlockPoolSize) >> 1;</div> |
| <div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>  <span class="keywordflow">if</span> (poolBasedIndexSize > pr_blockIndexSize) {</div> |
| <div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>  pr_blockIndexSize = poolBasedIndexSize;</div> |
| <div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>  }</div> |
| <div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>  </div> |
| <div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>  new_block_index(</div> |
| <div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>  0); <span class="comment">// This creates an index with double the number of current entries, i.e. EXPLICIT_INITIAL_INDEX_SIZE</span></div> |
| <div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>  }</div> |
| <div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>  </div> |
| <div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>  ~ExplicitProducer() {</div> |
| <div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>  <span class="comment">// Destruct any elements not yet dequeued.</span></div> |
| <div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>  <span class="comment">// Since we're in the destructor, we can assume all elements</span></div> |
| <div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>  <span class="comment">// are either completely dequeued or completely not (no halfways).</span></div> |
| <div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>  <span class="keywordflow">if</span> (this->tailBlock != <span class="keyword">nullptr</span>) { <span class="comment">// Note this means there must be a block index too</span></div> |
| <div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>  <span class="comment">// First find the block that's partially dequeued, if any</span></div> |
| <div class="line"><a name="l01731"></a><span class="lineno"> 1731</span>  Block *halfDequeuedBlock = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>  <span class="keywordflow">if</span> ((this->headIndex.load(std::memory_order_relaxed) &</div> |
| <div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) != 0) {</div> |
| <div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>  <span class="comment">// The head's not on a block boundary, meaning a block somewhere is partially dequeued</span></div> |
| <div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>  <span class="comment">// (or the head block is the tail block and was fully dequeued, but the head/tail are still not on a boundary)</span></div> |
| <div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>  <span class="keywordtype">size_t</span> i = (pr_blockIndexFront - pr_blockIndexSlotsUsed) & (pr_blockIndexSize - 1);</div> |
| <div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>  <span class="keywordflow">while</span> (details::circular_less_than<index_t>(pr_blockIndexEntries[i].base + BLOCK_SIZE,</div> |
| <div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>  this->headIndex.load(</div> |
| <div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>  std::memory_order_relaxed))) {</div> |
| <div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>  i = (i + 1) & (pr_blockIndexSize - 1);</div> |
| <div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>  }</div> |
| <div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>  assert(details::circular_less_than<index_t>(pr_blockIndexEntries[i].base,</div> |
| <div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>  this->headIndex.load(</div> |
| <div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>  std::memory_order_relaxed)));</div> |
| <div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>  halfDequeuedBlock = pr_blockIndexEntries[i].block;</div> |
| <div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>  }</div> |
| <div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>  </div> |
| <div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>  <span class="comment">// Start at the head block (note the first line in the loop gives us the head from the tail on the first iteration)</span></div> |
| <div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>  <span class="keyword">auto</span> block = this->tailBlock;</div> |
| <div class="line"><a name="l01750"></a><span class="lineno"> 1750</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>  block = block->next;</div> |
| <div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>  <span class="keywordflow">if</span> (block->template is_empty<explicit_context>()) {</div> |
| <div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>  }</div> |
| <div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>  </div> |
| <div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>  <span class="keywordtype">size_t</span> i = 0; <span class="comment">// Offset into block</span></div> |
| <div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>  <span class="keywordflow">if</span> (block == halfDequeuedBlock) {</div> |
| <div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>  i = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(this->headIndex.load(std::memory_order_relaxed) &</div> |
| <div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1));</div> |
| <div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>  }</div> |
| <div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>  </div> |
| <div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>  <span class="comment">// Walk through all the items in the block; if this is the tail block, we need to stop when we reach the tail index</span></div> |
| <div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>  <span class="keyword">auto</span> lastValidIndex = (this->tailIndex.load(std::memory_order_relaxed) &</div> |
| <div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0 ? BLOCK_SIZE</div> |
| <div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>  : <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(</div> |
| <div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>  this->tailIndex.load(std::memory_order_relaxed) &</div> |
| <div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1));</div> |
| <div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>  <span class="keywordflow">while</span> (i != BLOCK_SIZE && (block != this->tailBlock || i != lastValidIndex)) {</div> |
| <div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>  (*block)[i++]->~T();</div> |
| <div class="line"><a name="l01770"></a><span class="lineno"> 1770</span>  }</div> |
| <div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>  } <span class="keywordflow">while</span> (block != this->tailBlock);</div> |
| <div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>  }</div> |
| <div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>  </div> |
| <div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>  <span class="comment">// Destroy all blocks that we own</span></div> |
| <div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>  <span class="keywordflow">if</span> (this->tailBlock != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>  <span class="keyword">auto</span> block = this->tailBlock;</div> |
| <div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>  <span class="keyword">auto</span> nextBlock = block->next;</div> |
| <div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>  <span class="keywordflow">if</span> (block->dynamicallyAllocated) {</div> |
| <div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>  destroy(block);</div> |
| <div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>  this->parent->add_block_to_free_list(block);</div> |
| <div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>  }</div> |
| <div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>  block = nextBlock;</div> |
| <div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>  } <span class="keywordflow">while</span> (block != this->tailBlock);</div> |
| <div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>  }</div> |
| <div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>  </div> |
| <div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>  <span class="comment">// Destroy the block indices</span></div> |
| <div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>  <span class="keyword">auto</span> header = <span class="keyword">static_cast<</span>BlockIndexHeader *<span class="keyword">></span>(pr_blockIndexRaw);</div> |
| <div class="line"><a name="l01790"></a><span class="lineno"> 1790</span>  <span class="keywordflow">while</span> (header != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>  <span class="keyword">auto</span> prev = <span class="keyword">static_cast<</span>BlockIndexHeader *<span class="keyword">></span>(header->prev);</div> |
| <div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>  header->~BlockIndexHeader();</div> |
| <div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>  (Traits::free)(header);</div> |
| <div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>  header = prev;</div> |
| <div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>  }</div> |
| <div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>  }</div> |
| <div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>  </div> |
| <div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>  <span class="keyword">template</span><AllocationMode allocMode, <span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(U &&element) {</div> |
| <div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> currentTailIndex = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> newTailIndex = 1 + currentTailIndex;</div> |
| <div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>  <span class="keywordflow">if</span> ((currentTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0) {</div> |
| <div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>  <span class="comment">// We reached the end of a block, start a new one</span></div> |
| <div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>  <span class="keyword">auto</span> startBlock = this->tailBlock;</div> |
| <div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>  <span class="keyword">auto</span> originalBlockIndexSlotsUsed = pr_blockIndexSlotsUsed;</div> |
| <div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>  <span class="keywordflow">if</span> (this->tailBlock != <span class="keyword">nullptr</span> &&</div> |
| <div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>  this->tailBlock->next->template is_empty<explicit_context>()) {</div> |
| <div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>  <span class="comment">// We can re-use the block ahead of us, it's empty!</span></div> |
| <div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>  this->tailBlock = this->tailBlock->next;</div> |
| <div class="line"><a name="l01810"></a><span class="lineno"> 1810</span>  this->tailBlock->template reset_empty<explicit_context>();</div> |
| <div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>  </div> |
| <div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>  <span class="comment">// We'll put the block on the block index (guaranteed to be room since we're conceptually removing the</span></div> |
| <div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>  <span class="comment">// last block from it first -- except instead of removing then adding, we can just overwrite).</span></div> |
| <div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>  <span class="comment">// Note that there must be a valid block index here, since even if allocation failed in the ctor,</span></div> |
| <div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>  <span class="comment">// it would have been re-attempted when adding the first block to the queue; since there is such</span></div> |
| <div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>  <span class="comment">// a block, a block index must have been successfully allocated.</span></div> |
| <div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>  <span class="comment">// Whatever head value we see here is >= the last value we saw here (relatively),</span></div> |
| <div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>  <span class="comment">// and <= its current value. Since we have the most recent tail, the head must be</span></div> |
| <div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>  <span class="comment">// <= to it.</span></div> |
| <div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>  <span class="keyword">auto</span> head = this->headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>  assert(!details::circular_less_than<index_t>(currentTailIndex, head));</div> |
| <div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>  <span class="keywordflow">if</span> (!details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE)</div> |
| <div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>  || (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&</div> |
| <div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>  (MAX_SUBQUEUE_SIZE == 0 ||</div> |
| <div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>  MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head))) {</div> |
| <div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>  <span class="comment">// We can't enqueue in another block because there's not enough leeway -- the</span></div> |
| <div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>  <span class="comment">// tail could surpass the head by the time the block fills up! (Or we'll exceed</span></div> |
| <div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>  <span class="comment">// the size limit, if the second part of the condition was true.)</span></div> |
| <div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>  }</div> |
| <div class="line"><a name="l01832"></a><span class="lineno"> 1832</span>  <span class="comment">// We're going to need a new block; check that the block index has room</span></div> |
| <div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>  <span class="keywordflow">if</span> (pr_blockIndexRaw == <span class="keyword">nullptr</span> || pr_blockIndexSlotsUsed == pr_blockIndexSize) {</div> |
| <div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>  <span class="comment">// Hmm, the circular block index is already full -- we'll need</span></div> |
| <div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>  <span class="comment">// to allocate a new index. Note pr_blockIndexRaw can only be nullptr if</span></div> |
| <div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>  <span class="comment">// the initial allocation failed in the constructor.</span></div> |
| <div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>  </div> |
| <div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>  <span class="keywordflow">if</span> (allocMode == CannotAlloc || !new_block_index(pr_blockIndexSlotsUsed)) {</div> |
| <div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>  }</div> |
| <div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>  }</div> |
| <div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>  </div> |
| <div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>  <span class="comment">// Insert a new block in the circular linked list</span></div> |
| <div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>  <span class="keyword">auto</span> newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();</div> |
| <div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>  <span class="keywordflow">if</span> (newBlock == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>  }</div> |
| <div class="line"><a name="l01848"></a><span class="lineno"> 1848</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>  newBlock->owner = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l01850"></a><span class="lineno"> 1850</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>  newBlock->template reset_empty<explicit_context>();</div> |
| <div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>  <span class="keywordflow">if</span> (this->tailBlock == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>  newBlock->next = newBlock;</div> |
| <div class="line"><a name="l01854"></a><span class="lineno"> 1854</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>  newBlock->next = this->tailBlock->next;</div> |
| <div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>  this->tailBlock->next = newBlock;</div> |
| <div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>  }</div> |
| <div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>  this->tailBlock = newBlock;</div> |
| <div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>  ++pr_blockIndexSlotsUsed;</div> |
| <div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>  }</div> |
| <div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>  </div> |
| <div class="line"><a name="l01862"></a><span class="lineno"> 1862</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(std::forward<U>(element)))) {</div> |
| <div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>  <span class="comment">// The constructor may throw. We want the element not to appear in the queue in</span></div> |
| <div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>  <span class="comment">// that case (without corrupting the queue):</span></div> |
| <div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>  MOODYCAMEL_TRY {</div> |
| <div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex]) T(std::forward<U>(element));</div> |
| <div class="line"><a name="l01867"></a><span class="lineno"> 1867</span>  }</div> |
| <div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>  MOODYCAMEL_CATCH (...) {</div> |
| <div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>  <span class="comment">// Revert change to the current block, but leave the new block available</span></div> |
| <div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>  <span class="comment">// for next time</span></div> |
| <div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>  pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;</div> |
| <div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>  this->tailBlock = startBlock == <span class="keyword">nullptr</span> ? this->tailBlock : startBlock;</div> |
| <div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>  MOODYCAMEL_RETHROW;</div> |
| <div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>  }</div> |
| <div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>  (void) startBlock;</div> |
| <div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>  (void) originalBlockIndexSlotsUsed;</div> |
| <div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>  }</div> |
| <div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>  </div> |
| <div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>  <span class="comment">// Add block to block index</span></div> |
| <div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>  <span class="keyword">auto</span> &entry = blockIndex.load(std::memory_order_relaxed)->entries[pr_blockIndexFront];</div> |
| <div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>  entry.base = currentTailIndex;</div> |
| <div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>  entry.block = this->tailBlock;</div> |
| <div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>  blockIndex.load(std::memory_order_relaxed)->front.store(pr_blockIndexFront,</div> |
| <div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>  std::memory_order_release);</div> |
| <div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>  pr_blockIndexFront = (pr_blockIndexFront + 1) & (pr_blockIndexSize - 1);</div> |
| <div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>  </div> |
| <div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(std::forward<U>(element)))) {</div> |
| <div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>  this->tailIndex.store(newTailIndex, std::memory_order_release);</div> |
| <div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>  }</div> |
| <div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>  }</div> |
| <div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>  </div> |
| <div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>  <span class="comment">// Enqueue</span></div> |
| <div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex]) T(std::forward<U>(element));</div> |
| <div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>  </div> |
| <div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>  this->tailIndex.store(newTailIndex, std::memory_order_release);</div> |
| <div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>  }</div> |
| <div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>  </div> |
| <div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>  <span class="keywordtype">bool</span> dequeue(U &element) {</div> |
| <div class="line"><a name="l01903"></a><span class="lineno"> 1903</span>  <span class="keyword">auto</span> tail = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>  <span class="keyword">auto</span> overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>  <span class="keywordflow">if</span> (details::circular_less_than<index_t>(</div> |
| <div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>  this->dequeueOptimisticCount.load(std::memory_order_relaxed) - overcommit, tail)) {</div> |
| <div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>  <span class="comment">// Might be something to dequeue, let's give it a try</span></div> |
| <div class="line"><a name="l01908"></a><span class="lineno"> 1908</span>  </div> |
| <div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>  <span class="comment">// Note that this if is purely for performance purposes in the common case when the queue is</span></div> |
| <div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>  <span class="comment">// empty and the values are eventually consistent -- we may enter here spuriously.</span></div> |
| <div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>  </div> |
| <div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>  <span class="comment">// Note that whatever the values of overcommit and tail are, they are not going to change (unless we</span></div> |
| <div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>  <span class="comment">// change them) and must be the same value at this point (inside the if) as when the if condition was</span></div> |
| <div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>  <span class="comment">// evaluated.</span></div> |
| <div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>  </div> |
| <div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>  <span class="comment">// We insert an acquire fence here to synchronize-with the release upon incrementing dequeueOvercommit below.</span></div> |
| <div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>  <span class="comment">// This ensures that whatever the value we got loaded into overcommit, the load of dequeueOptisticCount in</span></div> |
| <div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>  <span class="comment">// the fetch_add below will result in a value at least as recent as that (and therefore at least as large).</span></div> |
| <div class="line"><a name="l01919"></a><span class="lineno"> 1919</span>  <span class="comment">// Note that I believe a compiler (signal) fence here would be sufficient due to the nature of fetch_add (all</span></div> |
| <div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>  <span class="comment">// read-modify-write operations are guaranteed to work on the latest value in the modification order), but</span></div> |
| <div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>  <span class="comment">// unfortunately that can't be shown to be correct using only the C++11 standard.</span></div> |
| <div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>  <span class="comment">// See http://stackoverflow.com/questions/18223161/what-are-the-c11-memory-ordering-guarantees-in-this-corner-case</span></div> |
| <div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>  std::atomic_thread_fence(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01924"></a><span class="lineno"> 1924</span>  </div> |
| <div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>  <span class="comment">// Increment optimistic counter, then check if it went over the boundary</span></div> |
| <div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>  <span class="keyword">auto</span> myDequeueCount = this->dequeueOptimisticCount.fetch_add(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>  </div> |
| <div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>  <span class="comment">// Note that since dequeueOvercommit must be <= dequeueOptimisticCount (because dequeueOvercommit is only ever</span></div> |
| <div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>  <span class="comment">// incremented after dequeueOptimisticCount -- this is enforced in the `else` block below), and since we now</span></div> |
| <div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>  <span class="comment">// have a version of dequeueOptimisticCount that is at least as recent as overcommit (due to the release upon</span></div> |
| <div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>  <span class="comment">// incrementing dequeueOvercommit and the acquire above that synchronizes with it), overcommit <= myDequeueCount.</span></div> |
| <div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>  assert(overcommit <= myDequeueCount);</div> |
| <div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>  </div> |
| <div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>  <span class="comment">// Note that we reload tail here in case it changed; it will be the same value as before or greater, since</span></div> |
| <div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>  <span class="comment">// this load is sequenced after (happens after) the earlier load above. This is supported by read-read</span></div> |
| <div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>  <span class="comment">// coherency (as defined in the standard), explained here: http://en.cppreference.com/w/cpp/atomic/memory_order</span></div> |
| <div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>  tail = this->tailIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>  <span class="keywordflow">if</span> (details::likely(</div> |
| <div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>  details::circular_less_than<index_t>(myDequeueCount - overcommit, tail))) {</div> |
| <div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>  <span class="comment">// Guaranteed to be at least one element to dequeue!</span></div> |
| <div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>  </div> |
| <div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>  <span class="comment">// Get the index. Note that since there's guaranteed to be at least one element, this</span></div> |
| <div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>  <span class="comment">// will never exceed tail. We need to do an acquire-release fence here since it's possible</span></div> |
| <div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>  <span class="comment">// that whatever condition got us to this point was for an earlier enqueued element (that</span></div> |
| <div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>  <span class="comment">// we already see the memory effects for), but that by the time we increment somebody else</span></div> |
| <div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>  <span class="comment">// has incremented it, and we need to see the memory effects for *that* element, which is</span></div> |
| <div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>  <span class="comment">// in such a case is necessarily visible on the thread that incremented it in the first</span></div> |
| <div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>  <span class="comment">// place with the more current condition (they must have acquired a tail that is at least</span></div> |
| <div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>  <span class="comment">// as recent).</span></div> |
| <div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>  <span class="keyword">auto</span> index = this->headIndex.fetch_add(1, std::memory_order_acq_rel);</div> |
| <div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>  </div> |
| <div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>  </div> |
| <div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>  <span class="comment">// Determine which block the element is in</span></div> |
| <div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>  </div> |
| <div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>  <span class="keyword">auto</span> localBlockIndex = blockIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>  <span class="keyword">auto</span> localBlockIndexHead = localBlockIndex->front.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>  </div> |
| <div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>  <span class="comment">// We need to be careful here about subtracting and dividing because of index wrap-around.</span></div> |
| <div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>  <span class="comment">// When an index wraps, we need to preserve the sign of the offset when dividing it by the</span></div> |
| <div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>  <span class="comment">// block size (in order to get a correct signed block count offset in all cases):</span></div> |
| <div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>  <span class="keyword">auto</span> headBase = localBlockIndex->entries[localBlockIndexHead].base;</div> |
| <div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>  <span class="keyword">auto</span> blockBaseIndex = index & ~static_cast<index_t>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>  <span class="keyword">auto</span> offset = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(</div> |
| <div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>  <span class="keyword">static_cast<</span>typename std::make_signed<index_t>::type<span class="keyword">></span>(blockBaseIndex - headBase) /</div> |
| <div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>  BLOCK_SIZE);</div> |
| <div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>  <span class="keyword">auto</span> block = localBlockIndex->entries[(localBlockIndexHead + offset) &</div> |
| <div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>  (localBlockIndex->size - 1)].block;</div> |
| <div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>  </div> |
| <div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>  <span class="comment">// Dequeue</span></div> |
| <div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>  <span class="keyword">auto</span> &el = *((*block)[index]);</div> |
| <div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_ASSIGN(T, T &&, element = std::move(el))) {</div> |
| <div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>  <span class="comment">// Make sure the element is still fully dequeued and destroyed even if the assignment</span></div> |
| <div class="line"><a name="l01973"></a><span class="lineno"> 1973</span>  <span class="comment">// throws</span></div> |
| <div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>  <span class="keyword">struct </span>Guard {</div> |
| <div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>  Block *block;</div> |
| <div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> index;</div> |
| <div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>  </div> |
| <div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>  ~Guard() {</div> |
| <div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>  (*block)[index]->~T();</div> |
| <div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>  block->template set_empty<explicit_context>(index);</div> |
| <div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>  }</div> |
| <div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>  } guard = {block, index};</div> |
| <div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>  </div> |
| <div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>  element = std::move(el);</div> |
| <div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>  element = std::move(el);</div> |
| <div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>  el.~T();</div> |
| <div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>  block->template set_empty<explicit_context>(index);</div> |
| <div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>  }</div> |
| <div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>  </div> |
| <div class="line"><a name="l01991"></a><span class="lineno"> 1991</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>  <span class="comment">// Wasn't anything to dequeue after all; make the effective dequeue count eventually consistent</span></div> |
| <div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>  this->dequeueOvercommit.fetch_add(1,</div> |
| <div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>  std::memory_order_release); <span class="comment">// Release so that the fetch_add on dequeueOptimisticCount is guaranteed to happen before this write</span></div> |
| <div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>  }</div> |
| <div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>  }</div> |
| <div class="line"><a name="l01998"></a><span class="lineno"> 1998</span>  </div> |
| <div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>  }</div> |
| <div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>  </div> |
| <div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>  <span class="keyword">template</span><AllocationMode allocMode, <span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l02003"></a><span class="lineno"> 2003</span>  <span class="keywordtype">bool</span> enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>  <span class="comment">// First, we need to make sure we have enough room to enqueue all of the elements;</span></div> |
| <div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>  <span class="comment">// this means pre-allocating blocks and putting them in the block index (but only if</span></div> |
| <div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>  <span class="comment">// all the allocations succeeded).</span></div> |
| <div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> startTailIndex = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>  <span class="keyword">auto</span> startBlock = this->tailBlock;</div> |
| <div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>  <span class="keyword">auto</span> originalBlockIndexFront = pr_blockIndexFront;</div> |
| <div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>  <span class="keyword">auto</span> originalBlockIndexSlotsUsed = pr_blockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>  </div> |
| <div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>  Block *firstAllocatedBlock = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>  </div> |
| <div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>  <span class="comment">// Figure out how many blocks we'll need to allocate, and do so</span></div> |
| <div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>  <span class="keywordtype">size_t</span> blockBaseDiff =</div> |
| <div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>  ((startTailIndex + count - 1) & ~<span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) -</div> |
| <div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>  ((startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1));</div> |
| <div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> currentTailIndex = (startTailIndex - 1) & ~<span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>  <span class="keywordflow">if</span> (blockBaseDiff > 0) {</div> |
| <div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>  <span class="comment">// Allocate as many blocks as possible from ahead</span></div> |
| <div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>  <span class="keywordflow">while</span> (blockBaseDiff > 0 && this->tailBlock != <span class="keyword">nullptr</span> &&</div> |
| <div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>  this->tailBlock->next != firstAllocatedBlock &&</div> |
| <div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>  this->tailBlock->next->template is_empty<explicit_context>()) {</div> |
| <div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>  blockBaseDiff -= <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>  currentTailIndex += <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>  </div> |
| <div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>  this->tailBlock = this->tailBlock->next;</div> |
| <div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>  firstAllocatedBlock =</div> |
| <div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>  firstAllocatedBlock == <span class="keyword">nullptr</span> ? this->tailBlock : firstAllocatedBlock;</div> |
| <div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>  </div> |
| <div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>  <span class="keyword">auto</span> &entry = blockIndex.load(std::memory_order_relaxed)->entries[pr_blockIndexFront];</div> |
| <div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>  entry.base = currentTailIndex;</div> |
| <div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>  entry.block = this->tailBlock;</div> |
| <div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>  pr_blockIndexFront = (pr_blockIndexFront + 1) & (pr_blockIndexSize - 1);</div> |
| <div class="line"><a name="l02035"></a><span class="lineno"> 2035</span>  }</div> |
| <div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>  </div> |
| <div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>  <span class="comment">// Now allocate as many blocks as necessary from the block pool</span></div> |
| <div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>  <span class="keywordflow">while</span> (blockBaseDiff > 0) {</div> |
| <div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>  blockBaseDiff -= <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02040"></a><span class="lineno"> 2040</span>  currentTailIndex += <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>  </div> |
| <div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>  <span class="keyword">auto</span> head = this->headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>  assert(!details::circular_less_than<index_t>(currentTailIndex, head));</div> |
| <div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>  <span class="keywordtype">bool</span> full = !details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||</div> |
| <div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>  (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&</div> |
| <div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>  (MAX_SUBQUEUE_SIZE == 0 ||</div> |
| <div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>  MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head));</div> |
| <div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>  <span class="keywordflow">if</span> (pr_blockIndexRaw == <span class="keyword">nullptr</span> || pr_blockIndexSlotsUsed == pr_blockIndexSize || full) {</div> |
| <div class="line"><a name="l02049"></a><span class="lineno"> 2049</span>  <span class="keywordflow">if</span> (allocMode == CannotAlloc || full || !new_block_index(originalBlockIndexSlotsUsed)) {</div> |
| <div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>  <span class="comment">// Failed to allocate, undo changes (but keep injected blocks)</span></div> |
| <div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>  pr_blockIndexFront = originalBlockIndexFront;</div> |
| <div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>  pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>  this->tailBlock = startBlock == <span class="keyword">nullptr</span> ? firstAllocatedBlock : startBlock;</div> |
| <div class="line"><a name="l02054"></a><span class="lineno"> 2054</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>  }</div> |
| <div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>  </div> |
| <div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>  <span class="comment">// pr_blockIndexFront is updated inside new_block_index, so we need to</span></div> |
| <div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>  <span class="comment">// update our fallback value too (since we keep the new index even if we</span></div> |
| <div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>  <span class="comment">// later fail)</span></div> |
| <div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>  originalBlockIndexFront = originalBlockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>  }</div> |
| <div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>  </div> |
| <div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>  <span class="comment">// Insert a new block in the circular linked list</span></div> |
| <div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>  <span class="keyword">auto</span> newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();</div> |
| <div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>  <span class="keywordflow">if</span> (newBlock == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>  pr_blockIndexFront = originalBlockIndexFront;</div> |
| <div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>  pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>  this->tailBlock = startBlock == <span class="keyword">nullptr</span> ? firstAllocatedBlock : startBlock;</div> |
| <div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>  }</div> |
| <div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>  </div> |
| <div class="line"><a name="l02072"></a><span class="lineno"> 2072</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>  newBlock->owner = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l02074"></a><span class="lineno"> 2074</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>  newBlock->template set_all_empty<explicit_context>();</div> |
| <div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>  <span class="keywordflow">if</span> (this->tailBlock == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>  newBlock->next = newBlock;</div> |
| <div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>  newBlock->next = this->tailBlock->next;</div> |
| <div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>  this->tailBlock->next = newBlock;</div> |
| <div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>  }</div> |
| <div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>  this->tailBlock = newBlock;</div> |
| <div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>  firstAllocatedBlock =</div> |
| <div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>  firstAllocatedBlock == <span class="keyword">nullptr</span> ? this->tailBlock : firstAllocatedBlock;</div> |
| <div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>  </div> |
| <div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>  ++pr_blockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>  </div> |
| <div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>  <span class="keyword">auto</span> &entry = blockIndex.load(std::memory_order_relaxed)->entries[pr_blockIndexFront];</div> |
| <div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>  entry.base = currentTailIndex;</div> |
| <div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>  entry.block = this->tailBlock;</div> |
| <div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>  pr_blockIndexFront = (pr_blockIndexFront + 1) & (pr_blockIndexSize - 1);</div> |
| <div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>  }</div> |
| <div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>  </div> |
| <div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>  <span class="comment">// Excellent, all allocations succeeded. Reset each block's emptiness before we fill them up, and</span></div> |
| <div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>  <span class="comment">// publish the new block index front</span></div> |
| <div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>  <span class="keyword">auto</span> block = firstAllocatedBlock;</div> |
| <div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>  block->template reset_empty<explicit_context>();</div> |
| <div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>  <span class="keywordflow">if</span> (block == this->tailBlock) {</div> |
| <div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>  }</div> |
| <div class="line"><a name="l02102"></a><span class="lineno"> 2102</span>  block = block->next;</div> |
| <div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>  }</div> |
| <div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>  </div> |
| <div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>  <span class="keywordflow">if</span> (MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst),</div> |
| <div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>  <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(details::deref_noexcept(itemFirst)))) {</div> |
| <div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>  blockIndex.load(std::memory_order_relaxed)->front.store(</div> |
| <div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>  (pr_blockIndexFront - 1) & (pr_blockIndexSize - 1), std::memory_order_release);</div> |
| <div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>  }</div> |
| <div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>  }</div> |
| <div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>  </div> |
| <div class="line"><a name="l02112"></a><span class="lineno"> 2112</span>  <span class="comment">// Enqueue, one block at a time</span></div> |
| <div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> newTailIndex = startTailIndex + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(count);</div> |
| <div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>  currentTailIndex = startTailIndex;</div> |
| <div class="line"><a name="l02115"></a><span class="lineno"> 2115</span>  <span class="keyword">auto</span> endBlock = this->tailBlock;</div> |
| <div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>  this->tailBlock = startBlock;</div> |
| <div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>  assert((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) != 0 ||</div> |
| <div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>  firstAllocatedBlock != <span class="keyword">nullptr</span> || count == 0);</div> |
| <div class="line"><a name="l02119"></a><span class="lineno"> 2119</span>  <span class="keywordflow">if</span> ((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0 &&</div> |
| <div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>  firstAllocatedBlock != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>  this->tailBlock = firstAllocatedBlock;</div> |
| <div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>  }</div> |
| <div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>  <span class="keyword">auto</span> stopIndex = (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) +</div> |
| <div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02126"></a><span class="lineno"> 2126</span>  <span class="keywordflow">if</span> (details::circular_less_than<index_t>(newTailIndex, stopIndex)) {</div> |
| <div class="line"><a name="l02127"></a><span class="lineno"> 2127</span>  stopIndex = newTailIndex;</div> |
| <div class="line"><a name="l02128"></a><span class="lineno"> 2128</span>  }</div> |
| <div class="line"><a name="l02129"></a><span class="lineno"> 2129</span>  <span class="keywordflow">if</span> (MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst),</div> |
| <div class="line"><a name="l02130"></a><span class="lineno"> 2130</span>  <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(details::deref_noexcept(itemFirst)))) {</div> |
| <div class="line"><a name="l02131"></a><span class="lineno"> 2131</span>  <span class="keywordflow">while</span> (currentTailIndex != stopIndex) {</div> |
| <div class="line"><a name="l02132"></a><span class="lineno"> 2132</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex++]) T(*itemFirst++);</div> |
| <div class="line"><a name="l02133"></a><span class="lineno"> 2133</span>  }</div> |
| <div class="line"><a name="l02134"></a><span class="lineno"> 2134</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02135"></a><span class="lineno"> 2135</span>  MOODYCAMEL_TRY {</div> |
| <div class="line"><a name="l02136"></a><span class="lineno"> 2136</span>  <span class="keywordflow">while</span> (currentTailIndex != stopIndex) {</div> |
| <div class="line"><a name="l02137"></a><span class="lineno"> 2137</span>  <span class="comment">// Must use copy constructor even if move constructor is available</span></div> |
| <div class="line"><a name="l02138"></a><span class="lineno"> 2138</span>  <span class="comment">// because we may have to revert if there's an exception.</span></div> |
| <div class="line"><a name="l02139"></a><span class="lineno"> 2139</span>  <span class="comment">// Sorry about the horrible templated next line, but it was the only way</span></div> |
| <div class="line"><a name="l02140"></a><span class="lineno"> 2140</span>  <span class="comment">// to disable moving *at compile time*, which is important because a type</span></div> |
| <div class="line"><a name="l02141"></a><span class="lineno"> 2141</span>  <span class="comment">// may only define a (noexcept) move constructor, and so calls to the</span></div> |
| <div class="line"><a name="l02142"></a><span class="lineno"> 2142</span>  <span class="comment">// cctor will not compile, even if they are in an if branch that will never</span></div> |
| <div class="line"><a name="l02143"></a><span class="lineno"> 2143</span>  <span class="comment">// be executed</span></div> |
| <div class="line"><a name="l02144"></a><span class="lineno"> 2144</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex]) T(</div> |
| <div class="line"><a name="l02145"></a><span class="lineno"> 2145</span>  details::nomove_if<(<span class="keywordtype">bool</span>) !MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst),</div> |
| <div class="line"><a name="l02146"></a><span class="lineno"> 2146</span>  <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(</div> |
| <div class="line"><a name="l02147"></a><span class="lineno"> 2147</span>  details::deref_noexcept(</div> |
| <div class="line"><a name="l02148"></a><span class="lineno"> 2148</span>  itemFirst)))>::eval(</div> |
| <div class="line"><a name="l02149"></a><span class="lineno"> 2149</span>  *itemFirst));</div> |
| <div class="line"><a name="l02150"></a><span class="lineno"> 2150</span>  ++currentTailIndex;</div> |
| <div class="line"><a name="l02151"></a><span class="lineno"> 2151</span>  ++itemFirst;</div> |
| <div class="line"><a name="l02152"></a><span class="lineno"> 2152</span>  }</div> |
| <div class="line"><a name="l02153"></a><span class="lineno"> 2153</span>  }</div> |
| <div class="line"><a name="l02154"></a><span class="lineno"> 2154</span>  MOODYCAMEL_CATCH (...) {</div> |
| <div class="line"><a name="l02155"></a><span class="lineno"> 2155</span>  <span class="comment">// Oh dear, an exception's been thrown -- destroy the elements that</span></div> |
| <div class="line"><a name="l02156"></a><span class="lineno"> 2156</span>  <span class="comment">// were enqueued so far and revert the entire bulk operation (we'll keep</span></div> |
| <div class="line"><a name="l02157"></a><span class="lineno"> 2157</span>  <span class="comment">// any allocated blocks in our linked list for later, though).</span></div> |
| <div class="line"><a name="l02158"></a><span class="lineno"> 2158</span>  <span class="keyword">auto</span> constructedStopIndex = currentTailIndex;</div> |
| <div class="line"><a name="l02159"></a><span class="lineno"> 2159</span>  <span class="keyword">auto</span> lastBlockEnqueued = this->tailBlock;</div> |
| <div class="line"><a name="l02160"></a><span class="lineno"> 2160</span>  </div> |
| <div class="line"><a name="l02161"></a><span class="lineno"> 2161</span>  pr_blockIndexFront = originalBlockIndexFront;</div> |
| <div class="line"><a name="l02162"></a><span class="lineno"> 2162</span>  pr_blockIndexSlotsUsed = originalBlockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02163"></a><span class="lineno"> 2163</span>  this->tailBlock = startBlock == <span class="keyword">nullptr</span> ? firstAllocatedBlock : startBlock;</div> |
| <div class="line"><a name="l02164"></a><span class="lineno"> 2164</span>  </div> |
| <div class="line"><a name="l02165"></a><span class="lineno"> 2165</span>  <span class="keywordflow">if</span> (!details::is_trivially_destructible<T>::value) {</div> |
| <div class="line"><a name="l02166"></a><span class="lineno"> 2166</span>  <span class="keyword">auto</span> block = startBlock;</div> |
| <div class="line"><a name="l02167"></a><span class="lineno"> 2167</span>  <span class="keywordflow">if</span> ((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0) {</div> |
| <div class="line"><a name="l02168"></a><span class="lineno"> 2168</span>  block = firstAllocatedBlock;</div> |
| <div class="line"><a name="l02169"></a><span class="lineno"> 2169</span>  }</div> |
| <div class="line"><a name="l02170"></a><span class="lineno"> 2170</span>  currentTailIndex = startTailIndex;</div> |
| <div class="line"><a name="l02171"></a><span class="lineno"> 2171</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l02172"></a><span class="lineno"> 2172</span>  stopIndex = (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) +</div> |
| <div class="line"><a name="l02173"></a><span class="lineno"> 2173</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02174"></a><span class="lineno"> 2174</span>  <span class="keywordflow">if</span> (details::circular_less_than<index_t>(constructedStopIndex, stopIndex)) {</div> |
| <div class="line"><a name="l02175"></a><span class="lineno"> 2175</span>  stopIndex = constructedStopIndex;</div> |
| <div class="line"><a name="l02176"></a><span class="lineno"> 2176</span>  }</div> |
| <div class="line"><a name="l02177"></a><span class="lineno"> 2177</span>  <span class="keywordflow">while</span> (currentTailIndex != stopIndex) {</div> |
| <div class="line"><a name="l02178"></a><span class="lineno"> 2178</span>  (*block)[currentTailIndex++]->~T();</div> |
| <div class="line"><a name="l02179"></a><span class="lineno"> 2179</span>  }</div> |
| <div class="line"><a name="l02180"></a><span class="lineno"> 2180</span>  <span class="keywordflow">if</span> (block == lastBlockEnqueued) {</div> |
| <div class="line"><a name="l02181"></a><span class="lineno"> 2181</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l02182"></a><span class="lineno"> 2182</span>  }</div> |
| <div class="line"><a name="l02183"></a><span class="lineno"> 2183</span>  block = block->next;</div> |
| <div class="line"><a name="l02184"></a><span class="lineno"> 2184</span>  }</div> |
| <div class="line"><a name="l02185"></a><span class="lineno"> 2185</span>  }</div> |
| <div class="line"><a name="l02186"></a><span class="lineno"> 2186</span>  MOODYCAMEL_RETHROW;</div> |
| <div class="line"><a name="l02187"></a><span class="lineno"> 2187</span>  }</div> |
| <div class="line"><a name="l02188"></a><span class="lineno"> 2188</span>  }</div> |
| <div class="line"><a name="l02189"></a><span class="lineno"> 2189</span>  </div> |
| <div class="line"><a name="l02190"></a><span class="lineno"> 2190</span>  <span class="keywordflow">if</span> (this->tailBlock == endBlock) {</div> |
| <div class="line"><a name="l02191"></a><span class="lineno"> 2191</span>  assert(currentTailIndex == newTailIndex);</div> |
| <div class="line"><a name="l02192"></a><span class="lineno"> 2192</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l02193"></a><span class="lineno"> 2193</span>  }</div> |
| <div class="line"><a name="l02194"></a><span class="lineno"> 2194</span>  this->tailBlock = this->tailBlock->next;</div> |
| <div class="line"><a name="l02195"></a><span class="lineno"> 2195</span>  }</div> |
| <div class="line"><a name="l02196"></a><span class="lineno"> 2196</span>  </div> |
| <div class="line"><a name="l02197"></a><span class="lineno"> 2197</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst),</div> |
| <div class="line"><a name="l02198"></a><span class="lineno"> 2198</span>  <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(details::deref_noexcept(itemFirst))) &&</div> |
| <div class="line"><a name="l02199"></a><span class="lineno"> 2199</span>  firstAllocatedBlock != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02200"></a><span class="lineno"> 2200</span>  blockIndex.load(std::memory_order_relaxed)->front.store(</div> |
| <div class="line"><a name="l02201"></a><span class="lineno"> 2201</span>  (pr_blockIndexFront - 1) & (pr_blockIndexSize - 1), std::memory_order_release);</div> |
| <div class="line"><a name="l02202"></a><span class="lineno"> 2202</span>  }</div> |
| <div class="line"><a name="l02203"></a><span class="lineno"> 2203</span>  </div> |
| <div class="line"><a name="l02204"></a><span class="lineno"> 2204</span>  this->tailIndex.store(newTailIndex, std::memory_order_release);</div> |
| <div class="line"><a name="l02205"></a><span class="lineno"> 2205</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02206"></a><span class="lineno"> 2206</span>  }</div> |
| <div class="line"><a name="l02207"></a><span class="lineno"> 2207</span>  </div> |
| <div class="line"><a name="l02208"></a><span class="lineno"> 2208</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l02209"></a><span class="lineno"> 2209</span>  <span class="keywordtype">size_t</span> dequeue_bulk(It &itemFirst, <span class="keywordtype">size_t</span> max) {</div> |
| <div class="line"><a name="l02210"></a><span class="lineno"> 2210</span>  <span class="keyword">auto</span> tail = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02211"></a><span class="lineno"> 2211</span>  <span class="keyword">auto</span> overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02212"></a><span class="lineno"> 2212</span>  <span class="keyword">auto</span> desiredCount = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(tail - (this->dequeueOptimisticCount.load(</div> |
| <div class="line"><a name="l02213"></a><span class="lineno"> 2213</span>  std::memory_order_relaxed) - overcommit));</div> |
| <div class="line"><a name="l02214"></a><span class="lineno"> 2214</span>  <span class="keywordflow">if</span> (details::circular_less_than<size_t>(0, desiredCount)) {</div> |
| <div class="line"><a name="l02215"></a><span class="lineno"> 2215</span>  desiredCount = desiredCount < max ? desiredCount : max;</div> |
| <div class="line"><a name="l02216"></a><span class="lineno"> 2216</span>  std::atomic_thread_fence(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02217"></a><span class="lineno"> 2217</span>  </div> |
| <div class="line"><a name="l02218"></a><span class="lineno"> 2218</span>  <span class="keyword">auto</span> myDequeueCount = this->dequeueOptimisticCount.fetch_add(desiredCount,</div> |
| <div class="line"><a name="l02219"></a><span class="lineno"> 2219</span>  std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02220"></a><span class="lineno"> 2220</span>  assert(overcommit <= myDequeueCount);</div> |
| <div class="line"><a name="l02221"></a><span class="lineno"> 2221</span>  </div> |
| <div class="line"><a name="l02222"></a><span class="lineno"> 2222</span>  tail = this->tailIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02223"></a><span class="lineno"> 2223</span>  <span class="keyword">auto</span> actualCount = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(tail - (myDequeueCount - overcommit));</div> |
| <div class="line"><a name="l02224"></a><span class="lineno"> 2224</span>  <span class="keywordflow">if</span> (details::circular_less_than<size_t>(0, actualCount)) {</div> |
| <div class="line"><a name="l02225"></a><span class="lineno"> 2225</span>  actualCount = desiredCount < actualCount ? desiredCount : actualCount;</div> |
| <div class="line"><a name="l02226"></a><span class="lineno"> 2226</span>  <span class="keywordflow">if</span> (actualCount < desiredCount) {</div> |
| <div class="line"><a name="l02227"></a><span class="lineno"> 2227</span>  this->dequeueOvercommit.fetch_add(desiredCount - actualCount,</div> |
| <div class="line"><a name="l02228"></a><span class="lineno"> 2228</span>  std::memory_order_release);</div> |
| <div class="line"><a name="l02229"></a><span class="lineno"> 2229</span>  }</div> |
| <div class="line"><a name="l02230"></a><span class="lineno"> 2230</span>  </div> |
| <div class="line"><a name="l02231"></a><span class="lineno"> 2231</span>  <span class="comment">// Get the first index. Note that since there's guaranteed to be at least actualCount elements, this</span></div> |
| <div class="line"><a name="l02232"></a><span class="lineno"> 2232</span>  <span class="comment">// will never exceed tail.</span></div> |
| <div class="line"><a name="l02233"></a><span class="lineno"> 2233</span>  <span class="keyword">auto</span> firstIndex = this->headIndex.fetch_add(actualCount, std::memory_order_acq_rel);</div> |
| <div class="line"><a name="l02234"></a><span class="lineno"> 2234</span>  </div> |
| <div class="line"><a name="l02235"></a><span class="lineno"> 2235</span>  <span class="comment">// Determine which block the first element is in</span></div> |
| <div class="line"><a name="l02236"></a><span class="lineno"> 2236</span>  <span class="keyword">auto</span> localBlockIndex = blockIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02237"></a><span class="lineno"> 2237</span>  <span class="keyword">auto</span> localBlockIndexHead = localBlockIndex->front.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02238"></a><span class="lineno"> 2238</span>  </div> |
| <div class="line"><a name="l02239"></a><span class="lineno"> 2239</span>  <span class="keyword">auto</span> headBase = localBlockIndex->entries[localBlockIndexHead].base;</div> |
| <div class="line"><a name="l02240"></a><span class="lineno"> 2240</span>  <span class="keyword">auto</span> firstBlockBaseIndex = firstIndex & ~static_cast<index_t>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l02241"></a><span class="lineno"> 2241</span>  <span class="keyword">auto</span> offset = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(</div> |
| <div class="line"><a name="l02242"></a><span class="lineno"> 2242</span>  <span class="keyword">static_cast<</span>typename std::make_signed<index_t>::type<span class="keyword">></span>(firstBlockBaseIndex - headBase) /</div> |
| <div class="line"><a name="l02243"></a><span class="lineno"> 2243</span>  BLOCK_SIZE);</div> |
| <div class="line"><a name="l02244"></a><span class="lineno"> 2244</span>  <span class="keyword">auto</span> indexIndex = (localBlockIndexHead + offset) & (localBlockIndex->size - 1);</div> |
| <div class="line"><a name="l02245"></a><span class="lineno"> 2245</span>  </div> |
| <div class="line"><a name="l02246"></a><span class="lineno"> 2246</span>  <span class="comment">// Iterate the blocks and dequeue</span></div> |
| <div class="line"><a name="l02247"></a><span class="lineno"> 2247</span>  <span class="keyword">auto</span> index = firstIndex;</div> |
| <div class="line"><a name="l02248"></a><span class="lineno"> 2248</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02249"></a><span class="lineno"> 2249</span>  <span class="keyword">auto</span> firstIndexInBlock = index;</div> |
| <div class="line"><a name="l02250"></a><span class="lineno"> 2250</span>  <span class="keyword">auto</span> endIndex =</div> |
| <div class="line"><a name="l02251"></a><span class="lineno"> 2251</span>  (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02252"></a><span class="lineno"> 2252</span>  endIndex = details::circular_less_than<index_t>(</div> |
| <div class="line"><a name="l02253"></a><span class="lineno"> 2253</span>  firstIndex + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount), endIndex) ? firstIndex +</div> |
| <div class="line"><a name="l02254"></a><span class="lineno"> 2254</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount)</div> |
| <div class="line"><a name="l02255"></a><span class="lineno"> 2255</span>  : endIndex;</div> |
| <div class="line"><a name="l02256"></a><span class="lineno"> 2256</span>  <span class="keyword">auto</span> block = localBlockIndex->entries[indexIndex].block;</div> |
| <div class="line"><a name="l02257"></a><span class="lineno"> 2257</span>  <span class="keywordflow">if</span> (MOODYCAMEL_NOEXCEPT_ASSIGN(T, T &&, details::deref_noexcept(itemFirst) = std::move(</div> |
| <div class="line"><a name="l02258"></a><span class="lineno"> 2258</span>  (*(*block)[index])))) {</div> |
| <div class="line"><a name="l02259"></a><span class="lineno"> 2259</span>  <span class="keywordflow">while</span> (index != endIndex) {</div> |
| <div class="line"><a name="l02260"></a><span class="lineno"> 2260</span>  <span class="keyword">auto</span> &el = *((*block)[index]);</div> |
| <div class="line"><a name="l02261"></a><span class="lineno"> 2261</span>  *itemFirst++ = std::move(el);</div> |
| <div class="line"><a name="l02262"></a><span class="lineno"> 2262</span>  el.~T();</div> |
| <div class="line"><a name="l02263"></a><span class="lineno"> 2263</span>  ++index;</div> |
| <div class="line"><a name="l02264"></a><span class="lineno"> 2264</span>  }</div> |
| <div class="line"><a name="l02265"></a><span class="lineno"> 2265</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02266"></a><span class="lineno"> 2266</span>  MOODYCAMEL_TRY {</div> |
| <div class="line"><a name="l02267"></a><span class="lineno"> 2267</span>  <span class="keywordflow">while</span> (index != endIndex) {</div> |
| <div class="line"><a name="l02268"></a><span class="lineno"> 2268</span>  <span class="keyword">auto</span> &el = *((*block)[index]);</div> |
| <div class="line"><a name="l02269"></a><span class="lineno"> 2269</span>  *itemFirst = std::move(el);</div> |
| <div class="line"><a name="l02270"></a><span class="lineno"> 2270</span>  ++itemFirst;</div> |
| <div class="line"><a name="l02271"></a><span class="lineno"> 2271</span>  el.~T();</div> |
| <div class="line"><a name="l02272"></a><span class="lineno"> 2272</span>  ++index;</div> |
| <div class="line"><a name="l02273"></a><span class="lineno"> 2273</span>  }</div> |
| <div class="line"><a name="l02274"></a><span class="lineno"> 2274</span>  }</div> |
| <div class="line"><a name="l02275"></a><span class="lineno"> 2275</span>  MOODYCAMEL_CATCH (...) {</div> |
| <div class="line"><a name="l02276"></a><span class="lineno"> 2276</span>  <span class="comment">// It's too late to revert the dequeue, but we can make sure that all</span></div> |
| <div class="line"><a name="l02277"></a><span class="lineno"> 2277</span>  <span class="comment">// the dequeued objects are properly destroyed and the block index</span></div> |
| <div class="line"><a name="l02278"></a><span class="lineno"> 2278</span>  <span class="comment">// (and empty count) are properly updated before we propagate the exception</span></div> |
| <div class="line"><a name="l02279"></a><span class="lineno"> 2279</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02280"></a><span class="lineno"> 2280</span>  block = localBlockIndex->entries[indexIndex].block;</div> |
| <div class="line"><a name="l02281"></a><span class="lineno"> 2281</span>  <span class="keywordflow">while</span> (index != endIndex) {</div> |
| <div class="line"><a name="l02282"></a><span class="lineno"> 2282</span>  (*block)[index++]->~T();</div> |
| <div class="line"><a name="l02283"></a><span class="lineno"> 2283</span>  }</div> |
| <div class="line"><a name="l02284"></a><span class="lineno"> 2284</span>  block->template set_many_empty<explicit_context>(</div> |
| <div class="line"><a name="l02285"></a><span class="lineno"> 2285</span>  firstIndexInBlock, <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(endIndex - firstIndexInBlock));</div> |
| <div class="line"><a name="l02286"></a><span class="lineno"> 2286</span>  indexIndex = (indexIndex + 1) & (localBlockIndex->size - 1);</div> |
| <div class="line"><a name="l02287"></a><span class="lineno"> 2287</span>  </div> |
| <div class="line"><a name="l02288"></a><span class="lineno"> 2288</span>  firstIndexInBlock = index;</div> |
| <div class="line"><a name="l02289"></a><span class="lineno"> 2289</span>  endIndex = (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) +</div> |
| <div class="line"><a name="l02290"></a><span class="lineno"> 2290</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02291"></a><span class="lineno"> 2291</span>  endIndex = details::circular_less_than<index_t>(</div> |
| <div class="line"><a name="l02292"></a><span class="lineno"> 2292</span>  firstIndex + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount), endIndex) ? firstIndex +</div> |
| <div class="line"><a name="l02293"></a><span class="lineno"> 2293</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount)</div> |
| <div class="line"><a name="l02294"></a><span class="lineno"> 2294</span>  : endIndex;</div> |
| <div class="line"><a name="l02295"></a><span class="lineno"> 2295</span>  } <span class="keywordflow">while</span> (index != firstIndex + actualCount);</div> |
| <div class="line"><a name="l02296"></a><span class="lineno"> 2296</span>  </div> |
| <div class="line"><a name="l02297"></a><span class="lineno"> 2297</span>  MOODYCAMEL_RETHROW;</div> |
| <div class="line"><a name="l02298"></a><span class="lineno"> 2298</span>  }</div> |
| <div class="line"><a name="l02299"></a><span class="lineno"> 2299</span>  }</div> |
| <div class="line"><a name="l02300"></a><span class="lineno"> 2300</span>  block->template set_many_empty<explicit_context>(</div> |
| <div class="line"><a name="l02301"></a><span class="lineno"> 2301</span>  firstIndexInBlock, <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(endIndex - firstIndexInBlock));</div> |
| <div class="line"><a name="l02302"></a><span class="lineno"> 2302</span>  indexIndex = (indexIndex + 1) & (localBlockIndex->size - 1);</div> |
| <div class="line"><a name="l02303"></a><span class="lineno"> 2303</span>  } <span class="keywordflow">while</span> (index != firstIndex + actualCount);</div> |
| <div class="line"><a name="l02304"></a><span class="lineno"> 2304</span>  </div> |
| <div class="line"><a name="l02305"></a><span class="lineno"> 2305</span>  <span class="keywordflow">return</span> actualCount;</div> |
| <div class="line"><a name="l02306"></a><span class="lineno"> 2306</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02307"></a><span class="lineno"> 2307</span>  <span class="comment">// Wasn't anything to dequeue after all; make the effective dequeue count eventually consistent</span></div> |
| <div class="line"><a name="l02308"></a><span class="lineno"> 2308</span>  this->dequeueOvercommit.fetch_add(desiredCount, std::memory_order_release);</div> |
| <div class="line"><a name="l02309"></a><span class="lineno"> 2309</span>  }</div> |
| <div class="line"><a name="l02310"></a><span class="lineno"> 2310</span>  }</div> |
| <div class="line"><a name="l02311"></a><span class="lineno"> 2311</span>  </div> |
| <div class="line"><a name="l02312"></a><span class="lineno"> 2312</span>  <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l02313"></a><span class="lineno"> 2313</span>  }</div> |
| <div class="line"><a name="l02314"></a><span class="lineno"> 2314</span>  </div> |
| <div class="line"><a name="l02315"></a><span class="lineno"> 2315</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l02316"></a><span class="lineno"> 2316</span>  <span class="keyword">struct </span>BlockIndexEntry {</div> |
| <div class="line"><a name="l02317"></a><span class="lineno"> 2317</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> base;</div> |
| <div class="line"><a name="l02318"></a><span class="lineno"> 2318</span>  Block *block;</div> |
| <div class="line"><a name="l02319"></a><span class="lineno"> 2319</span>  };</div> |
| <div class="line"><a name="l02320"></a><span class="lineno"> 2320</span>  </div> |
| <div class="line"><a name="l02321"></a><span class="lineno"> 2321</span>  <span class="keyword">struct </span>BlockIndexHeader {</div> |
| <div class="line"><a name="l02322"></a><span class="lineno"> 2322</span>  <span class="keywordtype">size_t</span> size;</div> |
| <div class="line"><a name="l02323"></a><span class="lineno"> 2323</span>  std::atomic<size_t> front; <span class="comment">// Current slot (not next, like pr_blockIndexFront)</span></div> |
| <div class="line"><a name="l02324"></a><span class="lineno"> 2324</span>  BlockIndexEntry *entries;</div> |
| <div class="line"><a name="l02325"></a><span class="lineno"> 2325</span>  <span class="keywordtype">void</span> *prev;</div> |
| <div class="line"><a name="l02326"></a><span class="lineno"> 2326</span>  };</div> |
| <div class="line"><a name="l02327"></a><span class="lineno"> 2327</span>  </div> |
| <div class="line"><a name="l02328"></a><span class="lineno"> 2328</span>  </div> |
| <div class="line"><a name="l02329"></a><span class="lineno"> 2329</span>  <span class="keywordtype">bool</span> new_block_index(<span class="keywordtype">size_t</span> numberOfFilledSlotsToExpose) {</div> |
| <div class="line"><a name="l02330"></a><span class="lineno"> 2330</span>  <span class="keyword">auto</span> prevBlockSizeMask = pr_blockIndexSize - 1;</div> |
| <div class="line"><a name="l02331"></a><span class="lineno"> 2331</span>  </div> |
| <div class="line"><a name="l02332"></a><span class="lineno"> 2332</span>  <span class="comment">// Create the new block</span></div> |
| <div class="line"><a name="l02333"></a><span class="lineno"> 2333</span>  pr_blockIndexSize <<= 1;</div> |
| <div class="line"><a name="l02334"></a><span class="lineno"> 2334</span>  <span class="keyword">auto</span> newRawPtr = <span class="keyword">static_cast<</span><span class="keywordtype">char</span> *<span class="keyword">></span>((Traits::malloc)(</div> |
| <div class="line"><a name="l02335"></a><span class="lineno"> 2335</span>  <span class="keyword">sizeof</span>(BlockIndexHeader) + std::alignment_of<BlockIndexEntry>::value - 1 +</div> |
| <div class="line"><a name="l02336"></a><span class="lineno"> 2336</span>  <span class="keyword">sizeof</span>(BlockIndexEntry) * pr_blockIndexSize));</div> |
| <div class="line"><a name="l02337"></a><span class="lineno"> 2337</span>  <span class="keywordflow">if</span> (newRawPtr == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02338"></a><span class="lineno"> 2338</span>  pr_blockIndexSize >>= 1; <span class="comment">// Reset to allow graceful retry</span></div> |
| <div class="line"><a name="l02339"></a><span class="lineno"> 2339</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02340"></a><span class="lineno"> 2340</span>  }</div> |
| <div class="line"><a name="l02341"></a><span class="lineno"> 2341</span>  </div> |
| <div class="line"><a name="l02342"></a><span class="lineno"> 2342</span>  <span class="keyword">auto</span> newBlockIndexEntries = <span class="keyword">reinterpret_cast<</span>BlockIndexEntry *<span class="keyword">></span>(details::align_for<BlockIndexEntry>(</div> |
| <div class="line"><a name="l02343"></a><span class="lineno"> 2343</span>  newRawPtr + <span class="keyword">sizeof</span>(BlockIndexHeader)));</div> |
| <div class="line"><a name="l02344"></a><span class="lineno"> 2344</span>  </div> |
| <div class="line"><a name="l02345"></a><span class="lineno"> 2345</span>  <span class="comment">// Copy in all the old indices, if any</span></div> |
| <div class="line"><a name="l02346"></a><span class="lineno"> 2346</span>  <span class="keywordtype">size_t</span> j = 0;</div> |
| <div class="line"><a name="l02347"></a><span class="lineno"> 2347</span>  <span class="keywordflow">if</span> (pr_blockIndexSlotsUsed != 0) {</div> |
| <div class="line"><a name="l02348"></a><span class="lineno"> 2348</span>  <span class="keyword">auto</span> i = (pr_blockIndexFront - pr_blockIndexSlotsUsed) & prevBlockSizeMask;</div> |
| <div class="line"><a name="l02349"></a><span class="lineno"> 2349</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02350"></a><span class="lineno"> 2350</span>  newBlockIndexEntries[j++] = pr_blockIndexEntries[i];</div> |
| <div class="line"><a name="l02351"></a><span class="lineno"> 2351</span>  i = (i + 1) & prevBlockSizeMask;</div> |
| <div class="line"><a name="l02352"></a><span class="lineno"> 2352</span>  } <span class="keywordflow">while</span> (i != pr_blockIndexFront);</div> |
| <div class="line"><a name="l02353"></a><span class="lineno"> 2353</span>  }</div> |
| <div class="line"><a name="l02354"></a><span class="lineno"> 2354</span>  </div> |
| <div class="line"><a name="l02355"></a><span class="lineno"> 2355</span>  <span class="comment">// Update everything</span></div> |
| <div class="line"><a name="l02356"></a><span class="lineno"> 2356</span>  <span class="keyword">auto</span> header = <span class="keyword">new</span>(newRawPtr) BlockIndexHeader;</div> |
| <div class="line"><a name="l02357"></a><span class="lineno"> 2357</span>  header->size = pr_blockIndexSize;</div> |
| <div class="line"><a name="l02358"></a><span class="lineno"> 2358</span>  header->front.store(numberOfFilledSlotsToExpose - 1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02359"></a><span class="lineno"> 2359</span>  header->entries = newBlockIndexEntries;</div> |
| <div class="line"><a name="l02360"></a><span class="lineno"> 2360</span>  header->prev = pr_blockIndexRaw; <span class="comment">// we link the new block to the old one so we can free it later</span></div> |
| <div class="line"><a name="l02361"></a><span class="lineno"> 2361</span>  </div> |
| <div class="line"><a name="l02362"></a><span class="lineno"> 2362</span>  pr_blockIndexFront = j;</div> |
| <div class="line"><a name="l02363"></a><span class="lineno"> 2363</span>  pr_blockIndexEntries = newBlockIndexEntries;</div> |
| <div class="line"><a name="l02364"></a><span class="lineno"> 2364</span>  pr_blockIndexRaw = newRawPtr;</div> |
| <div class="line"><a name="l02365"></a><span class="lineno"> 2365</span>  blockIndex.store(header, std::memory_order_release);</div> |
| <div class="line"><a name="l02366"></a><span class="lineno"> 2366</span>  </div> |
| <div class="line"><a name="l02367"></a><span class="lineno"> 2367</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02368"></a><span class="lineno"> 2368</span>  }</div> |
| <div class="line"><a name="l02369"></a><span class="lineno"> 2369</span>  </div> |
| <div class="line"><a name="l02370"></a><span class="lineno"> 2370</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l02371"></a><span class="lineno"> 2371</span>  std::atomic<BlockIndexHeader *> blockIndex;</div> |
| <div class="line"><a name="l02372"></a><span class="lineno"> 2372</span>  </div> |
| <div class="line"><a name="l02373"></a><span class="lineno"> 2373</span>  <span class="comment">// To be used by producer only -- consumer must use the ones in referenced by blockIndex</span></div> |
| <div class="line"><a name="l02374"></a><span class="lineno"> 2374</span>  <span class="keywordtype">size_t</span> pr_blockIndexSlotsUsed;</div> |
| <div class="line"><a name="l02375"></a><span class="lineno"> 2375</span>  <span class="keywordtype">size_t</span> pr_blockIndexSize;</div> |
| <div class="line"><a name="l02376"></a><span class="lineno"> 2376</span>  <span class="keywordtype">size_t</span> pr_blockIndexFront; <span class="comment">// Next slot (not current)</span></div> |
| <div class="line"><a name="l02377"></a><span class="lineno"> 2377</span>  BlockIndexEntry *pr_blockIndexEntries;</div> |
| <div class="line"><a name="l02378"></a><span class="lineno"> 2378</span>  <span class="keywordtype">void</span> *pr_blockIndexRaw;</div> |
| <div class="line"><a name="l02379"></a><span class="lineno"> 2379</span>  </div> |
| <div class="line"><a name="l02380"></a><span class="lineno"> 2380</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l02381"></a><span class="lineno"> 2381</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l02382"></a><span class="lineno"> 2382</span>  ExplicitProducer* nextExplicitProducer;</div> |
| <div class="line"><a name="l02383"></a><span class="lineno"> 2383</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l02384"></a><span class="lineno"> 2384</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02385"></a><span class="lineno"> 2385</span>  </div> |
| <div class="line"><a name="l02386"></a><span class="lineno"> 2386</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l02387"></a><span class="lineno"> 2387</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>MemStats;</div> |
| <div class="line"><a name="l02388"></a><span class="lineno"> 2388</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02389"></a><span class="lineno"> 2389</span>  };</div> |
| <div class="line"><a name="l02390"></a><span class="lineno"> 2390</span>  </div> |
| <div class="line"><a name="l02391"></a><span class="lineno"> 2391</span>  </div> |
| <div class="line"><a name="l02393"></a><span class="lineno"> 2393</span>  <span class="comment">// Implicit queue</span></div> |
| <div class="line"><a name="l02395"></a><span class="lineno"> 2395</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l02396"></a><span class="lineno"> 2396</span>  <span class="keyword">struct </span>ImplicitProducer : <span class="keyword">public</span> ProducerBase {</div> |
| <div class="line"><a name="l02397"></a><span class="lineno"> 2397</span>  ImplicitProducer(ConcurrentQueue *parent)</div> |
| <div class="line"><a name="l02398"></a><span class="lineno"> 2398</span>  :</div> |
| <div class="line"><a name="l02399"></a><span class="lineno"> 2399</span>  ProducerBase(parent, false), nextBlockIndexCapacity(IMPLICIT_INITIAL_INDEX_SIZE), blockIndex(</div> |
| <div class="line"><a name="l02400"></a><span class="lineno"> 2400</span>  nullptr) {</div> |
| <div class="line"><a name="l02401"></a><span class="lineno"> 2401</span>  new_block_index();</div> |
| <div class="line"><a name="l02402"></a><span class="lineno"> 2402</span>  }</div> |
| <div class="line"><a name="l02403"></a><span class="lineno"> 2403</span>  </div> |
| <div class="line"><a name="l02404"></a><span class="lineno"> 2404</span>  ~ImplicitProducer() {</div> |
| <div class="line"><a name="l02405"></a><span class="lineno"> 2405</span>  <span class="comment">// Note that since we're in the destructor we can assume that all enqueue/dequeue operations</span></div> |
| <div class="line"><a name="l02406"></a><span class="lineno"> 2406</span>  <span class="comment">// completed already; this means that all undequeued elements are placed contiguously across</span></div> |
| <div class="line"><a name="l02407"></a><span class="lineno"> 2407</span>  <span class="comment">// contiguous blocks, and that only the first and last remaining blocks can be only partially</span></div> |
| <div class="line"><a name="l02408"></a><span class="lineno"> 2408</span>  <span class="comment">// empty (all other remaining blocks must be completely full).</span></div> |
| <div class="line"><a name="l02409"></a><span class="lineno"> 2409</span>  </div> |
| <div class="line"><a name="l02410"></a><span class="lineno"> 2410</span> <span class="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l02411"></a><span class="lineno"> 2411</span>  <span class="comment">// Unregister ourselves for thread termination notification</span></div> |
| <div class="line"><a name="l02412"></a><span class="lineno"> 2412</span>  <span class="keywordflow">if</span> (!this->inactive.load(std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l02413"></a><span class="lineno"> 2413</span>  details::ThreadExitNotifier::unsubscribe(&threadExitListener);</div> |
| <div class="line"><a name="l02414"></a><span class="lineno"> 2414</span>  }</div> |
| <div class="line"><a name="l02415"></a><span class="lineno"> 2415</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02416"></a><span class="lineno"> 2416</span>  </div> |
| <div class="line"><a name="l02417"></a><span class="lineno"> 2417</span>  <span class="comment">// Destroy all remaining elements!</span></div> |
| <div class="line"><a name="l02418"></a><span class="lineno"> 2418</span>  <span class="keyword">auto</span> tail = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02419"></a><span class="lineno"> 2419</span>  <span class="keyword">auto</span> index = this->headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02420"></a><span class="lineno"> 2420</span>  Block *block = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l02421"></a><span class="lineno"> 2421</span>  assert(index == tail || details::circular_less_than(index, tail));</div> |
| <div class="line"><a name="l02422"></a><span class="lineno"> 2422</span>  <span class="keywordtype">bool</span> forceFreeLastBlock =</div> |
| <div class="line"><a name="l02423"></a><span class="lineno"> 2423</span>  index != tail; <span class="comment">// If we enter the loop, then the last (tail) block will not be freed</span></div> |
| <div class="line"><a name="l02424"></a><span class="lineno"> 2424</span>  <span class="keywordflow">while</span> (index != tail) {</div> |
| <div class="line"><a name="l02425"></a><span class="lineno"> 2425</span>  <span class="keywordflow">if</span> ((index & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0 || block == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02426"></a><span class="lineno"> 2426</span>  <span class="keywordflow">if</span> (block != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02427"></a><span class="lineno"> 2427</span>  <span class="comment">// Free the old block</span></div> |
| <div class="line"><a name="l02428"></a><span class="lineno"> 2428</span>  this->parent->add_block_to_free_list(block);</div> |
| <div class="line"><a name="l02429"></a><span class="lineno"> 2429</span>  }</div> |
| <div class="line"><a name="l02430"></a><span class="lineno"> 2430</span>  </div> |
| <div class="line"><a name="l02431"></a><span class="lineno"> 2431</span>  block = get_block_index_entry_for_index(index)->value.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02432"></a><span class="lineno"> 2432</span>  }</div> |
| <div class="line"><a name="l02433"></a><span class="lineno"> 2433</span>  </div> |
| <div class="line"><a name="l02434"></a><span class="lineno"> 2434</span>  ((*block)[index])->~T();</div> |
| <div class="line"><a name="l02435"></a><span class="lineno"> 2435</span>  ++index;</div> |
| <div class="line"><a name="l02436"></a><span class="lineno"> 2436</span>  }</div> |
| <div class="line"><a name="l02437"></a><span class="lineno"> 2437</span>  <span class="comment">// Even if the queue is empty, there's still one block that's not on the free list</span></div> |
| <div class="line"><a name="l02438"></a><span class="lineno"> 2438</span>  <span class="comment">// (unless the head index reached the end of it, in which case the tail will be poised</span></div> |
| <div class="line"><a name="l02439"></a><span class="lineno"> 2439</span>  <span class="comment">// to create a new block).</span></div> |
| <div class="line"><a name="l02440"></a><span class="lineno"> 2440</span>  <span class="keywordflow">if</span> (this->tailBlock != <span class="keyword">nullptr</span> &&</div> |
| <div class="line"><a name="l02441"></a><span class="lineno"> 2441</span>  (forceFreeLastBlock || (tail & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) != 0)) {</div> |
| <div class="line"><a name="l02442"></a><span class="lineno"> 2442</span>  this->parent->add_block_to_free_list(this->tailBlock);</div> |
| <div class="line"><a name="l02443"></a><span class="lineno"> 2443</span>  }</div> |
| <div class="line"><a name="l02444"></a><span class="lineno"> 2444</span>  </div> |
| <div class="line"><a name="l02445"></a><span class="lineno"> 2445</span>  <span class="comment">// Destroy block index</span></div> |
| <div class="line"><a name="l02446"></a><span class="lineno"> 2446</span>  <span class="keyword">auto</span> localBlockIndex = blockIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02447"></a><span class="lineno"> 2447</span>  <span class="keywordflow">if</span> (localBlockIndex != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02448"></a><span class="lineno"> 2448</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != localBlockIndex->capacity; ++i) {</div> |
| <div class="line"><a name="l02449"></a><span class="lineno"> 2449</span>  localBlockIndex->index[i]->~BlockIndexEntry();</div> |
| <div class="line"><a name="l02450"></a><span class="lineno"> 2450</span>  }</div> |
| <div class="line"><a name="l02451"></a><span class="lineno"> 2451</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02452"></a><span class="lineno"> 2452</span>  <span class="keyword">auto</span> prev = localBlockIndex->prev;</div> |
| <div class="line"><a name="l02453"></a><span class="lineno"> 2453</span>  localBlockIndex->~BlockIndexHeader();</div> |
| <div class="line"><a name="l02454"></a><span class="lineno"> 2454</span>  (Traits::free)(localBlockIndex);</div> |
| <div class="line"><a name="l02455"></a><span class="lineno"> 2455</span>  localBlockIndex = prev;</div> |
| <div class="line"><a name="l02456"></a><span class="lineno"> 2456</span>  } <span class="keywordflow">while</span> (localBlockIndex != <span class="keyword">nullptr</span>);</div> |
| <div class="line"><a name="l02457"></a><span class="lineno"> 2457</span>  }</div> |
| <div class="line"><a name="l02458"></a><span class="lineno"> 2458</span>  }</div> |
| <div class="line"><a name="l02459"></a><span class="lineno"> 2459</span>  </div> |
| <div class="line"><a name="l02460"></a><span class="lineno"> 2460</span>  <span class="keyword">template</span><AllocationMode allocMode, <span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l02461"></a><span class="lineno"> 2461</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> enqueue(U &&element) {</div> |
| <div class="line"><a name="l02462"></a><span class="lineno"> 2462</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> currentTailIndex = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02463"></a><span class="lineno"> 2463</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> newTailIndex = 1 + currentTailIndex;</div> |
| <div class="line"><a name="l02464"></a><span class="lineno"> 2464</span>  <span class="keywordflow">if</span> ((currentTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0) {</div> |
| <div class="line"><a name="l02465"></a><span class="lineno"> 2465</span>  <span class="comment">// We reached the end of a block, start a new one</span></div> |
| <div class="line"><a name="l02466"></a><span class="lineno"> 2466</span>  <span class="keyword">auto</span> head = this->headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02467"></a><span class="lineno"> 2467</span>  assert(!details::circular_less_than<index_t>(currentTailIndex, head));</div> |
| <div class="line"><a name="l02468"></a><span class="lineno"> 2468</span>  <span class="keywordflow">if</span> (!details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||</div> |
| <div class="line"><a name="l02469"></a><span class="lineno"> 2469</span>  (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&</div> |
| <div class="line"><a name="l02470"></a><span class="lineno"> 2470</span>  (MAX_SUBQUEUE_SIZE == 0 ||</div> |
| <div class="line"><a name="l02471"></a><span class="lineno"> 2471</span>  MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head))) {</div> |
| <div class="line"><a name="l02472"></a><span class="lineno"> 2472</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02473"></a><span class="lineno"> 2473</span>  }</div> |
| <div class="line"><a name="l02474"></a><span class="lineno"> 2474</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02475"></a><span class="lineno"> 2475</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l02476"></a><span class="lineno"> 2476</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02477"></a><span class="lineno"> 2477</span>  <span class="comment">// Find out where we'll be inserting this block in the block index</span></div> |
| <div class="line"><a name="l02478"></a><span class="lineno"> 2478</span>  BlockIndexEntry *idxEntry;</div> |
| <div class="line"><a name="l02479"></a><span class="lineno"> 2479</span>  <span class="keywordflow">if</span> (!insert_block_index_entry<allocMode>(idxEntry, currentTailIndex)) {</div> |
| <div class="line"><a name="l02480"></a><span class="lineno"> 2480</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02481"></a><span class="lineno"> 2481</span>  }</div> |
| <div class="line"><a name="l02482"></a><span class="lineno"> 2482</span>  </div> |
| <div class="line"><a name="l02483"></a><span class="lineno"> 2483</span>  <span class="comment">// Get ahold of a new block</span></div> |
| <div class="line"><a name="l02484"></a><span class="lineno"> 2484</span>  <span class="keyword">auto</span> newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>();</div> |
| <div class="line"><a name="l02485"></a><span class="lineno"> 2485</span>  <span class="keywordflow">if</span> (newBlock == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02486"></a><span class="lineno"> 2486</span>  rewind_block_index_tail();</div> |
| <div class="line"><a name="l02487"></a><span class="lineno"> 2487</span>  idxEntry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02488"></a><span class="lineno"> 2488</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02489"></a><span class="lineno"> 2489</span>  }</div> |
| <div class="line"><a name="l02490"></a><span class="lineno"> 2490</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l02491"></a><span class="lineno"> 2491</span>  newBlock->owner = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l02492"></a><span class="lineno"> 2492</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02493"></a><span class="lineno"> 2493</span>  newBlock->template reset_empty<implicit_context>();</div> |
| <div class="line"><a name="l02494"></a><span class="lineno"> 2494</span>  </div> |
| <div class="line"><a name="l02495"></a><span class="lineno"> 2495</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(std::forward<U>(element)))) {</div> |
| <div class="line"><a name="l02496"></a><span class="lineno"> 2496</span>  <span class="comment">// May throw, try to insert now before we publish the fact that we have this new block</span></div> |
| <div class="line"><a name="l02497"></a><span class="lineno"> 2497</span>  MOODYCAMEL_TRY {</div> |
| <div class="line"><a name="l02498"></a><span class="lineno"> 2498</span>  <span class="keyword">new</span>((*newBlock)[currentTailIndex]) T(std::forward<U>(element));</div> |
| <div class="line"><a name="l02499"></a><span class="lineno"> 2499</span>  }</div> |
| <div class="line"><a name="l02500"></a><span class="lineno"> 2500</span>  MOODYCAMEL_CATCH (...) {</div> |
| <div class="line"><a name="l02501"></a><span class="lineno"> 2501</span>  rewind_block_index_tail();</div> |
| <div class="line"><a name="l02502"></a><span class="lineno"> 2502</span>  idxEntry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02503"></a><span class="lineno"> 2503</span>  this->parent->add_block_to_free_list(newBlock);</div> |
| <div class="line"><a name="l02504"></a><span class="lineno"> 2504</span>  MOODYCAMEL_RETHROW;</div> |
| <div class="line"><a name="l02505"></a><span class="lineno"> 2505</span>  }</div> |
| <div class="line"><a name="l02506"></a><span class="lineno"> 2506</span>  }</div> |
| <div class="line"><a name="l02507"></a><span class="lineno"> 2507</span>  </div> |
| <div class="line"><a name="l02508"></a><span class="lineno"> 2508</span>  <span class="comment">// Insert the new block into the index</span></div> |
| <div class="line"><a name="l02509"></a><span class="lineno"> 2509</span>  idxEntry->value.store(newBlock, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02510"></a><span class="lineno"> 2510</span>  </div> |
| <div class="line"><a name="l02511"></a><span class="lineno"> 2511</span>  this->tailBlock = newBlock;</div> |
| <div class="line"><a name="l02512"></a><span class="lineno"> 2512</span>  </div> |
| <div class="line"><a name="l02513"></a><span class="lineno"> 2513</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_CTOR(T, U, <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(std::forward<U>(element)))) {</div> |
| <div class="line"><a name="l02514"></a><span class="lineno"> 2514</span>  this->tailIndex.store(newTailIndex, std::memory_order_release);</div> |
| <div class="line"><a name="l02515"></a><span class="lineno"> 2515</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02516"></a><span class="lineno"> 2516</span>  }</div> |
| <div class="line"><a name="l02517"></a><span class="lineno"> 2517</span>  }</div> |
| <div class="line"><a name="l02518"></a><span class="lineno"> 2518</span>  </div> |
| <div class="line"><a name="l02519"></a><span class="lineno"> 2519</span>  <span class="comment">// Enqueue</span></div> |
| <div class="line"><a name="l02520"></a><span class="lineno"> 2520</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex]) T(std::forward<U>(element));</div> |
| <div class="line"><a name="l02521"></a><span class="lineno"> 2521</span>  </div> |
| <div class="line"><a name="l02522"></a><span class="lineno"> 2522</span>  this->tailIndex.store(newTailIndex, std::memory_order_release);</div> |
| <div class="line"><a name="l02523"></a><span class="lineno"> 2523</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02524"></a><span class="lineno"> 2524</span>  }</div> |
| <div class="line"><a name="l02525"></a><span class="lineno"> 2525</span>  </div> |
| <div class="line"><a name="l02526"></a><span class="lineno"> 2526</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l02527"></a><span class="lineno"> 2527</span>  <span class="keywordtype">bool</span> dequeue(U &element) {</div> |
| <div class="line"><a name="l02528"></a><span class="lineno"> 2528</span>  <span class="comment">// See ExplicitProducer::dequeue for rationale and explanation</span></div> |
| <div class="line"><a name="l02529"></a><span class="lineno"> 2529</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> tail = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02530"></a><span class="lineno"> 2530</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02531"></a><span class="lineno"> 2531</span>  <span class="keywordflow">if</span> (details::circular_less_than<index_t>(</div> |
| <div class="line"><a name="l02532"></a><span class="lineno"> 2532</span>  this->dequeueOptimisticCount.load(std::memory_order_relaxed) - overcommit, tail)) {</div> |
| <div class="line"><a name="l02533"></a><span class="lineno"> 2533</span>  std::atomic_thread_fence(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02534"></a><span class="lineno"> 2534</span>  </div> |
| <div class="line"><a name="l02535"></a><span class="lineno"> 2535</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> myDequeueCount = this->dequeueOptimisticCount.fetch_add(1,</div> |
| <div class="line"><a name="l02536"></a><span class="lineno"> 2536</span>  std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02537"></a><span class="lineno"> 2537</span>  assert(overcommit <= myDequeueCount);</div> |
| <div class="line"><a name="l02538"></a><span class="lineno"> 2538</span>  tail = this->tailIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02539"></a><span class="lineno"> 2539</span>  <span class="keywordflow">if</span> (details::likely(</div> |
| <div class="line"><a name="l02540"></a><span class="lineno"> 2540</span>  details::circular_less_than<index_t>(myDequeueCount - overcommit, tail))) {</div> |
| <div class="line"><a name="l02541"></a><span class="lineno"> 2541</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> index = this->headIndex.fetch_add(1, std::memory_order_acq_rel);</div> |
| <div class="line"><a name="l02542"></a><span class="lineno"> 2542</span>  </div> |
| <div class="line"><a name="l02543"></a><span class="lineno"> 2543</span>  <span class="comment">// Determine which block the element is in</span></div> |
| <div class="line"><a name="l02544"></a><span class="lineno"> 2544</span>  <span class="keyword">auto</span> entry = get_block_index_entry_for_index(index);</div> |
| <div class="line"><a name="l02545"></a><span class="lineno"> 2545</span>  </div> |
| <div class="line"><a name="l02546"></a><span class="lineno"> 2546</span>  <span class="comment">// Dequeue</span></div> |
| <div class="line"><a name="l02547"></a><span class="lineno"> 2547</span>  <span class="keyword">auto</span> block = entry->value.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02548"></a><span class="lineno"> 2548</span>  <span class="keyword">auto</span> &el = *((*block)[index]);</div> |
| <div class="line"><a name="l02549"></a><span class="lineno"> 2549</span>  </div> |
| <div class="line"><a name="l02550"></a><span class="lineno"> 2550</span>  <span class="keywordflow">if</span> (!MOODYCAMEL_NOEXCEPT_ASSIGN(T, T &&, element = std::move(el))) {</div> |
| <div class="line"><a name="l02551"></a><span class="lineno"> 2551</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02552"></a><span class="lineno"> 2552</span>  <span class="comment">// Note: Acquiring the mutex with every dequeue instead of only when a block</span></div> |
| <div class="line"><a name="l02553"></a><span class="lineno"> 2553</span>  <span class="comment">// is released is very sub-optimal, but it is, after all, purely debug code.</span></div> |
| <div class="line"><a name="l02554"></a><span class="lineno"> 2554</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(producer->mutex);</div> |
| <div class="line"><a name="l02555"></a><span class="lineno"> 2555</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02556"></a><span class="lineno"> 2556</span>  <span class="keyword">struct </span>Guard {</div> |
| <div class="line"><a name="l02557"></a><span class="lineno"> 2557</span>  Block *block;</div> |
| <div class="line"><a name="l02558"></a><span class="lineno"> 2558</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> index;</div> |
| <div class="line"><a name="l02559"></a><span class="lineno"> 2559</span>  BlockIndexEntry *entry;</div> |
| <div class="line"><a name="l02560"></a><span class="lineno"> 2560</span>  ConcurrentQueue *parent;</div> |
| <div class="line"><a name="l02561"></a><span class="lineno"> 2561</span>  </div> |
| <div class="line"><a name="l02562"></a><span class="lineno"> 2562</span>  ~Guard() {</div> |
| <div class="line"><a name="l02563"></a><span class="lineno"> 2563</span>  (*block)[index]->~T();</div> |
| <div class="line"><a name="l02564"></a><span class="lineno"> 2564</span>  <span class="keywordflow">if</span> (block->template set_empty<implicit_context>(index)) {</div> |
| <div class="line"><a name="l02565"></a><span class="lineno"> 2565</span>  entry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02566"></a><span class="lineno"> 2566</span>  parent->add_block_to_free_list(block);</div> |
| <div class="line"><a name="l02567"></a><span class="lineno"> 2567</span>  }</div> |
| <div class="line"><a name="l02568"></a><span class="lineno"> 2568</span>  }</div> |
| <div class="line"><a name="l02569"></a><span class="lineno"> 2569</span>  } guard = {block, index, entry, this->parent};</div> |
| <div class="line"><a name="l02570"></a><span class="lineno"> 2570</span>  </div> |
| <div class="line"><a name="l02571"></a><span class="lineno"> 2571</span>  element = std::move(el);</div> |
| <div class="line"><a name="l02572"></a><span class="lineno"> 2572</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02573"></a><span class="lineno"> 2573</span>  element = std::move(el);</div> |
| <div class="line"><a name="l02574"></a><span class="lineno"> 2574</span>  el.~T();</div> |
| <div class="line"><a name="l02575"></a><span class="lineno"> 2575</span>  </div> |
| <div class="line"><a name="l02576"></a><span class="lineno"> 2576</span>  <span class="keywordflow">if</span> (block->template set_empty<implicit_context>(index)) {</div> |
| <div class="line"><a name="l02577"></a><span class="lineno"> 2577</span>  {</div> |
| <div class="line"><a name="l02578"></a><span class="lineno"> 2578</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02579"></a><span class="lineno"> 2579</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l02580"></a><span class="lineno"> 2580</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02581"></a><span class="lineno"> 2581</span>  <span class="comment">// Add the block back into the global free pool (and remove from block index)</span></div> |
| <div class="line"><a name="l02582"></a><span class="lineno"> 2582</span>  entry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02583"></a><span class="lineno"> 2583</span>  }</div> |
| <div class="line"><a name="l02584"></a><span class="lineno"> 2584</span>  this->parent->add_block_to_free_list(block); <span class="comment">// releases the above store</span></div> |
| <div class="line"><a name="l02585"></a><span class="lineno"> 2585</span>  }</div> |
| <div class="line"><a name="l02586"></a><span class="lineno"> 2586</span>  }</div> |
| <div class="line"><a name="l02587"></a><span class="lineno"> 2587</span>  </div> |
| <div class="line"><a name="l02588"></a><span class="lineno"> 2588</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02589"></a><span class="lineno"> 2589</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02590"></a><span class="lineno"> 2590</span>  this->dequeueOvercommit.fetch_add(1, std::memory_order_release);</div> |
| <div class="line"><a name="l02591"></a><span class="lineno"> 2591</span>  }</div> |
| <div class="line"><a name="l02592"></a><span class="lineno"> 2592</span>  }</div> |
| <div class="line"><a name="l02593"></a><span class="lineno"> 2593</span>  </div> |
| <div class="line"><a name="l02594"></a><span class="lineno"> 2594</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02595"></a><span class="lineno"> 2595</span>  }</div> |
| <div class="line"><a name="l02596"></a><span class="lineno"> 2596</span>  </div> |
| <div class="line"><a name="l02597"></a><span class="lineno"> 2597</span>  <span class="keyword">template</span><AllocationMode allocMode, <span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l02598"></a><span class="lineno"> 2598</span>  <span class="keywordtype">bool</span> enqueue_bulk(It itemFirst, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l02599"></a><span class="lineno"> 2599</span>  <span class="comment">// First, we need to make sure we have enough room to enqueue all of the elements;</span></div> |
| <div class="line"><a name="l02600"></a><span class="lineno"> 2600</span>  <span class="comment">// this means pre-allocating blocks and putting them in the block index (but only if</span></div> |
| <div class="line"><a name="l02601"></a><span class="lineno"> 2601</span>  <span class="comment">// all the allocations succeeded).</span></div> |
| <div class="line"><a name="l02602"></a><span class="lineno"> 2602</span>  </div> |
| <div class="line"><a name="l02603"></a><span class="lineno"> 2603</span>  <span class="comment">// Note that the tailBlock we start off with may not be owned by us any more;</span></div> |
| <div class="line"><a name="l02604"></a><span class="lineno"> 2604</span>  <span class="comment">// this happens if it was filled up exactly to the top (setting tailIndex to</span></div> |
| <div class="line"><a name="l02605"></a><span class="lineno"> 2605</span>  <span class="comment">// the first index of the next block which is not yet allocated), then dequeued</span></div> |
| <div class="line"><a name="l02606"></a><span class="lineno"> 2606</span>  <span class="comment">// completely (putting it on the free list) before we enqueue again.</span></div> |
| <div class="line"><a name="l02607"></a><span class="lineno"> 2607</span>  </div> |
| <div class="line"><a name="l02608"></a><span class="lineno"> 2608</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> startTailIndex = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02609"></a><span class="lineno"> 2609</span>  <span class="keyword">auto</span> startBlock = this->tailBlock;</div> |
| <div class="line"><a name="l02610"></a><span class="lineno"> 2610</span>  Block *firstAllocatedBlock = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l02611"></a><span class="lineno"> 2611</span>  <span class="keyword">auto</span> endBlock = this->tailBlock;</div> |
| <div class="line"><a name="l02612"></a><span class="lineno"> 2612</span>  </div> |
| <div class="line"><a name="l02613"></a><span class="lineno"> 2613</span>  <span class="comment">// Figure out how many blocks we'll need to allocate, and do so</span></div> |
| <div class="line"><a name="l02614"></a><span class="lineno"> 2614</span>  <span class="keywordtype">size_t</span> blockBaseDiff =</div> |
| <div class="line"><a name="l02615"></a><span class="lineno"> 2615</span>  ((startTailIndex + count - 1) & ~<span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) -</div> |
| <div class="line"><a name="l02616"></a><span class="lineno"> 2616</span>  ((startTailIndex - 1) & ~static_cast<index_t>(BLOCK_SIZE - 1));</div> |
| <div class="line"><a name="l02617"></a><span class="lineno"> 2617</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> currentTailIndex = (startTailIndex - 1) & ~<span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l02618"></a><span class="lineno"> 2618</span>  <span class="keywordflow">if</span> (blockBaseDiff > 0) {</div> |
| <div class="line"><a name="l02619"></a><span class="lineno"> 2619</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02620"></a><span class="lineno"> 2620</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l02621"></a><span class="lineno"> 2621</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02622"></a><span class="lineno"> 2622</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02623"></a><span class="lineno"> 2623</span>  blockBaseDiff -= <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02624"></a><span class="lineno"> 2624</span>  currentTailIndex += <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02625"></a><span class="lineno"> 2625</span>  </div> |
| <div class="line"><a name="l02626"></a><span class="lineno"> 2626</span>  <span class="comment">// Find out where we'll be inserting this block in the block index</span></div> |
| <div class="line"><a name="l02627"></a><span class="lineno"> 2627</span>  BlockIndexEntry *idxEntry = <span class="keyword">nullptr</span>; <span class="comment">// initialization here unnecessary but compiler can't always tell</span></div> |
| <div class="line"><a name="l02628"></a><span class="lineno"> 2628</span>  Block *newBlock;</div> |
| <div class="line"><a name="l02629"></a><span class="lineno"> 2629</span>  <span class="keywordtype">bool</span> indexInserted = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02630"></a><span class="lineno"> 2630</span>  <span class="keyword">auto</span> head = this->headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02631"></a><span class="lineno"> 2631</span>  assert(!details::circular_less_than<index_t>(currentTailIndex, head));</div> |
| <div class="line"><a name="l02632"></a><span class="lineno"> 2632</span>  <span class="keywordtype">bool</span> full = !details::circular_less_than<index_t>(head, currentTailIndex + BLOCK_SIZE) ||</div> |
| <div class="line"><a name="l02633"></a><span class="lineno"> 2633</span>  (MAX_SUBQUEUE_SIZE != details::const_numeric_max<size_t>::value &&</div> |
| <div class="line"><a name="l02634"></a><span class="lineno"> 2634</span>  (MAX_SUBQUEUE_SIZE == 0 ||</div> |
| <div class="line"><a name="l02635"></a><span class="lineno"> 2635</span>  MAX_SUBQUEUE_SIZE - BLOCK_SIZE < currentTailIndex - head));</div> |
| <div class="line"><a name="l02636"></a><span class="lineno"> 2636</span>  <span class="keywordflow">if</span> (full ||</div> |
| <div class="line"><a name="l02637"></a><span class="lineno"> 2637</span>  !(indexInserted = insert_block_index_entry<allocMode>(idxEntry, currentTailIndex)) ||</div> |
| <div class="line"><a name="l02638"></a><span class="lineno"> 2638</span>  (newBlock = this->parent->ConcurrentQueue::template requisition_block<allocMode>()) ==</div> |
| <div class="line"><a name="l02639"></a><span class="lineno"> 2639</span>  <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02640"></a><span class="lineno"> 2640</span>  <span class="comment">// Index allocation or block allocation failed; revert any other allocations</span></div> |
| <div class="line"><a name="l02641"></a><span class="lineno"> 2641</span>  <span class="comment">// and index insertions done so far for this operation</span></div> |
| <div class="line"><a name="l02642"></a><span class="lineno"> 2642</span>  <span class="keywordflow">if</span> (indexInserted) {</div> |
| <div class="line"><a name="l02643"></a><span class="lineno"> 2643</span>  rewind_block_index_tail();</div> |
| <div class="line"><a name="l02644"></a><span class="lineno"> 2644</span>  idxEntry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02645"></a><span class="lineno"> 2645</span>  }</div> |
| <div class="line"><a name="l02646"></a><span class="lineno"> 2646</span>  currentTailIndex = (startTailIndex - 1) & ~<span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l02647"></a><span class="lineno"> 2647</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> block = firstAllocatedBlock; block != <span class="keyword">nullptr</span>; block = block->next) {</div> |
| <div class="line"><a name="l02648"></a><span class="lineno"> 2648</span>  currentTailIndex += <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02649"></a><span class="lineno"> 2649</span>  idxEntry = get_block_index_entry_for_index(currentTailIndex);</div> |
| <div class="line"><a name="l02650"></a><span class="lineno"> 2650</span>  idxEntry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02651"></a><span class="lineno"> 2651</span>  rewind_block_index_tail();</div> |
| <div class="line"><a name="l02652"></a><span class="lineno"> 2652</span>  }</div> |
| <div class="line"><a name="l02653"></a><span class="lineno"> 2653</span>  this->parent->add_blocks_to_free_list(firstAllocatedBlock);</div> |
| <div class="line"><a name="l02654"></a><span class="lineno"> 2654</span>  this->tailBlock = startBlock;</div> |
| <div class="line"><a name="l02655"></a><span class="lineno"> 2655</span>  </div> |
| <div class="line"><a name="l02656"></a><span class="lineno"> 2656</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02657"></a><span class="lineno"> 2657</span>  }</div> |
| <div class="line"><a name="l02658"></a><span class="lineno"> 2658</span>  </div> |
| <div class="line"><a name="l02659"></a><span class="lineno"> 2659</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l02660"></a><span class="lineno"> 2660</span>  newBlock->owner = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l02661"></a><span class="lineno"> 2661</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02662"></a><span class="lineno"> 2662</span>  newBlock->template reset_empty<implicit_context>();</div> |
| <div class="line"><a name="l02663"></a><span class="lineno"> 2663</span>  newBlock->next = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l02664"></a><span class="lineno"> 2664</span>  </div> |
| <div class="line"><a name="l02665"></a><span class="lineno"> 2665</span>  <span class="comment">// Insert the new block into the index</span></div> |
| <div class="line"><a name="l02666"></a><span class="lineno"> 2666</span>  idxEntry->value.store(newBlock, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02667"></a><span class="lineno"> 2667</span>  </div> |
| <div class="line"><a name="l02668"></a><span class="lineno"> 2668</span>  <span class="comment">// Store the chain of blocks so that we can undo if later allocations fail,</span></div> |
| <div class="line"><a name="l02669"></a><span class="lineno"> 2669</span>  <span class="comment">// and so that we can find the blocks when we do the actual enqueueing</span></div> |
| <div class="line"><a name="l02670"></a><span class="lineno"> 2670</span>  <span class="keywordflow">if</span> ((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) != 0 ||</div> |
| <div class="line"><a name="l02671"></a><span class="lineno"> 2671</span>  firstAllocatedBlock != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02672"></a><span class="lineno"> 2672</span>  assert(this->tailBlock != <span class="keyword">nullptr</span>);</div> |
| <div class="line"><a name="l02673"></a><span class="lineno"> 2673</span>  this->tailBlock->next = newBlock;</div> |
| <div class="line"><a name="l02674"></a><span class="lineno"> 2674</span>  }</div> |
| <div class="line"><a name="l02675"></a><span class="lineno"> 2675</span>  this->tailBlock = newBlock;</div> |
| <div class="line"><a name="l02676"></a><span class="lineno"> 2676</span>  endBlock = newBlock;</div> |
| <div class="line"><a name="l02677"></a><span class="lineno"> 2677</span>  firstAllocatedBlock = firstAllocatedBlock == <span class="keyword">nullptr</span> ? newBlock : firstAllocatedBlock;</div> |
| <div class="line"><a name="l02678"></a><span class="lineno"> 2678</span>  } <span class="keywordflow">while</span> (blockBaseDiff > 0);</div> |
| <div class="line"><a name="l02679"></a><span class="lineno"> 2679</span>  }</div> |
| <div class="line"><a name="l02680"></a><span class="lineno"> 2680</span>  </div> |
| <div class="line"><a name="l02681"></a><span class="lineno"> 2681</span>  <span class="comment">// Enqueue, one block at a time</span></div> |
| <div class="line"><a name="l02682"></a><span class="lineno"> 2682</span>  <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> newTailIndex = startTailIndex + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(count);</div> |
| <div class="line"><a name="l02683"></a><span class="lineno"> 2683</span>  currentTailIndex = startTailIndex;</div> |
| <div class="line"><a name="l02684"></a><span class="lineno"> 2684</span>  this->tailBlock = startBlock;</div> |
| <div class="line"><a name="l02685"></a><span class="lineno"> 2685</span>  assert((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) != 0 ||</div> |
| <div class="line"><a name="l02686"></a><span class="lineno"> 2686</span>  firstAllocatedBlock != <span class="keyword">nullptr</span> || count == 0);</div> |
| <div class="line"><a name="l02687"></a><span class="lineno"> 2687</span>  <span class="keywordflow">if</span> ((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0 &&</div> |
| <div class="line"><a name="l02688"></a><span class="lineno"> 2688</span>  firstAllocatedBlock != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02689"></a><span class="lineno"> 2689</span>  this->tailBlock = firstAllocatedBlock;</div> |
| <div class="line"><a name="l02690"></a><span class="lineno"> 2690</span>  }</div> |
| <div class="line"><a name="l02691"></a><span class="lineno"> 2691</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l02692"></a><span class="lineno"> 2692</span>  <span class="keyword">auto</span> stopIndex = (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) +</div> |
| <div class="line"><a name="l02693"></a><span class="lineno"> 2693</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02694"></a><span class="lineno"> 2694</span>  <span class="keywordflow">if</span> (details::circular_less_than<index_t>(newTailIndex, stopIndex)) {</div> |
| <div class="line"><a name="l02695"></a><span class="lineno"> 2695</span>  stopIndex = newTailIndex;</div> |
| <div class="line"><a name="l02696"></a><span class="lineno"> 2696</span>  }</div> |
| <div class="line"><a name="l02697"></a><span class="lineno"> 2697</span>  <span class="keywordflow">if</span> (MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst),</div> |
| <div class="line"><a name="l02698"></a><span class="lineno"> 2698</span>  <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(details::deref_noexcept(itemFirst)))) {</div> |
| <div class="line"><a name="l02699"></a><span class="lineno"> 2699</span>  <span class="keywordflow">while</span> (currentTailIndex != stopIndex) {</div> |
| <div class="line"><a name="l02700"></a><span class="lineno"> 2700</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex++]) T(*itemFirst++);</div> |
| <div class="line"><a name="l02701"></a><span class="lineno"> 2701</span>  }</div> |
| <div class="line"><a name="l02702"></a><span class="lineno"> 2702</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02703"></a><span class="lineno"> 2703</span>  MOODYCAMEL_TRY {</div> |
| <div class="line"><a name="l02704"></a><span class="lineno"> 2704</span>  <span class="keywordflow">while</span> (currentTailIndex != stopIndex) {</div> |
| <div class="line"><a name="l02705"></a><span class="lineno"> 2705</span>  <span class="keyword">new</span>((*this->tailBlock)[currentTailIndex]) T(</div> |
| <div class="line"><a name="l02706"></a><span class="lineno"> 2706</span>  details::nomove_if<(<span class="keywordtype">bool</span>) !MOODYCAMEL_NOEXCEPT_CTOR(T, decltype(*itemFirst),</div> |
| <div class="line"><a name="l02707"></a><span class="lineno"> 2707</span>  <span class="keyword">new</span>(<span class="keyword">nullptr</span>) T(</div> |
| <div class="line"><a name="l02708"></a><span class="lineno"> 2708</span>  details::deref_noexcept(</div> |
| <div class="line"><a name="l02709"></a><span class="lineno"> 2709</span>  itemFirst)))>::eval(</div> |
| <div class="line"><a name="l02710"></a><span class="lineno"> 2710</span>  *itemFirst));</div> |
| <div class="line"><a name="l02711"></a><span class="lineno"> 2711</span>  ++currentTailIndex;</div> |
| <div class="line"><a name="l02712"></a><span class="lineno"> 2712</span>  ++itemFirst;</div> |
| <div class="line"><a name="l02713"></a><span class="lineno"> 2713</span>  }</div> |
| <div class="line"><a name="l02714"></a><span class="lineno"> 2714</span>  }</div> |
| <div class="line"><a name="l02715"></a><span class="lineno"> 2715</span>  MOODYCAMEL_CATCH (...) {</div> |
| <div class="line"><a name="l02716"></a><span class="lineno"> 2716</span>  <span class="keyword">auto</span> constructedStopIndex = currentTailIndex;</div> |
| <div class="line"><a name="l02717"></a><span class="lineno"> 2717</span>  <span class="keyword">auto</span> lastBlockEnqueued = this->tailBlock;</div> |
| <div class="line"><a name="l02718"></a><span class="lineno"> 2718</span>  </div> |
| <div class="line"><a name="l02719"></a><span class="lineno"> 2719</span>  <span class="keywordflow">if</span> (!details::is_trivially_destructible<T>::value) {</div> |
| <div class="line"><a name="l02720"></a><span class="lineno"> 2720</span>  <span class="keyword">auto</span> block = startBlock;</div> |
| <div class="line"><a name="l02721"></a><span class="lineno"> 2721</span>  <span class="keywordflow">if</span> ((startTailIndex & <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1)) == 0) {</div> |
| <div class="line"><a name="l02722"></a><span class="lineno"> 2722</span>  block = firstAllocatedBlock;</div> |
| <div class="line"><a name="l02723"></a><span class="lineno"> 2723</span>  }</div> |
| <div class="line"><a name="l02724"></a><span class="lineno"> 2724</span>  currentTailIndex = startTailIndex;</div> |
| <div class="line"><a name="l02725"></a><span class="lineno"> 2725</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l02726"></a><span class="lineno"> 2726</span>  stopIndex = (currentTailIndex & ~static_cast<index_t>(BLOCK_SIZE - 1)) +</div> |
| <div class="line"><a name="l02727"></a><span class="lineno"> 2727</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02728"></a><span class="lineno"> 2728</span>  <span class="keywordflow">if</span> (details::circular_less_than<index_t>(constructedStopIndex, stopIndex)) {</div> |
| <div class="line"><a name="l02729"></a><span class="lineno"> 2729</span>  stopIndex = constructedStopIndex;</div> |
| <div class="line"><a name="l02730"></a><span class="lineno"> 2730</span>  }</div> |
| <div class="line"><a name="l02731"></a><span class="lineno"> 2731</span>  <span class="keywordflow">while</span> (currentTailIndex != stopIndex) {</div> |
| <div class="line"><a name="l02732"></a><span class="lineno"> 2732</span>  (*block)[currentTailIndex++]->~T();</div> |
| <div class="line"><a name="l02733"></a><span class="lineno"> 2733</span>  }</div> |
| <div class="line"><a name="l02734"></a><span class="lineno"> 2734</span>  <span class="keywordflow">if</span> (block == lastBlockEnqueued) {</div> |
| <div class="line"><a name="l02735"></a><span class="lineno"> 2735</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l02736"></a><span class="lineno"> 2736</span>  }</div> |
| <div class="line"><a name="l02737"></a><span class="lineno"> 2737</span>  block = block->next;</div> |
| <div class="line"><a name="l02738"></a><span class="lineno"> 2738</span>  }</div> |
| <div class="line"><a name="l02739"></a><span class="lineno"> 2739</span>  }</div> |
| <div class="line"><a name="l02740"></a><span class="lineno"> 2740</span>  </div> |
| <div class="line"><a name="l02741"></a><span class="lineno"> 2741</span>  currentTailIndex = (startTailIndex - 1) & ~<span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l02742"></a><span class="lineno"> 2742</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> block = firstAllocatedBlock; block != <span class="keyword">nullptr</span>; block = block->next) {</div> |
| <div class="line"><a name="l02743"></a><span class="lineno"> 2743</span>  currentTailIndex += <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02744"></a><span class="lineno"> 2744</span>  <span class="keyword">auto</span> idxEntry = get_block_index_entry_for_index(currentTailIndex);</div> |
| <div class="line"><a name="l02745"></a><span class="lineno"> 2745</span>  idxEntry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02746"></a><span class="lineno"> 2746</span>  rewind_block_index_tail();</div> |
| <div class="line"><a name="l02747"></a><span class="lineno"> 2747</span>  }</div> |
| <div class="line"><a name="l02748"></a><span class="lineno"> 2748</span>  this->parent->add_blocks_to_free_list(firstAllocatedBlock);</div> |
| <div class="line"><a name="l02749"></a><span class="lineno"> 2749</span>  this->tailBlock = startBlock;</div> |
| <div class="line"><a name="l02750"></a><span class="lineno"> 2750</span>  MOODYCAMEL_RETHROW;</div> |
| <div class="line"><a name="l02751"></a><span class="lineno"> 2751</span>  }</div> |
| <div class="line"><a name="l02752"></a><span class="lineno"> 2752</span>  }</div> |
| <div class="line"><a name="l02753"></a><span class="lineno"> 2753</span>  </div> |
| <div class="line"><a name="l02754"></a><span class="lineno"> 2754</span>  <span class="keywordflow">if</span> (this->tailBlock == endBlock) {</div> |
| <div class="line"><a name="l02755"></a><span class="lineno"> 2755</span>  assert(currentTailIndex == newTailIndex);</div> |
| <div class="line"><a name="l02756"></a><span class="lineno"> 2756</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l02757"></a><span class="lineno"> 2757</span>  }</div> |
| <div class="line"><a name="l02758"></a><span class="lineno"> 2758</span>  this->tailBlock = this->tailBlock->next;</div> |
| <div class="line"><a name="l02759"></a><span class="lineno"> 2759</span>  }</div> |
| <div class="line"><a name="l02760"></a><span class="lineno"> 2760</span>  this->tailIndex.store(newTailIndex, std::memory_order_release);</div> |
| <div class="line"><a name="l02761"></a><span class="lineno"> 2761</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02762"></a><span class="lineno"> 2762</span>  }</div> |
| <div class="line"><a name="l02763"></a><span class="lineno"> 2763</span>  </div> |
| <div class="line"><a name="l02764"></a><span class="lineno"> 2764</span>  <span class="keyword">template</span><<span class="keyword">typename</span> It></div> |
| <div class="line"><a name="l02765"></a><span class="lineno"> 2765</span>  <span class="keywordtype">size_t</span> dequeue_bulk(It &itemFirst, <span class="keywordtype">size_t</span> max) {</div> |
| <div class="line"><a name="l02766"></a><span class="lineno"> 2766</span>  <span class="keyword">auto</span> tail = this->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02767"></a><span class="lineno"> 2767</span>  <span class="keyword">auto</span> overcommit = this->dequeueOvercommit.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02768"></a><span class="lineno"> 2768</span>  <span class="keyword">auto</span> desiredCount = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(tail - (this->dequeueOptimisticCount.load(</div> |
| <div class="line"><a name="l02769"></a><span class="lineno"> 2769</span>  std::memory_order_relaxed) - overcommit));</div> |
| <div class="line"><a name="l02770"></a><span class="lineno"> 2770</span>  <span class="keywordflow">if</span> (details::circular_less_than<size_t>(0, desiredCount)) {</div> |
| <div class="line"><a name="l02771"></a><span class="lineno"> 2771</span>  desiredCount = desiredCount < max ? desiredCount : max;</div> |
| <div class="line"><a name="l02772"></a><span class="lineno"> 2772</span>  std::atomic_thread_fence(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02773"></a><span class="lineno"> 2773</span>  </div> |
| <div class="line"><a name="l02774"></a><span class="lineno"> 2774</span>  <span class="keyword">auto</span> myDequeueCount = this->dequeueOptimisticCount.fetch_add(desiredCount,</div> |
| <div class="line"><a name="l02775"></a><span class="lineno"> 2775</span>  std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02776"></a><span class="lineno"> 2776</span>  assert(overcommit <= myDequeueCount);</div> |
| <div class="line"><a name="l02777"></a><span class="lineno"> 2777</span>  </div> |
| <div class="line"><a name="l02778"></a><span class="lineno"> 2778</span>  tail = this->tailIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02779"></a><span class="lineno"> 2779</span>  <span class="keyword">auto</span> actualCount = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(tail - (myDequeueCount - overcommit));</div> |
| <div class="line"><a name="l02780"></a><span class="lineno"> 2780</span>  <span class="keywordflow">if</span> (details::circular_less_than<size_t>(0, actualCount)) {</div> |
| <div class="line"><a name="l02781"></a><span class="lineno"> 2781</span>  actualCount = desiredCount < actualCount ? desiredCount : actualCount;</div> |
| <div class="line"><a name="l02782"></a><span class="lineno"> 2782</span>  <span class="keywordflow">if</span> (actualCount < desiredCount) {</div> |
| <div class="line"><a name="l02783"></a><span class="lineno"> 2783</span>  this->dequeueOvercommit.fetch_add(desiredCount - actualCount,</div> |
| <div class="line"><a name="l02784"></a><span class="lineno"> 2784</span>  std::memory_order_release);</div> |
| <div class="line"><a name="l02785"></a><span class="lineno"> 2785</span>  }</div> |
| <div class="line"><a name="l02786"></a><span class="lineno"> 2786</span>  </div> |
| <div class="line"><a name="l02787"></a><span class="lineno"> 2787</span>  <span class="comment">// Get the first index. Note that since there's guaranteed to be at least actualCount elements, this</span></div> |
| <div class="line"><a name="l02788"></a><span class="lineno"> 2788</span>  <span class="comment">// will never exceed tail.</span></div> |
| <div class="line"><a name="l02789"></a><span class="lineno"> 2789</span>  <span class="keyword">auto</span> firstIndex = this->headIndex.fetch_add(actualCount, std::memory_order_acq_rel);</div> |
| <div class="line"><a name="l02790"></a><span class="lineno"> 2790</span>  </div> |
| <div class="line"><a name="l02791"></a><span class="lineno"> 2791</span>  <span class="comment">// Iterate the blocks and dequeue</span></div> |
| <div class="line"><a name="l02792"></a><span class="lineno"> 2792</span>  <span class="keyword">auto</span> index = firstIndex;</div> |
| <div class="line"><a name="l02793"></a><span class="lineno"> 2793</span>  BlockIndexHeader *localBlockIndex;</div> |
| <div class="line"><a name="l02794"></a><span class="lineno"> 2794</span>  <span class="keyword">auto</span> indexIndex = get_block_index_index_for_index(index, localBlockIndex);</div> |
| <div class="line"><a name="l02795"></a><span class="lineno"> 2795</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02796"></a><span class="lineno"> 2796</span>  <span class="keyword">auto</span> blockStartIndex = index;</div> |
| <div class="line"><a name="l02797"></a><span class="lineno"> 2797</span>  <span class="keyword">auto</span> endIndex =</div> |
| <div class="line"><a name="l02798"></a><span class="lineno"> 2798</span>  (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02799"></a><span class="lineno"> 2799</span>  endIndex = details::circular_less_than<index_t>(</div> |
| <div class="line"><a name="l02800"></a><span class="lineno"> 2800</span>  firstIndex + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount), endIndex) ? firstIndex +</div> |
| <div class="line"><a name="l02801"></a><span class="lineno"> 2801</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount)</div> |
| <div class="line"><a name="l02802"></a><span class="lineno"> 2802</span>  : endIndex;</div> |
| <div class="line"><a name="l02803"></a><span class="lineno"> 2803</span>  </div> |
| <div class="line"><a name="l02804"></a><span class="lineno"> 2804</span>  <span class="keyword">auto</span> entry = localBlockIndex->index[indexIndex];</div> |
| <div class="line"><a name="l02805"></a><span class="lineno"> 2805</span>  <span class="keyword">auto</span> block = entry->value.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02806"></a><span class="lineno"> 2806</span>  <span class="keywordflow">if</span> (MOODYCAMEL_NOEXCEPT_ASSIGN(T, T &&, details::deref_noexcept(itemFirst) = std::move(</div> |
| <div class="line"><a name="l02807"></a><span class="lineno"> 2807</span>  (*(*block)[index])))) {</div> |
| <div class="line"><a name="l02808"></a><span class="lineno"> 2808</span>  <span class="keywordflow">while</span> (index != endIndex) {</div> |
| <div class="line"><a name="l02809"></a><span class="lineno"> 2809</span>  <span class="keyword">auto</span> &el = *((*block)[index]);</div> |
| <div class="line"><a name="l02810"></a><span class="lineno"> 2810</span>  *itemFirst++ = std::move(el);</div> |
| <div class="line"><a name="l02811"></a><span class="lineno"> 2811</span>  el.~T();</div> |
| <div class="line"><a name="l02812"></a><span class="lineno"> 2812</span>  ++index;</div> |
| <div class="line"><a name="l02813"></a><span class="lineno"> 2813</span>  }</div> |
| <div class="line"><a name="l02814"></a><span class="lineno"> 2814</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02815"></a><span class="lineno"> 2815</span>  MOODYCAMEL_TRY {</div> |
| <div class="line"><a name="l02816"></a><span class="lineno"> 2816</span>  <span class="keywordflow">while</span> (index != endIndex) {</div> |
| <div class="line"><a name="l02817"></a><span class="lineno"> 2817</span>  <span class="keyword">auto</span> &el = *((*block)[index]);</div> |
| <div class="line"><a name="l02818"></a><span class="lineno"> 2818</span>  *itemFirst = std::move(el);</div> |
| <div class="line"><a name="l02819"></a><span class="lineno"> 2819</span>  ++itemFirst;</div> |
| <div class="line"><a name="l02820"></a><span class="lineno"> 2820</span>  el.~T();</div> |
| <div class="line"><a name="l02821"></a><span class="lineno"> 2821</span>  ++index;</div> |
| <div class="line"><a name="l02822"></a><span class="lineno"> 2822</span>  }</div> |
| <div class="line"><a name="l02823"></a><span class="lineno"> 2823</span>  }</div> |
| <div class="line"><a name="l02824"></a><span class="lineno"> 2824</span>  MOODYCAMEL_CATCH (...) {</div> |
| <div class="line"><a name="l02825"></a><span class="lineno"> 2825</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02826"></a><span class="lineno"> 2826</span>  entry = localBlockIndex->index[indexIndex];</div> |
| <div class="line"><a name="l02827"></a><span class="lineno"> 2827</span>  block = entry->value.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02828"></a><span class="lineno"> 2828</span>  <span class="keywordflow">while</span> (index != endIndex) {</div> |
| <div class="line"><a name="l02829"></a><span class="lineno"> 2829</span>  (*block)[index++]->~T();</div> |
| <div class="line"><a name="l02830"></a><span class="lineno"> 2830</span>  }</div> |
| <div class="line"><a name="l02831"></a><span class="lineno"> 2831</span>  </div> |
| <div class="line"><a name="l02832"></a><span class="lineno"> 2832</span>  <span class="keywordflow">if</span> (block->template set_many_empty<implicit_context>(</div> |
| <div class="line"><a name="l02833"></a><span class="lineno"> 2833</span>  blockStartIndex, <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(endIndex - blockStartIndex))) {</div> |
| <div class="line"><a name="l02834"></a><span class="lineno"> 2834</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02835"></a><span class="lineno"> 2835</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l02836"></a><span class="lineno"> 2836</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02837"></a><span class="lineno"> 2837</span>  entry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02838"></a><span class="lineno"> 2838</span>  this->parent->add_block_to_free_list(block);</div> |
| <div class="line"><a name="l02839"></a><span class="lineno"> 2839</span>  }</div> |
| <div class="line"><a name="l02840"></a><span class="lineno"> 2840</span>  indexIndex = (indexIndex + 1) & (localBlockIndex->capacity - 1);</div> |
| <div class="line"><a name="l02841"></a><span class="lineno"> 2841</span>  </div> |
| <div class="line"><a name="l02842"></a><span class="lineno"> 2842</span>  blockStartIndex = index;</div> |
| <div class="line"><a name="l02843"></a><span class="lineno"> 2843</span>  endIndex = (index & ~static_cast<index_t>(BLOCK_SIZE - 1)) +</div> |
| <div class="line"><a name="l02844"></a><span class="lineno"> 2844</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(BLOCK_SIZE);</div> |
| <div class="line"><a name="l02845"></a><span class="lineno"> 2845</span>  endIndex = details::circular_less_than<index_t>(</div> |
| <div class="line"><a name="l02846"></a><span class="lineno"> 2846</span>  firstIndex + <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount), endIndex) ? firstIndex +</div> |
| <div class="line"><a name="l02847"></a><span class="lineno"> 2847</span>  <span class="keyword">static_cast<</span><a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a><span class="keyword">></span>(actualCount)</div> |
| <div class="line"><a name="l02848"></a><span class="lineno"> 2848</span>  : endIndex;</div> |
| <div class="line"><a name="l02849"></a><span class="lineno"> 2849</span>  } <span class="keywordflow">while</span> (index != firstIndex + actualCount);</div> |
| <div class="line"><a name="l02850"></a><span class="lineno"> 2850</span>  </div> |
| <div class="line"><a name="l02851"></a><span class="lineno"> 2851</span>  MOODYCAMEL_RETHROW;</div> |
| <div class="line"><a name="l02852"></a><span class="lineno"> 2852</span>  }</div> |
| <div class="line"><a name="l02853"></a><span class="lineno"> 2853</span>  }</div> |
| <div class="line"><a name="l02854"></a><span class="lineno"> 2854</span>  <span class="keywordflow">if</span> (block->template set_many_empty<implicit_context>(</div> |
| <div class="line"><a name="l02855"></a><span class="lineno"> 2855</span>  blockStartIndex, <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(endIndex - blockStartIndex))) {</div> |
| <div class="line"><a name="l02856"></a><span class="lineno"> 2856</span>  {</div> |
| <div class="line"><a name="l02857"></a><span class="lineno"> 2857</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02858"></a><span class="lineno"> 2858</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l02859"></a><span class="lineno"> 2859</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02860"></a><span class="lineno"> 2860</span>  <span class="comment">// Note that the set_many_empty above did a release, meaning that anybody who acquires the block</span></div> |
| <div class="line"><a name="l02861"></a><span class="lineno"> 2861</span>  <span class="comment">// we're about to free can use it safely since our writes (and reads!) will have happened-before then.</span></div> |
| <div class="line"><a name="l02862"></a><span class="lineno"> 2862</span>  entry->value.store(<span class="keyword">nullptr</span>, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02863"></a><span class="lineno"> 2863</span>  }</div> |
| <div class="line"><a name="l02864"></a><span class="lineno"> 2864</span>  this->parent->add_block_to_free_list(block); <span class="comment">// releases the above store</span></div> |
| <div class="line"><a name="l02865"></a><span class="lineno"> 2865</span>  }</div> |
| <div class="line"><a name="l02866"></a><span class="lineno"> 2866</span>  indexIndex = (indexIndex + 1) & (localBlockIndex->capacity - 1);</div> |
| <div class="line"><a name="l02867"></a><span class="lineno"> 2867</span>  } <span class="keywordflow">while</span> (index != firstIndex + actualCount);</div> |
| <div class="line"><a name="l02868"></a><span class="lineno"> 2868</span>  </div> |
| <div class="line"><a name="l02869"></a><span class="lineno"> 2869</span>  <span class="keywordflow">return</span> actualCount;</div> |
| <div class="line"><a name="l02870"></a><span class="lineno"> 2870</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l02871"></a><span class="lineno"> 2871</span>  this->dequeueOvercommit.fetch_add(desiredCount, std::memory_order_release);</div> |
| <div class="line"><a name="l02872"></a><span class="lineno"> 2872</span>  }</div> |
| <div class="line"><a name="l02873"></a><span class="lineno"> 2873</span>  }</div> |
| <div class="line"><a name="l02874"></a><span class="lineno"> 2874</span>  </div> |
| <div class="line"><a name="l02875"></a><span class="lineno"> 2875</span>  <span class="keywordflow">return</span> 0;</div> |
| <div class="line"><a name="l02876"></a><span class="lineno"> 2876</span>  }</div> |
| <div class="line"><a name="l02877"></a><span class="lineno"> 2877</span>  </div> |
| <div class="line"><a name="l02878"></a><span class="lineno"> 2878</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l02879"></a><span class="lineno"> 2879</span>  <span class="comment">// The block size must be > 1, so any number with the low bit set is an invalid block base index</span></div> |
| <div class="line"><a name="l02880"></a><span class="lineno"> 2880</span>  <span class="keyword">static</span> <span class="keyword">const</span> <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> INVALID_BLOCK_BASE = 1;</div> |
| <div class="line"><a name="l02881"></a><span class="lineno"> 2881</span>  </div> |
| <div class="line"><a name="l02882"></a><span class="lineno"> 2882</span>  <span class="keyword">struct </span>BlockIndexEntry {</div> |
| <div class="line"><a name="l02883"></a><span class="lineno"> 2883</span>  std::atomic<index_t> key;</div> |
| <div class="line"><a name="l02884"></a><span class="lineno"> 2884</span>  std::atomic<Block *> value;</div> |
| <div class="line"><a name="l02885"></a><span class="lineno"> 2885</span>  };</div> |
| <div class="line"><a name="l02886"></a><span class="lineno"> 2886</span>  </div> |
| <div class="line"><a name="l02887"></a><span class="lineno"> 2887</span>  <span class="keyword">struct </span>BlockIndexHeader {</div> |
| <div class="line"><a name="l02888"></a><span class="lineno"> 2888</span>  <span class="keywordtype">size_t</span> capacity;</div> |
| <div class="line"><a name="l02889"></a><span class="lineno"> 2889</span>  std::atomic<size_t> tail;</div> |
| <div class="line"><a name="l02890"></a><span class="lineno"> 2890</span>  BlockIndexEntry *entries;</div> |
| <div class="line"><a name="l02891"></a><span class="lineno"> 2891</span>  BlockIndexEntry **index;</div> |
| <div class="line"><a name="l02892"></a><span class="lineno"> 2892</span>  BlockIndexHeader *prev;</div> |
| <div class="line"><a name="l02893"></a><span class="lineno"> 2893</span>  };</div> |
| <div class="line"><a name="l02894"></a><span class="lineno"> 2894</span>  </div> |
| <div class="line"><a name="l02895"></a><span class="lineno"> 2895</span>  <span class="keyword">template</span><AllocationMode allocMode></div> |
| <div class="line"><a name="l02896"></a><span class="lineno"> 2896</span>  <span class="keyword">inline</span> <span class="keywordtype">bool</span> insert_block_index_entry(BlockIndexEntry *&idxEntry, <a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> blockStartIndex) {</div> |
| <div class="line"><a name="l02897"></a><span class="lineno"> 2897</span>  <span class="keyword">auto</span> localBlockIndex = blockIndex.load(</div> |
| <div class="line"><a name="l02898"></a><span class="lineno"> 2898</span>  std::memory_order_relaxed); <span class="comment">// We're the only writer thread, relaxed is OK</span></div> |
| <div class="line"><a name="l02899"></a><span class="lineno"> 2899</span>  <span class="keywordflow">if</span> (localBlockIndex == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02900"></a><span class="lineno"> 2900</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>; <span class="comment">// this can happen if new_block_index failed in the constructor</span></div> |
| <div class="line"><a name="l02901"></a><span class="lineno"> 2901</span>  }</div> |
| <div class="line"><a name="l02902"></a><span class="lineno"> 2902</span>  <span class="keyword">auto</span> newTail = (localBlockIndex->tail.load(std::memory_order_relaxed) + 1) &</div> |
| <div class="line"><a name="l02903"></a><span class="lineno"> 2903</span>  (localBlockIndex->capacity - 1);</div> |
| <div class="line"><a name="l02904"></a><span class="lineno"> 2904</span>  idxEntry = localBlockIndex->index[newTail];</div> |
| <div class="line"><a name="l02905"></a><span class="lineno"> 2905</span>  <span class="keywordflow">if</span> (idxEntry->key.load(std::memory_order_relaxed) == INVALID_BLOCK_BASE ||</div> |
| <div class="line"><a name="l02906"></a><span class="lineno"> 2906</span>  idxEntry->value.load(std::memory_order_relaxed) == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02907"></a><span class="lineno"> 2907</span>  </div> |
| <div class="line"><a name="l02908"></a><span class="lineno"> 2908</span>  idxEntry->key.store(blockStartIndex, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02909"></a><span class="lineno"> 2909</span>  localBlockIndex->tail.store(newTail, std::memory_order_release);</div> |
| <div class="line"><a name="l02910"></a><span class="lineno"> 2910</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02911"></a><span class="lineno"> 2911</span>  }</div> |
| <div class="line"><a name="l02912"></a><span class="lineno"> 2912</span>  </div> |
| <div class="line"><a name="l02913"></a><span class="lineno"> 2913</span>  <span class="comment">// No room in the old block index, try to allocate another one!</span></div> |
| <div class="line"><a name="l02914"></a><span class="lineno"> 2914</span>  <span class="keywordflow">if</span> (allocMode == CannotAlloc || !new_block_index()) {</div> |
| <div class="line"><a name="l02915"></a><span class="lineno"> 2915</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02916"></a><span class="lineno"> 2916</span>  }</div> |
| <div class="line"><a name="l02917"></a><span class="lineno"> 2917</span>  localBlockIndex = blockIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02918"></a><span class="lineno"> 2918</span>  newTail = (localBlockIndex->tail.load(std::memory_order_relaxed) + 1) &</div> |
| <div class="line"><a name="l02919"></a><span class="lineno"> 2919</span>  (localBlockIndex->capacity - 1);</div> |
| <div class="line"><a name="l02920"></a><span class="lineno"> 2920</span>  idxEntry = localBlockIndex->index[newTail];</div> |
| <div class="line"><a name="l02921"></a><span class="lineno"> 2921</span>  assert(idxEntry->key.load(std::memory_order_relaxed) == INVALID_BLOCK_BASE);</div> |
| <div class="line"><a name="l02922"></a><span class="lineno"> 2922</span>  idxEntry->key.store(blockStartIndex, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02923"></a><span class="lineno"> 2923</span>  localBlockIndex->tail.store(newTail, std::memory_order_release);</div> |
| <div class="line"><a name="l02924"></a><span class="lineno"> 2924</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l02925"></a><span class="lineno"> 2925</span>  }</div> |
| <div class="line"><a name="l02926"></a><span class="lineno"> 2926</span>  </div> |
| <div class="line"><a name="l02927"></a><span class="lineno"> 2927</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> rewind_block_index_tail() {</div> |
| <div class="line"><a name="l02928"></a><span class="lineno"> 2928</span>  <span class="keyword">auto</span> localBlockIndex = blockIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02929"></a><span class="lineno"> 2929</span>  localBlockIndex->tail.store((localBlockIndex->tail.load(std::memory_order_relaxed) - 1) &</div> |
| <div class="line"><a name="l02930"></a><span class="lineno"> 2930</span>  (localBlockIndex->capacity - 1), std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02931"></a><span class="lineno"> 2931</span>  }</div> |
| <div class="line"><a name="l02932"></a><span class="lineno"> 2932</span>  </div> |
| <div class="line"><a name="l02933"></a><span class="lineno"> 2933</span>  <span class="keyword">inline</span> BlockIndexEntry *get_block_index_entry_for_index(<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> index)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l02934"></a><span class="lineno"> 2934</span>  BlockIndexHeader *localBlockIndex;</div> |
| <div class="line"><a name="l02935"></a><span class="lineno"> 2935</span>  <span class="keyword">auto</span> idx = get_block_index_index_for_index(index, localBlockIndex);</div> |
| <div class="line"><a name="l02936"></a><span class="lineno"> 2936</span>  <span class="keywordflow">return</span> localBlockIndex->index[idx];</div> |
| <div class="line"><a name="l02937"></a><span class="lineno"> 2937</span>  }</div> |
| <div class="line"><a name="l02938"></a><span class="lineno"> 2938</span>  </div> |
| <div class="line"><a name="l02939"></a><span class="lineno"> 2939</span>  <span class="keyword">inline</span> <span class="keywordtype">size_t</span></div> |
| <div class="line"><a name="l02940"></a><span class="lineno"> 2940</span>  get_block_index_index_for_index(<a class="code" href="namespacedmlc.html#a7a89c6e0909617034aa818dafe83a361">index_t</a> index, BlockIndexHeader *&localBlockIndex)<span class="keyword"> const </span>{</div> |
| <div class="line"><a name="l02941"></a><span class="lineno"> 2941</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l02942"></a><span class="lineno"> 2942</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(mutex);</div> |
| <div class="line"><a name="l02943"></a><span class="lineno"> 2943</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l02944"></a><span class="lineno"> 2944</span>  index &= ~static_cast<index_t>(BLOCK_SIZE - 1);</div> |
| <div class="line"><a name="l02945"></a><span class="lineno"> 2945</span>  localBlockIndex = blockIndex.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02946"></a><span class="lineno"> 2946</span>  <span class="keyword">auto</span> tail = localBlockIndex->tail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l02947"></a><span class="lineno"> 2947</span>  <span class="keyword">auto</span> tailBase = localBlockIndex->index[tail]->key.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02948"></a><span class="lineno"> 2948</span>  assert(tailBase != INVALID_BLOCK_BASE);</div> |
| <div class="line"><a name="l02949"></a><span class="lineno"> 2949</span>  <span class="comment">// Note: Must use division instead of shift because the index may wrap around, causing a negative</span></div> |
| <div class="line"><a name="l02950"></a><span class="lineno"> 2950</span>  <span class="comment">// offset, whose negativity we want to preserve</span></div> |
| <div class="line"><a name="l02951"></a><span class="lineno"> 2951</span>  <span class="keyword">auto</span> offset = <span class="keyword">static_cast<</span><span class="keywordtype">size_t</span><span class="keyword">></span>(</div> |
| <div class="line"><a name="l02952"></a><span class="lineno"> 2952</span>  <span class="keyword">static_cast<</span>typename std::make_signed<index_t>::type<span class="keyword">></span>(index - tailBase) / BLOCK_SIZE);</div> |
| <div class="line"><a name="l02953"></a><span class="lineno"> 2953</span>  <span class="keywordtype">size_t</span> idx = (tail + offset) & (localBlockIndex->capacity - 1);</div> |
| <div class="line"><a name="l02954"></a><span class="lineno"> 2954</span>  assert(localBlockIndex->index[idx]->key.load(std::memory_order_relaxed) == index &&</div> |
| <div class="line"><a name="l02955"></a><span class="lineno"> 2955</span>  localBlockIndex->index[idx]->value.load(std::memory_order_relaxed) != <span class="keyword">nullptr</span>);</div> |
| <div class="line"><a name="l02956"></a><span class="lineno"> 2956</span>  <span class="keywordflow">return</span> idx;</div> |
| <div class="line"><a name="l02957"></a><span class="lineno"> 2957</span>  }</div> |
| <div class="line"><a name="l02958"></a><span class="lineno"> 2958</span>  </div> |
| <div class="line"><a name="l02959"></a><span class="lineno"> 2959</span>  <span class="keywordtype">bool</span> new_block_index() {</div> |
| <div class="line"><a name="l02960"></a><span class="lineno"> 2960</span>  <span class="keyword">auto</span> prev = blockIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02961"></a><span class="lineno"> 2961</span>  <span class="keywordtype">size_t</span> prevCapacity = prev == <span class="keyword">nullptr</span> ? 0 : prev->capacity;</div> |
| <div class="line"><a name="l02962"></a><span class="lineno"> 2962</span>  <span class="keyword">auto</span> entryCount = prev == <span class="keyword">nullptr</span> ? nextBlockIndexCapacity : prevCapacity;</div> |
| <div class="line"><a name="l02963"></a><span class="lineno"> 2963</span>  <span class="keyword">auto</span> raw = <span class="keyword">static_cast<</span><span class="keywordtype">char</span> *<span class="keyword">></span>((Traits::malloc)(</div> |
| <div class="line"><a name="l02964"></a><span class="lineno"> 2964</span>  <span class="keyword">sizeof</span>(BlockIndexHeader) +</div> |
| <div class="line"><a name="l02965"></a><span class="lineno"> 2965</span>  std::alignment_of<BlockIndexEntry>::value - 1 + <span class="keyword">sizeof</span>(BlockIndexEntry) * entryCount +</div> |
| <div class="line"><a name="l02966"></a><span class="lineno"> 2966</span>  std::alignment_of<BlockIndexEntry *>::value - 1 +</div> |
| <div class="line"><a name="l02967"></a><span class="lineno"> 2967</span>  <span class="keyword">sizeof</span>(BlockIndexEntry * ) * nextBlockIndexCapacity));</div> |
| <div class="line"><a name="l02968"></a><span class="lineno"> 2968</span>  <span class="keywordflow">if</span> (raw == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02969"></a><span class="lineno"> 2969</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l02970"></a><span class="lineno"> 2970</span>  }</div> |
| <div class="line"><a name="l02971"></a><span class="lineno"> 2971</span>  </div> |
| <div class="line"><a name="l02972"></a><span class="lineno"> 2972</span>  <span class="keyword">auto</span> header = <span class="keyword">new</span>(raw) BlockIndexHeader;</div> |
| <div class="line"><a name="l02973"></a><span class="lineno"> 2973</span>  <span class="keyword">auto</span> entries = <span class="keyword">reinterpret_cast<</span>BlockIndexEntry *<span class="keyword">></span>(details::align_for<BlockIndexEntry>(</div> |
| <div class="line"><a name="l02974"></a><span class="lineno"> 2974</span>  raw + <span class="keyword">sizeof</span>(BlockIndexHeader)));</div> |
| <div class="line"><a name="l02975"></a><span class="lineno"> 2975</span>  <span class="keyword">auto</span> index = <span class="keyword">reinterpret_cast<</span>BlockIndexEntry **<span class="keyword">></span>(details::align_for<BlockIndexEntry *>(</div> |
| <div class="line"><a name="l02976"></a><span class="lineno"> 2976</span>  <span class="keyword">reinterpret_cast<</span><span class="keywordtype">char</span> *<span class="keyword">></span>(entries) + <span class="keyword">sizeof</span>(BlockIndexEntry) * entryCount));</div> |
| <div class="line"><a name="l02977"></a><span class="lineno"> 2977</span>  <span class="keywordflow">if</span> (prev != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l02978"></a><span class="lineno"> 2978</span>  <span class="keyword">auto</span> prevTail = prev->tail.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02979"></a><span class="lineno"> 2979</span>  <span class="keyword">auto</span> prevPos = prevTail;</div> |
| <div class="line"><a name="l02980"></a><span class="lineno"> 2980</span>  <span class="keywordtype">size_t</span> i = 0;</div> |
| <div class="line"><a name="l02981"></a><span class="lineno"> 2981</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l02982"></a><span class="lineno"> 2982</span>  prevPos = (prevPos + 1) & (prev->capacity - 1);</div> |
| <div class="line"><a name="l02983"></a><span class="lineno"> 2983</span>  index[i++] = prev->index[prevPos];</div> |
| <div class="line"><a name="l02984"></a><span class="lineno"> 2984</span>  } <span class="keywordflow">while</span> (prevPos != prevTail);</div> |
| <div class="line"><a name="l02985"></a><span class="lineno"> 2985</span>  assert(i == prevCapacity);</div> |
| <div class="line"><a name="l02986"></a><span class="lineno"> 2986</span>  }</div> |
| <div class="line"><a name="l02987"></a><span class="lineno"> 2987</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != entryCount; ++i) {</div> |
| <div class="line"><a name="l02988"></a><span class="lineno"> 2988</span>  <span class="keyword">new</span>(entries + i) BlockIndexEntry;</div> |
| <div class="line"><a name="l02989"></a><span class="lineno"> 2989</span>  entries[i].key.store(INVALID_BLOCK_BASE, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02990"></a><span class="lineno"> 2990</span>  index[prevCapacity + i] = entries + i;</div> |
| <div class="line"><a name="l02991"></a><span class="lineno"> 2991</span>  }</div> |
| <div class="line"><a name="l02992"></a><span class="lineno"> 2992</span>  header->prev = prev;</div> |
| <div class="line"><a name="l02993"></a><span class="lineno"> 2993</span>  header->entries = entries;</div> |
| <div class="line"><a name="l02994"></a><span class="lineno"> 2994</span>  header->index = index;</div> |
| <div class="line"><a name="l02995"></a><span class="lineno"> 2995</span>  header->capacity = nextBlockIndexCapacity;</div> |
| <div class="line"><a name="l02996"></a><span class="lineno"> 2996</span>  header->tail.store((prevCapacity - 1) & (nextBlockIndexCapacity - 1),</div> |
| <div class="line"><a name="l02997"></a><span class="lineno"> 2997</span>  std::memory_order_relaxed);</div> |
| <div class="line"><a name="l02998"></a><span class="lineno"> 2998</span>  </div> |
| <div class="line"><a name="l02999"></a><span class="lineno"> 2999</span>  blockIndex.store(header, std::memory_order_release);</div> |
| <div class="line"><a name="l03000"></a><span class="lineno"> 3000</span>  </div> |
| <div class="line"><a name="l03001"></a><span class="lineno"> 3001</span>  nextBlockIndexCapacity <<= 1;</div> |
| <div class="line"><a name="l03002"></a><span class="lineno"> 3002</span>  </div> |
| <div class="line"><a name="l03003"></a><span class="lineno"> 3003</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l03004"></a><span class="lineno"> 3004</span>  }</div> |
| <div class="line"><a name="l03005"></a><span class="lineno"> 3005</span>  </div> |
| <div class="line"><a name="l03006"></a><span class="lineno"> 3006</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l03007"></a><span class="lineno"> 3007</span>  <span class="keywordtype">size_t</span> nextBlockIndexCapacity;</div> |
| <div class="line"><a name="l03008"></a><span class="lineno"> 3008</span>  std::atomic<BlockIndexHeader *> blockIndex;</div> |
| <div class="line"><a name="l03009"></a><span class="lineno"> 3009</span>  </div> |
| <div class="line"><a name="l03010"></a><span class="lineno"> 3010</span> <span class="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l03011"></a><span class="lineno"> 3011</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l03012"></a><span class="lineno"> 3012</span>  details::ThreadExitListener threadExitListener;</div> |
| <div class="line"><a name="l03013"></a><span class="lineno"> 3013</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l03014"></a><span class="lineno"> 3014</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03015"></a><span class="lineno"> 3015</span>  </div> |
| <div class="line"><a name="l03016"></a><span class="lineno"> 3016</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l03017"></a><span class="lineno"> 3017</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l03018"></a><span class="lineno"> 3018</span>  ImplicitProducer* nextImplicitProducer;</div> |
| <div class="line"><a name="l03019"></a><span class="lineno"> 3019</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l03020"></a><span class="lineno"> 3020</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03021"></a><span class="lineno"> 3021</span>  </div> |
| <div class="line"><a name="l03022"></a><span class="lineno"> 3022</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODBLOCKINDEX</span></div> |
| <div class="line"><a name="l03023"></a><span class="lineno"> 3023</span>  <span class="keyword">mutable</span> debug::DebugMutex mutex;</div> |
| <div class="line"><a name="l03024"></a><span class="lineno"> 3024</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03025"></a><span class="lineno"> 3025</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l03026"></a><span class="lineno"> 3026</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>MemStats;</div> |
| <div class="line"><a name="l03027"></a><span class="lineno"> 3027</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03028"></a><span class="lineno"> 3028</span>  };</div> |
| <div class="line"><a name="l03029"></a><span class="lineno"> 3029</span>  </div> |
| <div class="line"><a name="l03030"></a><span class="lineno"> 3030</span>  </div> |
| <div class="line"><a name="l03032"></a><span class="lineno"> 3032</span>  <span class="comment">// Block pool manipulation</span></div> |
| <div class="line"><a name="l03034"></a><span class="lineno"> 3034</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l03035"></a><span class="lineno"> 3035</span>  <span class="keywordtype">void</span> populate_initial_block_list(<span class="keywordtype">size_t</span> blockCount) {</div> |
| <div class="line"><a name="l03036"></a><span class="lineno"> 3036</span>  initialBlockPoolSize = blockCount;</div> |
| <div class="line"><a name="l03037"></a><span class="lineno"> 3037</span>  <span class="keywordflow">if</span> (initialBlockPoolSize == 0) {</div> |
| <div class="line"><a name="l03038"></a><span class="lineno"> 3038</span>  initialBlockPool = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03039"></a><span class="lineno"> 3039</span>  <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l03040"></a><span class="lineno"> 3040</span>  }</div> |
| <div class="line"><a name="l03041"></a><span class="lineno"> 3041</span>  </div> |
| <div class="line"><a name="l03042"></a><span class="lineno"> 3042</span>  initialBlockPool = create_array<Block>(blockCount);</div> |
| <div class="line"><a name="l03043"></a><span class="lineno"> 3043</span>  <span class="keywordflow">if</span> (initialBlockPool == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03044"></a><span class="lineno"> 3044</span>  initialBlockPoolSize = 0;</div> |
| <div class="line"><a name="l03045"></a><span class="lineno"> 3045</span>  }</div> |
| <div class="line"><a name="l03046"></a><span class="lineno"> 3046</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i < initialBlockPoolSize; ++i) {</div> |
| <div class="line"><a name="l03047"></a><span class="lineno"> 3047</span>  initialBlockPool[i].dynamicallyAllocated = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l03048"></a><span class="lineno"> 3048</span>  }</div> |
| <div class="line"><a name="l03049"></a><span class="lineno"> 3049</span>  }</div> |
| <div class="line"><a name="l03050"></a><span class="lineno"> 3050</span>  </div> |
| <div class="line"><a name="l03051"></a><span class="lineno"> 3051</span>  <span class="keyword">inline</span> Block *try_get_block_from_initial_pool() {</div> |
| <div class="line"><a name="l03052"></a><span class="lineno"> 3052</span>  <span class="keywordflow">if</span> (initialBlockPoolIndex.load(std::memory_order_relaxed) >= initialBlockPoolSize) {</div> |
| <div class="line"><a name="l03053"></a><span class="lineno"> 3053</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03054"></a><span class="lineno"> 3054</span>  }</div> |
| <div class="line"><a name="l03055"></a><span class="lineno"> 3055</span>  </div> |
| <div class="line"><a name="l03056"></a><span class="lineno"> 3056</span>  <span class="keyword">auto</span> index = initialBlockPoolIndex.fetch_add(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03057"></a><span class="lineno"> 3057</span>  </div> |
| <div class="line"><a name="l03058"></a><span class="lineno"> 3058</span>  <span class="keywordflow">return</span> index < initialBlockPoolSize ? (initialBlockPool + index) : <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03059"></a><span class="lineno"> 3059</span>  }</div> |
| <div class="line"><a name="l03060"></a><span class="lineno"> 3060</span>  </div> |
| <div class="line"><a name="l03061"></a><span class="lineno"> 3061</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> add_block_to_free_list(Block *block) {</div> |
| <div class="line"><a name="l03062"></a><span class="lineno"> 3062</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l03063"></a><span class="lineno"> 3063</span>  block->owner = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03064"></a><span class="lineno"> 3064</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03065"></a><span class="lineno"> 3065</span>  freeList.add(block);</div> |
| <div class="line"><a name="l03066"></a><span class="lineno"> 3066</span>  }</div> |
| <div class="line"><a name="l03067"></a><span class="lineno"> 3067</span>  </div> |
| <div class="line"><a name="l03068"></a><span class="lineno"> 3068</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> add_blocks_to_free_list(Block *block) {</div> |
| <div class="line"><a name="l03069"></a><span class="lineno"> 3069</span>  <span class="keywordflow">while</span> (block != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03070"></a><span class="lineno"> 3070</span>  <span class="keyword">auto</span> next = block->next;</div> |
| <div class="line"><a name="l03071"></a><span class="lineno"> 3071</span>  add_block_to_free_list(block);</div> |
| <div class="line"><a name="l03072"></a><span class="lineno"> 3072</span>  block = next;</div> |
| <div class="line"><a name="l03073"></a><span class="lineno"> 3073</span>  }</div> |
| <div class="line"><a name="l03074"></a><span class="lineno"> 3074</span>  }</div> |
| <div class="line"><a name="l03075"></a><span class="lineno"> 3075</span>  </div> |
| <div class="line"><a name="l03076"></a><span class="lineno"> 3076</span>  <span class="keyword">inline</span> Block *try_get_block_from_free_list() {</div> |
| <div class="line"><a name="l03077"></a><span class="lineno"> 3077</span>  <span class="keywordflow">return</span> freeList.try_get();</div> |
| <div class="line"><a name="l03078"></a><span class="lineno"> 3078</span>  }</div> |
| <div class="line"><a name="l03079"></a><span class="lineno"> 3079</span>  </div> |
| <div class="line"><a name="l03080"></a><span class="lineno"> 3080</span>  <span class="comment">// Gets a free block from one of the memory pools, or allocates a new one (if applicable)</span></div> |
| <div class="line"><a name="l03081"></a><span class="lineno"> 3081</span>  <span class="keyword">template</span><AllocationMode canAlloc></div> |
| <div class="line"><a name="l03082"></a><span class="lineno"> 3082</span>  Block *requisition_block() {</div> |
| <div class="line"><a name="l03083"></a><span class="lineno"> 3083</span>  <span class="keyword">auto</span> block = try_get_block_from_initial_pool();</div> |
| <div class="line"><a name="l03084"></a><span class="lineno"> 3084</span>  <span class="keywordflow">if</span> (block != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03085"></a><span class="lineno"> 3085</span>  <span class="keywordflow">return</span> block;</div> |
| <div class="line"><a name="l03086"></a><span class="lineno"> 3086</span>  }</div> |
| <div class="line"><a name="l03087"></a><span class="lineno"> 3087</span>  </div> |
| <div class="line"><a name="l03088"></a><span class="lineno"> 3088</span>  block = try_get_block_from_free_list();</div> |
| <div class="line"><a name="l03089"></a><span class="lineno"> 3089</span>  <span class="keywordflow">if</span> (block != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03090"></a><span class="lineno"> 3090</span>  <span class="keywordflow">return</span> block;</div> |
| <div class="line"><a name="l03091"></a><span class="lineno"> 3091</span>  }</div> |
| <div class="line"><a name="l03092"></a><span class="lineno"> 3092</span>  </div> |
| <div class="line"><a name="l03093"></a><span class="lineno"> 3093</span>  <span class="keywordflow">if</span> (canAlloc == CanAlloc) {</div> |
| <div class="line"><a name="l03094"></a><span class="lineno"> 3094</span>  <span class="keywordflow">return</span> create<Block>();</div> |
| <div class="line"><a name="l03095"></a><span class="lineno"> 3095</span>  }</div> |
| <div class="line"><a name="l03096"></a><span class="lineno"> 3096</span>  </div> |
| <div class="line"><a name="l03097"></a><span class="lineno"> 3097</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03098"></a><span class="lineno"> 3098</span>  }</div> |
| <div class="line"><a name="l03099"></a><span class="lineno"> 3099</span>  </div> |
| <div class="line"><a name="l03100"></a><span class="lineno"> 3100</span>  </div> |
| <div class="line"><a name="l03101"></a><span class="lineno"> 3101</span> <span class="preprocessor">#if MCDBGQ_TRACKMEM</span></div> |
| <div class="line"><a name="l03102"></a><span class="lineno"> 3102</span>  <span class="keyword">public</span>:</div> |
| <div class="line"><a name="l03103"></a><span class="lineno"> 3103</span>  <span class="keyword">struct </span>MemStats {</div> |
| <div class="line"><a name="l03104"></a><span class="lineno"> 3104</span>  <span class="keywordtype">size_t</span> allocatedBlocks;</div> |
| <div class="line"><a name="l03105"></a><span class="lineno"> 3105</span>  <span class="keywordtype">size_t</span> usedBlocks;</div> |
| <div class="line"><a name="l03106"></a><span class="lineno"> 3106</span>  <span class="keywordtype">size_t</span> freeBlocks;</div> |
| <div class="line"><a name="l03107"></a><span class="lineno"> 3107</span>  <span class="keywordtype">size_t</span> ownedBlocksExplicit;</div> |
| <div class="line"><a name="l03108"></a><span class="lineno"> 3108</span>  <span class="keywordtype">size_t</span> ownedBlocksImplicit;</div> |
| <div class="line"><a name="l03109"></a><span class="lineno"> 3109</span>  <span class="keywordtype">size_t</span> implicitProducers;</div> |
| <div class="line"><a name="l03110"></a><span class="lineno"> 3110</span>  <span class="keywordtype">size_t</span> explicitProducers;</div> |
| <div class="line"><a name="l03111"></a><span class="lineno"> 3111</span>  <span class="keywordtype">size_t</span> elementsEnqueued;</div> |
| <div class="line"><a name="l03112"></a><span class="lineno"> 3112</span>  <span class="keywordtype">size_t</span> blockClassBytes;</div> |
| <div class="line"><a name="l03113"></a><span class="lineno"> 3113</span>  <span class="keywordtype">size_t</span> queueClassBytes;</div> |
| <div class="line"><a name="l03114"></a><span class="lineno"> 3114</span>  <span class="keywordtype">size_t</span> implicitBlockIndexBytes;</div> |
| <div class="line"><a name="l03115"></a><span class="lineno"> 3115</span>  <span class="keywordtype">size_t</span> explicitBlockIndexBytes;</div> |
| <div class="line"><a name="l03116"></a><span class="lineno"> 3116</span>  </div> |
| <div class="line"><a name="l03117"></a><span class="lineno"> 3117</span>  <span class="keyword">friend</span> <span class="keyword">class </span>ConcurrentQueue;</div> |
| <div class="line"><a name="l03118"></a><span class="lineno"> 3118</span>  </div> |
| <div class="line"><a name="l03119"></a><span class="lineno"> 3119</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l03120"></a><span class="lineno"> 3120</span>  <span class="keyword">static</span> MemStats getFor(ConcurrentQueue* q)</div> |
| <div class="line"><a name="l03121"></a><span class="lineno"> 3121</span>  {</div> |
| <div class="line"><a name="l03122"></a><span class="lineno"> 3122</span>  MemStats stats = { 0 };</div> |
| <div class="line"><a name="l03123"></a><span class="lineno"> 3123</span>  </div> |
| <div class="line"><a name="l03124"></a><span class="lineno"> 3124</span>  stats.elementsEnqueued = q->size_approx();</div> |
| <div class="line"><a name="l03125"></a><span class="lineno"> 3125</span>  </div> |
| <div class="line"><a name="l03126"></a><span class="lineno"> 3126</span>  <span class="keyword">auto</span> block = q->freeList.head_unsafe();</div> |
| <div class="line"><a name="l03127"></a><span class="lineno"> 3127</span>  <span class="keywordflow">while</span> (block != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03128"></a><span class="lineno"> 3128</span>  ++stats.allocatedBlocks;</div> |
| <div class="line"><a name="l03129"></a><span class="lineno"> 3129</span>  ++stats.freeBlocks;</div> |
| <div class="line"><a name="l03130"></a><span class="lineno"> 3130</span>  block = block->freeListNext.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03131"></a><span class="lineno"> 3131</span>  }</div> |
| <div class="line"><a name="l03132"></a><span class="lineno"> 3132</span>  </div> |
| <div class="line"><a name="l03133"></a><span class="lineno"> 3133</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = q->producerListTail.load(std::memory_order_acquire); ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l03134"></a><span class="lineno"> 3134</span>  <span class="keywordtype">bool</span> implicit = <span class="keyword">dynamic_cast<</span>ImplicitProducer*<span class="keyword">></span>(ptr) != <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03135"></a><span class="lineno"> 3135</span>  stats.implicitProducers += implicit ? 1 : 0;</div> |
| <div class="line"><a name="l03136"></a><span class="lineno"> 3136</span>  stats.explicitProducers += implicit ? 0 : 1;</div> |
| <div class="line"><a name="l03137"></a><span class="lineno"> 3137</span>  </div> |
| <div class="line"><a name="l03138"></a><span class="lineno"> 3138</span>  <span class="keywordflow">if</span> (implicit) {</div> |
| <div class="line"><a name="l03139"></a><span class="lineno"> 3139</span>  <span class="keyword">auto</span> prod = <span class="keyword">static_cast<</span>ImplicitProducer*<span class="keyword">></span>(ptr);</div> |
| <div class="line"><a name="l03140"></a><span class="lineno"> 3140</span>  stats.queueClassBytes += <span class="keyword">sizeof</span>(ImplicitProducer);</div> |
| <div class="line"><a name="l03141"></a><span class="lineno"> 3141</span>  <span class="keyword">auto</span> head = prod->headIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03142"></a><span class="lineno"> 3142</span>  <span class="keyword">auto</span> tail = prod->tailIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03143"></a><span class="lineno"> 3143</span>  <span class="keyword">auto</span> hash = prod->blockIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03144"></a><span class="lineno"> 3144</span>  <span class="keywordflow">if</span> (hash != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03145"></a><span class="lineno"> 3145</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != hash->capacity; ++i) {</div> |
| <div class="line"><a name="l03146"></a><span class="lineno"> 3146</span>  <span class="keywordflow">if</span> (hash->index[i]->key.load(std::memory_order_relaxed) != ImplicitProducer::INVALID_BLOCK_BASE && hash->index[i]->value.load(std::memory_order_relaxed) != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03147"></a><span class="lineno"> 3147</span>  ++stats.allocatedBlocks;</div> |
| <div class="line"><a name="l03148"></a><span class="lineno"> 3148</span>  ++stats.ownedBlocksImplicit;</div> |
| <div class="line"><a name="l03149"></a><span class="lineno"> 3149</span>  }</div> |
| <div class="line"><a name="l03150"></a><span class="lineno"> 3150</span>  }</div> |
| <div class="line"><a name="l03151"></a><span class="lineno"> 3151</span>  stats.implicitBlockIndexBytes += hash->capacity * <span class="keyword">sizeof</span>(<span class="keyword">typename</span> ImplicitProducer::BlockIndexEntry);</div> |
| <div class="line"><a name="l03152"></a><span class="lineno"> 3152</span>  <span class="keywordflow">for</span> (; hash != <span class="keyword">nullptr</span>; hash = hash->prev) {</div> |
| <div class="line"><a name="l03153"></a><span class="lineno"> 3153</span>  stats.implicitBlockIndexBytes += <span class="keyword">sizeof</span>(<span class="keyword">typename</span> ImplicitProducer::BlockIndexHeader) + hash->capacity * <span class="keyword">sizeof</span>(<span class="keyword">typename</span> ImplicitProducer::BlockIndexEntry*);</div> |
| <div class="line"><a name="l03154"></a><span class="lineno"> 3154</span>  }</div> |
| <div class="line"><a name="l03155"></a><span class="lineno"> 3155</span>  }</div> |
| <div class="line"><a name="l03156"></a><span class="lineno"> 3156</span>  <span class="keywordflow">for</span> (; details::circular_less_than<index_t>(head, tail); head += BLOCK_SIZE) {</div> |
| <div class="line"><a name="l03157"></a><span class="lineno"> 3157</span>  <span class="comment">//auto block = prod->get_block_index_entry_for_index(head);</span></div> |
| <div class="line"><a name="l03158"></a><span class="lineno"> 3158</span>  ++stats.usedBlocks;</div> |
| <div class="line"><a name="l03159"></a><span class="lineno"> 3159</span>  }</div> |
| <div class="line"><a name="l03160"></a><span class="lineno"> 3160</span>  }</div> |
| <div class="line"><a name="l03161"></a><span class="lineno"> 3161</span>  <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l03162"></a><span class="lineno"> 3162</span>  <span class="keyword">auto</span> prod = <span class="keyword">static_cast<</span>ExplicitProducer*<span class="keyword">></span>(ptr);</div> |
| <div class="line"><a name="l03163"></a><span class="lineno"> 3163</span>  stats.queueClassBytes += <span class="keyword">sizeof</span>(ExplicitProducer);</div> |
| <div class="line"><a name="l03164"></a><span class="lineno"> 3164</span>  <span class="keyword">auto</span> tailBlock = prod->tailBlock;</div> |
| <div class="line"><a name="l03165"></a><span class="lineno"> 3165</span>  <span class="keywordtype">bool</span> wasNonEmpty = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l03166"></a><span class="lineno"> 3166</span>  <span class="keywordflow">if</span> (tailBlock != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03167"></a><span class="lineno"> 3167</span>  <span class="keyword">auto</span> block = tailBlock;</div> |
| <div class="line"><a name="l03168"></a><span class="lineno"> 3168</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l03169"></a><span class="lineno"> 3169</span>  ++stats.allocatedBlocks;</div> |
| <div class="line"><a name="l03170"></a><span class="lineno"> 3170</span>  <span class="keywordflow">if</span> (!block->template is_empty<explicit_context>() || wasNonEmpty) {</div> |
| <div class="line"><a name="l03171"></a><span class="lineno"> 3171</span>  ++stats.usedBlocks;</div> |
| <div class="line"><a name="l03172"></a><span class="lineno"> 3172</span>  wasNonEmpty = wasNonEmpty || block != tailBlock;</div> |
| <div class="line"><a name="l03173"></a><span class="lineno"> 3173</span>  }</div> |
| <div class="line"><a name="l03174"></a><span class="lineno"> 3174</span>  ++stats.ownedBlocksExplicit;</div> |
| <div class="line"><a name="l03175"></a><span class="lineno"> 3175</span>  block = block->next;</div> |
| <div class="line"><a name="l03176"></a><span class="lineno"> 3176</span>  } <span class="keywordflow">while</span> (block != tailBlock);</div> |
| <div class="line"><a name="l03177"></a><span class="lineno"> 3177</span>  }</div> |
| <div class="line"><a name="l03178"></a><span class="lineno"> 3178</span>  <span class="keyword">auto</span> index = prod->blockIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03179"></a><span class="lineno"> 3179</span>  <span class="keywordflow">while</span> (index != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03180"></a><span class="lineno"> 3180</span>  stats.explicitBlockIndexBytes += <span class="keyword">sizeof</span>(<span class="keyword">typename</span> ExplicitProducer::BlockIndexHeader) + index->size * <span class="keyword">sizeof</span>(<span class="keyword">typename</span> ExplicitProducer::BlockIndexEntry);</div> |
| <div class="line"><a name="l03181"></a><span class="lineno"> 3181</span>  index = <span class="keyword">static_cast<</span>typename ExplicitProducer::BlockIndexHeader*<span class="keyword">></span>(index->prev);</div> |
| <div class="line"><a name="l03182"></a><span class="lineno"> 3182</span>  }</div> |
| <div class="line"><a name="l03183"></a><span class="lineno"> 3183</span>  }</div> |
| <div class="line"><a name="l03184"></a><span class="lineno"> 3184</span>  }</div> |
| <div class="line"><a name="l03185"></a><span class="lineno"> 3185</span>  </div> |
| <div class="line"><a name="l03186"></a><span class="lineno"> 3186</span>  <span class="keyword">auto</span> freeOnInitialPool = q->initialBlockPoolIndex.load(std::memory_order_relaxed) >= q->initialBlockPoolSize ? 0 : q->initialBlockPoolSize - q->initialBlockPoolIndex.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03187"></a><span class="lineno"> 3187</span>  stats.allocatedBlocks += freeOnInitialPool;</div> |
| <div class="line"><a name="l03188"></a><span class="lineno"> 3188</span>  stats.freeBlocks += freeOnInitialPool;</div> |
| <div class="line"><a name="l03189"></a><span class="lineno"> 3189</span>  </div> |
| <div class="line"><a name="l03190"></a><span class="lineno"> 3190</span>  stats.blockClassBytes = <span class="keyword">sizeof</span>(Block) * stats.allocatedBlocks;</div> |
| <div class="line"><a name="l03191"></a><span class="lineno"> 3191</span>  stats.queueClassBytes += <span class="keyword">sizeof</span>(ConcurrentQueue);</div> |
| <div class="line"><a name="l03192"></a><span class="lineno"> 3192</span>  </div> |
| <div class="line"><a name="l03193"></a><span class="lineno"> 3193</span>  <span class="keywordflow">return</span> stats;</div> |
| <div class="line"><a name="l03194"></a><span class="lineno"> 3194</span>  }</div> |
| <div class="line"><a name="l03195"></a><span class="lineno"> 3195</span>  };</div> |
| <div class="line"><a name="l03196"></a><span class="lineno"> 3196</span>  </div> |
| <div class="line"><a name="l03197"></a><span class="lineno"> 3197</span>  <span class="comment">// For debugging only. Not thread-safe.</span></div> |
| <div class="line"><a name="l03198"></a><span class="lineno"> 3198</span>  MemStats getMemStats()</div> |
| <div class="line"><a name="l03199"></a><span class="lineno"> 3199</span>  {</div> |
| <div class="line"><a name="l03200"></a><span class="lineno"> 3200</span>  <span class="keywordflow">return</span> MemStats::getFor(<span class="keyword">this</span>);</div> |
| <div class="line"><a name="l03201"></a><span class="lineno"> 3201</span>  }</div> |
| <div class="line"><a name="l03202"></a><span class="lineno"> 3202</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l03203"></a><span class="lineno"> 3203</span>  <span class="keyword">friend</span> <span class="keyword">struct </span>MemStats;</div> |
| <div class="line"><a name="l03204"></a><span class="lineno"> 3204</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03205"></a><span class="lineno"> 3205</span>  </div> |
| <div class="line"><a name="l03206"></a><span class="lineno"> 3206</span>  </div> |
| <div class="line"><a name="l03208"></a><span class="lineno"> 3208</span>  <span class="comment">// Producer list manipulation</span></div> |
| <div class="line"><a name="l03210"></a><span class="lineno"> 3210</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l03211"></a><span class="lineno"> 3211</span>  ProducerBase *recycle_or_create_producer(<span class="keywordtype">bool</span> isExplicit) {</div> |
| <div class="line"><a name="l03212"></a><span class="lineno"> 3212</span>  <span class="keywordtype">bool</span> recycled;</div> |
| <div class="line"><a name="l03213"></a><span class="lineno"> 3213</span>  <span class="keywordflow">return</span> recycle_or_create_producer(isExplicit, recycled);</div> |
| <div class="line"><a name="l03214"></a><span class="lineno"> 3214</span>  }</div> |
| <div class="line"><a name="l03215"></a><span class="lineno"> 3215</span>  </div> |
| <div class="line"><a name="l03216"></a><span class="lineno"> 3216</span>  ProducerBase *recycle_or_create_producer(<span class="keywordtype">bool</span> isExplicit, <span class="keywordtype">bool</span> &recycled) {</div> |
| <div class="line"><a name="l03217"></a><span class="lineno"> 3217</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH</span></div> |
| <div class="line"><a name="l03218"></a><span class="lineno"> 3218</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(implicitProdMutex);</div> |
| <div class="line"><a name="l03219"></a><span class="lineno"> 3219</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03220"></a><span class="lineno"> 3220</span>  <span class="comment">// Try to re-use one first</span></div> |
| <div class="line"><a name="l03221"></a><span class="lineno"> 3221</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l03222"></a><span class="lineno"> 3222</span>  ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l03223"></a><span class="lineno"> 3223</span>  <span class="keywordflow">if</span> (ptr->inactive.load(std::memory_order_relaxed) && ptr->isExplicit == isExplicit) {</div> |
| <div class="line"><a name="l03224"></a><span class="lineno"> 3224</span>  <span class="keywordtype">bool</span> expected = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l03225"></a><span class="lineno"> 3225</span>  <span class="keywordflow">if</span> (ptr->inactive.compare_exchange_strong(expected, <span class="comment">/* desired */</span> <span class="keyword">false</span>,</div> |
| <div class="line"><a name="l03226"></a><span class="lineno"> 3226</span>  std::memory_order_acquire,</div> |
| <div class="line"><a name="l03227"></a><span class="lineno"> 3227</span>  std::memory_order_relaxed)) {</div> |
| <div class="line"><a name="l03228"></a><span class="lineno"> 3228</span>  <span class="comment">// We caught one! It's been marked as activated, the caller can have it</span></div> |
| <div class="line"><a name="l03229"></a><span class="lineno"> 3229</span>  recycled = <span class="keyword">true</span>;</div> |
| <div class="line"><a name="l03230"></a><span class="lineno"> 3230</span>  <span class="keywordflow">return</span> ptr;</div> |
| <div class="line"><a name="l03231"></a><span class="lineno"> 3231</span>  }</div> |
| <div class="line"><a name="l03232"></a><span class="lineno"> 3232</span>  }</div> |
| <div class="line"><a name="l03233"></a><span class="lineno"> 3233</span>  }</div> |
| <div class="line"><a name="l03234"></a><span class="lineno"> 3234</span>  </div> |
| <div class="line"><a name="l03235"></a><span class="lineno"> 3235</span>  recycled = <span class="keyword">false</span>;</div> |
| <div class="line"><a name="l03236"></a><span class="lineno"> 3236</span>  <span class="keywordflow">return</span> add_producer(isExplicit ? <span class="keyword">static_cast<</span>ProducerBase *<span class="keyword">></span>(create<ExplicitProducer>(<span class="keyword">this</span>))</div> |
| <div class="line"><a name="l03237"></a><span class="lineno"> 3237</span>  : create<ImplicitProducer>(<span class="keyword">this</span>));</div> |
| <div class="line"><a name="l03238"></a><span class="lineno"> 3238</span>  }</div> |
| <div class="line"><a name="l03239"></a><span class="lineno"> 3239</span>  </div> |
| <div class="line"><a name="l03240"></a><span class="lineno"> 3240</span>  ProducerBase *add_producer(ProducerBase *producer) {</div> |
| <div class="line"><a name="l03241"></a><span class="lineno"> 3241</span>  <span class="comment">// Handle failed memory allocation</span></div> |
| <div class="line"><a name="l03242"></a><span class="lineno"> 3242</span>  <span class="keywordflow">if</span> (producer == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03243"></a><span class="lineno"> 3243</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03244"></a><span class="lineno"> 3244</span>  }</div> |
| <div class="line"><a name="l03245"></a><span class="lineno"> 3245</span>  </div> |
| <div class="line"><a name="l03246"></a><span class="lineno"> 3246</span>  producerCount.fetch_add(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03247"></a><span class="lineno"> 3247</span>  </div> |
| <div class="line"><a name="l03248"></a><span class="lineno"> 3248</span>  <span class="comment">// Add it to the lock-free list</span></div> |
| <div class="line"><a name="l03249"></a><span class="lineno"> 3249</span>  <span class="keyword">auto</span> prevTail = producerListTail.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03250"></a><span class="lineno"> 3250</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l03251"></a><span class="lineno"> 3251</span>  producer->next = prevTail;</div> |
| <div class="line"><a name="l03252"></a><span class="lineno"> 3252</span>  } <span class="keywordflow">while</span> (!producerListTail.compare_exchange_weak(prevTail, producer, std::memory_order_release,</div> |
| <div class="line"><a name="l03253"></a><span class="lineno"> 3253</span>  std::memory_order_relaxed));</div> |
| <div class="line"><a name="l03254"></a><span class="lineno"> 3254</span>  </div> |
| <div class="line"><a name="l03255"></a><span class="lineno"> 3255</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l03256"></a><span class="lineno"> 3256</span>  <span class="keywordflow">if</span> (producer->isExplicit) {</div> |
| <div class="line"><a name="l03257"></a><span class="lineno"> 3257</span>  <span class="keyword">auto</span> prevTailExplicit = explicitProducers.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03258"></a><span class="lineno"> 3258</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l03259"></a><span class="lineno"> 3259</span>  <span class="keyword">static_cast<</span>ExplicitProducer*<span class="keyword">></span>(producer)->nextExplicitProducer = prevTailExplicit;</div> |
| <div class="line"><a name="l03260"></a><span class="lineno"> 3260</span>  } <span class="keywordflow">while</span> (!explicitProducers.compare_exchange_weak(prevTailExplicit, <span class="keyword">static_cast<</span>ExplicitProducer*<span class="keyword">></span>(producer), std::memory_order_release, std::memory_order_relaxed));</div> |
| <div class="line"><a name="l03261"></a><span class="lineno"> 3261</span>  }</div> |
| <div class="line"><a name="l03262"></a><span class="lineno"> 3262</span>  <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l03263"></a><span class="lineno"> 3263</span>  <span class="keyword">auto</span> prevTailImplicit = implicitProducers.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03264"></a><span class="lineno"> 3264</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l03265"></a><span class="lineno"> 3265</span>  <span class="keyword">static_cast<</span>ImplicitProducer*<span class="keyword">></span>(producer)->nextImplicitProducer = prevTailImplicit;</div> |
| <div class="line"><a name="l03266"></a><span class="lineno"> 3266</span>  } <span class="keywordflow">while</span> (!implicitProducers.compare_exchange_weak(prevTailImplicit, <span class="keyword">static_cast<</span>ImplicitProducer*<span class="keyword">></span>(producer), std::memory_order_release, std::memory_order_relaxed));</div> |
| <div class="line"><a name="l03267"></a><span class="lineno"> 3267</span>  }</div> |
| <div class="line"><a name="l03268"></a><span class="lineno"> 3268</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03269"></a><span class="lineno"> 3269</span>  </div> |
| <div class="line"><a name="l03270"></a><span class="lineno"> 3270</span>  <span class="keywordflow">return</span> producer;</div> |
| <div class="line"><a name="l03271"></a><span class="lineno"> 3271</span>  }</div> |
| <div class="line"><a name="l03272"></a><span class="lineno"> 3272</span>  </div> |
| <div class="line"><a name="l03273"></a><span class="lineno"> 3273</span>  <span class="keywordtype">void</span> reown_producers() {</div> |
| <div class="line"><a name="l03274"></a><span class="lineno"> 3274</span>  <span class="comment">// After another instance is moved-into/swapped-with this one, all the</span></div> |
| <div class="line"><a name="l03275"></a><span class="lineno"> 3275</span>  <span class="comment">// producers we stole still think their parents are the other queue.</span></div> |
| <div class="line"><a name="l03276"></a><span class="lineno"> 3276</span>  <span class="comment">// So fix them up!</span></div> |
| <div class="line"><a name="l03277"></a><span class="lineno"> 3277</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> ptr = producerListTail.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03278"></a><span class="lineno"> 3278</span>  ptr != <span class="keyword">nullptr</span>; ptr = ptr->next_prod()) {</div> |
| <div class="line"><a name="l03279"></a><span class="lineno"> 3279</span>  ptr->parent = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l03280"></a><span class="lineno"> 3280</span>  }</div> |
| <div class="line"><a name="l03281"></a><span class="lineno"> 3281</span>  }</div> |
| <div class="line"><a name="l03282"></a><span class="lineno"> 3282</span>  </div> |
| <div class="line"><a name="l03283"></a><span class="lineno"> 3283</span>  </div> |
| <div class="line"><a name="l03285"></a><span class="lineno"> 3285</span>  <span class="comment">// Implicit producer hash</span></div> |
| <div class="line"><a name="l03287"></a><span class="lineno"> 3287</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l03288"></a><span class="lineno"> 3288</span>  <span class="keyword">struct </span>ImplicitProducerKVP {</div> |
| <div class="line"><a name="l03289"></a><span class="lineno"> 3289</span>  std::atomic<details::thread_id_t> key;</div> |
| <div class="line"><a name="l03290"></a><span class="lineno"> 3290</span>  ImplicitProducer *value; <span class="comment">// No need for atomicity since it's only read by the thread that sets it in the first place</span></div> |
| <div class="line"><a name="l03291"></a><span class="lineno"> 3291</span>  </div> |
| <div class="line"><a name="l03292"></a><span class="lineno"> 3292</span>  ImplicitProducerKVP()</div> |
| <div class="line"><a name="l03293"></a><span class="lineno"> 3293</span>  : value(nullptr) {}</div> |
| <div class="line"><a name="l03294"></a><span class="lineno"> 3294</span>  </div> |
| <div class="line"><a name="l03295"></a><span class="lineno"> 3295</span>  ImplicitProducerKVP(ImplicitProducerKVP &&other) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03296"></a><span class="lineno"> 3296</span>  key.store(other.key.load(std::memory_order_relaxed), std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03297"></a><span class="lineno"> 3297</span>  value = other.value;</div> |
| <div class="line"><a name="l03298"></a><span class="lineno"> 3298</span>  }</div> |
| <div class="line"><a name="l03299"></a><span class="lineno"> 3299</span>  </div> |
| <div class="line"><a name="l03300"></a><span class="lineno"> 3300</span>  <span class="keyword">inline</span> ImplicitProducerKVP &operator=(ImplicitProducerKVP &&other) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03301"></a><span class="lineno"> 3301</span>  swap(other);</div> |
| <div class="line"><a name="l03302"></a><span class="lineno"> 3302</span>  <span class="keywordflow">return</span> *<span class="keyword">this</span>;</div> |
| <div class="line"><a name="l03303"></a><span class="lineno"> 3303</span>  }</div> |
| <div class="line"><a name="l03304"></a><span class="lineno"> 3304</span>  </div> |
| <div class="line"><a name="l03305"></a><span class="lineno"> 3305</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(ImplicitProducerKVP &other) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03306"></a><span class="lineno"> 3306</span>  <span class="keywordflow">if</span> (<span class="keyword">this</span> != &other) {</div> |
| <div class="line"><a name="l03307"></a><span class="lineno"> 3307</span>  details::swap_relaxed(key, other.key);</div> |
| <div class="line"><a name="l03308"></a><span class="lineno"> 3308</span>  std::swap(value, other.value);</div> |
| <div class="line"><a name="l03309"></a><span class="lineno"> 3309</span>  }</div> |
| <div class="line"><a name="l03310"></a><span class="lineno"> 3310</span>  }</div> |
| <div class="line"><a name="l03311"></a><span class="lineno"> 3311</span>  };</div> |
| <div class="line"><a name="l03312"></a><span class="lineno"> 3312</span>  </div> |
| <div class="line"><a name="l03313"></a><span class="lineno"> 3313</span>  <span class="keyword">template</span><<span class="keyword">typename</span> XT, <span class="keyword">typename</span> XTraits></div> |
| <div class="line"><a name="l03314"></a><span class="lineno"> 3314</span>  <span class="keyword">friend</span> <span class="keywordtype">void</span> moodycamel::swap(<span class="keyword">typename</span> ConcurrentQueue<XT, XTraits>::ImplicitProducerKVP &,</div> |
| <div class="line"><a name="l03315"></a><span class="lineno"> 3315</span>  <span class="keyword">typename</span> ConcurrentQueue<XT, XTraits>::ImplicitProducerKVP &) MOODYCAMEL_NOEXCEPT;</div> |
| <div class="line"><a name="l03316"></a><span class="lineno"> 3316</span>  </div> |
| <div class="line"><a name="l03317"></a><span class="lineno"> 3317</span>  <span class="keyword">struct </span>ImplicitProducerHash {</div> |
| <div class="line"><a name="l03318"></a><span class="lineno"> 3318</span>  <span class="keywordtype">size_t</span> capacity;</div> |
| <div class="line"><a name="l03319"></a><span class="lineno"> 3319</span>  ImplicitProducerKVP *entries;</div> |
| <div class="line"><a name="l03320"></a><span class="lineno"> 3320</span>  ImplicitProducerHash *prev;</div> |
| <div class="line"><a name="l03321"></a><span class="lineno"> 3321</span>  };</div> |
| <div class="line"><a name="l03322"></a><span class="lineno"> 3322</span>  </div> |
| <div class="line"><a name="l03323"></a><span class="lineno"> 3323</span>  <span class="keyword">inline</span> <span class="keywordtype">void</span> populate_initial_implicit_producer_hash() {</div> |
| <div class="line"><a name="l03324"></a><span class="lineno"> 3324</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l03325"></a><span class="lineno"> 3325</span>  </div> |
| <div class="line"><a name="l03326"></a><span class="lineno"> 3326</span>  implicitProducerHashCount.store(0, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03327"></a><span class="lineno"> 3327</span>  <span class="keyword">auto</span> hash = &initialImplicitProducerHash;</div> |
| <div class="line"><a name="l03328"></a><span class="lineno"> 3328</span>  hash->capacity = INITIAL_IMPLICIT_PRODUCER_HASH_SIZE;</div> |
| <div class="line"><a name="l03329"></a><span class="lineno"> 3329</span>  hash->entries = &initialImplicitProducerHashEntries[0];</div> |
| <div class="line"><a name="l03330"></a><span class="lineno"> 3330</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != INITIAL_IMPLICIT_PRODUCER_HASH_SIZE; ++i) {</div> |
| <div class="line"><a name="l03331"></a><span class="lineno"> 3331</span>  initialImplicitProducerHashEntries[i].key.store(details::invalid_thread_id,</div> |
| <div class="line"><a name="l03332"></a><span class="lineno"> 3332</span>  std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03333"></a><span class="lineno"> 3333</span>  }</div> |
| <div class="line"><a name="l03334"></a><span class="lineno"> 3334</span>  hash->prev = <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03335"></a><span class="lineno"> 3335</span>  implicitProducerHash.store(hash, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03336"></a><span class="lineno"> 3336</span>  }</div> |
| <div class="line"><a name="l03337"></a><span class="lineno"> 3337</span>  </div> |
| <div class="line"><a name="l03338"></a><span class="lineno"> 3338</span>  <span class="keywordtype">void</span> swap_implicit_producer_hashes(ConcurrentQueue &other) {</div> |
| <div class="line"><a name="l03339"></a><span class="lineno"> 3339</span>  <span class="keywordflow">if</span> (INITIAL_IMPLICIT_PRODUCER_HASH_SIZE == 0) <span class="keywordflow">return</span>;</div> |
| <div class="line"><a name="l03340"></a><span class="lineno"> 3340</span>  </div> |
| <div class="line"><a name="l03341"></a><span class="lineno"> 3341</span>  <span class="comment">// Swap (assumes our implicit producer hash is initialized)</span></div> |
| <div class="line"><a name="l03342"></a><span class="lineno"> 3342</span>  initialImplicitProducerHashEntries.swap(other.initialImplicitProducerHashEntries);</div> |
| <div class="line"><a name="l03343"></a><span class="lineno"> 3343</span>  initialImplicitProducerHash.entries = &initialImplicitProducerHashEntries[0];</div> |
| <div class="line"><a name="l03344"></a><span class="lineno"> 3344</span>  other.initialImplicitProducerHash.entries = &other.initialImplicitProducerHashEntries[0];</div> |
| <div class="line"><a name="l03345"></a><span class="lineno"> 3345</span>  </div> |
| <div class="line"><a name="l03346"></a><span class="lineno"> 3346</span>  details::swap_relaxed(implicitProducerHashCount, other.implicitProducerHashCount);</div> |
| <div class="line"><a name="l03347"></a><span class="lineno"> 3347</span>  </div> |
| <div class="line"><a name="l03348"></a><span class="lineno"> 3348</span>  details::swap_relaxed(implicitProducerHash, other.implicitProducerHash);</div> |
| <div class="line"><a name="l03349"></a><span class="lineno"> 3349</span>  <span class="keywordflow">if</span> (implicitProducerHash.load(std::memory_order_relaxed) ==</div> |
| <div class="line"><a name="l03350"></a><span class="lineno"> 3350</span>  &other.initialImplicitProducerHash) {</div> |
| <div class="line"><a name="l03351"></a><span class="lineno"> 3351</span>  implicitProducerHash.store(&initialImplicitProducerHash, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03352"></a><span class="lineno"> 3352</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l03353"></a><span class="lineno"> 3353</span>  ImplicitProducerHash *hash;</div> |
| <div class="line"><a name="l03354"></a><span class="lineno"> 3354</span>  <span class="keywordflow">for</span> (hash = implicitProducerHash.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03355"></a><span class="lineno"> 3355</span>  hash->prev != &other.initialImplicitProducerHash; hash = hash->prev) {</div> |
| <div class="line"><a name="l03356"></a><span class="lineno"> 3356</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l03357"></a><span class="lineno"> 3357</span>  }</div> |
| <div class="line"><a name="l03358"></a><span class="lineno"> 3358</span>  hash->prev = &initialImplicitProducerHash;</div> |
| <div class="line"><a name="l03359"></a><span class="lineno"> 3359</span>  }</div> |
| <div class="line"><a name="l03360"></a><span class="lineno"> 3360</span>  <span class="keywordflow">if</span> (other.implicitProducerHash.load(std::memory_order_relaxed) ==</div> |
| <div class="line"><a name="l03361"></a><span class="lineno"> 3361</span>  &initialImplicitProducerHash) {</div> |
| <div class="line"><a name="l03362"></a><span class="lineno"> 3362</span>  other.implicitProducerHash.store(&other.initialImplicitProducerHash,</div> |
| <div class="line"><a name="l03363"></a><span class="lineno"> 3363</span>  std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03364"></a><span class="lineno"> 3364</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l03365"></a><span class="lineno"> 3365</span>  ImplicitProducerHash *hash;</div> |
| <div class="line"><a name="l03366"></a><span class="lineno"> 3366</span>  <span class="keywordflow">for</span> (hash = other.implicitProducerHash.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03367"></a><span class="lineno"> 3367</span>  hash->prev != &initialImplicitProducerHash; hash = hash->prev) {</div> |
| <div class="line"><a name="l03368"></a><span class="lineno"> 3368</span>  <span class="keywordflow">continue</span>;</div> |
| <div class="line"><a name="l03369"></a><span class="lineno"> 3369</span>  }</div> |
| <div class="line"><a name="l03370"></a><span class="lineno"> 3370</span>  hash->prev = &other.initialImplicitProducerHash;</div> |
| <div class="line"><a name="l03371"></a><span class="lineno"> 3371</span>  }</div> |
| <div class="line"><a name="l03372"></a><span class="lineno"> 3372</span>  }</div> |
| <div class="line"><a name="l03373"></a><span class="lineno"> 3373</span>  </div> |
| <div class="line"><a name="l03374"></a><span class="lineno"> 3374</span>  <span class="comment">// Only fails (returns nullptr) if memory allocation fails</span></div> |
| <div class="line"><a name="l03375"></a><span class="lineno"> 3375</span>  ImplicitProducer *get_or_add_implicit_producer() {</div> |
| <div class="line"><a name="l03376"></a><span class="lineno"> 3376</span>  <span class="comment">// Note that since the data is essentially thread-local (key is thread ID),</span></div> |
| <div class="line"><a name="l03377"></a><span class="lineno"> 3377</span>  <span class="comment">// there's a reduced need for fences (memory ordering is already consistent</span></div> |
| <div class="line"><a name="l03378"></a><span class="lineno"> 3378</span>  <span class="comment">// for any individual thread), except for the current table itself.</span></div> |
| <div class="line"><a name="l03379"></a><span class="lineno"> 3379</span>  </div> |
| <div class="line"><a name="l03380"></a><span class="lineno"> 3380</span>  <span class="comment">// Start by looking for the thread ID in the current and all previous hash tables.</span></div> |
| <div class="line"><a name="l03381"></a><span class="lineno"> 3381</span>  <span class="comment">// If it's not found, it must not be in there yet, since this same thread would</span></div> |
| <div class="line"><a name="l03382"></a><span class="lineno"> 3382</span>  <span class="comment">// have added it previously to one of the tables that we traversed.</span></div> |
| <div class="line"><a name="l03383"></a><span class="lineno"> 3383</span>  </div> |
| <div class="line"><a name="l03384"></a><span class="lineno"> 3384</span>  <span class="comment">// Code and algorithm adapted from http://preshing.com/20130605/the-worlds-simplest-lock-free-hash-table</span></div> |
| <div class="line"><a name="l03385"></a><span class="lineno"> 3385</span>  </div> |
| <div class="line"><a name="l03386"></a><span class="lineno"> 3386</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH</span></div> |
| <div class="line"><a name="l03387"></a><span class="lineno"> 3387</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(implicitProdMutex);</div> |
| <div class="line"><a name="l03388"></a><span class="lineno"> 3388</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03389"></a><span class="lineno"> 3389</span>  </div> |
| <div class="line"><a name="l03390"></a><span class="lineno"> 3390</span>  <span class="keyword">auto</span> <span class="keywordtype">id</span> = details::thread_id();</div> |
| <div class="line"><a name="l03391"></a><span class="lineno"> 3391</span>  <span class="keyword">auto</span> hashedId = details::hash_thread_id(<span class="keywordtype">id</span>);</div> |
| <div class="line"><a name="l03392"></a><span class="lineno"> 3392</span>  </div> |
| <div class="line"><a name="l03393"></a><span class="lineno"> 3393</span>  <span class="keyword">auto</span> mainHash = implicitProducerHash.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l03394"></a><span class="lineno"> 3394</span>  <span class="keywordflow">for</span> (<span class="keyword">auto</span> hash = mainHash; hash != <span class="keyword">nullptr</span>; hash = hash->prev) {</div> |
| <div class="line"><a name="l03395"></a><span class="lineno"> 3395</span>  <span class="comment">// Look for the id in this hash</span></div> |
| <div class="line"><a name="l03396"></a><span class="lineno"> 3396</span>  <span class="keyword">auto</span> index = hashedId;</div> |
| <div class="line"><a name="l03397"></a><span class="lineno"> 3397</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) { <span class="comment">// Not an infinite loop because at least one slot is free in the hash table</span></div> |
| <div class="line"><a name="l03398"></a><span class="lineno"> 3398</span>  index &= hash->capacity - 1;</div> |
| <div class="line"><a name="l03399"></a><span class="lineno"> 3399</span>  </div> |
| <div class="line"><a name="l03400"></a><span class="lineno"> 3400</span>  <span class="keyword">auto</span> probedKey = hash->entries[index].key.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03401"></a><span class="lineno"> 3401</span>  <span class="keywordflow">if</span> (probedKey == <span class="keywordtype">id</span>) {</div> |
| <div class="line"><a name="l03402"></a><span class="lineno"> 3402</span>  <span class="comment">// Found it! If we had to search several hashes deep, though, we should lazily add it</span></div> |
| <div class="line"><a name="l03403"></a><span class="lineno"> 3403</span>  <span class="comment">// to the current main hash table to avoid the extended search next time.</span></div> |
| <div class="line"><a name="l03404"></a><span class="lineno"> 3404</span>  <span class="comment">// Note there's guaranteed to be room in the current hash table since every subsequent</span></div> |
| <div class="line"><a name="l03405"></a><span class="lineno"> 3405</span>  <span class="comment">// table implicitly reserves space for all previous tables (there's only one</span></div> |
| <div class="line"><a name="l03406"></a><span class="lineno"> 3406</span>  <span class="comment">// implicitProducerHashCount).</span></div> |
| <div class="line"><a name="l03407"></a><span class="lineno"> 3407</span>  <span class="keyword">auto</span> value = hash->entries[index].value;</div> |
| <div class="line"><a name="l03408"></a><span class="lineno"> 3408</span>  <span class="keywordflow">if</span> (hash != mainHash) {</div> |
| <div class="line"><a name="l03409"></a><span class="lineno"> 3409</span>  index = hashedId;</div> |
| <div class="line"><a name="l03410"></a><span class="lineno"> 3410</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l03411"></a><span class="lineno"> 3411</span>  index &= mainHash->capacity - 1;</div> |
| <div class="line"><a name="l03412"></a><span class="lineno"> 3412</span>  probedKey = mainHash->entries[index].key.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03413"></a><span class="lineno"> 3413</span>  <span class="keyword">auto</span> empty = details::invalid_thread_id;</div> |
| <div class="line"><a name="l03414"></a><span class="lineno"> 3414</span> <span class="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l03415"></a><span class="lineno"> 3415</span>  <span class="keyword">auto</span> reusable = details::invalid_thread_id2;</div> |
| <div class="line"><a name="l03416"></a><span class="lineno"> 3416</span>  <span class="keywordflow">if</span> ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(empty, <span class="keywordtype">id</span>, std::memory_order_relaxed, std::memory_order_relaxed)) ||</div> |
| <div class="line"><a name="l03417"></a><span class="lineno"> 3417</span>  (probedKey == reusable && mainHash->entries[index].key.compare_exchange_strong(reusable, <span class="keywordtype">id</span>, std::memory_order_acquire, std::memory_order_acquire))) {</div> |
| <div class="line"><a name="l03418"></a><span class="lineno"> 3418</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l03419"></a><span class="lineno"> 3419</span>  <span class="keywordflow">if</span> ((probedKey == empty &&</div> |
| <div class="line"><a name="l03420"></a><span class="lineno"> 3420</span>  mainHash->entries[index].key.compare_exchange_strong(empty, <span class="keywordtype">id</span>,</div> |
| <div class="line"><a name="l03421"></a><span class="lineno"> 3421</span>  std::memory_order_relaxed,</div> |
| <div class="line"><a name="l03422"></a><span class="lineno"> 3422</span>  std::memory_order_relaxed))) {</div> |
| <div class="line"><a name="l03423"></a><span class="lineno"> 3423</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03424"></a><span class="lineno"> 3424</span>  mainHash->entries[index].value = value;</div> |
| <div class="line"><a name="l03425"></a><span class="lineno"> 3425</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l03426"></a><span class="lineno"> 3426</span>  }</div> |
| <div class="line"><a name="l03427"></a><span class="lineno"> 3427</span>  ++index;</div> |
| <div class="line"><a name="l03428"></a><span class="lineno"> 3428</span>  }</div> |
| <div class="line"><a name="l03429"></a><span class="lineno"> 3429</span>  }</div> |
| <div class="line"><a name="l03430"></a><span class="lineno"> 3430</span>  </div> |
| <div class="line"><a name="l03431"></a><span class="lineno"> 3431</span>  <span class="keywordflow">return</span> value;</div> |
| <div class="line"><a name="l03432"></a><span class="lineno"> 3432</span>  }</div> |
| <div class="line"><a name="l03433"></a><span class="lineno"> 3433</span>  <span class="keywordflow">if</span> (probedKey == details::invalid_thread_id) {</div> |
| <div class="line"><a name="l03434"></a><span class="lineno"> 3434</span>  <span class="keywordflow">break</span>; <span class="comment">// Not in this hash table</span></div> |
| <div class="line"><a name="l03435"></a><span class="lineno"> 3435</span>  }</div> |
| <div class="line"><a name="l03436"></a><span class="lineno"> 3436</span>  ++index;</div> |
| <div class="line"><a name="l03437"></a><span class="lineno"> 3437</span>  }</div> |
| <div class="line"><a name="l03438"></a><span class="lineno"> 3438</span>  }</div> |
| <div class="line"><a name="l03439"></a><span class="lineno"> 3439</span>  </div> |
| <div class="line"><a name="l03440"></a><span class="lineno"> 3440</span>  <span class="comment">// Insert!</span></div> |
| <div class="line"><a name="l03441"></a><span class="lineno"> 3441</span>  <span class="keyword">auto</span> newCount = 1 + implicitProducerHashCount.fetch_add(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03442"></a><span class="lineno"> 3442</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l03443"></a><span class="lineno"> 3443</span>  <span class="keywordflow">if</span> (newCount >= (mainHash->capacity >> 1) &&</div> |
| <div class="line"><a name="l03444"></a><span class="lineno"> 3444</span>  !implicitProducerHashResizeInProgress.test_and_set(std::memory_order_acquire)) {</div> |
| <div class="line"><a name="l03445"></a><span class="lineno"> 3445</span>  <span class="comment">// We've acquired the resize lock, try to allocate a bigger hash table.</span></div> |
| <div class="line"><a name="l03446"></a><span class="lineno"> 3446</span>  <span class="comment">// Note the acquire fence synchronizes with the release fence at the end of this block, and hence when</span></div> |
| <div class="line"><a name="l03447"></a><span class="lineno"> 3447</span>  <span class="comment">// we reload implicitProducerHash it must be the most recent version (it only gets changed within this</span></div> |
| <div class="line"><a name="l03448"></a><span class="lineno"> 3448</span>  <span class="comment">// locked block).</span></div> |
| <div class="line"><a name="l03449"></a><span class="lineno"> 3449</span>  mainHash = implicitProducerHash.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l03450"></a><span class="lineno"> 3450</span>  <span class="keywordflow">if</span> (newCount >= (mainHash->capacity >> 1)) {</div> |
| <div class="line"><a name="l03451"></a><span class="lineno"> 3451</span>  <span class="keyword">auto</span> newCapacity = mainHash->capacity << 1;</div> |
| <div class="line"><a name="l03452"></a><span class="lineno"> 3452</span>  <span class="keywordflow">while</span> (newCount >= (newCapacity >> 1)) {</div> |
| <div class="line"><a name="l03453"></a><span class="lineno"> 3453</span>  newCapacity <<= 1;</div> |
| <div class="line"><a name="l03454"></a><span class="lineno"> 3454</span>  }</div> |
| <div class="line"><a name="l03455"></a><span class="lineno"> 3455</span>  <span class="keyword">auto</span> raw = <span class="keyword">static_cast<</span><span class="keywordtype">char</span> *<span class="keyword">></span>((Traits::malloc)(</div> |
| <div class="line"><a name="l03456"></a><span class="lineno"> 3456</span>  <span class="keyword">sizeof</span>(ImplicitProducerHash) + std::alignment_of<ImplicitProducerKVP>::value - 1 +</div> |
| <div class="line"><a name="l03457"></a><span class="lineno"> 3457</span>  <span class="keyword">sizeof</span>(ImplicitProducerKVP) * newCapacity));</div> |
| <div class="line"><a name="l03458"></a><span class="lineno"> 3458</span>  <span class="keywordflow">if</span> (raw == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03459"></a><span class="lineno"> 3459</span>  <span class="comment">// Allocation failed</span></div> |
| <div class="line"><a name="l03460"></a><span class="lineno"> 3460</span>  implicitProducerHashCount.fetch_sub(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03461"></a><span class="lineno"> 3461</span>  implicitProducerHashResizeInProgress.clear(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03462"></a><span class="lineno"> 3462</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03463"></a><span class="lineno"> 3463</span>  }</div> |
| <div class="line"><a name="l03464"></a><span class="lineno"> 3464</span>  </div> |
| <div class="line"><a name="l03465"></a><span class="lineno"> 3465</span>  <span class="keyword">auto</span> newHash = <span class="keyword">new</span>(raw) ImplicitProducerHash;</div> |
| <div class="line"><a name="l03466"></a><span class="lineno"> 3466</span>  newHash->capacity = newCapacity;</div> |
| <div class="line"><a name="l03467"></a><span class="lineno"> 3467</span>  newHash->entries = <span class="keyword">reinterpret_cast<</span>ImplicitProducerKVP *<span class="keyword">></span>(details::align_for<ImplicitProducerKVP>(</div> |
| <div class="line"><a name="l03468"></a><span class="lineno"> 3468</span>  raw + <span class="keyword">sizeof</span>(ImplicitProducerHash)));</div> |
| <div class="line"><a name="l03469"></a><span class="lineno"> 3469</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != newCapacity; ++i) {</div> |
| <div class="line"><a name="l03470"></a><span class="lineno"> 3470</span>  <span class="keyword">new</span>(newHash->entries + i) ImplicitProducerKVP;</div> |
| <div class="line"><a name="l03471"></a><span class="lineno"> 3471</span>  newHash->entries[i].key.store(details::invalid_thread_id, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03472"></a><span class="lineno"> 3472</span>  }</div> |
| <div class="line"><a name="l03473"></a><span class="lineno"> 3473</span>  newHash->prev = mainHash;</div> |
| <div class="line"><a name="l03474"></a><span class="lineno"> 3474</span>  implicitProducerHash.store(newHash, std::memory_order_release);</div> |
| <div class="line"><a name="l03475"></a><span class="lineno"> 3475</span>  implicitProducerHashResizeInProgress.clear(std::memory_order_release);</div> |
| <div class="line"><a name="l03476"></a><span class="lineno"> 3476</span>  mainHash = newHash;</div> |
| <div class="line"><a name="l03477"></a><span class="lineno"> 3477</span>  } <span class="keywordflow">else</span> {</div> |
| <div class="line"><a name="l03478"></a><span class="lineno"> 3478</span>  implicitProducerHashResizeInProgress.clear(std::memory_order_release);</div> |
| <div class="line"><a name="l03479"></a><span class="lineno"> 3479</span>  }</div> |
| <div class="line"><a name="l03480"></a><span class="lineno"> 3480</span>  }</div> |
| <div class="line"><a name="l03481"></a><span class="lineno"> 3481</span>  </div> |
| <div class="line"><a name="l03482"></a><span class="lineno"> 3482</span>  <span class="comment">// If it's < three-quarters full, add to the old one anyway so that we don't have to wait for the next table</span></div> |
| <div class="line"><a name="l03483"></a><span class="lineno"> 3483</span>  <span class="comment">// to finish being allocated by another thread (and if we just finished allocating above, the condition will</span></div> |
| <div class="line"><a name="l03484"></a><span class="lineno"> 3484</span>  <span class="comment">// always be true)</span></div> |
| <div class="line"><a name="l03485"></a><span class="lineno"> 3485</span>  <span class="keywordflow">if</span> (newCount < (mainHash->capacity >> 1) + (mainHash->capacity >> 2)) {</div> |
| <div class="line"><a name="l03486"></a><span class="lineno"> 3486</span>  <span class="keywordtype">bool</span> recycled;</div> |
| <div class="line"><a name="l03487"></a><span class="lineno"> 3487</span>  <span class="keyword">auto</span> producer = <span class="keyword">static_cast<</span>ImplicitProducer *<span class="keyword">></span>(recycle_or_create_producer(<span class="keyword">false</span>,</div> |
| <div class="line"><a name="l03488"></a><span class="lineno"> 3488</span>  recycled));</div> |
| <div class="line"><a name="l03489"></a><span class="lineno"> 3489</span>  <span class="keywordflow">if</span> (producer == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03490"></a><span class="lineno"> 3490</span>  implicitProducerHashCount.fetch_sub(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03491"></a><span class="lineno"> 3491</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03492"></a><span class="lineno"> 3492</span>  }</div> |
| <div class="line"><a name="l03493"></a><span class="lineno"> 3493</span>  <span class="keywordflow">if</span> (recycled) {</div> |
| <div class="line"><a name="l03494"></a><span class="lineno"> 3494</span>  implicitProducerHashCount.fetch_sub(1, std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03495"></a><span class="lineno"> 3495</span>  }</div> |
| <div class="line"><a name="l03496"></a><span class="lineno"> 3496</span>  </div> |
| <div class="line"><a name="l03497"></a><span class="lineno"> 3497</span> <span class="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l03498"></a><span class="lineno"> 3498</span>  producer->threadExitListener.callback = &ConcurrentQueue::implicit_producer_thread_exited_callback;</div> |
| <div class="line"><a name="l03499"></a><span class="lineno"> 3499</span>  producer->threadExitListener.userData = producer;</div> |
| <div class="line"><a name="l03500"></a><span class="lineno"> 3500</span>  details::ThreadExitNotifier::subscribe(&producer->threadExitListener);</div> |
| <div class="line"><a name="l03501"></a><span class="lineno"> 3501</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03502"></a><span class="lineno"> 3502</span>  </div> |
| <div class="line"><a name="l03503"></a><span class="lineno"> 3503</span>  <span class="keyword">auto</span> index = hashedId;</div> |
| <div class="line"><a name="l03504"></a><span class="lineno"> 3504</span>  <span class="keywordflow">while</span> (<span class="keyword">true</span>) {</div> |
| <div class="line"><a name="l03505"></a><span class="lineno"> 3505</span>  index &= mainHash->capacity - 1;</div> |
| <div class="line"><a name="l03506"></a><span class="lineno"> 3506</span>  <span class="keyword">auto</span> probedKey = mainHash->entries[index].key.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03507"></a><span class="lineno"> 3507</span>  </div> |
| <div class="line"><a name="l03508"></a><span class="lineno"> 3508</span>  <span class="keyword">auto</span> empty = details::invalid_thread_id;</div> |
| <div class="line"><a name="l03509"></a><span class="lineno"> 3509</span> <span class="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l03510"></a><span class="lineno"> 3510</span>  <span class="keyword">auto</span> reusable = details::invalid_thread_id2;</div> |
| <div class="line"><a name="l03511"></a><span class="lineno"> 3511</span>  <span class="keywordflow">if</span> ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(empty, <span class="keywordtype">id</span>, std::memory_order_relaxed, std::memory_order_relaxed)) ||</div> |
| <div class="line"><a name="l03512"></a><span class="lineno"> 3512</span>  (probedKey == reusable && mainHash->entries[index].key.compare_exchange_strong(reusable, <span class="keywordtype">id</span>, std::memory_order_acquire, std::memory_order_acquire))) {</div> |
| <div class="line"><a name="l03513"></a><span class="lineno"> 3513</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l03514"></a><span class="lineno"> 3514</span>  <span class="keywordflow">if</span> ((probedKey == empty && mainHash->entries[index].key.compare_exchange_strong(empty, <span class="keywordtype">id</span>,</div> |
| <div class="line"><a name="l03515"></a><span class="lineno"> 3515</span>  std::memory_order_relaxed,</div> |
| <div class="line"><a name="l03516"></a><span class="lineno"> 3516</span>  std::memory_order_relaxed))) {</div> |
| <div class="line"><a name="l03517"></a><span class="lineno"> 3517</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03518"></a><span class="lineno"> 3518</span>  mainHash->entries[index].value = producer;</div> |
| <div class="line"><a name="l03519"></a><span class="lineno"> 3519</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l03520"></a><span class="lineno"> 3520</span>  }</div> |
| <div class="line"><a name="l03521"></a><span class="lineno"> 3521</span>  ++index;</div> |
| <div class="line"><a name="l03522"></a><span class="lineno"> 3522</span>  }</div> |
| <div class="line"><a name="l03523"></a><span class="lineno"> 3523</span>  <span class="keywordflow">return</span> producer;</div> |
| <div class="line"><a name="l03524"></a><span class="lineno"> 3524</span>  }</div> |
| <div class="line"><a name="l03525"></a><span class="lineno"> 3525</span>  </div> |
| <div class="line"><a name="l03526"></a><span class="lineno"> 3526</span>  <span class="comment">// Hmm, the old hash is quite full and somebody else is busy allocating a new one.</span></div> |
| <div class="line"><a name="l03527"></a><span class="lineno"> 3527</span>  <span class="comment">// We need to wait for the allocating thread to finish (if it succeeds, we add, if not,</span></div> |
| <div class="line"><a name="l03528"></a><span class="lineno"> 3528</span>  <span class="comment">// we try to allocate ourselves).</span></div> |
| <div class="line"><a name="l03529"></a><span class="lineno"> 3529</span>  mainHash = implicitProducerHash.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l03530"></a><span class="lineno"> 3530</span>  }</div> |
| <div class="line"><a name="l03531"></a><span class="lineno"> 3531</span>  }</div> |
| <div class="line"><a name="l03532"></a><span class="lineno"> 3532</span>  </div> |
| <div class="line"><a name="l03533"></a><span class="lineno"> 3533</span> <span class="preprocessor">#ifdef MOODYCAMEL_CPP11_THREAD_LOCAL_SUPPORTED</span></div> |
| <div class="line"><a name="l03534"></a><span class="lineno"> 3534</span>  <span class="keywordtype">void</span> implicit_producer_thread_exited(ImplicitProducer* producer)</div> |
| <div class="line"><a name="l03535"></a><span class="lineno"> 3535</span>  {</div> |
| <div class="line"><a name="l03536"></a><span class="lineno"> 3536</span>  <span class="comment">// Remove from thread exit listeners</span></div> |
| <div class="line"><a name="l03537"></a><span class="lineno"> 3537</span>  details::ThreadExitNotifier::unsubscribe(&producer->threadExitListener);</div> |
| <div class="line"><a name="l03538"></a><span class="lineno"> 3538</span>  </div> |
| <div class="line"><a name="l03539"></a><span class="lineno"> 3539</span>  <span class="comment">// Remove from hash</span></div> |
| <div class="line"><a name="l03540"></a><span class="lineno"> 3540</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH</span></div> |
| <div class="line"><a name="l03541"></a><span class="lineno"> 3541</span>  debug::DebugLock <a class="code" href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">lock</a>(implicitProdMutex);</div> |
| <div class="line"><a name="l03542"></a><span class="lineno"> 3542</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03543"></a><span class="lineno"> 3543</span>  <span class="keyword">auto</span> hash = implicitProducerHash.load(std::memory_order_acquire);</div> |
| <div class="line"><a name="l03544"></a><span class="lineno"> 3544</span>  assert(hash != <span class="keyword">nullptr</span>); <span class="comment">// The thread exit listener is only registered if we were added to a hash in the first place</span></div> |
| <div class="line"><a name="l03545"></a><span class="lineno"> 3545</span>  <span class="keyword">auto</span> <span class="keywordtype">id</span> = details::thread_id();</div> |
| <div class="line"><a name="l03546"></a><span class="lineno"> 3546</span>  <span class="keyword">auto</span> hashedId = details::hash_thread_id(<span class="keywordtype">id</span>);</div> |
| <div class="line"><a name="l03547"></a><span class="lineno"> 3547</span>  details::thread_id_t probedKey;</div> |
| <div class="line"><a name="l03548"></a><span class="lineno"> 3548</span>  </div> |
| <div class="line"><a name="l03549"></a><span class="lineno"> 3549</span>  <span class="comment">// We need to traverse all the hashes just in case other threads aren't on the current one yet and are</span></div> |
| <div class="line"><a name="l03550"></a><span class="lineno"> 3550</span>  <span class="comment">// trying to add an entry thinking there's a free slot (because they reused a producer)</span></div> |
| <div class="line"><a name="l03551"></a><span class="lineno"> 3551</span>  <span class="keywordflow">for</span> (; hash != <span class="keyword">nullptr</span>; hash = hash->prev) {</div> |
| <div class="line"><a name="l03552"></a><span class="lineno"> 3552</span>  <span class="keyword">auto</span> index = hashedId;</div> |
| <div class="line"><a name="l03553"></a><span class="lineno"> 3553</span>  <span class="keywordflow">do</span> {</div> |
| <div class="line"><a name="l03554"></a><span class="lineno"> 3554</span>  index &= hash->capacity - 1;</div> |
| <div class="line"><a name="l03555"></a><span class="lineno"> 3555</span>  probedKey = hash->entries[index].key.load(std::memory_order_relaxed);</div> |
| <div class="line"><a name="l03556"></a><span class="lineno"> 3556</span>  <span class="keywordflow">if</span> (probedKey == <span class="keywordtype">id</span>) {</div> |
| <div class="line"><a name="l03557"></a><span class="lineno"> 3557</span>  hash->entries[index].key.store(details::invalid_thread_id2, std::memory_order_release);</div> |
| <div class="line"><a name="l03558"></a><span class="lineno"> 3558</span>  <span class="keywordflow">break</span>;</div> |
| <div class="line"><a name="l03559"></a><span class="lineno"> 3559</span>  }</div> |
| <div class="line"><a name="l03560"></a><span class="lineno"> 3560</span>  ++index;</div> |
| <div class="line"><a name="l03561"></a><span class="lineno"> 3561</span>  } <span class="keywordflow">while</span> (probedKey != details::invalid_thread_id); <span class="comment">// Can happen if the hash has changed but we weren't put back in it yet, or if we weren't added to this hash in the first place</span></div> |
| <div class="line"><a name="l03562"></a><span class="lineno"> 3562</span>  }</div> |
| <div class="line"><a name="l03563"></a><span class="lineno"> 3563</span>  </div> |
| <div class="line"><a name="l03564"></a><span class="lineno"> 3564</span>  <span class="comment">// Mark the queue as being recyclable</span></div> |
| <div class="line"><a name="l03565"></a><span class="lineno"> 3565</span>  producer->inactive.store(<span class="keyword">true</span>, std::memory_order_release);</div> |
| <div class="line"><a name="l03566"></a><span class="lineno"> 3566</span>  }</div> |
| <div class="line"><a name="l03567"></a><span class="lineno"> 3567</span>  </div> |
| <div class="line"><a name="l03568"></a><span class="lineno"> 3568</span>  <span class="keyword">static</span> <span class="keywordtype">void</span> implicit_producer_thread_exited_callback(<span class="keywordtype">void</span>* userData)</div> |
| <div class="line"><a name="l03569"></a><span class="lineno"> 3569</span>  {</div> |
| <div class="line"><a name="l03570"></a><span class="lineno"> 3570</span>  <span class="keyword">auto</span> producer = <span class="keyword">static_cast<</span>ImplicitProducer*<span class="keyword">></span>(userData);</div> |
| <div class="line"><a name="l03571"></a><span class="lineno"> 3571</span>  <span class="keyword">auto</span> queue = producer->parent;</div> |
| <div class="line"><a name="l03572"></a><span class="lineno"> 3572</span>  queue->implicit_producer_thread_exited(producer);</div> |
| <div class="line"><a name="l03573"></a><span class="lineno"> 3573</span>  }</div> |
| <div class="line"><a name="l03574"></a><span class="lineno"> 3574</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03575"></a><span class="lineno"> 3575</span>  </div> |
| <div class="line"><a name="l03577"></a><span class="lineno"> 3577</span>  <span class="comment">// Utility functions</span></div> |
| <div class="line"><a name="l03579"></a><span class="lineno"> 3579</span> <span class="comment"></span> </div> |
| <div class="line"><a name="l03580"></a><span class="lineno"> 3580</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l03581"></a><span class="lineno"> 3581</span>  <span class="keyword">static</span> <span class="keyword">inline</span> U *create_array(<span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l03582"></a><span class="lineno"> 3582</span>  assert(count > 0);</div> |
| <div class="line"><a name="l03583"></a><span class="lineno"> 3583</span>  <span class="keyword">auto</span> p = <span class="keyword">static_cast<</span>U *<span class="keyword">></span>((Traits::malloc)(<span class="keyword">sizeof</span>(U) * count));</div> |
| <div class="line"><a name="l03584"></a><span class="lineno"> 3584</span>  <span class="keywordflow">if</span> (p == <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03585"></a><span class="lineno"> 3585</span>  <span class="keywordflow">return</span> <span class="keyword">nullptr</span>;</div> |
| <div class="line"><a name="l03586"></a><span class="lineno"> 3586</span>  }</div> |
| <div class="line"><a name="l03587"></a><span class="lineno"> 3587</span>  </div> |
| <div class="line"><a name="l03588"></a><span class="lineno"> 3588</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = 0; i != count; ++i) {</div> |
| <div class="line"><a name="l03589"></a><span class="lineno"> 3589</span>  <span class="keyword">new</span>(p + i) U();</div> |
| <div class="line"><a name="l03590"></a><span class="lineno"> 3590</span>  }</div> |
| <div class="line"><a name="l03591"></a><span class="lineno"> 3591</span>  <span class="keywordflow">return</span> p;</div> |
| <div class="line"><a name="l03592"></a><span class="lineno"> 3592</span>  }</div> |
| <div class="line"><a name="l03593"></a><span class="lineno"> 3593</span>  </div> |
| <div class="line"><a name="l03594"></a><span class="lineno"> 3594</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l03595"></a><span class="lineno"> 3595</span>  <span class="keyword">static</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> destroy_array(U *p, <span class="keywordtype">size_t</span> count) {</div> |
| <div class="line"><a name="l03596"></a><span class="lineno"> 3596</span>  <span class="keywordflow">if</span> (p != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03597"></a><span class="lineno"> 3597</span>  assert(count > 0);</div> |
| <div class="line"><a name="l03598"></a><span class="lineno"> 3598</span>  <span class="keywordflow">for</span> (<span class="keywordtype">size_t</span> i = count; i != 0;) {</div> |
| <div class="line"><a name="l03599"></a><span class="lineno"> 3599</span>  (p + --i)->~U();</div> |
| <div class="line"><a name="l03600"></a><span class="lineno"> 3600</span>  }</div> |
| <div class="line"><a name="l03601"></a><span class="lineno"> 3601</span>  (Traits::free)(p);</div> |
| <div class="line"><a name="l03602"></a><span class="lineno"> 3602</span>  }</div> |
| <div class="line"><a name="l03603"></a><span class="lineno"> 3603</span>  }</div> |
| <div class="line"><a name="l03604"></a><span class="lineno"> 3604</span>  </div> |
| <div class="line"><a name="l03605"></a><span class="lineno"> 3605</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l03606"></a><span class="lineno"> 3606</span>  <span class="keyword">static</span> <span class="keyword">inline</span> U *create() {</div> |
| <div class="line"><a name="l03607"></a><span class="lineno"> 3607</span>  <span class="keyword">auto</span> p = (Traits::malloc)(<span class="keyword">sizeof</span>(U));</div> |
| <div class="line"><a name="l03608"></a><span class="lineno"> 3608</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="l03609"></a><span class="lineno"> 3609</span>  }</div> |
| <div class="line"><a name="l03610"></a><span class="lineno"> 3610</span>  </div> |
| <div class="line"><a name="l03611"></a><span class="lineno"> 3611</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U, <span class="keyword">typename</span> A1></div> |
| <div class="line"><a name="l03612"></a><span class="lineno"> 3612</span>  <span class="keyword">static</span> <span class="keyword">inline</span> U *create(A1 &&a1) {</div> |
| <div class="line"><a name="l03613"></a><span class="lineno"> 3613</span>  <span class="keyword">auto</span> p = (Traits::malloc)(<span class="keyword">sizeof</span>(U));</div> |
| <div class="line"><a name="l03614"></a><span class="lineno"> 3614</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="l03615"></a><span class="lineno"> 3615</span>  }</div> |
| <div class="line"><a name="l03616"></a><span class="lineno"> 3616</span>  </div> |
| <div class="line"><a name="l03617"></a><span class="lineno"> 3617</span>  <span class="keyword">template</span><<span class="keyword">typename</span> U></div> |
| <div class="line"><a name="l03618"></a><span class="lineno"> 3618</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="l03619"></a><span class="lineno"> 3619</span>  <span class="keywordflow">if</span> (p != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03620"></a><span class="lineno"> 3620</span>  p->~U();</div> |
| <div class="line"><a name="l03621"></a><span class="lineno"> 3621</span>  }</div> |
| <div class="line"><a name="l03622"></a><span class="lineno"> 3622</span>  (Traits::free)(p);</div> |
| <div class="line"><a name="l03623"></a><span class="lineno"> 3623</span>  }</div> |
| <div class="line"><a name="l03624"></a><span class="lineno"> 3624</span>  </div> |
| <div class="line"><a name="l03625"></a><span class="lineno"> 3625</span>  <span class="keyword">private</span>:</div> |
| <div class="line"><a name="l03626"></a><span class="lineno"> 3626</span>  std::atomic<ProducerBase *> producerListTail;</div> |
| <div class="line"><a name="l03627"></a><span class="lineno"> 3627</span>  std::atomic<std::uint32_t> producerCount;</div> |
| <div class="line"><a name="l03628"></a><span class="lineno"> 3628</span>  </div> |
| <div class="line"><a name="l03629"></a><span class="lineno"> 3629</span>  std::atomic<size_t> initialBlockPoolIndex;</div> |
| <div class="line"><a name="l03630"></a><span class="lineno"> 3630</span>  Block *initialBlockPool;</div> |
| <div class="line"><a name="l03631"></a><span class="lineno"> 3631</span>  <span class="keywordtype">size_t</span> initialBlockPoolSize;</div> |
| <div class="line"><a name="l03632"></a><span class="lineno"> 3632</span>  </div> |
| <div class="line"><a name="l03633"></a><span class="lineno"> 3633</span> <span class="preprocessor">#if !MCDBGQ_USEDEBUGFREELIST</span></div> |
| <div class="line"><a name="l03634"></a><span class="lineno"> 3634</span>  FreeList<Block> freeList;</div> |
| <div class="line"><a name="l03635"></a><span class="lineno"> 3635</span> <span class="preprocessor">#else</span></div> |
| <div class="line"><a name="l03636"></a><span class="lineno"> 3636</span>  debug::DebugFreeList<Block> freeList;</div> |
| <div class="line"><a name="l03637"></a><span class="lineno"> 3637</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03638"></a><span class="lineno"> 3638</span>  </div> |
| <div class="line"><a name="l03639"></a><span class="lineno"> 3639</span>  std::atomic<ImplicitProducerHash *> implicitProducerHash;</div> |
| <div class="line"><a name="l03640"></a><span class="lineno"> 3640</span>  std::atomic<size_t> implicitProducerHashCount; <span class="comment">// Number of slots logically used</span></div> |
| <div class="line"><a name="l03641"></a><span class="lineno"> 3641</span>  ImplicitProducerHash initialImplicitProducerHash;</div> |
| <div class="line"><a name="l03642"></a><span class="lineno"> 3642</span>  std::array<ImplicitProducerKVP, INITIAL_IMPLICIT_PRODUCER_HASH_SIZE> initialImplicitProducerHashEntries;</div> |
| <div class="line"><a name="l03643"></a><span class="lineno"> 3643</span>  std::atomic_flag implicitProducerHashResizeInProgress;</div> |
| <div class="line"><a name="l03644"></a><span class="lineno"> 3644</span>  </div> |
| <div class="line"><a name="l03645"></a><span class="lineno"> 3645</span>  std::atomic<std::uint32_t> nextExplicitConsumerId;</div> |
| <div class="line"><a name="l03646"></a><span class="lineno"> 3646</span>  std::atomic<std::uint32_t> globalExplicitConsumerOffset;</div> |
| <div class="line"><a name="l03647"></a><span class="lineno"> 3647</span>  </div> |
| <div class="line"><a name="l03648"></a><span class="lineno"> 3648</span> <span class="preprocessor">#if MCDBGQ_NOLOCKFREE_IMPLICITPRODHASH</span></div> |
| <div class="line"><a name="l03649"></a><span class="lineno"> 3649</span>  debug::DebugMutex implicitProdMutex;</div> |
| <div class="line"><a name="l03650"></a><span class="lineno"> 3650</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03651"></a><span class="lineno"> 3651</span>  </div> |
| <div class="line"><a name="l03652"></a><span class="lineno"> 3652</span> <span class="preprocessor">#ifdef MOODYCAMEL_QUEUE_INTERNAL_DEBUG</span></div> |
| <div class="line"><a name="l03653"></a><span class="lineno"> 3653</span>  std::atomic<ExplicitProducer*> explicitProducers;</div> |
| <div class="line"><a name="l03654"></a><span class="lineno"> 3654</span>  std::atomic<ImplicitProducer*> implicitProducers;</div> |
| <div class="line"><a name="l03655"></a><span class="lineno"> 3655</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03656"></a><span class="lineno"> 3656</span> };</div> |
| <div class="line"><a name="l03657"></a><span class="lineno"> 3657</span>  </div> |
| <div class="line"><a name="l03658"></a><span class="lineno"> 3658</span>  </div> |
| <div class="line"><a name="l03659"></a><span class="lineno"> 3659</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l03660"></a><span class="lineno"> 3660</span> ProducerToken::ProducerToken(ConcurrentQueue<T, Traits> &queue)</div> |
| <div class="line"><a name="l03661"></a><span class="lineno"> 3661</span>  : producer(queue.recycle_or_create_producer(true)) {</div> |
| <div class="line"><a name="l03662"></a><span class="lineno"> 3662</span>  <span class="keywordflow">if</span> (producer != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03663"></a><span class="lineno"> 3663</span>  producer->token = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l03664"></a><span class="lineno"> 3664</span>  }</div> |
| <div class="line"><a name="l03665"></a><span class="lineno"> 3665</span> }</div> |
| <div class="line"><a name="l03666"></a><span class="lineno"> 3666</span>  </div> |
| <div class="line"><a name="l03667"></a><span class="lineno"> 3667</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l03668"></a><span class="lineno"> 3668</span> ProducerToken::ProducerToken(BlockingConcurrentQueue<T, Traits> &queue)</div> |
| <div class="line"><a name="l03669"></a><span class="lineno"> 3669</span>  : producer(</div> |
| <div class="line"><a name="l03670"></a><span class="lineno"> 3670</span>  reinterpret_cast<ConcurrentQueue<T, Traits> *>(&queue)->recycle_or_create_producer(true)) {</div> |
| <div class="line"><a name="l03671"></a><span class="lineno"> 3671</span>  <span class="keywordflow">if</span> (producer != <span class="keyword">nullptr</span>) {</div> |
| <div class="line"><a name="l03672"></a><span class="lineno"> 3672</span>  producer->token = <span class="keyword">this</span>;</div> |
| <div class="line"><a name="l03673"></a><span class="lineno"> 3673</span>  }</div> |
| <div class="line"><a name="l03674"></a><span class="lineno"> 3674</span> }</div> |
| <div class="line"><a name="l03675"></a><span class="lineno"> 3675</span>  </div> |
| <div class="line"><a name="l03676"></a><span class="lineno"> 3676</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l03677"></a><span class="lineno"> 3677</span> ConsumerToken::ConsumerToken(ConcurrentQueue<T, Traits> &queue)</div> |
| <div class="line"><a name="l03678"></a><span class="lineno"> 3678</span>  : itemsConsumedFromCurrent(0), currentProducer(nullptr), desiredProducer(nullptr) {</div> |
| <div class="line"><a name="l03679"></a><span class="lineno"> 3679</span>  initialOffset = queue.nextExplicitConsumerId.fetch_add(1, std::memory_order_release);</div> |
| <div class="line"><a name="l03680"></a><span class="lineno"> 3680</span>  lastKnownGlobalOffset = -1;</div> |
| <div class="line"><a name="l03681"></a><span class="lineno"> 3681</span> }</div> |
| <div class="line"><a name="l03682"></a><span class="lineno"> 3682</span>  </div> |
| <div class="line"><a name="l03683"></a><span class="lineno"> 3683</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l03684"></a><span class="lineno"> 3684</span> ConsumerToken::ConsumerToken(BlockingConcurrentQueue<T, Traits> &queue)</div> |
| <div class="line"><a name="l03685"></a><span class="lineno"> 3685</span>  : itemsConsumedFromCurrent(0), currentProducer(nullptr), desiredProducer(nullptr) {</div> |
| <div class="line"><a name="l03686"></a><span class="lineno"> 3686</span>  initialOffset = <span class="keyword">reinterpret_cast<</span>ConcurrentQueue <T, Traits> *<span class="keyword">></span>(&queue)->nextExplicitConsumerId.fetch_add(</div> |
| <div class="line"><a name="l03687"></a><span class="lineno"> 3687</span>  1, std::memory_order_release);</div> |
| <div class="line"><a name="l03688"></a><span class="lineno"> 3688</span>  lastKnownGlobalOffset = -1;</div> |
| <div class="line"><a name="l03689"></a><span class="lineno"> 3689</span> }</div> |
| <div class="line"><a name="l03690"></a><span class="lineno"> 3690</span>  </div> |
| <div class="line"><a name="l03691"></a><span class="lineno"> 3691</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l03692"></a><span class="lineno"> 3692</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(ConcurrentQueue<T, Traits> &a, ConcurrentQueue<T, Traits> &b) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03693"></a><span class="lineno"> 3693</span>  a.swap(b);</div> |
| <div class="line"><a name="l03694"></a><span class="lineno"> 3694</span> }</div> |
| <div class="line"><a name="l03695"></a><span class="lineno"> 3695</span>  </div> |
| <div class="line"><a name="l03696"></a><span class="lineno"> 3696</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(ProducerToken &a, ProducerToken &b) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03697"></a><span class="lineno"> 3697</span>  a.swap(b);</div> |
| <div class="line"><a name="l03698"></a><span class="lineno"> 3698</span> }</div> |
| <div class="line"><a name="l03699"></a><span class="lineno"> 3699</span>  </div> |
| <div class="line"><a name="l03700"></a><span class="lineno"> 3700</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(ConsumerToken &a, ConsumerToken &b) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03701"></a><span class="lineno"> 3701</span>  a.swap(b);</div> |
| <div class="line"><a name="l03702"></a><span class="lineno"> 3702</span> }</div> |
| <div class="line"><a name="l03703"></a><span class="lineno"> 3703</span>  </div> |
| <div class="line"><a name="l03704"></a><span class="lineno"> 3704</span> <span class="keyword">template</span><<span class="keyword">typename</span> T, <span class="keyword">typename</span> Traits></div> |
| <div class="line"><a name="l03705"></a><span class="lineno"> 3705</span> <span class="keyword">inline</span> <span class="keywordtype">void</span> swap(<span class="keyword">typename</span> ConcurrentQueue<T, Traits>::ImplicitProducerKVP &a,</div> |
| <div class="line"><a name="l03706"></a><span class="lineno"> 3706</span>  <span class="keyword">typename</span> ConcurrentQueue<T, Traits>::ImplicitProducerKVP &b) MOODYCAMEL_NOEXCEPT {</div> |
| <div class="line"><a name="l03707"></a><span class="lineno"> 3707</span>  a.swap(b);</div> |
| <div class="line"><a name="l03708"></a><span class="lineno"> 3708</span> }</div> |
| <div class="line"><a name="l03709"></a><span class="lineno"> 3709</span>  </div> |
| <div class="line"><a name="l03710"></a><span class="lineno"> 3710</span> }</div> |
| <div class="line"><a name="l03711"></a><span class="lineno"> 3711</span>  </div> |
| <div class="line"><a name="l03712"></a><span class="lineno"> 3712</span> } <span class="comment">// namespace dmlc</span></div> |
| <div class="line"><a name="l03713"></a><span class="lineno"> 3713</span>  </div> |
| <div class="line"><a name="l03714"></a><span class="lineno"> 3714</span> <span class="preprocessor">#if defined(__GNUC__)</span></div> |
| <div class="line"><a name="l03715"></a><span class="lineno"> 3715</span> <span class="preprocessor">#pragma GCC diagnostic pop</span></div> |
| <div class="line"><a name="l03716"></a><span class="lineno"> 3716</span> <span class="preprocessor">#endif</span></div> |
| <div class="line"><a name="l03717"></a><span class="lineno"> 3717</span>  </div> |
| <div class="line"><a name="l03718"></a><span class="lineno"> 3718</span> <span class="preprocessor">#endif // DMLC_CONCURRENTQUEUE_H_</span></div> |
| <div class="line"><a name="l03719"></a><span class="lineno"> 3719</span>  </div> |
| </div><!-- fragment --></div><!-- contents --> |
| <div class="ttc" id="anamespacedmlc_html"><div class="ttname"><a href="namespacedmlc.html">dmlc</a></div><div class="ttdoc">namespace for dmlc</div><div class="ttdef"><b>Definition:</b> array_view.h:12</div></div> |
| <div class="ttc" id="anamespacemxnet_1_1common_1_1cuda_1_1rtc_html_aef7cd83e7f0216b689f5f9d4191d9f8b"><div class="ttname"><a href="namespacemxnet_1_1common_1_1cuda_1_1rtc.html#aef7cd83e7f0216b689f5f9d4191d9f8b">mxnet::common::cuda::rtc::lock</a></div><div class="ttdeci">std::mutex lock</div></div> |
| <div class="ttc" id="anamespacedmlc_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> |
| <div class="ttc" id="anamespacestd_html"><div class="ttname"><a href="namespacestd.html">std</a></div><div class="ttdef"><b>Definition:</b> optional.h:251</div></div> |
| <!-- start footer part --> |
| <hr class="footer"/><address class="footer"><small> |
| Generated on Thu Jan 5 2023 03:47:39 for mxnet by  <a href="http://www.doxygen.org/index.html"> |
| <img class="footer" src="doxygen.png" alt="doxygen"/> |
| </a> 1.8.17 |
| </small></address> |
| </body> |
| </html> |
