| /kernel/linux/linux-5.10/fs/btrfs/ |
| H A D | backref.c | 116 struct rb_root_cached root; member
120 #define PREFTREE_INIT { .root = RB_ROOT_CACHED, .count = 0 }
221 * Add @newref to the @root rbtree, merging identical refs.
230 struct rb_root_cached *root; in prelim_ref_insert() local
237 root = &preftree->root; in prelim_ref_insert()
238 p = &root->rb_root.rb_node; in prelim_ref_insert()
279 rb_insert_color_cached(&newref->rbnode, root, leftmost); in prelim_ref_insert()
284 * just free everything and then reset the tree root.
291 &preftree->root in prelim_release()
418 add_all_parents(struct btrfs_root *root, struct btrfs_path *path, struct ulist *parents, struct preftrees *preftrees, struct prelim_ref *ref, int level, u64 time_seq, const u64 *extent_item_pos, bool ignore_offset) add_all_parents() argument
547 struct btrfs_root *root; resolve_indirect_ref() local
1047 u64 root; add_inline_refs() local
1147 u64 root; add_keyed_refs() local
1564 btrfs_check_shared(struct btrfs_root *root, u64 inum, u64 bytenr, struct ulist *roots, struct ulist *tmp) global() argument
1628 btrfs_find_one_extref(struct btrfs_root *root, u64 inode_objectid, u64 start_off, struct btrfs_path *path, struct btrfs_inode_extref **ret_extref, u64 *found_off) global() argument
1962 iterate_leaf_refs(struct btrfs_fs_info *fs_info, struct extent_inode_elem *inode_list, u64 root, u64 extent_item_objectid, iterate_extent_inodes_t *iterate, void *ctx) global() argument
2067 build_ino_list(u64 inum, u64 offset, u64 root, void *ctx) global() argument
2687 struct btrfs_root *root; global() local
2758 struct btrfs_root *root; global() local
[all...] |
| H A D | ioctl.c | 201 struct btrfs_root *root = binode->root; in btrfs_ioctl_setflags() local
211 if (btrfs_root_readonly(root)) in btrfs_ioctl_setflags()
313 trans = btrfs_start_transaction(root, 3); in btrfs_ioctl_setflags()
339 ret = btrfs_update_inode(trans, root, inode); in btrfs_ioctl_setflags()
413 struct btrfs_root *root = binode->root; in btrfs_ioctl_fssetxattr() local
423 if (btrfs_root_readonly(root)) in btrfs_ioctl_fssetxattr()
473 trans = btrfs_start_transaction(root, 1); in btrfs_ioctl_fssetxattr()
482 ret = btrfs_update_inode(trans, root, inod in btrfs_ioctl_fssetxattr()
588 struct btrfs_root *root = BTRFS_I(dir)->root; create_subvol() local
791 create_snapshot(struct btrfs_root *root, struct inode *dir, struct dentry *dentry, bool readonly, struct btrfs_qgroup_inherit *inherit) create_snapshot() argument
1020 btrfs_mksnapshot(const struct path *parent, const char *name, int namelen, struct btrfs_root *root, bool readonly, struct btrfs_qgroup_inherit *inherit) btrfs_mksnapshot() argument
1099 find_new_extents(struct btrfs_root *root, struct inode *inode, u64 newer_than, u64 *off, u32 thresh) find_new_extents() argument
1476 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_defrag_file() local
1689 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_resize() local
1985 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_subvol_getflags() local
2008 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_subvol_setflags() local
2255 struct btrfs_root *root; search_ioctl() local
2391 struct btrfs_root *root; btrfs_search_path_in_tree() local
2484 struct btrfs_root *root = NULL; btrfs_search_path_in_tree_user() local
2731 struct btrfs_root *root; btrfs_ioctl_get_subvol_info() local
2853 struct btrfs_root *root; btrfs_ioctl_get_subvol_rootref() local
2952 struct btrfs_root *root = BTRFS_I(dir)->root; btrfs_ioctl_snap_destroy() local
3150 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_defrag() local
3444 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_default_subvol() local
3671 btrfs_ioctl_start_sync(struct btrfs_root *root, void __user *argp) btrfs_ioctl_start_sync() argument
3864 btrfs_ioctl_ino_to_path(struct btrfs_root *root, void __user *arg) btrfs_ioctl_ino_to_path() argument
4017 struct btrfs_root *root = BTRFS_I(file_inode(file))->root; btrfs_ioctl_balance() local
4252 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_qgroup_assign() local
4304 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_qgroup_create() local
4359 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_qgroup_limit() local
4477 struct btrfs_root *root = BTRFS_I(inode)->root; _btrfs_ioctl_set_received_subvol() local
4665 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_set_fslabel() local
4808 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl_set_features() local
4915 struct btrfs_root *root = BTRFS_I(inode)->root; btrfs_ioctl() local
[all...] |
| H A D | orphan.c | 10 struct btrfs_root *root, u64 offset) in btrfs_insert_orphan_item()
24 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in btrfs_insert_orphan_item()
31 struct btrfs_root *root, u64 offset) in btrfs_del_orphan_item()
45 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in btrfs_del_orphan_item()
53 ret = btrfs_del_item(trans, root, path); in btrfs_del_orphan_item()
9 btrfs_insert_orphan_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 offset) btrfs_insert_orphan_item() argument
30 btrfs_del_orphan_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 offset) btrfs_del_orphan_item() argument
|
| /kernel/linux/linux-5.10/drivers/infiniband/hw/usnic/ |
| H A D | usnic_uiom_interval_tree.c | 104 find_intervals_intersection_sorted(struct rb_root_cached *root, in find_intervals_intersection_sorted() argument
112 for (node = usnic_uiom_interval_tree_iter_first(root, start, last); in find_intervals_intersection_sorted()
122 struct rb_root_cached *root, in usnic_uiom_get_intervals_diff()
132 find_intervals_intersection_sorted(root, start, last, in usnic_uiom_get_intervals_diff()
144 * Invariant: Set [start, pivot] is either in diff_set or root, in usnic_uiom_get_intervals_diff()
179 int usnic_uiom_insert_interval(struct rb_root_cached *root, unsigned long start, in usnic_uiom_insert_interval() argument
190 find_intervals_intersection_sorted(root, start, last, in usnic_uiom_insert_interval()
234 usnic_uiom_interval_tree_remove(interval, root); in usnic_uiom_insert_interval()
239 usnic_uiom_interval_tree_insert(interval, root); in usnic_uiom_insert_interval()
250 void usnic_uiom_remove_interval(struct rb_root_cached *root, in usnic_uiom_remove_interval() argument
120 usnic_uiom_get_intervals_diff(unsigned long start, unsigned long last, int flags, int flag_mask, struct rb_root_cached *root, struct list_head *diff_set) usnic_uiom_get_intervals_diff() argument
[all...] |
| /kernel/linux/linux-5.10/include/linux/ |
| H A D | radix-tree.h | 74 /* The top bits of xa_flags are used to store the root tags */
82 #define INIT_RADIX_TREE(root, mask) xa_init_flags(root, mask)
84 static inline bool radix_tree_empty(const struct radix_tree_root *root) in radix_tree_empty() argument
86 return root->xa_head == NULL; in radix_tree_empty()
261 void __rcu **idr_get_free(struct radix_tree_root *root,
297 * @root: radix tree root
312 * @root: radix tree root
321 radix_tree_iter_lookup(const struct radix_tree_root *root, struct radix_tree_iter *iter, unsigned long index) radix_tree_iter_lookup() argument
[all...] |
| H A D | fs_struct.h | 15 struct path root, pwd; member
27 static inline void get_fs_root(struct fs_struct *fs, struct path *root) in get_fs_root() argument
30 *root = fs->root; in get_fs_root()
31 path_get(root); in get_fs_root()
|
| /kernel/linux/linux-6.6/include/linux/ |
| H A D | radix-tree.h | 76 /* The top bits of xa_flags are used to store the root tags */
84 #define INIT_RADIX_TREE(root, mask) xa_init_flags(root, mask)
86 static inline bool radix_tree_empty(const struct radix_tree_root *root) in radix_tree_empty() argument
88 return root->xa_head == NULL; in radix_tree_empty()
263 void __rcu **idr_get_free(struct radix_tree_root *root,
299 * @root: radix tree root
314 * @root: radix tree root
323 radix_tree_iter_lookup(const struct radix_tree_root *root, struct radix_tree_iter *iter, unsigned long index) radix_tree_iter_lookup() argument
[all...] |
| H A D | fs_struct.h | 15 struct path root, pwd; member
27 static inline void get_fs_root(struct fs_struct *fs, struct path *root) in get_fs_root() argument
30 *root = fs->root; in get_fs_root()
31 path_get(root); in get_fs_root()
|
| /kernel/linux/linux-6.6/drivers/soc/qcom/ |
| H A D | qcom_stats.c | 124 static void qcom_create_soc_sleep_stat_files(struct dentry *root, void __iomem *reg, in qcom_create_soc_sleep_stat_files() argument
161 debugfs_create_file(stat_type, 0400, root, &d[i], in qcom_create_soc_sleep_stat_files()
170 static void qcom_create_subsystem_stat_files(struct dentry *root, in qcom_create_subsystem_stat_files() argument
179 debugfs_create_file(subsystems[i].name, 0400, root, (void *)&subsystems[i], in qcom_create_subsystem_stat_files()
186 struct dentry *root; in qcom_stats_probe() local
207 root = debugfs_create_dir("qcom_stats", NULL); in qcom_stats_probe()
209 qcom_create_subsystem_stat_files(root, config); in qcom_stats_probe()
210 qcom_create_soc_sleep_stat_files(root, reg, d, config); in qcom_stats_probe()
212 platform_set_drvdata(pdev, root); in qcom_stats_probe()
221 struct dentry *root in qcom_stats_remove() local
[all...] |
| /kernel/linux/linux-6.6/drivers/infiniband/hw/usnic/ |
| H A D | usnic_uiom_interval_tree.c | 104 find_intervals_intersection_sorted(struct rb_root_cached *root, in find_intervals_intersection_sorted() argument
112 for (node = usnic_uiom_interval_tree_iter_first(root, start, last); in find_intervals_intersection_sorted()
122 struct rb_root_cached *root, in usnic_uiom_get_intervals_diff()
132 find_intervals_intersection_sorted(root, start, last, in usnic_uiom_get_intervals_diff()
144 * Invariant: Set [start, pivot] is either in diff_set or root, in usnic_uiom_get_intervals_diff()
179 int usnic_uiom_insert_interval(struct rb_root_cached *root, unsigned long start, in usnic_uiom_insert_interval() argument
190 find_intervals_intersection_sorted(root, start, last, in usnic_uiom_insert_interval()
234 usnic_uiom_interval_tree_remove(interval, root); in usnic_uiom_insert_interval()
239 usnic_uiom_interval_tree_insert(interval, root); in usnic_uiom_insert_interval()
250 void usnic_uiom_remove_interval(struct rb_root_cached *root, in usnic_uiom_remove_interval() argument
120 usnic_uiom_get_intervals_diff(unsigned long start, unsigned long last, int flags, int flag_mask, struct rb_root_cached *root, struct list_head *diff_set) usnic_uiom_get_intervals_diff() argument
[all...] |
| /kernel/linux/linux-6.6/tools/testing/selftests/cgroup/ |
| H A D | test_kill.c | 56 static int test_cgkill_simple(const char *root) in test_cgkill_simple() argument
63 cgroup = cg_name(root, "cg_test_simple"); in test_cgkill_simple()
113 static int test_cgkill_tree(const char *root) in test_cgkill_tree() argument
120 cgroup[0] = cg_name(root, "cg_test_tree_A"); in test_cgkill_tree()
222 static int test_cgkill_forkbomb(const char *root) in test_cgkill_forkbomb() argument
228 cgroup = cg_name(root, "cg_forkbomb_test"); in test_cgkill_forkbomb()
265 int (*fn)(const char *root);
276 char root[PATH_MAX]; in main() local
279 if (cg_find_unified_root(root, sizeof(root))) in main()
[all...] |
| /kernel/linux/linux-6.6/drivers/platform/x86/amd/ |
| H A D | hsmp.c | 54 static int amd_hsmp_rdwr(struct pci_dev *root, u32 address, in amd_hsmp_rdwr() argument
59 ret = pci_write_config_dword(root, HSMP_INDEX_REG, address); in amd_hsmp_rdwr()
63 ret = (write ? pci_write_config_dword(root, HSMP_DATA_REG, *value) in amd_hsmp_rdwr()
64 : pci_read_config_dword(root, HSMP_DATA_REG, value)); in amd_hsmp_rdwr()
78 static int __hsmp_send_message(struct pci_dev *root, struct hsmp_message *msg) in __hsmp_send_message() argument
87 ret = amd_hsmp_rdwr(root, SMN_HSMP_MSG_RESP, &mbox_status, HSMP_WR); in __hsmp_send_message()
96 ret = amd_hsmp_rdwr(root, SMN_HSMP_MSG_DATA + (index << 2), in __hsmp_send_message()
106 ret = amd_hsmp_rdwr(root, SMN_HSMP_MSG_ID, &msg->msg_id, HSMP_WR); in __hsmp_send_message()
123 ret = amd_hsmp_rdwr(root, SMN_HSMP_MSG_RESP, &mbox_status, HSMP_RD); in __hsmp_send_message()
158 ret = amd_hsmp_rdwr(root, SMN_HSMP_MSG_DAT in __hsmp_send_message()
[all...] |
| /kernel/linux/linux-5.10/fs/kernfs/ |
| H A D | dir.c | 31 static DEFINE_SPINLOCK(kernfs_idr_lock); /* root->ino_idr */
91 /* worst case b and a will be the same at root */ in kernfs_common_ancestor()
102 * where kn_from is treated as root of the path.
103 * @kn_from: kernfs node which should be treated as root for the path
210 * be on the same kernfs-root. If @from is not parent of @to, then a relative
468 struct kernfs_root *root = kernfs_root(kn); variable
482 wait_event(root->deactivate_waitq,
517 struct kernfs_root *root; in kernfs_put() local
521 root = kernfs_root(kn); in kernfs_put()
543 idr_remove(&root in kernfs_put()
621 __kernfs_new_node(struct kernfs_root *root, struct kernfs_node *parent, const char *name, umode_t mode, kuid_t uid, kgid_t gid, unsigned flags) __kernfs_new_node() argument
731 kernfs_find_and_get_node_by_id(struct kernfs_root *root, u64 id) kernfs_find_and_get_node_by_id() argument
970 struct kernfs_root *root; kernfs_create_root() local
1021 kernfs_destroy_root(struct kernfs_root *root) kernfs_destroy_root() argument
1245 kernfs_next_descendant_post(struct kernfs_node *pos, struct kernfs_node *root) kernfs_next_descendant_post() argument
[all...] |
| /kernel/linux/linux-6.6/fs/btrfs/ |
| H A D | file-item.c | 51 struct btrfs_fs_info *fs_info = inode->root->fs_info; in btrfs_inode_safe_disk_i_size_write()
93 ASSERT(IS_ALIGNED(start + len, inode->root->fs_info->sectorsize)); in btrfs_inode_set_file_extent_range()
95 if (btrfs_fs_incompat(inode->root->fs_info, NO_HOLES)) in btrfs_inode_set_file_extent_range()
121 ASSERT(IS_ALIGNED(start + len, inode->root->fs_info->sectorsize) || in btrfs_inode_clear_file_extent_range()
124 if (btrfs_fs_incompat(inode->root->fs_info, NO_HOLES)) in btrfs_inode_clear_file_extent_range()
162 struct btrfs_root *root, in btrfs_insert_hole_extent()
178 ret = btrfs_insert_empty_item(trans, root, path, &file_key, in btrfs_insert_hole_extent()
205 struct btrfs_root *root, in btrfs_lookup_csum()
209 struct btrfs_fs_info *fs_info = root->fs_info; in btrfs_lookup_csum()
222 ret = btrfs_search_slot(trans, root, in btrfs_lookup_csum()
161 btrfs_insert_hole_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 objectid, u64 pos, u64 num_bytes) btrfs_insert_hole_extent() argument
204 btrfs_lookup_csum(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 bytenr, int cow) btrfs_lookup_csum() argument
257 btrfs_lookup_file_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, int mod) btrfs_lookup_file_extent() argument
457 btrfs_lookup_csums_list(struct btrfs_root *root, u64 start, u64 end, struct list_head *list, int search_commit, bool nowait) btrfs_lookup_csums_list() argument
600 btrfs_lookup_csums_bitmap(struct btrfs_root *root, struct btrfs_path *path, u64 start, u64 end, u8 *csum_buf, unsigned long *csum_bitmap) btrfs_lookup_csums_bitmap() argument
864 btrfs_del_csums(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 len) btrfs_del_csums() argument
1008 find_next_csum_offset(struct btrfs_root *root, struct btrfs_path *path, u64 *next_offset) find_next_csum_offset() argument
1039 btrfs_csum_file_blocks(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_ordered_sum *sums) btrfs_csum_file_blocks() argument
1270 struct btrfs_root *root = inode->root; btrfs_extent_item_to_extent_map() local
[all...] |
| H A D | extent-tree.c | 41 #include "root-tree.h"
75 struct btrfs_root *root = btrfs_extent_root(fs_info, start); in btrfs_lookup_data_extent() local
87 ret = btrfs_search_slot(NULL, root, &key, path, 0, 0); in btrfs_lookup_data_extent()
299 * - Objectid of the subvolume root
436 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr); in lookup_extent_data_ref() local
456 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in lookup_extent_data_ref()
472 ret = btrfs_next_leaf(root, path); in lookup_extent_data_ref()
512 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr); in insert_extent_data_ref() local
531 ret = btrfs_insert_empty_item(trans, root, path, &key, size); in insert_extent_data_ref()
557 ret = btrfs_insert_empty_item(trans, root, pat in insert_extent_data_ref()
585 remove_extent_data_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int refs_to_drop) remove_extent_data_ref() argument
677 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr); lookup_tree_block_ref() local
701 struct btrfs_root *root = btrfs_extent_root(trans->fs_info, bytenr); insert_tree_block_ref() local
779 struct btrfs_root *root = btrfs_extent_root(fs_info, bytenr); lookup_inline_extent_backref() local
1222 remove_extent_backref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_extent_inline_ref *iref, int refs_to_drop, int is_data) remove_extent_backref() argument
1605 struct btrfs_root *root; run_delayed_extent_op() local
2094 find_middle(struct rb_root *root) find_middle() argument
2220 check_delayed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr) check_delayed_ref() argument
2306 check_committed_ref(struct btrfs_root *root, struct btrfs_path *path, u64 objectid, u64 offset, u64 bytenr, bool strict) check_committed_ref() argument
2381 btrfs_cross_ref_exist(struct btrfs_root *root, u64 objectid, u64 offset, u64 bytenr, bool strict, struct btrfs_path *path) btrfs_cross_ref_exist() argument
2402 __btrfs_mod_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, int full_backref, int inc) __btrfs_mod_ref() argument
2488 btrfs_inc_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, int full_backref) btrfs_inc_ref() argument
2494 btrfs_dec_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, int full_backref) btrfs_dec_ref() argument
2500 get_alloc_profile_by_root(struct btrfs_root *root, int data) get_alloc_profile_by_root() argument
3987 struct btrfs_root *root = fs_info->chunk_root; find_free_extent_update_loop() local
4219 find_free_extent(struct btrfs_root *root, struct btrfs_key *ins, struct find_free_extent_ctl *ffe_ctl) find_free_extent() argument
4518 btrfs_reserve_extent(struct btrfs_root *root, u64 ram_bytes, u64 num_bytes, u64 min_alloc_size, u64 empty_size, u64 hint_byte, struct btrfs_key *ins, int is_data, int delalloc) btrfs_reserve_extent() argument
4772 btrfs_alloc_reserved_file_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 owner, u64 offset, u64 ram_bytes, struct btrfs_key *ins) btrfs_alloc_reserved_file_extent() argument
4836 btrfs_init_new_buffer(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, int level, u64 owner, enum btrfs_lock_nesting nest) btrfs_init_new_buffer() argument
4927 btrfs_alloc_tree_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 parent, u64 root_objectid, const struct btrfs_disk_key *key, int level, u64 hint, u64 empty_size, enum btrfs_lock_nesting nest) btrfs_alloc_tree_block() argument
5036 reada_walk_down(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct walk_control *wc, struct btrfs_path *path) reada_walk_down() argument
5124 walk_down_proc(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct walk_control *wc, int lookup_info) walk_down_proc() argument
5195 check_ref_exists(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 bytenr, u64 parent, int level) check_ref_exists() argument
5231 do_walk_down(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct walk_control *wc, int *lookup_info) do_walk_down() argument
5446 walk_up_proc(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct walk_control *wc) walk_up_proc() argument
5551 walk_down_tree(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct walk_control *wc) walk_down_tree() argument
5583 walk_up_tree(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct walk_control *wc, int max_level) walk_up_tree() argument
5631 btrfs_drop_snapshot(struct btrfs_root *root, int update_ref, int for_reloc) btrfs_drop_snapshot() argument
5898 btrfs_drop_subtree(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *node, struct extent_buffer *parent) btrfs_drop_subtree() argument
[all...] |
| H A D | backref.c | 144 struct rb_root_cached root; member
148 #define PREFTREE_INIT { .root = RB_ROOT_CACHED, .count = 0 }
166 struct btrfs_root *root; member
172 * the same root or different roots) that we could find. The sharedness
267 if (newref->root_id == sc->root->root_key.objectid && in update_share_count()
274 * Add @newref to the @root rbtree, merging identical refs.
283 struct rb_root_cached *root; in prelim_ref_insert() local
290 root = &preftree->root; in prelim_ref_insert()
291 p = &root in prelim_ref_insert()
471 add_all_parents(struct btrfs_backref_walk_ctx *ctx, struct btrfs_root *root, struct btrfs_path *path, struct ulist *parents, struct preftrees *preftrees, struct prelim_ref *ref, int level) add_all_parents() argument
599 struct btrfs_root *root; resolve_indirect_ref() local
1107 u64 root; add_inline_refs() local
1210 u64 root; add_keyed_refs() local
1252 lookup_backref_shared_cache(struct btrfs_backref_share_check_ctx *ctx, struct btrfs_root *root, u64 bytenr, int level, bool *is_shared) lookup_backref_shared_cache() argument
1322 store_backref_shared_cache(struct btrfs_backref_share_check_ctx *ctx, struct btrfs_root *root, u64 bytenr, int level, bool is_shared) store_backref_shared_cache() argument
1390 struct btrfs_root *root = btrfs_extent_root(ctx->fs_info, ctx->bytenr); find_parent_nodes() local
1858 struct btrfs_root *root = inode->root; btrfs_is_data_extent_shared() local
2049 btrfs_find_one_extref(struct btrfs_root *root, u64 inode_objectid, u64 start_off, struct btrfs_path *path, struct btrfs_inode_extref **ret_extref, u64 *found_off) btrfs_find_one_extref() argument
2379 iterate_leaf_refs(struct btrfs_fs_info *fs_info, struct extent_inode_elem *inode_list, u64 root, u64 extent_item_objectid, iterate_extent_inodes_t *iterate, void *ctx) iterate_leaf_refs() argument
2530 build_ino_list(u64 inum, u64 offset, u64 num_bytes, u64 root, void *ctx) build_ino_list() argument
3144 struct btrfs_root *root; handle_direct_tree_backref() local
3217 struct btrfs_root *root; handle_indirect_tree_backref() local
[all...] |
| H A D | orphan.c | 11 struct btrfs_root *root, u64 offset) in btrfs_insert_orphan_item()
25 ret = btrfs_insert_empty_item(trans, root, path, &key, 0); in btrfs_insert_orphan_item()
32 struct btrfs_root *root, u64 offset) in btrfs_del_orphan_item()
46 ret = btrfs_search_slot(trans, root, &key, path, -1, 1); in btrfs_del_orphan_item()
54 ret = btrfs_del_item(trans, root, path); in btrfs_del_orphan_item()
10 btrfs_insert_orphan_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 offset) btrfs_insert_orphan_item() argument
31 btrfs_del_orphan_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 offset) btrfs_del_orphan_item() argument
|
| /kernel/linux/linux-6.6/tools/testing/selftests/exec/ |
| H A D | binfmt_script.py | 37 # @root: start of executable pathname
40 # @fill: character to fill between @root and @target to reach @size bytes
43 def test(name, size, good=True, leading="", root="./", target="/perl",
52 remaining = size - len(hashbang) - len(leading) - len(root) - len(target) - len(arg)
60 dirpath = root + middle
67 buf=hashbang + leading + root + middle + target + arg + newline
117 test(name="whitespace-too-big", size=SIZE+71, good=False, root="",
122 test(name="empty", size=2, good=False, root="",
125 test(name="spaces", size=SIZE-1, good=False, root="", fill=" ",
129 root
136 root="./nix/store/bwav8kz8b3y471wjsybgzw84mrh4js9-perl-5.28.1/bin", global() variable
[all...] |
| /kernel/linux/linux-5.10/net/netfilter/ |
| H A D | nf_conncount.c | 60 struct rb_root root[CONNCOUNT_SLOTS]; member
276 static void tree_nodes_free(struct rb_root *root, in tree_nodes_free() argument
286 rb_erase(&rbconn->node, root); in tree_nodes_free()
302 struct rb_root *root, in insert_tree()
319 rbnode = &(root->rb_node); in insert_tree()
338 tree_nodes_free(root, gc_nodes, gc_count); in insert_tree()
350 tree_nodes_free(root, gc_nodes, gc_count); in insert_tree()
378 rb_insert_color(&rbconn->node, root); in insert_tree()
391 struct rb_root *root; in count_tree() local
398 root in count_tree()
300 insert_tree(struct net *net, struct nf_conncount_data *data, struct rb_root *root, unsigned int hash, const u32 *key, const struct nf_conntrack_tuple *tuple, const struct nf_conntrack_zone *zone) insert_tree() argument
448 struct rb_root *root; tree_gc_worker() local
[all...] |
| /kernel/linux/linux-5.10/fs/hpfs/ |
| H A D | super.c | 494 static int hpfs_show_options(struct seq_file *seq, struct dentry *root) in hpfs_show_options() argument
496 struct hpfs_sb_info *sbi = hpfs_sb(root->d_sb); in hpfs_show_options()
544 struct inode *root; in hpfs_fill_super() local
619 sbi->sb_root = le32_to_cpu(superblock->root); in hpfs_fill_super()
708 root = iget_locked(s, sbi->sb_root); in hpfs_fill_super()
709 if (!root) in hpfs_fill_super()
711 hpfs_init_inode(root); in hpfs_fill_super()
712 hpfs_read_inode(root); in hpfs_fill_super()
713 unlock_new_inode(root); in hpfs_fill_super()
714 s->s_root = d_make_root(root); in hpfs_fill_super()
[all...] |
| /kernel/linux/linux-6.6/net/netfilter/ |
| H A D | nf_conncount.c | 60 struct rb_root root[CONNCOUNT_SLOTS]; member
287 static void tree_nodes_free(struct rb_root *root, in tree_nodes_free() argument
297 rb_erase(&rbconn->node, root); in tree_nodes_free()
313 struct rb_root *root, in insert_tree()
330 rbnode = &(root->rb_node); in insert_tree()
349 tree_nodes_free(root, gc_nodes, gc_count); in insert_tree()
361 tree_nodes_free(root, gc_nodes, gc_count); in insert_tree()
389 rb_insert_color(&rbconn->node, root); in insert_tree()
402 struct rb_root *root; in count_tree() local
409 root in count_tree()
311 insert_tree(struct net *net, struct nf_conncount_data *data, struct rb_root *root, unsigned int hash, const u32 *key, const struct nf_conntrack_tuple *tuple, const struct nf_conntrack_zone *zone) insert_tree() argument
459 struct rb_root *root; tree_gc_worker() local
[all...] |
| /kernel/linux/linux-5.10/fs/autofs/ |
| H A D | expire.c | 95 * Calculate and dget next entry in the subdirs list under root.
98 struct dentry *root) in get_next_positive_subdir()
100 struct autofs_sb_info *sbi = autofs_sbi(root->d_sb); in get_next_positive_subdir()
104 spin_lock(&root->d_lock); in get_next_positive_subdir()
105 q = positive_after(root, prev); in get_next_positive_subdir()
106 spin_unlock(&root->d_lock); in get_next_positive_subdir()
116 struct dentry *root) in get_next_positive_dentry()
118 struct autofs_sb_info *sbi = autofs_sbi(root->d_sb); in get_next_positive_dentry()
122 return dget(root); in get_next_positive_dentry()
130 if (ret || p == root) in get_next_positive_dentry()
97 get_next_positive_subdir(struct dentry *prev, struct dentry *root) get_next_positive_subdir() argument
115 get_next_positive_dentry(struct dentry *prev, struct dentry *root) get_next_positive_dentry() argument
279 struct dentry *root = dget(sb->s_root); autofs_expire_direct() local
426 struct dentry *root = sb->s_root; autofs_expire_indirect() local
[all...] |
| /kernel/linux/linux-5.10/fs/pstore/ |
| H A D | inode.c | 267 static int pstore_show_options(struct seq_file *m, struct dentry *root) in pstore_show_options() argument
292 struct dentry *root; in psinfo_lock_root() local
304 root = pstore_sb->s_root; in psinfo_lock_root()
305 inode_lock(d_inode(root)); in psinfo_lock_root()
308 return root; in psinfo_lock_root()
314 struct dentry *root; in pstore_put_backend_records() local
316 root = psinfo_lock_root(); in pstore_put_backend_records()
317 if (!root) in pstore_put_backend_records()
325 simple_unlink(d_inode(root), pos->dentry); in pstore_put_backend_records()
331 inode_unlock(d_inode(root)); in pstore_put_backend_records()
341 pstore_mkfile(struct dentry *root, struct pstore_record *record) pstore_mkfile() argument
414 struct dentry *root; pstore_get_records() local
[all...] |
| /kernel/linux/linux-6.6/fs/autofs/ |
| H A D | expire.c | 95 * Calculate and dget next entry in the subdirs list under root.
98 struct dentry *root) in get_next_positive_subdir()
100 struct autofs_sb_info *sbi = autofs_sbi(root->d_sb); in get_next_positive_subdir()
104 spin_lock(&root->d_lock); in get_next_positive_subdir()
105 q = positive_after(root, prev); in get_next_positive_subdir()
106 spin_unlock(&root->d_lock); in get_next_positive_subdir()
116 struct dentry *root) in get_next_positive_dentry()
118 struct autofs_sb_info *sbi = autofs_sbi(root->d_sb); in get_next_positive_dentry()
122 return dget(root); in get_next_positive_dentry()
130 if (ret || p == root) in get_next_positive_dentry()
97 get_next_positive_subdir(struct dentry *prev, struct dentry *root) get_next_positive_subdir() argument
115 get_next_positive_dentry(struct dentry *prev, struct dentry *root) get_next_positive_dentry() argument
279 struct dentry *root = dget(sb->s_root); autofs_expire_direct() local
426 struct dentry *root = sb->s_root; autofs_expire_indirect() local
[all...] |
| /kernel/linux/linux-6.6/fs/pstore/ |
| H A D | inode.c | 264 static int pstore_show_options(struct seq_file *m, struct dentry *root) in pstore_show_options() argument
289 struct dentry *root; in psinfo_lock_root() local
299 root = pstore_sb->s_root; in psinfo_lock_root()
300 inode_lock(d_inode(root)); in psinfo_lock_root()
302 return root; in psinfo_lock_root()
308 struct dentry *root; in pstore_put_backend_records() local
310 root = psinfo_lock_root(); in pstore_put_backend_records()
311 if (!root) in pstore_put_backend_records()
319 simple_unlink(d_inode(root), pos->dentry); in pstore_put_backend_records()
325 inode_unlock(d_inode(root)); in pstore_put_backend_records()
335 pstore_mkfile(struct dentry *root, struct pstore_record *record) pstore_mkfile() argument
405 struct dentry *root; pstore_get_records() local
[all...] |