HomeSort by relevance Sort by last modified time
    Searched full:__iam (Results 1 - 25 of 52) sorted by null

1 2 3

  /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/
multiway_mergesort.h 104 _ThreadIndex __iam = omp_get_thread_num(); local
108 __equally_split(__sd->_M_starts[__iam + 1] - __sd->_M_starts[__iam],
112 ::new(&(__sd->_M_samples[__iam * __num_samples + __i]))
113 _ValueType(__sd->_M_source[__sd->_M_starts[__iam]
131 operator()(const _ThreadIndex __iam,
152 if (__iam < __sd->_M_num_threads - 1)
154 __sd->_M_starts[__iam + 1], __offsets.begin(),
160 if (__iam < (__sd->_M_num_threads - 1))
161 __sd->_M_pieces[__iam][__seq]._M_en
315 _ThreadIndex __iam = omp_get_thread_num(); local
    [all...]
partial_sum.h 150 _ThreadIndex __iam = omp_get_thread_num(); local
151 if (__iam == 0)
158 ::new(&(__sums[__iam])) _ValueType(*(__result + __borders[1] - 1));
162 ::new(&(__sums[__iam]))
164 __begin + __borders[__iam] + 1,
165 __begin + __borders[__iam + 1],
166 *(__begin + __borders[__iam]),
180 __parallel_partial_sum_basecase(__begin + __borders[__iam + 1],
181 __begin + __borders[__iam + 2],
182 __result + __borders[__iam + 1]
    [all...]
par_loop.h 91 _ThreadIndex __iam = omp_get_thread_num(); local
97 __start = __equally_split_point(__length, __num_threads, __iam),
98 __stop = __equally_split_point(__length, __num_threads, __iam + 1);
104 __constructed[__iam] = true;
107 __constructed[__iam] = false;
112 if (__constructed[__iam])
114 ::new(&__thread_results[__iam]) _Result(*__reduct);
unique_copy.h 81 _ThreadIndex __iam = omp_get_thread_num(); local
90 if (__iam == 0)
93 __end = __borders[__iam + 1];
110 __begin = __borders[__iam]; //one part
111 __end = __borders[__iam + 1];
120 __counter[__iam] = __i;
130 if (__iam == 0)
157 for (_ThreadIndex __t = 0; __t < __iam; __t++)
balanced_quicksort.h 166 * @param __iam Number of the thread processing this function.
174 _ThreadIndex __iam, _ThreadIndex __num_threads,
185 __tls[__iam]->_M_initial.first = __begin;
186 __tls[__iam]->_M_initial.second = __end;
188 __qsb_local_sort_with_helping(__tls, __comp, __iam, __parent_wait);
208 *__tls[__iam]->_M_elements_leftover -= (_DifferenceType)1;
224 __iam, __num_threads_leftside, __wait);
231 __iam + __num_threads_leftside,
243 * @param __iam Number of the thread processing this function.
248 _Compare& __comp, _ThreadIndex __iam,
    [all...]
set_operations.h 393 _ThreadIndex __iam = omp_get_thread_num(); local
397 const _DifferenceType __rank = __borders[__iam + 1];
414 _IteratorPair __block_end = __block_begins[__iam + 1] =
420 _IteratorPair __block_begin = __block_begins[__iam];
424 if (__iam == 0)
427 __lengths[ __iam ] =
434 __lengths[ __iam ] =
444 if (__iam == 0)
460 for (_ThreadIndex __i = 0; __i < __iam; ++__i)
omp_loop.h 93 _ThreadIndex __iam = omp_get_thread_num(); local
97 __thread_results[__iam] = __r(__thread_results[__iam],
  /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
multiway_mergesort.h 104 _ThreadIndex __iam = omp_get_thread_num(); local
108 __equally_split(__sd->_M_starts[__iam + 1] - __sd->_M_starts[__iam],
112 ::new(&(__sd->_M_samples[__iam * __num_samples + __i]))
113 _ValueType(__sd->_M_source[__sd->_M_starts[__iam]
131 operator()(const _ThreadIndex __iam,
152 if (__iam < __sd->_M_num_threads - 1)
154 __sd->_M_starts[__iam + 1], __offsets.begin(),
160 if (__iam < (__sd->_M_num_threads - 1))
161 __sd->_M_pieces[__iam][__seq]._M_en
315 _ThreadIndex __iam = omp_get_thread_num(); local
    [all...]
partial_sum.h 150 _ThreadIndex __iam = omp_get_thread_num(); local
151 if (__iam == 0)
158 ::new(&(__sums[__iam])) _ValueType(*(__result + __borders[1] - 1));
162 ::new(&(__sums[__iam]))
164 __begin + __borders[__iam] + 1,
165 __begin + __borders[__iam + 1],
166 *(__begin + __borders[__iam]),
180 __parallel_partial_sum_basecase(__begin + __borders[__iam + 1],
181 __begin + __borders[__iam + 2],
182 __result + __borders[__iam + 1]
    [all...]
par_loop.h 91 _ThreadIndex __iam = omp_get_thread_num(); local
97 __start = __equally_split_point(__length, __num_threads, __iam),
98 __stop = __equally_split_point(__length, __num_threads, __iam + 1);
104 __constructed[__iam] = true;
107 __constructed[__iam] = false;
112 if (__constructed[__iam])
114 ::new(&__thread_results[__iam]) _Result(*__reduct);
unique_copy.h 81 _ThreadIndex __iam = omp_get_thread_num(); local
90 if (__iam == 0)
93 __end = __borders[__iam + 1];
110 __begin = __borders[__iam]; //one part
111 __end = __borders[__iam + 1];
120 __counter[__iam] = __i;
130 if (__iam == 0)
157 for (_ThreadIndex __t = 0; __t < __iam; __t++)
balanced_quicksort.h 166 * @param __iam Number of the thread processing this function.
174 _ThreadIndex __iam, _ThreadIndex __num_threads,
185 __tls[__iam]->_M_initial.first = __begin;
186 __tls[__iam]->_M_initial.second = __end;
188 __qsb_local_sort_with_helping(__tls, __comp, __iam, __parent_wait);
208 *__tls[__iam]->_M_elements_leftover -= (_DifferenceType)1;
224 __iam, __num_threads_leftside, __wait);
231 __iam + __num_threads_leftside,
243 * @param __iam Number of the thread processing this function.
248 _Compare& __comp, _ThreadIndex __iam,
    [all...]
set_operations.h 393 _ThreadIndex __iam = omp_get_thread_num(); local
397 const _DifferenceType __rank = __borders[__iam + 1];
414 _IteratorPair __block_end = __block_begins[__iam + 1] =
420 _IteratorPair __block_begin = __block_begins[__iam];
424 if (__iam == 0)
427 __lengths[ __iam ] =
434 __lengths[ __iam ] =
444 if (__iam == 0)
460 for (_ThreadIndex __i = 0; __i < __iam; ++__i)
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.8/include/parallel/
multiway_mergesort.h 104 _ThreadIndex __iam = omp_get_thread_num(); local
108 __equally_split(__sd->_M_starts[__iam + 1] - __sd->_M_starts[__iam],
112 ::new(&(__sd->_M_samples[__iam * __num_samples + __i]))
113 _ValueType(__sd->_M_source[__sd->_M_starts[__iam]
131 operator()(const _ThreadIndex __iam,
152 if (__iam < __sd->_M_num_threads - 1)
154 __sd->_M_starts[__iam + 1], __offsets.begin(),
160 if (__iam < (__sd->_M_num_threads - 1))
161 __sd->_M_pieces[__iam][__seq]._M_en
315 _ThreadIndex __iam = omp_get_thread_num(); local
    [all...]
partial_sum.h 150 _ThreadIndex __iam = omp_get_thread_num(); local
151 if (__iam == 0)
158 ::new(&(__sums[__iam])) _ValueType(*(__result + __borders[1] - 1));
162 ::new(&(__sums[__iam]))
164 __begin + __borders[__iam] + 1,
165 __begin + __borders[__iam + 1],
166 *(__begin + __borders[__iam]),
180 __parallel_partial_sum_basecase(__begin + __borders[__iam + 1],
181 __begin + __borders[__iam + 2],
182 __result + __borders[__iam + 1]
    [all...]
par_loop.h 91 _ThreadIndex __iam = omp_get_thread_num(); local
97 __start = __equally_split_point(__length, __num_threads, __iam),
98 __stop = __equally_split_point(__length, __num_threads, __iam + 1);
104 __constructed[__iam] = true;
107 __constructed[__iam] = false;
112 if (__constructed[__iam])
114 ::new(&__thread_results[__iam]) _Result(*__reduct);
unique_copy.h 81 _ThreadIndex __iam = omp_get_thread_num(); local
90 if (__iam == 0)
93 __end = __borders[__iam + 1];
110 __begin = __borders[__iam]; //one part
111 __end = __borders[__iam + 1];
120 __counter[__iam] = __i;
130 if (__iam == 0)
157 for (_ThreadIndex __t = 0; __t < __iam; __t++)
balanced_quicksort.h 166 * @param __iam Number of the thread processing this function.
174 _ThreadIndex __iam, _ThreadIndex __num_threads,
185 __tls[__iam]->_M_initial.first = __begin;
186 __tls[__iam]->_M_initial.second = __end;
188 __qsb_local_sort_with_helping(__tls, __comp, __iam, __parent_wait);
208 *__tls[__iam]->_M_elements_leftover -= (_DifferenceType)1;
224 __iam, __num_threads_leftside, __wait);
231 __iam + __num_threads_leftside,
243 * @param __iam Number of the thread processing this function.
248 _Compare& __comp, _ThreadIndex __iam,
    [all...]
set_operations.h 393 _ThreadIndex __iam = omp_get_thread_num(); local
397 const _DifferenceType __rank = __borders[__iam + 1];
414 _IteratorPair __block_end = __block_begins[__iam + 1] =
420 _IteratorPair __block_begin = __block_begins[__iam];
424 if (__iam == 0)
427 __lengths[ __iam ] =
434 __lengths[ __iam ] =
444 if (__iam == 0)
460 for (_ThreadIndex __i = 0; __i < __iam; ++__i)
  /prebuilts/ndk/9/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
multiway_mergesort.h 104 _ThreadIndex __iam = omp_get_thread_num(); local
108 __equally_split(__sd->_M_starts[__iam + 1] - __sd->_M_starts[__iam],
112 ::new(&(__sd->_M_samples[__iam * __num_samples + __i]))
113 _ValueType(__sd->_M_source[__sd->_M_starts[__iam]
131 operator()(const _ThreadIndex __iam,
152 if (__iam < __sd->_M_num_threads - 1)
154 __sd->_M_starts[__iam + 1], __offsets.begin(),
160 if (__iam < (__sd->_M_num_threads - 1))
161 __sd->_M_pieces[__iam][__seq]._M_en
315 _ThreadIndex __iam = omp_get_thread_num(); local
    [all...]
partial_sum.h 150 _ThreadIndex __iam = omp_get_thread_num(); local
151 if (__iam == 0)
158 ::new(&(__sums[__iam])) _ValueType(*(__result + __borders[1] - 1));
162 ::new(&(__sums[__iam]))
164 __begin + __borders[__iam] + 1,
165 __begin + __borders[__iam + 1],
166 *(__begin + __borders[__iam]),
180 __parallel_partial_sum_basecase(__begin + __borders[__iam + 1],
181 __begin + __borders[__iam + 2],
182 __result + __borders[__iam + 1]
    [all...]
par_loop.h 91 _ThreadIndex __iam = omp_get_thread_num(); local
97 __start = __equally_split_point(__length, __num_threads, __iam),
98 __stop = __equally_split_point(__length, __num_threads, __iam + 1);
104 __constructed[__iam] = true;
107 __constructed[__iam] = false;
112 if (__constructed[__iam])
114 ::new(&__thread_results[__iam]) _Result(*__reduct);
unique_copy.h 81 _ThreadIndex __iam = omp_get_thread_num(); local
90 if (__iam == 0)
93 __end = __borders[__iam + 1];
110 __begin = __borders[__iam]; //one part
111 __end = __borders[__iam + 1];
120 __counter[__iam] = __i;
130 if (__iam == 0)
157 for (_ThreadIndex __t = 0; __t < __iam; __t++)
balanced_quicksort.h 166 * @param __iam Number of the thread processing this function.
174 _ThreadIndex __iam, _ThreadIndex __num_threads,
185 __tls[__iam]->_M_initial.first = __begin;
186 __tls[__iam]->_M_initial.second = __end;
188 __qsb_local_sort_with_helping(__tls, __comp, __iam, __parent_wait);
208 *__tls[__iam]->_M_elements_leftover -= (_DifferenceType)1;
224 __iam, __num_threads_leftside, __wait);
231 __iam + __num_threads_leftside,
243 * @param __iam Number of the thread processing this function.
248 _Compare& __comp, _ThreadIndex __iam,
    [all...]
set_operations.h 393 _ThreadIndex __iam = omp_get_thread_num(); local
397 const _DifferenceType __rank = __borders[__iam + 1];
414 _IteratorPair __block_end = __block_begins[__iam + 1] =
420 _IteratorPair __block_begin = __block_begins[__iam];
424 if (__iam == 0)
427 __lengths[ __iam ] =
434 __lengths[ __iam ] =
444 if (__iam == 0)
460 for (_ThreadIndex __i = 0; __i < __iam; ++__i)

Completed in 1901 milliseconds

1 2 3