| /lib/raid6/ |
| D | mktables.c | 58 int i, j, k; in main() local
71 for (j = 0; j < 256; j += 8) { in main()
74 printf("0x%02x,%c", gfmul(i, j + k), in main()
90 for (j = 0; j < 16; j += 8) { in main()
93 printf("0x%02x,%c", gfmul(i, j + k), in main()
96 for (j = 0; j < 16; j += 8) { in main()
99 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
115 for (j = 0; j < 8; j++) { in main()
116 exptbl[i + j] = v; in main()
117 printf("0x%02x,%c", v, (j == 7) ? '\n' : ' '); in main()
[all …]
|
| /lib/ |
| D | gen_crc32table.c | 38 unsigned i, j; in crc32init_le_generic() local
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()
50 for (j = 1; j < LE_TABLE_ROWS; j++) { in crc32init_le_generic()
52 tab[j][i] = crc; in crc32init_le_generic()
72 unsigned i, j; in crc32init_be() local
79 for (j = 0; j < i; j++) in crc32init_be()
80 crc32table_be[0][i + j] = crc ^ crc32table_be[0][j]; in crc32init_be()
84 for (j = 1; j < BE_TABLE_ROWS; j++) { in crc32init_be()
86 crc32table_be[j][i] = crc; in crc32init_be()
[all …]
|
| D | rbtree_test.c | 184 int i, j; in rbtree_test_init() local
199 for (j = 0; j < nnodes; j++) in rbtree_test_init()
200 insert(nodes + j, &root); in rbtree_test_init()
201 for (j = 0; j < nnodes; j++) in rbtree_test_init()
202 erase(nodes + j, &root); in rbtree_test_init()
213 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
214 check(j); in rbtree_test_init()
215 insert(nodes + j, &root); in rbtree_test_init()
217 for (j = 0; j < nnodes; j++) { in rbtree_test_init()
218 check(nnodes - j); in rbtree_test_init()
[all …]
|
| D | hexdump.c | 114 int j, lx = 0; in hex_dump_to_buffer() local
140 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
142 "%s%16.16llx", j ? " " : "", in hex_dump_to_buffer()
143 get_unaligned(ptr8 + j)); in hex_dump_to_buffer()
151 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
153 "%s%8.8x", j ? " " : "", in hex_dump_to_buffer()
154 get_unaligned(ptr4 + j)); in hex_dump_to_buffer()
162 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
164 "%s%4.4x", j ? " " : "", in hex_dump_to_buffer()
165 get_unaligned(ptr2 + j)); in hex_dump_to_buffer()
[all …]
|
| D | ucs2_string.c | 57 unsigned long j = 0; in ucs2_utf8size() local
63 j += 3; in ucs2_utf8size()
65 j += 2; in ucs2_utf8size()
67 j += 1; in ucs2_utf8size()
70 return j; in ucs2_utf8size()
85 unsigned long j = 0; in ucs2_as_utf8() local
95 dest[j++] = 0xe0 | (c & 0xf000) >> 12; in ucs2_as_utf8()
96 dest[j++] = 0x80 | (c & 0x0fc0) >> 6; in ucs2_as_utf8()
97 dest[j++] = 0x80 | (c & 0x003f); in ucs2_as_utf8()
102 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 | 63 int i, j; in interval_tree_test_init() local
85 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
86 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
87 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
88 interval_tree_remove(nodes + j, &root); in interval_tree_test_init()
99 for (j = 0; j < nnodes; j++) in interval_tree_test_init()
100 interval_tree_insert(nodes + j, &root); in interval_tree_test_init()
106 for (j = 0; j < nsearches; j++) { in interval_tree_test_init()
107 unsigned long start = search_all ? 0 : queries[j]; in interval_tree_test_init()
108 unsigned long last = search_all ? max_endpoint : queries[j]; in interval_tree_test_init()
|
| D | inflate.c | 341 register unsigned j; /* counter */ in huft_build() local
393 for (j = 1; j <= BMAX; j++) in huft_build()
394 if (c[j]) in huft_build()
396 k = j; /* minimum code length */ in huft_build()
397 if ((unsigned)l < j) in huft_build()
398 l = j; in huft_build()
410 for (y = 1 << j; j < i; j++, y <<= 1) in huft_build()
411 if ((y -= c[j]) < 0) { in huft_build()
424 x[1] = j = 0; in huft_build()
427 *xp++ = (j += *p++); in huft_build()
[all …]
|
| D | bch.c | 340 int i, j, s; in compute_syndromes() local
359 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
360 syn[j] ^= a_pow(bch, (j+1)*(i+s)); in compute_syndromes()
367 for (j = 0; j < t; j++) in compute_syndromes()
368 syn[2*j+1] = gf_sqr(bch, syn[j]); in compute_syndromes()
381 unsigned int i, j, tmp, l, pd = 1, d = syn[0]; in compute_error_locator_polynomial() local
402 for (j = 0; j <= pelp->deg; j++) { in compute_error_locator_polynomial()
403 if (pelp->c[j]) { in compute_error_locator_polynomial()
404 l = a_log(bch, pelp->c[j]); in compute_error_locator_polynomial()
405 elp->c[j+k] ^= a_pow(bch, tmp+l); in compute_error_locator_polynomial()
[all …]
|
| D | decompress_bunzip2.c | 161 i, j, k, t, runPos, symCount, symTotal, nSelectors, *byteCount; in get_next_block() local
175 j = 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()
199 for (j = 0; j < 16; j++) in get_next_block()
200 if (k&(1 << (15-j))) in get_next_block()
201 symToByte[symTotal++] = (16*i)+j; in get_next_block()
220 for (j = 0; get_bits(bd, 1); j++) in get_next_block()
221 if (j >= groupCount) in get_next_block()
224 uc = mtfSymbol[j]; in get_next_block()
[all …]
|
| D | oid_registry.c | 34 unsigned i, j, k, hash; in look_up_OID() local
52 j = (i + k) / 2; in look_up_OID()
54 xhash = oid_search_table[j].hash; in look_up_OID()
56 k = j; in look_up_OID()
60 i = j + 1; in look_up_OID()
64 oid = oid_search_table[j].oid; in look_up_OID()
67 k = j; in look_up_OID()
71 i = j + 1; in look_up_OID()
82 k = j; in look_up_OID()
86 i = j + 1; in look_up_OID()
|
| D | sg_split.c | 81 int i, j; in sg_split_phys() local
88 for (j = 0; j < split->nents; j++, out_sg++) { in sg_split_phys()
90 if (!j) { in sg_split_phys()
107 int i, j; in sg_split_mapped() local
114 for (j = 0; j < split->nents; j++, out_sg++) { in sg_split_mapped()
117 if (!j) { in sg_split_mapped()
|
| D | ts_bm.c | 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()
120 int i, j, g; in compute_prefix_tbl() local
137 for (j = i-1; j >= 1-g ; j--) in compute_prefix_tbl()
138 if (subpattern(bm->pattern, i, j, g)) { in compute_prefix_tbl()
139 bm->good_shift[g] = bm->patlen-j-g; in compute_prefix_tbl()
|
| D | seq_buf.c | 226 int i, j; local
235 for (i = 0, j = 0; i < start_len; i++) {
237 for (i = start_len-1, j = 0; i >= 0; i--) {
239 hex[j++] = hex_asc_hi(data[i]);
240 hex[j++] = hex_asc_lo(data[i]);
242 if (WARN_ON_ONCE(j == 0 || j/2 > len))
246 hex[j++] = ' ';
248 seq_buf_putmem(s, hex, j);
|
| /lib/raid6/test/ |
| D | test.c | 33 int i, j; in makedata() local
36 for (j = 0; j < PAGE_SIZE; j++) in makedata()
37 data[i][j] = rand(); in makedata()
55 static int test_disks(int i, int j) in test_disks() argument
63 dataptrs[j] = recovj; in test_disks()
65 raid6_dual_recov(NDISKS, PAGE_SIZE, i, j, (void **)&dataptrs); in test_disks()
68 errb = memcmp(data[j], recovj, PAGE_SIZE); in test_disks()
70 if (i < NDISKS-2 && j == NDISKS-1) { in test_disks()
78 j, disk_type(j), in test_disks()
85 dataptrs[j] = data[j]; in test_disks()
[all …]
|
| /lib/reed_solomon/ |
| D | decode_rs.c | 21 int i, j, r, k, pad; variable
63 for (j = 1; j < len; j++) {
66 syn[i] = (((uint16_t) data[j]) ^
69 syn[i] = ((((uint16_t) data[j]) ^
77 for (j = 0; j < nroots; j++) {
80 syn[i] = ((uint16_t) par[j]) & msk;
82 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 | 21 int i, j, pad; variable
39 for (j = 1; j < nroots; j++) {
40 par[j] ^= alpha_to[rs_modnn(rs, fb +
41 genpoly[nroots - j])];
|
| D | reed_solomon.c | 70 int i, j, sr, root, iprim; in rs_init() local
135 for (j = i; j > 0; j--) { in rs_init()
136 if (rs->genpoly[j] != 0) { in rs_init()
137 rs->genpoly[j] = rs->genpoly[j -1] ^ in rs_init()
139 rs->index_of[rs->genpoly[j]] + root)]; in rs_init()
141 rs->genpoly[j] = rs->genpoly[j - 1]; in rs_init()
|
| /lib/mpi/ |
| D | generic_mpih-sub1.c | 37 mpi_size_t j; in mpihelp_sub_n() local
41 j = -size; in mpihelp_sub_n()
44 s1_ptr -= j; in mpihelp_sub_n()
45 s2_ptr -= j; in mpihelp_sub_n()
46 res_ptr -= j; in mpihelp_sub_n()
50 y = s2_ptr[j]; in mpihelp_sub_n()
51 x = s1_ptr[j]; in mpihelp_sub_n()
56 res_ptr[j] = y; in mpihelp_sub_n()
57 } while (++j); in mpihelp_sub_n()
|
| D | generic_mpih-add1.c | 38 mpi_size_t j; in mpihelp_add_n() local
42 j = -size; in mpihelp_add_n()
45 s1_ptr -= j; in mpihelp_add_n()
46 s2_ptr -= j; in mpihelp_add_n()
47 res_ptr -= j; in mpihelp_add_n()
51 y = s2_ptr[j]; in mpihelp_add_n()
52 x = s1_ptr[j]; in mpihelp_add_n()
57 res_ptr[j] = y; in mpihelp_add_n()
58 } while (++j); in mpihelp_add_n()
|
| D | generic_mpih-mul2.c | 37 mpi_size_t j; in mpihelp_addmul_1() local
43 j = -s1_size; in mpihelp_addmul_1()
44 res_ptr -= j; in mpihelp_addmul_1()
45 s1_ptr -= j; in mpihelp_addmul_1()
49 umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); in mpihelp_addmul_1()
54 x = res_ptr[j]; in mpihelp_addmul_1()
57 res_ptr[j] = prod_low; in mpihelp_addmul_1()
58 } while (++j); in mpihelp_addmul_1()
|
| D | generic_mpih-mul3.c | 37 mpi_size_t j; in mpihelp_submul_1() local
43 j = -s1_size; in mpihelp_submul_1()
44 res_ptr -= j; in mpihelp_submul_1()
45 s1_ptr -= j; in mpihelp_submul_1()
49 umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); in mpihelp_submul_1()
54 x = res_ptr[j]; in mpihelp_submul_1()
57 res_ptr[j] = prod_low; in mpihelp_submul_1()
58 } while (++j); in mpihelp_submul_1()
|
| D | generic_mpih-mul1.c | 37 mpi_size_t j; in mpihelp_mul_1() local
42 j = -s1_size; in mpihelp_mul_1()
45 s1_ptr -= j; in mpihelp_mul_1()
46 res_ptr -= j; in mpihelp_mul_1()
50 umul_ppmm(prod_high, prod_low, s1_ptr[j], s2_limb); in mpihelp_mul_1()
53 res_ptr[j] = prod_low; in mpihelp_mul_1()
54 } while (++j); in mpihelp_mul_1()
|
| /lib/xz/ |
| D | xz_crc32.c | 35 uint32_t j; in xz_crc32_init() local
40 for (j = 0; j < 8; ++j) in xz_crc32_init()
|
| D | xz_dec_bcj.c | 100 uint32_t j; in bcj_x86() local
136 j = mask_to_bit_num[prev_mask] * 8; in bcj_x86()
137 b = (uint8_t)(dest >> (24 - j)); in bcj_x86()
141 src = dest ^ (((uint32_t)1 << (32 - j)) - 1); in bcj_x86()
198 size_t j; in bcj_ia64() local
231 for (j = 0; j < 6; ++j) in bcj_ia64()
232 instr |= (uint64_t)(buf[i + j + byte_pos]) in bcj_ia64()
233 << (8 * j); in bcj_ia64()
253 for (j = 0; j < 6; j++) in bcj_ia64()
254 buf[i + j + byte_pos] in bcj_ia64()
[all …]
|