<!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++: partial_sum.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('a00938_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">partial_sum.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00938.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/partial_sum.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallel implementation of std::partial_sum(), i.e. prefix</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment">* sums.</span></div><div class="line"><a name="l00028"></a><span class="lineno"> 28</span> <span class="comment"> * This file is a GNU parallel extension to the Standard C++ Library.</span></div><div class="line"><a name="l00029"></a><span class="lineno"> 29</span> <span class="comment"> */</span></div><div class="line"><a name="l00030"></a><span class="lineno"> 30</span> </div><div class="line"><a name="l00031"></a><span class="lineno"> 31</span> <span class="comment">// Written by Johannes Singler.</span></div><div class="line"><a name="l00032"></a><span class="lineno"> 32</span> </div><div class="line"><a name="l00033"></a><span class="lineno"> 33</span> <span class="preprocessor">#ifndef _GLIBCXX_PARALLEL_PARTIAL_SUM_H</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_PARTIAL_SUM_H 1</span></div><div class="line"><a name="l00035"></a><span class="lineno"> 35</span> </div><div class="line"><a name="l00036"></a><span class="lineno"> 36</span> <span class="preprocessor">#include <omp.h></span></div><div class="line"><a name="l00037"></a><span class="lineno"> 37</span> <span class="preprocessor">#include <<a class="code" href="a00032.html">new</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a00530.html">bits/stl_algobase.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <<a class="code" href="a00935.html">parallel/parallel.h</a>></span></div><div class="line"><a name="l00040"></a><span class="lineno"> 40</span> <span class="preprocessor">#include <<a class="code" href="a00923.html">parallel/numericfwd.h</a>></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> {</div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span>  <span class="comment">// Problem: there is no 0-element given.</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"></span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> /** @brief Base case prefix sum routine.</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * @param __result Begin iterator of output sequence.</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * @param __bin_op Associative binary function.</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * @param __value Start value. Must be passed since the neutral</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * element is unknown in general.</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * @return End iterator of output sequence. */</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter,</div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span>  <span class="keyword">typename</span> _OutputIterator,</div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span>  <span class="keyword">typename</span> _BinaryOperation></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span>  _OutputIterator</div><div class="line"><a name="l00058"></a><span class="lineno"><a class="line" href="a01575.html#adeded88310546a7c54d73464bee998e2"> 58</a></span>  <a class="code" href="a01575.html#adeded88310546a7c54d73464bee998e2">__parallel_partial_sum_basecase</a>(_IIter __begin, _IIter __end,</div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span>  _OutputIterator __result,</div><div class="line"><a name="l00060"></a><span class="lineno"> 60</span>  _BinaryOperation __bin_op,</div><div class="line"><a name="l00061"></a><span class="lineno"> 61</span>  <span class="keyword">typename</span> std::iterator_traits <_IIter>::value_type __value)</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  {</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keywordflow">if</span> (__begin == __end)</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span> </div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  <span class="keywordflow">while</span> (__begin != __end)</div><div class="line"><a name="l00067"></a><span class="lineno"> 67</span>  {</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  __value = __bin_op(__value, *__begin);</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  *__result = __value;</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  ++__result;</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  ++__begin;</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  }</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keywordflow">return</span> __result;</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 Parallel partial sum implementation, two-phase approach,</span></div><div class="line"><a name="l00077"></a><span class="lineno"> 77</span> <span class="comment"> no recursion.</span></div><div class="line"><a name="l00078"></a><span class="lineno"> 78</span> <span class="comment"> * @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span> <span class="comment"> * @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> <span class="comment"> * @param __result Begin iterator of output sequence.</span></div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="comment"> * @param __bin_op Associative binary function.</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span> <span class="comment"> * @param __n Length of sequence.</span></div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="comment"> * @return End iterator of output sequence.</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span> <span class="comment"> */</span></div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter,</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  <span class="keyword">typename</span> _OutputIterator,</div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  <span class="keyword">typename</span> _BinaryOperation></div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  _OutputIterator</div><div class="line"><a name="l00089"></a><span class="lineno"><a class="line" href="a01575.html#a63017e821c2b4ff9f90c3641bc45f001"> 89</a></span>  <a class="code" href="a01575.html#a63017e821c2b4ff9f90c3641bc45f001">__parallel_partial_sum_linear</a>(_IIter __begin, _IIter __end,</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span>  _OutputIterator __result,</div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  _BinaryOperation __bin_op,</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span>  <span class="keyword">typename</span> std::iterator_traits<_IIter>::difference_type __n)</div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  {</div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  <span class="keyword">typedef</span> std::iterator_traits<_IIter> _TraitsType;</div><div class="line"><a name="l00095"></a><span class="lineno"> 95</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00096"></a><span class="lineno"> 96</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span> </div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  <span class="keywordflow">if</span> (__begin == __end)</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span>  <span class="keywordflow">return</span> __result;</div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span> </div><div class="line"><a name="l00101"></a><span class="lineno"> 101</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads =</div><div class="line"><a name="l00102"></a><span class="lineno"> 102</span>  std::min<_DifferenceType>(__get_max_threads(), __n - 1);</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span> </div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  <span class="keywordflow">if</span> (__num_threads < 2)</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>  *__result = *__begin;</div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  <span class="keywordflow">return</span> <a class="code" href="a01575.html#adeded88310546a7c54d73464bee998e2">__parallel_partial_sum_basecase</a>(__begin + 1, __end,</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span>  __result + 1, __bin_op,</div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  *__begin);</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  }</div><div class="line"><a name="l00111"></a><span class="lineno"> 111</span> </div><div class="line"><a name="l00112"></a><span class="lineno"> 112</span>  _DifferenceType* __borders;</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  _ValueType* __sums;</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>  <span class="keyword">const</span> <a class="code" href="a09635.html">_Settings</a>& __s = <a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>();</div><div class="line"><a name="l00116"></a><span class="lineno"> 116</span> </div><div class="line"><a name="l00117"></a><span class="lineno"> 117</span> <span class="preprocessor"># pragma omp parallel num_threads(__num_threads)</span></div><div class="line"><a name="l00118"></a><span class="lineno"> 118</span>  {</div><div class="line"><a name="l00119"></a><span class="lineno"> 119</span> <span class="preprocessor"># pragma omp single</span></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>  __num_threads = omp_get_num_threads();</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>  __borders = <span class="keyword">new</span> _DifferenceType[__num_threads + 2];</div><div class="line"><a name="l00124"></a><span class="lineno"> 124</span> </div><div class="line"><a name="l00125"></a><span class="lineno"> 125</span>  <span class="keywordflow">if</span> (__s.<a class="code" href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e">partial_sum_dilation</a> == 1.0f)</div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <a class="code" href="a01575.html#ac799255921e70b0378d145924d673f9c">__equally_split</a>(__n, __num_threads + 1, __borders);</div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="keywordflow">else</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>  _DifferenceType __first_part_length =</div><div class="line"><a name="l00130"></a><span class="lineno"> 130</span>  std::max<_DifferenceType>(1,</div><div class="line"><a name="l00131"></a><span class="lineno"> 131</span>  __n / (1.0f + __s.<a class="code" href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e">partial_sum_dilation</a> * __num_threads));</div><div class="line"><a name="l00132"></a><span class="lineno"> 132</span>  _DifferenceType __chunk_length =</div><div class="line"><a name="l00133"></a><span class="lineno"> 133</span>  (__n - __first_part_length) / __num_threads;</div><div class="line"><a name="l00134"></a><span class="lineno"> 134</span>  _DifferenceType __borderstart =</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  __n - __num_threads * __chunk_length;</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span>  __borders[0] = 0;</div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __i = 1; __i < (__num_threads + 1); ++__i)</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>  __borders[__i] = __borderstart;</div><div class="line"><a name="l00140"></a><span class="lineno"> 140</span>  __borderstart += __chunk_length;</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>  __borders[__num_threads + 1] = __n;</div><div class="line"><a name="l00143"></a><span class="lineno"> 143</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>  __sums = static_cast<_ValueType*>(::<span class="keyword">operator</span> <span class="keyword">new</span>(<span class="keyword">sizeof</span>(_ValueType)</div><div class="line"><a name="l00146"></a><span class="lineno"> 146</span>  * __num_threads));</div><div class="line"><a name="l00147"></a><span class="lineno"> 147</span>  _OutputIterator __target_end;</div><div class="line"><a name="l00148"></a><span class="lineno"> 148</span>  } <span class="comment">//single</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>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam = omp_get_thread_num();</div><div class="line"><a name="l00151"></a><span class="lineno"> 151</span>  <span class="keywordflow">if</span> (__iam == 0)</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>  *__result = *__begin;</div><div class="line"><a name="l00154"></a><span class="lineno"> 154</span>  <a class="code" href="a01575.html#adeded88310546a7c54d73464bee998e2">__parallel_partial_sum_basecase</a>(__begin + 1,</div><div class="line"><a name="l00155"></a><span class="lineno"> 155</span>  __begin + __borders[1],</div><div class="line"><a name="l00156"></a><span class="lineno"> 156</span>  __result + 1,</div><div class="line"><a name="l00157"></a><span class="lineno"> 157</span>  __bin_op, *__begin);</div><div class="line"><a name="l00158"></a><span class="lineno"> 158</span>  ::new(&(__sums[__iam])) _ValueType(*(__result + __borders[1] - 1));</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="keywordflow">else</span></div><div class="line"><a name="l00161"></a><span class="lineno"> 161</span>  {</div><div class="line"><a name="l00162"></a><span class="lineno"> 162</span>  ::new(&(__sums[__iam]))</div><div class="line"><a name="l00163"></a><span class="lineno"> 163</span>  _ValueType(<a class="code" href="a01541.html#aa0acc8476d79019e12bb3eab3702a352">__gnu_parallel::accumulate</a>(</div><div class="line"><a name="l00164"></a><span class="lineno"> 164</span>  __begin + __borders[__iam] + 1,</div><div class="line"><a name="l00165"></a><span class="lineno"> 165</span>  __begin + __borders[__iam + 1],</div><div class="line"><a name="l00166"></a><span class="lineno"> 166</span>  *(__begin + __borders[__iam]),</div><div class="line"><a name="l00167"></a><span class="lineno"> 167</span>  __bin_op,</div><div class="line"><a name="l00168"></a><span class="lineno"> 168</span>  <a class="code" href="a09639.html">__gnu_parallel::sequential_tag</a>()));</div><div class="line"><a name="l00169"></a><span class="lineno"> 169</span>  }</div><div class="line"><a name="l00170"></a><span class="lineno"> 170</span> </div><div class="line"><a name="l00171"></a><span class="lineno"> 171</span> <span class="preprocessor"># pragma omp barrier</span></div><div class="line"><a name="l00172"></a><span class="lineno"> 172</span> </div><div class="line"><a name="l00173"></a><span class="lineno"> 173</span> <span class="preprocessor"># pragma omp single</span></div><div class="line"><a name="l00174"></a><span class="lineno"> 174</span>  <a class="code" href="a01575.html#adeded88310546a7c54d73464bee998e2">__parallel_partial_sum_basecase</a>(__sums + 1, __sums + __num_threads,</div><div class="line"><a name="l00175"></a><span class="lineno"> 175</span>  __sums + 1, __bin_op, __sums[0]);</div><div class="line"><a name="l00176"></a><span class="lineno"> 176</span> </div><div class="line"><a name="l00177"></a><span class="lineno"> 177</span> <span class="preprocessor"># pragma omp barrier</span></div><div class="line"><a name="l00178"></a><span class="lineno"> 178</span> </div><div class="line"><a name="l00179"></a><span class="lineno"> 179</span>  <span class="comment">// Still same team.</span></div><div class="line"><a name="l00180"></a><span class="lineno"> 180</span>  <a class="code" href="a01575.html#adeded88310546a7c54d73464bee998e2">__parallel_partial_sum_basecase</a>(__begin + __borders[__iam + 1],</div><div class="line"><a name="l00181"></a><span class="lineno"> 181</span>  __begin + __borders[__iam + 2],</div><div class="line"><a name="l00182"></a><span class="lineno"> 182</span>  __result + __borders[__iam + 1],</div><div class="line"><a name="l00183"></a><span class="lineno"> 183</span>  __bin_op, __sums[__iam]);</div><div class="line"><a name="l00184"></a><span class="lineno"> 184</span>  } <span class="comment">//parallel</span></div><div class="line"><a name="l00185"></a><span class="lineno"> 185</span> </div><div class="line"><a name="l00186"></a><span class="lineno"> 186</span>  <span class="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __i = 0; __i < __num_threads; ++__i)</div><div class="line"><a name="l00187"></a><span class="lineno"> 187</span>  __sums[__i].~_ValueType();</div><div class="line"><a name="l00188"></a><span class="lineno"> 188</span>  ::operator <span class="keyword">delete</span>(__sums);</div><div class="line"><a name="l00189"></a><span class="lineno"> 189</span> </div><div class="line"><a name="l00190"></a><span class="lineno"> 190</span>  <span class="keyword">delete</span>[] __borders;</div><div class="line"><a name="l00191"></a><span class="lineno"> 191</span> </div><div class="line"><a name="l00192"></a><span class="lineno"> 192</span>  <span class="keywordflow">return</span> __result + __n;</div><div class="line"><a name="l00193"></a><span class="lineno"> 193</span>  }</div><div class="line"><a name="l00194"></a><span class="lineno"> 194</span> <span class="comment"></span></div><div class="line"><a name="l00195"></a><span class="lineno"> 195</span> <span class="comment"> /** @brief Parallel partial sum front-__end.</span></div><div class="line"><a name="l00196"></a><span class="lineno"> 196</span> <span class="comment"> * @param __begin Begin iterator of input sequence.</span></div><div class="line"><a name="l00197"></a><span class="lineno"> 197</span> <span class="comment"> * @param __end End iterator of input sequence.</span></div><div class="line"><a name="l00198"></a><span class="lineno"> 198</span> <span class="comment"> * @param __result Begin iterator of output sequence.</span></div><div class="line"><a name="l00199"></a><span class="lineno"> 199</span> <span class="comment"> * @param __bin_op Associative binary function.</span></div><div class="line"><a name="l00200"></a><span class="lineno"> 200</span> <span class="comment"> * @return End iterator of output sequence. */</span></div><div class="line"><a name="l00201"></a><span class="lineno"> 201</span>  <span class="keyword">template</span><<span class="keyword">typename</span> _IIter,</div><div class="line"><a name="l00202"></a><span class="lineno"> 202</span>  <span class="keyword">typename</span> _OutputIterator,</div><div class="line"><a name="l00203"></a><span class="lineno"> 203</span>  <span class="keyword">typename</span> _BinaryOperation></div><div class="line"><a name="l00204"></a><span class="lineno"> 204</span>  _OutputIterator</div><div class="line"><a name="l00205"></a><span class="lineno"><a class="line" href="a01575.html#a0cf4a05b6f849cae06f9fb6098eb0628"> 205</a></span>  <a class="code" href="a01575.html#a0cf4a05b6f849cae06f9fb6098eb0628">__parallel_partial_sum</a>(_IIter __begin, _IIter __end,</div><div class="line"><a name="l00206"></a><span class="lineno"> 206</span>  _OutputIterator __result, _BinaryOperation __bin_op)</div><div class="line"><a name="l00207"></a><span class="lineno"> 207</span>  {</div><div class="line"><a name="l00208"></a><span class="lineno"> 208</span>  <a class="code" href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a>(__begin - __end)</div><div class="line"><a name="l00209"></a><span class="lineno"> 209</span> </div><div class="line"><a name="l00210"></a><span class="lineno"> 210</span>  <span class="keyword">typedef</span> std::iterator_traits<_IIter> _TraitsType;</div><div class="line"><a name="l00211"></a><span class="lineno"> 211</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::value_type _ValueType;</div><div class="line"><a name="l00212"></a><span class="lineno"> 212</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</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>  _DifferenceType __n = __end - __begin;</div><div class="line"><a name="l00215"></a><span class="lineno"> 215</span> </div><div class="line"><a name="l00216"></a><span class="lineno"> 216</span>  <span class="keywordflow">switch</span> (<a class="code" href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">_Settings::get</a>().partial_sum_algorithm)</div><div class="line"><a name="l00217"></a><span class="lineno"> 217</span>  {</div><div class="line"><a name="l00218"></a><span class="lineno"> 218</span>  <span class="keywordflow">case</span> LINEAR:</div><div class="line"><a name="l00219"></a><span class="lineno"> 219</span>  <span class="comment">// Need an initial offset.</span></div><div class="line"><a name="l00220"></a><span class="lineno"> 220</span>  <span class="keywordflow">return</span> <a class="code" href="a01575.html#a63017e821c2b4ff9f90c3641bc45f001">__parallel_partial_sum_linear</a>(__begin, __end, __result,</div><div class="line"><a name="l00221"></a><span class="lineno"> 221</span>  __bin_op, __n);</div><div class="line"><a name="l00222"></a><span class="lineno"> 222</span>  <span class="keywordflow">default</span>:</div><div class="line"><a name="l00223"></a><span class="lineno"> 223</span>  <span class="comment">// Partial_sum algorithm not implemented.</span></div><div class="line"><a name="l00224"></a><span class="lineno"> 224</span>  _GLIBCXX_PARALLEL_ASSERT(0);</div><div class="line"><a name="l00225"></a><span class="lineno"> 225</span>  <span class="keywordflow">return</span> __result + __n;</div><div class="line"><a name="l00226"></a><span class="lineno"> 226</span>  }</div><div class="line"><a name="l00227"></a><span class="lineno"> 227</span>  }</div><div class="line"><a name="l00228"></a><span class="lineno"> 228</span> }</div><div class="line"><a name="l00229"></a><span class="lineno"> 229</span> </div><div class="line"><a name="l00230"></a><span class="lineno"> 230</span> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_PARTIAL_SUM_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a09639_html"><div class="ttname"><a href="a09639.html">__gnu_parallel::sequential_tag</a></div><div class="ttdoc">Forces sequential execution at compile time.</div><div class="ttdef"><b>Definition:</b> <a href="a00968_source.html#l00042">tags.h:42</a></div></div>
<div class="ttc" id="a09635_html"><div class="ttname"><a href="a09635.html">__gnu_parallel::_Settings</a></div><div class="ttdoc">class _Settings Run-time settings for the parallel mode including all tunable parameters.</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00123">settings.h:123</a></div></div>
<div class="ttc" id="a00530_html"><div class="ttname"><a href="a00530.html">stl_algobase.h</a></div></div>
<div class="ttc" id="a09635_html_a781c6a0034d1669b90e37407e1c6d09e"><div class="ttname"><a href="a09635.html#a781c6a0034d1669b90e37407e1c6d09e">__gnu_parallel::_Settings::partial_sum_dilation</a></div><div class="ttdeci">float partial_sum_dilation</div><div class="ttdoc">Ratio for partial_sum. Assume "sum and write result" to be this factor slower than just "sum".</div><div class="ttdef"><b>Definition:</b> <a href="a00962_source.html#l00207">settings.h:207</a></div></div>
<div class="ttc" id="a00935_html"><div class="ttname"><a href="a00935.html">parallel.h</a></div><div class="ttdoc">End-user include file. Provides advanced settings and tuning options. This file is a GNU parallel ext...</div></div>
<div class="ttc" id="a00923_html"><div class="ttname"><a href="a00923.html">numericfwd.h</a></div></div>
<div class="ttc" id="a01575_html_ac799255921e70b0378d145924d673f9c"><div class="ttname"><a href="a01575.html#ac799255921e70b0378d145924d673f9c">__gnu_parallel::__equally_split</a></div><div class="ttdeci">_OutputIterator __equally_split(_DifferenceType __n, _ThreadIndex __num_threads, _OutputIterator __s)</div><div class="ttdoc">function to split a sequence into parts of almost equal size.</div><div class="ttdef"><b>Definition:</b> <a href="a00884_source.html#l00048">equally_split.h:48</a></div></div>
<div class="ttc" id="a00881_html_a77fb93c9cecec331ccee755972695128"><div class="ttname"><a href="a00881.html#a77fb93c9cecec331ccee755972695128">_GLIBCXX_CALL</a></div><div class="ttdeci">#define _GLIBCXX_CALL(__n)</div><div class="ttdoc">Macro to produce log message when entering a function.</div><div class="ttdef"><b>Definition:</b> <a href="a00881_source.html#l00044">compiletime_settings.h:44</a></div></div>
<div class="ttc" id="a01541_html_aa0acc8476d79019e12bb3eab3702a352"><div class="ttname"><a href="a01541.html#aa0acc8476d79019e12bb3eab3702a352">std::accumulate</a></div><div class="ttdeci">_Tp accumulate(_InputIterator __first, _InputIterator __last, _Tp __init)</div><div class="ttdoc">Accumulate values in a range.</div><div class="ttdef"><b>Definition:</b> <a href="a00569_source.html#l00120">stl_numeric.h:120</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="a00032_html"><div class="ttname"><a href="a00032.html">new</a></div></div>
<div class="ttc" id="a01575_html_a63017e821c2b4ff9f90c3641bc45f001"><div class="ttname"><a href="a01575.html#a63017e821c2b4ff9f90c3641bc45f001">__gnu_parallel::__parallel_partial_sum_linear</a></div><div class="ttdeci">_OutputIterator __parallel_partial_sum_linear(_IIter __begin, _IIter __end, _OutputIterator __result, _BinaryOperation __bin_op, typename std::iterator_traits< _IIter >::difference_type __n)</div><div class="ttdoc">Parallel partial sum implementation, two-phase approach, no recursion.</div><div class="ttdef"><b>Definition:</b> <a href="a00938_source.html#l00089">partial_sum.h:89</a></div></div>
<div class="ttc" id="a01575_html_adeded88310546a7c54d73464bee998e2"><div class="ttname"><a href="a01575.html#adeded88310546a7c54d73464bee998e2">__gnu_parallel::__parallel_partial_sum_basecase</a></div><div class="ttdeci">_OutputIterator __parallel_partial_sum_basecase(_IIter __begin, _IIter __end, _OutputIterator __result, _BinaryOperation __bin_op, typename std::iterator_traits< _IIter >::value_type __value)</div><div class="ttdoc">Base case prefix sum routine.</div><div class="ttdef"><b>Definition:</b> <a href="a00938_source.html#l00058">partial_sum.h:58</a></div></div>
<div class="ttc" id="a01575_html_a0cf4a05b6f849cae06f9fb6098eb0628"><div class="ttname"><a href="a01575.html#a0cf4a05b6f849cae06f9fb6098eb0628">__gnu_parallel::__parallel_partial_sum</a></div><div class="ttdeci">_OutputIterator __parallel_partial_sum(_IIter __begin, _IIter __end, _OutputIterator __result, _BinaryOperation __bin_op)</div><div class="ttdoc">Parallel partial sum front-__end.</div><div class="ttdef"><b>Definition:</b> <a href="a00938_source.html#l00205">partial_sum.h:205</a></div></div>
<div class="ttc" id="a09635_html_abc4965eacae0b49945ebc887cb11adc1"><div class="ttname"><a href="a09635.html#abc4965eacae0b49945ebc887cb11adc1">__gnu_parallel::_Settings::get</a></div><div class="ttdeci">static const _Settings & get()</div><div class="ttdoc">Get the global settings.</div></div>
<div class="ttc" id="a01575_html_a05e502e51bfc3233671730f74a44dc6a"><div class="ttname"><a href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">__gnu_parallel::_ThreadIndex</a></div><div class="ttdeci">uint16_t _ThreadIndex</div><div class="ttdoc">Unsigned integer to index a thread number. The maximum thread number (for each processor) must fit in...</div><div class="ttdef"><b>Definition:</b> <a href="a00971_source.html#l00123">types.h:123</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="a00938.html">partial_sum.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
>
832
