Home
last modified time | relevance | path

Searched refs:n0 (Results 1 – 3 of 3) sorted by relevance

/lib/crypto/mpi/
A Dmpih-div.c85 n1 = n0; in mpihelp_mod_1()
144 n1 = n0; in mpihelp_mod_1()
240 n0 = np[0]; in mpihelp_divrem()
243 sub_ddmmss(n1, n0, n1, n0, d1, d0); in mpihelp_divrem()
270 n0 = -d0; in mpihelp_divrem()
281 sub_ddmmss(n1, n0, n1, n0, 0, d0); in mpihelp_divrem()
288 sub_ddmmss(n1, n0, r, n2, n1, n0); in mpihelp_divrem()
291 np[0] = n0; in mpihelp_divrem()
306 if (n0 > dX in mpihelp_divrem()
434 n1 = n0; in mpihelp_divmod_1()
[all …]
A Dlonglong.h144 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
149 "r" ((USItype)(n0)), \
162 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
339 #define udiv_qrnnd(q, r, n1, n0, d) \
379 #define sdiv_qrnnd(q, r, n1, n0, d) \ argument
425 : "0" ((USItype)(n0)), \
545 : "0" ((USItype)(n0)), \
553 : "0" ((USItype)(n0)), \
989 "r" ((USItype)(n0)), \
991 (r) = (n0) - __q * (d); \
[all …]
/lib/math/
A Drational.c51 unsigned long n, d, n0, d0, n1, d1, n2, d2; in rational_best_approximation() local
54 n0 = d1 = 0; in rational_best_approximation()
74 n2 = n0 + a * n1; in rational_best_approximation()
88 t = min(t, (max_numerator - n0) / n1); in rational_best_approximation()
95 n1 = n0 + t * n1; in rational_best_approximation()
100 n0 = n1; in rational_best_approximation()

Completed in 9 milliseconds