| /lib/ |
| D | bitmap.c | 45 int k, lim = bits/BITS_PER_LONG; in __bitmap_empty() local
46 for (k = 0; k < lim; ++k) in __bitmap_empty()
47 if (bitmap[k]) in __bitmap_empty()
51 if (bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_empty()
60 int k, lim = bits/BITS_PER_LONG; in __bitmap_full() local
61 for (k = 0; k < lim; ++k) in __bitmap_full()
62 if (~bitmap[k]) in __bitmap_full()
66 if (~bitmap[k] & BITMAP_LAST_WORD_MASK(bits)) in __bitmap_full()
76 int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
77 for (k = 0; k < lim; ++k) in __bitmap_equal()
[all …]
|
| D | klist.c | 85 void klist_init(struct klist *k, void (*get)(struct klist_node *), in klist_init() argument
88 INIT_LIST_HEAD(&k->k_list); in klist_init()
89 spin_lock_init(&k->k_lock); in klist_init()
90 k->get = get; in klist_init()
91 k->put = put; in klist_init()
95 static void add_head(struct klist *k, struct klist_node *n) in add_head() argument
97 spin_lock(&k->k_lock); in add_head()
98 list_add(&n->n_node, &k->k_list); in add_head()
99 spin_unlock(&k->k_lock); in add_head()
102 static void add_tail(struct klist *k, struct klist_node *n) in add_tail() argument
[all …]
|
| D | ts_kmp.c | 81 unsigned int k, q; in compute_prefix_tbl() local
84 for (k = 0, q = 1; q < len; q++) { in compute_prefix_tbl()
85 while (k > 0 && (icase ? toupper(pattern[k]) : pattern[k]) in compute_prefix_tbl()
87 k = prefix_tbl[k-1]; in compute_prefix_tbl()
88 if ((icase ? toupper(pattern[k]) : pattern[k]) in compute_prefix_tbl()
90 k++; in compute_prefix_tbl()
91 prefix_tbl[q] = k; in compute_prefix_tbl()
|
| D | inflate.c | 233 #define NEEDBITS(n) {while(k<(n)){b|=((ulg)NEXTBYTE())<<k;k+=8;}}
234 #define DUMPBITS(n) {b>>=(n);k-=(n);}
342 register int k; /* number of bits in current code */ in huft_build() local
396 k = j; /* minimum code length */ in huft_build()
453 for (; k <= g; k++) in huft_build()
456 a = c[k]; in huft_build()
462 while (k > w + l) in huft_build()
470 if ((f = 1 << (j = k - w)) > a + 1) /* try a k-w bit table */ in huft_build()
474 xp = c + k; in huft_build()
517 r.b = (uch)(k - w); in huft_build()
[all …]
|
| D | oid_registry.c | 34 unsigned i, j, k, hash; in look_up_OID() local
50 k = OID__NR; in look_up_OID()
51 while (i < k) { in look_up_OID()
52 j = (i + k) / 2; in look_up_OID()
56 k = j; in look_up_OID()
67 k = j; in look_up_OID()
82 k = j; in look_up_OID()
|
| D | reciprocal_div.c | 5 u32 reciprocal_value(u32 k) in reciprocal_value() argument
7 u64 val = (1LL << 32) + (k - 1); in reciprocal_value()
8 do_div(val, k); in reciprocal_value()
|
| D | bch.c | 385 int k, pp = -1; in compute_error_locator_polynomial() local
398 k = 2*i-pp; in compute_error_locator_polynomial()
405 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
409 tmp = pelp->deg+k; in compute_error_locator_polynomial()
437 int rem, c, r, p, k, param[m]; in solve_linear_system() local
439 k = 0; in solve_linear_system()
445 p = c-k; in solve_linear_system()
467 param[k++] = c; in solve_linear_system()
472 if (k > 0) { in solve_linear_system()
473 p = k; in solve_linear_system()
[all …]
|
| D | kobject.c | 676 void kset_init(struct kset *k) in kset_init() argument
678 kobject_init_internal(&k->kobj); in kset_init()
679 INIT_LIST_HEAD(&k->list); in kset_init()
680 spin_lock_init(&k->list_lock); in kset_init()
717 int kset_register(struct kset *k) in kset_register() argument
721 if (!k) in kset_register()
724 kset_init(k); in kset_register()
725 err = kobject_add_internal(&k->kobj); in kset_register()
728 kobject_uevent(&k->kobj, KOBJ_ADD); in kset_register()
736 void kset_unregister(struct kset *k) in kset_unregister() argument
[all …]
|
| D | decompress_bunzip2.c | 161 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
198 k = get_bits(bd, 16); in get_next_block()
200 if (k&(1 << (15-j))) in get_next_block()
257 k = get_bits(bd, 2); in get_next_block()
258 if (k < 2) { in get_next_block()
264 t += (((k+1)&2)-1); in get_next_block()
488 k = j+byteCount[i]; in get_next_block()
490 j = k; in get_next_block()
|
| D | Kconfig | 275 Constant value for Galois field order 'm'. If 'k' is the
277 that (k + m*t) <= 2**m - 1.
|
| D | Kconfig.debug | 383 This enables checks whether a k/v free operation frees an area
1366 This code (~1k) is freed after boot. By then, the firewire stack
|
| /lib/raid6/ |
| D | mktables.c | 58 int i, j, k; in main() local
73 for (k = 0; k < 8; k++) in main()
74 printf("0x%02x,%c", gfmul(i, j + k), in main()
75 (k == 7) ? '\n' : ' '); in main()
92 for (k = 0; k < 8; k++) in main()
93 printf("0x%02x,%c", gfmul(i, j + k), in main()
94 (k == 7) ? '\n' : ' '); in main()
98 for (k = 0; k < 8; k++) in main()
99 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
100 (k == 7) ? '\n' : ' '); in main()
|
| /lib/reed_solomon/ |
| D | decode_rs.c | 21 int i, j, r, k, pad; variable
181 for (i = 1, k = iprim - 1; i <= nn; i++, k = rs_modnn(rs, k + iprim)) {
193 loc[count] = k;
|
| /lib/zlib_deflate/ |
| D | deftree.c | 137 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()
|