]> git.ipfire.org Git - thirdparty/gcc.git/blame - libstdc++-v3/include/parallel/omp_loop.h
Update copyright years.
[thirdparty/gcc.git] / libstdc++-v3 / include / parallel / omp_loop.h
CommitLineData
c2ba9709
JS
1// -*- C++ -*-
2
7adcbafe 3// Copyright (C) 2007-2022 Free Software Foundation, Inc.
c2ba9709
JS
4//
5// This file is part of the GNU ISO C++ Library. This library is free
6// software; you can redistribute it and/or modify it under the terms
7// of the GNU General Public License as published by the Free Software
748086b7 8// Foundation; either version 3, or (at your option) any later
c2ba9709
JS
9// version.
10
11// This library is distributed in the hope that it will be useful, but
12// WITHOUT ANY WARRANTY; without even the implied warranty of
13// MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14// General Public License for more details.
15
748086b7
JJ
16// Under Section 7 of GPL version 3, you are granted additional
17// permissions described in the GCC Runtime Library Exception, version
18// 3.1, as published by the Free Software Foundation.
19
20// You should have received a copy of the GNU General Public License and
21// a copy of the GCC Runtime Library Exception along with this program;
22// see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
23// <http://www.gnu.org/licenses/>.
c2ba9709
JS
24
25/** @file parallel/omp_loop.h
26 * @brief Parallelization of embarrassingly parallel execution by
27 * means of an OpenMP for loop.
28 * This file is a GNU parallel extension to the Standard C++ Library.
29 */
30
31// Written by Felix Putze.
32
33#ifndef _GLIBCXX_PARALLEL_OMP_LOOP_H
34#define _GLIBCXX_PARALLEL_OMP_LOOP_H 1
35
36#include <omp.h>
37
38#include <parallel/settings.h>
39#include <parallel/basic_iterator.h>
e683ee2a 40#include <parallel/base.h>
c2ba9709
JS
41
42namespace __gnu_parallel
43{
338311e5
PC
44 /** @brief Embarrassingly parallel algorithm for random access
45 * iterators, using an OpenMP for loop.
46 *
47 * @param __begin Begin iterator of element sequence.
48 * @param __end End iterator of element sequence.
49 * @param __o User-supplied functor (comparator, predicate, adding
50 * functor, etc.).
2a60a9f6 51 * @param __f Functor to @a process an element with __op (depends on
338311e5 52 * desired functionality, e. g. for std::for_each(), ...).
2a60a9f6 53 * @param __r Functor to @a add a single __result to the already
338311e5
PC
54 * processed elements (depends on functionality).
55 * @param __base Base value for reduction.
56 * @param __output Pointer to position where final result is written to
57 * @param __bound Maximum number of elements processed (e. g. for
58 * std::count_n()).
59 * @return User-supplied functor (that may contain a part of the result).
60 */
61 template<typename _RAIter,
62 typename _Op,
63 typename _Fu,
64 typename _Red,
65 typename _Result>
66 _Op
67 __for_each_template_random_access_omp_loop(_RAIter __begin, _RAIter __end,
68 _Op __o, _Fu& __f, _Red __r,
69 _Result __base,
70 _Result& __output,
71 typename std::iterator_traits<_RAIter>::difference_type __bound)
72 {
73 typedef typename std::iterator_traits<_RAIter>::difference_type
1acba85b 74 _DifferenceType;
c2ba9709 75
338311e5 76 _DifferenceType __length = __end - __begin;
77d16198
PC
77 _ThreadIndex __num_threads = __gnu_parallel::min<_DifferenceType>
78 (__get_max_threads(), __length);
c2ba9709 79
338311e5 80 _Result *__thread_results;
e683ee2a 81
338311e5 82# pragma omp parallel num_threads(__num_threads)
c2ba9709 83 {
e683ee2a 84# pragma omp single
338311e5
PC
85 {
86 __num_threads = omp_get_num_threads();
87 __thread_results = new _Result[__num_threads];
e683ee2a 88
338311e5
PC
89 for (_ThreadIndex __i = 0; __i < __num_threads; ++__i)
90 __thread_results[__i] = _Result();
91 }
e683ee2a 92
1acba85b 93 _ThreadIndex __iam = omp_get_thread_num();
e683ee2a 94
15ac3c72 95#pragma omp for schedule(dynamic, _Settings::get().workstealing_chunk_size)
1acba85b 96 for (_DifferenceType __pos = 0; __pos < __length; ++__pos)
77d16198
PC
97 __thread_results[__iam] = __r(__thread_results[__iam],
98 __f(__o, __begin+__pos));
e683ee2a 99 } //parallel
c2ba9709 100
338311e5 101 for (_ThreadIndex __i = 0; __i < __num_threads; ++__i)
1acba85b 102 __output = __r(__output, __thread_results[__i]);
c2ba9709 103
338311e5 104 delete [] __thread_results;
c2ba9709 105
338311e5
PC
106 // Points to last element processed (needed as return value for
107 // some algorithms like transform).
108 __f._M_finish_iterator = __begin + __length;
c2ba9709 109
338311e5
PC
110 return __o;
111 }
e683ee2a 112
c2ba9709
JS
113} // end namespace
114
cbcd1e45 115#endif /* _GLIBCXX_PARALLEL_OMP_LOOP_H */