| /kernel/linux/linux-5.10/drivers/staging/media/atomisp/pci/isp/kernels/eed1_8/ |
| D | ia_css_eed1_8.host.c | 94 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 …]
|
| /kernel/linux/linux-6.6/drivers/staging/media/atomisp/pci/isp/kernels/eed1_8/ |
| D | ia_css_eed1_8.host.c | 94 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 …]
|
| /kernel/linux/linux-6.6/tools/perf/util/ |
| D | levenshtein.c | 25 * 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 …]
|
| D | values.c | 136 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 …]
|
| /kernel/linux/linux-5.10/tools/perf/util/ |
| D | levenshtein.c | 25 * 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 …]
|
| D | values.c | 136 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 …]
|
| /kernel/linux/linux-5.10/tools/testing/selftests/net/ |
| D | reuseaddr_ports_exhausted.c | 84 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 …]
|
| /kernel/linux/linux-6.6/tools/testing/selftests/net/ |
| D | reuseaddr_ports_exhausted.c | 84 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 …]
|
| /kernel/liteos_m/testsuites/sample/kernel/mem/ |
| D | It_los_mem_038.c | 46 int i, j; in TestCase() local
62 for (j = 0; j < i; j++) { in TestCase()
63 …p0 = LOS_MemRealloc(g_memPool, p[j], size / 2); // 2, The reallocated memory is half of its previo… in TestCase()
65 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT); in TestCase()
69 for (j = 0; j < i; j++) { in TestCase()
73 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT); in TestCase()
89 for (j = 0; j < i; j++) { in TestCase()
90 if (j % 2) { // 2, judge j is odd number or not. in TestCase()
91 ret = LOS_MemFree(g_memPool, p[j]); in TestCase()
93 ICUNIT_GOTO_EQUAL(1, 0, j, EXIT); in TestCase()
[all …]
|
| /kernel/linux/linux-5.10/lib/ |
| D | gen_crc32table.c | 34 * 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 …]
|
| 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 | 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 …]
|
| /kernel/linux/linux-6.6/lib/ |
| D | gen_crc32table.c | 34 * 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 …]
|
| 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 …]
|
| /kernel/linux/linux-6.6/drivers/video/logo/ |
| D | pnmtologo.c | 124 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 …]
|
| /kernel/linux/linux-5.10/kernel/ |
| D | range.c | 67 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 …]
|
| /kernel/linux/linux-6.6/kernel/ |
| D | range.c | 67 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 …]
|
| /kernel/linux/linux-6.6/drivers/md/bcache/ |
| D | bset.c | 368 * 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 …]
|
| /kernel/linux/linux-5.10/drivers/md/bcache/ |
| D | bset.c | 368 * 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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/lib/raid6/ |
| D | mktables.c | 55 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 …]
|
| /kernel/linux/linux-5.10/drivers/video/logo/ |
| D | pnmtologo.c | 128 unsigned int i, j; in read_image() local
178 for (j = 0; j < logo_width; j++) in read_image()
179 logo_data[i][j].red = logo_data[i][j].green = in read_image()
180 logo_data[i][j].blue = 255*(1-get_number(fp)); in read_image()
187 for (j = 0; j < logo_width; j++) in read_image()
188 logo_data[i][j].red = logo_data[i][j].green = in read_image()
189 logo_data[i][j].blue = get_number255(fp, maxval); in read_image()
196 for (j = 0; j < logo_width; j++) { in read_image()
197 logo_data[i][j].red = get_number255(fp, maxval); in read_image()
198 logo_data[i][j].green = get_number255(fp, maxval); in read_image()
[all …]
|
| /kernel/linux/linux-6.6/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 …]
|
| /kernel/linux/linux-5.10/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 …]
|
| /kernel/linux/linux-6.6/drivers/net/ethernet/sunplus/ |
| D | spl2sw_desc.c | 17 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 …]
|