// -*- C++ -*- // Copyright (C) 2007-2013 Free Software Foundation, Inc. // // This file is part of the GNU ISO C++ Library. This library is free // software; you can redistribute it and/or modify it under the terms // of the GNU General Public License as published by the Free Software // Foundation; either version 3, or (at your option) any later // version. // This library is distributed in the hope that it will be useful, but // WITHOUT ANY WARRANTY; without even the implied warranty of // MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU // General Public License for more details. // Under Section 7 of GPL version 3, you are granted additional // permissions described in the GCC Runtime Library Exception, version // 3.1, as published by the Free Software Foundation. // You should have received a copy of the GNU General Public License and // a copy of the GCC Runtime Library Exception along with this program; // see the files COPYING3 and COPYING.RUNTIME respectively. If not, see // <http://www.gnu.org/licenses/>. /** @file parallel/omp_loop_static.h * @brief Parallelization of embarrassingly parallel execution by * means of an OpenMP for loop with static scheduling. * This file is a GNU parallel extension to the Standard C++ Library. */ // Written by Felix Putze. #ifndef _GLIBCXX_PARALLEL_OMP_LOOP_STATIC_H #define _GLIBCXX_PARALLEL_OMP_LOOP_STATIC_H 1 #include <omp.h> #include <parallel/settings.h> #include <parallel/basic_iterator.h> namespace __gnu_parallel { /** @brief Embarrassingly parallel algorithm for random access * iterators, using an OpenMP for loop with static scheduling. * * @param __begin Begin iterator of element sequence. * @param __end End iterator of element sequence. * @param __o User-supplied functor (comparator, predicate, adding * functor, ...). * @param __f Functor to @a process an element with __op (depends on * desired functionality, e. g. for std::for_each(), ...). * @param __r Functor to @a add a single __result to the already processed * __elements (depends on functionality). * @param __base Base value for reduction. * @param __output Pointer to position where final result is written to * @param __bound Maximum number of elements processed (e. g. for * std::count_n()). * @return User-supplied functor (that may contain a part of the result). */ template<typename _RAIter, typename _Op, typename _Fu, typename _Red, typename _Result> _Op __for_each_template_random_access_omp_loop_static(_RAIter __begin, _RAIter __end, _Op __o, _Fu& __f, _Red __r, _Result __base, _Result& __output, typename std::iterator_traits<_RAIter>::difference_type __bound) { typedef typename std::iterator_traits<_RAIter>::difference_type _DifferenceType; _DifferenceType __length = __end - __begin; _ThreadIndex __num_threads = std::min<_DifferenceType> (__get_max_threads(), __length); _Result *__thread_results; # pragma omp parallel num_threads(__num_threads) { # pragma omp single { __num_threads = omp_get_num_threads(); __thread_results = new _Result[__num_threads]; for (_ThreadIndex __i = 0; __i < __num_threads; ++__i) __thread_results[__i] = _Result(); } _ThreadIndex __iam = omp_get_thread_num(); #pragma omp for schedule(static, _Settings::get().workstealing_chunk_size) for (_DifferenceType __pos = 0; __pos < __length; ++__pos) __thread_results[__iam] = __r(__thread_results[__iam], __f(__o, __begin+__pos)); } //parallel for (_ThreadIndex __i = 0; __i < __num_threads; ++__i) __output = __r(__output, __thread_results[__i]); delete [] __thread_results; // Points to last element processed (needed as return value for // some algorithms like transform). __f.finish_iterator = __begin + __length; return __o; } } // end namespace #endif /* _GLIBCXX_PARALLEL_OMP_LOOP_STATIC_H */
Name | Type | Size | Permission | Actions |
---|---|---|---|---|
algo.h | File | 95.66 KB | 0644 |
|
algobase.h | File | 11.42 KB | 0644 |
|
algorithm | File | 1.35 KB | 0644 |
|
algorithmfwd.h | File | 31.45 KB | 0644 |
|
balanced_quicksort.h | File | 16.38 KB | 0644 |
|
base.h | File | 11.96 KB | 0644 |
|
basic_iterator.h | File | 1.55 KB | 0644 |
|
checkers.h | File | 2.25 KB | 0644 |
|
compatibility.h | File | 3.7 KB | 0644 |
|
compiletime_settings.h | File | 2.76 KB | 0644 |
|
equally_split.h | File | 3.28 KB | 0644 |
|
features.h | File | 3.46 KB | 0644 |
|
find.h | File | 13.27 KB | 0644 |
|
find_selectors.h | File | 6.83 KB | 0644 |
|
for_each.h | File | 3.85 KB | 0644 |
|
for_each_selectors.h | File | 10.32 KB | 0644 |
|
iterator.h | File | 5.54 KB | 0644 |
|
list_partition.h | File | 6.38 KB | 0644 |
|
losertree.h | File | 27.78 KB | 0644 |
|
merge.h | File | 9.34 KB | 0644 |
|
multiseq_selection.h | File | 21.56 KB | 0644 |
|
multiway_merge.h | File | 68.78 KB | 0644 |
|
multiway_mergesort.h | File | 14.91 KB | 0644 |
|
numeric | File | 20.38 KB | 0644 |
|
numericfwd.h | File | 7.32 KB | 0644 |
|
omp_loop.h | File | 3.94 KB | 0644 |
|
omp_loop_static.h | File | 4.01 KB | 0644 |
|
par_loop.h | File | 4.45 KB | 0644 |
|
parallel.h | File | 1.54 KB | 0644 |
|
partial_sum.h | File | 7.3 KB | 0644 |
|
partition.h | File | 14.58 KB | 0644 |
|
queue.h | File | 5.4 KB | 0644 |
|
quicksort.h | File | 5.98 KB | 0644 |
|
random_number.h | File | 4.13 KB | 0644 |
|
random_shuffle.h | File | 18.24 KB | 0644 |
|
search.h | File | 5.26 KB | 0644 |
|
set_operations.h | File | 14.25 KB | 0644 |
|
settings.h | File | 12.17 KB | 0644 |
|
sort.h | File | 7.52 KB | 0644 |
|
tags.h | File | 5.84 KB | 0644 |
|
types.h | File | 3.63 KB | 0644 |
|
unique_copy.h | File | 6.02 KB | 0644 |
|
workstealing.h | File | 9.39 KB | 0644 |
|