Home
last modified time | relevance | path

Searched refs:n1 (Results 1 – 5 of 5) sorted by relevance

/lib/crypto/mpi/
Dmpih-div.c33 mpi_limb_t n1, n0, r; in mpihelp_mod_1() local
70 n1 = dividend_ptr[dividend_size - 1]; in mpihelp_mod_1()
71 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1()
82 ((n1 << normalization_steps) in mpihelp_mod_1()
85 n1 = n0; in mpihelp_mod_1()
88 n1 << normalization_steps, in mpihelp_mod_1()
129 n1 = dividend_ptr[dividend_size - 1]; in mpihelp_mod_1()
130 r = n1 >> (BITS_PER_MPI_LIMB - normalization_steps); in mpihelp_mod_1()
141 ((n1 << normalization_steps) in mpihelp_mod_1()
144 n1 = n0; in mpihelp_mod_1()
[all …]
Dlonglong.h144 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
148 : "1" ((USItype)(n1)), \
162 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
164 (q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \
339 #define udiv_qrnnd(q, r, n1, n0, d) \
341 (q) = __udiv_qrnnd(&__r, (n1), (n0), (d)); \
379 #define sdiv_qrnnd(q, r, n1, n0, d) \ argument
384 __xx.__i.__h = n1; __xx.__i.__l = n0; \
421 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
426 "1" ((USItype)(n1)), \
[all …]
/lib/math/
Drational.c51 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/
Dcurve25519-hacl64.c576 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/
Dhuf_compress.c626 int const n1 = (huffNode[lowS].count < huffNode[lowN].count) ? lowS-- : lowN++; in HUF_buildTree() local
628 huffNode[nodeNb].count = huffNode[n1].count + huffNode[n2].count; in HUF_buildTree()
629 huffNode[n1].parent = huffNode[n2].parent = (U16)nodeNb; in HUF_buildTree()