/linux-master/virt/kvm/ |
H A D | coalesced_mmio.c | 70 __u32 insert; local 77 insert = READ_ONCE(ring->last); 78 if (!coalesced_mmio_has_room(dev, insert) || 79 insert >= KVM_COALESCED_MMIO_MAX) { 86 ring->coalesced_mmio[insert].phys_addr = addr; 87 ring->coalesced_mmio[insert].len = len; 88 memcpy(ring->coalesced_mmio[insert].data, val, len); 89 ring->coalesced_mmio[insert].pio = dev->zone.pio; 91 ring->last = (insert + 1) % KVM_COALESCED_MMIO_MAX;
|
/linux-master/drivers/md/bcache/ |
H A D | extents.c | 228 struct bkey *insert, 234 if (!KEY_OFFSET(insert)) 324 struct bkey *insert, 333 BUG_ON(!KEY_OFFSET(insert)); 334 BUG_ON(!KEY_SIZE(insert)); 342 if (bkey_cmp(&START_KEY(k), insert) >= 0) { 349 if (bkey_cmp(k, &START_KEY(insert)) <= 0) 378 if (KEY_START(k) > KEY_START(insert) + sectors_found) 393 sectors_found = KEY_OFFSET(k) - KEY_START(insert); 396 if (bkey_cmp(insert, 227 bch_btree_ptr_insert_fixup(struct btree_keys *bk, struct bkey *insert, struct btree_iter *iter, struct bkey *replace_key) argument 323 bch_extent_insert_fixup(struct btree_keys *b, struct bkey *insert, struct btree_iter *iter, struct bkey *replace_key) argument [all...] |
/linux-master/fs/bcachefs/ |
H A D | extent_update.c | 107 struct bkey_i *insert, 119 *end = insert->k.p; 124 ret = count_iters_for_insert(trans, bkey_i_to_s_c(insert), 0, end, 131 for_each_btree_key_upto_continue_norestart(copy, insert->k.p, 0, k, ret) { 134 if (bkey_gt(bkey_start_pos(&insert->k), bkey_start_pos(k.k))) 135 offset = bkey_start_offset(&insert->k) - 139 switch (bch2_extent_overlap(&insert->k, k.k)) { 105 bch2_extent_atomic_end(struct btree_trans *trans, struct btree_iter *iter, struct bkey_i *insert, struct bpos *end) argument
|
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...] |
H A D | str_hash.h | 266 struct bkey_i *insert, 276 SPOS(insert->k.p.inode, 277 desc.hash_bkey(info, bkey_i_to_s_c(insert)), 279 POS(insert->k.p.inode, U64_MAX), 282 if (!desc.cmp_bkey(k, bkey_i_to_s_c(insert))) 316 insert->k.p = iter.pos; 317 ret = bch2_trans_update(trans, &iter, insert, update_flags); 328 struct bkey_i *insert, 331 insert->k.p.inode = inum.inum; 336 snapshot, insert, str_hash_flag 262 bch2_hash_set_in_snapshot(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, subvol_inum inum, u32 snapshot, struct bkey_i *insert, bch_str_hash_flags_t str_hash_flags, int update_flags) argument 324 bch2_hash_set(struct btree_trans *trans, const struct bch_hash_desc desc, const struct bch_hash_info *info, subvol_inum inum, struct bkey_i *insert, bch_str_hash_flags_t str_hash_flags) argument [all...] |
H A D | btree_update.c | 34 struct bkey_i **insert, 49 if (!bch2_bkey_merge(c, bkey_i_to_s(update), bkey_i_to_s_c(*insert))) 53 bch2_key_has_snapshot_overwrites(trans, iter->btree_id, (*insert)->k.p); 63 *insert = update; 69 struct bkey_i *insert, 78 ret = bch2_key_has_snapshot_overwrites(trans, iter->btree_id, insert->k.p) ?: 85 bch2_bkey_merge(c, bkey_i_to_s(insert), k); 287 struct bkey_i *insert, 295 bch2_trans_iter_init(trans, &iter, btree_id, bkey_start_pos(&insert->k), 299 k = bch2_btree_iter_peek_upto(&iter, POS(insert 31 extent_front_merge(struct btree_trans *trans, struct btree_iter *iter, struct bkey_s_c k, struct bkey_i **insert, enum btree_update_flags flags) argument 67 extent_back_merge(struct btree_trans *trans, struct btree_iter *iter, struct bkey_i *insert, struct bkey_s_c k) argument 285 bch2_trans_update_extent(struct btree_trans *trans, struct btree_iter *orig_iter, struct bkey_i *insert, enum btree_update_flags flags) argument [all...] |
H A D | backpointers.h | 71 bool insert) 74 return bch2_bucket_backpointer_mod_nowritebuffer(trans, bucket, bp, orig_k, insert); 82 if (!insert) { 67 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 | io_misc.c | 359 bool insert = shift > 0; local 374 if (insert) { 410 k = insert 425 if (insert && 444 op->v.pos = cpu_to_le64(insert ? bkey_start_offset(&delete.k) : delete.k.p.offset); 464 if (!insert) { 492 u64 offset, u64 len, bool insert, 496 s64 shift = insert ? len : -len; 503 op.v.pos = cpu_to_le64(insert ? U64_MAX : offset); 491 bch2_fcollapse_finsert(struct bch_fs *c, subvol_inum inum, u64 offset, u64 len, bool insert, s64 *i_sectors_delta) argument
|
/linux-master/drivers/net/wireguard/selftest/ |
H A D | allowedips.c | 460 #define insert(version, mem, ipa, ipb, ipc, ipd, cidr) \ macro 513 insert(4, a, 192, 168, 4, 0, 24); 514 insert(4, b, 192, 168, 4, 4, 32); 515 insert(4, c, 192, 168, 0, 0, 16); 516 insert(4, d, 192, 95, 5, 64, 27); 518 insert(4, c, 192, 95, 5, 65, 27); 519 insert(6, d, 0x26075300, 0x60006b00, 0, 0xc05f0543, 128); 520 insert(6, c, 0x26075300, 0x60006b00, 0, 0, 64); 521 insert(4, e, 0, 0, 0, 0, 0); 522 insert( 677 #undef insert macro [all...] |
/linux-master/drivers/comedi/drivers/ni_routing/tools/ |
H A D | make_blank_csv.py | 21 fieldnames.insert(0, CSVCollection.source_column_name)
|
H A D | convert_py_to_csv.py | 24 fieldnames.insert(0, CSVCollection.source_column_name)
|
/linux-master/include/linux/netfilter/ |
H A D | nf_conntrack_common.h | 11 unsigned int insert; member in struct:ip_conntrack_stat
|
/linux-master/scripts/gdb/ |
H A D | vmlinux-gdb.py | 16 sys.path.insert(0, os.path.dirname(os.path.abspath(__file__)) + "/scripts/gdb")
|
/linux-master/tools/testing/selftests/tc-testing/plugin-lib/ |
H A D | valgrindPlugin.py | 84 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'])
|
H A D | nsPlugin.py | 102 cmdlist.insert(0, self.args.NAMES['NS']) 103 cmdlist.insert(0, 'exec') 104 cmdlist.insert(0, 'netns') 105 cmdlist.insert(0, self.args.NAMES['IP'])
|
/linux-master/tools/testing/selftests/timers/ |
H A D | leap-a-day.c | 7 * This test signals the kernel to insert a leap second 184 int insert = 1; local 261 /* Set the leap second insert flag */ 263 if (insert) 320 if (insert) 360 insert = !insert;
|
/linux-master/fs/notify/ |
H A D | notification.c | 74 * The group can use the @insert hook to insert the event into hash table. 85 void (*insert)(struct fsnotify_group *, 123 if (insert) 124 insert(group, event);
|
/linux-master/include/linux/ |
H A D | dmar.h | 146 extern int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert); 163 static inline int dmar_iommu_hotplug(struct dmar_drhd_unit *dmaru, bool insert) argument 170 extern int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert); 172 static inline int dmar_ir_hotplug(struct dmar_drhd_unit *dmaru, bool insert) argument
|
H A D | btree-type.h | 44 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, function 87 static inline int BTREE_FN(insert)(BTREE_TYPE_HEAD *head, BTREE_KEYTYPE key, function
|
H A D | binfmts.h | 103 extern void __register_binfmt(struct linux_binfmt *fmt, int insert);
|
/linux-master/Documentation/ |
H A D | conf.py | 44 sys.path.insert(0, os.path.abspath('sphinx')) 359 html_sidebars['**'].insert(0, 'about.html')
|
/linux-master/net/rds/ |
H A D | cong.c | 105 struct rds_cong_map *insert) 126 if (insert) { 127 rb_link_node(&insert->m_rb_node, parent, p); 128 rb_insert_color(&insert->m_rb_node, &rds_cong_tree); 104 rds_cong_tree_walk(const struct in6_addr *addr, struct rds_cong_map *insert) argument
|
/linux-master/Documentation/sphinx/ |
H A D | rstFlatTable.py | 33 * fill-cells: instead of autospann missing cells, insert missing cells 130 tableNode.insert(0, title) 254 self.rows[y].insert(x+c+1, None) 262 self.rows[y+r+1].insert(x+c, None) 345 cellElements.insert(0, target)
|
H A D | translations.py | 67 self.document.insert(0, new_nodes)
|
/linux-master/drivers/net/can/dev/ |
H A D | rx-offload.c | 80 struct sk_buff *pos, *insert = NULL; local 97 insert = pos; 100 if (!insert) 103 __skb_queue_after(head, insert, new);
|