Home
last modified time | relevance | path

Searched refs:PRIME_SIZE (Results 1 – 5 of 5) sorted by relevance

/external/dropbear/libtommath/
Dbn_mp_prime_next_prime.c26 mp_digit res_tab[PRIME_SIZE], step, kstep; in mp_prime_next_prime()
30 if (t <= 0 || t > PRIME_SIZE) { in mp_prime_next_prime()
38 if (mp_cmp_d(a, ltm_prime_tab[PRIME_SIZE-1]) == MP_LT) { in mp_prime_next_prime()
40 for (x = PRIME_SIZE - 2; x >= 0; x--) { in mp_prime_next_prime()
51 for (y = x + 1; y < PRIME_SIZE; y++) { in mp_prime_next_prime()
96 for (x = 1; x < PRIME_SIZE; x++) { in mp_prime_next_prime()
118 for (x = 1; x < PRIME_SIZE; x++) { in mp_prime_next_prime()
Dbn_mp_prime_is_prime.c34 if (t <= 0 || t > PRIME_SIZE) { in mp_prime_is_prime()
39 for (ix = 0; ix < PRIME_SIZE; ix++) { in mp_prime_is_prime()
Dbn_mp_prime_is_divisible.c31 for (ix = 0; ix < PRIME_SIZE; ix++) { in mp_prime_is_divisible()
Dtommath.h450 #define PRIME_SIZE 31 macro
452 #define PRIME_SIZE 256 macro
/external/dropbear/libtommath/pre_gen/
Dmpi.c5618 for (ix = 0; ix < PRIME_SIZE; ix++) { in mp_prime_is_divisible()
5675 if (t <= 0 || t > PRIME_SIZE) { in mp_prime_is_prime()
5680 for (ix = 0; ix < PRIME_SIZE; ix++) { in mp_prime_is_prime()
5861 mp_digit res_tab[PRIME_SIZE], step, kstep; in mp_prime_next_prime()
5865 if (t <= 0 || t > PRIME_SIZE) { in mp_prime_next_prime()
5873 if (mp_cmp_d(a, ltm_prime_tab[PRIME_SIZE-1]) == MP_LT) { in mp_prime_next_prime()
5875 for (x = PRIME_SIZE - 2; x >= 0; x--) { in mp_prime_next_prime()
5886 for (y = x + 1; y < PRIME_SIZE; y++) { in mp_prime_next_prime()
5931 for (x = 1; x < PRIME_SIZE; x++) { in mp_prime_next_prime()
5953 for (x = 1; x < PRIME_SIZE; x++) { in mp_prime_next_prime()