Home
last modified time | relevance | path

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

12345678910>>...51

/linux/drivers/md/bcache/
H A 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/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/rust/kernel/
H A Dmaple_tree.rs91 /// Insert the value at the given index.
110 /// tree.insert(100, ten, GFP_KERNEL)?;
111 /// tree.insert(101, twenty, GFP_KERNEL)?;
115 /// tree.insert(100, the_answer, GFP_KERNEL).unwrap_err().cause,
121 pub fn insert(&self, index: usize, value: T, gfp: Flags) -> Result<(), InsertError<T>> { in insert() method
125 /// Insert a value to the specified range, failing on overlap.
149 /// // Insert the value 10 at the indices 100 to 499.
152 /// // Insert the value 20 at the indices 500 to 1000.
217 /// tree.insert(67, twenty, GFP_KERNEL)?;
333 /// tree.insert(100, ten, GFP_KERNEL)?;
[all …]
H A Drbtree.rs32 /// // Insert three elements.
96 /// In the example below, we first allocate a node, acquire a spinlock, then insert the node into
107 /// // Insert node while holding the lock. It is guaranteed to succeed with no allocation
110 /// guard.insert(node);
123 /// // Insert three elements.
151 /// // Insert a new node into the tree, reusing the previous allocation. This is guaranteed to
153 /// tree.insert(reservation.into_node(15, 150));
280 /// Tries to insert a new value into the tree.
292 Ok(self.insert(RBTreeNode::new(key, value, flags)?)) in try_create_and_insert()
301 pub fn insert(&mut self, node: RBTreeNode<K, V>) -> Option<RBTreeNode<K, V>> { in insert() function
[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/drivers/mmc/host/
H A 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/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/bpf/
H A Dtest_lru_map.c183 /* insert key=1 element */ in test_lru_sanity0()
196 /* insert key=2 element */ in test_lru_sanity0()
208 /* insert key=3 element */ in test_lru_sanity0()
247 * Insert elements.
249 * Insert more, enough to trigger recycling.
281 /* Insert map_size - batch_size keys */ in test_lru_sanity1()
295 /* Insert another map_size - batch_size keys in test_lru_sanity1()
350 /* Insert map_size - batch_size keys */ in test_lru_sanity2()
376 /* Re-insert 1 to batch_size again and do a lookup immediately. in test_lru_sanity2()
392 /* Insert batch_size new elements */ in test_lru_sanity2()
[all …]
/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/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/tools/perf/util/
H A Dcomm.c169 int insert = comm_strs->num_strs; /* Default to inserting at the end. */ in comm_strs__findnew() local
179 insert = mid; in comm_strs__findnew()
182 memmove(&comm_strs->strs[insert + 1], &comm_strs->strs[insert], in comm_strs__findnew()
183 (comm_strs->num_strs - insert) * sizeof(struct comm_str *)); in comm_strs__findnew()
185 comm_strs->strs[insert] = result; in comm_strs__findnew()
/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/fs/ocfs2/
H A 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()
2044 * - When our insert into the right path leaf is at the leftmost edge
2371 * - In the case that the rotation requires a post-insert update,
2446 "Owner %llu: error during insert of %u " in ocfs2_rotate_tree_right()
2466 * before the record insert is that an error in ocfs2_rotate_tree_right()
2504 * instead of a real insert, then we have to in ocfs2_rotate_tree_right()
3713 * Since the leftright insert always covers the entire in ocfs2_try_to_merge_extent()
[all …]
/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()
/linux/tools/testing/selftests/net/forwarding/
H A Dtc_chains.sh135 check_err $? "Failed to insert filter which fits template"
139 check_fail $? "Incorrectly succeeded to insert filter which does not template"
143 check_err $? "Failed to insert filter which fits template"
147 check_fail $? "Incorrectly succeeded to insert filter which does not template"
/linux/arch/powerpc/mm/book3s64/
H A Dhash_64k.c65 * a write access. Since this is 4K insert of 64K page size in __hash_page_4K()
105 * On hash insert failure we use old pte value and we don't in __hash_page_4K()
106 * want slot information there if we have a insert failure. in __hash_page_4K()
161 /* Insert into the hash table, primary slot */ in __hash_page_4K()
297 /* Insert into the hash table, primary slot */ in __hash_page_64K()
/linux/drivers/net/ethernet/intel/ixgbevf/
H A Ddefines.h182 #define IXGBE_TXD_POPTS_IXSM 0x01 /* Insert IP checksum */
183 #define IXGBE_TXD_POPTS_TXSM 0x02 /* Insert TCP/UDP checksum */
185 #define IXGBE_TXD_CMD_IFCS 0x02000000 /* Insert FCS (Ethernet CRC) */
186 #define IXGBE_TXD_CMD_IC 0x04000000 /* Insert Checksum */
251 #define IXGBE_ADVTXD_DCMD_IFCS IXGBE_TXD_CMD_IFCS /* Insert FCS */
/linux/include/uapi/linux/
H A Dfalloc.h47 * FALLOC_FL_INSERT_RANGE is use to insert space within the file size without
57 * Attempting to insert space using this flag at OR beyond the end of
77 * insert range modes.
/linux/drivers/md/dm-vdo/
H A Dint-map.h18 * The map is implemented as hash table, which should provide constant-time insert, query, and
19 * remove operations, although the insert may occasionally grow the table, which is linear in the

12345678910>>...51