| /linux-6.8/fs/bcachefs/ |
| D | journal_reclaim.c | 37 unsigned bch2_journal_dev_buckets_available(struct journal *j, in bch2_journal_dev_buckets_available() argument
54 void bch2_journal_set_watermark(struct journal *j) in bch2_journal_set_watermark() argument
56 struct bch_fs *c = container_of(j, struct bch_fs, journal); in bch2_journal_set_watermark()
57 bool low_on_space = j->space[journal_space_clean].total * 4 <= in bch2_journal_set_watermark()
58 j->space[journal_space_total].total; in bch2_journal_set_watermark()
59 bool low_on_pin = fifo_free(&j->pin) < j->pin.size / 4; in bch2_journal_set_watermark()
66 &j->low_on_space_start, low_on_space) || in bch2_journal_set_watermark()
68 &j->low_on_pin_start, low_on_pin) || in bch2_journal_set_watermark()
70 &j->write_buffer_full_start, low_on_wb)) in bch2_journal_set_watermark()
73 swap(watermark, j->watermark); in bch2_journal_set_watermark()
[all …]
|
| D | journal.c | 30 static void bch2_journal_buf_to_text(struct printbuf *out, struct journal *j, u64 seq) in bch2_journal_buf_to_text() argument
32 union journal_res_state s = READ_ONCE(j->reservations); in bch2_journal_buf_to_text()
34 struct journal_buf *buf = j->buf + i; in bch2_journal_buf_to_text()
60 static void bch2_journal_bufs_to_text(struct printbuf *out, struct journal *j) in bch2_journal_bufs_to_text() argument
65 for (u64 seq = journal_last_unwritten_seq(j); in bch2_journal_bufs_to_text()
66 seq <= journal_cur_seq(j); in bch2_journal_bufs_to_text()
68 bch2_journal_buf_to_text(out, j, seq); in bch2_journal_bufs_to_text()
71 static inline bool journal_seq_unwritten(struct journal *j, u64 seq) in journal_seq_unwritten() argument
73 return seq > j->seq_ondisk; in journal_seq_unwritten()
81 static inline unsigned nr_unwritten_journal_entries(struct journal *j) in nr_unwritten_journal_entries() argument
[all …]
|
| D | journal.h | 118 static inline void journal_wake(struct journal *j) in journal_wake() argument
120 wake_up(&j->wait); in journal_wake()
121 closure_wake_up(&j->async_wait); in journal_wake()
124 static inline struct journal_buf *journal_cur_buf(struct journal *j) in journal_cur_buf() argument
126 return j->buf + j->reservations.idx; in journal_cur_buf()
131 static inline u64 journal_last_seq(struct journal *j) in journal_last_seq() argument
133 return j->pin.front; in journal_last_seq()
136 static inline u64 journal_cur_seq(struct journal *j) in journal_cur_seq() argument
138 return atomic64_read(&j->seq); in journal_cur_seq()
141 static inline u64 journal_last_unwritten_seq(struct journal *j) in journal_last_unwritten_seq() argument
[all …]
|
| D | journal_io.c | 30 static bool jset_csum_good(struct bch_fs *c, struct jset *j, struct bch_csum *csum) in jset_csum_good() argument
32 if (!bch2_checksum_type_valid(c, JSET_CSUM_TYPE(j))) { in jset_csum_good()
37 *csum = csum_vstruct(c, JSET_CSUM_TYPE(j), journal_nonce(j), j); in jset_csum_good()
38 return !bch2_crc_cmp(j->csum, *csum); in jset_csum_good()
51 journal_entry_radix_idx(c, le64_to_cpu(i->j.seq))); in __journal_replay_free()
55 kvpfree(i, offsetof(struct journal_replay, j) + in __journal_replay_free()
56 vstruct_bytes(&i->j)); in __journal_replay_free()
83 struct journal_list *jlist, struct jset *j) in journal_entry_add() argument
88 size_t bytes = vstruct_bytes(j); in journal_entry_add()
89 u64 last_seq = !JSET_NO_FLUSH(j) ? le64_to_cpu(j->last_seq) : 0; in journal_entry_add()
[all …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/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 …]
|
| D | cs-etm-base.c | 64 int i = *offset, j, nr_params = 0, fmt_offset; in cs_etm__print_cpu_metadata_v0() local
84 for (j = fmt_offset; j < nr_params + fmt_offset; j++, i++) in cs_etm__print_cpu_metadata_v0()
85 fprintf(stdout, cs_etm_priv_fmts[j], val[i]); in cs_etm__print_cpu_metadata_v0()
90 for (j = fmt_offset; j < nr_params + fmt_offset; j++, i++) in cs_etm__print_cpu_metadata_v0()
91 fprintf(stdout, cs_etmv4_priv_fmts[j], val[i]); in cs_etm__print_cpu_metadata_v0()
99 int i = *offset, j, total_params = 0; in cs_etm__print_cpu_metadata_v1() local
107 for (j = 0; j < total_params; j++, i++) { in cs_etm__print_cpu_metadata_v1()
109 if (j >= CS_ETM_PRIV_MAX) in cs_etm__print_cpu_metadata_v1()
110 fprintf(stdout, param_unk_fmt, j, val[i]); in cs_etm__print_cpu_metadata_v1()
112 fprintf(stdout, cs_etm_priv_fmts[j], val[i]); in cs_etm__print_cpu_metadata_v1()
[all …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/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 …]
|
| D | journal.c | 42 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 …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/tools/testing/selftests/arm64/mte/ |
| D | check_buffer_fill.c | 31 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 …]
|
| /linux-6.8/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 …]
|
| /linux-6.8/drivers/net/wireless/broadcom/brcm80211/brcmsmac/ |
| D | channel.c | 224 return (ccode[0] == 'J' && in brcms_c_japan_ccode()
233 int j; in brcms_c_channel_min_txpower_limits_with_local_constraint() local
236 for (j = 0; j < WL_TX_POWER_CCK_NUM; j++) in brcms_c_channel_min_txpower_limits_with_local_constraint()
237 txpwr->cck[j] = min(txpwr->cck[j], local_constraint_qdbm); in brcms_c_channel_min_txpower_limits_with_local_constraint()
240 for (j = 0; j < WL_TX_POWER_OFDM_NUM; j++) in brcms_c_channel_min_txpower_limits_with_local_constraint()
241 txpwr->ofdm[j] = min(txpwr->ofdm[j], local_constraint_qdbm); in brcms_c_channel_min_txpower_limits_with_local_constraint()
244 for (j = 0; j < BRCMS_NUM_RATES_OFDM; j++) in brcms_c_channel_min_txpower_limits_with_local_constraint()
245 txpwr->ofdm_cdd[j] = in brcms_c_channel_min_txpower_limits_with_local_constraint()
246 min(txpwr->ofdm_cdd[j], local_constraint_qdbm); in brcms_c_channel_min_txpower_limits_with_local_constraint()
249 for (j = 0; j < BRCMS_NUM_RATES_OFDM; j++) in brcms_c_channel_min_txpower_limits_with_local_constraint()
[all …]
|
| /linux-6.8/arch/x86/kernel/ |
| D | irq.c | 61 int j; in arch_show_interrupts() local
64 for_each_online_cpu(j) in arch_show_interrupts()
65 seq_printf(p, "%10u ", irq_stats(j)->__nmi_count); in arch_show_interrupts()
69 for_each_online_cpu(j) in arch_show_interrupts()
70 seq_printf(p, "%10u ", irq_stats(j)->apic_timer_irqs); in arch_show_interrupts()
74 for_each_online_cpu(j) in arch_show_interrupts()
75 seq_printf(p, "%10u ", irq_stats(j)->irq_spurious_count); in arch_show_interrupts()
78 for_each_online_cpu(j) in arch_show_interrupts()
79 seq_printf(p, "%10u ", irq_stats(j)->apic_perf_irqs); in arch_show_interrupts()
82 for_each_online_cpu(j) in arch_show_interrupts()
[all …]
|
| /linux-6.8/net/ipv4/ |
| D | udp_tunnel_nic.c | 133 unsigned int i, j; in udp_tunnel_nic_is_empty() local
136 for (j = 0; j < info->tables[i].n_entries; j++) in udp_tunnel_nic_is_empty()
137 if (!udp_tunnel_nic_entry_is_free(&utn->entries[i][j])) in udp_tunnel_nic_is_empty()
146 unsigned int i, j; in udp_tunnel_nic_should_replay() local
156 for (j = 0; j < table->n_entries; j++) in udp_tunnel_nic_should_replay()
157 if (udp_tunnel_nic_entry_is_free(&utn->entries[i][j])) in udp_tunnel_nic_should_replay()
242 unsigned int i, j; in udp_tunnel_nic_device_sync_by_port() local
245 for (j = 0; j < info->tables[i].n_entries; j++) in udp_tunnel_nic_device_sync_by_port()
246 udp_tunnel_nic_device_sync_one(dev, utn, i, j); in udp_tunnel_nic_device_sync_by_port()
254 unsigned int i, j; in udp_tunnel_nic_device_sync_by_table() local
[all …]
|
| /linux-6.8/arch/x86/tools/ |
| D | gen-insn-attr-x86.awk | 239 function convert_operands(count,opnd, i,j,imm,mod)
243 for (j = 1; j <= count; j++) {
244 i = opnd[j]
373 for (j = 0; j < max_lprefix; j++)
374 if (etable[i,j])
375 print " ["i"]["j"] = "etable[i,j]","
382 for (j = 0; j < max_lprefix; j++)
383 if (gtable[i,j])
384 print " ["i"]["j"] = "gtable[i,j]","
391 for (j = 0; j < max_lprefix; j++)
[all …]
|
| /linux-6.8/tools/arch/x86/tools/ |
| D | gen-insn-attr-x86.awk | 239 function convert_operands(count,opnd, i,j,imm,mod)
243 for (j = 1; j <= count; j++) {
244 i = opnd[j]
373 for (j = 0; j < max_lprefix; j++)
374 if (etable[i,j])
375 print " ["i"]["j"] = "etable[i,j]","
382 for (j = 0; j < max_lprefix; j++)
383 if (gtable[i,j])
384 print " ["i"]["j"] = "gtable[i,j]","
391 for (j = 0; j < max_lprefix; j++)
[all …]
|