Searched refs:insert (Results 51 - 75 of 105) sorted by relevance

12345

/linux-master/drivers/net/dsa/ocelot/
H A Dfelix_vsc9959.c1991 u32 insert = 0; local
2008 if (tmp->index == insert) {
2010 insert++;
2013 sfi->index = insert;
2025 u32 insert = 0; local
2034 if (tmp->index >= insert + 2)
2037 insert = tmp->index + 1;
2040 sfi->index = insert;
2046 sfi2->index = insert + 1;
/linux-master/mm/
H A Dmemblock.c543 * memblock_insert_region - insert new memblock region
544 * @type: memblock type to insert into
592 bool insert = false; local
616 * that there is enough empty regions in @type, and we can insert
620 insert = true;
624 * The following is executed twice. Once with %false @insert and
641 * area, insert that portion.
649 if (insert) {
662 /* insert the remaining portion */
665 if (insert) {
[all...]
H A Dmmap.c477 if (vp->insert && vp->insert->vm_file) {
481 * throughout; but we cannot insert into address
484 __vma_link_file(vp->insert,
485 vp->insert->vm_file->f_mapping);
529 } else if (vp->insert) {
531 * split_vma has split insert from vma, and needs
532 * us to insert it before dropping the locks
535 vma_iter_store(vmi, vp->insert);
580 if (vp->insert
[all...]
/linux-master/fs/bcachefs/
H A Dio_write.c537 struct bkey_i *insert = bch2_keylist_front(&op->insert_keys); local
540 insert->k.p.inode, insert->k.p.offset << 9,
1178 struct bkey_i *insert = bch2_keylist_front(&op->insert_keys); local
1181 insert->k.p.inode, insert->k.p.offset << 9,
H A Dbset.h67 * So we need to construct some sort of lookup table. Since we only insert keys
139 * whenever we insert another key into it. For the unwritten set, we use a much
144 * These are much easier to keep up to date when we insert a key - we do it
532 struct bkey_packed *insert,
H A Dbtree_key_cache.c764 struct bkey_i *insert = insert_entry->k; local
767 BUG_ON(insert->k.u64s > ck->u64s);
769 bkey_copy(ck->k, insert);
H A Dbuckets.c821 bool insert = !(flags & BTREE_TRIGGER_OVERWRITE); local
826 *sectors = insert ? bp.bucket_len : -((s64) bp.bucket_len);
845 ret = bch2_bucket_backpointer_mod(trans, bucket, bp, k, insert);
/linux-master/include/linux/mlx5/
H A Dqp.h280 } insert; member in union:mlx5_wqe_eth_seg::__anon174
/linux-master/net/netfilter/
H A Dnft_set_bitmap.c304 .insert = nft_bitmap_insert,
H A Dnft_set_hash.c154 /* Another cpu may race to insert the element with the same key */
744 .insert = nft_rhash_insert,
765 .insert = nft_hash_insert,
784 .insert = nft_hash_insert,
/linux-master/arch/m68k/ifpsp060/src/
H A Dfpsp.S1152 # _fpsp_done(). If there is an enabled FP exception, then we insert #
1367 bra.w fu_in_exc_ovfl # go insert overflow frame
1395 # here, we insert the correct fsave status value into the fsave frame for the
1457 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1489 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1658 # we don't mess with the existing fsave frame. just re-insert it and
1973 # here, we insert the correct fsave status value into the fsave frame for the
2321 mov.l %d1,FP_SRC_HI(%a6) # insert new hi(man)
2323 ori.w &0x3f80,FP_SRC_EX(%a6) # insert new "skewed" exponent
2336 mov.w %d0,FP_SRC_EX(%a6) # insert exponen
[all...]
H A Dpfpsp.S1151 # _fpsp_done(). If there is an enabled FP exception, then we insert #
1366 bra.w fu_in_exc_ovfl # go insert overflow frame
1394 # here, we insert the correct fsave status value into the fsave frame for the
1456 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1488 or.w %d0,LOCAL_EX(%a0) # insert new exponent
1657 # we don't mess with the existing fsave frame. just re-insert it and
1972 # here, we insert the correct fsave status value into the fsave frame for the
2320 mov.l %d1,FP_SRC_HI(%a6) # insert new hi(man)
2322 ori.w &0x3f80,FP_SRC_EX(%a6) # insert new "skewed" exponent
2335 mov.w %d0,FP_SRC_EX(%a6) # insert exponen
[all...]
/linux-master/fs/xfs/
H A Dxfs_log_cil.c491 goto insert;
514 goto insert;
520 insert:
662 * and insert items into the CIL if they aren't already there.
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/
H A Den_tx.c482 eseg->insert.type = cpu_to_be16(MLX5_ETH_WQE_INSERT_VLAN);
484 eseg->insert.type |= cpu_to_be16(MLX5_ETH_WQE_SVLAN);
485 eseg->insert.vlan_tci = cpu_to_be16(skb_vlan_tag_get(skb));
/linux-master/arch/arm/mm/
H A Dproc-v6.S111 orr r1, r1, r2 @ insert into new context ID
/linux-master/drivers/gpu/drm/i915/gem/
H A Di915_gem_mman.c691 goto insert;
705 insert:
/linux-master/tools/testing/selftests/tc-testing/
H A Dtdc.py68 self.plugin_instances.insert(0, (pgname, foo.SubPlugin()))
611 batches.insert(0, serial)
/linux-master/arch/mips/include/asm/
H A Dasmmacro.h362 insert.w $w\wd[\n], $1
371 insert.d $w\wd[\n], $1
/linux-master/drivers/md/bcache/
H A Dbtree.c1396 * nodes, to make sure the insert below will succeed - we also check
2170 replace_key ? "replace" : "insert");
2430 struct keylist insert; local
2433 bch_keylist_init(&insert);
2451 bch_keylist_add(&insert, check_key);
2453 ret = bch_btree_insert_node(b, op, &insert, NULL, NULL);
2455 BUG_ON(!ret && !bch_keylist_empty(&insert));
/linux-master/drivers/md/persistent-data/
H A Ddm-btree.c97 DMERR("too many entries in btree node for insert");
115 * insert remove loops than (2n + 1).
1075 * node on the spine when doing an insert. But we can avoid that with
1234 static int insert(struct dm_btree_info *info, dm_block_t root,
1325 return insert(info, root, keys, value, new_root, NULL);
1334 return insert(info, root, keys, value, new_root, inserted);
/linux-master/sound/soc/codecs/
H A Dnau8824.c815 bool insert = false; local
818 insert = jack->status & SND_JACK_HEADPHONE;
820 return insert;
1620 * After this function has been called the headset insert/remove and button
/linux-master/drivers/scsi/aacraid/
H A Dlinit.c1581 struct list_head *insert = &aac_devices; local
1597 insert = &aac->entry;
1758 list_add(&aac->entry, insert);
/linux-master/drivers/net/dsa/realtek/
H A Drtl8365mb.c595 * @insert: CPU tag insertion mode in switch->CPU frames
607 enum rtl8365mb_cpu_insert insert; member in struct:rtl8365mb_cpu
1845 FIELD_PREP(RTL8365MB_CPU_CTRL_INSERTMODE_MASK, cpu->insert) |
2101 mb->cpu.insert = RTL8365MB_CPU_INSERT_TO_ALL;
/linux-master/fs/btrfs/
H A Dfree-space-tree.c752 * the key we found and insert a new key representing the leftover at
755 * we found and insert a new key representing the leftover at the
758 * found and insert two new keys representing the leftovers on each
889 * previous key and insert a new key combining both of them. There is no
892 * key and insert a new key combining both of them. There is no net
895 * of the keys and insert a new key combining all of them. Where we used
945 goto insert;
959 goto insert;
982 insert:
/linux-master/drivers/hid/
H A Dwacom_sys.c92 bool insert = false; local
139 insert = true;
146 else if (insert)
150 return insert && !flush;

Completed in 388 milliseconds

12345