Home
last modified time | relevance | path

Searched refs:k (Results 1 – 25 of 38) sorted by relevance

12

/lib/
A Dbitmap.c41 for (k = 0; k < lim; ++k) in __bitmap_equal()
61 for (k = 0; k < lim; ++k) { in __bitmap_or_equal()
76 for (k = 0; k < lim; ++k) in __bitmap_complement()
236 for (k = 0; k < lim; k++) in __bitmap_and()
251 for (k = 0; k < nr; k++) in __bitmap_or()
262 for (k = 0; k < nr; k++) in __bitmap_xor()
274 for (k = 0; k < lim; k++) in __bitmap_andnot()
290 for (k = 0; k < nr; k++) in __bitmap_replace()
291 dst[k] = (old[k] & ~mask[k]) | (new[k] & mask[k]); in __bitmap_replace()
299 for (k = 0; k < lim; ++k) in __bitmap_intersects()
[all …]
A Dklist.c89 k->get = get; in klist_init()
90 k->put = put; in klist_init()
96 spin_lock(&k->k_lock); in add_head()
103 spin_lock(&k->k_lock); in add_tail()
112 knode_set_klist(n, k); in klist_node_init()
113 if (k->get) in klist_node_init()
114 k->get(n); in klist_node_init()
124 klist_node_init(k, n); in klist_add_head()
125 add_head(k, n); in klist_add_head()
137 add_tail(k, n); in klist_add_tail()
[all …]
A Dts_kmp.c77 unsigned int k, q; in compute_prefix_tbl() local
80 for (k = 0, q = 1; q < len; q++) { in compute_prefix_tbl()
81 while (k > 0 && (icase ? toupper(pattern[k]) : pattern[k]) in compute_prefix_tbl()
83 k = prefix_tbl[k-1]; in compute_prefix_tbl()
84 if ((icase ? toupper(pattern[k]) : pattern[k]) in compute_prefix_tbl()
86 k++; in compute_prefix_tbl()
87 prefix_tbl[q] = k; in compute_prefix_tbl()
A Dinflate.c234 #define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}}
454 for (; k <= g; k++) in huft_build()
609 k = bk; in inflate_codes()
693 bk = k; in inflate_codes()
716 k = bk; in inflate_stored()
752 bk = k; in inflate_stored()
862 k = bk; in inflate_dynamic()
972 bk = k; in inflate_dynamic()
1047 k = bk; in inflate_block()
1064 bk = k; in inflate_block()
[all …]
A Dbootconfig.c649 if (!xbc_valid_keyword(k)) in __xbc_add_key()
681 k = strim(k); in __xbc_parse_keys()
684 ret = __xbc_add_key(k); in __xbc_parse_keys()
687 k = p; in __xbc_parse_keys()
690 return __xbc_add_key(k); in __xbc_parse_keys()
741 *k = next; in xbc_parse_kv()
751 *k = strim(*k); in xbc_parse_key()
752 if (**k != '\0') { in xbc_parse_key()
758 *k = n; in xbc_parse_key()
770 *k = n; in xbc_open_brace()
[all …]
A Doid_registry.c31 unsigned i, j, k, hash; in look_up_OID() local
47 k = OID__NR; in look_up_OID()
48 while (i < k) { in look_up_OID()
49 j = (i + k) / 2; in look_up_OID()
53 k = j; in look_up_OID()
64 k = j; in look_up_OID()
79 k = j; in look_up_OID()
A Dbch.c418 int k, pp = -1; in compute_error_locator_polynomial() local
431 k = 2*i-pp; in compute_error_locator_polynomial()
472 k = 0; in solve_linear_system()
478 p = c-k; in solve_linear_system()
502 if (k > 0) { in solve_linear_system()
503 p = k; in solve_linear_system()
542 int i, j, k; in find_affine4_roots() local
556 k += 2; in find_affine4_roots()
563 for (k = 0; k < 16; k = (k+j+1) & ~j) { in find_affine4_roots()
564 t = ((rows[k] >> j)^rows[k+j]) & mask; in find_affine4_roots()
[all …]
A Dkobject.c815 INIT_LIST_HEAD(&k->list); in kset_init()
861 if (!k) in kset_register()
864 if (!k->kobj.ktype) { in kset_register()
869 kset_init(k); in kset_register()
872 kfree_const(k->kobj.name); in kset_register()
874 k->kobj.name = NULL; in kset_register()
888 if (!k) in kset_unregister()
890 kobject_del(&k->kobj); in kset_unregister()
891 kobject_put(&k->kobj); in kset_unregister()
906 struct kobject *k; in kset_find_obj() local
[all …]
A Dinterval_tree_test.c132 int i, j, k; in intersection_range_check() local
160 for (k = 0; k < nsearches; k++) { in intersection_range_check()
162 if (!k) { in intersection_range_check()
242 int i, j, k; in span_iteration_check() local
267 for (k = 0; k < nsearches; k++) { in span_iteration_check()
269 if (!k) { in span_iteration_check()
A Dtest_ubsan.c80 int i = 4, j = 4, k = -1; in test_ubsan_out_of_bounds() local
89 OPTIMIZER_HIDE_VAR(k); in test_ubsan_out_of_bounds()
95 data.arr[k] = i; in test_ubsan_out_of_bounds()
A Ddecompress_bunzip2.c162 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
199 k = get_bits(bd, 16); in get_next_block()
201 if (k&(1 << (15-j))) in get_next_block()
259 k = get_bits(bd, 2); in get_next_block()
260 if (k < 2) { in get_next_block()
266 t += (((k+1)&2)-1); in get_next_block()
490 k = j+byteCount[i]; in get_next_block()
492 j = k; in get_next_block()
/lib/raid6/
A Dmktables.c55 int i, j, k; in main() local
72 for (k = 0; k < 8; k++) in main()
73 printf("0x%02x,%c", gfmul(i, j + k), in main()
74 (k == 7) ? '\n' : ' '); in main()
91 for (k = 0; k < 8; k++) in main()
93 (k == 7) ? '\n' : ' '); in main()
97 for (k = 0; k < 8; k++) in main()
99 (k == 7) ? '\n' : ' '); in main()
134 for (k = 0; k < 256; k++) in main()
135 if (exptbl[k] == (i + j)) { in main()
[all …]
/lib/crypto/
A Dchacha20poly1305.c23 k[0] = get_unaligned_le32(in); in chacha_load_key()
36 u32 k[CHACHA_KEY_WORDS]; in xchacha_init() local
42 chacha_load_key(k, key); in xchacha_init()
50 memzero_explicit(k, sizeof(k)); in xchacha_init()
95 u32 k[CHACHA_KEY_WORDS]; in chacha20poly1305_encrypt() local
98 chacha_load_key(k, key); in chacha20poly1305_encrypt()
108 memzero_explicit(k, sizeof(k)); in chacha20poly1305_encrypt()
176 u32 k[CHACHA_KEY_WORDS]; in chacha20poly1305_decrypt() local
180 chacha_load_key(k, key); in chacha20poly1305_decrypt()
191 memzero_explicit(k, sizeof(k)); in chacha20poly1305_decrypt()
[all …]
A Ddes.c628 d = k[4]; d &= 0x0e; d <<= 4; d |= k[0] & 0x1e; d = pc1[d]; in des_ekey()
629 c = k[5]; c &= 0x0e; c <<= 4; c |= k[1] & 0x1e; c = pc1[c]; in des_ekey()
630 b = k[6]; b &= 0x0e; b <<= 4; b |= k[2] & 0x1e; b = pc1[b]; in des_ekey()
631 a = k[7]; a &= 0x0e; a <<= 4; a |= k[3] & 0x1e; a = pc1[a]; in des_ekey()
656 d = k[0]; d &= 0xe0; d >>= 4; d |= k[4] & 0xf0; d = pc1[d + 1]; in des_ekey()
657 c = k[1]; c &= 0xe0; c >>= 4; c |= k[5] & 0xf0; c = pc1[c + 1]; in des_ekey()
658 b = k[2]; b &= 0xe0; b >>= 4; b |= k[6] & 0xf0; b = pc1[b + 1]; in des_ekey()
719 d = k[4]; d &= 0x0e; d <<= 4; d |= k[0] & 0x1e; d = pc1[d]; in dkey()
720 c = k[5]; c &= 0x0e; c <<= 4; c |= k[1] & 0x1e; c = pc1[c]; in dkey()
721 b = k[6]; b &= 0x0e; b <<= 4; b |= k[2] & 0x1e; b = pc1[b]; in dkey()
[all …]
A Dgf128mul.c246 int i, j, k; in gf128mul_init_64k_bbe() local
267 for (k = 1; k < j; ++k) in gf128mul_init_64k_bbe()
268 be128_xor(&t->t[i]->t[j + k], in gf128mul_init_64k_bbe()
269 &t->t[i]->t[j], &t->t[i]->t[k]); in gf128mul_init_64k_bbe()
327 int j, k; in gf128mul_init_4k_lle() local
338 for (k = 1; k < j; ++k) in gf128mul_init_4k_lle()
339 be128_xor(&t->t[j + k], &t->t[j], &t->t[k]); in gf128mul_init_4k_lle()
A Darc4.c16 int i, j = 0, k = 0; in arc4_setkey() local
27 j = (j + in_key[k] + a) & 0xff; in arc4_setkey()
30 if (++k >= key_len) in arc4_setkey()
31 k = 0; in arc4_setkey()
/lib/tests/
A Dtest_hash.c87 params->h2 = hash_64_generic(*params->h64, *k); in test_int_hash_64()
91 *params->h64, *k, params->h1, params->h2); in test_int_hash_64()
95 *params->h64, *k, params->h1, *m); in test_int_hash_64()
112 int k; in test_int_hash() local
122 for (k = 1; k <= 32; k++) { in test_int_hash()
123 u32 const m = ((u32)2 << (k-1)) - 1; /* Low k bits set */ in test_int_hash()
126 hash_or[0][k] |= params.h1 = hash_32(params.h0, k); in test_int_hash()
129 params.h0, k, params.h1, m); in test_int_hash()
132 hash_or[1][k] |= params.h1 = hash_64(h64, k); in test_int_hash()
135 h64, k, params.h1, m); in test_int_hash()
[all …]
A Dstring_kunit.c22 unsigned i, j, k; in string_test_memset16() local
32 for (k = 0; k < 512; k++) { in string_test_memset16()
33 v = p[k]; in string_test_memset16()
34 if (k < i) { in string_test_memset16()
51 unsigned i, j, k; in string_test_memset32() local
61 for (k = 0; k < 512; k++) { in string_test_memset32()
62 v = p[k]; in string_test_memset32()
63 if (k < i) { in string_test_memset32()
90 for (k = 0; k < 512; k++) { in string_test_memset64()
91 v = p[k]; in string_test_memset64()
[all …]
/lib/crypto/x86/
A Dsha256-avx2-asm.S160 addl \disp(%rsp, SRND), h # h = k + w + h # --
174 add h, d # d = k + w + h + d # --
190 add y1, h # h = k + w + h + S0 # --
192 add y2, d # d = k + w + h + d + S1 + CH = d + t1 # --
196 add y2, h # h = k + w + h + S0 + S1 + CH = t1 + S0# --
223 add h, d # d = k + w + h + d # --
274 add h, d # d = k + w + h + d # --
375 addl \disp(%rsp, SRND), h # h = k + w + h # --
414 addl offset(%rsp, SRND), h # h = k + w + h # --
454 addl offset(%rsp, SRND), h # h = k + w + h # --
[all …]
A Dsha512-avx2-asm.S184 add frame_XFER(%rsp),h # h = k + w + h # --
196 add h, d # d = k + w + h + d # --
209 add y1, h # h = k + w + h + S0 # --
211 add y2, d # d = k + w + h + d + S1 + CH = d + t1 # --
213 add y2, h # h = k + w + h + S0 + S1 + CH = t1 + S0# --
260 add h, d # d = k + w + h + d # --
274 add y1, h # h = k + w + h + S0 # --
276 add y2, d # d = k + w + h + d + S1 + CH = d + t1 # --
315 add h, d # d = k + w + h + d # --
373 add h, d # d = k + w + h + d # --
[all …]
A Dsha256-avx-asm.S178 add _XFER(%rsp), y2 # y2 = k + w + S1 + CH
180 add y2, h # h = h + S1 + CH + k + w
184 add h, d # d = d + h + S1 + CH + k + w
213 add (1*4 + _XFER)(%rsp), y2 # y2 = k + w + S1 + CH
217 add y2, h # h = h + S1 + CH + k + w
221 add h, d # d = d + h + S1 + CH + k + w
252 add (2*4 + _XFER)(%rsp), y2 # y2 = k + w + S1 + CH
255 add y2, h # h = h + S1 + CH + k + w
290 add (3*4 + _XFER)(%rsp), y2 # y2 = k + w + S1 + CH
293 add y2, h # h = h + S1 + CH + k + w
[all …]
A Dsha256-ssse3-asm.S174 add _XFER(%rsp) , y2 # y2 = k + w + S1 + CH
177 add y2, h # h = h + S1 + CH + k + w
213 add (1*4 + _XFER)(%rsp), y2 # y2 = k + w + S1 + CH
217 add y2, h # h = h + S1 + CH + k + w
255 add (2*4 + _XFER)(%rsp), y2 # y2 = k + w + S1 + CH
258 add y2, h # h = h + S1 + CH + k + w
296 add (3*4 + _XFER)(%rsp), y2 # y2 = k + w + S1 + CH
299 add y2, h # h = h + S1 + CH + k + w
335 add offset(%rsp), y2 # y2 = k + w + S1 + CH
337 add y2, h # h = h + S1 + CH + k + w
[all …]
/lib/reed_solomon/
A Ddecode_rs.c15 int i, j, r, k, pad; variable
200 for (i = 1, k = iprim - 1; i <= nn; i++, k = rs_modnn(rs, k + iprim)) {
211 if (k < pad) {
218 loc[count] = k;
295 k = (fcr + i) * prim * (nn-loc[j]-1);
296 tmp ^= alpha_to[rs_modnn(rs, index_of[b[j]] + k)];
/lib/kunit/
A Dexecutor.c170 int i, j, k; in kunit_filter_suites() local
219 for (k = 0; k < filter_count; k++) { in kunit_filter_suites()
221 parsed_filters[k], filter_action, err); in kunit_filter_suites()
224 if (k > 0 || filter_glob) { in kunit_filter_suites()
/lib/crypto/powerpc/
A Dsha1-spe-asm.S106 #define R_00_15(a, b, c, d, e, w0, w1, k, off) \ argument
109 LOAD_K##k##1 \
130 #define R_16_19(a, b, c, d, e, w0, w1, w4, w6, w7, k) \ argument
144 LOAD_K##k##1 \
156 #define R_20_39(a, b, c, d, e, w0, w1, w4, w6, w7, k) \ argument
169 LOAD_K##k##1 \
180 #define R_40_59(a, b, c, d, e, w0, w1, w4, w6, w7, k) \ argument
194 LOAD_K##k##1 \
208 #define R_60_79(a, b, c, d, e, w0, w1, w4, w6, w7, k) \ argument
209 R_20_39(a, b, c, d, e, w0, w1, w4, w6, w7, k)

Completed in 53 milliseconds

12