Home
last modified time | relevance | path

Searched full:j (Results 1 – 25 of 4386) sorted by relevance

12345678910>>...176

/openbmc/entity-manager/test/
H A Dtest_entity-manager.cpp14 nlohmann::json j = {{"foo", "$bus"}}; in TEST() local
15 auto it = j.begin(); in TEST()
22 EXPECT_EQ(expected, j["foo"]); in TEST()
27 nlohmann::json j = {{"foo", "$TEST"}}; in TEST() local
28 auto it = j.begin(); in TEST()
35 EXPECT_EQ(expected, j["foo"]); in TEST()
40 nlohmann::json j = {{"foo", "the $TEST"}}; in TEST() local
41 auto it = j.begin(); in TEST()
48 EXPECT_EQ(expected, j["foo"]); in TEST()
53 nlohmann::json j = {{"foo", "the $TEST worked"}}; in TEST() local
[all …]
/openbmc/linux/drivers/staging/media/atomisp/pci/isp/kernels/eed1_8/
H A Dia_css_eed1_8.host.c94 unsigned int i, j, base; in ia_css_eed1_8_vmem_encode() local
130 for (j = 0; j < IA_CSS_NUMBER_OF_DEW_ENHANCE_SEGMENTS; j++) { in ia_css_eed1_8_vmem_encode()
131 assert(from->dew_enhance_seg_x[j] > -1); in ia_css_eed1_8_vmem_encode()
132 assert(from->dew_enhance_seg_y[j] > -1); in ia_css_eed1_8_vmem_encode()
135 for (j = 1; j < IA_CSS_NUMBER_OF_DEW_ENHANCE_SEGMENTS; j++) { in ia_css_eed1_8_vmem_encode()
136 assert(from->dew_enhance_seg_x[j] > from->dew_enhance_seg_x[j - 1]); in ia_css_eed1_8_vmem_encode()
137 assert(from->dew_enhance_seg_y[j] > from->dew_enhance_seg_y[j - 1]); in ia_css_eed1_8_vmem_encode()
152 for (j = 1; j < NUMBER_OF_CHGRINV_POINTS; j++) { in ia_css_eed1_8_vmem_encode()
153 assert(chgrinv_x[j] > chgrinv_x[j - 1]); in ia_css_eed1_8_vmem_encode()
156 for (j = 1; j < NUMBER_OF_TCINV_POINTS; j++) { in ia_css_eed1_8_vmem_encode()
[all …]
/openbmc/linux/tools/perf/util/
H A Dlevenshtein.c25 * In other words, at the start of the big loop, row2[j + 1] contains the
27 * "i" and the substring of string2 of length "j + 1".
32 * i (in string1) and j (in string2), respectively, given that the last
51 int i, j; in levenshtein() local
53 for (j = 0; j <= len2; j++) in levenshtein()
54 row1[j] = j * a; in levenshtein()
59 for (j = 0; j < len2; j++) { in levenshtein()
61 row2[j + 1] = row1[j] + s * (string1[i] != string2[j]); in levenshtein()
63 if (i > 0 && j > 0 && string1[i - 1] == string2[j] && in levenshtein()
64 string1[i] == string2[j - 1] && in levenshtein()
[all …]
H A Dvalues.c136 int j; in perf_read_values__enlarge_counters() local
143 for (j = values->counters_max; j < counters_max; j++) in perf_read_values__enlarge_counters()
144 value[j] = 0; in perf_read_values__enlarge_counters()
204 int i, j; in perf_read_values__display_pretty() local
215 for (j = 0; j < values->counters; j++) in perf_read_values__display_pretty()
216 counterwidth[j] = strlen(values->countername[j]); in perf_read_values__display_pretty()
226 for (j = 0; j < values->counters; j++) { in perf_read_values__display_pretty()
227 width = snprintf(NULL, 0, "%" PRIu64, values->value[i][j]); in perf_read_values__display_pretty()
228 if (width > counterwidth[j]) in perf_read_values__display_pretty()
229 counterwidth[j] = width; in perf_read_values__display_pretty()
[all …]
/openbmc/u-boot/drivers/dma/
H A Dkeystone_nav.c39 int j, num; in num_of_desc_to_reg() local
41 for (j = 0, num = 32; j < 15; j++, num *= 2) { in num_of_desc_to_reg()
43 return j; in num_of_desc_to_reg()
51 u32 j; in _qm_init() local
68 for (j = 0; j < HDESC_NUM; j++) in _qm_init()
69 qm_push(&desc_pool[j], qm_cfg->qpool_num); in _qm_init()
81 u32 j; in qm_close() local
91 for (j = 0; j < qm_cfg->region_num; j++) { in qm_close()
92 qm_cfg->desc_mem[j].base_addr = 0; in qm_close()
93 qm_cfg->desc_mem[j].start_idx = 0; in qm_close()
[all …]
/openbmc/linux/tools/testing/selftests/net/
H A Dreuseaddr_ports_exhausted.c84 int i, j, fd[2]; in TEST() local
89 for (j = 0; j < 2; j++) in TEST()
90 fd[j] = bind_port(_metadata, opts->reuseaddr[j], opts->reuseport[j]); in TEST()
95 for (j = 0; j < 2; j++) in TEST()
96 if (fd[j] != -1) in TEST()
97 close(fd[j]); in TEST()
104 int i, j, fd[2]; in TEST() local
109 for (j = 0; j < 2; j++) in TEST()
110 fd[j] = bind_port(_metadata, opts->reuseaddr[j], opts->reuseport[j]); in TEST()
120 for (j = 0; j < 2; j++) in TEST()
[all …]
/openbmc/openbmc/meta-openembedded/meta-multimedia/recipes-multimedia/fluidsynth/fluidsynth/
H A D0002-fluid_synth_nwrite_float-Allow-zero-pointer-for-left.patch57 int j;
59 for(j = 0; j < num; j++)
61 - left[i][j] = (float) left_in[i * FLUID_BUFSIZE * FLUID_MIXER_MAX_BUFFERS_DEFAULT +…
62 - right[i][j] = (float) right_in[i * FLUID_BUFSIZE * FLUID_MIXER_MAX_BUFFERS_DEFAULT…
65 + left[i][j] = (float) left_in[i * FLUID_BUFSIZE * FLUID_MIXER_MAX_BUFFERS_DEFAU…
69 + right[i][j] = (float) right_in[i * FLUID_BUFSIZE * FLUID_MIXER_MAX_BUFFERS_DEF…
91 int j;
96 for(j = 0; j < num; j++)
105 for(j = 0; j < num; j++)
122 int j;
[all …]
/openbmc/qemu/tcg/loongarch64/
H A Dtcg-insn-defs.c.inc555 encode_dj_slots(LoongArchInsn opc, uint32_t d, uint32_t j)
557 return opc | d | j << 5;
561 encode_djk_slots(LoongArchInsn opc, uint32_t d, uint32_t j, uint32_t k)
563 return opc | d | j << 5 | k << 10;
567 encode_djka_slots(LoongArchInsn opc, uint32_t d, uint32_t j, uint32_t k,
570 return opc | d | j << 5 | k << 10 | a << 15;
574 encode_djkm_slots(LoongArchInsn opc, uint32_t d, uint32_t j, uint32_t k,
577 return opc | d | j << 5 | k << 10 | m << 16;
581 encode_djkn_slots(LoongArchInsn opc, uint32_t d, uint32_t j, uint32_t k,
584 return opc | d | j << 5 | k << 10 | n << 18;
[all …]
/openbmc/qemu/tests/tcg/hexagon/
H A Dhvx_misc.h21 static inline void check(int line, int i, int j, in check() argument
26 line, i, j, result, expect); in check()
58 for (int j = 0; j < MAX_VEC_SIZE_BYTES / FIELDSZ; j++) { \
59 check(line, i, j, output[i].FIELD[j], expect[i].FIELD[j]); \
74 for (int j = 0; j < MAX_VEC_SIZE_BYTES; j++) { in init_buffers() local
75 buffer0[i].b[j] = counter0++; in init_buffers()
76 buffer1[i].b[j] = counter1++; in init_buffers()
78 for (int j = 0; j < MAX_VEC_SIZE_BYTES / 4; j++) { in init_buffers() local
79 mask[i].w[j] = (i + j % MASKMOD == 0) ? 0 : 1; in init_buffers()
108 for (int j = 0; j < MAX_VEC_SIZE_BYTES / FIELDSZ; j++) { \
[all …]
H A Dv69_hvx.c62 for (int j = 0; j < MAX_VEC_SIZE_BYTES / 2; j++) { in test_vasrvuhubrndsat() local
67 shamt = buffer1[i].ub[2 * j + 0] & 0x7; in test_vasrvuhubrndsat()
68 byte0 = fVSATUB(fVROUND(buffer0[2 * i + 0].uh[j], shamt) >> shamt); in test_vasrvuhubrndsat()
69 shamt = buffer1[i].ub[2 * j + 1] & 0x7; in test_vasrvuhubrndsat()
70 byte1 = fVSATUB(fVROUND(buffer0[2 * i + 1].uh[j], shamt) >> shamt); in test_vasrvuhubrndsat()
71 expect[i].uh[j] = (byte1 << 8) | (byte0 & 0xff); in test_vasrvuhubrndsat()
99 for (int j = 0; j < MAX_VEC_SIZE_BYTES / 2; j++) { in test_vasrvuhubsat() local
104 shamt = buffer1[i].ub[2 * j + 0] & 0x7; in test_vasrvuhubsat()
105 byte0 = fVSATUB(buffer0[2 * i + 0].uh[j] >> shamt); in test_vasrvuhubsat()
106 shamt = buffer1[i].ub[2 * j + 1] & 0x7; in test_vasrvuhubsat()
[all …]
/openbmc/linux/lib/
H A Dgen_crc32table.c34 * fact that crctable[i^j] = crctable[i] ^ crctable[j].
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()
[all …]
H A Drbtree_test.c244 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 …]
/openbmc/linux/drivers/video/logo/
H A Dpnmtologo.c124 unsigned int i, j; in read_image() local
174 for (j = 0; j < logo_width; j++) in read_image()
175 logo_data[i][j].red = logo_data[i][j].green = in read_image()
176 logo_data[i][j].blue = 255*(1-get_number(fp)); in read_image()
183 for (j = 0; j < logo_width; j++) in read_image()
184 logo_data[i][j].red = logo_data[i][j].green = in read_image()
185 logo_data[i][j].blue = get_number255(fp, maxval); in read_image()
192 for (j = 0; j < logo_width; j++) { in read_image()
193 logo_data[i][j].red = get_number255(fp, maxval); in read_image()
194 logo_data[i][j].green = get_number255(fp, maxval); in read_image()
[all …]
/openbmc/linux/kernel/
H A Drange.c67 int i, j; in subtract_range() local
72 for (j = 0; j < az; j++) { in subtract_range()
73 if (!range[j].end) in subtract_range()
76 if (start <= range[j].start && end >= range[j].end) { in subtract_range()
77 range[j].start = 0; in subtract_range()
78 range[j].end = 0; in subtract_range()
82 if (start <= range[j].start && end < range[j].end && in subtract_range()
83 range[j].start < end) { in subtract_range()
84 range[j].start = end; in subtract_range()
89 if (start > range[j].start && end >= range[j].end && in subtract_range()
[all …]
/openbmc/linux/drivers/md/bcache/
H A Dbset.c368 * return array index next to j when does in-order traverse
371 static unsigned int inorder_next(unsigned int j, unsigned int size) in inorder_next() argument
373 if (j * 2 + 1 < size) { in inorder_next()
374 j = j * 2 + 1; in inorder_next()
376 while (j * 2 < size) in inorder_next()
377 j *= 2; in inorder_next()
379 j >>= ffz(j) + 1; in inorder_next()
381 return j; in inorder_next()
385 * return array index previous to j when does in-order traverse
388 static unsigned int inorder_prev(unsigned int j, unsigned int size) in inorder_prev() argument
[all …]
H A Djournal.c42 struct jset *j, *data = ca->set->journal.w[0].data; in journal_read_bucket() local
73 j = data; in journal_read_bucket()
76 size_t blocks, bytes = set_bytes(j); in journal_read_bucket()
78 if (j->magic != jset_magic(&ca->sb)) { in journal_read_bucket()
93 if (j->csum != csum_set(j)) { in journal_read_bucket()
99 blocks = set_blocks(j, block_bytes(ca)); in journal_read_bucket()
103 * i->j.seq, the node on head has the smallest (oldest) in journal_read_bucket()
110 * i->j.seq < j->last_seq, it means the oldest jset in journal_read_bucket()
112 * this list. Otherwise, j is a candidate jset for in journal_read_bucket()
118 if (i->j.seq >= j->last_seq) in journal_read_bucket()
[all …]
/openbmc/qemu/tests/unit/
H A Dtest-int128.c49 int i, j; in test_and() local
52 for (j = 0; j < ARRAY_SIZE(tests); ++j) { in test_and()
54 Int128 b = expand(tests[j]); in test_and()
55 Int128 r = expand(tests[i] & tests[j]); in test_and()
65 int i, j; in test_add() local
68 for (j = 0; j < ARRAY_SIZE(tests); ++j) { in test_add()
70 Int128 b = expand(tests[j]); in test_add()
71 Int128 r = expand(tests[i] + tests[j]); in test_add()
81 int i, j; in test_sub() local
84 for (j = 0; j < ARRAY_SIZE(tests); ++j) { in test_sub()
[all …]
H A Dtest-crypto-hash.c113 size_t j; in test_hash_alloc() local
128 for (j = 0; j < resultlen; j++) { in test_hash_alloc()
129 g_assert(expected_outputs[i][j * 2] == hex[(result[j] >> 4) & 0xf]); in test_hash_alloc()
130 g_assert(expected_outputs[i][j * 2 + 1] == hex[result[j] & 0xf]); in test_hash_alloc()
145 size_t j; in test_hash_prealloc() local
164 for (j = 0; j < resultlen; j++) { in test_hash_prealloc()
165 g_assert(expected_outputs[i][j * 2] == hex[(result[j] >> 4) & 0xf]); in test_hash_prealloc()
166 g_assert(expected_outputs[i][j * 2 + 1] == hex[result[j] & 0xf]); in test_hash_prealloc()
187 size_t j; in test_hash_iov() local
200 for (j = 0; j < resultlen; j++) { in test_hash_iov()
[all …]
/openbmc/linux/lib/raid6/
H A Dmktables.c55 int i, j, k; in main() local
70 for (j = 0; j < 256; j += 8) { in main()
73 printf("0x%02x,%c", gfmul(i, j + k), in main()
89 for (j = 0; j < 16; j += 8) { in main()
92 printf("0x%02x,%c", gfmul(i, j + k), in main()
95 for (j = 0; j < 16; j += 8) { in main()
98 printf("0x%02x,%c", gfmul(i, (j + k) << 4), in main()
114 for (j = 0; j < 8; j++) { in main()
115 exptbl[i + j] = v; in main()
116 printf("0x%02x,%c", v, (j == 7) ? '\n' : ' '); in main()
[all …]
/openbmc/u-boot/drivers/crypto/
H A Daspeed_acry.c55 int i, j; in aspeed_acry_mod_exp() local
68 for (i = prop->exp_len - 1, j = 0; i >= 0; --i) { in aspeed_acry_mod_exp()
69 ctx[j] = ptr[i]; in aspeed_acry_mod_exp()
70 j++; in aspeed_acry_mod_exp()
71 j = (j % 16) ? j : j + 32; in aspeed_acry_mod_exp()
75 for (i = (prop->num_bits >> 3) - 1, j = 0; i >= 0; --i) { in aspeed_acry_mod_exp()
76 ctx[j + 16] = ptr[i]; in aspeed_acry_mod_exp()
77 j++; in aspeed_acry_mod_exp()
78 j = (j % 16) ? j : j + 32; in aspeed_acry_mod_exp()
82 for (i = sig_len - 1, j = 0; i >= 0; --i) { in aspeed_acry_mod_exp()
[all …]
/openbmc/u-boot/examples/standalone/
H A Dsmc91111_eeprom.c36 int c, i, j, done, line, reg, value, start, what; in smc91111_eeprom() local
166 j = 0; in smc91111_eeprom()
168 j = input[i] - 0x30; in smc91111_eeprom()
169 if (j >= 0xA) { in smc91111_eeprom()
170 j -= 0x07; in smc91111_eeprom()
172 reg = (reg * 0x10) + j; in smc91111_eeprom()
185 j = 0; in smc91111_eeprom()
187 j = input[i] - 0x30; in smc91111_eeprom()
188 if (j >= 0xA) { in smc91111_eeprom()
189 j -= 0x07; in smc91111_eeprom()
[all …]
/openbmc/linux/lib/reed_solomon/
H A Ddecode_rs.c15 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 …]
/openbmc/linux/drivers/net/ethernet/sunplus/
H A Dspl2sw_desc.c17 u32 i, j; in spl2sw_rx_descs_flush() local
22 for (j = 0; j < comm->rx_desc_num[i]; j++) { in spl2sw_rx_descs_flush()
23 rx_desc[j].addr1 = rx_skbinfo[j].mapping; in spl2sw_rx_descs_flush()
24 rx_desc[j].cmd2 = (j == comm->rx_desc_num[i] - 1) ? in spl2sw_rx_descs_flush()
28 rx_desc[j].cmd1 = RXD_OWN; in spl2sw_rx_descs_flush()
64 u32 i, j; in spl2sw_rx_descs_clean() local
72 for (j = 0; j < comm->rx_desc_num[i]; j++) { in spl2sw_rx_descs_clean()
73 rx_desc[j].cmd1 = 0; in spl2sw_rx_descs_clean()
75 rx_desc[j].cmd2 = 0; in spl2sw_rx_descs_clean()
76 rx_desc[j].addr1 = 0; in spl2sw_rx_descs_clean()
[all …]
/openbmc/linux/tools/testing/selftests/arm64/mte/
H A Dcheck_buffer_fill.c31 int i, j, item; in check_buffer_by_byte() local
43 for (j = 0; j < sizes[i]; j++) in check_buffer_by_byte()
44 ptr[j] = '1'; in check_buffer_by_byte()
48 for (j = 0; j < sizes[i] && !err; j++) { in check_buffer_by_byte()
49 if (ptr[j] != '1') in check_buffer_by_byte()
67 int i, j, item, last_index; in check_buffer_underflow_by_byte() local
83 for (j = sizes[i] - 1; (j >= -underflow_range) && in check_buffer_underflow_by_byte()
84 (!cur_mte_cxt.fault_valid); j--) { in check_buffer_underflow_by_byte()
85 ptr[j] = '1'; in check_buffer_underflow_by_byte()
86 last_index = j; in check_buffer_underflow_by_byte()
[all …]
/openbmc/u-boot/lib/
H A Drc4.c18 unsigned short i, j, t; in rc4_encode() local
21 j = 0; in rc4_encode()
24 j &= 0x0f; in rc4_encode()
25 k[i] = key[j]; in rc4_encode()
26 j++; in rc4_encode()
29 j = 0; in rc4_encode()
31 j = (j + s[i] + k[i]) % 256; in rc4_encode()
33 s[i] = s[j]; in rc4_encode()
34 s[j] = temp; in rc4_encode()
38 j = 0; in rc4_encode()
[all …]

12345678910>>...176