Home
last modified time | relevance | path

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

12345678910>>...53

/linux/fs/bcachefs/
H A Ddata_update.c96 struct bkey_i *insert) in trace_move_extent_finish2() argument
110 prt_str_indented(&buf, "insert:\t"); in trace_move_extent_finish2()
111 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert)); in trace_move_extent_finish2()
121 struct bkey_i *insert, in trace_move_extent_fail2() argument
134 if (insert) { in trace_move_extent_fail2()
142 (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) && in trace_move_extent_fail2()
164 if (insert) { in trace_move_extent_fail2()
166 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert)); in trace_move_extent_fail2()
195 struct bkey_i *insert = NULL; in __bch2_data_update_index_update() local
223 insert = _insert.k; in __bch2_data_update_index_update()
[all …]
H A Dbtree_update.c34 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_max(&iter, POS(insert->k.p.inode, U64_MAX)); in bch2_trans_update_extent()
[all …]
H 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()
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 …]
H 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_max_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()
H A Dbtree_trans_commit.c98 * a new bset to insert into: in bch2_btree_node_prep_for_write()
148 /* Inserting into a given leaf node (last stage of insert): */
150 /* Handle overwrites and do insert, for non extents: */
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()
[all …]
H A 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.
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()
261 panic("prev > insert:\n" in bch2_verify_insert_pos()
263 "insert key %s\n", in bch2_verify_insert_pos()
[all …]
H A Dio_misc.c369 bool insert = shift > 0; in __bch2_resume_logged_op_finsert() local
394 if (insert) { in __bch2_resume_logged_op_finsert()
430 k = insert in __bch2_resume_logged_op_finsert()
445 if (insert && in __bch2_resume_logged_op_finsert()
464 op->v.pos = cpu_to_le64(insert ? bkey_start_offset(&delete.k) : delete.k.p.offset); in __bch2_resume_logged_op_finsert()
484 if (!insert) { in __bch2_resume_logged_op_finsert()
512 u64 offset, u64 len, bool insert, in bch2_fcollapse_finsert() argument
516 s64 shift = insert ? len : -len; in bch2_fcollapse_finsert()
523 op.v.pos = cpu_to_le64(insert ? U64_MAX : offset); in bch2_fcollapse_finsert()
/linux/drivers/md/bcache/
H A Dextents.c229 struct bkey *insert, in bch_btree_ptr_insert_fixup() argument
235 if (!KEY_OFFSET(insert)) in bch_btree_ptr_insert_fixup()
331 struct bkey *insert, in bch_extent_insert_fixup() argument
340 BUG_ON(!KEY_OFFSET(insert)); in bch_extent_insert_fixup()
341 BUG_ON(!KEY_SIZE(insert)); in bch_extent_insert_fixup()
349 if (bkey_cmp(&START_KEY(k), insert) >= 0) { in bch_extent_insert_fixup()
356 if (bkey_cmp(k, &START_KEY(insert)) <= 0) in bch_extent_insert_fixup()
385 if (KEY_START(k) > KEY_START(insert) + sectors_found) in bch_extent_insert_fixup()
400 sectors_found = KEY_OFFSET(k) - KEY_START(insert); in bch_extent_insert_fixup()
403 if (bkey_cmp(insert, k) < 0 && in bch_extent_insert_fixup()
[all …]
/linux/tools/testing/selftests/cpufreq/
H A Dmodule.sh24 # insert module
40 # Insert cpufreq driver module and perform basic tests
41 # $1: cpufreq-driver module to insert
53 # insert module
83 # $1: cpufreq-driver module to insert
153 # Insert cpufreq governor module and perform basic tests
154 # $1: cpufreq-governor module to insert
169 # insert module
203 # TEST1: Insert gov after driver
204 # insert driver module
[all …]
/linux/virt/kvm/
H 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/drivers/accessibility/speakup/
H 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/testing/selftests/bpf/
H A Dtest_lru_map.c171 /* insert key=1 element */ in test_lru_sanity0()
184 /* insert key=2 element */ in test_lru_sanity0()
196 /* insert key=3 element */ in test_lru_sanity0()
235 * Insert 1 to tgt_free (+tgt_free keys)
237 * Insert 1+tgt_free to 2*tgt_free (+tgt_free keys)
269 /* Insert 1 to tgt_free (+tgt_free keys) */ in test_lru_sanity1()
283 /* Insert 1+tgt_free to 2*tgt_free in test_lru_sanity1()
305 * Insert 1 to tgt_free (+tgt_free keys)
309 * Re-insert 1 to tgt_free/2 again and do a lookup immeidately
310 * Insert 1+tgt_free to tgt_free*3/2
[all …]
/linux/fs/smb/server/
H A 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/tools/perf/scripts/python/
H A 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 …]
H A Devent_analyzing_sample.py33 # If the perf.data has a big number of samples, then the insert operation
70 # Create and insert event object to a database so that user could
91 # Create the event object and insert it to the right table in database
97 con.execute("insert into gen_events values(?, ?, ?, ?)",
102 con.execute("insert into pebs_ll values (?, ?, ?, ?, ?, ?, ?, ?, ?, ?)",
/linux/tools/testing/selftests/tc-testing/plugin-lib/
H 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'])
/linux/tools/perf/util/
H 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()
/linux/include/linux/
H A 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
252 * @node: node to look-for / insert
286 * @node: node to look-for / insert
/linux/fs/jfs/
H A 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/tools/include/linux/
H A 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/fs/notify/
H A 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/drivers/gpu/drm/i915/
H A DKconfig.debug74 bool "Always insert extra checks around mmio access by default"
87 bool "Insert extra checks into the GEM internals"
114 bool "Insert extra logging (very verbose) for common GEM errors"
126 bool "Insert extra ftrace output from the GEM internals"
140 bool "Insert extra ftrace output from the GTT internals"
/linux/drivers/infiniband/core/
H A Dib_core_uverbs.c224 * @entry: the entry to insert into the mmap_xa
243 * rdma_user_mmap_entry_insert_range() - Insert an entry to the mmap_xa
247 * @entry: the entry to insert into the mmap_xa
254 * handled in the core and helper functions are provided to insert entries
344 * rdma_user_mmap_entry_insert() - Insert an entry to the mmap_xa.
347 * @entry: the entry to insert into the mmap_xa
352 * the core and helper functions are provided to insert entries into the
/linux/drivers/atm/
H A Dsuni.h150 #define SUNI_TSOP_CTRL_LAIS 0x01 /* insert alarm indication signal */
154 #define SUNI_TSOP_DIAG_DFP 0x01 /* insert single bit error cont. */
155 #define SUNI_TSOP_DIAG_DBIP8 0x02 /* insert section BIP err (cont) */
159 #define SUNI_TLOP_DIAG_DBIP 0x01 /* insert line BIP err (continuously) */
168 #define SUNI_TPOP_DIAG_PAIS 0x01 /* insert STS path alarm ind (cont) */
169 #define SUNI_TPOP_DIAG_DB3 0x02 /* insert path BIP err (continuously) */
199 #define SUNI_TACP_CS_DHCS 0x10 /* RW, insert HCS errors */
/linux/sound/core/seq/oss/
H A Dseq_oss_rw.c134 /* insert queue */ in snd_seq_oss_write()
148 * insert event record to write queue
159 return 0; /* no need to insert queue */ in insert_queue()
168 return 0; /* invalid event - no need to insert queue */ in insert_queue()

12345678910>>...53