| /lib/ |
| D | gcd.c | 18 unsigned long r = a | b; in gcd() local
21 return r; in gcd()
25 return r & -r; in gcd()
30 return r & -r; in gcd()
32 return a << __ffs(r); in gcd()
45 unsigned long r = a | b; in gcd() local
48 return r; in gcd()
51 r &= -r; in gcd()
53 while (!(b & r)) in gcd()
55 if (b == r) in gcd()
[all …]
|
| D | sort.c | 64 int i = (num/2 - 1) * size, n = num * size, c, r; in sort() local
77 for (r = i; r * 2 + size < n; r = c) { in sort()
78 c = r * 2 + size; in sort()
82 if (cmp_func(base + r, base + c) >= 0) in sort()
84 swap_func(base + r, base + c, size); in sort()
91 for (r = 0; r * 2 + size < i; r = c) { in sort()
92 c = r * 2 + size; in sort()
96 if (cmp_func(base + r, base + c) >= 0) in sort()
98 swap_func(base + r, base + c, size); in sort()
116 int *a, i, r = 1;
[all …]
|
| D | atomic64_test.c | 26 r = v0; \
28 r c_op val; \
29 WARN(atomic##bit##_read(&v) != r, "%Lx != %Lx\n", \
31 (unsigned long long)r); \
50 r = v0; \
51 r c_op val; \
52 BUG_ON(atomic##bit##_##op(val, &v) != r); \
53 BUG_ON(atomic##bit##_read(&v) != r); \
59 r = v0; \
60 r c_op val; \
[all …]
|
| D | bch.c | 190 uint32_t w, r[l+1]; in encode_bch() local
201 memset(bch->ecc_buf, 0, sizeof(r)); in encode_bch()
218 memcpy(r, bch->ecc_buf, sizeof(r)); in encode_bch()
233 w = r[0]^cpu_to_be32(*pdata++); in encode_bch()
240 r[i] = r[i+1]^p0[i]^p1[i]^p2[i]^p3[i]; in encode_bch()
242 r[l] = p0[l]^p1[l]^p2[l]^p3[l]; in encode_bch()
244 memcpy(bch->ecc_buf, r, sizeof(r)); in encode_bch()
437 int rem, c, r, p, k, param[m]; in solve_linear_system() local
447 for (r = p; r < m; r++) { in solve_linear_system()
448 if (rows[r] & mask) { in solve_linear_system()
[all …]
|
| D | plist.c | 223 unsigned int r = local_clock(); in plist_test() local
231 r = r * 193939 % 47629; in plist_test()
232 i = r % ARRAY_SIZE(test_node); in plist_test()
234 r = r * 193939 % 47629; in plist_test()
235 test_node[i].prio = r % 99; in plist_test()
|
| D | inflate.c | 346 struct huft r; /* table entry for structure assignment */ in huft_build() local
506 r.b = (uch)l; /* bits to dump before this table */ in huft_build()
507 r.e = (uch)(16 + j); /* bits in this table */ in huft_build()
508 r.v.t = q; /* pointer to this table */ in huft_build()
510 u[h-1][j] = r; /* connect to last table */ in huft_build()
517 r.b = (uch)(k - w); in huft_build()
519 r.e = 99; /* out of values--invalid code */ in huft_build()
522 r.e = (uch)(*p < 256 ? 16 : 15); /* 256 is end-of-block code */ in huft_build()
523 r.v.n = (ush)(*p); /* simple code is just the value */ in huft_build()
528 r.e = (uch)e[*p - s]; /* non-simple--look up in lists */ in huft_build()
[all …]
|
| D | string.c | 541 const char *r; in strcspn() local
545 for (r = reject; *r != '\0'; ++r) { in strcspn()
546 if (*p == *r) in strcspn()
916 u8 *r; in memchr_inv() local
919 r = check_bytes8(start, value, prefix); in memchr_inv()
920 if (r) in memchr_inv()
921 return r; in memchr_inv()
|
| D | test_hexdump.c | 149 int ae, he, e, f, r; in test_hexdump_overflow() local
156 r = hex_dump_to_buffer(data_b, len, rs, gs, buf, buflen, ascii); in test_hexdump_overflow()
177 a = r == e && !memcmp(test, buf, TEST_HEXDUMP_BUF_SIZE); in test_hexdump_overflow()
184 pr_err("Result: %d '%s'\n", r, buf); in test_hexdump_overflow()
|
| D | decompress_unlzo.c | 118 u8 r = 0; in unlzo() local
249 r = lzo1x_decompress_safe((u8 *) in_buf, src_len, in unlzo()
252 if (r != LZO_E_OK || dst_len != tmp) { in unlzo()
|
| D | vsprintf.c | 180 char *put_dec_trunc8(char *buf, unsigned r) in put_dec_trunc8() argument
185 if (r < 100) in put_dec_trunc8()
189 q = (r * (u64)0x28f5c29) >> 32; in put_dec_trunc8()
190 *((u16 *)buf) = decpair[r - 100*q]; in put_dec_trunc8()
198 r = (q * (u64)0x28f5c29) >> 32; in put_dec_trunc8()
199 *((u16 *)buf) = decpair[q - 100*r]; in put_dec_trunc8()
203 if (r < 100) in put_dec_trunc8()
207 q = (r * 0x147b) >> 19; in put_dec_trunc8()
208 *((u16 *)buf) = decpair[r - 100*q]; in put_dec_trunc8()
212 r = q; in put_dec_trunc8()
[all …]
|
| /lib/mpi/ |
| D | mpih-div.c | 118 mpi_limb_t r; in mpihelp_divrem() local
131 r = n0 + d1; in mpihelp_divrem()
132 if (r < d1) { /* Carry in the addition? */ in mpihelp_divrem()
133 add_ssaaaa(n1, n0, r - d0, in mpihelp_divrem()
141 udiv_qrnnd(q, r, n1, n0, d1); in mpihelp_divrem()
147 if (n1 > r || (n1 == r && n0 > n2)) { in mpihelp_divrem()
151 r += d1; in mpihelp_divrem()
152 if (r >= d1) /* If not carry, test Q again. */ in mpihelp_divrem()
157 sub_ddmmss(n1, n0, r, n2, n1, n0); in mpihelp_divrem()
202 mpi_limb_t r; in mpihelp_divrem() local
[all …]
|
| D | longlong.h | 144 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
147 "=q" ((USItype)(r)) \
162 #define udiv_qrnnd(q, r, n1, n0, d) \ argument
165 (r) = __r; \
287 #define udiv_qrnnd(q, r, nh, nl, d) \ argument
290 "=r" ((USItype)(r)) \
339 #define udiv_qrnnd(q, r, n1, n0, d) \
342 (r) = __r; \
379 #define sdiv_qrnnd(q, r, n1, n0, d) \ argument
388 (q) = __xx.__i.__l; (r) = __xx.__i.__h; \
[all …]
|
| D | mpi-internal.h | 137 #define UDIV_QRNND_PREINV(q, r, nh, nl, d, di) \ argument
157 (r) = _r; \
|
| /lib/xz/ |
| D | xz_crc32.c | 36 uint32_t r; in xz_crc32_init() local
39 r = i; in xz_crc32_init()
41 r = (r >> 1) ^ (poly & ~((r & 1) - 1)); in xz_crc32_init()
43 xz_crc32_table[i] = r; in xz_crc32_init()
|
| /lib/reed_solomon/ |
| D | decode_rs.c | 21 int i, j, r, k, pad; variable
122 r = no_eras;
124 while (++r <= nroots) { /* r is the step number */
127 for (i = 0; i < r; i++) {
128 if ((lambda[i] != 0) && (s[r - i - 1] != nn)) {
132 s[r - i - 1])];
151 if (2 * el <= r + no_eras - 1) {
152 el = r + no_eras - el;
|
| /lib/842/ |
| D | 842_compress.c | 314 static int add_repeat_template(struct sw842_param *p, u8 r) in add_repeat_template() argument
319 if (!r || --r > REPEAT_BITS_MAX) in add_repeat_template()
326 ret = add_bits(p, r, REPEAT_BITS); in add_repeat_template()
|