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

/barrelfish-2018-10-04/lib/tommath/
H A Dbn_mp_prime_is_divisible.c19 * of the first PRIME_SIZE primes or not
31 for (ix = 0; ix < PRIME_SIZE; ix++) {
H A Dbn_mp_prime_next_prime.c26 mp_digit res_tab[PRIME_SIZE], step, kstep;
30 if (t <= 0 || t > PRIME_SIZE) {
38 if (mp_cmp_d(a, ltm_prime_tab[PRIME_SIZE-1]) == MP_LT) {
40 for (x = PRIME_SIZE - 2; x >= 0; x--) {
51 for (y = x + 1; y < PRIME_SIZE; y++) {
96 for (x = 1; x < PRIME_SIZE; x++) {
118 for (x = 1; x < PRIME_SIZE; x++) {
H A Dbn_mp_prime_is_prime.c34 if (t <= 0 || t > PRIME_SIZE) {
39 for (ix = 0; ix < PRIME_SIZE; ix++) {
H A Dtommath.h450 #define PRIME_SIZE 31 macro
452 #define PRIME_SIZE 256 macro
455 /* table of first PRIME_SIZE primes */
458 /* result=1 if a is divisible by one of the first PRIME_SIZE primes */
/barrelfish-2018-10-04/lib/tommath/pre_gen/
H A Dmpi.c5611 * of the first PRIME_SIZE primes or not
5623 for (ix = 0; ix < PRIME_SIZE; ix++) {
5680 if (t <= 0 || t > PRIME_SIZE) {
5685 for (ix = 0; ix < PRIME_SIZE; ix++) {
5866 mp_digit res_tab[PRIME_SIZE], step, kstep;
5870 if (t <= 0 || t > PRIME_SIZE) {
5878 if (mp_cmp_d(a, ltm_prime_tab[PRIME_SIZE-1]) == MP_LT) {
5880 for (x = PRIME_SIZE - 2; x >= 0; x--) {
5891 for (y = x + 1; y < PRIME_SIZE; y++) {
5936 for (x = 1; x < PRIME_SIZE;
[all...]

Completed in 99 milliseconds