libtommath/etc/pprime.c

16 static  mp_digit
38   mp_digit r, x, y, next;
44   r = 3; fwrite(&r, 1, sizeof(mp_digit), out);
45   r = 5; fwrite(&r, 1, sizeof(mp_digit), out);
46   r = 7; fwrite(&r, 1, sizeof(mp_digit), out);
47   r = 11; fwrite(&r, 1, sizeof(mp_digit), out);
48   r = 13; fwrite(&r, 1, sizeof(mp_digit), out);
49   r = 17; fwrite(&r, 1, sizeof(mp_digit), out);
50   r = 19; fwrite(&r, 1, sizeof(mp_digit), out);
51   r = 23; fwrite(&r, 1, sizeof(mp_digit), out);
52   r = 29; fwrite(&r, 1, sizeof(mp_digit), out);
53   r = 31; fwrite(&r, 1, sizeof(mp_digit), out);
145   if (r > 31) { fwrite(&r, 1, sizeof(mp_digit), out); printf("%9d\r", r); fflush(stdout); }
160    n_prime = ftell(primes) / sizeof(mp_digit);
163 mp_digit prime_digit(void)
166    mp_digit d;
169    fseek(primes, n * sizeof(mp_digit), SEEK_SET);
170    fread(&d, 1, sizeof(mp_digit), primes);
181   static const mp_digit bases[] = { 2, 3, 5, 7, 11, 13, 17, 19 };