HomeSort by: relevance | last modified time | path
    Searched refs:__rd_log2 (Results 1 - 10 of 10) sorted by relevancy

  /src/external/gpl3/gcc/dist/libstdc++-v3/include/parallel/
random_shuffle.h 253 return (_Tp)1 << (__rd_log2(__x - 1) + 1);
362 __sd._M_num_bits = __rd_log2(__num_bins);
460 int __num_bits = __rd_log2(__num_bins);
losertree.h 100 _M_log_k = __rd_log2(_M_ik - 1) + 1;
380 _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
595 _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
850 _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
multiseq_selection.h 184 __r = __rd_log2(__nmax) + 1;
435 __r = __rd_log2(__nmax) + 1;
base.h 102 __rd_log2(_Size __n) function in namespace:__gnu_parallel
balanced_quicksort.h 457 * (_ThreadIndex)(__rd_log2(__n) + 1));
461 // There can never be more than ceil(__rd_log2(__n)) ranges on the
  /src/external/gpl3/gcc.old/dist/libstdc++-v3/include/parallel/
random_shuffle.h 253 return (_Tp)1 << (__rd_log2(__x - 1) + 1);
362 __sd._M_num_bits = __rd_log2(__num_bins);
460 int __num_bits = __rd_log2(__num_bins);
losertree.h 100 _M_log_k = __rd_log2(_M_ik - 1) + 1;
380 _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
595 _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
850 _M_k = 1 << (__rd_log2(_M_ik - 1) + 1);
multiseq_selection.h 184 __r = __rd_log2(__nmax) + 1;
435 __r = __rd_log2(__nmax) + 1;
base.h 102 __rd_log2(_Size __n) function in namespace:__gnu_parallel
balanced_quicksort.h 457 * (_ThreadIndex)(__rd_log2(__n) + 1));
461 // There can never be more than ceil(__rd_log2(__n)) ranges on the

Completed in 40 milliseconds