Home
last modified time | relevance | path

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

/lib/
Dbitmap.c49 unsigned int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
50 for (k = 0; k < lim; ++k) in __bitmap_equal()
51 if (bitmap1[k] != bitmap2[k]) in __bitmap_equal()
55 if ((bitmap1[k] ^ bitmap2[k]) & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_equal()
67 unsigned int k, lim = bits / BITS_PER_LONG; in __bitmap_or_equal() local
70 for (k = 0; k < lim; ++k) { in __bitmap_or_equal()
71 if ((bitmap1[k] | bitmap2[k]) != bitmap3[k]) in __bitmap_or_equal()
78 tmp = (bitmap1[k] | bitmap2[k]) ^ bitmap3[k]; in __bitmap_or_equal()
84 unsigned int k, lim = BITS_TO_LONGS(bits); in __bitmap_complement() local
85 for (k = 0; k < lim; ++k) in __bitmap_complement()
[all …]
Dklist.c84 void klist_init(struct klist *k, void (*get)(struct klist_node *), in klist_init() argument
87 INIT_LIST_HEAD(&k->k_list); in klist_init()
88 spin_lock_init(&k->k_lock); in klist_init()
89 k->get = get; in klist_init()
90 k->put = put; in klist_init()
94 static void add_head(struct klist *k, struct klist_node *n) in add_head() argument
96 spin_lock(&k->k_lock); in add_head()
97 list_add(&n->n_node, &k->k_list); in add_head()
98 spin_unlock(&k->k_lock); in add_head()
101 static void add_tail(struct klist *k, struct klist_node *n) in add_tail() argument
[all …]
Dtest_string.c9 unsigned i, j, k; in memset16_selftest() local
20 for (k = 0; k < 512; k++) { in memset16_selftest()
21 v = p[k]; in memset16_selftest()
22 if (k < i) { in memset16_selftest()
25 } else if (k < i + j) { in memset16_selftest()
39 return (i << 24) | (j << 16) | k | 0x8000; in memset16_selftest()
45 unsigned i, j, k; in memset32_selftest() local
56 for (k = 0; k < 512; k++) { in memset32_selftest()
57 v = p[k]; in memset32_selftest()
58 if (k < i) { in memset32_selftest()
[all …]
Dtest_hash.c71 int k; in test_int_hash() local
88 for (k = 1; k <= 32; k++) { in test_int_hash()
89 u32 const m = ((u32)2 << (k-1)) - 1; /* Low k bits set */ in test_int_hash()
92 hash_or[0][k] |= h1 = hash_32(h0, k); in test_int_hash()
94 pr_err("hash_32(%#x, %d) = %#x > %#x", h0, k, h1, m); in test_int_hash()
98 h2 = hash_32_generic(h0, k); in test_int_hash()
102 " = %#x", h0, k, h1, h2); in test_int_hash()
108 h0, k, h1, m); in test_int_hash()
114 hash_or[1][k] |= h1 = hash_64(h64, k); in test_int_hash()
116 pr_err("hash_64(%#llx, %d) = %#x > %#x", h64, k, h1, m); in test_int_hash()
[all …]
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()
Dinflate.c234 #define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}}
235 #define DUMPBITS(n) {b>>=(n);k-=(n);}
343 register int k; /* number of bits in current code */ in huft_build() local
397 k = j; /* minimum code length */ in huft_build()
454 for (; k <= g; k++) in huft_build()
457 a = c[k]; in huft_build()
463 while (k > w + l) in huft_build()
471 if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ in huft_build()
475 xp = c + k; in huft_build()
518 r.b = (uch)(k - w); in huft_build()
[all …]
Doid_registry.c30 unsigned i, j, k, hash; in look_up_OID() local
46 k = OID__NR; in look_up_OID()
47 while (i < k) { in look_up_OID()
48 j = (i + k) / 2; in look_up_OID()
52 k = j; in look_up_OID()
63 k = j; in look_up_OID()
78 k = j; in look_up_OID()
Dbch.c395 int k, pp = -1; in compute_error_locator_polynomial() local
408 k = 2*i-pp; in compute_error_locator_polynomial()
415 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
419 tmp = pelp->deg+k; in compute_error_locator_polynomial()
447 int rem, c, r, p, k, param[BCH_MAX_M]; in solve_linear_system() local
449 k = 0; in solve_linear_system()
455 p = c-k; in solve_linear_system()
477 param[k++] = c; in solve_linear_system()
482 if (k > 0) { in solve_linear_system()
483 p = k; in solve_linear_system()
[all …]
Dkobject.c814 void kset_init(struct kset *k) in kset_init() argument
816 kobject_init_internal(&k->kobj); in kset_init()
817 INIT_LIST_HEAD(&k->list); in kset_init()
818 spin_lock_init(&k->list_lock); in kset_init()
856 int kset_register(struct kset *k) in kset_register() argument
860 if (!k) in kset_register()
863 kset_init(k); in kset_register()
864 err = kobject_add_internal(&k->kobj); in kset_register()
867 kobject_uevent(&k->kobj, KOBJ_ADD); in kset_register()
876 void kset_unregister(struct kset *k) in kset_unregister() argument
[all …]
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()
258 k = get_bits(bd, 2); in get_next_block()
259 if (k < 2) { in get_next_block()
265 t += (((k+1)&2)-1); in get_next_block()
489 k = j+byteCount[i]; in get_next_block()
491 j = k; in get_next_block()
Dtest_xarray.c572 unsigned long i, j, k; in check_multi_store() local
622 for (k = 0; k < max_order; k++) { in check_multi_store()
623 void *entry = xa_load(xa, (1UL << k) - 1); in check_multi_store()
624 if ((i < k) && (j < k)) in check_multi_store()
964 unsigned long i, j, k; in check_find_1() local
979 for (k = 0; k < 100; k++) { in check_find_1()
980 unsigned long index = k; in check_find_1()
983 if (k <= j) in check_find_1()
985 else if (k <= i) in check_find_1()
990 index = k; in check_find_1()
[all …]
Dtest_rhashtable.c273 unsigned int i, j, k; in test_rhltable() local
294 k = prandom_u32(); in test_rhltable()
297 rhl_test_objects[i].value.id = k; in test_rhltable()
314 .id = k, in test_rhltable()
DKconfig382 Constant value for Galois field order 'm'. If 'k' is the
384 that (k + m*t) <= 2**m - 1.
Dtest_bpf.c91 __u32 k = ~0; in bpf_fill_maxinsns1() local
98 for (i = 0; i < len; i++, k--) in bpf_fill_maxinsns1()
99 insn[i] = __BPF_STMT(BPF_RET | BPF_K, k); in bpf_fill_maxinsns1()
140 __u32 k = prandom_u32_state(&rnd); in bpf_fill_maxinsns3() local
142 insn[i] = __BPF_STMT(BPF_ALU | BPF_ADD | BPF_K, k); in bpf_fill_maxinsns3()
6564 if (fp[len].code != 0 || fp[len].k != 0) in filter_length()
DKconfig.debug474 This enables checks whether a k/v free operation frees an area
1662 This code (~1k) is freed after boot. By then, the firewire stack
/lib/raid6/
Dmktables.c55 int i, j, k; in main() local
70 for (k = 0; k < 8; k++) in main()
71 printf("0x%02x,%c", gfmul(i, j + k), in main()
72 (k == 7) ? '\n' : ' '); in main()
89 for (k = 0; k < 8; k++) in main()
90 printf("0x%02x,%c", gfmul(i, j + k), in main()
91 (k == 7) ? '\n' : ' '); in main()
95 for (k = 0; k < 8; k++) in main()
96 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
97 (k == 7) ? '\n' : ' '); in main()
[all …]
/lib/crypto/
Ddes.c623 static unsigned long des_ekey(u32 *pe, const u8 *k) in des_ekey() argument
629 d = k[4]; d &= 0x0e; d <<= 4; d |= k[0] & 0x1e; d = pc1[d]; in des_ekey()
630 c = k[5]; c &= 0x0e; c <<= 4; c |= k[1] & 0x1e; c = pc1[c]; in des_ekey()
631 b = k[6]; b &= 0x0e; b <<= 4; b |= k[2] & 0x1e; b = pc1[b]; in des_ekey()
632 a = k[7]; a &= 0x0e; a <<= 4; a |= k[3] & 0x1e; a = pc1[a]; in des_ekey()
657 d = k[0]; d &= 0xe0; d >>= 4; d |= k[4] & 0xf0; d = pc1[d + 1]; in des_ekey()
658 c = k[1]; c &= 0xe0; c >>= 4; c |= k[5] & 0xf0; c = pc1[c + 1]; in des_ekey()
659 b = k[2]; b &= 0xe0; b >>= 4; b |= k[6] & 0xf0; b = pc1[b + 1]; in des_ekey()
660 a = k[3]; a &= 0xe0; a >>= 4; a |= k[7] & 0xf0; a = pc1[a + 1]; in des_ekey()
714 static void dkey(u32 *pe, const u8 *k) in dkey() argument
[all …]
Darc4.c15 int i, j = 0, k = 0; in arc4_setkey() local
26 j = (j + in_key[k] + a) & 0xff; in arc4_setkey()
29 if (++k >= key_len) in arc4_setkey()
30 k = 0; in arc4_setkey()
/lib/reed_solomon/
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/zlib_deflate/
Ddeftree.c138 static void pqdownheap (deflate_state *s, ct_data *tree, int k);
374 int k /* node to move down */ in pqdownheap() argument
377 int v = s->heap[k]; in pqdownheap()
378 int j = k << 1; /* left son of k */ in pqdownheap()
389 s->heap[k] = s->heap[j]; k = j; in pqdownheap()
394 s->heap[k] = v; in pqdownheap()