Searched refs:n2 (Results 1 – 4 of 4) sorted by relevance
| /lib/math/ |
| A D | rational.c | 51 unsigned long n, d, n0, d0, n1, d1, n2, d2; in rational_best_approximation() local
74 n2 = n0 + a * n1; in rational_best_approximation()
82 if ((n2 > max_numerator) || (d2 > max_denominator)) { in rational_best_approximation()
101 n1 = n2; in rational_best_approximation()
|
| /lib/crypto/mpi/ |
| A D | mpih-div.c | 233 mpi_limb_t n1, n0, n2; in mpihelp_divrem() local
276 n2 = np[0]; in mpihelp_divrem()
278 if (n1 > r || (n1 == r && n0 > n2)) { in mpihelp_divrem()
288 sub_ddmmss(n1, n0, r, n2, n1, n0); in mpihelp_divrem()
316 mpi_limb_t n1, n2; in mpihelp_divrem() local
321 n2 = np[dsize]; in mpihelp_divrem()
323 n2 = np[dsize - 1]; in mpihelp_divrem()
355 if (n2 != cy_limb) { in mpihelp_divrem()
|
| /lib/842/ |
| A D | 842_compress.c | 428 u64 n2 = (pos >> 1) % (1 << I2_BITS); in update_hashtables() local
433 replace_hash(p, 2, n2, 0); in update_hashtables()
434 replace_hash(p, 2, n2, 1); in update_hashtables()
435 replace_hash(p, 2, n2, 2); in update_hashtables()
436 replace_hash(p, 2, n2, 3); in update_hashtables()
|
| /lib/zstd/compress/ |
| A D | huf_compress.c | 700 int const n2 = (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 24 milliseconds