| /fs/bcachefs/ |
| A D | data_update.c | 115 struct bkey_i *insert) in trace_io_move_finish2() argument
141 struct bkey_i *insert, in trace_io_move_fail2() argument
154 if (insert) { in trace_io_move_fail2()
184 if (insert) { in trace_io_move_fail2()
196 struct bkey_i *insert) in trace_data_update2() argument
215 struct bkey_i *insert) in trace_io_move_created_rebalance2() argument
238 struct bkey_i *insert) in data_update_invalid_bkey() argument
277 struct bkey_i *insert = NULL; in __bch2_data_update_index_update() local
312 bkey_reassemble(insert, k); in __bch2_data_update_index_update()
419 next_pos = insert->k.p; in __bch2_data_update_index_update()
[all …]
|
| A D | str_hash.h | 259 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()
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
344 insert->k.p.inode = inum.inum; in bch2_hash_set()
[all …]
|
| A D | btree_update.c | 36 struct bkey_i **insert, in extent_front_merge() argument
65 *insert = update; in extent_front_merge()
71 struct bkey_i *insert, in extent_back_merge() argument
87 bch2_bkey_merge(c, bkey_i_to_s(insert), k); in extent_back_merge()
268 struct bkey_i *insert, in bch2_trans_update_extent() argument
286 if (bkey_eq(k.k->p, bkey_start_pos(&insert->k))) { in bch2_trans_update_extent()
287 if (bch2_bkey_maybe_mergable(k.k, &insert->k)) { in bch2_trans_update_extent()
297 bool done = bkey_lt(insert->k.p, k.k->p); in bch2_trans_update_extent()
314 if (bch2_bkey_maybe_mergable(&insert->k, k.k)) { in bch2_trans_update_extent()
315 ret = extent_back_merge(trans, &iter, insert, k); in bch2_trans_update_extent()
[all …]
|
| A D | btree_trans_commit.c | 157 struct bkey_i *insert) in bch2_btree_bset_insert_key() argument
164 EBUG_ON(bkey_deleted(&insert->k) && bkey_val_u64s(&insert->k)); in bch2_btree_bset_insert_key()
165 EBUG_ON(bpos_lt(insert->k.p, b->data->min_key)); in bch2_btree_bset_insert_key()
169 kmsan_check_memory(insert, bkey_bytes(&insert->k)); in bch2_btree_bset_insert_key()
179 if (bkey_deleted(&insert->k) && !k) in bch2_btree_bset_insert_key()
182 if (bkey_deleted(&insert->k)) { in bch2_btree_bset_insert_key()
188 push_whiteout(b, insert->k.p); in bch2_btree_bset_insert_key()
207 insert->k.needs_whiteout = k->needs_whiteout; in bch2_btree_bset_insert_key()
220 bch2_bset_insert(b, k, insert, clobber_u64s); in bch2_btree_bset_insert_key()
292 struct bkey_i *insert, in bch2_btree_insert_key_leaf() argument
[all …]
|
| A D | io_misc.c | 397 bool insert = shift > 0; in __bch2_resume_logged_op_finsert() local
422 if (insert) { in __bch2_resume_logged_op_finsert()
458 k = insert in __bch2_resume_logged_op_finsert()
473 if (insert && in __bch2_resume_logged_op_finsert()
492 op->v.pos = cpu_to_le64(insert ? bkey_start_offset(&delete.k) : delete.k.p.offset); in __bch2_resume_logged_op_finsert()
512 if (!insert) { in __bch2_resume_logged_op_finsert()
540 u64 offset, u64 len, bool insert, in bch2_fcollapse_finsert() argument
544 s64 shift = insert ? len : -len; in bch2_fcollapse_finsert()
551 op.v.pos = cpu_to_le64(insert ? U64_MAX : offset); in bch2_fcollapse_finsert()
|
| A D | bset.c | 248 bkey_iter_cmp(b, prev, insert) > 0); in __bch2_verify_insert_pos()
251 bkey_iter_cmp(b, prev, insert) > 0) { in __bch2_verify_insert_pos()
253 struct bkey k2 = bkey_unpack_key(b, insert); in __bch2_verify_insert_pos()
267 bkey_iter_cmp(b, insert, next) > 0); in __bch2_verify_insert_pos()
270 bkey_iter_cmp(b, insert, next) > 0) { in __bch2_verify_insert_pos()
271 struct bkey k1 = bkey_unpack_key(b, insert); in __bch2_verify_insert_pos()
288 struct bkey_packed *insert, in bch2_verify_insert_pos() argument
989 struct bkey_i *insert, in bch2_bset_insert() argument
999 if (bch2_bkey_pack_key(&packed, &insert->k, f)) in bch2_bset_insert()
1002 if (!bkey_deleted(&insert->k)) in bch2_bset_insert()
[all …]
|
| A D | buckets.c | 435 if (insert) { in bucket_ref_update_err()
449 if (print || insert) in bucket_ref_update_err()
600 bool insert) in __mark_pointer() argument
610 if (insert) in __mark_pointer()
623 bool insert = !(flags & BTREE_TRIGGER_overwrite); in bch2_trigger_pointer() local
634 if (insert && p.ptr.dev != BCH_SB_MEMBER_INVALID) in bch2_trigger_pointer()
641 if (insert) { in bch2_trigger_pointer()
655 ret = bch2_bucket_backpointer_mod(trans, k, &bp, insert); in bch2_trigger_pointer()
875 bool insert = !(flags & BTREE_TRIGGER_overwrite); in __trigger_extent() local
878 insert ? 1 : -1, in __trigger_extent()
[all …]
|
| A D | backpointers.h | 102 bool insert) in bch2_bucket_backpointer_mod() argument
105 return bch2_bucket_backpointer_mod_nowritebuffer(trans, orig_k, bp, insert); in bch2_bucket_backpointer_mod()
107 if (!insert) { in bch2_bucket_backpointer_mod()
|
| A D | btree_update_interior.c | 931 struct bkey_i *insert = &b->key; in btree_update_updated_root() local
943 insert, insert->k.u64s); in btree_update_updated_root()
1381 struct bkey_i *insert) in bch2_insert_fixup_btree_ptr() argument
1388 BUG_ON(insert->k.type == KEY_TYPE_btree_ptr_v2 && in bch2_insert_fixup_btree_ptr()
1413 insert, insert->k.u64s); in bch2_insert_fixup_btree_ptr()
1416 bkey_iter_pos_cmp(b, k, &insert->k.p) < 0) in bch2_insert_fixup_btree_ptr()
1452 insert != keys->top && bpos_le(insert->k.p, b->key.k.p); in bch2_btree_insert_keys_interior()
1453 insert = bkey_next(insert)) in bch2_btree_insert_keys_interior()
1461 k != insert; in bch2_btree_insert_keys_interior()
1473 memmove_u64s_down(keys->keys, insert, keys->top_p - insert->_data); in bch2_btree_insert_keys_interior()
[all …]
|
| A D | fs-io.c | 596 bool insert) in bchfs_fcollapse_finsert() argument
606 if (insert) { in bchfs_fcollapse_finsert()
618 if (insert) in bchfs_fcollapse_finsert()
622 insert, &i_sectors_delta); in bchfs_fcollapse_finsert()
623 if (!ret && !insert) in bchfs_fcollapse_finsert()
|
| A D | backpointers.c | 108 bool insert) in backpointer_mod_err() argument
116 if (insert) { in backpointer_mod_err()
155 bool insert) in bch2_bucket_backpointer_mod_nowritebuffer() argument
167 if (insert in bch2_bucket_backpointer_mod_nowritebuffer()
171 ret = backpointer_mod_err(trans, orig_k, bp, k, insert); in bch2_bucket_backpointer_mod_nowritebuffer()
176 if (!insert) { in bch2_bucket_backpointer_mod_nowritebuffer()
|
| A D | tests.c | 714 struct bkey_i_cookie insert; in seq_insert() local
716 bkey_cookie_init(&insert.k_i); in seq_insert()
725 insert.k.p = iter.pos; in seq_insert()
726 bch2_trans_update(trans, &iter, &insert.k_i, 0); in seq_insert()
|
| A D | btree_key_cache.c | 579 struct bkey_i *insert = insert_entry->k; in bch2_btree_insert_key_cached() local
582 BUG_ON(insert->k.u64s > ck->u64s); in bch2_btree_insert_key_cached()
584 bkey_copy(ck->k, insert); in bch2_btree_insert_key_cached()
|
| A D | io_write.c | 615 struct bkey_i *insert = bch2_keylist_front(&op->insert_keys); in __bch2_write_index() local
617 bch2_write_op_error(op, bkey_start_offset(&insert->k), in __bch2_write_index()
1279 struct bkey_i *insert = bch2_keylist_front(&op->insert_keys); in bch2_nocow_write_convert_unwritten() local
1280 bch2_write_op_error(op, bkey_start_offset(&insert->k), in bch2_nocow_write_convert_unwritten()
|
| A D | btree_types.h | 268 x(insert) \
|
| /fs/notify/ |
| A D | notification.c | 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()
|
| /fs/ocfs2/ |
| A D | alloc.c | 3889 insert->ins_split, rec, in ocfs2_insert_at_leaf()
4229 insert); in ocfs2_insert_path()
4505 insert->ins_contig_index = i; in ocfs2_figure_contig_type()
4596 insert->ins_split = SPLIT_NONE; in ocfs2_figure_insert_type()
4630 if (!insert->ins_tree_depth) { in ocfs2_figure_insert_type()
4744 &free_records, &insert); in ocfs2_insert_extent()
4750 trace_ocfs2_insert_extent(insert.ins_appending, insert.ins_contig, in ocfs2_insert_extent()
4752 insert.ins_tree_depth); in ocfs2_insert_extent()
4962 insert.ins_tree_depth = depth; in ocfs2_split_and_insert()
4970 insert.ins_split = SPLIT_LEFT; in ocfs2_split_and_insert()
[all …]
|
| /fs/btrfs/ |
| A D | file-item.c | 1098 goto insert; in btrfs_csum_file_blocks()
1106 goto insert; in btrfs_csum_file_blocks()
1136 goto insert; in btrfs_csum_file_blocks()
1147 goto insert; in btrfs_csum_file_blocks()
1190 goto insert; in btrfs_csum_file_blocks()
1216 insert: in btrfs_csum_file_blocks()
|
| A D | free-space-tree.c | 953 goto insert; in add_free_space_extent()
967 goto insert; in add_free_space_extent()
990 insert: in add_free_space_extent()
|
| A D | extent-tree.c | 765 u64 owner, u64 offset, int insert) in lookup_inline_extent_backref() argument
789 if (insert) { in lookup_inline_extent_backref()
833 if (ret && !insert) { in lookup_inline_extent_backref()
936 if (ret == -ENOENT && insert) { in lookup_inline_extent_backref()
981 if (insert) in lookup_inline_extent_backref()
|
| A D | inode.c | 7110 goto insert; in btrfs_get_extent()
7117 goto insert; in btrfs_get_extent()
7139 goto insert; in btrfs_get_extent()
7145 insert: in btrfs_get_extent()
|
| /fs/ |
| A D | exec.c | 91 void __register_binfmt(struct linux_binfmt * fmt, int insert) in __register_binfmt() argument
94 insert ? list_add(&fmt->lh, &formats) : in __register_binfmt()
|
| /fs/affs/ |
| A D | Changes | 197 - Fixed bug in add_entry(): When doing a sorted insert,
|
| /fs/unicode/ |
| A D | mkutf8data.c | 533 static int insert(struct tree *tree, char *key, int keylen, void *leaf) in insert() function
1702 insert(&trees[i], keyval, keylen, data); in trees_populate()
|
| /fs/ext4/ |
| A D | mballoc.c | 6460 goto insert; in ext4_mb_free_metadata()
6476 insert: in ext4_mb_free_metadata()
|