Home
last modified time | relevance | path

Searched full:insert (Results 1 – 25 of 1607) sorted by relevance

12345678910>>...65

/linux-6.8/fs/bcachefs/
Ddata_update.c34 struct bkey_i *insert, in trace_move_extent_fail2() argument
50 if (insert) { in trace_move_extent_fail2()
54 (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) && in trace_move_extent_fail2()
82 if (insert) { in trace_move_extent_fail2()
84 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert)); in trace_move_extent_fail2()
113 struct bkey_i *insert = NULL; in __bch2_data_update_index_update() local
141 insert = _insert.k; in __bch2_data_update_index_update()
147 bch2_cut_front(iter.pos, insert); in __bch2_data_update_index_update()
148 bch2_cut_back(new->k.p, insert); in __bch2_data_update_index_update()
149 bch2_cut_back(insert->k.p, &new->k_i); in __bch2_data_update_index_update()
[all …]
Dbtree_update.c34 struct bkey_i **insert, in extent_front_merge() argument
46 if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert))) in extent_front_merge()
50 bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p); in extent_front_merge()
60 *insert = update; in extent_front_merge()
66 struct bkey_i *insert, in extent_back_merge() argument
72 ret = bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?: in extent_back_merge()
79 bch2_bkey_merge(c, bkey_i_to_s(insert), k); in extent_back_merge()
281 struct bkey_i *insert, in bch2_trans_update_extent() argument
289 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k), in bch2_trans_update_extent()
293 k = bch2_btree_iter_peek_upto(&iter, POS(insert->k.p.inode, U64_MAX)); in bch2_trans_update_extent()
[all …]
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()
Dbtree_trans_commit.c76 * a new bset to insert into: in bch2_btree_node_prep_for_write()
125 /* Inserting into a given leaf node (last stage of insert): */
127 /* Handle overwrites and do insert, for non extents: */
132 struct bkey_i *insert) in bch2_btree_bset_insert_key() argument
139 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k)); in bch2_btree_bset_insert_key()
140 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
141 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); in bch2_btree_bset_insert_key()
142 EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b)); in bch2_btree_bset_insert_key()
143 EBUG_ON(!b->c.level && !bpos_eq(insert->k.p, path->pos)); in bch2_btree_bset_insert_key()
146 if (k && bkey_cmp_left_packed(b, k, &insert->k.p)) in bch2_btree_bset_insert_key()
[all …]
Dstr_hash.h266 struct bkey_i *insert, in bch2_hash_set_snapshot() argument
276 SPOS(insert->k.p.inode, in bch2_hash_set_snapshot()
277 desc.hash_bkey(info, bkey_i_to_s_c(insert)), in bch2_hash_set_snapshot()
279 POS(insert->k.p.inode, U64_MAX), in bch2_hash_set_snapshot()
282 if (!desc.cmp_bkey(k, bkey_i_to_s_c(insert))) in bch2_hash_set_snapshot()
316 insert->k.p = iter.pos; in bch2_hash_set_snapshot()
317 ret = bch2_trans_update(trans, &iter, insert, update_flags); in bch2_hash_set_snapshot()
328 struct bkey_i *insert, in bch2_hash_set() argument
338 insert->k.p.inode = inum.inum; in bch2_hash_set()
341 snapshot, insert, str_hash_flags, 0); in bch2_hash_set()
Dbset.c49 * over keys that compare equal to our insert key, and then insert immediately
50 * prior to the first key greater than the key we're inserting - our insert
51 * position will be after all keys that compare equal to our insert key, which
52 * by the time we actually do the insert will all be deleted.
237 struct bkey_packed *insert, unsigned clobber_u64s) in bch2_verify_insert_pos() argument
246 bkey_iter_cmp(b, prev, insert) > 0); in bch2_verify_insert_pos()
249 bkey_iter_cmp(b, prev, insert) > 0) { in bch2_verify_insert_pos()
251 struct bkey k2 = bkey_unpack_key(b, insert); in bch2_verify_insert_pos()
257 panic("prev > insert:\n" in bch2_verify_insert_pos()
259 "insert key %s\n", in bch2_verify_insert_pos()
[all …]
Dio_misc.c358 bool insert = shift > 0; in __bch2_resume_logged_op_finsert() local
373 if (insert) { in __bch2_resume_logged_op_finsert()
409 k = insert in __bch2_resume_logged_op_finsert()
424 if (insert && in __bch2_resume_logged_op_finsert()
443 op->v.pos = cpu_to_le64(insert ? bkey_start_offset(&delete.k) : delete.k.p.offset); in __bch2_resume_logged_op_finsert()
463 if (!insert) { in __bch2_resume_logged_op_finsert()
490 u64 offset, u64 len, bool insert, in bch2_fcollapse_finsert() argument
494 s64 shift = insert ? len : -len; in bch2_fcollapse_finsert()
501 op.v.pos = cpu_to_le64(insert ? U64_MAX : offset); in bch2_fcollapse_finsert()
/linux-6.8/drivers/md/bcache/
Dextents.c228 struct bkey *insert, in bch_btree_ptr_insert_fixup() argument
234 if (!KEY_OFFSET(insert)) in bch_btree_ptr_insert_fixup()
324 struct bkey *insert, in bch_extent_insert_fixup() argument
333 BUG_ON(!KEY_OFFSET(insert)); in bch_extent_insert_fixup()
334 BUG_ON(!KEY_SIZE(insert)); in bch_extent_insert_fixup()
342 if (bkey_cmp(&START_KEY(k), insert) >= 0) { in bch_extent_insert_fixup()
349 if (bkey_cmp(k, &START_KEY(insert)) <= 0) in bch_extent_insert_fixup()
378 if (KEY_START(k) > KEY_START(insert) + sectors_found) in bch_extent_insert_fixup()
393 sectors_found = KEY_OFFSET(k) - KEY_START(insert); in bch_extent_insert_fixup()
396 if (bkey_cmp(insert, k) < 0 && in bch_extent_insert_fixup()
[all …]
/linux-6.8/tools/testing/selftests/cpufreq/
Dmodule.sh24 # insert module
42 # Insert cpufreq driver module and perform basic tests
43 # $1: cpufreq-driver module to insert
55 # insert module
85 # $1: cpufreq-driver module to insert
155 # Insert cpufreq governor module and perform basic tests
156 # $1: cpufreq-governor module to insert
171 # insert module
205 # TEST1: Insert gov after driver
206 # insert driver module
[all …]
/linux-6.8/drivers/net/wireguard/selftest/
Dallowedips.c460 #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.8/virt/kvm/
Dcoalesced_mmio.c70 __u32 insert; in coalesced_mmio_write() local
77 insert = READ_ONCE(ring->last); in coalesced_mmio_write()
78 if (!coalesced_mmio_has_room(dev, insert) || in coalesced_mmio_write()
79 insert >= KVM_COALESCED_MMIO_MAX) { in coalesced_mmio_write()
86 ring->coalesced_mmio[insert].phys_addr = addr; in coalesced_mmio_write()
87 ring->coalesced_mmio[insert].len = len; in coalesced_mmio_write()
88 memcpy(ring->coalesced_mmio[insert].data, val, len); in coalesced_mmio_write()
89 ring->coalesced_mmio[insert].pio = dev->zone.pio; in coalesced_mmio_write()
91 ring->last = (insert + 1) % KVM_COALESCED_MMIO_MAX; in coalesced_mmio_write()
/linux-6.8/drivers/accessibility/speakup/
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-6.8/fs/smb/server/
Dasn1.c67 /* insert tag */ in encode_asn_tag()
78 /* insert seq */ in encode_asn_tag()
111 /* insert main gss header */ in build_spnego_ntlmssp_neg_blob()
115 /* insert neg result */ in build_spnego_ntlmssp_neg_blob()
119 /* insert oid */ in build_spnego_ntlmssp_neg_blob()
124 /* insert response token - ntlmssp blob */ in build_spnego_ntlmssp_neg_blob()
147 /* insert main gss header */ in build_spnego_ntlmssp_auth_blob()
150 /* insert neg result */ in build_spnego_ntlmssp_auth_blob()
/linux-6.8/tools/testing/selftests/bpf/
Dtest_lru_map.c170 /* insert key=1 element */ in test_lru_sanity0()
183 /* insert key=2 element */ in test_lru_sanity0()
195 /* insert key=3 element */ in test_lru_sanity0()
234 * Insert 1 to tgt_free (+tgt_free keys)
236 * Insert 1+tgt_free to 2*tgt_free (+tgt_free keys)
268 /* Insert 1 to tgt_free (+tgt_free keys) */ in test_lru_sanity1()
282 /* Insert 1+tgt_free to 2*tgt_free in test_lru_sanity1()
304 * Insert 1 to tgt_free (+tgt_free keys)
308 * Re-insert 1 to tgt_free/2 again and do a lookup immeidately
309 * Insert 1+tgt_free to tgt_free*3/2
[all …]
/linux-6.8/tools/perf/scripts/python/
Dexport-to-sqlite.py573 evsel_query.prepare("INSERT INTO selected_events VALUES (?, ?)")
575 machine_query.prepare("INSERT INTO machines VALUES (?, ?, ?)")
577 thread_query.prepare("INSERT INTO threads VALUES (?, ?, ?, ?, ?)")
579 comm_query.prepare("INSERT INTO comms VALUES (?, ?, ?, ?, ?)")
581 comm_thread_query.prepare("INSERT INTO comm_threads VALUES (?, ?, ?)")
583 dso_query.prepare("INSERT INTO dsos VALUES (?, ?, ?, ?, ?)")
585 symbol_query.prepare("INSERT INTO symbols VALUES (?, ?, ?, ?, ?, ?)")
587 branch_type_query.prepare("INSERT INTO branch_types VALUES (?, ?)")
590 …sample_query.prepare("INSERT INTO samples VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, …
592 …sample_query.prepare("INSERT INTO samples VALUES (?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, ?, …
[all …]
/linux-6.8/drivers/mmc/host/
Dsdhci-bcm-kona.c75 * insert-removal. in sdhci_bcm_kona_sd_reset()
100 * insert-removal. in sdhci_bcm_kona_sd_init()
107 * Software emulation of the SD card insertion/removal. Set insert=1 for insert
108 * and insert=0 for removal. The card detection is done by GPIO. For Broadcom
112 static int sdhci_bcm_kona_sd_card_emulate(struct sdhci_host *host, int insert) in sdhci_bcm_kona_sd_card_emulate() argument
122 * insert-removal. in sdhci_bcm_kona_sd_card_emulate()
129 if (insert) { in sdhci_bcm_kona_sd_card_emulate()
277 /* if device is eMMC, emulate card insert right here */ in sdhci_bcm_kona_probe()
/linux-6.8/tools/testing/selftests/tc-testing/plugin-lib/
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'])
/linux-6.8/include/linux/
Drbtree.h9 To use rbtrees you'll have to implement your own insert and search cores.
157 * rb_add_cached() - insert @node into the leftmost cached tree @tree
158 * @node: node to insert
159 * @tree: leftmost cached tree to insert @node into
189 * rb_add() - insert @node into @tree
190 * @node: node to insert
191 * @tree: tree to insert @node into
215 * @node: node to look-for / insert
/linux-6.8/Documentation/process/
Demail-clients.rst90 to insert into the message.
97 To insert a patch use :menuselection:`Message-->Insert File` (:kbd:`CTRL-I`)
115 :menuselection:`Insert-->Text File...` (:kbd:`ALT-N x`)
116 to insert the patch.
141 :menuselection:`insert file` and choose your patch.
143 and put the :menuselection:`insert file` icon there.
185 an :menuselection:`insert file` option that inserts the contents of a file
196 before middle button or shift-insert or use::
339 Works. Use "Insert file..." or external editor.
/linux-6.8/fs/jfs/
Djfs_xtree.c534 * search for the entry location at which to insert: in xtInsert()
537 * pinned, index at which to insert). in xtInsert()
574 * insert entry for new extent in xtInsert()
582 * The xtSplitUp() will insert the entry and unpin the leaf page. in xtInsert()
607 * insert the new entry into the leaf page in xtInsert()
616 /* if insert into middle, shift right remaining entries. */ in xtInsert()
621 /* insert the new entry: mark the entry NEW */ in xtInsert()
704 /* if insert into middle, shift right remaining entries. */ in xtSplitUp()
711 /* insert the new entry: mark the entry NEW */ in xtSplitUp()
765 * The split routines insert the new entry into the leaf page, in xtSplitUp()
[all …]
/linux-6.8/tools/include/linux/
Drbtree.h9 To use rbtrees you'll have to implement your own insert and search cores.
172 * rb_add_cached() - insert @node into the leftmost cached tree @tree
173 * @node: node to insert
174 * @tree: leftmost cached tree to insert @node into
200 * rb_add() - insert @node into @tree
201 * @node: node to insert
202 * @tree: tree to insert @node into
226 * @node: node to look-for / insert
/linux-6.8/fs/notify/
Dnotification.c74 * The group can use the @insert hook to insert the event into hash table.
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.8/drivers/gpu/drm/i915/
DKconfig.debug56 bool "Always insert extra checks around mmio access by default"
69 bool "Insert extra checks into the GEM internals"
96 bool "Insert extra logging (very verbose) for common GEM errors"
108 bool "Insert extra ftrace output from the GEM internals"
122 bool "Insert extra ftrace output from the GTT internals"
/linux-6.8/lib/
Drbtree_test.c32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() function
261 insert(nodes + j, &root); in rbtree_test_init()
270 printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n", in rbtree_test_init()
286 printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n", in rbtree_test_init()
290 insert(nodes + i, &root); in rbtree_test_init()
337 insert(nodes + j, &root); in rbtree_test_init()
363 printk(" -> test 1 (latency of nnodes insert+delete): %llu cycles\n", (unsigned long long)time); in rbtree_test_init()
378 …printk(" -> test 2 (latency of nnodes cached insert+delete): %llu cycles\n", (unsigned long long)t… in rbtree_test_init()
/linux-6.8/fs/ocfs2/
Dalloc.c83 * If this extent tree is supported by an extent map, insert
590 * Tree depth may change during truncate, or insert. If we're in ocfs2_reinit_path()
659 * Insert an extent block at given index.
671 * safely removed if we ever need to insert extent block in ocfs2_path_insert_eb()
2036 * - When our insert into the right path leaf is at the leftmost edge
2363 * - In the case that the rotation requires a post-insert update,
2438 "Owner %llu: error during insert of %u " in ocfs2_rotate_tree_right()
2458 * before the record insert is that an error in ocfs2_rotate_tree_right()
2496 * instead of a real insert, then we have to in ocfs2_rotate_tree_right()
3705 * Since the leftright insert always covers the entire in ocfs2_try_to_merge_extent()
[all …]

12345678910>>...65