Home	Sort by relevance Sort by last modified time

Full Search Definition Symbol File Path History   | | Help

    Searched refs:_M_num_threads (Results 1 - 24 of 24) sorted by null

/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/parallel/
tags.h	49 _ThreadIndex _M_num_threads; 54 { _M_num_threads = 0; } 59 { _M_num_threads = __num_threads; } 65 if(_M_num_threads == 0) 68 return _M_num_threads; 74 { _M_num_threads = __num_threads; }
multiway_mergesort.h	68 _ThreadIndex _M_num_threads; 142 __seqs(__sd->_M_num_threads); 143 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; __s++) 149 std::vector<_SortingPlacesIterator> __offsets(__sd->_M_num_threads); 152 if (__iam < __sd->_M_num_threads - 1) 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 160 if (__iam < (__sd->_M_num_threads - 1)) 171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 208 + (__num_samples * __sd->_M_num_threads), 213 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; ++__s     [all...]
random_shuffle.h	66 * Dimensions (_M_num_threads + 1) __x (_M_num_bins + 1). */ 94 int _M_num_threads; 139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads]; 165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now 170 + __d->_M_num_threads + 1, 178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads]; 184 for (int __t = 0; __t < __d->_M_num_threads + 1; ++__t) 186 __offset = __sd->_M_dist[__s + 1][__d->_M_num_threads]; 199 for (_ThreadIndex __t = 0; __t < __d->_M_num_threads; ++__t) 211 // Last column [__d->_M_num_threads] stays unchanged     [all...]
balanced_quicksort.h	78 _ThreadIndex _M_num_threads; 262 _ThreadIndex __num_threads = __tl._M_num_threads; 467 __tls[__i]->_M_num_threads = __num_threads;
/prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/parallel/
tags.h	49 _ThreadIndex _M_num_threads; 54 { _M_num_threads = 0; } 59 { _M_num_threads = __num_threads; } 65 if(_M_num_threads == 0) 68 return _M_num_threads; 74 { _M_num_threads = __num_threads; }
multiway_mergesort.h	68 _ThreadIndex _M_num_threads; 142 __seqs(__sd->_M_num_threads); 143 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; __s++) 149 std::vector<_SortingPlacesIterator> __offsets(__sd->_M_num_threads); 152 if (__iam < __sd->_M_num_threads - 1) 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 160 if (__iam < (__sd->_M_num_threads - 1)) 171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 208 + (__num_samples * __sd->_M_num_threads), 213 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; ++__s     [all...]
random_shuffle.h	66 * Dimensions (_M_num_threads + 1) __x (_M_num_bins + 1). */ 94 int _M_num_threads; 139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads]; 165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now 170 + __d->_M_num_threads + 1, 178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads]; 184 for (int __t = 0; __t < __d->_M_num_threads + 1; ++__t) 186 __offset = __sd->_M_dist[__s + 1][__d->_M_num_threads]; 199 for (_ThreadIndex __t = 0; __t < __d->_M_num_threads; ++__t) 211 // Last column [__d->_M_num_threads] stays unchanged     [all...]
balanced_quicksort.h	78 _ThreadIndex _M_num_threads; 262 _ThreadIndex __num_threads = __tl._M_num_threads; 467 __tls[__i]->_M_num_threads = __num_threads;
/prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/parallel/
tags.h	49 _ThreadIndex _M_num_threads; 54 { _M_num_threads = 0; } 59 { _M_num_threads = __num_threads; } 65 if(_M_num_threads == 0) 68 return _M_num_threads; 74 { _M_num_threads = __num_threads; }
multiway_mergesort.h	68 _ThreadIndex _M_num_threads; 142 __seqs(__sd->_M_num_threads); 143 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; __s++) 149 std::vector<_SortingPlacesIterator> __offsets(__sd->_M_num_threads); 152 if (__iam < __sd->_M_num_threads - 1) 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 160 if (__iam < (__sd->_M_num_threads - 1)) 171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 208 + (__num_samples * __sd->_M_num_threads), 213 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; ++__s     [all...]
random_shuffle.h	66 * Dimensions (_M_num_threads + 1) __x (_M_num_bins + 1). */ 94 int _M_num_threads; 139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads]; 165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now 170 + __d->_M_num_threads + 1, 178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads]; 184 for (int __t = 0; __t < __d->_M_num_threads + 1; ++__t) 186 __offset = __sd->_M_dist[__s + 1][__d->_M_num_threads]; 199 for (_ThreadIndex __t = 0; __t < __d->_M_num_threads; ++__t) 211 // Last column [__d->_M_num_threads] stays unchanged     [all...]
balanced_quicksort.h	78 _ThreadIndex _M_num_threads; 262 _ThreadIndex __num_threads = __tl._M_num_threads; 467 __tls[__i]->_M_num_threads = __num_threads;
/prebuilts/ndk/r10/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
tags.h	49 _ThreadIndex _M_num_threads; 54 { _M_num_threads = 0; } 59 { _M_num_threads = __num_threads; } 65 if(_M_num_threads == 0) 68 return _M_num_threads; 74 { _M_num_threads = __num_threads; }
multiway_mergesort.h	68 _ThreadIndex _M_num_threads; 142 __seqs(__sd->_M_num_threads); 143 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; __s++) 149 std::vector<_SortingPlacesIterator> __offsets(__sd->_M_num_threads); 152 if (__iam < __sd->_M_num_threads - 1) 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 160 if (__iam < (__sd->_M_num_threads - 1)) 171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 208 + (__num_samples * __sd->_M_num_threads), 213 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; ++__s     [all...]
random_shuffle.h	66 * Dimensions (_M_num_threads + 1) __x (_M_num_bins + 1). */ 94 int _M_num_threads; 139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads]; 165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now 170 + __d->_M_num_threads + 1, 178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads]; 184 for (int __t = 0; __t < __d->_M_num_threads + 1; ++__t) 186 __offset = __sd->_M_dist[__s + 1][__d->_M_num_threads]; 199 for (_ThreadIndex __t = 0; __t < __d->_M_num_threads; ++__t) 211 // Last column [__d->_M_num_threads] stays unchanged     [all...]
balanced_quicksort.h	78 _ThreadIndex _M_num_threads; 262 _ThreadIndex __num_threads = __tl._M_num_threads; 467 __tls[__i]->_M_num_threads = __num_threads;
/prebuilts/ndk/r11/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
tags.h	49 _ThreadIndex _M_num_threads; 54 { _M_num_threads = 0; } 59 { _M_num_threads = __num_threads; } 65 if(_M_num_threads == 0) 68 return _M_num_threads; 74 { _M_num_threads = __num_threads; }
multiway_mergesort.h	68 _ThreadIndex _M_num_threads; 142 __seqs(__sd->_M_num_threads); 143 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; __s++) 149 std::vector<_SortingPlacesIterator> __offsets(__sd->_M_num_threads); 152 if (__iam < __sd->_M_num_threads - 1) 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 160 if (__iam < (__sd->_M_num_threads - 1)) 171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 208 + (__num_samples * __sd->_M_num_threads), 213 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; ++__s     [all...]
random_shuffle.h	66 * Dimensions (_M_num_threads + 1) __x (_M_num_bins + 1). */ 94 int _M_num_threads; 139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads]; 165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now 170 + __d->_M_num_threads + 1, 178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads]; 184 for (int __t = 0; __t < __d->_M_num_threads + 1; ++__t) 186 __offset = __sd->_M_dist[__s + 1][__d->_M_num_threads]; 199 for (_ThreadIndex __t = 0; __t < __d->_M_num_threads; ++__t) 211 // Last column [__d->_M_num_threads] stays unchanged     [all...]
balanced_quicksort.h	78 _ThreadIndex _M_num_threads; 262 _ThreadIndex __num_threads = __tl._M_num_threads; 467 __tls[__i]->_M_num_threads = __num_threads;
/prebuilts/ndk/r13/sources/cxx-stl/gnu-libstdc++/4.9/include/parallel/
tags.h	49 _ThreadIndex _M_num_threads; 54 { _M_num_threads = 0; } 59 { _M_num_threads = __num_threads; } 65 if(_M_num_threads == 0) 68 return _M_num_threads; 74 { _M_num_threads = __num_threads; }
multiway_mergesort.h	68 _ThreadIndex _M_num_threads; 142 __seqs(__sd->_M_num_threads); 143 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; __s++) 149 std::vector<_SortingPlacesIterator> __offsets(__sd->_M_num_threads); 152 if (__iam < __sd->_M_num_threads - 1) 157 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 160 if (__iam < (__sd->_M_num_threads - 1)) 171 for (_ThreadIndex __seq = 0; __seq < __sd->_M_num_threads; __seq++) 208 + (__num_samples * __sd->_M_num_threads), 213 for (_ThreadIndex __s = 0; __s < __sd->_M_num_threads; ++__s     [all...]
random_shuffle.h	66 * Dimensions (_M_num_threads + 1) __x (_M_num_bins + 1). */ 94 int _M_num_threads; 139 _ValueType** __temporaries = new _ValueType*[__d->_M_num_threads]; 165 // Sum up bins, __sd->_M_dist[__s + 1][__d->_M_num_threads] now 170 + __d->_M_num_threads + 1, 178 __global_offset += __sd->_M_dist[__s + 1][__d->_M_num_threads]; 184 for (int __t = 0; __t < __d->_M_num_threads + 1; ++__t) 186 __offset = __sd->_M_dist[__s + 1][__d->_M_num_threads]; 199 for (_ThreadIndex __t = 0; __t < __d->_M_num_threads; ++__t) 211 // Last column [__d->_M_num_threads] stays unchanged     [all...]
balanced_quicksort.h	78 _ThreadIndex _M_num_threads; 262 _ThreadIndex __num_threads = __tl._M_num_threads; 467 __tls[__i]->_M_num_threads = __num_threads;

Completed in 774 milliseconds