| /lib/raid6/ |
| D | mktables.c | 55 int i, j, k; in main() local
68 for (j = 0; j < 256; j += 8) { in main()
71 printf("0x%02x,%c", gfmul(i, j + k), in main()
87 for (j = 0; j < 16; j += 8) { in main()
90 printf("0x%02x,%c", gfmul(i, j + k), in main()
93 for (j = 0; j < 16; j += 8) { in main()
96 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
112 for (j = 0; j < 8; j++) { in main()
113 exptbl[i + j] = v; in main()
114 printf("0x%02x,%c", v, (j == 7) ? '\n' : ' '); in main()
[all …]
|
| /lib/ |
| D | gen_crc32table.c | 40 unsigned i, j; in crc32init_le_generic() local
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()
52 for (j = 1; j < LE_TABLE_ROWS; j++) { in crc32init_le_generic()
54 tab[j][i] = crc; in crc32init_le_generic()
74 unsigned i, j; in crc32init_be() local
81 for (j = 0; j < i; j++) in crc32init_be()
82 crc32table_be[0][i + j] = crc ^ crc32table_be[0][j]; in crc32init_be()
86 for (j = 1; j < BE_TABLE_ROWS; j++) { in crc32init_be()
88 crc32table_be[j][i] = crc; in crc32init_be()
[all …]
|
| D | test_string.c | 9 unsigned i, j, k; in memset16_selftest() local
17 for (j = 0; j < 256; j++) { in memset16_selftest()
19 memset16(p + i, 0xb1b2, j); in memset16_selftest()
25 } else if (k < i + j) { in memset16_selftest()
39 return (i << 24) | (j << 16) | k | 0x8000; in memset16_selftest()
45 unsigned i, j, k; in memset32_selftest() local
53 for (j = 0; j < 256; j++) { in memset32_selftest()
55 memset32(p + i, 0xb1b2b3b4, j); in memset32_selftest()
61 } else if (k < i + j) { in memset32_selftest()
75 return (i << 24) | (j << 16) | k | 0x8000; in memset32_selftest()
[all …]
|
| D | hexdump.c | 111 int j, lx = 0; in hex_dump_to_buffer() local
137 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
139 "%s%16.16llx", j ? " " : "", in hex_dump_to_buffer()
140 get_unaligned(ptr8 + j)); in hex_dump_to_buffer()
148 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
150 "%s%8.8x", j ? " " : "", in hex_dump_to_buffer()
151 get_unaligned(ptr4 + j)); in hex_dump_to_buffer()
159 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
161 "%s%4.4x", j ? " " : "", in hex_dump_to_buffer()
162 get_unaligned(ptr2 + j)); in hex_dump_to_buffer()
[all …]
|
| D | rbtree_test.c | 244 int i, j; in rbtree_test_init() local
260 for (j = 0; j < nnodes; j++) in rbtree_test_init()
261 insert(nodes + j, &root); in rbtree_test_init()
262 for (j = 0; j < nnodes; j++) in rbtree_test_init()
263 erase(nodes + j, &root); in rbtree_test_init()
276 for (j = 0; j < nnodes; j++) in rbtree_test_init()
277 insert_cached(nodes + j, &root); in rbtree_test_init()
278 for (j = 0; j < nnodes; j++) in rbtree_test_init()
279 erase_cached(nodes + j, &root); in rbtree_test_init()
335 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
[all …]
|
| D | ucs2_string.c | 58 unsigned long j = 0; in ucs2_utf8size() local
64 j += 3; in ucs2_utf8size()
66 j += 2; in ucs2_utf8size()
68 j += 1; in ucs2_utf8size()
71 return j; in ucs2_utf8size()
86 unsigned long j = 0; in ucs2_as_utf8() local
96 dest[j++] = 0xe0 | (c & 0xf000) >> 12; in ucs2_as_utf8()
97 dest[j++] = 0x80 | (c & 0x0fc0) >> 6; in ucs2_as_utf8()
98 dest[j++] = 0x80 | (c & 0x003f); in ucs2_as_utf8()
103 dest[j++] = 0xc0 | (c & 0x7c0) >> 6; in ucs2_as_utf8()
[all …]
|
| D | crc8.c | 31 int i, j; in crc8_populate_msb() local
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
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()
|
| D | interval_tree_test.c | 64 int i, j; in interval_tree_test_init() local
87 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
88 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
89 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
90 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
101 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
102 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
108 for (j = 0; j < nsearches; j++) { in interval_tree_test_init()
109 unsigned long start = search_all ? 0 : queries[j]; in interval_tree_test_init()
110 unsigned long last = search_all ? max_endpoint : queries[j]; in interval_tree_test_init()
|
| D | inflate.c | 342 register unsigned j; /* counter */ in huft_build() local
394 for (j = 1; j <= BMAX; j++) in huft_build()
395 if (c[j]) in huft_build()
397 k = j; /* minimum code length */ in huft_build()
398 if ((unsigned)l < j) in huft_build()
399 l = j; in huft_build()
411 for (y = 1 << j; j < i; j++, y <<= 1) in huft_build()
412 if ((y -= c[j]) < 0) { in huft_build()
425 x[1] = j = 0; in huft_build()
428 *xp++ = (j += *p++); in huft_build()
[all …]
|
| D | bch.c | 350 int i, j, s; in compute_syndromes() local
369 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
370 syn[j] ^= a_pow(bch, (j+1)*(i+s)); in compute_syndromes()
377 for (j = 0; j < t; j++) in compute_syndromes()
378 syn[2*j+1] = gf_sqr(bch, syn[j]); in compute_syndromes()
391 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
412 for (j = 0; j <= pelp->deg; j++) { in compute_error_locator_polynomial()
413 if (pelp->c[j]) { in compute_error_locator_polynomial()
414 l = a_log(bch, pelp->c[j]); in compute_error_locator_polynomial()
415 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
[all …]
|
| D | decompress_bunzip2.c | 162 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
176 j = 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()
200 for (j = 0; j < 16; j++) in get_next_block()
201 if (k&(1 << (15-j))) in get_next_block()
202 symToByte[symTotal++] = (16*i)+j; in get_next_block()
221 for (j = 0; get_bits(bd, 1); j++) in get_next_block()
222 if (j >= groupCount) in get_next_block()
225 uc = mtfSymbol[j]; in get_next_block()
[all …]
|
| D | oid_registry.c | 30 unsigned i, j, k, hash; in look_up_OID() local
48 j = (i + k) / 2; in look_up_OID()
50 xhash = oid_search_table[j].hash; in look_up_OID()
52 k = j; in look_up_OID()
56 i = j + 1; in look_up_OID()
60 oid = oid_search_table[j].oid; in look_up_OID()
63 k = j; in look_up_OID()
67 i = j + 1; in look_up_OID()
78 k = j; in look_up_OID()
82 i = j + 1; in look_up_OID()
|
| D | test_hash.c | 150 int i, j; in test_hash_init() local
155 for (j = SIZE; j > 0; --j) { in test_hash_init()
156 buf[j] = '\0'; in test_hash_init()
158 for (i = 0; i <= j; i++) { in test_hash_init()
160 u32 h0 = full_name_hash(buf+i, buf+i, j-i); in test_hash_init()
163 if (hashlen_len(hashlen) != j-i) { in test_hash_init()
166 i, j, hashlen_len(hashlen), j-i); in test_hash_init()
173 i, j, hashlen_hash(hashlen), h0); in test_hash_init()
|
| D | crc32test.c | 713 int i, j; in crc32c_combine_test() local
721 for (j = 0; j <= test[i].length; ++j) { in crc32c_combine_test()
723 u32 len1 = j, len2 = test[i].length - j; in crc32c_combine_test()
803 int i, j; in crc32_combine_test() local
811 for (j = 0; j <= test[i].length; ++j) { in crc32_combine_test()
813 u32 len1 = j, len2 = test[i].length - j; in crc32_combine_test()
|
| D | sg_split.c | 79 int i, j; in sg_split_phys() local
86 for (j = 0; j < split->nents; j++, out_sg++) { in sg_split_phys()
88 if (!j) { in sg_split_phys()
105 int i, j; in sg_split_mapped() local
112 for (j = 0; j < split->nents; j++, out_sg++) { in sg_split_mapped()
115 if (!j) { in sg_split_mapped()
|
| D | seq_buf.c | 227 int i, j; local
234 for (i = 0, j = 0; i < start_len; i++) {
236 for (i = start_len-1, j = 0; i >= 0; i--) {
238 hex[j++] = hex_asc_hi(data[i]);
239 hex[j++] = hex_asc_lo(data[i]);
241 if (WARN_ON_ONCE(j == 0 || j/2 > len))
245 len -= j / 2;
246 hex[j++] = ' ';
248 seq_buf_putmem(s, hex, j);
|
| D | ts_bm.c | 96 static int subpattern(u8 *pattern, int i, int j, int g) in subpattern() argument
98 int x = i+g-1, y = j+g-1, ret = 0; in subpattern()
106 ret = pattern[i-1] != pattern[j-1]; in subpattern()
116 int i, j, g; in compute_prefix_tbl() local
133 for (j = i-1; j >= 1-g ; j--) in compute_prefix_tbl()
134 if (subpattern(bm->pattern, i, j, g)) { in compute_prefix_tbl()
135 bm->good_shift[g] = bm->patlen-j-g; in compute_prefix_tbl()
|
| /lib/reed_solomon/ |
| D | decode_rs.c | 15 int i, j, r, k, pad; variable
64 for (j = 1; j < len; j++) {
67 syn[i] = (((uint16_t) data[j]) ^
70 syn[i] = ((((uint16_t) data[j]) ^
78 for (j = 0; j < nroots; j++) {
81 syn[i] = ((uint16_t) par[j]) & msk;
83 syn[i] = (((uint16_t) par[j]) & msk) ^
115 for (j = i + 1; j > 0; j--) {
116 tmp = index_of[lambda[j - 1]];
118 lambda[j] ^=
[all …]
|
| D | encode_rs.c | 14 int i, j, pad; variable
32 for (j = 1; j < nroots; j++) {
33 par[j] ^= alpha_to[rs_modnn(rs, fb +
34 genpoly[nroots - j])];
|
| /lib/raid6/test/ |
| D | test.c | 31 int i, j; in makedata() local
34 for (j = 0; j < PAGE_SIZE; j++) in makedata()
35 data[i][j] = rand(); in makedata()
53 static int test_disks(int i, int j) in test_disks() argument
61 dataptrs[j] = recovj; in test_disks()
63 raid6_dual_recov(NDISKS, PAGE_SIZE, i, j, (void **)&dataptrs); in test_disks()
66 errb = memcmp(data[j], recovj, PAGE_SIZE); in test_disks()
68 if (i < NDISKS-2 && j == NDISKS-1) { in test_disks()
76 j, disk_type(j), in test_disks()
83 dataptrs[j] = data[j]; in test_disks()
[all …]
|
| /lib/mpi/ |
| D | generic_mpih-sub1.c | 24 mpi_size_t j; in mpihelp_sub_n() local
28 j = -size; in mpihelp_sub_n()
31 s1_ptr -= j; in mpihelp_sub_n()
32 s2_ptr -= j; in mpihelp_sub_n()
33 res_ptr -= j; in mpihelp_sub_n()
37 y = s2_ptr[j]; in mpihelp_sub_n()
38 x = s1_ptr[j]; in mpihelp_sub_n()
43 res_ptr[j] = y; in mpihelp_sub_n()
44 } while (++j); in mpihelp_sub_n()
|
| D | generic_mpih-add1.c | 25 mpi_size_t j; in mpihelp_add_n() local
29 j = -size; in mpihelp_add_n()
32 s1_ptr -= j; in mpihelp_add_n()
33 s2_ptr -= j; in mpihelp_add_n()
34 res_ptr -= j; in mpihelp_add_n()
38 y = s2_ptr[j]; in mpihelp_add_n()
39 x = s1_ptr[j]; in mpihelp_add_n()
44 res_ptr[j] = y; in mpihelp_add_n()
45 } while (++j); in mpihelp_add_n()
|
| D | generic_mpih-mul2.c | 24 mpi_size_t j; in mpihelp_addmul_1() local
30 j = -s1_size; in mpihelp_addmul_1()
31 res_ptr -= j; in mpihelp_addmul_1()
32 s1_ptr -= j; in mpihelp_addmul_1()
36 umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); in mpihelp_addmul_1()
41 x = res_ptr[j]; in mpihelp_addmul_1()
44 res_ptr[j] = prod_low; in mpihelp_addmul_1()
45 } while (++j); in mpihelp_addmul_1()
|
| D | generic_mpih-mul3.c | 24 mpi_size_t j; in mpihelp_submul_1() local
30 j = -s1_size; in mpihelp_submul_1()
31 res_ptr -= j; in mpihelp_submul_1()
32 s1_ptr -= j; in mpihelp_submul_1()
36 umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); in mpihelp_submul_1()
41 x = res_ptr[j]; in mpihelp_submul_1()
44 res_ptr[j] = prod_low; in mpihelp_submul_1()
45 } while (++j); in mpihelp_submul_1()
|
| D | generic_mpih-mul1.c | 24 mpi_size_t j; in mpihelp_mul_1() local
29 j = -s1_size; in mpihelp_mul_1()
32 s1_ptr -= j; in mpihelp_mul_1()
33 res_ptr -= j; in mpihelp_mul_1()
37 umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); in mpihelp_mul_1()
40 res_ptr[j] = prod_low; in mpihelp_mul_1()
41 } while (++j); in mpihelp_mul_1()
|