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

/netbsd-current/external/lgpl3/gmp/dist/tests/mpn/
H A Dt-mullo.c37 #define MIN_N (1) macro
71 for (size_min = 1; (1L << size_min) < MIN_N; size_min++)
74 /* We generate an in the MIN_N <= n <= (1 << size_range). */
78 n = MIN_N
79 + gmp_urandomm_ui (rands, (1L << size_range) + 1 - MIN_N);
H A Dt-sqrlo.c37 #define MIN_N (1) macro
70 for (size_min = 1; (1L << size_min) < MIN_N; size_min++)
73 /* We generate an in the MIN_N <= n <= (1 << size_range). */
77 n = MIN_N
78 + gmp_urandomm_ui (rands, (1L << size_range) + 1 - MIN_N);
H A Dt-invert.c39 #define MIN_N 1 macro
92 for (size_min = 1; (1L << size_min) < MIN_N; size_min++)
95 /* We generate an in the MIN_N <= n <= (1 << size_range). */
99 n = MIN_N
100 + gmp_urandomm_ui (rands, (1L << size_range) + 1 - MIN_N);
H A Dt-sqrmod_bnm1.c39 #define MIN_N 1 macro
104 for (size_min = 1; (1L << size_min) < MIN_N; size_min++)
107 /* We generate an in the MIN_N <= n <= (1 << size_range). */
111 n = MIN_N
112 + gmp_urandomm_ui (rands, (1L << size_range) + 1 - MIN_N);
H A Dt-mulmod_bnm1.c39 #define MIN_N 1 macro
109 for (size_min = 1; (1L << size_min) < MIN_N; size_min++)
112 /* We generate an in the MIN_N <= n <= (1 << size_range). */
116 n = MIN_N
117 + gmp_urandomm_ui (rands, (1L << size_range) + 1 - MIN_N);

Completed in 1111 milliseconds