| /linux-6.12.1/drivers/md/bcache/ |
| D | extents.c | 229 struct bkey *insert, in bch_btree_ptr_insert_fixup() argument
235 if (!KEY_OFFSET(insert)) in bch_btree_ptr_insert_fixup()
339 struct bkey *insert, in bch_extent_insert_fixup() argument
348 BUG_ON(!KEY_OFFSET(insert)); in bch_extent_insert_fixup()
349 BUG_ON(!KEY_SIZE(insert)); in bch_extent_insert_fixup()
357 if (bkey_cmp(&START_KEY(k), insert) >= 0) { in bch_extent_insert_fixup()
364 if (bkey_cmp(k, &START_KEY(insert)) <= 0) in bch_extent_insert_fixup()
393 if (KEY_START(k) > KEY_START(insert) + sectors_found) in bch_extent_insert_fixup()
408 sectors_found = KEY_OFFSET(k) - KEY_START(insert); in bch_extent_insert_fixup()
411 if (bkey_cmp(insert, k) < 0 && in bch_extent_insert_fixup()
[all …]
|
| /linux-6.12.1/drivers/net/wireguard/selftest/ |
| D | allowedips.c | 460 #define insert(version, mem, ipa, ipb, ipc, ipd, cidr) \ macro
513 insert(4, a, 192, 168, 4, 0, 24); in wg_allowedips_selftest()
514 insert(4, b, 192, 168, 4, 4, 32); in wg_allowedips_selftest()
515 insert(4, c, 192, 168, 0, 0, 16); in wg_allowedips_selftest()
516 insert(4, d, 192, 95, 5, 64, 27); in wg_allowedips_selftest()
518 insert(4, c, 192, 95, 5, 65, 27); in wg_allowedips_selftest()
519 insert(6, d, 0x26075300, 0x60006b00, 0, 0xc05f0543, 128); in wg_allowedips_selftest()
520 insert(6, c, 0x26075300, 0x60006b00, 0, 0, 64); in wg_allowedips_selftest()
521 insert(4, e, 0, 0, 0, 0, 0); in wg_allowedips_selftest()
522 insert(6, e, 0, 0, 0, 0, 0); in wg_allowedips_selftest()
[all …]
|
| /linux-6.12.1/fs/bcachefs/ |
| D | data_update.c | 108 struct bkey_i *insert, in trace_move_extent_fail2() argument
124 if (insert) { in trace_move_extent_fail2()
128 (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) && in trace_move_extent_fail2()
156 if (insert) { in trace_move_extent_fail2()
158 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert)); in trace_move_extent_fail2()
187 struct bkey_i *insert = NULL; in __bch2_data_update_index_update() local
215 insert = _insert.k; in __bch2_data_update_index_update()
221 bch2_cut_front(iter.pos, insert); in __bch2_data_update_index_update()
222 bch2_cut_back(new->k.p, insert); in __bch2_data_update_index_update()
223 bch2_cut_back(insert->k.p, &new->k_i); in __bch2_data_update_index_update()
[all …]
|
| D | extent_update.c | 107 struct bkey_i *insert, in bch2_extent_atomic_end() argument
119 *end = insert->k.p; in bch2_extent_atomic_end()
124 ret = count_iters_for_insert(trans, bkey_i_to_s_c(insert), 0, end, in bch2_extent_atomic_end()
131 for_each_btree_key_upto_continue_norestart(copy, insert->k.p, 0, k, ret) { in bch2_extent_atomic_end()
134 if (bkey_gt(bkey_start_pos(&insert->k), bkey_start_pos(k.k))) in bch2_extent_atomic_end()
135 offset = bkey_start_offset(&insert->k) - in bch2_extent_atomic_end()
139 switch (bch2_extent_overlap(&insert->k, k.k)) { in bch2_extent_atomic_end()
|
| D | str_hash.h | 260 struct bkey_i *insert, in bch2_hash_set_or_get_in_snapshot() argument
269 SPOS(insert->k.p.inode, in bch2_hash_set_or_get_in_snapshot()
270 desc.hash_bkey(info, bkey_i_to_s_c(insert)), in bch2_hash_set_or_get_in_snapshot()
272 POS(insert->k.p.inode, U64_MAX), in bch2_hash_set_or_get_in_snapshot()
275 if (!desc.cmp_bkey(k, bkey_i_to_s_c(insert))) in bch2_hash_set_or_get_in_snapshot()
307 insert->k.p = iter->pos; in bch2_hash_set_or_get_in_snapshot()
308 ret = bch2_trans_update(trans, iter, insert, flags); in bch2_hash_set_or_get_in_snapshot()
319 struct bkey_i *insert, in bch2_hash_set_in_snapshot() argument
324 snapshot, insert, flags); in bch2_hash_set_in_snapshot()
341 struct bkey_i *insert, in bch2_hash_set() argument
[all …]
|
| D | btree_update.c | 34 struct bkey_i **insert, in extent_front_merge() argument
49 if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert))) in extent_front_merge()
53 bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p); in extent_front_merge()
63 *insert = update; in extent_front_merge()
69 struct bkey_i *insert, in extent_back_merge() argument
78 ret = bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?: in extent_back_merge()
85 bch2_bkey_merge(c, bkey_i_to_s(insert), k); in extent_back_merge()
287 struct bkey_i *insert, in bch2_trans_update_extent() argument
295 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k), in bch2_trans_update_extent()
299 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX)); in bch2_trans_update_extent()
[all …]
|
| D | io_misc.c | 367 bool insert = shift > 0; in __bch2_resume_logged_op_finsert() local
392 if (insert) { in __bch2_resume_logged_op_finsert()
428 k = insert in __bch2_resume_logged_op_finsert()
443 if (insert && in __bch2_resume_logged_op_finsert()
462 op->v.pos = cpu_to_le64(insert ? bkey_start_offset(&delete.k) : delete.k.p.offset); in __bch2_resume_logged_op_finsert()
482 if (!insert) { in __bch2_resume_logged_op_finsert()
510 u64 offset, u64 len, bool insert, in bch2_fcollapse_finsert() argument
514 s64 shift = insert ? len : -len; in bch2_fcollapse_finsert()
521 op.v.pos = cpu_to_le64(insert ? U64_MAX : offset); in bch2_fcollapse_finsert()
|
| D | btree_trans_commit.c | 155 struct bkey_i *insert) in bch2_btree_bset_insert_key() argument
162 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k)); in bch2_btree_bset_insert_key()
163 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
164 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key()
165 EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b)); in bch2_btree_bset_insert_key()
166 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos)); in bch2_btree_bset_insert_key()
169 if (k && bkey_cmp_left_packed(b, k, &insert->k.p)) in bch2_btree_bset_insert_key()
176 if (bkey_deleted(&insert->k) && !k) in bch2_btree_bset_insert_key()
179 if (bkey_deleted(&insert->k)) { in bch2_btree_bset_insert_key()
185 push_whiteout(b, insert->k.p); in bch2_btree_bset_insert_key()
[all …]
|
| D | backpointers.h | 91 bool insert) in bch2_bucket_backpointer_mod() argument
94 return bch2_bucket_backpointer_mod_nowritebuffer(trans, ca, bucket, bp, orig_k, insert); in bch2_bucket_backpointer_mod()
102 if (!insert) { in bch2_bucket_backpointer_mod()
|
| D | bset.c | 241 struct bkey_packed *insert, unsigned clobber_u64s) in bch2_verify_insert_pos() argument
250 bkey_iter_cmp(b, prev, insert) > 0); in bch2_verify_insert_pos()
253 bkey_iter_cmp(b, prev, insert) > 0) { in bch2_verify_insert_pos()
255 struct bkey k2 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
269 bkey_iter_cmp(b, insert, next) > 0); in bch2_verify_insert_pos()
272 bkey_iter_cmp(b, insert, next) > 0) { in bch2_verify_insert_pos()
273 struct bkey k1 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
981 struct bkey_i *insert, in bch2_bset_insert() argument
986 struct bkey_packed packed, *src = bkey_to_packed(insert); in bch2_bset_insert()
989 bch2_verify_insert_pos(b, where, bkey_to_packed(insert), clobber_u64s); in bch2_bset_insert()
[all …]
|
| /linux-6.12.1/virt/kvm/ |
| D | coalesced_mmio.c | 49 __u32 insert; in coalesced_mmio_write() local
62 insert = READ_ONCE(ring->last); in coalesced_mmio_write()
63 if (insert >= KVM_COALESCED_MMIO_MAX || in coalesced_mmio_write()
64 (insert + 1) % KVM_COALESCED_MMIO_MAX == READ_ONCE(ring->first)) { in coalesced_mmio_write()
71 ring->coalesced_mmio[insert].phys_addr = addr; in coalesced_mmio_write()
72 ring->coalesced_mmio[insert].len = len; in coalesced_mmio_write()
73 memcpy(ring->coalesced_mmio[insert].data, val, len); in coalesced_mmio_write()
74 ring->coalesced_mmio[insert].pio = dev->zone.pio; in coalesced_mmio_write()
76 ring->last = (insert + 1) % KVM_COALESCED_MMIO_MAX; in coalesced_mmio_write()
|
| /linux-6.12.1/tools/testing/selftests/tc-testing/plugin-lib/ |
| D | valgrindPlugin.py | 84 cmdlist.insert(0, '--track-origins=yes')
85 cmdlist.insert(0, '--show-leak-kinds=definite,indirect')
86 cmdlist.insert(0, '--leak-check=full')
87 cmdlist.insert(0, '--log-file=vgnd-{}.log'.format(self.args.testid))
88 cmdlist.insert(0, '-v') # ask for summary of non-leak errors
89 cmdlist.insert(0, ENVIR['VALGRIND_BIN'])
|
| D | nsPlugin.py | 102 cmdlist.insert(0, self.args.NAMES['NS'])
103 cmdlist.insert(0, 'exec')
104 cmdlist.insert(0, 'netns')
105 cmdlist.insert(0, self.args.NAMES['IP'])
|
| /linux-6.12.1/tools/perf/util/ |
| D | comm.c | 165 int insert = comm_strs->num_strs; /* Default to inserting at the end. */ in comm_strs__findnew() local
175 insert = mid; in comm_strs__findnew()
178 memmove(&comm_strs->strs[insert + 1], &comm_strs->strs[insert], in comm_strs__findnew()
179 (comm_strs->num_strs - insert) * sizeof(struct comm_str *)); in comm_strs__findnew()
181 comm_strs->strs[insert] = result; in comm_strs__findnew()
|
| D | dsos.c | 213 int insert = dsos->cnt; /* Default to inserting at the end. */ in __dsos__add() local
223 insert = mid; in __dsos__add()
226 memmove(&dsos->dsos[insert + 1], &dsos->dsos[insert], in __dsos__add()
227 (dsos->cnt - insert) * sizeof(struct dso *)); in __dsos__add()
229 dsos->dsos[insert] = dso__get(dso); in __dsos__add()
|
| /linux-6.12.1/drivers/accessibility/speakup/ |
| D | DefaultKeyAssignments | 6 We have remapped the insert or zero key on the keypad to act as a
8 InsKeyPad-period means hold down the insert key like a shift key and
31 InsKeyPad-9 Move reading cursor to top of screen (insert pgup)
32 InsKeyPad-3 Move reading cursor to bottom of screen (insert pgdn)
33 InsKeyPad-7 Move reading cursor to left edge of screen (insert home)
34 InsKeyPad-1 Move reading cursor to right edge of screen (insert end)
|
| /linux-6.12.1/tools/testing/selftests/timers/ |
| D | leap-a-day.c | 184 int insert = 1; in main() local
263 if (insert) in main()
320 if (insert) in main()
360 insert = !insert; in main()
|
| /linux-6.12.1/fs/notify/ |
| D | notification.c | 85 void (*insert)(struct fsnotify_group *, in fsnotify_insert_event()
123 if (insert) in fsnotify_insert_event()
124 insert(group, event); in fsnotify_insert_event()
|
| /linux-6.12.1/include/linux/ |
| D | dmar.h | 146 extern int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert);
163 static inline int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert) in dmar_iommu_hotplug() argument
170 extern int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert);
172 static inline int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert) in dmar_ir_hotplug() argument
|
| /linux-6.12.1/net/rds/ |
| D | cong.c | 105 struct rds_cong_map *insert) in rds_cong_tree_walk() argument
126 if (insert) { in rds_cong_tree_walk()
127 rb_link_node(&insert->m_rb_node, parent, p); in rds_cong_tree_walk()
128 rb_insert_color(&insert->m_rb_node, &rds_cong_tree); in rds_cong_tree_walk()
|
| /linux-6.12.1/fs/ocfs2/ |
| D | alloc.c | 3868 struct ocfs2_insert_type *insert) in ocfs2_insert_at_leaf() argument
3870 int i = insert->ins_contig_index; in ocfs2_insert_at_leaf()
3876 if (insert->ins_split != SPLIT_NONE) { in ocfs2_insert_at_leaf()
3881 insert->ins_split, rec, in ocfs2_insert_at_leaf()
3889 if (insert->ins_contig != CONTIG_NONE) { in ocfs2_insert_at_leaf()
3891 if (insert->ins_contig == CONTIG_LEFT) { in ocfs2_insert_at_leaf()
3914 if (insert->ins_appending == APPEND_TAIL) { in ocfs2_insert_at_leaf()
4167 struct ocfs2_insert_type *insert) in ocfs2_insert_path() argument
4202 if (insert->ins_split != SPLIT_NONE) { in ocfs2_insert_path()
4209 insert_rec, insert->ins_split); in ocfs2_insert_path()
[all …]
|
| /linux-6.12.1/Documentation/sphinx/ |
| D | rstFlatTable.py | 130 tableNode.insert(0, title)
254 self.rows[y].insert(x+c+1, None)
262 self.rows[y+r+1].insert(x+c, None)
345 cellElements.insert(0, target)
|
| /linux-6.12.1/drivers/net/can/dev/ |
| D | rx-offload.c | 80 struct sk_buff *pos, *insert = NULL; in __skb_queue_add_sort() local
97 insert = pos; in __skb_queue_add_sort()
100 if (!insert) in __skb_queue_add_sort()
103 __skb_queue_after(head, insert, new); in __skb_queue_add_sort()
|
| /linux-6.12.1/rust/macros/ |
| D | vtable.rs | 48 consts.insert(const_name); in vtable()
77 consts.insert(gen_const_name); in vtable()
|
| /linux-6.12.1/Documentation/userspace-api/media/v4l/ |
| D | selection-api-intro.rst | 9 can insert the image into larger one. Some video output devices can crop
10 part of an input image, scale it up or down and insert it at an
|