Home
last modified time | relevance | path

Searched refs:i (Results 1 – 25 of 224) sorted by relevance

123456789

/lib/reed_solomon/
A Ddecode_rs.c47 for (i = 0; i < nroots; i++) {
61 for (i = 0; i < nroots; i++)
65 for (i = 0; i < nroots; i++) {
79 for (i = 0; i < nroots; i++) {
93 for (i = 0; i < nroots; i++) {
113 for (i = 1; i < no_eras; i++) {
125 for (i = 0; i < nroots + 1; i++)
137 for (i = 0; i < r; i++) {
153 for (i = 0; i < nroots; i++) {
289 for (i = 0; i < nroots; i++) {
[all …]
/lib/
A Dtest_vmalloc.c85 for (i = 0; i < test_loop_count; i++) { in random_size_align_alloc_test()
118 for (i = 0; i < BITS_PER_LONG; i++) { in align_shift_alloc_test()
181 for (i = 0; i < 15000; i++) in long_busy_list_alloc_test()
206 for (i = 0; i < 15000; i++) in long_busy_list_alloc_test()
233 for (i = 0; i < junk_length; i++) { in full_fit_alloc_test()
238 for (i = 0; i < junk_length; i++) in full_fit_alloc_test()
255 for (i = 0; i < junk_length; i++) in full_fit_alloc_test()
299 for (i = 0; i < 35000; i++) { in pcpu_alloc_test()
312 for (i = 0; i < 35000; i++) in pcpu_alloc_test()
387 for (i = 0; i < nr_allocated; i++) in vm_map_ram_test()
[all …]
A Diov_iter.c506 i->nr_segs -= bvec - i->bvec; in iov_iter_bvec_advance()
525 i->nr_segs -= iov - iter_iov(i); in iov_iter_iovec_advance()
665 return min(i->count, iter_iov(i)->iov_len - i->iov_offset); in iov_iter_single_seg_count()
667 return min(i->count, i->bvec->bv_len - i->iov_offset); in iov_iter_single_seg_count()
671 umin(folioq_folio_size(i->folioq, i->folioq_slot), i->count); in iov_iter_single_seg_count()
943 return i->iov_offset | i->count; in iov_iter_alignment()
945 return (i->xarray_start + i->iov_offset) | i->count; in iov_iter_alignment()
1090 pos = i->xarray_start + i->iov_offset; in iter_xarray_get_pages()
1199 if (i->iov_offset == i->bvec->bv_len) { in __iov_iter_get_pages_alloc()
1333 for (i = 0; i < nr_segs; i++) { in copy_compat_iovec_from_user()
[all …]
A Dtest_memcat_p.c35 for (i = 0, r = 1; i < INPUT_MAX - 1; i++) { in test_memcat_p_init()
37 if (!in0[i]) in test_memcat_p_init()
41 if (!in1[i]) { in test_memcat_p_init()
42 kfree(in0[i]); in test_memcat_p_init()
54 in0[i] = in1[i] = NULL; in test_memcat_p_init()
61 for (i = 0, p = out; *p && (i < INPUT_MAX * 2 - 1); p++, i++) { in test_memcat_p_init()
82 for (i = 0; i < INPUT_MAX - 1; i++) in test_memcat_p_init()
83 if (out[i] != in0[i] || out[i + INPUT_MAX - 1] != in1[i]) { in test_memcat_p_init()
94 i = INPUT_MAX; in test_memcat_p_init()
96 for (i--; i >= 0; i--) { in test_memcat_p_init()
[all …]
A Dbuild_OID_registry54 for (my $i = 0; $i <= $#names; $i++) {
84 for (my $i = 0; $i <= $#names; $i++) {
85 print C_FILE "\t[OID_", $names[$i], "] = ", $indices[$i], ",\n"
95 for (my $i = 0; $i <= $#names; $i++) {
122 for (my $i = 0; $i <= $#names; $i++) {
140 for (my $i = 0; $i <= $#names; $i++) {
162 for (my $i = $#octets_a; $i >= 0; $i--) {
163 return $octets_a[$i] <=> $octets_b[$i]
164 if ($octets_a[$i] != $octets_b[$i]);
182 for (my $i = 0; $i <= $#names; $i++) {
[all …]
A Ddecompress_bunzip2.c197 for (i = 0; i < 16; i++) { in get_next_block()
217 for (i = 0; i < groupCount; i++) in get_next_block()
219 for (i = 0; i < nSelectors; i++) { in get_next_block()
248 for (i = 0; i < symCount; i++) { in get_next_block()
275 for (i = 1; i < symCount; i++) { in get_next_block()
316 for (i = 0; i < symCount; i++) in get_next_block()
325 for (i = minLen; i < maxLen; i++) { in get_next_block()
353 for (i = 0; i < 256; i++) { in get_next_block()
489 for (i = 0; i < 256; i++) { in get_next_block()
495 for (i = 0; i < dbufCount; i++) { in get_next_block()
[all …]
A Dtest_rhashtable.c143 for (i = 0; i < entries; i++) { in test_rht_lookup()
223 for (i = 0; i < entries; i++) { in test_rhashtable()
246 for (i = 0; i < entries; i++) { in test_rhashtable()
297 for (i = 0; i < entries; i++) { in test_rhltable()
311 for (i = 0; i < entries; i++) { in test_rhltable()
359 for (i = 0; i < entries; i++) { in test_rhltable()
415 for (i = 0; i < entries; i++) { in test_rhltable()
537 for (i = 0; i < cnt; i++) { in test_insert_dup()
592 for (i = 0; i < entries; i++) { in thread_lookup_test()
707 for (i = 0; i < runs; i++) { in test_rht_init()
[all …]
A Dtest_ida.c35 for (i = 0; i < 10000; i++) in ida_check_alloc()
40 for (i = 0; i < 3; i++) { in ida_check_alloc()
47 for (i = 0; i < 5000; i++) in ida_check_alloc()
88 for (i = 0; i < IDA_BITMAP_BITS; i++) { in ida_check_leaf()
113 for (i = 0; i < j; i++) { in ida_check_max()
140 for (i = 0; i < IDA_BITMAP_BITS * 2; i++) in ida_check_conv()
142 for (i = IDA_BITMAP_BITS * 2; i > 0; i--) in ida_check_conv()
163 for (i = 0; i < 31; i++) in ida_check_bad_free()
169 for (i = 0; i < 31; i++) in ida_check_bad_free()
175 for (i = 0; i < 31; i++) in ida_check_bad_free()
[all …]
A Dbtree.c106 for (i = 0; i < n; i++) { in longcmp()
120 for (i = 0; i < n; i++) in longcpy()
129 for (i = 0; i < n; i++) in longset()
233 for (i = 0; i < geo->keylen; i++) in keyzero()
250 for (i = 0; i < geo->no_pairs; i++) in btree_lookup_node()
272 for (i = 0; i < geo->no_pairs; i++) in btree_lookup()
289 for (i = 0; i < geo->no_pairs; i++) in btree_update()
324 for (i = 0; i < geo->no_pairs; i++) in btree_get_prev()
478 for (i = 0; i < fill / 2; i++) { in btree_insert_level()
495 for (i = fill; i > pos; i--) { in btree_insert_level()
[all …]
A Dts_bm.c63 for (i = 0; i < patlen; i++) { in matchpat()
73 return i; in matchpat()
135 int i, j, g; in compute_prefix_tbl() local
137 for (i = 0; i < ASIZE; i++) in compute_prefix_tbl()
139 for (i = 0; i < bm->patlen - 1; i++) { in compute_prefix_tbl()
140 bm->bad_shift[bm->pattern[i]] = bm->patlen - 1 - i; in compute_prefix_tbl()
149 for (i = 1; i < bm->patlen; i++) in compute_prefix_tbl()
151 for (i = bm->patlen-1, g = 1; i > 0; g++, i--) { in compute_prefix_tbl()
165 int i; in bm_init() local
178 for (i = 0; i < len; i++) in bm_init()
[all …]
A Dtest_xarray.c151 for (i = 0; i < 1024; i++) { in check_xa_load()
162 for (i = 0; i < 1024; i++) { in check_xa_load()
219 for (i = base; i < next; i++) { in check_xa_mark_1()
377 for (i = 0; i < 1024; i++) { in check_insert()
551 for (i = 0; i < 200; i++) { in check_xas_erase()
716 for (i = 0; i < 20; i++) { in check_multi_store()
723 for (i = 1; i < 20; i++) { in check_multi_store()
1369 for (i = 2; i < 10; i++) in check_find()
1655 for (i = 0; i < 16; i++) in check_move()
1658 for (i = 2; i < 16; i++) in check_move()
[all …]
A Dtest_bitops.c59 unsigned int i, n; in test_fns() local
70 for (i = 0; i < 10000; i++) in test_fns()
71 tmp = fns(buf[i], n); in test_fns()
81 int i, bit_set; in test_bitops_startup() local
90 for (i = 0; i < ARRAY_SIZE(order_comb); i++) { in test_bitops_startup()
91 if (order_comb[i][1] != get_count_order(order_comb[i][0])) in test_bitops_startup()
93 order_comb[i][0]); in test_bitops_startup()
96 for (i = 0; i < ARRAY_SIZE(order_comb); i++) { in test_bitops_startup()
97 if (order_comb[i][1] != get_count_order_long(order_comb[i][0])) in test_bitops_startup()
99 order_comb[i][0]); in test_bitops_startup()
[all …]
A Dsg_split.c24 int i; in sg_calculate_split() local
30 for (i = 0; i < nb_splits; i++) { in sg_calculate_split()
79 int i, j; in sg_split_phys() local
83 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_phys()
103 int i, j; in sg_split_mapped() local
107 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_mapped()
165 for (i = 0; i < nb_splits; i++) { in sg_split()
185 for (i = 0; i < nb_splits; i++) { in sg_split()
186 out[i] = splitters[i].out_sg; in sg_split()
188 out_mapped_nents[i] = splitters[i].nents; in sg_split()
[all …]
A Dtest_min_heap.c69 int i, err; in test_heapify_all() local
78 for (i = 0; i < heap.nr; i++) in test_heapify_all()
104 for (i = 0; i < ARRAY_SIZE(data); i++) in test_heap_push()
137 for (i = 0; i < ARRAY_SIZE(data); i++) in test_heap_pop_push()
141 for (i = 0; i < ARRAY_SIZE(data); i++) in test_heap_pop_push()
147 for (i = 0; i < ARRAY_SIZE(data); i++) in test_heap_pop_push()
151 for (i = 0; i < ARRAY_SIZE(data); i++) { in test_heap_pop_push()
172 int i, err; in test_heap_del() local
176 for (i = 0; i < ARRAY_SIZE(values) / 2; i++) in test_heap_del()
183 for (i = 0; i < heap.nr; i++) in test_heap_del()
[all …]
/lib/tests/
A Dkunit_iov_iter.c82 for (i = 0; i < kvmax; i++, pr++) { in iov_kunit_load_kvec()
113 for (i = 0; i < bufsize; i++) in iov_kunit_copy_to_kvec()
137 for (i = 0; i < bufsize; i++) { in iov_kunit_copy_to_kvec()
163 for (i = 0; i < bufsize; i++) in iov_kunit_copy_from_kvec()
192 for (i = 0; i < bufsize; i++) { in iov_kunit_copy_from_kvec()
272 for (i = 0; i < bufsize; i++) in iov_kunit_copy_to_bvec()
300 for (i = 0; i < bufsize; i++) { in iov_kunit_copy_to_bvec()
326 for (i = 0; i < bufsize; i++) in iov_kunit_copy_from_bvec()
388 for (i = 0; i < npages; i++) { in iov_kunit_load_folioq()
432 for (i = 0; i < bufsize; i++) in iov_kunit_copy_to_folioq()
[all …]
A Dtest_sort.c20 int *a, i, r = 1; in test_sort() local
25 for (i = 0; i < TEST_LEN; i++) { in test_sort()
27 a[i] = r; in test_sort()
32 for (i = 0; i < TEST_LEN - 1; i++) in test_sort()
33 KUNIT_ASSERT_LE(test, a[i], a[i + 1]); in test_sort()
37 for (i = 0; i < TEST_LEN - 1; i++) { in test_sort()
39 a[i] = r; in test_sort()
44 for (i = 0; i < TEST_LEN - 2; i++) in test_sort()
45 KUNIT_ASSERT_LE(test, a[i], a[i + 1]); in test_sort()
A Dlist-test.c732 for (i = 0; i < 5; ++i) { in list_test_list_for_each_entry()
733 entries[i].data = i; in list_test_list_for_each_entry()
753 for (i = 0; i < 5; ++i) { in list_test_list_for_each_entry_reverse()
754 entries[i].data = i; in list_test_list_for_each_entry_reverse()
1083 for (i = 1; i < 5; ++i) { in hlist_test_for_each_entry()
1084 entries[i].data = i; in hlist_test_for_each_entry()
1106 for (i = 1; i < 5; ++i) { in hlist_test_for_each_entry_continue()
1107 entries[i].data = i; in hlist_test_for_each_entry_continue()
1137 for (i = 1; i < 5; ++i) { in hlist_test_for_each_entry_from()
1138 entries[i].data = i; in hlist_test_for_each_entry_from()
[all …]
A Dtest_hash.c48 size_t i; in fill_buf() local
50 for (i = 0; i < len; i++) { in fill_buf()
156 for (i = 0; i <= j; i++) { in test_string_or()
157 u32 h0 = full_name_hash(buf+i, buf+i, j-i); in test_string_or()
182 for (i = 0; i <= j; i++) { in test_hash_or()
183 u64 hashlen = hashlen_string(buf+i, buf+i); in test_hash_or()
184 u32 h0 = full_name_hash(buf+i, buf+i, j-i); in test_hash_or()
189 i, j, hashlen_len(hashlen), j-i); in test_hash_or()
212 for (i = 1; i <= 32; i++) { in test_hash_or()
217 i, hash_or[0][i], m); in test_hash_or()
[all …]
/lib/xz/
A Dxz_dec_bcj.c96 size_t i; in bcj_x86() local
108 for (i = 0; i < size; ++i) { in bcj_x86()
148 i += 4; in bcj_x86()
156 return i; in bcj_x86()
168 for (i = 0; i < size; i += 4) { in bcj_powerpc()
227 for (i = 0; i < size; i += 16) { in bcj_ia64()
277 for (i = 0; i < size; i += 4) { in bcj_arm()
305 for (i = 0; i <= size; i += 2) { in bcj_armthumb()
335 for (i = 0; i < size; i += 4) { in bcj_sparc()
360 for (i = 0; i < size; i += 4) { in bcj_arm64()
[all …]
/lib/crypto/mpi/
A Dmpih-div.c79 for (i = dividend_size - 2; i >= 0; i--) { in mpihelp_mod_1()
114 for ( ; i >= 0; i--) { in mpihelp_mod_1()
138 for (i = dividend_size - 2; i >= 0; i--) { in mpihelp_mod_1()
163 for (; i >= 0; i--) { in mpihelp_mod_1()
219 for (i = nsize - 2; i >= 0; i--) in mpihelp_divrem()
223 for (i = qextra_limbs - 1; i >= 0; i--) in mpihelp_divrem()
247 for (i = qextra_limbs + nsize - 2 - 1; i >= 0; i--) { in mpihelp_divrem()
428 for (i = dividend_size - 2; i >= 0; i--) { in mpihelp_divmod_1()
462 for ( ; i >= 0; i--) { in mpihelp_divmod_1()
486 for (i = dividend_size - 2; i >= 0; i--) { in mpihelp_divmod_1()
[all …]
/lib/math/
A Dtest_div64.c230 remainder == test_div64_results[i][j].remainder); in test_div64_verify()
238 #define test_div64_one(dividend, divisor, i, j) ({ \ argument
245 if (!test_div64_verify(quotient, remainder, i, j)) { \
249 test_div64_results[i][j].quotient, \
250 test_div64_results[i][j].remainder); \
264 int i, j; in test_div64() local
266 for (i = 0; i < SIZE_DIV64_DIVIDENDS; i++) { in test_div64()
267 dividend = test_div64_dividends[i]; in test_div64()
294 i, j)) in test_div64()
304 int i; in test_div64_init() local
[all …]
/lib/crypto/
A Dblake2s-selftest.c555 int i, l; in blake2s_digest_test() local
558 for (i = 2; i < sizeof(key); ++i) in blake2s_digest_test()
559 key[i] = key[i - 2] + key[i - 1]; in blake2s_digest_test()
561 for (i = 0; i < sizeof(buf); ++i) in blake2s_digest_test()
562 buf[i] = (u8)i; in blake2s_digest_test()
564 for (i = l = 0; i < ARRAY_SIZE(blake2s_testvecs); l = (l + 37) % ++i) { in blake2s_digest_test()
587 i + 1); in blake2s_digest_test()
599 int i, l; in blake2s_random_test() local
601 for (i = 0; i < 32; ++i) { in blake2s_random_test()
619 i + 1); in blake2s_random_test()
[all …]
/lib/crc/
A Dgen_crc32table.c20 unsigned i, j; in crc32init_le_generic() local
25 for (i = 128; i; i >>= 1) { in crc32init_le_generic()
27 for (j = 0; j < 256; j += 2 * i) in crc32init_le_generic()
28 tab[i + j] = crc ^ tab[j]; in crc32init_le_generic()
47 unsigned i, j; in crc32init_be() local
52 for (i = 1; i < 256; i <<= 1) { in crc32init_be()
54 for (j = 0; j < i; j++) in crc32init_be()
55 crc32table_be[i + j] = crc ^ crc32table_be[j]; in crc32init_be()
61 int i; in output_table() local
63 for (i = 0; i < 256; i += 4) { in output_table()
[all …]
/lib/raid6/
A Dmktables.c55 int i, j, k; in main() local
68 for (i = 0; i < 256; i++) { in main()
73 printf("0x%02x,%c", gfmul(i, j + k), in main()
87 for (i = 0; i < 256; i++) { in main()
112 for (i = 0; i < 256; i += 8) { in main()
115 exptbl[i + j] = v; in main()
130 for (i = 0; i < 256; i += 8) { in main()
135 if (exptbl[k] == (i + j)) { in main()
150 for (i = 0; i < 256; i += 8) { in main()
153 invtbl[i + j] = v = gfpow(i + j, 254); in main()
[all …]
/lib/raid6/test/
A Dtest.c30 int i, j; in makedata() local
32 for (i = start; i <= stop; i++) { in makedata()
34 data[i][j] = rand(); in makedata()
36 dataptrs[i] = data[i]; in makedata()
59 dataptrs[i] = recovi; in test_disks()
74 i, disk_type(i), in test_disks()
81 dataptrs[i] = data[i]; in test_disks()
91 int i, j, p1, p2; in main() local
118 for (i = 0; i < NDISKS-1; i++) in main()
120 err += test_disks(i, j); in main()
[all …]

Completed in 77 milliseconds

123456789