Home
last modified time | relevance | path

Searched refs:r (Results 1 – 25 of 51) sorted by relevance

123

/lib/
A Dbuildid.c36 memset(r, 0, sizeof(*r)); in freader_init_from_file()
45 memset(r, 0, sizeof(*r)); in freader_init_from_mem()
62 if (r->folio && file_off >= r->folio_off && in freader_get_folio()
75 if (r->may_fault && (IS_ERR(r->folio) || !folio_test_uptodate(r->folio))) { in freader_get_folio()
89 r->folio_off = folio_pos(r->folio); in freader_get_folio()
90 r->addr = kmap_local_folio(r->folio, 0); in freader_get_folio()
100 if (WARN_ON(r->buf && sz > r->buf_sz)) { in freader_fetch()
120 r->err = freader_get_folio(r, file_off); in freader_fetch()
133 memcpy(r->buf, r->addr + (file_off - r->folio_off), part_sz); in freader_fetch()
136 r->err = freader_get_folio(r, r->folio_off + folio_sz); in freader_fetch()
[all …]
A Dlinear_ranges.c29 if (!r) in linear_range_values_in_range()
31 return r->max_sel - r->min_sel + 1; in linear_range_values_in_range()
72 return r->min + (r->max_sel - r->min_sel) * r->step; in linear_range_get_max_value()
90 if (r->min_sel > selector || r->max_sel < selector) in linear_range_get_value()
93 *val = r->min + (selector - r->min_sel) * r->step; in linear_range_get_value()
117 if (r[i].min_sel <= selector && r[i].max_sel >= selector) in linear_range_get_value_array()
144 if (r->min > val) in linear_range_get_selector_low()
154 if (r->step == 0) in linear_range_get_selector_low()
157 *selector = (val - r->min) / r->step + r->min_sel; in linear_range_get_selector_low()
238 *selector = DIV_ROUND_UP(val - r->min, r->step) + r->min_sel; in linear_range_get_selector_high()
[all …]
A Drefcount.c15 refcount_set(r, REFCOUNT_SATURATED); in refcount_warn_saturate()
55 bool refcount_dec_if_one(refcount_t *r) in refcount_dec_if_one() argument
59 return atomic_try_cmpxchg_release(&r->refs, &val, 0); in refcount_dec_if_one()
74 bool refcount_dec_not_one(refcount_t *r) in refcount_dec_not_one() argument
76 unsigned int new, val = atomic_read(&r->refs); in refcount_dec_not_one()
115 if (refcount_dec_not_one(r)) in refcount_dec_and_mutex_lock()
119 if (!refcount_dec_and_test(r)) { in refcount_dec_and_mutex_lock()
146 if (refcount_dec_not_one(r)) in refcount_dec_and_lock()
150 if (!refcount_dec_and_test(r)) { in refcount_dec_and_lock()
175 if (refcount_dec_not_one(r)) in refcount_dec_and_lock_irqsave()
[all …]
A Dbitmap-str.c224 for (start = r->start; start <= r->end; start += r->group_len) in bitmap_set_region()
225 bitmap_set(bitmap, start, min(r->end - start + 1, r->off)); in bitmap_set_region()
230 if (r->start > r->end || r->group_len == 0 || r->off > r->group_len) in bitmap_check_region()
233 if (r->end >= r->nbits) in bitmap_check_region()
300 r->start = 0; in bitmap_parse_region()
301 r->end = lastbit; in bitmap_parse_region()
338 r->end = r->start; in bitmap_parse_region()
340 r->off = r->end + 1; in bitmap_parse_region()
341 r->group_len = r->end + 1; in bitmap_parse_region()
376 struct region r; in bitmap_parselist() local
[all …]
A Datomic64_test.c23 r = v0; \
47 r = v0; \
56 r = v0; \
112 int r; in test_atomic() local
162 r = v1; in test_atomic64()
192 r += one; in test_atomic64()
197 r -= one; in test_atomic64()
212 r += one; in test_atomic64()
217 r -= one; in test_atomic64()
230 r += one; in test_atomic64()
[all …]
A Dgeneric-radix-tree.c37 n = genradix_root_to_node(r); in __genradix_ptr_alloc()
38 level = genradix_root_to_depth(r); in __genradix_ptr_alloc()
53 if ((v = cmpxchg_release(&radix->root, r, new_root)) == r) { in __genradix_ptr_alloc()
90 struct genradix_root *r; in __genradix_iter_peek() local
98 r = READ_ONCE(radix->root); in __genradix_iter_peek()
99 if (!r) in __genradix_iter_peek()
102 n = genradix_root_to_node(r); in __genradix_iter_peek()
144 struct genradix_root *r; in __genradix_iter_peek_prev() local
152 r = READ_ONCE(radix->root); in __genradix_iter_peek_prev()
153 if (!r) in __genradix_iter_peek_prev()
[all …]
A Dbch.c273 r[i] = r[i+1]^p0[i]^p1[i]^p2[i]^p3[i]; in bch_encode()
480 for (r = p; r < m; r++) { in solve_linear_system()
491 for (r = rem; r < m; r++) { in solve_linear_system()
504 for (r = m-1; r >= 0; r--) { in solve_linear_system()
505 if ((r > m-1-k) && rows[r]) in solve_linear_system()
509 rows[r] = (p && (r == param[p-1])) ? in solve_linear_system()
510 p--, 1u << (m-r) : rows[r-p]; in solve_linear_system()
525 for (r = m-1; r >= 0; r--) { in solve_linear_system()
618 if ((gf_sqr(bch, r)^r) == u) { in find_poly_deg2_roots()
1162 if (y && (r < m) && !xi[r]) { in build_deg2_base()
[all …]
A Dtest_memcat_p.c25 int err = -ENOMEM, i, r, total = 0; in test_memcat_p_init() local
35 for (i = 0, r = 1; i < INPUT_MAX - 1; i++) { in test_memcat_p_init()
47 r = (r * 725861) % 6599; in test_memcat_p_init()
48 in0[i]->num = r; in test_memcat_p_init()
49 in1[i]->num = -r; in test_memcat_p_init()
A Dclosure.c18 int r = flags & CLOSURE_REMAINING_MASK; in closure_put_after_sub_checks() local
22 flags & CLOSURE_GUARD_MASK, (unsigned) __fls(r))) in closure_put_after_sub_checks()
23 r &= ~CLOSURE_GUARD_MASK; in closure_put_after_sub_checks()
25 WARN(!r && (flags & ~CLOSURE_DESTRUCTOR), in closure_put_after_sub_checks()
266 int r = atomic_read(&cl->remaining); in debug_show() local
270 r & CLOSURE_REMAINING_MASK); in debug_show()
275 r & CLOSURE_RUNNING ? "R" : ""); in debug_show()
277 if (r & CLOSURE_WAITING) in debug_show()
A Dinflate.c508 r.e = (uch)(16 + j); /* bits in this table */ in huft_build()
509 r.v.t = q; /* pointer to this table */ in huft_build()
511 u[h-1][j] = r; /* connect to last table */ in huft_build()
518 r.b = (uch)(k - w); in huft_build()
520 r.e = 99; /* out of values--invalid code */ in huft_build()
530 r.v.n = d[*p++ - s]; in huft_build()
537 q[j] = r; in huft_build()
1089 int r; /* result code */ in inflate() local
1105 r = inflate_block(&e); in inflate()
1106 if (r) in inflate()
[all …]
/lib/crypto/mpi/
A Dmpih-div.c81 UDIV_QRNND_PREINV(dummy, r, r, in mpihelp_mod_1()
87 UDIV_QRNND_PREINV(dummy, r, r, in mpihelp_mod_1()
116 UDIV_QRNND_PREINV(dummy, r, r, in mpihelp_mod_1()
140 udiv_qrnnd(dummy, r, r, in mpihelp_mod_1()
146 udiv_qrnnd(dummy, r, r, in mpihelp_mod_1()
165 udiv_qrnnd(dummy, r, r, n0, divisor_limb); in mpihelp_mod_1()
278 if (n1 > r || (n1 == r && n0 > n2)) { in mpihelp_divrem()
436 UDIV_QRNND_PREINV(quot_ptr[0], r, r, in mpihelp_divmod_1()
464 UDIV_QRNND_PREINV(quot_ptr[i], r, r, in mpihelp_divmod_1()
488 udiv_qrnnd(quot_ptr[i + 1], r, r, in mpihelp_divmod_1()
[all …]
A Dlonglong.h147 "=q" ((USItype)(r)) \
165 (r) = __r; \
290 "=r" ((USItype)(r)) \
342 (r) = __r; \
424 "=d" (r) \
544 "=d" ((USItype)(r)) \
991 (r) = (n0) - __q * (d); \
1048 "=r" ((USItype)(r)) \
1184 : "=g" (q), "=g" (r) \
1339 (r) = __r0; \
[all …]
/lib/math/
A Dgcd.c26 return r & -r; in binary_gcd()
31 return r & -r; in binary_gcd()
55 return r; in gcd()
63 r &= -r; in gcd()
65 while (!(b & r)) in gcd()
67 if (b == r) in gcd()
68 return r; in gcd()
71 while (!(a & r)) in gcd()
73 if (a == r) in gcd()
74 return r; in gcd()
[all …]
/lib/tests/
A Dcmdline_kunit.c111 int r[16]; in cmdline_do_one_range_test() local
114 memset(r, 0, sizeof(r)); in cmdline_do_one_range_test()
115 get_options(in, ARRAY_SIZE(r), r); in cmdline_do_one_range_test()
117 n, e[0], r[0]); in cmdline_do_one_range_test()
118 for (i = 1; i < ARRAY_SIZE(r); i++) in cmdline_do_one_range_test()
119 KUNIT_EXPECT_EQ_MSG(test, r[i], e[i], "in test %u at %u", n, i); in cmdline_do_one_range_test()
121 memset(r, 0, sizeof(r)); in cmdline_do_one_range_test()
122 get_options(in, 0, r); in cmdline_do_one_range_test()
124 n, e[0], r[0]); in cmdline_do_one_range_test()
126 p = memchr_inv(&r[1], 0, sizeof(r) - sizeof(r[0])); in cmdline_do_one_range_test()
[all …]
A Dtest_sort.c20 int *a, i, r = 1; in test_sort() local
26 r = (r * 725861) % 6599; in test_sort()
27 a[i] = r; in test_sort()
35 r = 48; in test_sort()
38 r = (r * 725861) % 6599; in test_sort()
39 a[i] = r; in test_sort()
/lib/crypto/
A Dgf128mul.c208 memset(r, 0, sizeof(*r)); in gf128mul_lle()
212 be128_xor(r, r, &p[ 0 + !(ch & 0x80)]); in gf128mul_lle()
213 be128_xor(r, r, &p[ 2 + !(ch & 0x40)]); in gf128mul_lle()
214 be128_xor(r, r, &p[ 4 + !(ch & 0x20)]); in gf128mul_lle()
215 be128_xor(r, r, &p[ 6 + !(ch & 0x10)]); in gf128mul_lle()
216 be128_xor(r, r, &p[ 8 + !(ch & 0x08)]); in gf128mul_lle()
217 be128_xor(r, r, &p[10 + !(ch & 0x04)]); in gf128mul_lle()
218 be128_xor(r, r, &p[12 + !(ch & 0x02)]); in gf128mul_lle()
219 be128_xor(r, r, &p[14 + !(ch & 0x01)]); in gf128mul_lle()
303 be128_xor(r, r, &t->t[i]->t[ap[15 - i]]); in gf128mul_64k_bbe()
[all …]
A Dpoly1305-donna32.c25 key->precomputed_s.r[0] = key->key.r[1] * 5; in poly1305_core_setkey()
26 key->precomputed_s.r[1] = key->key.r[2] * 5; in poly1305_core_setkey()
27 key->precomputed_s.r[2] = key->key.r[3] * 5; in poly1305_core_setkey()
28 key->precomputed_s.r[3] = key->key.r[4] * 5; in poly1305_core_setkey()
48 r0 = key->key.r[0]; in poly1305_core_blocks()
49 r1 = key->key.r[1]; in poly1305_core_blocks()
50 r2 = key->key.r[2]; in poly1305_core_blocks()
51 r3 = key->key.r[3]; in poly1305_core_blocks()
52 r4 = key->key.r[4]; in poly1305_core_blocks()
54 s1 = key->precomputed_s.r[0]; in poly1305_core_blocks()
[all …]
A Dblake2s-generic.c68 #define G(r, i, a, b, c, d) do { \ in blake2s_compress_generic() argument
69 a += b + m[blake2s_sigma[r][2 * i + 0]]; \ in blake2s_compress_generic()
79 #define ROUND(r) do { \ in blake2s_compress_generic() argument
80 G(r, 0, v[0], v[ 4], v[ 8], v[12]); \ in blake2s_compress_generic()
81 G(r, 1, v[1], v[ 5], v[ 9], v[13]); \ in blake2s_compress_generic()
82 G(r, 2, v[2], v[ 6], v[10], v[14]); \ in blake2s_compress_generic()
83 G(r, 3, v[3], v[ 7], v[11], v[15]); \ in blake2s_compress_generic()
84 G(r, 4, v[0], v[ 5], v[10], v[15]); \ in blake2s_compress_generic()
85 G(r, 5, v[1], v[ 6], v[11], v[12]); \ in blake2s_compress_generic()
86 G(r, 6, v[2], v[ 7], v[ 8], v[13]); \ in blake2s_compress_generic()
[all …]
/lib/crypto/powerpc/
A Dpoly1305-p10le_64.S23 # h4 = m1 * r⁴ + m2 * r³ + m3 * r² + m4 * r
28 # setup r^4, r^3, r^2, r vectors
29 # vs [r^1, r^3, r^2, r^4]
215 # [r^2, r^3, r^1, r^4]
327 # setup r^4, r^3, r^2, r vectors
328 # [r, r^3, r^2, r^4]
356 # [r, r^3, r^2, r^4]
400 # r^2 r^4
630 # h4 = m1 * r⁴ + m2 * r³ + m3 * r² + m4 * r
633 # h3 = (h1 + m3) * r^2, h4 = (h2 + m4) * r^2 --> (h0 + m1) r*4 + (h3 + m3) r^2, (h0 + m2) r^4 + (h…
[all …]
/lib/reed_solomon/
A Dtest_rslib.c123 ws->r = ws->c + nn; in alloc_ws()
124 ws->s = ws->r + nn; in alloc_ws()
160 uint16_t *r = ws->r; in get_rcw_we() local
173 memcpy(r, c, len * sizeof(*r)); in get_rcw_we()
190 r[errloc] ^= errval; in get_rcw_we()
269 uint16_t *r = ws->r; in test_uc() local
279 derrs = decode_rs16(rs, r, r + dlen, dlen, in test_uc()
290 derrs = decode_rs16(rs, r, r + dlen, dlen, in test_uc()
307 if (memcmp(r, c, len * sizeof(*r))) in test_uc()
374 uint16_t *r = ws->r; in test_bc() local
[all …]
/lib/xz/
A Dxz_crc32.c35 uint32_t r; in xz_crc32_init() local
38 r = i; in xz_crc32_init()
40 r = (r >> 1) ^ (poly & ~((r & 1) - 1)); in xz_crc32_init()
42 xz_crc32_table[i] = r; in xz_crc32_init()
/lib/crypto/x86/
A Dsha1-avx2-asm.S298 .set i, \r
341 ROUND_F1 \r
343 ROUND_F2 \r
345 ROUND_F3 \r
349 .macro RR r
379 .macro ROUND_F1 r
380 add WK(\r), E
400 .macro ROUND_F2 r
401 add WK(\r), E
422 .macro ROUND_F3 r
[all …]
/lib/crypto/arm64/
A Dpoly1305-armv8.pl554 // ((inp[0]*r^4+inp[2]*r^2+inp[4])*r^4+inp[6]*r^2
555 // ((inp[1]*r^4+inp[3]*r^2+inp[5])*r^3+inp[7]*r
557 // ((inp[0]*r^4+inp[2]*r^2+inp[4])*r^4+inp[6]*r^2+inp[8])*r^2
558 // ((inp[1]*r^4+inp[3]*r^2+inp[5])*r^4+inp[7]*r^2+inp[9])*r
561 // Note that we start with inp[2:3]*r^2. This is because it
633 // (hash+inp[0:1])*r^4 and accumulate
794 // (hash+inp[0:1])*r^4:r^3 and accumulate
/lib/crypto/arm/
A Dpoly1305-armv4.pl887 @ ((inp[0]*r^4+inp[2]*r^2+inp[4])*r^4+inp[6]*r^2
888 @ ((inp[1]*r^4+inp[3]*r^2+inp[5])*r^3+inp[7]*r
890 @ ((inp[0]*r^4+inp[2]*r^2+inp[4])*r^4+inp[6]*r^2+inp[8])*r^2
891 @ ((inp[1]*r^4+inp[3]*r^2+inp[5])*r^4+inp[7]*r^2+inp[9])*r
894 @ Note that we start with inp[2:3]*r^2. This is because it
904 @ inp[2:3]*r^2
949 @ (hash+inp[0:1])*r^4 and accumulate
1111 @ (hash+inp[0:1])*r^4:r^3 and accumulate
/lib/crc/arm64/
A Dcrc32-core.S42 .irp r, \regs
43 CPU_BE( rev \r, \r )
48 .irp r, \regs
49 CPU_LE( rev \r, \r )
51 .irp r, \regs
52 rbit \r, \r

Completed in 48 milliseconds

123