HomeSort by: relevance | last modified time | path
    Searched defs:MIN_N (Results 1 - 5 of 5) sorted by relevancy

  /src/external/lgpl3/gmp/dist/tests/mpn/
t-invert.c 39 #define MIN_N 1
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);
t-mullo.c 37 #define MIN_N (1)
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);
t-mulmod_bnm1.c 39 #define MIN_N 1
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);
t-sqrlo.c 37 #define MIN_N (1)
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);
t-sqrmod_bnm1.c 39 #define MIN_N 1
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);

Completed in 15 milliseconds