Home
last modified time | relevance | path

Searched refs:j (Results 1 – 25 of 67) sorted by relevance

123

/lib/raid6/
A Dmktables.c55 int i, j, k; in main() local
70 for (j = 0; j < 256; j += 8) { in main()
89 for (j = 0; j < 16; j += 8) { in main()
95 for (j = 0; j < 16; j += 8) { in main()
114 for (j = 0; j < 8; j++) { in main()
115 exptbl[i + j] = v; in main()
132 for (j = 0; j < 8; j++) { in main()
135 if (exptbl[k] == (i + j)) { in main()
152 for (j = 0; j < 8; j++) { in main()
153 invtbl[i + j] = v = gfpow(i + j, 254); in main()
[all …]
/lib/
A Dinterval_tree_test.c77 for (j = 0; j < nnodes; j++) in basic_check()
79 for (j = 0; j < nnodes; j++) in basic_check()
102 for (j = 0; j < nnodes; j++) in search_check()
109 for (j = 0; j < nsearches; j++) { in search_check()
124 for (j = 0; j < nnodes; j++) in search_check()
156 for (j = 0; j < nnodes; j++) in intersection_range_check()
172 for (j = 0; j < nnodes; j++) { in intersection_range_check()
188 for (j = 0; j < nnodes; j++) in intersection_range_check()
255 for (j = 0; j < nnodes; j++) in span_iteration_check()
262 for (j = 0; j < nnodes; j++) in span_iteration_check()
[all …]
A Drbtree_test.c256 for (j = 0; j < nnodes; j++) in basic_check()
258 for (j = 0; j < nnodes; j++) in basic_check()
272 for (j = 0; j < nnodes; j++) in basic_check()
274 for (j = 0; j < nnodes; j++) in basic_check()
331 for (j = 0; j < nnodes; j++) { in basic_check()
335 for (j = 0; j < nnodes; j++) { in basic_check()
357 for (j = 0; j < nnodes; j++) in augmented_check()
359 for (j = 0; j < nnodes; j++) in augmented_check()
372 for (j = 0; j < nnodes; j++) in augmented_check()
374 for (j = 0; j < nnodes; j++) in augmented_check()
[all …]
A Dhexdump.c133 int j, lx = 0; in hex_dump_to_buffer() local
159 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
170 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
172 "%s%8.8x", j ? " " : "", in hex_dump_to_buffer()
181 for (j = 0; j < ngroups; j++) { in hex_dump_to_buffer()
183 "%s%4.4x", j ? " " : "", in hex_dump_to_buffer()
190 for (j = 0; j < len; j++) { in hex_dump_to_buffer()
193 ch = ptr[j]; in hex_dump_to_buffer()
202 if (j) in hex_dump_to_buffer()
213 for (j = 0; j < len; j++) { in hex_dump_to_buffer()
[all …]
A Ducs2_string.c110 unsigned long j = 0; in ucs2_utf8size() local
116 j += 3; in ucs2_utf8size()
118 j += 2; in ucs2_utf8size()
120 j += 1; in ucs2_utf8size()
123 return j; in ucs2_utf8size()
138 unsigned long j = 0; in ucs2_as_utf8() local
150 dest[j++] = 0x80 | (c & 0x003f); in ucs2_as_utf8()
156 dest[j++] = 0x80 | (c & 0x03f); in ucs2_as_utf8()
159 dest[j++] = c & 0x7f; in ucs2_as_utf8()
163 dest[j] = '\0'; in ucs2_as_utf8()
[all …]
A Dinflate.c394 for (j = 1; j <= BMAX; j++) in huft_build()
395 if (c[j]) in huft_build()
399 l = j; in huft_build()
411 for (y = 1 << j; j < i; j++, y <<= 1) in huft_build()
425 x[1] = j = 0; in huft_build()
536 for (j = i >> w; j < z; j += f) in huft_build()
540 for (j = 1 << (k - 1); i & j; j >>= 1) in huft_build()
542 i ^= j; in huft_build()
833 unsigned j; in inflate_dynamic() local
888 for (j = 0; j < nb; j++) in inflate_dynamic()
[all …]
A Dbch.c392 for (j = 0; j < 2*t; j += 2) in compute_syndromes()
400 for (j = 0; j < t; j++) in compute_syndromes()
435 for (j = 0; j <= pelp->deg; j++) { in compute_error_locator_polynomial()
453 for (j = 1; j <= elp->deg; j++) in compute_error_locator_polynomial()
562 for (j = 8; j != 0; j >>= 1, mask ^= (mask << j)) { in find_affine4_roots()
758 for (j = a->deg; j >= d; j--) { in gf_poly_mod()
838 for (j = z->deg; j >= 0; j--) { in compute_trace_bk_mod()
1124 for (j = 0; j < ecclen; j++) { in build_mod8_tables()
1146 for (j = 0, sum = 0; j < m; j++) in build_deg2_base()
1211 for (j = 0, r = 2*i+1; j < m; j++) { in compute_generator_polynomial()
[all …]
A Ddecompress_bunzip2.c200 for (j = 0; j < 16; j++) in get_next_block()
221 for (j = 0; get_bits(bd, 1); j++) in get_next_block()
225 uc = mtfSymbol[j]; in get_next_block()
226 for (; j; j--) in get_next_block()
227 mtfSymbol[j] = mtfSymbol[j-1]; in get_next_block()
234 for (j = 0; j < groupCount; j++) { in get_next_block()
402 || (((unsigned)(j = (j>>(hufGroup->maxLen-i))-base[i])) in get_next_block()
488 j = 0; in get_next_block()
491 byteCount[i] = j; in get_next_block()
492 j = k; in get_next_block()
[all …]
A Doid_registry.c31 unsigned i, j, k, hash; in look_up_OID() local
49 j = (i + k) / 2; in look_up_OID()
51 xhash = oid_search_table[j].hash; in look_up_OID()
53 k = j; in look_up_OID()
57 i = j + 1; in look_up_OID()
61 oid = oid_search_table[j].oid; in look_up_OID()
64 k = j; in look_up_OID()
68 i = j + 1; in look_up_OID()
79 k = j; in look_up_OID()
83 i = j + 1; in look_up_OID()
A Dtest_vmalloc.c434 int i, j; in shuffle_array() local
441 swap(arr[i], arr[j]); in shuffle_array()
449 int index, i, j, ret; in test_func() local
474 for (j = 0; j < test_repeat_count; j++) { in test_func()
574 int j; in do_concurrent_test() local
579 for (j = 0; j < ARRAY_SIZE(test_case_array); j++) { in do_concurrent_test()
580 if (!((run_test_mask & (1 << j)) >> j)) in do_concurrent_test()
586 t->data[j].test_passed, in do_concurrent_test()
587 t->data[j].test_failed, in do_concurrent_test()
588 t->data[j].test_xfailed, in do_concurrent_test()
[all …]
/lib/reed_solomon/
A Ddecode_rs.c64 for (j = 1; j < len; j++) {
78 for (j = 0; j < nroots; j++) {
115 for (j = i + 1; j > 0; j--) {
202 for (j = deg_lambda; j > 0; j--) {
204 reg[j] = rs_modnn(rs, reg[j] + j);
239 for (j = i; j >= 0; j--) {
240 if ((s[i - j] != nn) && (lambda[j] != nn))
242 alpha_to[rs_modnn(rs, s[i - j] + lambda[j])];
253 for (j = count - 1; j >= 0; j--) {
291 for (j = 0; j < count; j++) {
[all …]
/lib/raid6/test/
A Dtest.c30 int i, j; in makedata() local
33 for (j = 0; j < PAGE_SIZE; j++) in makedata()
34 data[i][j] = rand(); in makedata()
60 dataptrs[j] = recovj; in test_disks()
75 j, disk_type(j), in test_disks()
82 dataptrs[j] = data[j]; in test_disks()
91 int i, j, p1, p2; in main() local
119 for (j = i+1; j < NDISKS; j++) in main()
120 err += test_disks(i, j); in main()
136 for (j = i+1; j < NDISKS; j++) in main()
[all …]
/lib/crc/
A Dcrc8.c32 int i, j; in crc8_populate_msb() local
40 for (j = 0; j < i; j++) in crc8_populate_msb()
41 table[i+j] = table[j] ^ t; in crc8_populate_msb()
54 int i, j; in crc8_populate_lsb() local
61 for (j = 0; j < CRC8_TABLE_SIZE; j += 2*i) in crc8_populate_lsb()
62 table[i+j] = table[j] ^ t; in crc8_populate_lsb()
A Dgen_crc32table.c20 unsigned i, j; in crc32init_le_generic() local
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
54 for (j = 0; j < i; j++) in crc32init_be()
55 crc32table_be[i + j] = crc ^ crc32table_be[j]; in crc32init_be()
A Dgen_crc64table.c20 uint64_t i, j, c, crc; in generate_reflected_crc64_table() local
26 for (j = 0; j < 8; j++) { in generate_reflected_crc64_table()
27 if ((crc ^ (c >> j)) & 1) in generate_reflected_crc64_table()
38 uint64_t i, j, c, crc; in generate_crc64_table() local
44 for (j = 0; j < 8; j++) { in generate_crc64_table()
/lib/crypto/
A Dgf128mul.c246 int i, j, k; in gf128mul_init_64k_bbe() local
262 for (j = 1; j <= 64; j <<= 1) in gf128mul_init_64k_bbe()
263 gf128mul_x_bbe(&t->t[0]->t[j + j], &t->t[0]->t[j]); in gf128mul_init_64k_bbe()
266 for (j = 2; j < 256; j += j) in gf128mul_init_64k_bbe()
274 for (j = 128; j > 0; j >>= 1) { in gf128mul_init_64k_bbe()
275 t->t[i]->t[j] = t->t[i - 1]->t[j]; in gf128mul_init_64k_bbe()
327 int j, k; in gf128mul_init_4k_lle() local
334 for (j = 64; j > 0; j >>= 1) in gf128mul_init_4k_lle()
335 gf128mul_x_lle(&t->t[j], &t->t[j+j]); in gf128mul_init_4k_lle()
337 for (j = 2; j < 256; j += j) in gf128mul_init_4k_lle()
[all …]
/lib/crypto/mpi/
A Dgeneric_mpih-add1.c25 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()
A Dgeneric_mpih-sub1.c24 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()
A Dgeneric_mpih-mul2.c24 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()
A Dgeneric_mpih-mul3.c24 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()
A Dgeneric_mpih-mul1.c24 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()
/lib/tests/
A Dtest_hash.c148 int i, j; in test_string_or() local
153 for (j = SIZE; j > 0; --j) { in test_string_or()
154 buf[j] = '\0'; in test_string_or()
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()
174 int i, j; in test_hash_or() local
179 for (j = SIZE; j > 0; --j) { in test_hash_or()
180 buf[j] = '\0'; in test_hash_or()
182 for (i = 0; i <= j; i++) { in test_hash_or()
189 i, j, hashlen_len(hashlen), j-i); in test_hash_or()
[all …]
A Dhashtable_test.c127 int bkt, i, j, count; in hashtable_test_hash_for_each() local
148 for (j = 0; j < 3; j++) in hashtable_test_hash_for_each()
149 KUNIT_EXPECT_EQ(test, entries[j].visited, 1); in hashtable_test_hash_for_each()
157 int bkt, i, j, count; in hashtable_test_hash_for_each_safe() local
181 for (j = 0; j < 3; j++) in hashtable_test_hash_for_each_safe()
182 KUNIT_EXPECT_EQ(test, entries[j].visited, 1); in hashtable_test_hash_for_each_safe()
190 int bkt, i, j, count; in hashtable_test_hash_for_each_possible() local
216 for (j = 0; j < 3; j++) in hashtable_test_hash_for_each_possible()
217 KUNIT_EXPECT_EQ(test, entries[j].visited, 1); in hashtable_test_hash_for_each_possible()
245 int bkt, i, j, count; in hashtable_test_hash_for_each_possible_safe() local
[all …]
A Dstring_kunit.c22 unsigned i, j, k; in string_test_memset16() local
29 for (j = 0; j < 256; j++) { in string_test_memset16()
37 } else if (k < i + j) { in string_test_memset16()
51 unsigned i, j, k; in string_test_memset32() local
58 for (j = 0; j < 256; j++) { in string_test_memset32()
66 } else if (k < i + j) { in string_test_memset32()
80 unsigned i, j, k; in string_test_memset64() local
87 for (j = 0; j < 256; j++) { in string_test_memset64()
135 int i, j; in string_test_strnchr() local
138 for (j = 0; j < strlen(test_string) + 2; j++) { in string_test_strnchr()
[all …]
/lib/math/
A Dtest_div64.c227 static inline bool test_div64_verify(u64 quotient, u32 remainder, int i, int j) in test_div64_verify() argument
229 return (quotient == test_div64_results[i][j].quotient && in test_div64_verify()
230 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
292 for (j = 0; j < SIZE_DIV64_DIVISORS; j++) { in test_div64()
293 if (!test_div64_one(dividend, test_div64_divisors[j], in test_div64()
[all …]

Completed in 40 milliseconds

123