Searched refs:n1 (Results 1 – 5 of 5) sorted by relevance
| /lib/crypto/mpi/ |
| A D | mpih-div.c | 85 n1 = n0; in mpihelp_mod_1()
144 n1 = n0; in mpihelp_mod_1()
214 n1 -= d; in mpihelp_divrem()
220 udiv_qrnnd(qp[i], n1, n1, np[i], d); in mpihelp_divrem()
224 udiv_qrnnd(qp[i], n1, n1, 0, d); in mpihelp_divrem()
242 if (n1 >= d1 && (n1 > d1 || n0 >= d0)) { in mpihelp_divrem()
243 sub_ddmmss(n1, n0, n1, n0, d1, d0); in mpihelp_divrem()
278 if (n1 > r || (n1 == r && n0 > n2)) { 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()
[all …]
|
| A D | longlong.h | 144 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
148 : "1" ((USItype)(n1)), \
162 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
426 "1" ((USItype)(n1)), \
546 "1" ((USItype)(n1)), \
554 "1" ((USItype)(n1)), \
988 : "r" ((USItype)(n1)), \
1049 : "r" ((USItype)(n1)), \
1135 "1" ((USItype)(n1)), \
1314 __r1 = (n1) % __d1; \
[all …]
|
| /lib/math/ |
| A D | rational.c | 51 unsigned long n, d, n0, d0, n1, d1, n2, d2; in rational_best_approximation() local
55 n1 = d0 = 1; in rational_best_approximation()
74 n2 = n0 + a * n1; in rational_best_approximation()
87 if (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()
101 n1 = n2; in rational_best_approximation()
105 *best_numerator = n1; in rational_best_approximation()
|
| /lib/crypto/ |
| A D | curve25519-hacl64.c | 576 static __always_inline void ladder_bigloop_cmult_big_loop(u8 *n1, u64 *nq, in ladder_bigloop_cmult_big_loop() argument
582 u8 byte = n1[i]; in ladder_bigloop_cmult_big_loop()
588 static void ladder_cmult(u64 *result, u8 *n1, u64 *q) in ladder_cmult() argument
597 ladder_bigloop_cmult_big_loop(n1, nq, nqpq, nq2, nqpq2, q, 32); in ladder_cmult()
|
| /lib/zstd/compress/ |
| A D | huf_compress.c | 699 int const n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++; in HUF_buildTree() local
701 huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count; in HUF_buildTree()
702 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildTree()
|
Completed in 17 milliseconds