Home
last modified time | relevance | path

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

1234

/lib/reed_solomon/
Ddecode_rs.c21 int i, j, r, k, pad; variable
50 for (i = 0; i < nroots; i++)
51 syn[i] = (((uint16_t) data[0]) ^ invmsk) & msk;
54 for (i = 0; i < nroots; i++) {
55 if (syn[i] == 0) {
56 syn[i] = (((uint16_t) data[j]) ^
59 syn[i] = ((((uint16_t) data[j]) ^
61 alpha_to[rs_modnn(rs, index_of[syn[i]] +
62 (fcr + i) * prim)];
68 for (i = 0; i < nroots; i++) {
[all …]
/lib/
Dbuild_OID_registry53 for (my $i = 0; $i <= $#names; $i++) {
54 my $name = $names[$i];
55 my $oid = $oids[$i];
83 for (my $i = 0; $i <= $#names; $i++) {
84 print C_FILE "\t[OID_", $names[$i], "] = ", $indices[$i], ",\n"
94 for (my $i = 0; $i <= $#names; $i++) {
97 my @components = split(/[.]/, $oids[$i]);
121 for (my $i = 0; $i <= $#names; $i++) {
122 my @octets = @{$encoded_oids[$i]};
139 for (my $i = 0; $i <= $#names; $i++) {
[all …]
Ddecompress_bunzip2.c161 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
174 i = get_bits(bd, 24); in get_next_block()
177 if ((i == 0x177245) && (j == 0x385090)) in get_next_block()
179 if ((i != 0x314159) || (j != 0x265359)) in get_next_block()
196 for (i = 0; i < 16; i++) { in get_next_block()
197 if (t&(1 << (15-i))) { in get_next_block()
201 symToByte[symTotal++] = (16*i)+j; in get_next_block()
216 for (i = 0; i < groupCount; i++) in get_next_block()
217 mtfSymbol[i] = i; in get_next_block()
218 for (i = 0; i < nSelectors; i++) { in get_next_block()
[all …]
Dts_bm.c65 unsigned int i, text_len, consumed = state->offset; in bm_find() local
79 for (i = 0; i < bm->patlen; i++) in bm_find()
80 if ((icase ? toupper(text[shift-i]) in bm_find()
81 : text[shift-i]) in bm_find()
82 != bm->pattern[bm->patlen-1-i]) in bm_find()
89 next: bs = bm->bad_shift[text[shift-i]]; in bm_find()
92 shift = max_t(int, shift-i+bs, shift+bm->good_shift[i]); in bm_find()
100 static int subpattern(u8 *pattern, int i, int j, int g) in subpattern() argument
102 int x = i+g-1, y = j+g-1, ret = 0; in subpattern()
110 ret = pattern[i-1] != pattern[j-1]; in subpattern()
[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 …]
Diov_iter.c11 #define iterate_iovec(i, n, __v, __p, skip, STEP) { \ argument
14 __p = i->iov; \
39 #define iterate_kvec(i, n, __v, __p, skip, STEP) { \ argument
41 __p = i->kvec; \
62 #define iterate_bvec(i, n, __v, __bi, skip, STEP) { \ argument
67 for_each_bvec(__v, i->bvec, __bi, __start) { \
74 #define iterate_all_kinds(i, n, v, I, B, K) { \ argument
75 size_t skip = i->iov_offset; \
76 if (unlikely(i->type & ITER_BVEC)) { \
79 iterate_bvec(i, n, v, __bi, skip, (B)) \
[all …]
Dtest_rhashtable.c107 unsigned int i; in test_rht_lookup() local
109 for (i = 0; i < entries * 2; i++) { in test_rht_lookup()
111 bool expected = !(i % 2); in test_rht_lookup()
112 u32 key = i; in test_rht_lookup()
114 if (array[i / 2].value == TEST_INSERT_FAIL) in test_rht_lookup()
127 if (obj->value != i) { in test_rht_lookup()
129 obj->value, i); in test_rht_lookup()
186 unsigned int i, insert_retries = 0; in test_rhashtable() local
195 for (i = 0; i < entries; i++) { in test_rhashtable()
196 struct test_obj *obj = &array[i]; in test_rhashtable()
[all …]
Dgen_crc32table.c38 unsigned i, j; in crc32init_le_generic() local
43 for (i = LE_TABLE_SIZE >> 1; i; i >>= 1) { in crc32init_le_generic()
45 for (j = 0; j < LE_TABLE_SIZE; j += 2 * i) in crc32init_le_generic()
46 tab[0][i + j] = crc ^ tab[0][j]; in crc32init_le_generic()
48 for (i = 0; i < LE_TABLE_SIZE; i++) { in crc32init_le_generic()
49 crc = tab[0][i]; in crc32init_le_generic()
52 tab[j][i] = crc; in crc32init_le_generic()
72 unsigned i, j; in crc32init_be() local
77 for (i = 1; i < BE_TABLE_SIZE; i <<= 1) { in crc32init_be()
79 for (j = 0; j < i; j++) in crc32init_be()
[all …]
Dcrc32.c75 size_t i; local
101 for (i = 0; i < len; i++) {
119 for (i = 0; i < len; i++)
150 int i; local
153 for (i = 0; i < 8; i++)
216 int i; local
218 for (i = 0; i < 31; i++) {
243 int i; local
246 for (i = 0; i < 8 * (int)(len & 3); i++)
295 int i; local
[all …]
Dnet_utils.c8 int i; in mac_pton() local
15 for (i = 0; i < ETH_ALEN; i++) { in mac_pton()
16 if (!isxdigit(s[i * 3]) || !isxdigit(s[i * 3 + 1])) in mac_pton()
18 if (i != ETH_ALEN - 1 && s[i * 3 + 2] != ':') in mac_pton()
21 for (i = 0; i < ETH_ALEN; i++) { in mac_pton()
22 mac[i] = (hex_to_bin(s[i * 3]) << 4) | hex_to_bin(s[i * 3 + 1]); in mac_pton()
Dsg_split.c26 int i; in sg_calculate_split() local
32 for (i = 0; i < nb_splits; i++) { in sg_calculate_split()
33 splitters[i].in_sg0 = NULL; in sg_calculate_split()
34 splitters[i].nents = 0; in sg_calculate_split()
37 for_each_sg(in, sg, nents, i) { in sg_calculate_split()
81 int i, j; in sg_split_phys() local
85 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_phys()
107 int i, j; in sg_split_mapped() local
111 for (i = 0, split = splitters; i < nb_splits; i++, split++) { in sg_split_mapped()
156 int i, ret; in sg_split() local
[all …]
Dsbitmap.c25 unsigned int i; in sbitmap_init_node() local
57 for (i = 0; i < sb->map_nr; i++) { in sbitmap_init_node()
58 sb->map[i].depth = min(depth, bits_per_word); in sbitmap_init_node()
59 depth -= sb->map[i].depth; in sbitmap_init_node()
68 unsigned int i; in sbitmap_resize() local
73 for (i = 0; i < sb->map_nr; i++) { in sbitmap_resize()
74 sb->map[i].depth = min(depth, bits_per_word); in sbitmap_resize()
75 depth -= sb->map[i].depth; in sbitmap_resize()
114 unsigned int i, index; in sbitmap_get() local
119 for (i = 0; i < sb->map_nr; i++) { in sbitmap_get()
[all …]
Duuid.c85 unsigned int i; in uuid_is_valid() local
87 for (i = 0; i < UUID_STRING_LEN; i++) { in uuid_is_valid()
88 if (i == 8 || i == 13 || i == 18 || i == 23) { in uuid_is_valid()
89 if (uuid[i] != '-') in uuid_is_valid()
91 } else if (!isxdigit(uuid[i])) { in uuid_is_valid()
103 unsigned int i; in __uuid_to_bin() local
108 for (i = 0; i < 16; i++) { in __uuid_to_bin()
109 int hi = hex_to_bin(uuid[si[i] + 0]); in __uuid_to_bin()
110 int lo = hex_to_bin(uuid[si[i] + 1]); in __uuid_to_bin()
112 b[ei[i]] = (hi << 4) | lo; in __uuid_to_bin()
Dtest_hash.c50 size_t i; in fill_buf() local
52 for (i = 0; i < len; i++) { in fill_buf()
54 buf[i] = mod255(seed); in fill_buf()
149 int i, j; in test_hash_init() local
157 for (i = 0; i <= j; i++) { in test_hash_init()
158 u64 hashlen = hashlen_string(buf+i, buf+i); in test_hash_init()
159 u32 h0 = full_name_hash(buf+i, buf+i, j-i); in test_hash_init()
162 if (hashlen_len(hashlen) != j-i) { in test_hash_init()
165 i, j, hashlen_len(hashlen), j-i); in test_hash_init()
172 i, j, hashlen_hash(hashlen), h0); in test_hash_init()
[all …]
Dsort.c64 int i = (num/2 - 1) * size, n = num * size, c, r; in sort() local
76 for ( ; i >= 0; i -= size) { in sort()
77 for (r = i; r * 2 + size < n; r = c) { in sort()
89 for (i = n - size; i > 0; i -= size) { in sort()
90 swap_func(base, base + i, size); in sort()
91 for (r = 0; r * 2 + size < i; r = c) { in sort()
93 if (c < i - size && in sort()
116 int *a, i, r = 1;
123 for (i = 0; i < 1000; i++) {
125 a[i] = r;
[all …]
Dinterval_tree_test.c31 int i; in init() local
32 for (i = 0; i < NODES; i++) { in init()
36 nodes[i].start = a; in init()
37 nodes[i].last = b; in init()
39 nodes[i].start = b; in init()
40 nodes[i].last = a; in init()
43 for (i = 0; i < SEARCHES; i++) in init()
44 queries[i] = prandom_u32_state(&rnd); in init()
49 int i, j; in interval_tree_test_init() local
60 for (i = 0; i < PERF_LOOPS; i++) { in interval_tree_test_init()
[all …]
Dbch.c118 int i; in encode_bch_unaligned() local
125 for (i = 0; i < l; i++) in encode_bch_unaligned()
126 ecc[i] = ((ecc[i] << 8)|(ecc[i+1] >> 24))^(*p++); in encode_bch_unaligned()
139 unsigned int i, nwords = BCH_ECC_WORDS(bch)-1; in load_ecc8() local
141 for (i = 0; i < nwords; i++, src += 4) in load_ecc8()
142 dst[i] = (src[0] << 24)|(src[1] << 16)|(src[2] << 8)|src[3]; in load_ecc8()
155 unsigned int i, nwords = BCH_ECC_WORDS(bch)-1; in store_ecc8() local
157 for (i = 0; i < nwords; i++) { in store_ecc8()
158 *dst++ = (src[i] >> 24); in store_ecc8()
159 *dst++ = (src[i] >> 16) & 0xff; in store_ecc8()
[all …]
Dinflate.c340 register unsigned i; /* counter, current code */ in huft_build() local
374 p = b; i = n; in huft_build()
376 Tracecv(*p, (stderr, (n-i >= ' ' && n-i <= '~' ? "%c %d\n" : "0x%x %d\n"), in huft_build()
377 n-i, *p)); in huft_build()
380 } while (--i); in huft_build()
399 for (i = BMAX; i; i--) in huft_build()
400 if (c[i]) in huft_build()
402 g = i; /* maximum code length */ in huft_build()
403 if ((unsigned)l > i) in huft_build()
404 l = i; in huft_build()
[all …]
Dcrc8.c31 int i, j; in crc8_populate_msb() local
37 for (i = 1; i < CRC8_TABLE_SIZE; i *= 2) { in crc8_populate_msb()
39 for (j = 0; j < i; j++) in crc8_populate_msb()
40 table[i+j] = table[j] ^ t; in crc8_populate_msb()
53 int i, j; in crc8_populate_lsb() local
58 for (i = (CRC8_TABLE_SIZE >> 1); i; i >>= 1) { in crc8_populate_lsb()
60 for (j = 0; j < CRC8_TABLE_SIZE; j += 2*i) in crc8_populate_lsb()
61 table[i+j] = table[j] ^ t; in crc8_populate_lsb()
Ddevres.c241 int i; in pcim_iomap_release() local
243 for (i = 0; i < PCIM_IOMAP_MAX; i++) in pcim_iomap_release()
244 if (this->table[i]) in pcim_iomap_release()
245 pci_iounmap(dev, this->table[i]); in pcim_iomap_release()
311 int i; in pcim_iounmap() local
318 for (i = 0; i < PCIM_IOMAP_MAX; i++) in pcim_iounmap()
319 if (tbl[i] == addr) { in pcim_iounmap()
320 tbl[i] = NULL; in pcim_iounmap()
338 int i, rc; in pcim_iomap_regions() local
344 for (i = 0; i < DEVICE_COUNT_RESOURCE; i++) { in pcim_iomap_regions()
[all …]
Dtest_hexdump.c58 unsigned int i; in test_hexdump_prepare_test() local
80 for (i = 0; i < l / gs; i++) { in test_hexdump_prepare_test()
89 if (i) in test_hexdump_prepare_test()
192 unsigned int i = 0; in test_hexdump_overflow_set() local
196 int gs = 1 << i; in test_hexdump_overflow_set()
200 } while (i++ < 3); in test_hexdump_overflow_set()
205 unsigned int i; in test_hexdump_init() local
209 for (i = 0; i < 16; i++) in test_hexdump_init()
213 for (i = 0; i < 16; i++) in test_hexdump_init()
216 for (i = 0; i <= TEST_HEXDUMP_BUF_SIZE; i++) in test_hexdump_init()
[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/test/
Dtest.c34 int i, j; in makedata() local
36 for (i = start; i <= stop; i++) { in makedata()
38 data[i][j] = rand(); in makedata()
40 dataptrs[i] = data[i]; in makedata()
56 static int test_disks(int i, int j) in test_disks() argument
63 dataptrs[i] = recovi; in test_disks()
66 raid6_dual_recov(NDISKS, PAGE_SIZE, i, j, (void **)&dataptrs); in test_disks()
68 erra = memcmp(data[i], recovi, PAGE_SIZE); in test_disks()
71 if (i < NDISKS-2 && j == NDISKS-1) { in test_disks()
78 i, disk_type(i), in test_disks()
[all …]
/lib/raid6/
Dmktables.c58 int i, j, k; in main() local
69 for (i = 0; i < 256; i++) { in main()
74 printf("0x%02x,%c", gfmul(i, j + k), in main()
88 for (i = 0; i < 256; i++) { in main()
93 printf("0x%02x,%c", gfmul(i, j + k), in main()
99 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
113 for (i = 0; i < 256; i += 8) { in main()
116 exptbl[i + j] = v; in main()
131 for (i = 0; i < 256; i += 8) { in main()
134 invtbl[i + j] = v = gfpow(i + j, 254); in main()
[all …]
/lib/mpi/
Dmpih-div.c75 mpi_size_t i; in mpihelp_divrem() local
88 for (i = nsize - 2; i >= 0; i--) in mpihelp_divrem()
89 udiv_qrnnd(qp[i], n1, n1, np[i], d); in mpihelp_divrem()
92 for (i = qextra_limbs - 1; i >= 0; i--) in mpihelp_divrem()
93 udiv_qrnnd(qp[i], n1, n1, 0, d); in mpihelp_divrem()
101 mpi_size_t i; in mpihelp_divrem() local
116 for (i = qextra_limbs + nsize - 2 - 1; i >= 0; i--) { in mpihelp_divrem()
120 if (i >= qextra_limbs) in mpihelp_divrem()
135 qp[i] = q; in mpihelp_divrem()
156 qp[i] = q; in mpihelp_divrem()
[all …]

1234