| /lib/ |
| D | find_bit_benchmark.c | 38 unsigned long i, cnt; in test_find_first_bit() local
42 for (cnt = i = 0; i < len; cnt++) { in test_find_first_bit()
47 pr_err("find_first_bit: %18llu ns, %6ld iterations\n", time, cnt); in test_find_first_bit()
55 unsigned long i, cnt; in test_find_first_and_bit() local
61 for (cnt = i = 0; i < len; cnt++) { in test_find_first_and_bit()
66 pr_err("find_first_and_bit: %18llu ns, %6ld iterations\n", time, cnt); in test_find_first_and_bit()
73 unsigned long i, cnt; in test_find_next_bit() local
77 for (cnt = i = 0; i < BITMAP_LEN; cnt++) in test_find_next_bit()
80 pr_err("find_next_bit: %18llu ns, %6ld iterations\n", time, cnt); in test_find_next_bit()
87 unsigned long i, cnt; in test_find_next_zero_bit() local
[all …]
|
| D | seq_buf.c | 311 int seq_buf_to_user(struct seq_buf *s, char __user *ubuf, int cnt) argument
316 if (!cnt)
325 if (cnt > len)
326 cnt = len;
327 ret = copy_to_user(ubuf, s->buffer + s->readpos, cnt);
328 if (ret == cnt)
331 cnt -= ret;
333 s->readpos += cnt;
334 return cnt;
|
| D | debugobjects.c | 165 int cnt; in fill_pool() local
167 for (cnt = 0; cnt < ODEBUG_BATCH_SIZE; cnt++) { in fill_pool()
168 new[cnt] = kmem_cache_zalloc(obj_cache, gfp); in fill_pool()
169 if (!new[cnt]) in fill_pool()
172 if (!cnt) in fill_pool()
176 while (cnt) { in fill_pool()
177 hlist_add_head(&new[--cnt]->node, &obj_pool); in fill_pool()
191 int cnt = 0; in lookup_object() local
194 cnt++; in lookup_object()
198 if (cnt > debug_objects_maxchain) in lookup_object()
[all …]
|
| D | test_rhashtable.c | 477 unsigned int i, cnt = 0; in print_ht() local
504 cnt++; in print_ht()
517 return cnt; in print_ht()
521 int cnt, bool slow) in test_insert_dup() argument
538 for (i = 0; i < cnt; i++) { in test_insert_dup()
552 if (WARN(err, "error %d on element %d/%d (%s)\n", err, i, cnt, slow? "slow" : "fast")) in test_insert_dup()
557 WARN(ret != cnt, "missing rhltable elements (%d != %d, %s)\n", ret, cnt, slow? "slow" : "fast"); in test_insert_dup()
|
| D | bch.c | 944 int cnt; in find_poly_roots() local
950 cnt = find_poly_deg1_roots(bch, poly, roots); in find_poly_roots()
953 cnt = find_poly_deg2_roots(bch, poly, roots); in find_poly_roots()
956 cnt = find_poly_deg3_roots(bch, poly, roots); in find_poly_roots()
959 cnt = find_poly_deg4_roots(bch, poly, roots); in find_poly_roots()
963 cnt = 0; in find_poly_roots()
967 cnt += find_poly_roots(bch, k+1, f1, roots); in find_poly_roots()
969 cnt += find_poly_roots(bch, k+1, f2, roots+cnt); in find_poly_roots()
973 return cnt; in find_poly_roots()
|
| D | test_bitmap.c | 226 unsigned long b, bit, cnt = 0; in test_find_nth_bit() local
260 b = find_nth_bit(exp1, EXP1_IN_BITS, cnt++); in test_find_nth_bit()
|
| /lib/mpi/ |
| D | generic_mpih-lshift.c | 28 mpihelp_lshift(mpi_ptr_t wp, mpi_ptr_t up, mpi_size_t usize, unsigned int cnt) in mpihelp_lshift() argument
35 sh_1 = cnt; in mpihelp_lshift()
|
| D | generic_mpih-rshift.c | 29 mpihelp_rshift(mpi_ptr_t wp, mpi_ptr_t up, mpi_size_t usize, unsigned cnt) in mpihelp_rshift() argument
36 sh_1 = cnt; in mpihelp_rshift()
|
| D | mpi-internal.h | 208 unsigned cnt);
210 unsigned cnt);
|