/linux-master/mm/ |
H A D | vmalloc.c | 1378 goto insert; 1432 insert: 2515 * This technique almost always avoids lock contention on insert/remove, 4637 /* we've found a fitting base, insert all va's */ 4669 /* insert all vm's */
|
H A D | internal.h | 1319 struct vm_area_struct *insert; member in struct:vma_prepare
|
/linux-master/net/ipv4/ |
H A D | tcp_input.c | 4984 goto insert; 4987 /* Find place to insert this segment. Handle overlaps on the way. */ 5031 insert:
|
/linux-master/fs/bcachefs/ |
H A D | io_write.c | 537 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 D | btree_key_cache.c | 764 struct bkey_i *insert = insert_entry->k; local 767 BUG_ON(insert->k.u64s > ck->u64s); 769 bkey_copy(ck->k, insert);
|
H A D | backpointers.h | 77 bool insert) 80 return bch2_bucket_backpointer_mod_nowritebuffer(trans, bucket, bp, orig_k, insert); 88 if (!insert) { 73 bch2_bucket_backpointer_mod(struct btree_trans *trans, struct bpos bucket, struct bch_backpointer bp, struct bkey_s_c orig_k, bool insert) argument
|
H A D | backpointers.c | 100 bool insert) 105 if (insert) { 151 bool insert) 167 if (!insert) { 181 if (insert 185 ret = backpointer_mod_err(trans, bp, k, orig_k, insert); 96 backpointer_mod_err(struct btree_trans *trans, struct bch_backpointer bp, struct bkey_s_c bp_k, struct bkey_s_c orig_k, bool insert) argument 147 bch2_bucket_backpointer_mod_nowritebuffer(struct btree_trans *trans, struct bpos bucket, struct bch_backpointer bp, struct bkey_s_c orig_k, bool insert) argument
|
H A D | buckets.c | 821 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);
|
H A D | btree_update_interior.c | 742 * @b is the node we did the final insert into: 921 struct bkey_i *insert = &b->key; local 926 BUG_ON(as->journal_u64s + jset_u64s(insert->k.u64s) > 933 insert, insert->k.u64s); 1353 struct bkey_i *insert) 1360 BUG_ON(insert->k.type == KEY_TYPE_btree_ptr_v2 && 1361 !btree_ptr_sectors_written(insert)); 1364 bch2_journal_key_overwritten(c, b->c.btree_id, b->c.level, insert->k.p); 1366 if (bch2_bkey_invalid(c, bkey_i_to_s_c(insert), 1348 bch2_insert_fixup_btree_ptr(struct btree_update *as, struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_i *insert) argument 1417 struct bkey_i *insert = bch2_keylist_front(keys); local [all...] |
H A D | fs-io.c | 172 * insert trigger: look up the btree inode instead 549 bool insert) 559 if (insert) { 571 if (insert) 575 insert, &i_sectors_delta); 576 if (!ret && !insert) 547 bchfs_fcollapse_finsert(struct bch_inode_info *inode, loff_t offset, loff_t len, bool insert) argument
|
H A D | btree_trans_commit.c | 76 * a new bset to insert into: 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) 139 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k)); 140 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); 141 EBUG_ON(bpos_gt(insert->k.p, b->data->max_key)); 142 EBUG_ON(insert->k.u64s > bch2_btree_keys_u64s_remaining(b)); 143 EBUG_ON(!b->c.level && !bpos_eq(insert 128 bch2_btree_bset_insert_key(struct btree_trans *trans, struct btree_path *path, struct btree *b, struct btree_node_iter *node_iter, struct bkey_i *insert) argument 264 bch2_btree_insert_key_leaf(struct btree_trans *trans, struct btree_path *path, struct bkey_i *insert, u64 journal_seq) argument [all...] |
H A D | tests.c | 125 bch_err_msg(c, ret, "insert error"); 180 bch_err_msg(c, ret, "insert error"); 236 bch_err_msg(c, ret, "insert error"); 296 bch_err_msg(c, ret, "insert error"); 710 struct bkey_i_cookie insert; local 712 bkey_cookie_init(&insert.k_i); 721 insert.k.p = iter.pos; 722 bch2_trans_update(trans, &iter, &insert.k_i, 0);
|
H A D | data_update.c | 35 struct bkey_i *insert, 51 if (insert) { 55 (ptr = bch2_extent_has_ptr(old, p, bkey_i_to_s(insert))) && 83 if (insert) { 85 bch2_bkey_val_to_text(&buf, c, bkey_i_to_s_c(insert)); 114 struct bkey_i *insert = NULL; local 142 insert = _insert.k; 148 bch2_cut_front(iter.pos, insert); 149 bch2_cut_back(new->k.p, insert); 150 bch2_cut_back(insert 32 trace_move_extent_fail2(struct data_update *m, struct bkey_s_c new, struct bkey_s_c wrote, struct bkey_i *insert, const char *msg) argument [all...] |
/linux-master/net/mptcp/ |
H A D | protocol.c | 254 goto insert; 257 /* Find place to insert this segment. Handle overlaps on the way. */ 296 insert:
|
/linux-master/drivers/spi/ |
H A D | spi.c | 3581 * @insert: the number of transfers we want to insert instead 3594 size_t insert, 3605 struct_size(rxfer, inserted_transfers, insert) 3617 &rxfer->inserted_transfers[insert]; 3661 for (i = 0; i < insert; i++) { 3663 xfer = &rxfer->inserted_transfers[insert - 1 - i]; 3679 rxfer->inserted = insert; 3590 spi_replace_transfers( struct spi_message *msg, struct spi_transfer *xfer_first, size_t remove, size_t insert, spi_replaced_release_t release, size_t extradatasize, gfp_t gfp) argument
|
/linux-master/fs/btrfs/ |
H A D | inode.c | 616 * conditionally insert an inline extent into the file. This 4920 * for. So if we are truncating this file to a larger size we need to insert 5312 * This drops any pending insert or delete operations we have for this 6481 * if 'add_backref' is true, also insert a backref from the 6944 goto insert; 6951 goto insert; 6973 goto insert; 6980 insert:
|
H A D | extent-tree.c | 774 * if insert is true and there are too many inline back refs, the path 786 u64 owner, u64 offset, int insert) 810 if (insert) { 855 if (ret && !insert) { 861 "extent item not found for insert, bytenr %llu num_bytes %llu parent %llu root_objectid %llu owner %llu offset %llu", 958 if (ret == -ENOENT && insert) { 979 if (insert) { 1509 /* this will setup the path even if it fails to insert the back ref */ 1517 * Ok we had -EAGAIN which means we didn't have space to insert and 1532 /* now insert th 781 lookup_inline_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_path *path, struct btrfs_extent_inline_ref **ref_ret, u64 bytenr, u64 num_bytes, u64 parent, u64 root_objectid, u64 owner, u64 offset, int insert) argument [all...] |
/linux-master/net/netfilter/ |
H A D | nft_set_pipapo.c | 116 * - insert references to the rules in the lookup table, selecting buckets 1098 * pipapo_expand() - Expand to composing netmasks, insert into lookup table 1104 * Expand range to composing netmasks and insert corresponding rule references 1251 * nft_pipapo_insert() - Validate and insert ranged elements 2379 .insert = nft_pipapo_insert, 2403 .insert = nft_pipapo_insert,
|
H A D | nft_set_rbtree.c | 320 * key value to insert that is greater than the new element. This is the 761 .insert = nft_rbtree_insert,
|
H A D | nft_set_hash.c | 154 /* 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,
|
H A D | nft_set_bitmap.c | 304 .insert = nft_bitmap_insert,
|
H A D | nf_tables_api.c | 6644 ret = set->ops->insert(net, set, elem, elem_priv);
|
/linux-master/include/net/netfilter/ |
H A D | nf_tables.h | 434 * @insert: insert new element into set 471 int (*insert)(const struct net *net, member in struct:nft_set_ops
|
/linux-master/drivers/iommu/intel/ |
H A D | iommu.c | 3203 int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert) argument 3213 if (insert) {
|
/linux-master/drivers/net/ethernet/mellanox/mlx5/core/ |
H A D | en_tx.c | 482 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));
|