426   for (int i = 0; i < cnt; i++)  in mod2()  local
529   int i;  in factor_insert_multiplicity()  local
605   for (idx_t i = 0; i < factors->nfactors; i++)  in mp_factor_clear()  local
618   ptrdiff_t i;  in mp_factor_insert()  local
715 factor_insert_refind (struct factors *factors, uintmax_t p, int i, int off)  in factor_insert_refind()
780   idx_t i;  in factor_using_division()  local
856   for (idx_t i = 1; i <= PRIMES_PTAB_ENTRIES;)  in mp_factor_using_division()  local
1087   int i;  in powm2()  local
1134   for (int i = 1; i < k; i++)  in millerrabin()  local
1163   for (int i = 1; i < k; i++)  in millerrabin2()  local
1185   for (mp_bitcnt_t i = 1; i < k; i++)  in mp_millerrabin()  local
1240           for (int i = 0; i < factors.nfactors && is_prime; i++)  in prime_p()  local
1346           for (int i = 0; i < factors.nfactors && is_prime; i++)  in prime2_p()  local
1424           for (idx_t i = 0; i < factors.nfactors && is_prime; i++)  in mp_prime_p()  local
1501           for (unsigned long int i = 0; i < k; i++)  in factor_using_pollard_rho()  local
1589           for (unsigned long int i = 0; i < k; i++)  in factor_using_pollard_rho2()  local
1715           for (unsigned long long int i = 0; i < k; i++)  in mp_factor_using_pollard_rho()  local
2014               for (unsigned int i = 0; i < f.nfactors; i++)  in factor_using_squfof()  local
2026       unsigned int i;  in factor_using_squfof()  local
2412 lbuf_putint (uintmax_t i, size_t min_width)  in lbuf_putint()
2646       for (int i = optind; i < argc; i++)  in main()  local
2656       for (int i = 1, acc_f = 0.0; i <= Q_FREQ_SIZE; i++)  in main()  local