Searched refs:n_divisors_found (Results 1 – 1 of 1) sorted by relevance
| /freebsd/crypto/libecc/src/examples/basic/ |
| H A D | nn_pollard_rho.c | 134 int n_divisors_found, i, found, ret, check, cmp; in find_divisors() local
164 n_divisors_found = 0; in find_divisors()
168 ret = pollard_rho(&(divisors[n_divisors_found]), &n, c); in find_divisors()
173 for (i = 0; i < n_divisors_found; i++) { in find_divisors()
174 ret = nn_cmp(&(divisors[n_divisors_found]), &(divisors[i]), &cmp); EG(ret, err); in find_divisors()
184 nn_print("d:", &(divisors[n_divisors_found])); in find_divisors()
189 ret = nn_divrem(&q, &r, &n, &(divisors[n_divisors_found])); EG(ret, err); in find_divisors()
206 n_divisors_found++; in find_divisors()
207 if (n_divisors_found == MAX_DIVISORS) { in find_divisors()
|