| /src/external/apache2/llvm/dist/libcxx/utils/google-benchmark/src/ |
| benchmark_register.h | 17 static const T kmax = std::numeric_limits<T>::max(); local
20 for (T i = 1; i < kmax / mult; i *= mult) {
|
| /src/external/apache2/llvm/dist/llvm/utils/benchmark/src/ |
| benchmark_register.h | 18 static const T kmax = std::numeric_limits<T>::max(); local
21 for (T i = 1; i < kmax / mult; i *= mult) {
|
| /src/external/lgpl3/mpfr/dist/src/ |
| const_pi.c | 51 mpfr_prec_t px, p, cancel, k, kmax; local
62 /* we need 9*2^kmax - 4 >= px+2*kmax+8 */
63 for (kmax = 2; ((px + 2 * kmax + 12) / 9) >> kmax; kmax ++);
65 p = px + 3 * kmax + 14; /* guarantees no recomputation for px <= 10000 */
112 p += kmax;
|
| /src/external/lgpl3/gmp/dist/mpz/ |
| bin_uiui.c | 66 (2) Compute nmax/kmax semi-accurately, without scalar division or a loop.
212 unsigned nmax, kmax, nmaxnow, numfac; local
233 MAXFACS (kmax, k);
234 ASSERT (kmax <= M);
251 kmax = MIN (kmax, t);
253 while (kmax != 0 && kn < SOME_THRESHOLD)
255 jjj = mulfunc[kmax - 1] (j);
256 j += kmax; /* number of factors used */
263 kmax = MIN (kmax, t)
[all...] |
| /src/external/mpl/bind/dist/lib/isc/ |
| histo.c | 307 uint kmax = value_to_key(hg, max); local
309 for (uint key = kmin; key <= kmax; key++) {
|
| /src/external/gpl3/gcc/dist/gcc/ |
| attribs.cc | 2271 unsigned kmax = 1 + !!decl_attrs[1];
2272 for (unsigned k = 0; k != kmax; ++k)
2269 unsigned kmax = 1 + !!decl_attrs[1]; local
|
| /src/external/gpl3/gcc.old/dist/gcc/ |
| attribs.cc | 2133 unsigned kmax = 1 + !!decl_attrs[1];
2134 for (unsigned k = 0; k != kmax; ++k)
2131 unsigned kmax = 1 + !!decl_attrs[1]; local
|
| /src/external/lgpl3/gmp/dist/tune/ |
| tuneup.c | 945 int k, best_k, last_best_k, kmax; local
1099 kmax = sizeof (mp_size_t) * 4; /* GMP_MP_SIZE_T_BITS / 2 */
1100 kmax = MIN (kmax, 25-1);
1101 for (k = last_best_k + 1; k <= kmax; k++)
|
