Searched refs:size_fd (Results 1 – 3 of 3) sorted by relevance
/dports/math/gmp-ecm/ecm-7.0.4/ |
H A D | ecm2.c | 485 for (i = 0; i < params->size_fd; i++) in ecm_rootsF() 498 for (i = 0 ; i < params->size_fd + 4; i++) in ecm_rootsF() 519 clear_list (coeffs, params->size_fd); in ecm_rootsF() 573 for (i = 0; i < params->size_fd; i++) in ecm_rootsF() 687 clear_list (coeffs, params->size_fd); in ecm_rootsG_init() 692 for (k = 0; k < params->size_fd; k++) in ecm_rootsG_init() 698 state->size_T = params->size_fd + 4; in ecm_rootsG_init() 702 for (k = 0; k < params->size_fd; k++) in ecm_rootsG_init() 707 clear_list (coeffs, params->size_fd); in ecm_rootsG_init() 719 for (k = 0; k < params->size_fd; k++) in ecm_rootsG_init() [all …]
|
H A D | stage2.c | 159 unsigned int i, j, size_fd; in init_progression_coeffs() local 165 size_fd = k * (eulerphi(d) / eulerphi(m)) * (E + 1); in init_progression_coeffs() 166 fd = (listz_t) malloc (size_fd * sizeof (mpz_t)); in init_progression_coeffs() 168 for (i = 0; i < size_fd; i++) in init_progression_coeffs() 177 t, d, e, k, m, E, dickson_a, size_fd); in init_progression_coeffs() 274 params->size_fd = params->nr * (params->S + 1); in init_roots_params()
|
H A D | ecm-impl.h | 206 unsigned int size_fd; /* How many entries .fd has, always nr * (S+1) */ member
|