Home
last modified time | relevance | path

Searched refs:insert (Results 1 – 25 of 294) sorted by relevance

12345678910>>...12

/linux/drivers/md/bcache/
A Dextents.c235 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()
423 KEY_SIZE(insert)); in bch_extent_insert_fixup()
439 insert); in bch_extent_insert_fixup()
455 bch_cut_front(insert, k); in bch_extent_insert_fixup()
481 SET_KEY_OFFSET(insert, KEY_OFFSET(insert) - in bch_extent_insert_fixup()
487 if (KEY_DIRTY(insert)) in bch_extent_insert_fixup()
489 KEY_START(insert), in bch_extent_insert_fixup()
[all …]
/linux/drivers/net/wireguard/selftest/
A Dallowedips.c521 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()
524 insert(6, f, 0, 0, 0, 0, 0); in wg_allowedips_selftest()
534 insert(4, a, 10, 0, 0, 0, 25); in wg_allowedips_selftest()
536 insert(4, a, 10, 1, 0, 0, 30); in wg_allowedips_selftest()
537 insert(4, b, 10, 1, 0, 4, 30); in wg_allowedips_selftest()
538 insert(4, c, 10, 1, 0, 8, 29); in wg_allowedips_selftest()
539 insert(4, d, 10, 1, 0, 16, 29); in wg_allowedips_selftest()
577 insert(4, a, 1, 0, 0, 0, 32); in wg_allowedips_selftest()
578 insert(4, a, 64, 0, 0, 0, 32); in wg_allowedips_selftest()
[all …]
/linux/fs/bcachefs/
A Ddata_update.c108 struct bkey_i *insert, in trace_move_extent_fail2() argument
124 if (insert) { in trace_move_extent_fail2()
156 if (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()
240 bkey_i_to_s(insert), ptr); in __bch2_data_update_index_update()
318 next_pos = insert->k.p; in __bch2_data_update_index_update()
[all …]
A Dextent_update.c107 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()
A Dstr_hash.h260 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()
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
344 insert->k.p.inode = inum.inum; in bch2_hash_set()
[all …]
A Dbtree_update.c34 struct bkey_i **insert, in extent_front_merge() argument
63 *insert = update; in extent_front_merge()
69 struct bkey_i *insert, in extent_back_merge() argument
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
305 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) { in bch2_trans_update_extent()
306 if (bch2_bkey_maybe_mergable(k.k, &insert->k)) { in bch2_trans_update_extent()
316 bool done = bkey_lt(insert->k.p, k.k->p); in bch2_trans_update_extent()
333 if (bch2_bkey_maybe_mergable(&insert->k, k.k)) { in bch2_trans_update_extent()
334 ret = extent_back_merge(trans, &iter, insert, k); in bch2_trans_update_extent()
[all …]
A Dio_misc.c367 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()
A Dbtree_trans_commit.c155 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()
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()
204 insert->k.needs_whiteout = k->needs_whiteout; in bch2_btree_bset_insert_key()
217 bch2_bset_insert(b, k, insert, clobber_u64s); in bch2_btree_bset_insert_key()
289 struct bkey_i *insert, in bch2_btree_insert_key_leaf() argument
[all …]
A Dbackpointers.h91 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()
A Dbset.c241 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
991 if (bch2_bkey_pack_key(&packed, &insert->k, f)) in bch2_bset_insert()
994 if (!bkey_deleted(&insert->k)) in bch2_bset_insert()
[all …]
/linux/virt/kvm/
A Dcoalesced_mmio.c49 __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/tools/testing/selftests/tc-testing/plugin-lib/
A DvalgrindPlugin.py84 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'])
A DnsPlugin.py102 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/drivers/accessibility/speakup/
A DDefaultKeyAssignments6 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/tools/perf/util/
A Dcomm.c165 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()
A Ddsos.c213 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/tools/testing/selftests/timers/
A Dleap-a-day.c184 int insert = 1; in main() local
263 if (insert) in main()
320 if (insert) in main()
360 insert = !insert; in main()
/linux/fs/notify/
A Dnotification.c85 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/include/linux/
A Ddmar.h146 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/net/rds/
A Dcong.c105 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/fs/ocfs2/
A Dalloc.c3881 insert->ins_split, rec, in ocfs2_insert_at_leaf()
4221 insert); in ocfs2_insert_path()
4497 insert->ins_contig_index = i; in ocfs2_figure_contig_type()
4588 insert->ins_split = SPLIT_NONE; in ocfs2_figure_insert_type()
4622 if (!insert->ins_tree_depth) { in ocfs2_figure_insert_type()
4736 &free_records, &insert); in ocfs2_insert_extent()
4742 trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig, in ocfs2_insert_extent()
4744 insert.ins_tree_depth); in ocfs2_insert_extent()
4954 insert.ins_tree_depth = depth; in ocfs2_split_and_insert()
4962 insert.ins_split = SPLIT_LEFT; in ocfs2_split_and_insert()
[all …]
/linux/rust/macros/
A Dvtable.rs48 consts.insert(const_name); in vtable()
77 consts.insert(gen_const_name); in vtable()
/linux/drivers/net/can/dev/
A Drx-offload.c80 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/Documentation/sphinx/
A DrstFlatTable.py130 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/Documentation/
A Dconf.py44 sys.path.insert(0, os.path.abspath('sphinx'))
361 html_sidebars['**'].insert(0, 'about.html')

Completed in 55 milliseconds

12345678910>>...12