Home
last modified time | relevance | path

Searched refs:newref (Results 1 - 6 of 6) sorted by relevance

/kernel/linux/linux-6.6/fs/btrfs/
H A Dbackref.c257 int newcount, struct prelim_ref *newref) in update_share_count()
267 if (newref->root_id == sc->root->root_key.objectid && in update_share_count()
268 newref->wanted_disk_byte == sc->data_bytenr && in update_share_count()
269 newref->key_for_search.objectid == sc->inum) in update_share_count()
270 sc->self_ref_count += newref->count; in update_share_count()
274 * Add @newref to the @root rbtree, merging identical refs.
276 * Callers should assume that newref has been freed after calling.
280 struct prelim_ref *newref, in prelim_ref_insert()
296 result = prelim_ref_compare(ref, newref); in prelim_ref_insert()
303 /* Identical refs, merge them and free @newref */ in prelim_ref_insert()
256 update_share_count(struct share_check *sc, int oldcount, int newcount, struct prelim_ref *newref) update_share_count() argument
278 prelim_ref_insert(const struct btrfs_fs_info *fs_info, struct preftree *preftree, struct prelim_ref *newref, struct share_check *sc) prelim_ref_insert() argument
[all...]
/kernel/linux/linux-5.10/fs/btrfs/
H A Dbackref.c221 * Add @newref to the @root rbtree, merging identical refs.
223 * Callers should assume that newref has been freed after calling.
227 struct prelim_ref *newref, in prelim_ref_insert()
243 result = prelim_ref_compare(ref, newref); in prelim_ref_insert()
250 /* Identical refs, merge them and free @newref */ in prelim_ref_insert()
257 ref->inode_list = newref->inode_list; in prelim_ref_insert()
259 eie->next = newref->inode_list; in prelim_ref_insert()
260 trace_btrfs_prelim_ref_merge(fs_info, ref, newref, in prelim_ref_insert()
263 * A delayed ref can have newref->count < 0. in prelim_ref_insert()
268 ref->count + newref in prelim_ref_insert()
225 prelim_ref_insert(const struct btrfs_fs_info *fs_info, struct preftree *preftree, struct prelim_ref *newref, struct share_check *sc) prelim_ref_insert() argument
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dbtrfs.h1790 const struct prelim_ref *newref, u64 tree_size),
1791 TP_ARGS(fs_info, newref, oldref, tree_size),
1815 __entry->mod_count = newref ? newref->count : 0;
1833 const struct prelim_ref *newref, u64 tree_size),
1834 TP_ARGS(fs_info, oldref, newref, tree_size)
1840 const struct prelim_ref *newref, u64 tree_size),
1841 TP_ARGS(fs_info, oldref, newref, tree_size)
/kernel/linux/linux-6.6/include/trace/events/
H A Dbtrfs.h1958 const struct prelim_ref *newref, u64 tree_size),
1959 TP_ARGS(fs_info, newref, oldref, tree_size),
1983 __entry->mod_count = newref ? newref->count : 0;
2001 const struct prelim_ref *newref, u64 tree_size),
2002 TP_ARGS(fs_info, oldref, newref, tree_size)
2008 const struct prelim_ref *newref, u64 tree_size),
2009 TP_ARGS(fs_info, oldref, newref, tree_size)
/kernel/linux/linux-5.10/fs/jffs2/
H A Dxattr.c1105 struct jffs2_xattr_ref *ref, *newref, **pref; in do_jffs2_setxattr() local
1195 newref = create_xattr_ref(c, ic, xd); in do_jffs2_setxattr()
1196 if (IS_ERR(newref)) { in do_jffs2_setxattr()
1201 rc = PTR_ERR(newref); in do_jffs2_setxattr()
/kernel/linux/linux-6.6/fs/jffs2/
H A Dxattr.c1104 struct jffs2_xattr_ref *ref, *newref, **pref; in do_jffs2_setxattr() local
1194 newref = create_xattr_ref(c, ic, xd); in do_jffs2_setxattr()
1195 if (IS_ERR(newref)) { in do_jffs2_setxattr()
1200 rc = PTR_ERR(newref); in do_jffs2_setxattr()

Completed in 11 milliseconds