<!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++: par_loop.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('a00932_source.html','');});
/* @license-end */
</script>
<div id="doc-content">
<div class="header">
<div class="headertitle">
<div class="title">par_loop.h</div> </div>
</div><!--header-->
<div class="contents">
<a href="a00932.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/par_loop.h</span></div><div class="line"><a name="l00026"></a><span class="lineno"> 26</span> <span class="comment"> * @brief Parallelization of embarrassingly parallel execution by</span></div><div class="line"><a name="l00027"></a><span class="lineno"> 27</span> <span class="comment"> * means of equal splitting.</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 Felix Putze.</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_PAR_LOOP_H</span></div><div class="line"><a name="l00034"></a><span class="lineno"> 34</span> <span class="preprocessor">#define _GLIBCXX_PARALLEL_PAR_LOOP_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="a00962.html">parallel/settings.h</a>></span></div><div class="line"><a name="l00038"></a><span class="lineno"> 38</span> <span class="preprocessor">#include <<a class="code" href="a16491.html">parallel/base.h</a>></span></div><div class="line"><a name="l00039"></a><span class="lineno"> 39</span> <span class="preprocessor">#include <<a class="code" href="a00884.html">parallel/equally_split.h</a>></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="keyword">namespace </span><a class="code" href="a01575.html">__gnu_parallel</a></div><div class="line"><a name="l00042"></a><span class="lineno"> 42</span> {<span class="comment"></span></div><div class="line"><a name="l00043"></a><span class="lineno"> 43</span> <span class="comment"> /** @brief Embarrassingly parallel algorithm for random access</span></div><div class="line"><a name="l00044"></a><span class="lineno"> 44</span> <span class="comment"> * iterators, using hand-crafted parallelization by equal splitting</span></div><div class="line"><a name="l00045"></a><span class="lineno"> 45</span> <span class="comment"> * the work.</span></div><div class="line"><a name="l00046"></a><span class="lineno"> 46</span> <span class="comment"> *</span></div><div class="line"><a name="l00047"></a><span class="lineno"> 47</span> <span class="comment"> * @param __begin Begin iterator of element sequence.</span></div><div class="line"><a name="l00048"></a><span class="lineno"> 48</span> <span class="comment"> * @param __end End iterator of element sequence.</span></div><div class="line"><a name="l00049"></a><span class="lineno"> 49</span> <span class="comment"> * @param __o User-supplied functor (comparator, predicate, adding</span></div><div class="line"><a name="l00050"></a><span class="lineno"> 50</span> <span class="comment"> * functor, ...)</span></div><div class="line"><a name="l00051"></a><span class="lineno"> 51</span> <span class="comment"> * @param __f Functor to "process" an element with __op (depends on</span></div><div class="line"><a name="l00052"></a><span class="lineno"> 52</span> <span class="comment"> * desired functionality, e. g. for std::for_each(), ...).</span></div><div class="line"><a name="l00053"></a><span class="lineno"> 53</span> <span class="comment"> * @param __r Functor to "add" a single __result to the already</span></div><div class="line"><a name="l00054"></a><span class="lineno"> 54</span> <span class="comment"> * processed elements (depends on functionality).</span></div><div class="line"><a name="l00055"></a><span class="lineno"> 55</span> <span class="comment"> * @param __base Base value for reduction.</span></div><div class="line"><a name="l00056"></a><span class="lineno"> 56</span> <span class="comment"> * @param __output Pointer to position where final result is written to</span></div><div class="line"><a name="l00057"></a><span class="lineno"> 57</span> <span class="comment"> * @param __bound Maximum number of elements processed (e. g. for</span></div><div class="line"><a name="l00058"></a><span class="lineno"> 58</span> <span class="comment"> * std::count_n()).</span></div><div class="line"><a name="l00059"></a><span class="lineno"> 59</span> <span class="comment"> * @return User-supplied functor (that may contain a part of the result).</span></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="keyword">template</span><<span class="keyword">typename</span> _RAIter,</div><div class="line"><a name="l00062"></a><span class="lineno"> 62</span>  <span class="keyword">typename</span> _Op,</div><div class="line"><a name="l00063"></a><span class="lineno"> 63</span>  <span class="keyword">typename</span> _Fu,</div><div class="line"><a name="l00064"></a><span class="lineno"> 64</span>  <span class="keyword">typename</span> _Red,</div><div class="line"><a name="l00065"></a><span class="lineno"> 65</span>  <span class="keyword">typename</span> _Result></div><div class="line"><a name="l00066"></a><span class="lineno"> 66</span>  _Op</div><div class="line"><a name="l00067"></a><span class="lineno"><a class="line" href="a01575.html#a12c48efb47ea3e00a7ef666d595ae185"> 67</a></span>  <a class="code" href="a01575.html#a12c48efb47ea3e00a7ef666d595ae185">__for_each_template_random_access_ed</a>(_RAIter __begin, _RAIter __end,</div><div class="line"><a name="l00068"></a><span class="lineno"> 68</span>  _Op __o, _Fu& __f, _Red __r,</div><div class="line"><a name="l00069"></a><span class="lineno"> 69</span>  _Result __base, _Result& __output,</div><div class="line"><a name="l00070"></a><span class="lineno"> 70</span>  <span class="keyword">typename</span> std::iterator_traits<_RAIter>::difference_type __bound)</div><div class="line"><a name="l00071"></a><span class="lineno"> 71</span>  {</div><div class="line"><a name="l00072"></a><span class="lineno"> 72</span>  <span class="keyword">typedef</span> std::iterator_traits<_RAIter> _TraitsType;</div><div class="line"><a name="l00073"></a><span class="lineno"> 73</span>  <span class="keyword">typedef</span> <span class="keyword">typename</span> _TraitsType::difference_type _DifferenceType;</div><div class="line"><a name="l00074"></a><span class="lineno"> 74</span>  <span class="keyword">const</span> _DifferenceType __length = __end - __begin;</div><div class="line"><a name="l00075"></a><span class="lineno"> 75</span>  _Result *__thread_results;</div><div class="line"><a name="l00076"></a><span class="lineno"> 76</span>  <span class="keywordtype">bool</span>* __constructed;</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>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __num_threads = __gnu_parallel::min<_DifferenceType></div><div class="line"><a name="l00079"></a><span class="lineno"> 79</span>  (__get_max_threads(), __length);</div><div class="line"><a name="l00080"></a><span class="lineno"> 80</span> </div><div class="line"><a name="l00081"></a><span class="lineno"> 81</span> <span class="preprocessor"># pragma omp parallel num_threads(__num_threads)</span></div><div class="line"><a name="l00082"></a><span class="lineno"> 82</span>  {</div><div class="line"><a name="l00083"></a><span class="lineno"> 83</span> <span class="preprocessor"># pragma omp single</span></div><div class="line"><a name="l00084"></a><span class="lineno"> 84</span>  {</div><div class="line"><a name="l00085"></a><span class="lineno"> 85</span>  __num_threads = omp_get_num_threads();</div><div class="line"><a name="l00086"></a><span class="lineno"> 86</span>  __thread_results = static_cast<_Result*></div><div class="line"><a name="l00087"></a><span class="lineno"> 87</span>  (::<span class="keyword">operator</span> <span class="keyword">new</span>(__num_threads * <span class="keyword">sizeof</span>(_Result)));</div><div class="line"><a name="l00088"></a><span class="lineno"> 88</span>  __constructed = <span class="keyword">new</span> <span class="keywordtype">bool</span>[__num_threads];</div><div class="line"><a name="l00089"></a><span class="lineno"> 89</span>  }</div><div class="line"><a name="l00090"></a><span class="lineno"> 90</span> </div><div class="line"><a name="l00091"></a><span class="lineno"> 91</span>  <a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __iam = omp_get_thread_num();</div><div class="line"><a name="l00092"></a><span class="lineno"> 92</span> </div><div class="line"><a name="l00093"></a><span class="lineno"> 93</span>  <span class="comment">// Neutral element.</span></div><div class="line"><a name="l00094"></a><span class="lineno"> 94</span>  _Result* __reduct;</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>  _DifferenceType</div><div class="line"><a name="l00097"></a><span class="lineno"> 97</span>  __start = <a class="code" href="a01575.html#a8e3a77cb920e419144b72d6d20167dfd">__equally_split_point</a>(__length, __num_threads, __iam),</div><div class="line"><a name="l00098"></a><span class="lineno"> 98</span>  __stop = <a class="code" href="a01575.html#a8e3a77cb920e419144b72d6d20167dfd">__equally_split_point</a>(__length, __num_threads, __iam + 1);</div><div class="line"><a name="l00099"></a><span class="lineno"> 99</span> </div><div class="line"><a name="l00100"></a><span class="lineno"> 100</span>  <span class="keywordflow">if</span> (__start < __stop)</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>  __reduct = <span class="keyword">new</span> _Result(__f(__o, __begin + __start));</div><div class="line"><a name="l00103"></a><span class="lineno"> 103</span>  ++__start;</div><div class="line"><a name="l00104"></a><span class="lineno"> 104</span>  __constructed[__iam] = <span class="keyword">true</span>;</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="keywordflow">else</span></div><div class="line"><a name="l00107"></a><span class="lineno"> 107</span>  __constructed[__iam] = <span class="keyword">false</span>;</div><div class="line"><a name="l00108"></a><span class="lineno"> 108</span> </div><div class="line"><a name="l00109"></a><span class="lineno"> 109</span>  <span class="keywordflow">for</span> (; __start < __stop; ++__start)</div><div class="line"><a name="l00110"></a><span class="lineno"> 110</span>  *__reduct = __r(*__reduct, __f(__o, __begin + __start));</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>  <span class="keywordflow">if</span> (__constructed[__iam])</div><div class="line"><a name="l00113"></a><span class="lineno"> 113</span>  {</div><div class="line"><a name="l00114"></a><span class="lineno"> 114</span>  ::new(&__thread_results[__iam]) _Result(*__reduct);</div><div class="line"><a name="l00115"></a><span class="lineno"> 115</span>  <span class="keyword">delete</span> __reduct;</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="comment">//parallel</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="keywordflow">for</span> (<a class="code" href="a01575.html#a05e502e51bfc3233671730f74a44dc6a">_ThreadIndex</a> __i = 0; __i < __num_threads; ++__i)</div><div class="line"><a name="l00120"></a><span class="lineno"> 120</span>  <span class="keywordflow">if</span> (__constructed[__i])</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>  __output = __r(__output, __thread_results[__i]);</div><div class="line"><a name="l00123"></a><span class="lineno"> 123</span>  __thread_results[__i].~_Result();</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> </div><div class="line"><a name="l00126"></a><span class="lineno"> 126</span>  <span class="comment">// Points to last element processed (needed as return value for</span></div><div class="line"><a name="l00127"></a><span class="lineno"> 127</span>  <span class="comment">// some algorithms like transform).</span></div><div class="line"><a name="l00128"></a><span class="lineno"> 128</span>  __f._M_finish_iterator = __begin + __length;</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>  ::operator <span class="keyword">delete</span>(__thread_results);</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="keyword">delete</span>[] __constructed;</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="keywordflow">return</span> __o;</div><div class="line"><a name="l00135"></a><span class="lineno"> 135</span>  }</div><div class="line"><a name="l00136"></a><span class="lineno"> 136</span> </div><div class="line"><a name="l00137"></a><span class="lineno"> 137</span> } <span class="comment">// end namespace</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> <span class="preprocessor">#endif </span><span class="comment">/* _GLIBCXX_PARALLEL_PAR_LOOP_H */</span><span class="preprocessor"></span></div><div class="ttc" id="a01575_html_a8e3a77cb920e419144b72d6d20167dfd"><div class="ttname"><a href="a01575.html#a8e3a77cb920e419144b72d6d20167dfd">__gnu_parallel::__equally_split_point</a></div><div class="ttdeci">_DifferenceType __equally_split_point(_DifferenceType __n, _ThreadIndex __num_threads, _ThreadIndex __thread_no)</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#l00075">equally_split.h:75</a></div></div>
<div class="ttc" id="a00962_html"><div class="ttname"><a href="a00962.html">settings.h</a></div><div class="ttdoc">Runtime settings and tuning parameters, heuristics to decide whether to use parallelized algorithms....</div></div>
<div class="ttc" id="a00884_html"><div class="ttname"><a href="a00884.html">equally_split.h</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="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="a01575_html_a12c48efb47ea3e00a7ef666d595ae185"><div class="ttname"><a href="a01575.html#a12c48efb47ea3e00a7ef666d595ae185">__gnu_parallel::__for_each_template_random_access_ed</a></div><div class="ttdeci">_Op __for_each_template_random_access_ed(_RAIter __begin, _RAIter __end, _Op __o, _Fu &__f, _Red __r, _Result __base, _Result &__output, typename std::iterator_traits< _RAIter >::difference_type __bound)</div><div class="ttdoc">Embarrassingly parallel algorithm for random access iterators, using hand-crafted parallelization by ...</div><div class="ttdef"><b>Definition:</b> <a href="a00932_source.html#l00067">par_loop.h:67</a></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="a00932.html">par_loop.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
>
827
