Home
last modified time | relevance | path

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

1234567

/lib/reed_solomon/
Ddecode_rs.c15 int i, j, r, k, pad; variable
47 for (i = 0; i < nroots; i++) {
51 if (s[i] != nn)
61 for (i = 0; i < nroots; i++)
62 syn[i] = (((uint16_t) data[0]) ^ invmsk) & msk;
65 for (i = 0; i < nroots; i++) {
66 if (syn[i] == 0) {
67 syn[i] = (((uint16_t) data[j]) ^
70 syn[i] = ((((uint16_t) data[j]) ^
72 alpha_to[rs_modnn(rs, index_of[syn[i]] +
[all …]
/lib/
Dtest_vmalloc.c85 int i; in random_size_align_alloc_test() local
87 for (i = 0; i < test_loop_count; i++) { in random_size_align_alloc_test()
118 int i; in align_shift_alloc_test() local
120 for (i = 0; i < BITS_PER_LONG; i++) { in align_shift_alloc_test()
121 align = ((unsigned long) 1) << i; in align_shift_alloc_test()
137 int i; in fix_align_alloc_test() local
139 for (i = 0; i < test_loop_count; i++) { in fix_align_alloc_test()
156 int i; in random_size_alloc_test() local
158 for (i = 0; i < test_loop_count; i++) { in random_size_alloc_test()
159 get_random_bytes(&n, sizeof(i)); in random_size_alloc_test()
[all …]
Dcrc32test.c666 int i; in crc32c_test() local
677 for (i = 0; i < 100; i++) { in crc32c_test()
678 bytes += 2*test[i].length; in crc32c_test()
680 crc ^= __crc32c_le(test[i].crc, test_buf + in crc32c_test()
681 test[i].start, test[i].length); in crc32c_test()
688 for (i = 0; i < 100; i++) { in crc32c_test()
689 if (test[i].crc32c_le != __crc32c_le(test[i].crc, test_buf + in crc32c_test()
690 test[i].start, test[i].length)) in crc32c_test()
711 int i, j; in crc32c_combine_test() local
714 for (i = 0; i < 10; i++) { in crc32c_combine_test()
[all …]
Dtest_ida.c33 int i, id; in ida_check_alloc() local
35 for (i = 0; i < 10000; i++) in ida_check_alloc()
36 IDA_BUG_ON(ida, ida_alloc(ida, GFP_KERNEL) != i); in ida_check_alloc()
40 for (i = 0; i < 3; i++) { in ida_check_alloc()
43 if (i == 2) in ida_check_alloc()
47 for (i = 0; i < 5000; i++) in ida_check_alloc()
48 ida_free(ida, i); in ida_check_alloc()
86 unsigned long i; in ida_check_leaf() local
88 for (i = 0; i < IDA_BITMAP_BITS; i++) { in ida_check_leaf()
90 base + i); in ida_check_leaf()
[all …]
Dtest_memcat_p.c25 int err = -ENOMEM, i, r, total = 0; in test_memcat_p_init() local
35 for (i = 0, r = 1; i < INPUT_MAX - 1; i++) { in test_memcat_p_init()
36 in0[i] = kmalloc(sizeof(**in0), GFP_KERNEL); in test_memcat_p_init()
37 if (!in0[i]) in test_memcat_p_init()
40 in1[i] = kmalloc(sizeof(**in1), GFP_KERNEL); in test_memcat_p_init()
41 if (!in1[i]) { in test_memcat_p_init()
42 kfree(in0[i]); in test_memcat_p_init()
48 in0[i]->num = r; in test_memcat_p_init()
49 in1[i]->num = -r; in test_memcat_p_init()
50 in0[i]->magic = MAGIC; in test_memcat_p_init()
[all …]
Dbuild_OID_registry49 for (my $i = 0; $i <= $#names; $i++) {
50 my $name = $names[$i];
51 my $oid = $oids[$i];
79 for (my $i = 0; $i <= $#names; $i++) {
80 print C_FILE "\t[OID_", $names[$i], "] = ", $indices[$i], ",\n"
90 for (my $i = 0; $i <= $#names; $i++) {
93 my @components = split(/[.]/, $oids[$i]);
117 for (my $i = 0; $i <= $#names; $i++) {
118 my @octets = @{$encoded_oids[$i]};
135 for (my $i = 0; $i <= $#names; $i++) {
[all …]
Dtest_string.c9 unsigned i, j, k; in memset16_selftest() local
16 for (i = 0; i < 256; i++) { in memset16_selftest()
19 memset16(p + i, 0xb1b2, j); in memset16_selftest()
22 if (k < i) { in memset16_selftest()
25 } else if (k < i + j) { in memset16_selftest()
38 if (i < 256) in memset16_selftest()
39 return (i << 24) | (j << 16) | k | 0x8000; in memset16_selftest()
45 unsigned i, j, k; in memset32_selftest() local
52 for (i = 0; i < 256; i++) { in memset32_selftest()
55 memset32(p + i, 0xb1b2b3b4, j); in memset32_selftest()
[all …]
Ddecompress_bunzip2.c162 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
175 i = get_bits(bd, 24); in get_next_block()
178 if ((i == 0x177245) && (j == 0x385090)) in get_next_block()
180 if ((i != 0x314159) || (j != 0x265359)) in get_next_block()
197 for (i = 0; i < 16; i++) { in get_next_block()
198 if (t&(1 << (15-i))) { in get_next_block()
202 symToByte[symTotal++] = (16*i)+j; in get_next_block()
217 for (i = 0; i < groupCount; i++) in get_next_block()
218 mtfSymbol[i] = i; in get_next_block()
219 for (i = 0; i < nSelectors; i++) { in get_next_block()
[all …]
Diov_iter.c18 #define iterate_iovec(i, n, __v, __p, skip, STEP) { \ argument
21 __p = i->iov; \
46 #define iterate_kvec(i, n, __v, __p, skip, STEP) { \ argument
48 __p = i->kvec; \
69 #define iterate_bvec(i, n, __v, __bi, skip, STEP) { \ argument
74 for_each_bvec(__v, i->bvec, __bi, __start) { \
81 #define iterate_all_kinds(i, n, v, I, B, K) { \ argument
83 size_t skip = i->iov_offset; \
84 if (unlikely(i->type & ITER_BVEC)) { \
87 iterate_bvec(i, n, v, __bi, skip, (B)) \
[all …]
Dtest_rhashtable.c140 unsigned int i; in test_rht_lookup() local
142 for (i = 0; i < entries; i++) { in test_rht_lookup()
144 bool expected = !(i % 2); in test_rht_lookup()
146 .id = i, in test_rht_lookup()
149 if (array[i / 2].value.id == TEST_INSERT_FAIL) in test_rht_lookup()
162 if (obj->value.id != i) { in test_rht_lookup()
164 obj->value.id, i); in test_rht_lookup()
213 unsigned int i, insert_retries = 0; in test_rhashtable() local
222 for (i = 0; i < entries; i++) { in test_rhashtable()
223 struct test_obj *obj = &array[i]; in test_rhashtable()
[all …]
Dbtree.c105 size_t i; in longcmp() local
107 for (i = 0; i < n; i++) { in longcmp()
108 if (l1[i] < l2[i]) in longcmp()
110 if (l1[i] > l2[i]) in longcmp()
119 size_t i; in longcpy() local
121 for (i = 0; i < n; i++) in longcpy()
122 dest[i] = src[i]; in longcpy()
128 size_t i; in longset() local
130 for (i = 0; i < n; i++) in longset()
131 s[i] = c; in longset()
[all …]
Dts_bm.c61 unsigned int i, text_len, consumed = state->offset; in bm_find() local
77 for (i = 0; i < bm->patlen; i++) in bm_find()
78 if ((icase ? toupper(text[shift-i]) in bm_find()
79 : text[shift-i]) in bm_find()
80 != bm->pattern[bm->patlen-1-i]) in bm_find()
87 next: bs = bm->bad_shift[text[shift-i]]; in bm_find()
90 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]); in bm_find()
98 static int subpattern(u8 *pattern, int i, int j, int g) in subpattern() argument
100 int x = i+g-1, y = j+g-1, ret = 0; in subpattern()
108 ret = pattern[i-1] != pattern[j-1]; in subpattern()
[all …]
Dgen_crc32table.c40 unsigned i, j; in crc32init_le_generic() local
45 for (i = LE_TABLE_SIZE >> 1; i; i >>= 1) { in crc32init_le_generic()
47 for (j = 0; j < LE_TABLE_SIZE; j += 2 * i) in crc32init_le_generic()
48 tab[0][i + j] = crc ^ tab[0][j]; in crc32init_le_generic()
50 for (i = 0; i < LE_TABLE_SIZE; i++) { in crc32init_le_generic()
51 crc = tab[0][i]; in crc32init_le_generic()
54 tab[j][i] = crc; in crc32init_le_generic()
74 unsigned i, j; in crc32init_be() local
79 for (i = 1; i < BE_TABLE_SIZE; i <<= 1) { in crc32init_be()
81 for (j = 0; j < i; j++) in crc32init_be()
[all …]
Dcmdline.c89 int res, i = 1; in get_options() local
91 while (i < nints) { in get_options()
92 res = get_option((char **)&str, ints + i); in get_options()
97 range_nums = get_range((char **)&str, ints + i, nints - i); in get_options()
105 i += (range_nums - 1); in get_options()
107 i++; in get_options()
111 ints[0] = i - 1; in get_options()
203 unsigned int i, equals = 0; in next_arg() local
213 for (i = 0; args[i]; i++) { in next_arg()
214 if (isspace(args[i]) && !in_quote) in next_arg()
[all …]
Dsg_split.c24 int i; in sg_calculate_split() local
30 for (i = 0; i < nb_splits; i++) { in sg_calculate_split()
31 splitters[i].in_sg0 = NULL; in sg_calculate_split()
32 splitters[i].nents = 0; in sg_calculate_split()
35 for_each_sg(in, sg, nents, 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()
105 int i, j; in sg_split_mapped() local
109 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_mapped()
154 int i, ret; in sg_split() local
[all …]
Dnet_utils.c9 int i; in mac_pton() local
16 for (i = 0; i < ETH_ALEN; i++) { in mac_pton()
17 if (!isxdigit(s[i * 3]) || !isxdigit(s[i * 3 + 1])) in mac_pton()
19 if (i != ETH_ALEN - 1 && s[i * 3 + 2] != ':') in mac_pton()
22 for (i = 0; i < ETH_ALEN; i++) { in mac_pton()
23 mac[i] = (hex_to_bin(s[i * 3]) << 4) | hex_to_bin(s[i * 3 + 1]); in mac_pton()
Dtest_bitops.c55 int i, bit_set; in test_bitops_startup() local
64 for (i = 0; i < ARRAY_SIZE(order_comb); i++) { in test_bitops_startup()
65 if (order_comb[i][1] != get_count_order(order_comb[i][0])) in test_bitops_startup()
67 order_comb[i][0]); in test_bitops_startup()
70 for (i = 0; i < ARRAY_SIZE(order_comb); i++) { in test_bitops_startup()
71 if (order_comb[i][1] != get_count_order_long(order_comb[i][0])) in test_bitops_startup()
73 order_comb[i][0]); in test_bitops_startup()
77 for (i = 0; i < ARRAY_SIZE(order_comb_long); i++) { in test_bitops_startup()
78 if (order_comb_long[i][1] != in test_bitops_startup()
79 get_count_order_long(order_comb_long[i][0])) in test_bitops_startup()
[all …]
Dtest_xarray.c149 unsigned long i, j; in check_xa_load() local
151 for (i = 0; i < 1024; i++) { in check_xa_load()
154 if (j < i) in check_xa_load()
159 XA_BUG_ON(xa, xa_store_index(xa, i, GFP_KERNEL) != NULL); in check_xa_load()
162 for (i = 0; i < 1024; i++) { in check_xa_load()
165 if (j >= i) in check_xa_load()
170 xa_erase_index(xa, i); in check_xa_load()
210 unsigned long i; in check_xa_mark_1() local
219 for (i = base; i < next; i++) { in check_xa_mark_1()
220 XA_STATE(xas, xa, i); in check_xa_mark_1()
[all …]
/lib/livepatch/
Dtest_klp_shadow_vars.c174 int i; in test_klp_shadow_vars_init() local
187 for (i = 0; i < NUM_OBJS; i++) { in test_klp_shadow_vars_init()
188 pnfields1[i] = &nfields1[i]; in test_klp_shadow_vars_init()
189 ptr_id(pnfields1[i]); in test_klp_shadow_vars_init()
191 if (i % 2) { in test_klp_shadow_vars_init()
192 sv1[i] = shadow_alloc(&objs[i], SV_ID1, in test_klp_shadow_vars_init()
193 sizeof(pnfields1[i]), GFP_KERNEL, in test_klp_shadow_vars_init()
194 shadow_ctor, &pnfields1[i]); in test_klp_shadow_vars_init()
196 sv1[i] = shadow_get_or_alloc(&objs[i], SV_ID1, in test_klp_shadow_vars_init()
197 sizeof(pnfields1[i]), GFP_KERNEL, in test_klp_shadow_vars_init()
[all …]
/lib/mpi/
Dmpih-div.c32 mpi_size_t i; in mpihelp_mod_1() local
79 for (i = dividend_size - 2; i >= 0; i--) { in mpihelp_mod_1()
80 n0 = dividend_ptr[i]; in mpihelp_mod_1()
106 i = dividend_size - 1; in mpihelp_mod_1()
107 r = dividend_ptr[i]; in mpihelp_mod_1()
112 i--; in mpihelp_mod_1()
114 for ( ; i >= 0; i--) { in mpihelp_mod_1()
115 n0 = dividend_ptr[i]; in mpihelp_mod_1()
138 for (i = dividend_size - 2; i >= 0; i--) { in mpihelp_mod_1()
139 n0 = dividend_ptr[i]; in mpihelp_mod_1()
[all …]
Dmpi-bit.c82 unsigned int i, limbno, bitno; in mpi_set_bit() local
88 for (i = a->nlimbs; i < a->alloced; i++) in mpi_set_bit()
89 a->d[i] = 0; in mpi_set_bit()
101 unsigned int i, limbno, bitno; in mpi_set_highbit() local
107 for (i = a->nlimbs; i < a->alloced; i++) in mpi_set_highbit()
108 a->d[i] = 0; in mpi_set_highbit()
162 unsigned int i; in mpi_rshift_limbs() local
169 for (i = 0; i < n - count; i++) in mpi_rshift_limbs()
170 ap[i] = ap[i+count]; in mpi_rshift_limbs()
171 ap[i] = 0; in mpi_rshift_limbs()
[all …]
/lib/crypto/
Dblake2s-selftest.c553 int i, l; in blake2s_selftest() local
556 for (i = 2; i < sizeof(key); ++i) in blake2s_selftest()
557 key[i] = key[i - 2] + key[i - 1]; in blake2s_selftest()
559 for (i = 0; i < sizeof(buf); ++i) in blake2s_selftest()
560 buf[i] = (u8)i; in blake2s_selftest()
562 for (i = l = 0; i < ARRAY_SIZE(blake2s_testvecs); l = (l + 37) % ++i) { in blake2s_selftest()
563 int outlen = 1 + i % BLAKE2S_HASH_SIZE; in blake2s_selftest()
564 int keylen = (13 * i) % (BLAKE2S_KEY_SIZE + 1); in blake2s_selftest()
566 blake2s(hash, buf, key + BLAKE2S_KEY_SIZE - keylen, outlen, i, in blake2s_selftest()
568 if (memcmp(hash, blake2s_testvecs[i], outlen)) { in blake2s_selftest()
[all …]
/lib/xz/
Dxz_dec_bcj.c95 size_t i; in bcj_x86() local
107 for (i = 0; i < size; ++i) { in bcj_x86()
108 if ((buf[i] & 0xFE) != 0xE8) in bcj_x86()
111 prev_pos = i - prev_pos; in bcj_x86()
117 b = buf[i + 4 - mask_to_bit_num[prev_mask]]; in bcj_x86()
120 prev_pos = i; in bcj_x86()
127 prev_pos = i; in bcj_x86()
129 if (bcj_x86_test_msbyte(buf[i + 4])) { in bcj_x86()
130 src = get_unaligned_le32(buf + i + 1); in bcj_x86()
132 dest = src - (s->pos + (uint32_t)i + 5); in bcj_x86()
[all …]
/lib/raid6/
Dmktables.c55 int i, j, k; in main() local
66 for (i = 0; i < 256; i++) { in main()
71 printf("0x%02x,%c", gfmul(i, j + k), in main()
85 for (i = 0; i < 256; i++) { in main()
90 printf("0x%02x,%c", gfmul(i, j + k), in main()
96 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
110 for (i = 0; i < 256; i += 8) { in main()
113 exptbl[i + j] = v; in main()
128 for (i = 0; i < 256; i += 8) { in main()
133 if (exptbl[k] == (i + j)) { in main()
[all …]
/lib/raid6/test/
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()
52 static int test_disks(int i, int j) in test_disks() argument
59 dataptrs[i] = recovi; in test_disks()
62 raid6_dual_recov(NDISKS, PAGE_SIZE, i, j, (void **)&dataptrs); in test_disks()
64 erra = memcmp(data[i], recovi, PAGE_SIZE); in test_disks()
67 if (i < NDISKS-2 && j == NDISKS-1) { in test_disks()
74 i, disk_type(i), in test_disks()
[all …]

1234567