Searched refs:root (Results 101 - 125 of 1075) sorted by relevance

1234567891011>>

/linux-master/arch/x86/include/asm/
H A Dvsyscall.h11 extern void set_vsyscall_pgtable_user_bits(pgd_t *root);
/linux-master/drivers/hv/
H A Dhv_debugfs.c54 static int hv_debug_delay_files(struct hv_device *dev, struct dentry *root) argument
63 buffer_file = debugfs_create_file(buffer, 0644, root,
71 message_file = debugfs_create_file(message, 0644, root,
83 static int hv_debug_set_test_state(struct hv_device *dev, struct dentry *root) argument
90 test_state = debugfs_create_file(status, 0644, root,
102 static void hv_debug_set_dir_dentry(struct hv_device *dev, struct dentry *root) argument
105 dev->debug_dir = root;
136 pr_debug("debugfs_hyperv: hyperv/ not in root debugfs path\n");
/linux-master/tools/lib/
H A Drbtree.c19 * 2) The root is black
22 * 5) Every simple path from root to leaves contains the same number
76 struct rb_root *root, int color)
81 __rb_change_child(old, new, parent, root);
85 __rb_insert(struct rb_node *node, struct rb_root *root, argument
96 * The inserted node is root. Either this is the
107 * per 4), we don't want a red root or two
180 __rb_rotate_set_parents(gparent, parent, root, RB_RED);
215 __rb_rotate_set_parents(gparent, parent, root, RB_RED);
227 ____rb_erase_color(struct rb_node *parent, struct rb_root *root, argument
75 __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, struct rb_root *root, int color) argument
410 __rb_erase_color(struct rb_node *parent, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument
433 rb_insert_color(struct rb_node *node, struct rb_root *root) argument
438 rb_erase(struct rb_node *node, struct rb_root *root) argument
453 __rb_insert_augmented(struct rb_node *node, struct rb_root *root, void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) argument
462 rb_first(const struct rb_root *root) argument
474 rb_last(const struct rb_root *root) argument
545 rb_replace_node(struct rb_node *victim, struct rb_node *new, struct rb_root *root) argument
591 rb_first_postorder(const struct rb_root *root) argument
[all...]
/linux-master/fs/btrfs/
H A Ddir-item.c23 struct btrfs_root *root,
30 struct btrfs_fs_info *fs_info = root->fs_info;
35 ret = btrfs_insert_empty_item(trans, root, path, cpu_key, data_size);
57 struct btrfs_root *root,
70 if (name_len + data_len > BTRFS_MAX_XATTR_SIZE(root->fs_info))
78 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
115 struct btrfs_root *root = dir->root; local
135 dir_item = insert_with_overflow(trans, root, path, &key, data_size,
160 if (root
21 insert_with_overflow(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_key *cpu_key, u32 data_size, const char *name, int name_len) argument
56 btrfs_insert_xattr_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 objectid, const char *name, u16 name_len, const void *data, u16 data_len) argument
177 btrfs_lookup_match_dir( struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_key *key, const char *name, int name_len, int mod) argument
212 btrfs_lookup_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 dir, const struct fscrypt_str *name, int mod) argument
233 btrfs_check_dir_item_collision(struct btrfs_root *root, u64 dir, const struct fscrypt_str *name) argument
308 btrfs_lookup_dir_index_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 dir, u64 index, const struct fscrypt_str *name, int mod) argument
329 btrfs_search_dir_index_item(struct btrfs_root *root, struct btrfs_path *path, u64 dirid, const struct fscrypt_str *name) argument
356 btrfs_lookup_xattr(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 dir, const char *name, u16 name_len, int mod) argument
417 btrfs_delete_one_dir_name(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_dir_item *di) argument
[all...]
H A Dmisc.h69 static inline struct rb_node *rb_simple_search(struct rb_root *root, u64 bytenr) argument
71 struct rb_node *node = root->rb_node;
88 * Search @root from an entry that starts or comes after @bytenr.
90 * @root: the root to search.
96 static inline struct rb_node *rb_simple_search_first(struct rb_root *root, argument
99 struct rb_node *node = root->rb_node, *ret = NULL;
122 static inline struct rb_node *rb_simple_insert(struct rb_root *root, u64 bytenr, argument
125 struct rb_node **p = &root->rb_node;
142 rb_insert_color(node, root);
[all...]
H A Dctree.c30 *root, struct btrfs_path *path, int level);
31 static int split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root,
245 * safely gets a reference on the root node of a tree. A lock
247 * at the root of the tree. See btrfs_lock_root_node for the
251 * it won't disappear. It may stop being the root of the tree
254 struct extent_buffer *btrfs_root_node(struct btrfs_root *root) argument
260 eb = rcu_dereference(root->node);
263 * RCU really hurts here, we could free up the root node because
264 * it was COWed but we may not get the new root node yet so do
279 * Cowonly root (no
283 add_root_to_dirty_list(struct btrfs_root *root) argument
309 btrfs_copy_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer **cow_ret, u64 new_root_objectid) argument
373 btrfs_block_can_be_shared(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf) argument
410 update_ref_for_cow(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *cow, int *last_ref) argument
532 btrfs_force_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, u64 search_start, u64 empty_size, enum btrfs_lock_nesting nest) argument
665 should_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf) argument
700 btrfs_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *parent, int parent_slot, struct extent_buffer **cow_ret, enum btrfs_lock_nesting nest) argument
860 root_add_used_bytes(struct btrfs_root *root) argument
868 root_sub_used_bytes(struct btrfs_root *root) argument
914 balance_level(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int level) argument
1172 push_nodes_for_insert(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int level) argument
1493 read_block_for_search(struct btrfs_root *root, struct btrfs_path *p, struct extent_buffer **eb_ret, int level, int slot, const struct btrfs_key *key) argument
1618 setup_nodes_for_search(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *p, struct extent_buffer *b, int level, int ins_len, int *write_lock_level) argument
1698 btrfs_search_slot_get_root(struct btrfs_root *root, struct btrfs_path *p, int write_lock_level) argument
1838 search_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *path, int ins_len, int prev_cmp) argument
1997 btrfs_search_slot(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, int ins_len, int cow) argument
2248 btrfs_search_old_slot(struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, u64 time_seq) argument
2350 btrfs_prev_leaf(struct btrfs_root *root, struct btrfs_path *path) argument
2434 btrfs_search_slot_for_read(struct btrfs_root *root, const struct btrfs_key *key, struct btrfs_path *p, int find_higher, int return_any) argument
2505 btrfs_search_backwards(struct btrfs_root *root, struct btrfs_key *key, struct btrfs_path *path) argument
2531 btrfs_get_next_valid_item(struct btrfs_root *root, struct btrfs_key *key, struct btrfs_path *path) argument
2848 insert_new_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int level) argument
2970 split_node(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int level) argument
3243 push_leaf_right(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int min_data_size, int data_size, int empty, u32 min_slot) argument
3459 push_leaf_left(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int min_data_size, int data_size, int empty, u32 max_slot) argument
3590 push_for_double_split(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int data_size) argument
3650 split_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *ins_key, struct btrfs_path *path, int data_size, int extend) argument
3835 setup_leaf_for_split(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int ins_len) argument
3983 btrfs_split_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct btrfs_key *new_key, unsigned long split_offset) argument
4167 setup_items_for_insert(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct btrfs_item_batch *batch) argument
4264 btrfs_setup_item_for_insert(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct btrfs_key *key, u32 data_size) argument
4288 btrfs_insert_empty_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct btrfs_item_batch *batch) argument
4315 btrfs_insert_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct btrfs_key *cpu_key, void *data, u32 data_size) argument
4346 btrfs_duplicate_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, const struct btrfs_key *new_key) argument
4380 btrfs_del_ptr(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int level, int slot) argument
4437 btrfs_del_leaf(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *leaf) argument
4466 btrfs_del_items(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int slot, int nr) argument
4614 btrfs_search_forward(struct btrfs_root *root, struct btrfs_key *min_key, struct btrfs_path *path, u64 min_trans) argument
4729 btrfs_find_next_key(struct btrfs_root *root, struct btrfs_path *path, struct btrfs_key *key, int level, u64 min_trans) argument
4794 btrfs_next_old_leaf(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) argument
4995 btrfs_next_old_item(struct btrfs_root *root, struct btrfs_path *path, u64 time_seq) argument
5009 btrfs_previous_item(struct btrfs_root *root, struct btrfs_path *path, u64 min_objectid, int type) argument
5051 btrfs_previous_extent_item(struct btrfs_root *root, struct btrfs_path *path, u64 min_objectid) argument
[all...]
H A Dtree-log.c25 #include "root-tree.h"
109 struct btrfs_root *root,
112 struct btrfs_root *root,
116 static void wait_log_commit(struct btrfs_root *root, int transid);
129 * a special tree (one per subvolume root), that tree is written to disk
147 struct btrfs_root *root,
150 struct btrfs_fs_info *fs_info = root->fs_info;
157 * First check if the log root tree was already created. If not, create
158 * it before locking the root's log_mutex, just to keep lockdep happy.
174 mutex_lock(&root
146 start_log_trans(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_log_ctx *ctx) argument
234 join_running_log_trans(struct btrfs_root *root) argument
263 btrfs_pin_log_trans(struct btrfs_root *root) argument
272 btrfs_end_log_trans(struct btrfs_root *root) argument
373 overwrite_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *eb, int slot, struct btrfs_key *key) argument
598 read_one_inode(struct btrfs_root *root, u64 objectid) argument
621 replay_one_extent(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *eb, int slot, struct btrfs_key *key) argument
929 struct btrfs_root *root = dir->root; local
969 inode_in_dir(struct btrfs_root *root, struct btrfs_path *path, u64 dirid, u64 objectid, u64 index, struct fscrypt_str *name) argument
1048 __add_inode_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_root *log_root, struct btrfs_inode *dir, struct btrfs_inode *inode, u64 inode_objectid, u64 parent_objectid, u64 ref_index, struct fscrypt_str *name) argument
1261 unlink_old_inode_refs(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_inode *inode, struct extent_buffer *log_eb, int log_slot, struct btrfs_key *key) argument
1345 add_inode_ref(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_root *log, struct btrfs_path *path, struct extent_buffer *eb, int slot, struct btrfs_key *key) argument
1596 struct btrfs_root *root = BTRFS_I(inode)->root; local
1645 fixup_inode_link_counts(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path) argument
1706 link_to_fixup_dir(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 objectid) argument
1745 insert_one_name(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 dirid, u64 index, const struct fscrypt_str *name, struct btrfs_key *location) argument
1819 replay_one_name(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *eb, struct btrfs_dir_item *di, struct btrfs_key *key) argument
1948 replay_one_dir_item(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct extent_buffer *eb, int slot, struct btrfs_key *key) argument
2018 find_dir_range(struct btrfs_root *root, struct btrfs_path *path, u64 dirid, u64 *start_ret, u64 *end_ret) argument
2101 struct btrfs_root *root = BTRFS_I(dir)->root; local
2170 replay_xattr_deletes(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_root *log, struct btrfs_path *path, const u64 ino) argument
2278 replay_dir_deletes(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_root *log, struct btrfs_path *path, u64 dirid, int del_all) argument
2391 struct btrfs_root *root = wc->replay_dest; local
2583 walk_down_log_tree(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int *level, struct walk_control *wc) argument
2663 walk_up_log_tree(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, int *level, struct walk_control *wc) argument
2779 wait_log_commit(struct btrfs_root *root, int transid) argument
2804 wait_for_writer(struct btrfs_root *root) argument
2867 btrfs_remove_log_ctx(struct btrfs_root *root, struct btrfs_log_ctx *ctx) argument
2879 btrfs_remove_all_log_ctxs(struct btrfs_root *root, int index, int error) argument
2902 btrfs_sync_log(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_log_ctx *ctx) argument
3261 btrfs_free_log(struct btrfs_trans_handle *trans, struct btrfs_root *root) argument
3456 btrfs_del_dir_entries_in_log(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct fscrypt_str *name, struct btrfs_inode *dir, u64 index) argument
3495 btrfs_del_inode_ref_in_log(struct btrfs_trans_handle *trans, struct btrfs_root *root, const struct fscrypt_str *name, struct btrfs_inode *inode, u64 dirid) argument
3814 struct btrfs_root *root = inode->root; local
4771 struct btrfs_root *root = inode->root; local
5048 struct btrfs_root *root = inode->root; local
5125 struct btrfs_root *root = inode->root; local
5431 struct btrfs_root *root = start_inode->root; local
5592 conflicting_inode_is_dir(struct btrfs_root *root, u64 ino, struct btrfs_path *path) argument
5629 add_conflicting_inode(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, u64 ino, u64 parent, struct btrfs_log_ctx *ctx) argument
5745 log_conflicting_inodes(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_log_ctx *ctx) argument
5860 struct btrfs_root *root = inode->root; local
6727 struct btrfs_root *root = inode->root; local
6841 log_new_ancestors(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct btrfs_path *path, struct btrfs_log_ctx *ctx) argument
6911 struct btrfs_root *root = inode->root; local
6949 struct btrfs_root *root = inode->root; local
7039 struct btrfs_root *root = inode->root; local
7289 struct btrfs_root *root = wc.replay_dest; local
7456 struct btrfs_root *root = inode->root; local
[all...]
H A Dexport.c37 fid->root_objectid = BTRFS_I(inode)->root->root_key.objectid;
45 parent_root_id = BTRFS_I(parent)->root->root_key.objectid;
62 * Read dentry of inode with @objectid from filesystem root @root_objectid.
66 * @root_objectid: object id of the subvolume root where to look up the inode
77 struct btrfs_root *root; local
83 root = btrfs_get_fs_root(fs_info, root_objectid, true);
84 if (IS_ERR(root))
85 return ERR_CAST(root);
87 inode = btrfs_iget(sb, objectid, root);
88 btrfs_put_root(root);
150 struct btrfs_root *root = BTRFS_I(dir)->root; local
226 struct btrfs_root *root = BTRFS_I(dir)->root; local
[all...]
H A Dordered-data.c35 static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, argument
38 struct rb_node **p = &root->rb_node;
55 rb_insert_color(node, root);
63 static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, argument
66 struct rb_node *n = root->rb_node;
211 struct btrfs_root *root = inode->root; local
212 struct btrfs_fs_info *fs_info = root->fs_info;
232 spin_lock(&root->ordered_extent_lock);
234 &root
579 struct btrfs_root *root = btrfs_inode->root; local
681 btrfs_wait_ordered_extents(struct btrfs_root *root, u64 nr, const u64 range_start, const u64 range_len) argument
740 struct btrfs_root *root; local
1140 struct btrfs_root *root = inode->root; local
[all...]
/linux-master/arch/x86/kvm/mmu/
H A Dtdp_iter.c20 * Return the TDP iterator to the root PT and allow it to continue its
39 void tdp_iter_start(struct tdp_iter *iter, struct kvm_mmu_page *root, argument
42 if (WARN_ON_ONCE(!root || (root->role.level < 1) ||
43 (root->role.level > PT64_ROOT_MAX_LEVEL))) {
49 iter->root_level = root->role.level;
51 iter->pt_path[iter->root_level - 1] = (tdp_ptep_t)root->spt;
52 iter->as_id = kvm_mmu_page_as_id(root);
131 * successful step up, false if already in the root page.
H A Dtdp_iter.h96 /* The level of the root page given to the iterator */
113 * which case tdp_iter_next() needs to restart the walk at the root
123 #define for_each_tdp_pte_min_level(iter, root, min_level, start, end) \
124 for (tdp_iter_start(&iter, root, min_level, start); \
128 #define for_each_tdp_pte(iter, root, start, end) \
129 for_each_tdp_pte_min_level(iter, root, PG_LEVEL_4K, start, end)
133 void tdp_iter_start(struct tdp_iter *iter, struct kvm_mmu_page *root,
/linux-master/drivers/infiniband/hw/hns/
H A Dhns_roce_debugfs.c78 dbgfs->root = debugfs_create_dir("sw_stat", parent);
80 init_debugfs_seqfile(&dbgfs->sw_stat, "sw_stat", dbgfs->root,
89 dbgfs->root = debugfs_create_dir(dev_name(&hr_dev->ib_dev.dev),
92 create_sw_stat_debugfs(hr_dev, dbgfs->root);
97 debugfs_remove_recursive(hr_dev->dbgfs.root);
/linux-master/arch/x86/pci/
H A Dacpi.c277 struct acpi_pci_root *root = ci->root; local
281 info->start_bus = (u8)root->secondary.start;
282 info->end_bus = (u8)root->secondary.end;
287 &root->secondary, &root->mcfg_addr);
297 root->mcfg_addr);
332 static int pci_acpi_root_get_node(struct acpi_pci_root *root) argument
334 int busnum = root->secondary.start;
335 struct acpi_device *device = root
414 pci_acpi_scan_root(struct acpi_pci_root *root) argument
[all...]
/linux-master/include/linux/
H A Dof_platform.h70 extern int of_platform_bus_probe(struct device_node *root,
82 extern int of_platform_populate(struct device_node *root,
86 extern int of_platform_default_populate(struct device_node *root,
107 static inline int of_platform_populate(struct device_node *root, argument
114 static inline int of_platform_default_populate(struct device_node *root, argument
H A Dinterval_tree_generic.h39 struct rb_root_cached *root) \
41 struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
61 rb_insert_augmented_cached(&node->ITRB, root, \
66 struct rb_root_cached *root) \
68 rb_erase_augmented_cached(&node->ITRB, root, &ITPREFIX ## _augment); \
119 ITPREFIX ## _iter_first(struct rb_root_cached *root, \
124 if (!root->rb_root.rb_node) \
135 * rely on the root node, which by augmented interval tree \
140 node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
144 leftmost = rb_entry(root
[all...]
/linux-master/kernel/cgroup/
H A Dcgroup-v1.c58 struct cgroup_root *root; local
63 for_each_root(root) {
67 from_cgrp = task_cgroup_from_root(from, root);
550 BUILD_BUG_ON(sizeof(cgrp->root->release_agent_path) < PATH_MAX);
565 strscpy(cgrp->root->release_agent_path, strstrip(buf),
566 sizeof(cgrp->root->release_agent_path));
577 seq_puts(seq, cgrp->root->release_agent_path);
680 ss->legacy_name, ss->root->hierarchy_id,
681 atomic_read(&ss->root->nr_cgrps),
760 * relative to the root o
864 struct cgroup_root *root = cgroup_root_from_kf(kf_root); local
1073 struct cgroup_root *root = cgroup_root_from_kf(kf_root); local
1144 struct cgroup_root *root; local
1278 struct cgroup_root *root; local
[all...]
/linux-master/arch/loongarch/pci/
H A Dacpi.c46 struct acpi_pci_root *root = acpi_driver_data(adev); local
48 return root->segment;
71 entry->offset = ci->root->mcfg_addr & GENMASK_ULL(63, 40);
156 pci_acpi_setup_ecam_mapping(struct acpi_pci_root *root) argument
159 u16 seg = root->segment;
160 struct device *dev = &root->device->dev;
162 struct resource *bus_res = &root->secondary;
166 ret = pci_mcfg_lookup(root, &cfgres, &ecam_ops);
170 root->mcfg_addr = mcfg_addr_init(0);
178 cfgres.start = root
193 pci_acpi_scan_root(struct acpi_pci_root *root) argument
[all...]
/linux-master/tools/testing/selftests/cgroup/
H A Dtest_cpuset.c65 static int test_cpuset_perms_object(const char *root, bool allow) argument
73 parent = cg_name(root, "cpuset_test_0");
152 static int test_cpuset_perms_object_allow(const char *root) argument
154 return test_cpuset_perms_object(root, true);
157 static int test_cpuset_perms_object_deny(const char *root) argument
159 return test_cpuset_perms_object(root, false);
167 static int test_cpuset_perms_subtree(const char *root) argument
175 parent = cg_name(root, "cpuset_test_0");
238 int (*fn)(const char *root);
249 char root[PATH_MA local
[all...]
H A Dtest_freezer.c136 static int test_cgfreezer_simple(const char *root) argument
142 cgroup = cg_name(root, "cg_test_simple");
188 static int test_cgfreezer_tree(const char *root) argument
194 cgroup[0] = cg_name(root, "cg_test_tree_A");
360 static int test_cgfreezer_forkbomb(const char *root) argument
365 cgroup = cg_name(root, "cg_forkbomb_test");
399 static int test_cgfreezer_mkdir(const char *root) argument
405 parent = cg_name(root, "cg_test_mkdir_A");
453 static int test_cgfreezer_rmdir(const char *root) argument
458 parent = cg_name(root, "cg_test_rmdir_
508 test_cgfreezer_migrate(const char *root) argument
583 test_cgfreezer_ptrace(const char *root) argument
665 test_cgfreezer_stopped(const char *root) argument
709 test_cgfreezer_ptraced(const char *root) argument
778 test_cgfreezer_vfork(const char *root) argument
827 char root[PATH_MAX]; local
[all...]
H A Dtest_kmem.c52 static int test_kmem_basic(const char *root) argument
58 cg = cg_name(root, "kmem_basic_test");
167 static int test_kmem_memcg_deletion(const char *root) argument
173 parent = cg_name(root, "kmem_memcg_deletion_test");
217 static int test_kmem_proc_kpagecgroup(const char *root) argument
277 static int test_kmem_kernel_stacks(const char *root) argument
282 cg = cg_name(root, "kmem_kernel_stacks_test");
305 static int test_kmem_dead_cgroups(const char *root) argument
312 parent = cg_name(root, "kmem_dead_cgroups_test");
352 static int test_percpu_basic(const char *root) argument
420 char root[PATH_MAX]; local
[all...]
/linux-master/drivers/gpu/drm/i915/
H A Di915_syncmap.c39 * the root. This allows us to access the whole tree via a single pointer
86 * @root: pointer to the #i915_syncmap
88 void i915_syncmap_init(struct i915_syncmap **root) argument
92 BUILD_BUG_ON(KSYNCMAP > BITS_PER_TYPE((*root)->bitmap));
93 *root = NULL;
139 * @root: pointer to the #i915_syncmap
143 * If we have already synchronised this @root timeline with another (@id) then
151 bool i915_syncmap_is_later(struct i915_syncmap **root, u64 id, u32 seqno) argument
156 p = *root;
186 *root
227 __sync_set(struct i915_syncmap **root, u64 id, u32 seqno) argument
350 i915_syncmap_set(struct i915_syncmap **root, u64 id, u32 seqno) argument
392 i915_syncmap_free(struct i915_syncmap **root) argument
[all...]
/linux-master/fs/nfs/blocklayout/
H A Dextent_tree.c19 ext_tree_first(struct rb_root *root) argument
21 struct rb_node *node = rb_first(root);
46 __ext_tree_search(struct rb_root *root, sector_t start) argument
48 struct rb_node *node = root->rb_node;
95 ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) argument
101 rb_erase(&be->be_node, root);
111 ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) argument
117 rb_erase(&right->be_node, root);
136 __ext_tree_insert(struct rb_root *root, argument
139 struct rb_node **p = &root
177 __ext_tree_remove(struct rb_root *root, sector_t start, sector_t end, struct list_head *tmp) argument
258 struct rb_root *root; local
322 __ext_tree_lookup(struct rb_root *root, sector_t isect, struct pnfs_block_extent *ret) argument
380 ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, sector_t split) argument
408 struct rb_root *root = &bl->bl_ext_rw; local
618 struct rb_root *root = &bl->bl_ext_rw; local
[all...]
/linux-master/fs/afs/
H A Ddynroot.c2 /* AFS dynamic root handling
42 * Create an inode for a dynamic root directory or an autocell dynamic
45 struct inode *afs_iget_pseudo_dir(struct super_block *sb, bool root) argument
56 if (root) {
82 if (root) {
96 if (!root) {
274 struct dentry *root, *subdir; local
281 root = sb->s_root;
282 inode_lock(root->d_inode);
283 subdir = lookup_one_len(cell->name, root, cel
304 struct dentry *root, *subdir; local
367 struct dentry *root = sb->s_root, *subdir; local
[all...]
/linux-master/tools/testing/selftests/alsa/
H A Dconf.c349 static int conf_get_by_keys(snd_config_t *root, const char *key1, argument
355 ret = snd_config_search(root, key1, &root);
360 ret = snd_config_search(root, key2, &root);
362 *result = root;
366 snd_config_t *conf_get_subtree(snd_config_t *root, const char *key1, const char *key2) argument
370 if (!root)
372 ret = conf_get_by_keys(root, key1, key2, &root);
380 conf_get_count(snd_config_t *root, const char *key1, const char *key2) argument
401 conf_get_string(snd_config_t *root, const char *key1, const char *key2, const char *def) argument
419 conf_get_long(snd_config_t *root, const char *key1, const char *key2, long def) argument
437 conf_get_bool(snd_config_t *root, const char *key1, const char *key2, int def) argument
455 conf_get_string_array(snd_config_t *root, const char *key1, const char *key2, const char **array, int array_size, const char *def) argument
[all...]
/linux-master/tools/testing/radix-tree/
H A Dbenchmark.c14 static long long benchmark_iter(struct radix_tree_root *root, bool tagged) argument
29 radix_tree_for_each_tagged(slot, root, &iter, 0, 0)
32 radix_tree_for_each_slot(slot, root, &iter, 0)
52 static void benchmark_insert(struct radix_tree_root *root, argument
62 item_insert(root, index);
73 static void benchmark_tagging(struct radix_tree_root *root, argument
83 radix_tree_tag_set(root, index, 0);
94 static void benchmark_delete(struct radix_tree_root *root, argument
104 item_delete(root, index);

Completed in 637 milliseconds

1234567891011>>