<!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.15"/>
<meta name="viewport" content="width=device-width, initial-scale=1"/>
<title>libstdc++: queue.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="navtree.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="resize.js"></script>
<script type="text/javascript" src="navtreedata.js"></script>
<script type="text/javascript" src="navtree.js"></script>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(initResizable);
/* @license-end */</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">libstdc++
</div>
</td>
</tr>
</tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.15 -->
</div><!-- top -->
<div id="side-nav" class="ui-resizable side-nav-resizable">
<div id="nav-tree">
<div id="nav-tree-contents">
<div id="nav-sync" class="sync"></div>
</div>
</div>
<div id="splitbar" style="-moz-user-select:none;"
class="ui-resizable-handle">
</div>
</div>
<script type="text/javascript">
/* @license magnet:?xt=urn:btih:cf05388f2679ee054f2beb29a391d25f4e673ac3&dn=gpl-2.0.txt GPL-v2 */
$(document).ready(function(){initNavTree('a00944_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">queue.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00944.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">// -*- C++ -*-</span></div><div class="line"><a name="l00002"></a><span class="lineno"> 2</span> </div><div class="line"><a name="l00003"></a><span class="lineno"> 3</span> <span class="comment">// Copyright (C) 2007-2018 Free Software Foundation, Inc.</span></div><div class="line"><a name="l00004"></a><span class="lineno"> 4</span> <span class="comment">//</span></div><div class="line"><a name="l00005"></a><span class="lineno"> 5</span> <span class="comment">// This file is part of the GNU ISO C++ Library. This library is free</span></div><div class="line"><a name="l00006"></a><span class="lineno"> 6</span> <span class="comment">// software; you can redistribute it and/or modify it under the terms</span></div><div class="line"><a name="l00007"></a><span class="lineno"> 7</span> <span class="comment">// of the GNU General Public License as published by the Free Software</span></div><div class="line"><a name="l00008"></a><span class="lineno"> 8</span> <span class="comment">// Foundation; either version 3, or (at your option) any later</span></div><div class="line"><a name="l00009"></a><span class="lineno"> 9</span> <span class="comment">// version.</span></div><div class="line"><a name="l00010"></a><span class="lineno"> 10</span> </div><div class="line"><a name="l00011"></a><span class="lineno"> 11</span> <span class="comment">// This library is distributed in the hope that it will be useful, but</span></div><div class="line"><a name="l00012"></a><span class="lineno"> 12</span> <span class="comment">// WITHOUT ANY WARRANTY; without even the implied warranty of</span></div><div class="line"><a name="l00013"></a><span class="lineno"> 13</span> <span class="comment">// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU</span></div><div class="line"><a name="l00014"></a><span class="lineno"> 14</span> <span class="comment">// General Public License for more details.</span></div><div class="line"><a name="l00015"></a><span class="lineno"> 15</span> </div><div class="line"><a name="l00016"></a><span class="lineno"> 16</span> <span class="comment">// Under Section 7 of GPL version 3, you are granted additional</span></div><div class="line"><a name="l00017"></a><span class="lineno"> 17</span> <span class="comment">// permissions described in the GCC Runtime Library Exception, version</span></div><div class="line"><a name="l00018"></a><span class="lineno"> 18</span> <span class="comment">// 3.1, as published by the Free Software Foundation.</span></div><div class="line"><a name="l00019"></a><span class="lineno"> 19</span> </div><div class="line"><a name="l00020"></a><span class="lineno"> 20</span> <span class="comment">// You should have received a copy of the GNU General Public License and</span></div><div class="line"><a name="l00021"></a><span class="lineno"> 21</span> <span class="comment">// a copy of the GCC Runtime Library Exception along with this program;</span></div><div class="line"><a name="l00022"></a><span class="lineno"> 22</span> <span class="comment">// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see</span></div><div class="line"><a name="l00023"></a><span class="lineno"> 23</span> <span class="comment">// <http://www.gnu.org/licenses/>.</span></div><div class="line"><a name="l00024"></a><span class="lineno"> 24</span> <span class="comment"></span></div><div class="line"><a name="l00025"></a><span class="lineno"> 25</span> <span class="comment">/** @file parallel/queue.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Lock-free double-ended queue.</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> */</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> </div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> <span class="comment">// Written by Johannes Singler.</span></div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> </div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_QUEUE_H</span></div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_QUEUE_H 1</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> </div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> <span class="preprocessor">#include <<a class="code" href="a00971.html">parallel/types.h</a>></span></div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <<a class="code" href="a16491.html">parallel/base.h</a>></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a16530.html">parallel/compatibility.h</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="comment"></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="comment">/** @brief Decide whether to declare certain variable volatile in this file. */</span></div><div class="line"><a name="l00040"></a><span class="lineno"><a class="line" href="a00944.html#a1c61e6ca8bdd220c11ec4b64f7539712"> 40</a></span> <span class="preprocessor">#define _GLIBCXX_VOLATILE volatile</span></div><div class="line"><a name="l00041"></a><span class="lineno"> 41</span> </div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> <span class="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> {<span class="comment"></span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> /**@brief Double-ended queue of bounded size, allowing lock-free</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * atomic access. push_front() and pop_front() must not be called</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> * concurrently to each other, while pop_back() can be called</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * concurrently at all times.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * @c empty(), @c size(), and @c top() are intentionally not provided.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * Calling them would not make sense in a concurrent setting.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * @param _Tp Contained element type. */</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _Tp></div><div class="line"><a name="l00052"></a><span class="lineno"><a class="line" href="a09603.html"> 52</a></span>  <span class="keyword">class </span><a class="code" href="a09603.html">_RestrictedBoundedConcurrentQueue</a></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="keyword">private</span>:<span class="comment"></span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> /** @brief Array of elements, seen as cyclic buffer. */</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  _Tp* _M_base;</div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"></span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> /** @brief Maximal number of elements contained at the same time. */</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  <a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> _M_max_size;</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span> <span class="comment"></span></div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span> <span class="comment"> /** @brief Cyclic __begin and __end pointers contained in one</span></div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span> <span class="comment"> atomically changeable value. */</span></div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <a class="code" href="a00944.html#a1c61e6ca8bdd220c11ec4b64f7539712">_GLIBCXX_VOLATILE</a> <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> _M_borders;</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span> </div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">public</span>:<span class="comment"></span></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span> <span class="comment"> /** @brief Constructor. Not to be called concurrent, of course.</span></div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span> <span class="comment"> * @param __max_size Maximal number of elements to be contained. */</span></div><div class="line"><a name="l00068"></a><span class="lineno"><a class="line" href="a09603.html#a7070da9f66983a3fa24ae4dc92614c0c"> 68</a></span>  <a class="code" href="a09603.html#a7070da9f66983a3fa24ae4dc92614c0c">_RestrictedBoundedConcurrentQueue</a>(<a class="code" href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">_SequenceIndex</a> __max_size)</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  {</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  _M_max_size = __max_size;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  _M_base = <span class="keyword">new</span> _Tp[__max_size];</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  _M_borders = <a class="code" href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__encode2</a>(0, 0);</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span> <span class="preprocessor">#pragma omp flush</span></div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  }</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span> <span class="comment"></span></div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span> <span class="comment"> /** @brief Destructor. Not to be called concurrent, of course. */</span></div><div class="line"><a name="l00077"></a><span class="lineno"><a class="line" href="a09603.html#a0e201d45c998cc913577af578f0b9a16"> 77</a></span>  <a class="code" href="a09603.html#a0e201d45c998cc913577af578f0b9a16">~_RestrictedBoundedConcurrentQueue</a>()</div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span>  { <span class="keyword">delete</span>[] _M_base; }</div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"></span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> /** @brief Pushes one element into the queue at the front end.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * Must not be called concurrently with pop_front(). */</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  <span class="keywordtype">void</span></div><div class="line"><a name="l00083"></a><span class="lineno"><a class="line" href="a09603.html#a2ac4fcc26b5a8e8d3db9993ca3b6f777"> 83</a></span>  <a class="code" href="a09603.html#a2ac4fcc26b5a8e8d3db9993ca3b6f777">push_front</a>(<span class="keyword">const</span> _Tp& __t)</div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> __former_borders = _M_borders;</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keywordtype">int</span> __former_front, __former_back;</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <a class="code" href="a01575.html#aee3989c0ed2561801b8a6c0282008cca">__decode2</a>(__former_borders, __former_front, __former_back);</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  *(_M_base + __former_front % _M_max_size) = __t;</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span> <span class="preprocessor">#if _GLIBCXX_PARALLEL_ASSERTIONS</span></div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  <span class="comment">// Otherwise: front - back > _M_max_size eventually.</span></div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  _GLIBCXX_PARALLEL_ASSERT(((__former_front + 1) - __former_back)</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <= _M_max_size);</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span> <span class="preprocessor">#endif</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <a class="code" href="a01575.html#a56a5a84c8a6049cd3cc83968c6eae088">__fetch_and_add</a>(&_M_borders, <a class="code" href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__encode2</a>(1, 0));</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  }</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span> <span class="comment"></span></div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> <span class="comment"> /** @brief Pops one element from the queue at the front end.</span></div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span> <span class="comment"> * Must not be called concurrently with pop_front(). */</span></div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00100"></a><span class="lineno"><a class="line" href="a09603.html#a4b760899cefaccb86586c447b12c4cc3"> 100</a></span>  <a class="code" href="a09603.html#a4b760899cefaccb86586c447b12c4cc3">pop_front</a>(_Tp& __t)</div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  {</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  <span class="keywordtype">int</span> __former_front, __former_back;</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> <span class="preprocessor">#pragma omp flush</span></div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <a class="code" href="a01575.html#aee3989c0ed2561801b8a6c0282008cca">__decode2</a>(_M_borders, __former_front, __former_back);</div><div class="line"><a name="l00105"></a><span class="lineno"> 105</span>  <span class="keywordflow">while</span> (__former_front > __former_back)</div><div class="line"><a name="l00106"></a><span class="lineno"> 106</span>  {</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="comment">// Chance.</span></div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> __former_borders = <a class="code" href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__encode2</a>(__former_front,</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  __former_back);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> __new_borders = <a class="code" href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__encode2</a>(__former_front - 1,</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span>  __former_back);</div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  <span class="keywordflow">if</span> (<a class="code" href="a01575.html#accd4441e0f846fee44966195a91e9e68">__compare_and_swap</a>(&_M_borders, __former_borders,</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  __new_borders))</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  {</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  __t = *(_M_base + (__former_front - 1) % _M_max_size);</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</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="preprocessor">#pragma omp flush</span></div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span>  <a class="code" href="a01575.html#aee3989c0ed2561801b8a6c0282008cca">__decode2</a>(_M_borders, __former_front, __former_back);</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  }</div><div class="line"><a name="l00121"></a><span class="lineno"> 121</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00122"></a><span class="lineno"> 122</span>  }</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span> <span class="comment"></span></div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> <span class="comment"> /** @brief Pops one element from the queue at the front end.</span></div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span> <span class="comment"> * Must not be called concurrently with pop_front(). */</span></div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="keywordtype">bool</span></div><div class="line"><a name="l00127"></a><span class="lineno"><a class="line" href="a09603.html#aff5854a49d63fcd08aae08eb282361e7"> 127</a></span>  <a class="code" href="a09603.html#aff5854a49d63fcd08aae08eb282361e7">pop_back</a>(_Tp& __t) <span class="comment">//queue behavior</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  {</div><div class="line"><a name="l00129"></a><span class="lineno"> 129</span>  <span class="keywordtype">int</span> __former_front, __former_back;</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span> <span class="preprocessor">#pragma omp flush</span></div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  <a class="code" href="a01575.html#aee3989c0ed2561801b8a6c0282008cca">__decode2</a>(_M_borders, __former_front, __former_back);</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  <span class="keywordflow">while</span> (__former_front > __former_back)</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  {</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  <span class="comment">// Chance.</span></div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> __former_borders = <a class="code" href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__encode2</a>(__former_front,</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __former_back);</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <a class="code" href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">_CASable</a> __new_borders = <a class="code" href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__encode2</a>(__former_front,</div><div class="line"><a name="l00138"></a><span class="lineno"> 138</span>  __former_back + 1);</div><div class="line"><a name="l00139"></a><span class="lineno"> 139</span>  <span class="keywordflow">if</span> (<a class="code" href="a01575.html#accd4441e0f846fee44966195a91e9e68">__compare_and_swap</a>(&_M_borders, __former_borders,</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  __new_borders))</div><div class="line"><a name="l00141"></a><span class="lineno"> 141</span>  {</div><div class="line"><a name="l00142"></a><span class="lineno"> 142</span>  __t = *(_M_base + __former_back % _M_max_size);</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</span>  <span class="keywordflow">return</span> <span class="keyword">true</span>;</div><div class="line"><a name="l00144"></a><span class="lineno"> 144</span>  }</div><div class="line"><a name="l00145"></a><span class="lineno"> 145</span> <span class="preprocessor">#pragma omp flush</span></div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  <a class="code" href="a01575.html#aee3989c0ed2561801b8a6c0282008cca">__decode2</a>(_M_borders, __former_front, __former_back);</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  }</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  <span class="keywordflow">return</span> <span class="keyword">false</span>;</div><div class="line"><a name="l00149"></a><span class="lineno"> 149</span>  }</div><div class="line"><a name="l00150"></a><span class="lineno"> 150</span>  };</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span> } <span class="comment">//namespace __gnu_parallel</span></div><div class="line"><a name="l00152"></a><span class="lineno"> 152</span> </div><div class="line"><a name="l00153"></a><span class="lineno"> 153</span> <span class="preprocessor">#undef _GLIBCXX_VOLATILE</span></div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span> </div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_QUEUE_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a00971_html"><div class="ttname"><a href="a00971.html">types.h</a></div><div class="ttdoc">Basic types and typedefs. This file is a GNU parallel extension to the Standard C++ Library.</div></div>
<div class="ttc" id="a00944_html_a1c61e6ca8bdd220c11ec4b64f7539712"><div class="ttname"><a href="a00944.html#a1c61e6ca8bdd220c11ec4b64f7539712">_GLIBCXX_VOLATILE</a></div><div class="ttdeci">#define _GLIBCXX_VOLATILE</div><div class="ttdoc">Decide whether to declare certain variable volatile in this file.</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00040">queue.h:40</a></div></div>
<div class="ttc" id="a09603_html"><div class="ttname"><a href="a09603.html">__gnu_parallel::_RestrictedBoundedConcurrentQueue</a></div><div class="ttdoc">Double-ended queue of bounded size, allowing lock-free atomic access. push_front() and pop_front() mu...</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00052">queue.h:52</a></div></div>
<div class="ttc" id="a01575_html_a7fcc29eb3f2d9c83756a9d99b4105b3b"><div class="ttname"><a href="a01575.html#a7fcc29eb3f2d9c83756a9d99b4105b3b">__gnu_parallel::__encode2</a></div><div class="ttdeci">_CASable __encode2(int __a, int __b)</div><div class="ttdoc">Encode two integers into one gnu_parallel::_CASable.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00119">parallel/base.h:119</a></div></div>
<div class="ttc" id="a01575_html_aa1171c39f9e5afad6392c7aeefb81115"><div class="ttname"><a href="a01575.html#aa1171c39f9e5afad6392c7aeefb81115">__gnu_parallel::_CASable</a></div><div class="ttdeci">int64_t _CASable</div><div class="ttdoc">Longest compare-and-swappable integer type on this platform.</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00127">types.h:127</a></div></div>
<div class="ttc" id="a09603_html_a7070da9f66983a3fa24ae4dc92614c0c"><div class="ttname"><a href="a09603.html#a7070da9f66983a3fa24ae4dc92614c0c">__gnu_parallel::_RestrictedBoundedConcurrentQueue::_RestrictedBoundedConcurrentQueue</a></div><div class="ttdeci">_RestrictedBoundedConcurrentQueue(_SequenceIndex __max_size)</div><div class="ttdoc">Constructor. Not to be called concurrent, of course.</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00068">queue.h:68</a></div></div>
<div class="ttc" id="a01575_html_accd4441e0f846fee44966195a91e9e68"><div class="ttname"><a href="a01575.html#accd4441e0f846fee44966195a91e9e68">__gnu_parallel::__compare_and_swap</a></div><div class="ttdeci">bool __compare_and_swap(volatile _Tp *__ptr, _Tp __comparand, _Tp __replacement)</div><div class="ttdoc">Compare-and-swap.</div><div class="ttdef"><b>Definition:</b> <a href="a16530_source.html#l00108">parallel/compatibility.h:108</a></div></div>
<div class="ttc" id="a01575_html_a56a5a84c8a6049cd3cc83968c6eae088"><div class="ttname"><a href="a01575.html#a56a5a84c8a6049cd3cc83968c6eae088">__gnu_parallel::__fetch_and_add</a></div><div class="ttdeci">_Tp __fetch_and_add(volatile _Tp *__ptr, _Tp __addend)</div><div class="ttdoc">Add a value to a variable, atomically.</div><div class="ttdef"><b>Definition:</b> <a href="a16530_source.html#l00074">parallel/compatibility.h:74</a></div></div>
<div class="ttc" id="a16491_html"><div class="ttname"><a href="a16491.html">base.h</a></div><div class="ttdoc">Sequential helper functions. This file is a GNU parallel extension to the Standard C++ Library.</div></div>
<div class="ttc" id="a09603_html_a4b760899cefaccb86586c447b12c4cc3"><div class="ttname"><a href="a09603.html#a4b760899cefaccb86586c447b12c4cc3">__gnu_parallel::_RestrictedBoundedConcurrentQueue::pop_front</a></div><div class="ttdeci">bool pop_front(_Tp &__t)</div><div class="ttdoc">Pops one element from the queue at the front end. Must not be called concurrently with pop_front().</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00100">queue.h:100</a></div></div>
<div class="ttc" id="a01575_html"><div class="ttname"><a href="a01575.html">__gnu_parallel</a></div><div class="ttdoc">GNU parallel code for public use.</div><div class="ttdef"><b>Definition:</b> <a href="a00872_source.html#l00061">balanced_quicksort.h:61</a></div></div>
<div class="ttc" id="a16530_html"><div class="ttname"><a href="a16530.html">compatibility.h</a></div><div class="ttdoc">Compatibility layer, mostly concerned with atomic operations.</div></div>
<div class="ttc" id="a09603_html_a0e201d45c998cc913577af578f0b9a16"><div class="ttname"><a href="a09603.html#a0e201d45c998cc913577af578f0b9a16">__gnu_parallel::_RestrictedBoundedConcurrentQueue::~_RestrictedBoundedConcurrentQueue</a></div><div class="ttdeci">~_RestrictedBoundedConcurrentQueue()</div><div class="ttdoc">Destructor. Not to be called concurrent, of course.</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00077">queue.h:77</a></div></div>
<div class="ttc" id="a01575_html_aee3989c0ed2561801b8a6c0282008cca"><div class="ttname"><a href="a01575.html#aee3989c0ed2561801b8a6c0282008cca">__gnu_parallel::__decode2</a></div><div class="ttdeci">void __decode2(_CASable __x, int &__a, int &__b)</div><div class="ttdoc">Decode two integers from one gnu_parallel::_CASable.</div><div class="ttdef"><b>Definition:</b> <a href="a16491_source.html#l00133">parallel/base.h:133</a></div></div>
<div class="ttc" id="a09603_html_a2ac4fcc26b5a8e8d3db9993ca3b6f777"><div class="ttname"><a href="a09603.html#a2ac4fcc26b5a8e8d3db9993ca3b6f777">__gnu_parallel::_RestrictedBoundedConcurrentQueue::push_front</a></div><div class="ttdeci">void push_front(const _Tp &__t)</div><div class="ttdoc">Pushes one element into the queue at the front end. Must not be called concurrently with pop_front().</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00083">queue.h:83</a></div></div>
<div class="ttc" id="a09603_html_aff5854a49d63fcd08aae08eb282361e7"><div class="ttname"><a href="a09603.html#aff5854a49d63fcd08aae08eb282361e7">__gnu_parallel::_RestrictedBoundedConcurrentQueue::pop_back</a></div><div class="ttdeci">bool pop_back(_Tp &__t)</div><div class="ttdoc">Pops one element from the queue at the front end. Must not be called concurrently with pop_front().</div><div class="ttdef"><b>Definition:</b> <a href="a00944_source.html#l00127">queue.h:127</a></div></div>
<div class="ttc" id="a01575_html_a1cbb61a4863a306daa23823d89f9bef1"><div class="ttname"><a href="a01575.html#a1cbb61a4863a306daa23823d89f9bef1">__gnu_parallel::_SequenceIndex</a></div><div class="ttdeci">uint64_t _SequenceIndex</div><div class="ttdoc">Unsigned integer to index __elements. The total number of elements for each algorithm must fit into t...</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00117">types.h:117</a></div></div>
</div><!-- fragment --></div><!-- contents -->
</div><!-- doc-content -->
<!-- start footer part -->
<div id="nav-path" class="navpath"><!-- id is needed for treeview function! -->
<ul>
<li class="navelem"><a class="el" href="dir_47f59b4ef76325ed55a7fd4bed4be05b.html">include</a></li><li class="navelem"><a class="el" href="dir_8c50ddefd65cfbc3979f354ad979e527.html">parallel</a></li><li class="navelem"><a class="el" href="a00944.html">queue.h</a></li>
<li class="footer">Generated by
<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/></a> 1.8.15 </li>
</ul>
</div>
</body>
</html>
distrib
>
Mageia
>
7
>
armv7hl
>
media
>
core-updates
>
by-pkgid
>
bfb47da7e0322bcb0e23e4b1838d9db9
>
files
>
838
