Lines Matching full:divisors
129 /* Maximum number of divisors we support */
131 /* Function to find prime divisors of the NN input */
136 nn divisors[MAX_DIVISORS]; in find_divisors() local
141 divisors[i].magic = WORD(0); in find_divisors()
161 ret = nn_init(&(divisors[i]), 0); EG(ret, err); in find_divisors()
168 ret = pollard_rho(&(divisors[n_divisors_found]), &n, c); 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()
187 * to find new divisors. If n / d is prime, we are done! in find_divisors()
189 ret = nn_divrem(&q, &r, &n, &(divisors[n_divisors_found])); EG(ret, err); in find_divisors()
209 ("Max divisors reached, leaving ...\n"); in find_divisors()
220 nn_uninit(&(divisors[i])); in find_divisors()