Searched refs:root (Results 51 - 75 of 1075) sorted by relevance

1234567891011>>

/linux-master/fs/kernfs/
H A Dmount.c30 struct kernfs_root *root = kernfs_root(kernfs_dentry_node(dentry)); local
31 struct kernfs_syscall_ops *scops = root->syscall_ops;
34 return scops->show_options(sf, root);
41 struct kernfs_root *root = kernfs_root(node); local
42 struct kernfs_syscall_ops *scops = root->syscall_ops;
45 return scops->show_path(sf, node, root);
112 kn = kernfs_find_and_get_node_by_id(info->root, id);
169 return kernfs_info(sb)->root;
177 * Say the path is /a/b/c/d. @child is d, @parent is %NULL. We return the root
215 /* Check if this is the root kernfs_nod
251 struct dentry *root; local
350 struct kernfs_root *root = kfc->root; local
392 struct kernfs_root *root = info->root; local
[all...]
H A Ddir.c30 static DEFINE_SPINLOCK(kernfs_idr_lock); /* root->ino_idr */
95 /* worst case b and a will be the same at root */
106 * where kn_from is treated as root of the path.
107 * @kn_from: kernfs node which should be treated as root for the path
215 * be on the same kernfs-root. If @from is not parent of @to, then a relative
482 struct kernfs_root *root = kernfs_root(kn); local
484 lockdep_assert_held_write(&root->kernfs_rwsem);
497 up_write(&root->kernfs_rwsem);
505 wait_event(root->deactivate_waitq,
516 down_write(&root
555 struct kernfs_root *root; local
610 __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) argument
720 kernfs_find_and_get_node_by_id(struct kernfs_root *root, u64 id) argument
773 struct kernfs_root *root = kernfs_root(parent); local
916 struct kernfs_root *root = kernfs_root(parent); local
942 struct kernfs_root *root = kernfs_root(parent); local
964 struct kernfs_root *root; local
1018 kernfs_destroy_root(struct kernfs_root *root) argument
1035 kernfs_root_to_node(struct kernfs_root *root) argument
1115 struct kernfs_root *root; local
1195 struct kernfs_root *root; local
1346 kernfs_next_descendant_post(struct kernfs_node *pos, struct kernfs_node *root) argument
1401 struct kernfs_root *root = kernfs_root(kn); local
1426 struct kernfs_root *root = kernfs_root(kn); local
1520 struct kernfs_root *root; local
1617 struct kernfs_root *root = kernfs_root(kn); local
1680 struct kernfs_root *root; local
1719 struct kernfs_root *root; local
1847 struct kernfs_root *root; local
[all...]
/linux-master/fs/btrfs/
H A Ddisk-io.c47 #include "root-tree.h"
646 static void __setup_root(struct btrfs_root *root, struct btrfs_fs_info *fs_info, argument
651 memset(&root->root_key, 0, sizeof(root->root_key));
652 memset(&root->root_item, 0, sizeof(root->root_item));
653 memset(&root->defrag_progress, 0, sizeof(root->defrag_progress));
654 root->fs_info = fs_info;
655 root
724 struct btrfs_root *root = kzalloc(sizeof(*root), flags); local
734 struct btrfs_root *root; local
761 const struct btrfs_root *root = rb_entry(node, struct btrfs_root, rb_node); local
766 btrfs_global_root_insert(struct btrfs_root *root) argument
784 btrfs_global_root_delete(struct btrfs_root *root) argument
797 struct btrfs_root *root = NULL; local
864 struct btrfs_root *root; local
932 struct btrfs_root *root; local
945 btrfs_alloc_log_tree_node(struct btrfs_trans_handle *trans, struct btrfs_root *root) argument
996 btrfs_add_log_tree(struct btrfs_trans_handle *trans, struct btrfs_root *root) argument
1039 struct btrfs_root *root; local
1101 struct btrfs_root *root; local
1118 btrfs_init_fs_root(struct btrfs_root *root, dev_t anon_dev) argument
1166 struct btrfs_root *root; local
1211 btrfs_insert_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) argument
1237 struct btrfs_root *root; local
1257 struct btrfs_root *root; local
1319 struct btrfs_root *root; local
1458 struct btrfs_root *root; local
1565 struct btrfs_root *root = arg; local
1810 free_root_extent_buffers(struct btrfs_root *root) argument
1822 struct btrfs_root *root, *tmp; local
1847 btrfs_put_root(struct btrfs_root *root) argument
2132 struct btrfs_root *root; local
2239 struct btrfs_root *root; local
2582 load_super_root(struct btrfs_root *root, u64 bytenr, u64 gen, int level) argument
4135 btrfs_drop_and_free_fs_root(struct btrfs_fs_info *fs_info, struct btrfs_root *root) argument
4161 struct btrfs_root *root = fs_info->tree_root; local
4498 btrfs_destroy_ordered_extents(struct btrfs_root *root) argument
4515 struct btrfs_root *root; local
4620 btrfs_destroy_delalloc_inodes(struct btrfs_root *root) argument
4655 struct btrfs_root *root; local
4814 struct btrfs_root *root = gang[i]; local
4912 btrfs_init_root_free_objectid(struct btrfs_root *root) argument
4954 btrfs_get_free_objectid(struct btrfs_root *root, u64 *objectid) argument
[all...]
H A Dfile-item.h53 struct btrfs_root *root, u64 bytenr, u64 len);
56 struct btrfs_root *root, u64 objectid, u64 pos,
59 struct btrfs_root *root,
63 struct btrfs_root *root,
67 int btrfs_lookup_csums_range(struct btrfs_root *root, u64 start, u64 end,
70 int btrfs_lookup_csums_list(struct btrfs_root *root, u64 start, u64 end,
73 int btrfs_lookup_csums_bitmap(struct btrfs_root *root, struct btrfs_path *path,
H A Ddisk-io.h70 struct btrfs_root *root);
80 int btrfs_global_root_insert(struct btrfs_root *root);
81 void btrfs_global_root_delete(struct btrfs_root *root);
92 struct btrfs_root *root);
100 * This function is used to grab the root, and avoid it is freed when we
106 static inline struct btrfs_root *btrfs_grab_root(struct btrfs_root *root) argument
108 if (!root)
110 if (refcount_inc_not_zero(&root->refs))
111 return root;
115 void btrfs_put_root(struct btrfs_root *root);
[all...]
H A Droot-tree.h18 int btrfs_subvolume_reserve_metadata(struct btrfs_root *root,
28 int btrfs_insert_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
31 int btrfs_update_root(struct btrfs_trans_handle *trans, struct btrfs_root *root,
33 int btrfs_find_root(struct btrfs_root *root, const struct btrfs_key *search_key,
40 void btrfs_update_root_times(struct btrfs_trans_handle *trans, struct btrfs_root *root);
H A Dtree-log.h74 struct btrfs_root *root, struct btrfs_log_ctx *ctx);
75 int btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root);
83 struct btrfs_root *root,
87 struct btrfs_root *root,
90 void btrfs_end_log_trans(struct btrfs_root *root);
91 void btrfs_pin_log_trans(struct btrfs_root *root);
H A Dinode-item.h89 struct btrfs_root *root,
92 struct btrfs_root *root, const struct fscrypt_str *name,
95 struct btrfs_root *root, const struct fscrypt_str *name,
98 struct btrfs_root *root,
101 struct btrfs_root *root, struct btrfs_path *path,
106 struct btrfs_root *root,
/linux-master/sound/firewire/tascam/
H A Dtascam-proc.c52 static void add_node(struct snd_tscm *tscm, struct snd_info_entry *root, argument
59 entry = snd_info_create_card_entry(tscm->card, name, root);
66 struct snd_info_entry *root; local
72 root = snd_info_create_card_entry(tscm->card, "firewire",
74 if (root == NULL)
76 root->mode = S_IFDIR | 0555;
78 add_node(tscm, root, "firmware", proc_read_firmware);
/linux-master/sound/firewire/oxfw/
H A Doxfw-proc.c77 static void add_node(struct snd_oxfw *oxfw, struct snd_info_entry *root, argument
84 entry = snd_info_create_card_entry(oxfw->card, name, root);
91 struct snd_info_entry *root; local
97 root = snd_info_create_card_entry(oxfw->card, "firewire",
99 if (root == NULL)
101 root->mode = S_IFDIR | 0555;
103 add_node(oxfw, root, "formation", proc_read_formation);
/linux-master/tools/perf/util/
H A Dstrfilter.c33 strfilter_node__delete(filter->root);
84 struct strfilter_node root, *cur, *last_op; local
90 memset(&root, 0, sizeof(root));
91 last_op = cur = &root;
105 case '|': /* Exchg the root with OR */
106 if (!cur->r || !root.r)
108 cur = strfilter_node__alloc(OP_or, root.r, NULL);
111 root.r = cur;
147 return root
181 struct strfilter_node *right, *root; local
[all...]
/linux-master/lib/zlib_inflate/
H A Dinftrees.c19 requested root table index bits, and on return it is the actual root
29 unsigned root; /* number of index bits for root table */ local
37 unsigned low; /* low bits for current root entry */
38 unsigned mask; /* mask for low root bits */
98 /* bound code lengths, force root to be within code lengths */
99 root = *bits;
102 if (root > max) root
[all...]
/linux-master/fs/vboxsf/
H A Dvfsmod.h48 u32 root; member in struct:vboxsf_sbi
118 int vboxsf_create(u32 root, struct shfl_string *parsed_path,
121 int vboxsf_close(u32 root, u64 handle);
122 int vboxsf_remove(u32 root, struct shfl_string *parsed_path, u32 flags);
123 int vboxsf_rename(u32 root, struct shfl_string *src_path,
126 int vboxsf_read(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf);
127 int vboxsf_write(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf);
129 int vboxsf_dirinfo(u32 root, u64 handle,
132 int vboxsf_fsinfo(u32 root, u64 handle, u32 flags,
135 int vboxsf_map_folder(struct shfl_string *folder_name, u32 *root);
[all...]
H A Dvboxsf_wrappers.c75 int vboxsf_map_folder(struct shfl_string *folder_name, u32 *root) argument
84 parms.root.type = VMMDEV_HGCM_PARM_TYPE_32BIT;
85 parms.root.u.value32 = 0;
98 *root = parms.root.u.value32;
102 int vboxsf_unmap_folder(u32 root) argument
106 parms.root.type = VMMDEV_HGCM_PARM_TYPE_32BIT;
107 parms.root.u.value32 = root;
115 * @root
130 vboxsf_create(u32 root, struct shfl_string *parsed_path, struct shfl_createparms *create_parms) argument
149 vboxsf_close(u32 root, u64 handle) argument
162 vboxsf_remove(u32 root, struct shfl_string *parsed_path, u32 flags) argument
179 vboxsf_rename(u32 root, struct shfl_string *src_path, struct shfl_string *dest_path, u32 flags) argument
201 vboxsf_read(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf) argument
225 vboxsf_write(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf) argument
250 vboxsf_dirinfo(u32 root, u64 handle, struct shfl_string *parsed_path, u32 flags, u32 index, u32 *buf_len, struct shfl_dirinfo *buf, u32 *file_count) argument
294 vboxsf_fsinfo(u32 root, u64 handle, u32 flags, u32 *buf_len, void *buf) argument
320 vboxsf_readlink(u32 root, struct shfl_string *parsed_path, u32 buf_len, u8 *buf) argument
340 vboxsf_symlink(u32 root, struct shfl_string *new_path, struct shfl_string *old_path, struct shfl_fsobjinfo *buf) argument
[all...]
/linux-master/sound/firewire/digi00x/
H A Ddigi00x-proc.c70 struct snd_info_entry *root, *entry; local
76 root = snd_info_create_card_entry(dg00x->card, "firewire",
78 if (root == NULL)
81 root->mode = S_IFDIR | 0555;
83 entry = snd_info_create_card_entry(dg00x->card, "clock", root);
/linux-master/tools/include/linux/
H A Drbtree_augmented.h35 extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
49 rb_insert_augmented(struct rb_node *node, struct rb_root *root, argument
52 __rb_insert_augmented(node, root, augment->rotate);
57 struct rb_root_cached *root, bool newleft,
61 root->rb_leftmost = node;
62 rb_insert_augmented(node, &root->rb_root, augment);
172 struct rb_node *parent, struct rb_root *root)
180 WRITE_ONCE(root->rb_node, new);
183 extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
187 __rb_erase_augmented(struct rb_node *node, struct rb_root *root, argument
56 rb_insert_augmented_cached(struct rb_node *node, struct rb_root_cached *root, bool newleft, const struct rb_augment_callbacks *augment) argument
171 __rb_change_child(struct rb_node *old, struct rb_node *new, struct rb_node *parent, struct rb_root *root) argument
291 rb_erase_augmented(struct rb_node *node, struct rb_root *root, const struct rb_augment_callbacks *augment) argument
300 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, const struct rb_augment_callbacks *augment) argument
[all...]
H A Drbtree.h39 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
64 struct rb_root *root);
86 * @root: 'rb_root *' of the rbtree.
97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \
98 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
103 static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) argument
105 rb_erase(n, root);
127 #define rb_first_cached(root) (root)
129 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) argument
138 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) argument
146 rb_replace_node_cached(struct rb_node *victim, struct rb_node *new, struct rb_root_cached *root) argument
[all...]
/linux-master/tools/testing/selftests/drivers/net/netdevsim/
H A Dtc-mq-visibility.sh20 echo "ERROR ($root): ${@:2}, expected $1 have $n"
28 for root in mq mqprio; do
32 [ $root == "mqprio" ] && opts='hw 0 num_tc 1 map 0 0 0 0 queues 1@0'
34 tcq add root handle 100: $root $opts
/linux-master/include/linux/
H A Drbtree.h30 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
55 struct rb_root *root);
57 struct rb_root *root);
88 * @root: 'rb_root *' of the rbtree.
99 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \
100 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
106 #define rb_first_cached(root) (root)->rb_leftmost
109 struct rb_root_cached *root,
108 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) argument
119 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) argument
131 rb_replace_node_cached(struct rb_node *victim, struct rb_node *new, struct rb_root_cached *root) argument
[all...]
H A Dinterval_tree.h16 struct rb_root_cached *root);
20 struct rb_root_cached *root);
23 interval_tree_iter_first(struct rb_root_cached *root,
/linux-master/drivers/mtd/ubi/
H A Dwl.h6 static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
21 struct rb_root *root);
28 struct rb_root *root) {
26 may_reserve_for_fm(struct ubi_device *ubi, struct ubi_wl_entry *e, struct rb_root *root) argument
/linux-master/drivers/net/ethernet/microchip/lan966x/
H A Dlan966x_tbf.c9 bool root = qopt->parent == TC_H_ROOT; local
14 if (!root) {
20 if (root)
59 bool root = qopt->parent == TC_H_ROOT; local
63 if (!root) {
69 if (root)
/linux-master/arch/x86/kvm/
H A Dkvm_onhyperv.c44 hpa_t root; local
53 * on a common root, in which case future flushes can skip the
54 * loop and flush the common root.
57 root = vcpu->arch.hv_root_tdp;
58 if (!VALID_PAGE(root) || root == kvm_arch->hv_root_tdp)
62 * Set the tracked root to the first valid root. Keep
63 * this root for the entirety of the loop even if more
65 * to avoid flushing the same (first) root agai
[all...]
/linux-master/drivers/ptp/
H A Dptp_qoriq_debugfs.c72 struct dentry *root; local
74 root = debugfs_create_dir(dev_name(ptp_qoriq->dev), NULL);
75 if (IS_ERR(root))
77 if (!root)
80 ptp_qoriq->debugfs_root = root;
82 if (!debugfs_create_file_unsafe("fiper1-loopback", 0600, root,
85 if (!debugfs_create_file_unsafe("fiper2-loopback", 0600, root,
91 debugfs_remove_recursive(root);
/linux-master/mm/
H A Dinterval_tree.c30 struct rb_root_cached *root)
57 rb_insert_augmented(&node->shared.rb, &root->rb_root,
76 struct rb_root_cached *root)
82 __anon_vma_interval_tree_insert(node, root);
86 struct rb_root_cached *root)
88 __anon_vma_interval_tree_remove(node, root);
92 anon_vma_interval_tree_iter_first(struct rb_root_cached *root, argument
95 return __anon_vma_interval_tree_iter_first(root, first, last);
28 vma_interval_tree_insert_after(struct vm_area_struct *node, struct vm_area_struct *prev, struct rb_root_cached *root) argument
75 anon_vma_interval_tree_insert(struct anon_vma_chain *node, struct rb_root_cached *root) argument
85 anon_vma_interval_tree_remove(struct anon_vma_chain *node, struct rb_root_cached *root) argument

Completed in 387 milliseconds

1234567891011>>