Lines Matching +defs:sz +defs:n +defs:rt +defs:k
664 long double n = (long double)i; in stress_cpu_nsqrt() local
667 long double rt; in stress_cpu_nsqrt() local
733 uint32_t n; in stress_cpu_apery() local
764 const int n, in fft_partial()
813 int n = 1; in stress_cpu_euler() local
855 register uint64_t n = 989345275647ULL; /* Has 1348 steps in cycle */ in stress_cpu_collatz() local
1014 const int sz = 8; in stress_cpu_idct() local
1468 int i, j, k; in stress_cpu_matrix_prod() local
1567 register int n = 1; in stress_cpu_ln2() local
1595 static uint32_t HOT ackermann(const uint32_t m, const uint32_t n) in ackermann()
1625 double n = 1e6; in stress_cpu_explog() local
1678 static uint16_t HOT OPTIMIZE3 ccitt_crc16(const uint8_t *data, size_t n) in ccitt_crc16()
1827 long double sum = 0.0L, k = 1.0L, _gamma = 0.0L, gammaold; in stress_cpu_gamma() local
1919 static inline HOT OPTIMIZE3 ALWAYS_INLINE uint32_t is_prime(uint32_t n) in is_prime()
2000 const uint16_t n, in hanoi()
2022 uint32_t n = hanoi(20, 'X', 'Y', 'Z'); in stress_cpu_hanoi() local
2169 static inline long double HOT OPTIMIZE3 factorial(int n) in factorial()
2224 int k = 0; in stress_cpu_pi() local
2258 int n = 0; in stress_cpu_omega() local
2368 ssize_t n, in stress_cpu_callfunc_func()
2408 #define P2(n) n, n^1, n^1, n argument
2409 #define P4(n) P2(n), P2(n^1), P2(n^1), P2(n) argument
2410 #define P6(n) P4(n), P4(n^1), P4(n^1), P4(n) argument
2921 uint32_t all, n; in stress_cpu_queens() local
2946 int n; in stress_cpu_factorial() local