| /lib/ |
| D | klist.c | 85 void klist_init(struct klist *k, void (*get)(struct klist_node *), in klist_init()
95 static void add_head(struct klist *k, struct klist_node *n) in add_head()
102 static void add_tail(struct klist *k, struct klist_node *n) in add_tail()
109 static void klist_node_init(struct klist *k, struct klist_node *n) in klist_node_init()
123 void klist_add_head(struct klist_node *n, struct klist *k) in klist_add_head()
135 void klist_add_tail(struct klist_node *n, struct klist *k) in klist_add_tail()
149 struct klist *k = knode_klist(pos); in klist_add_after() local
165 struct klist *k = knode_klist(pos); in klist_add_before() local
212 struct klist *k = knode_klist(n); in klist_put() local
281 void klist_iter_init_node(struct klist *k, struct klist_iter *i, in klist_iter_init_node()
[all …]
|
| D | reciprocal_div.c | 5 u32 reciprocal_value(u32 k) in reciprocal_value()
|
| D | bitmap.c | 45 int k, lim = bits/BITS_PER_LONG; in __bitmap_empty() local
60 int k, lim = bits/BITS_PER_LONG; in __bitmap_full() local
76 int k, lim = bits/BITS_PER_LONG; in __bitmap_equal() local
91 int k, lim = bits/BITS_PER_LONG; in __bitmap_complement() local
114 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; in __bitmap_shift_right() local
159 int k, lim = BITS_TO_LONGS(bits), left = bits % BITS_PER_LONG; in __bitmap_shift_left() local
187 int k; in __bitmap_and() local
200 int k; in __bitmap_or() local
211 int k; in __bitmap_xor() local
222 int k; in __bitmap_andnot() local
[all …]
|
| D | inflate.c | 342 register int k; /* number of bits in current code */ in huft_build() local
603 register unsigned k; /* number of bits in bit buffer */ in inflate_codes() local
709 register unsigned k; /* number of bits in bit buffer */ in inflate_stored() local
845 register unsigned k; /* number of bits in bit buffer */ in inflate_dynamic() local
1040 register unsigned k; /* number of bits in bit buffer */ in inflate_block() local
1153 int k; /* byte being shifted into crc apparatus */ in makecrc() local
|
| D | bch.c | 385 int k, pp = -1; in compute_error_locator_polynomial() local
437 int rem, c, r, p, k, param[m]; in solve_linear_system() local
512 int i, j, k; in find_affine4_roots() local
795 static void compute_trace_bk_mod(struct bch_control *bch, int k, in compute_trace_bk_mod()
838 static void factor_polynomial(struct bch_control *bch, int k, struct gf_poly *f, in factor_polynomial()
874 static int find_poly_roots(struct bch_control *bch, unsigned int k, in find_poly_roots()
919 const unsigned int k = 8*len+bch->ecc_bits; in chien_search() local
1054 const unsigned int k = 1 << deg(poly); in build_gf_tables() local
|
| D | kobject.c | 676 void kset_init(struct kset *k) in kset_init()
717 int kset_register(struct kset *k) in kset_register()
736 void kset_unregister(struct kset *k) in kset_unregister()
754 struct kobject *k; in kset_find_obj() local
|
| D | oid_registry.c | 34 unsigned i, j, k, hash; in look_up_OID() local
|
| D | ts_kmp.c | 81 unsigned int k, q; in compute_prefix_tbl() local
|
| D | decompress_bunzip2.c | 161 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
|
| /lib/raid6/ |
| D | mktables.c | 58 int i, j, k; in main() local
|
| /lib/reed_solomon/ |
| D | decode_rs.c | 21 int i, j, r, k, pad; variable
|
| /lib/zlib_deflate/ |
| D | deftree.c | 374 int k /* node to move down */ in pqdownheap()
|