Home
last modified time | relevance | path

Searched refs:root (Results 1 - 25 of 1974) sorted by relevance

12345678910>>...79

/kernel/linux/linux-5.10/fs/btrfs/
H A Dinode-map.c16 static void fail_caching_thread(struct btrfs_root *root) in fail_caching_thread() argument
18 struct btrfs_fs_info *fs_info = root->fs_info; in fail_caching_thread()
23 spin_lock(&root->ino_cache_lock); in fail_caching_thread()
24 root->ino_cache_state = BTRFS_CACHE_ERROR; in fail_caching_thread()
25 spin_unlock(&root->ino_cache_lock); in fail_caching_thread()
26 wake_up(&root->ino_cache_wait); in fail_caching_thread()
31 struct btrfs_root *root = data; in caching_kthread() local
32 struct btrfs_fs_info *fs_info = root->fs_info; in caching_kthread()
33 struct btrfs_free_space_ctl *ctl = root->free_ino_ctl; in caching_kthread()
46 fail_caching_thread(root); in caching_kthread()
139 start_caching(struct btrfs_root *root) start_caching() argument
189 btrfs_find_free_ino(struct btrfs_root *root, u64 *objectid) btrfs_find_free_ino() argument
216 btrfs_return_ino(struct btrfs_root *root, u64 objectid) btrfs_return_ino() argument
252 btrfs_unpin_free_ino(struct btrfs_root *root) btrfs_unpin_free_ino() argument
369 btrfs_init_free_ino_ctl(struct btrfs_root *root) btrfs_init_free_ino_ctl() argument
397 btrfs_save_ino_cache(struct btrfs_root *root, struct btrfs_trans_handle *trans) btrfs_save_ino_cache() argument
[all...]
H A Dtree-defrag.c20 struct btrfs_root *root) in btrfs_defrag_leaves()
30 if (root->fs_info->extent_root == root) { in btrfs_defrag_leaves()
33 * we can't defrag the extent root without deadlock in btrfs_defrag_leaves()
38 if (!test_bit(BTRFS_ROOT_SHAREABLE, &root->state)) in btrfs_defrag_leaves()
45 level = btrfs_header_level(root->node); in btrfs_defrag_leaves()
50 if (root->defrag_progress.objectid == 0) { in btrfs_defrag_leaves()
54 root_node = btrfs_lock_root_node(root); in btrfs_defrag_leaves()
57 root->defrag_max.objectid = 0; in btrfs_defrag_leaves()
59 btrfs_node_key_to_cpu(root_node, &root in btrfs_defrag_leaves()
19 btrfs_defrag_leaves(struct btrfs_trans_handle *trans, struct btrfs_root *root) btrfs_defrag_leaves() argument
[all...]
/kernel/linux/linux-6.6/drivers/acpi/
H A Dpci_root.c60 * acpi_is_root_bridge - determine whether an ACPI CA node is a PCI root bridge
154 static void decode_osc_bits(struct acpi_pci_root *root, char *msg, u32 word, in decode_osc_bits() argument
167 dev_info(&root->device->dev, "_OSC: %s [%s]\n", msg, buf); in decode_osc_bits()
170 static void decode_osc_support(struct acpi_pci_root *root, char *msg, u32 word) in decode_osc_support() argument
172 decode_osc_bits(root, msg, word, pci_osc_support_bit, in decode_osc_support()
176 static void decode_osc_control(struct acpi_pci_root *root, char *msg, u32 word) in decode_osc_control() argument
178 decode_osc_bits(root, msg, word, pci_osc_control_bit, in decode_osc_control()
182 static void decode_cxl_osc_support(struct acpi_pci_root *root, char *msg, u32 word) in decode_cxl_osc_support() argument
184 decode_osc_bits(root, msg, word, cxl_osc_support_bit, in decode_cxl_osc_support()
188 static void decode_cxl_osc_control(struct acpi_pci_root *root, cha argument
194 is_pcie(struct acpi_pci_root *root) is_pcie() argument
199 is_cxl(struct acpi_pci_root *root) is_cxl() argument
207 to_uuid(struct acpi_pci_root *root) to_uuid() argument
214 cap_length(struct acpi_pci_root *root) cap_length() argument
221 acpi_pci_run_osc(struct acpi_pci_root *root, const u32 *capbuf, u32 *pci_control, u32 *cxl_control) acpi_pci_run_osc() argument
243 acpi_pci_query_osc(struct acpi_pci_root *root, u32 support, u32 *control, u32 cxl_support, u32 *cxl_control) acpi_pci_query_osc() argument
285 struct acpi_pci_root *root; acpi_pci_find_root() local
360 struct acpi_pci_root *root; acpi_pci_osc_control_set() local
546 os_control_query_checks(struct acpi_pci_root *root, u32 support) os_control_query_checks() argument
564 negotiate_os_control(struct acpi_pci_root *root, int *no_aspm) negotiate_os_control() argument
650 struct acpi_pci_root *root; acpi_pci_root_add() local
780 struct acpi_pci_root *root = acpi_driver_data(device); acpi_pci_root_remove() local
810 struct resource *res1, *res2, *root = NULL; acpi_pci_root_validate_resources() local
938 struct resource *res, *conflict, *root = NULL; pci_acpi_root_add_resources() local
1001 acpi_pci_root_create(struct acpi_pci_root *root, struct acpi_pci_root_ops *ops, struct acpi_pci_root_info *info, void *sysdata) acpi_pci_root_create() argument
[all...]
/kernel/linux/linux-5.10/drivers/acpi/
H A Dpci_root.c60 * acpi_is_root_bridge - determine whether an ACPI CA node is a PCI root bridge
144 static void decode_osc_bits(struct acpi_pci_root *root, char *msg, u32 word, in decode_osc_bits() argument
157 dev_info(&root->device->dev, "_OSC: %s [%s]\n", msg, buf); in decode_osc_bits()
160 static void decode_osc_support(struct acpi_pci_root *root, char *msg, u32 word) in decode_osc_support() argument
162 decode_osc_bits(root, msg, word, pci_osc_support_bit, in decode_osc_support()
166 static void decode_osc_control(struct acpi_pci_root *root, char *msg, u32 word) in decode_osc_control() argument
168 decode_osc_bits(root, msg, word, pci_osc_control_bit, in decode_osc_control()
193 static acpi_status acpi_pci_query_osc(struct acpi_pci_root *root, in acpi_pci_query_osc() argument
201 support |= root->osc_support_set; in acpi_pci_query_osc()
207 capbuf[OSC_CONTROL_DWORD] = *control | root in acpi_pci_query_osc()
222 acpi_pci_osc_support(struct acpi_pci_root *root, u32 flags) acpi_pci_osc_support() argument
234 struct acpi_pci_root *root; acpi_pci_find_root() local
273 struct acpi_pci_root *root; acpi_get_pci_dev() local
356 struct acpi_pci_root *root; acpi_pci_osc_control_set() local
409 negotiate_os_control(struct acpi_pci_root *root, int *no_aspm, bool is_pcie) negotiate_os_control() argument
531 struct acpi_pci_root *root; acpi_pci_root_add() local
654 struct acpi_pci_root *root = acpi_driver_data(device); acpi_pci_root_remove() local
684 struct resource *res1, *res2, *root = NULL; acpi_pci_root_validate_resources() local
814 struct resource *res, *conflict, *root = NULL; pci_acpi_root_add_resources() local
877 acpi_pci_root_create(struct acpi_pci_root *root, struct acpi_pci_root_ops *ops, struct acpi_pci_root_info *info, void *sysdata) acpi_pci_root_create() argument
[all...]
/kernel/linux/linux-5.10/lib/
H A Dradix-tree.c43 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared.
93 static inline gfp_t root_gfp_mask(const struct radix_tree_root *root) in root_gfp_mask() argument
95 return root->xa_flags & (__GFP_BITS_MASK & ~GFP_ZONEMASK); in root_gfp_mask()
116 static inline void root_tag_set(struct radix_tree_root *root, unsigned tag) in root_tag_set() argument
118 root->xa_flags |= (__force gfp_t)(1 << (tag + ROOT_TAG_SHIFT)); in root_tag_set()
121 static inline void root_tag_clear(struct radix_tree_root *root, unsigned tag) in root_tag_clear() argument
123 root->xa_flags &= (__force gfp_t)~(1 << (tag + ROOT_TAG_SHIFT)); in root_tag_clear()
126 static inline void root_tag_clear_all(struct radix_tree_root *root) in root_tag_clear_all() argument
128 root->xa_flags &= (__force gfp_t)((1 << ROOT_TAG_SHIFT) - 1); in root_tag_clear_all()
131 static inline int root_tag_get(const struct radix_tree_root *root, unsigne argument
136 root_tags_get(const struct radix_tree_root *root) root_tags_get() argument
141 is_idr(const struct radix_tree_root *root) is_idr() argument
231 radix_tree_node_alloc(gfp_t gfp_mask, struct radix_tree_node *parent, struct radix_tree_root *root, unsigned int shift, unsigned int offset, unsigned int count, unsigned int nr_values) radix_tree_node_alloc() argument
386 radix_tree_load_root(const struct radix_tree_root *root, struct radix_tree_node **nodep, unsigned long *maxindex) radix_tree_load_root() argument
406 radix_tree_extend(struct radix_tree_root *root, gfp_t gfp, unsigned long index, unsigned int shift) radix_tree_extend() argument
466 radix_tree_shrink(struct radix_tree_root *root) radix_tree_shrink() argument
541 delete_node(struct radix_tree_root *root, struct radix_tree_node *node) delete_node() argument
596 __radix_tree_create(struct radix_tree_root *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp) __radix_tree_create() argument
701 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_insert() argument
745 __radix_tree_lookup(const struct radix_tree_root *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp) __radix_tree_lookup() argument
792 radix_tree_lookup_slot(const struct radix_tree_root *root, unsigned long index) radix_tree_lookup_slot() argument
815 radix_tree_lookup(const struct radix_tree_root *root, unsigned long index) radix_tree_lookup() argument
832 node_tag_get(const struct radix_tree_root *root, const struct radix_tree_node *node, unsigned int tag, unsigned int offset) node_tag_get() argument
848 calculate_count(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item, void *old) calculate_count() argument
873 __radix_tree_replace(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item) __radix_tree_replace() argument
912 radix_tree_replace_slot(struct radix_tree_root *root, void __rcu **slot, void *item) radix_tree_replace_slot() argument
928 radix_tree_iter_replace(struct radix_tree_root *root, const struct radix_tree_iter *iter, void __rcu **slot, void *item) radix_tree_iter_replace() argument
935 node_tag_set(struct radix_tree_root *root, struct radix_tree_node *node, unsigned int tag, unsigned int offset) node_tag_set() argument
964 radix_tree_tag_set(struct radix_tree_root *root, unsigned long index, unsigned int tag) radix_tree_tag_set() argument
992 node_tag_clear(struct radix_tree_root *root, struct radix_tree_node *node, unsigned int tag, unsigned int offset) node_tag_clear() argument
1026 radix_tree_tag_clear(struct radix_tree_root *root, unsigned long index, unsigned int tag) radix_tree_tag_clear() argument
1057 radix_tree_iter_tag_clear(struct radix_tree_root *root, const struct radix_tree_iter *iter, unsigned int tag) radix_tree_iter_tag_clear() argument
1078 radix_tree_tag_get(const struct radix_tree_root *root, unsigned long index, unsigned int tag) radix_tree_tag_get() argument
1151 radix_tree_next_chunk(const struct radix_tree_root *root, struct radix_tree_iter *iter, unsigned flags) radix_tree_next_chunk() argument
1259 radix_tree_gang_lookup(const struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items) radix_tree_gang_lookup() argument
1299 radix_tree_gang_lookup_tag(const struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items, unsigned int tag) radix_tree_gang_lookup_tag() argument
1340 radix_tree_gang_lookup_tag_slot(const struct radix_tree_root *root, void __rcu ***results, unsigned long first_index, unsigned int max_items, unsigned int tag) radix_tree_gang_lookup_tag_slot() argument
1361 __radix_tree_delete(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot) __radix_tree_delete() argument
1391 radix_tree_iter_delete(struct radix_tree_root *root, struct radix_tree_iter *iter, void __rcu **slot) radix_tree_iter_delete() argument
1410 radix_tree_delete_item(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_delete_item() argument
1442 radix_tree_delete(struct radix_tree_root *root, unsigned long index) radix_tree_delete() argument
1453 radix_tree_tagged(const struct radix_tree_root *root, unsigned int tag) radix_tree_tagged() argument
1473 idr_get_free(struct radix_tree_root *root, struct radix_tree_iter *iter, gfp_t gfp, unsigned long max) idr_get_free() argument
[all...]
H A Drbtree_test.c27 static struct rb_root_cached root = RB_ROOT_CACHED; variable
32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() argument
34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert()
46 rb_insert_color(&node->rb, &root->rb_root); in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() argument
51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached()
66 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() argument
71 rb_erase(&node->rb, &root->rb_root); in erase()
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached() argument
85 insert_augmented(struct test_node *node, struct rb_root_cached *root) insert_augmented() argument
109 insert_augmented_cached(struct test_node *node, struct rb_root_cached *root) insert_augmented_cached() argument
138 erase_augmented(struct test_node *node, struct rb_root_cached *root) erase_augmented() argument
143 erase_augmented_cached(struct test_node *node, struct rb_root_cached *root) erase_augmented_cached() argument
[all...]
/kernel/linux/linux-6.6/lib/
H A Dradix-tree.c45 * of RADIX_TREE_MAX_PATH size to be created, with only the root node shared.
95 static inline gfp_t root_gfp_mask(const struct radix_tree_root *root) in root_gfp_mask() argument
97 return root->xa_flags & (__GFP_BITS_MASK & ~GFP_ZONEMASK); in root_gfp_mask()
118 static inline void root_tag_set(struct radix_tree_root *root, unsigned tag) in root_tag_set() argument
120 root->xa_flags |= (__force gfp_t)(1 << (tag + ROOT_TAG_SHIFT)); in root_tag_set()
123 static inline void root_tag_clear(struct radix_tree_root *root, unsigned tag) in root_tag_clear() argument
125 root->xa_flags &= (__force gfp_t)~(1 << (tag + ROOT_TAG_SHIFT)); in root_tag_clear()
128 static inline void root_tag_clear_all(struct radix_tree_root *root) in root_tag_clear_all() argument
130 root->xa_flags &= (__force gfp_t)((1 << ROOT_TAG_SHIFT) - 1); in root_tag_clear_all()
133 static inline int root_tag_get(const struct radix_tree_root *root, unsigne argument
138 root_tags_get(const struct radix_tree_root *root) root_tags_get() argument
143 is_idr(const struct radix_tree_root *root) is_idr() argument
233 radix_tree_node_alloc(gfp_t gfp_mask, struct radix_tree_node *parent, struct radix_tree_root *root, unsigned int shift, unsigned int offset, unsigned int count, unsigned int nr_values) radix_tree_node_alloc() argument
388 radix_tree_load_root(const struct radix_tree_root *root, struct radix_tree_node **nodep, unsigned long *maxindex) radix_tree_load_root() argument
408 radix_tree_extend(struct radix_tree_root *root, gfp_t gfp, unsigned long index, unsigned int shift) radix_tree_extend() argument
468 radix_tree_shrink(struct radix_tree_root *root) radix_tree_shrink() argument
543 delete_node(struct radix_tree_root *root, struct radix_tree_node *node) delete_node() argument
598 __radix_tree_create(struct radix_tree_root *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp) __radix_tree_create() argument
703 radix_tree_insert(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_insert() argument
747 __radix_tree_lookup(const struct radix_tree_root *root, unsigned long index, struct radix_tree_node **nodep, void __rcu ***slotp) __radix_tree_lookup() argument
794 radix_tree_lookup_slot(const struct radix_tree_root *root, unsigned long index) radix_tree_lookup_slot() argument
817 radix_tree_lookup(const struct radix_tree_root *root, unsigned long index) radix_tree_lookup() argument
834 node_tag_get(const struct radix_tree_root *root, const struct radix_tree_node *node, unsigned int tag, unsigned int offset) node_tag_get() argument
850 calculate_count(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item, void *old) calculate_count() argument
875 __radix_tree_replace(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot, void *item) __radix_tree_replace() argument
914 radix_tree_replace_slot(struct radix_tree_root *root, void __rcu **slot, void *item) radix_tree_replace_slot() argument
931 radix_tree_iter_replace(struct radix_tree_root *root, const struct radix_tree_iter *iter, void __rcu **slot, void *item) radix_tree_iter_replace() argument
938 node_tag_set(struct radix_tree_root *root, struct radix_tree_node *node, unsigned int tag, unsigned int offset) node_tag_set() argument
967 radix_tree_tag_set(struct radix_tree_root *root, unsigned long index, unsigned int tag) radix_tree_tag_set() argument
995 node_tag_clear(struct radix_tree_root *root, struct radix_tree_node *node, unsigned int tag, unsigned int offset) node_tag_clear() argument
1029 radix_tree_tag_clear(struct radix_tree_root *root, unsigned long index, unsigned int tag) radix_tree_tag_clear() argument
1060 radix_tree_iter_tag_clear(struct radix_tree_root *root, const struct radix_tree_iter *iter, unsigned int tag) radix_tree_iter_tag_clear() argument
1081 radix_tree_tag_get(const struct radix_tree_root *root, unsigned long index, unsigned int tag) radix_tree_tag_get() argument
1154 radix_tree_next_chunk(const struct radix_tree_root *root, struct radix_tree_iter *iter, unsigned flags) radix_tree_next_chunk() argument
1262 radix_tree_gang_lookup(const struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items) radix_tree_gang_lookup() argument
1302 radix_tree_gang_lookup_tag(const struct radix_tree_root *root, void **results, unsigned long first_index, unsigned int max_items, unsigned int tag) radix_tree_gang_lookup_tag() argument
1343 radix_tree_gang_lookup_tag_slot(const struct radix_tree_root *root, void __rcu ***results, unsigned long first_index, unsigned int max_items, unsigned int tag) radix_tree_gang_lookup_tag_slot() argument
1364 __radix_tree_delete(struct radix_tree_root *root, struct radix_tree_node *node, void __rcu **slot) __radix_tree_delete() argument
1394 radix_tree_iter_delete(struct radix_tree_root *root, struct radix_tree_iter *iter, void __rcu **slot) radix_tree_iter_delete() argument
1413 radix_tree_delete_item(struct radix_tree_root *root, unsigned long index, void *item) radix_tree_delete_item() argument
1445 radix_tree_delete(struct radix_tree_root *root, unsigned long index) radix_tree_delete() argument
1456 radix_tree_tagged(const struct radix_tree_root *root, unsigned int tag) radix_tree_tagged() argument
1476 idr_get_free(struct radix_tree_root *root, struct radix_tree_iter *iter, gfp_t gfp, unsigned long max) idr_get_free() argument
[all...]
H A Drbtree_test.c27 static struct rb_root_cached root = RB_ROOT_CACHED; variable
32 static void insert(struct test_node *node, struct rb_root_cached *root) in insert() argument
34 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert()
46 rb_insert_color(&node->rb, &root->rb_root); in insert()
49 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached() argument
51 struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; in insert_cached()
66 rb_insert_color_cached(&node->rb, root, leftmost); in insert_cached()
69 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase() argument
71 rb_erase(&node->rb, &root->rb_root); in erase()
74 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached() argument
85 insert_augmented(struct test_node *node, struct rb_root_cached *root) insert_augmented() argument
109 insert_augmented_cached(struct test_node *node, struct rb_root_cached *root) insert_augmented_cached() argument
138 erase_augmented(struct test_node *node, struct rb_root_cached *root) erase_augmented() argument
143 erase_augmented_cached(struct test_node *node, struct rb_root_cached *root) erase_augmented_cached() argument
[all...]
/kernel/linux/linux-5.10/arch/x86/kvm/mmu/
H A Dtdp_mmu.c45 static void tdp_mmu_put_root(struct kvm *kvm, struct kvm_mmu_page *root) in tdp_mmu_put_root() argument
47 if (kvm_mmu_put_root(kvm, root)) in tdp_mmu_put_root()
48 kvm_tdp_mmu_free_root(kvm, root); in tdp_mmu_put_root()
52 struct kvm_mmu_page *root) in tdp_mmu_next_root_valid()
56 if (list_entry_is_head(root, &kvm->arch.tdp_mmu_roots, link)) in tdp_mmu_next_root_valid()
59 kvm_mmu_get_root(kvm, root); in tdp_mmu_next_root_valid()
65 struct kvm_mmu_page *root) in tdp_mmu_next_root()
69 next_root = list_next_entry(root, link); in tdp_mmu_next_root()
70 tdp_mmu_put_root(kvm, root); in tdp_mmu_next_root()
78 * recent root
51 tdp_mmu_next_root_valid(struct kvm *kvm, struct kvm_mmu_page *root) tdp_mmu_next_root_valid() argument
64 tdp_mmu_next_root(struct kvm *kvm, struct kvm_mmu_page *root) tdp_mmu_next_root() argument
108 kvm_tdp_mmu_free_root(struct kvm *kvm, struct kvm_mmu_page *root) kvm_tdp_mmu_free_root() argument
159 struct kvm_mmu_page *root; get_tdp_mmu_vcpu_root() local
186 struct kvm_mmu_page *root; kvm_tdp_mmu_get_vcpu_root_hpa() local
357 struct kvm_mmu_page *root = sptep_to_sp(root_pt); __tdp_mmu_set_spte() local
460 zap_gfn_range(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t start, gfn_t end, bool can_yield, bool flush) zap_gfn_range() argument
501 struct kvm_mmu_page *root; __kvm_tdp_mmu_zap_gfn_range() local
653 kvm_tdp_mmu_handle_hva_range(struct kvm *kvm, unsigned long start, unsigned long end, unsigned long data, int (*handler)(struct kvm *kvm, struct kvm_memory_slot *slot, struct kvm_mmu_page *root, gfn_t start, gfn_t end, unsigned long data)) kvm_tdp_mmu_handle_hva_range() argument
661 struct kvm_mmu_page *root; kvm_tdp_mmu_handle_hva_range() local
692 zap_gfn_range_hva_wrapper(struct kvm *kvm, struct kvm_memory_slot *slot, struct kvm_mmu_page *root, gfn_t start, gfn_t end, unsigned long unused) zap_gfn_range_hva_wrapper() argument
711 age_gfn_range(struct kvm *kvm, struct kvm_memory_slot *slot, struct kvm_mmu_page *root, gfn_t start, gfn_t end, unsigned long unused) age_gfn_range() argument
758 test_age_gfn(struct kvm *kvm, struct kvm_memory_slot *slot, struct kvm_mmu_page *root, gfn_t gfn, gfn_t unused, unsigned long unused2) test_age_gfn() argument
783 set_tdp_spte(struct kvm *kvm, struct kvm_memory_slot *slot, struct kvm_mmu_page *root, gfn_t gfn, gfn_t unused, unsigned long data) set_tdp_spte() argument
837 wrprot_gfn_range(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t start, gfn_t end, int min_level) wrprot_gfn_range() argument
871 struct kvm_mmu_page *root; kvm_tdp_mmu_wrprot_slot() local
894 clear_dirty_gfn_range(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t start, gfn_t end) clear_dirty_gfn_range() argument
935 struct kvm_mmu_page *root; kvm_tdp_mmu_clear_dirty_slot() local
958 clear_dirty_pt_masked(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t gfn, unsigned long mask, bool wrprot) clear_dirty_pt_masked() argument
1003 struct kvm_mmu_page *root; kvm_tdp_mmu_clear_dirty_pt_masked() local
1021 set_dirty_gfn_range(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t start, gfn_t end) set_dirty_gfn_range() argument
1051 struct kvm_mmu_page *root; kvm_tdp_mmu_slot_set_dirty() local
1070 zap_collapsible_spte_range(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t start, gfn_t end) zap_collapsible_spte_range() argument
1110 struct kvm_mmu_page *root; kvm_tdp_mmu_zap_collapsible_sptes() local
1128 write_protect_gfn(struct kvm *kvm, struct kvm_mmu_page *root, gfn_t gfn) write_protect_gfn() argument
1157 struct kvm_mmu_page *root; kvm_tdp_mmu_write_protect_gfn() local
[all...]
/kernel/linux/linux-5.10/tools/include/linux/
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) in rb_erase_init() argument
105 rb_erase(n, root); in rb_erase_init()
127 #define rb_first_cached(root) (root)
129 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
138 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) rb_erase_cached() argument
146 rb_replace_node_cached(struct rb_node *victim, struct rb_node *new, struct rb_root_cached *root) rb_replace_node_cached() argument
[all...]
/kernel/linux/linux-6.6/fs/kernfs/
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 */ in kernfs_common_ancestor()
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
213 * be on the same kernfs-root. If @from is not parent of @to, then a relative
482 struct kernfs_root *root = kernfs_root(kn); in kernfs_root() local
484 lockdep_assert_held_write(&root->kernfs_rwsem); in kernfs_root()
497 up_write(&root->kernfs_rwsem); in kernfs_root()
505 wait_event(root->deactivate_waitq, in kernfs_root()
516 down_write(&root in kernfs_root()
541 struct kernfs_root *root; kernfs_put() local
601 __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
711 kernfs_find_and_get_node_by_id(struct kernfs_root *root, u64 id) kernfs_find_and_get_node_by_id() argument
764 struct kernfs_root *root = kernfs_root(parent); kernfs_add_one() local
907 struct kernfs_root *root = kernfs_root(parent); kernfs_find_and_get_ns() local
933 struct kernfs_root *root = kernfs_root(parent); kernfs_walk_and_get_ns() local
955 struct kernfs_root *root; kernfs_create_root() local
1009 kernfs_destroy_root(struct kernfs_root *root) kernfs_destroy_root() argument
1026 kernfs_root_to_node(struct kernfs_root *root) kernfs_root_to_node() argument
1106 struct kernfs_root *root; kernfs_dop_revalidate() local
1186 struct kernfs_root *root; kernfs_iop_lookup() local
1337 kernfs_next_descendant_post(struct kernfs_node *pos, struct kernfs_node *root) kernfs_next_descendant_post() argument
1392 struct kernfs_root *root = kernfs_root(kn); kernfs_activate() local
1417 struct kernfs_root *root = kernfs_root(kn); kernfs_show() local
1511 struct kernfs_root *root; kernfs_remove() local
1608 struct kernfs_root *root = kernfs_root(kn); kernfs_remove_self() local
1671 struct kernfs_root *root; kernfs_remove_by_name_ns() local
1710 struct kernfs_root *root; kernfs_rename_ns() local
1838 struct kernfs_root *root; kernfs_fop_readdir() local
[all...]
/kernel/linux/linux-5.10/fs/vboxsf/
H A Dvboxsf_wrappers.c75 int vboxsf_map_folder(struct shfl_string *folder_name, u32 *root) in vboxsf_map_folder() argument
84 parms.root.type = VMMDEV_HGCM_PARM_TYPE_32BIT; in vboxsf_map_folder()
85 parms.root.u.value32 = 0; in vboxsf_map_folder()
98 *root = parms.root.u.value32; in vboxsf_map_folder()
102 int vboxsf_unmap_folder(u32 root) in vboxsf_unmap_folder() argument
106 parms.root.type = VMMDEV_HGCM_PARM_TYPE_32BIT; in vboxsf_unmap_folder()
107 parms.root.u.value32 = root; in vboxsf_unmap_folder()
115 * @root
130 vboxsf_create(u32 root, struct shfl_string *parsed_path, struct shfl_createparms *create_parms) vboxsf_create() argument
149 vboxsf_close(u32 root, u64 handle) vboxsf_close() argument
162 vboxsf_remove(u32 root, struct shfl_string *parsed_path, u32 flags) vboxsf_remove() argument
179 vboxsf_rename(u32 root, struct shfl_string *src_path, struct shfl_string *dest_path, u32 flags) vboxsf_rename() argument
201 vboxsf_read(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf) vboxsf_read() argument
225 vboxsf_write(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf) vboxsf_write() 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) vboxsf_dirinfo() argument
294 vboxsf_fsinfo(u32 root, u64 handle, u32 flags, u32 *buf_len, void *buf) vboxsf_fsinfo() argument
320 vboxsf_readlink(u32 root, struct shfl_string *parsed_path, u32 buf_len, u8 *buf) vboxsf_readlink() argument
340 vboxsf_symlink(u32 root, struct shfl_string *new_path, struct shfl_string *old_path, struct shfl_fsobjinfo *buf) vboxsf_symlink() argument
[all...]
/kernel/linux/linux-6.6/fs/vboxsf/
H A Dvboxsf_wrappers.c75 int vboxsf_map_folder(struct shfl_string *folder_name, u32 *root) in vboxsf_map_folder() argument
84 parms.root.type = VMMDEV_HGCM_PARM_TYPE_32BIT; in vboxsf_map_folder()
85 parms.root.u.value32 = 0; in vboxsf_map_folder()
98 *root = parms.root.u.value32; in vboxsf_map_folder()
102 int vboxsf_unmap_folder(u32 root) in vboxsf_unmap_folder() argument
106 parms.root.type = VMMDEV_HGCM_PARM_TYPE_32BIT; in vboxsf_unmap_folder()
107 parms.root.u.value32 = root; in vboxsf_unmap_folder()
115 * @root
130 vboxsf_create(u32 root, struct shfl_string *parsed_path, struct shfl_createparms *create_parms) vboxsf_create() argument
149 vboxsf_close(u32 root, u64 handle) vboxsf_close() argument
162 vboxsf_remove(u32 root, struct shfl_string *parsed_path, u32 flags) vboxsf_remove() argument
179 vboxsf_rename(u32 root, struct shfl_string *src_path, struct shfl_string *dest_path, u32 flags) vboxsf_rename() argument
201 vboxsf_read(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf) vboxsf_read() argument
225 vboxsf_write(u32 root, u64 handle, u64 offset, u32 *buf_len, u8 *buf) vboxsf_write() 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) vboxsf_dirinfo() argument
294 vboxsf_fsinfo(u32 root, u64 handle, u32 flags, u32 *buf_len, void *buf) vboxsf_fsinfo() argument
320 vboxsf_readlink(u32 root, struct shfl_string *parsed_path, u32 buf_len, u8 *buf) vboxsf_readlink() argument
340 vboxsf_symlink(u32 root, struct shfl_string *new_path, struct shfl_string *old_path, struct shfl_fsobjinfo *buf) vboxsf_symlink() argument
[all...]
/kernel/linux/linux-5.10/include/linux/
H A Drbtree.h40 #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)
65 struct rb_root *root);
67 struct rb_root *root);
98 * @root: 'rb_root *' of the rbtree.
109 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \
110 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
133 #define rb_first_cached(root) (root)->rb_leftmost
136 struct rb_root_cached *root, in rb_insert_color_cached()
135 rb_insert_color_cached(struct rb_node *node, struct rb_root_cached *root, bool leftmost) rb_insert_color_cached() argument
144 rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) rb_erase_cached() argument
152 rb_replace_node_cached(struct rb_node *victim, struct rb_node *new, struct rb_root_cached *root) rb_replace_node_cached() argument
[all...]
/kernel/linux/linux-6.6/fs/btrfs/tests/
H A Dqgroup-tests.c16 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr, in insert_normal_tree_ref() argument
41 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size); in insert_normal_tree_ref()
68 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, in add_tree_ref() argument
90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1); in add_tree_ref()
112 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0); in add_tree_ref()
119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, in remove_extent_item() argument
139 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1); in remove_extent_item()
145 btrfs_del_item(&trans, root, path); in remove_extent_item()
150 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, in remove_extent_ref() argument
172 ret = btrfs_search_slot(&trans, root, in remove_extent_ref()
205 test_no_shared_qgroup(struct btrfs_root *root, u32 sectorsize, u32 nodesize) test_no_shared_qgroup() argument
317 test_multiple_refs(struct btrfs_root *root, u32 sectorsize, u32 nodesize) test_multiple_refs() argument
474 struct btrfs_root *root; btrfs_test_qgroups() local
[all...]
/kernel/linux/linux-5.10/tools/testing/selftests/cgroup/
H A Dtest_core.c78 static int test_cgcore_destroy(const char *root) in test_cgcore_destroy() argument
85 cg_test = cg_name(root, "cg_test"); in test_cgcore_destroy()
135 * test that after the one process in C is moved to root,
140 static int test_cgcore_populated(const char *root) in test_cgcore_populated() argument
149 cg_test_a = cg_name(root, "cg_test_a"); in test_cgcore_populated()
150 cg_test_b = cg_name(root, "cg_test_a/cg_test_b"); in test_cgcore_populated()
151 cg_test_c = cg_name(root, "cg_test_a/cg_test_b/cg_test_c"); in test_cgcore_populated()
152 cg_test_d = cg_name(root, "cg_test_a/cg_test_b/cg_test_d"); in test_cgcore_populated()
184 if (cg_enter_current(root)) in test_cgcore_populated()
273 static int test_cgcore_invalid_domain(const char *root) in test_cgcore_invalid_domain() argument
335 test_cgcore_parent_becomes_threaded(const char *root) test_cgcore_parent_becomes_threaded() argument
374 test_cgcore_no_internal_process_constraint_on_threads(const char *root) test_cgcore_no_internal_process_constraint_on_threads() argument
426 test_cgcore_top_down_constraint_enable(const char *root) test_cgcore_top_down_constraint_enable() argument
461 test_cgcore_top_down_constraint_disable(const char *root) test_cgcore_top_down_constraint_disable() argument
502 test_cgcore_internal_process_constraint(const char *root) test_cgcore_internal_process_constraint() argument
548 test_cgcore_proc_migration(const char *root) test_cgcore_proc_migration() argument
621 test_cgcore_thread_migration(const char *root) test_cgcore_thread_migration() argument
684 test_cgcore_lesser_euid_open(const char *root) test_cgcore_lesser_euid_open() argument
766 test_cgcore_lesser_ns_open(const char *root) test_cgcore_lesser_ns_open() argument
862 char root[PATH_MAX]; main() local
[all...]
/kernel/linux/linux-6.6/tools/testing/selftests/cgroup/
H A Dtest_core.c78 static int test_cgcore_destroy(const char *root) in test_cgcore_destroy() argument
85 cg_test = cg_name(root, "cg_test"); in test_cgcore_destroy()
135 * test that after the one process in C is moved to root,
140 static int test_cgcore_populated(const char *root) in test_cgcore_populated() argument
149 cg_test_a = cg_name(root, "cg_test_a"); in test_cgcore_populated()
150 cg_test_b = cg_name(root, "cg_test_a/cg_test_b"); in test_cgcore_populated()
151 cg_test_c = cg_name(root, "cg_test_a/cg_test_b/cg_test_c"); in test_cgcore_populated()
152 cg_test_d = cg_name(root, "cg_test_a/cg_test_b/cg_test_d"); in test_cgcore_populated()
184 if (cg_enter_current(root)) in test_cgcore_populated()
273 static int test_cgcore_invalid_domain(const char *root) in test_cgcore_invalid_domain() argument
335 test_cgcore_parent_becomes_threaded(const char *root) test_cgcore_parent_becomes_threaded() argument
374 test_cgcore_no_internal_process_constraint_on_threads(const char *root) test_cgcore_no_internal_process_constraint_on_threads() argument
426 test_cgcore_top_down_constraint_enable(const char *root) test_cgcore_top_down_constraint_enable() argument
461 test_cgcore_top_down_constraint_disable(const char *root) test_cgcore_top_down_constraint_disable() argument
502 test_cgcore_internal_process_constraint(const char *root) test_cgcore_internal_process_constraint() argument
548 test_cgcore_proc_migration(const char *root) test_cgcore_proc_migration() argument
621 test_cgcore_thread_migration(const char *root) test_cgcore_thread_migration() argument
684 test_cgcore_lesser_euid_open(const char *root) test_cgcore_lesser_euid_open() argument
766 test_cgcore_lesser_ns_open(const char *root) test_cgcore_lesser_ns_open() argument
862 char root[PATH_MAX]; main() local
[all...]
/kernel/linux/linux-5.10/tools/testing/radix-tree/
H A Dregression3.c31 RADIX_TREE(root, GFP_KERNEL); in regression3_test()
40 radix_tree_insert(&root, 0, ptr0); in regression3_test()
41 radix_tree_tag_set(&root, 0, 0); in regression3_test()
44 radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { in regression3_test()
47 radix_tree_insert(&root, 1, ptr); in regression3_test()
48 radix_tree_tag_set(&root, 1, 0); in regression3_test()
57 radix_tree_delete(&root, 1); in regression3_test()
60 radix_tree_for_each_slot(slot, &root, &iter, 0) { in regression3_test()
63 radix_tree_insert(&root, 1, ptr); in regression3_test()
73 radix_tree_for_each_slot(slot, &root, in regression3_test()
[all...]
H A Dtest.h14 int item_insert(struct radix_tree_root *root, unsigned long index);
17 int item_delete(struct radix_tree_root *root, unsigned long index);
19 struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
21 void item_check_present(struct radix_tree_root *root, unsigned long index);
22 void item_check_absent(struct radix_tree_root *root, unsigned long index);
23 void item_gang_check_present(struct radix_tree_root *root,
26 void item_full_scan(struct radix_tree_root *root, unsigned long start,
28 void item_kill_tree(struct radix_tree_root *root);
43 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
45 item_tag_clear(struct radix_tree_root *root, unsigne
[all...]
/kernel/linux/linux-6.6/tools/testing/radix-tree/
H A Dtest.h14 int item_insert(struct radix_tree_root *root, unsigned long index);
17 int item_delete(struct radix_tree_root *root, unsigned long index);
19 struct item *item_lookup(struct radix_tree_root *root, unsigned long index);
21 void item_check_present(struct radix_tree_root *root, unsigned long index);
22 void item_check_absent(struct radix_tree_root *root, unsigned long index);
23 void item_gang_check_present(struct radix_tree_root *root,
26 void item_full_scan(struct radix_tree_root *root, unsigned long start,
28 void item_kill_tree(struct radix_tree_root *root);
43 item_tag_set(struct radix_tree_root *root, unsigned long index, int tag);
45 item_tag_clear(struct radix_tree_root *root, unsigne
[all...]
H A Dregression3.c31 RADIX_TREE(root, GFP_KERNEL); in regression3_test()
40 radix_tree_insert(&root, 0, ptr0); in regression3_test()
41 radix_tree_tag_set(&root, 0, 0); in regression3_test()
44 radix_tree_for_each_tagged(slot, &root, &iter, 0, 0) { in regression3_test()
47 radix_tree_insert(&root, 1, ptr); in regression3_test()
48 radix_tree_tag_set(&root, 1, 0); in regression3_test()
57 radix_tree_delete(&root, 1); in regression3_test()
60 radix_tree_for_each_slot(slot, &root, &iter, 0) { in regression3_test()
63 radix_tree_insert(&root, 1, ptr); in regression3_test()
73 radix_tree_for_each_slot(slot, &root, in regression3_test()
[all...]
/kernel/linux/linux-5.10/fs/btrfs/tests/
H A Dqgroup-tests.c14 static int insert_normal_tree_ref(struct btrfs_root *root, u64 bytenr, in insert_normal_tree_ref() argument
40 ret = btrfs_insert_empty_item(&trans, root, path, &ins, size); in insert_normal_tree_ref()
67 static int add_tree_ref(struct btrfs_root *root, u64 bytenr, u64 num_bytes, in add_tree_ref() argument
90 ret = btrfs_search_slot(&trans, root, &key, path, 0, 1); in add_tree_ref()
112 ret = btrfs_insert_empty_item(&trans, root, path, &key, 0); in add_tree_ref()
119 static int remove_extent_item(struct btrfs_root *root, u64 bytenr, in remove_extent_item() argument
140 ret = btrfs_search_slot(&trans, root, &key, path, -1, 1); in remove_extent_item()
146 btrfs_del_item(&trans, root, path); in remove_extent_item()
151 static int remove_extent_ref(struct btrfs_root *root, u64 bytenr, in remove_extent_ref() argument
174 ret = btrfs_search_slot(&trans, root, in remove_extent_ref()
207 test_no_shared_qgroup(struct btrfs_root *root, u32 sectorsize, u32 nodesize) test_no_shared_qgroup() argument
310 test_multiple_refs(struct btrfs_root *root, u32 sectorsize, u32 nodesize) test_multiple_refs() argument
456 struct btrfs_root *root; btrfs_test_qgroups() local
[all...]
/kernel/linux/linux-6.6/fs/btrfs/
H A Drelocation.c34 #include "root-tree.h"
89 * map address of tree root to tree
142 /* map start of tree root to corresponding reloc tree */
191 * walk up backref nodes until reach node presents tree root
302 static bool reloc_root_is_dead(struct btrfs_root *root) in reloc_root_is_dead() argument
310 if (test_bit(BTRFS_ROOT_DEAD_RELOC_TREE, &root->state)) in reloc_root_is_dead()
319 * This is enough for most callers, as they don't distinguish dead reloc root
320 * from no reloc root. But btrfs_should_ignore_reloc_root() below is a
323 static bool have_reloc_root(struct btrfs_root *root) in have_reloc_root() argument
325 if (reloc_root_is_dead(root)) in have_reloc_root()
332 btrfs_should_ignore_reloc_root(struct btrfs_root *root) btrfs_should_ignore_reloc_root() argument
367 struct btrfs_root *root = NULL; find_reloc_root() local
635 __add_reloc_root(struct btrfs_root *root) __add_reloc_root() argument
668 __del_reloc_root(struct btrfs_root *root) __del_reloc_root() argument
712 __update_reloc_root(struct btrfs_root *root) __update_reloc_root() argument
742 create_reloc_root(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 objectid) create_reloc_root() argument
845 btrfs_init_reloc_root(struct btrfs_trans_handle *trans, struct btrfs_root *root) btrfs_init_reloc_root() argument
912 btrfs_update_reloc_root(struct btrfs_trans_handle *trans, struct btrfs_root *root) btrfs_update_reloc_root() argument
962 find_next_inode(struct btrfs_root *root, u64 objectid) find_next_inode() argument
1018 struct btrfs_root *root = BTRFS_I(reloc_inode)->root; get_new_location() local
1064 replace_file_extents(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_root *root, struct extent_buffer *leaf) replace_file_extents() argument
1438 walk_up_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, int *level) walk_up_reloc_tree() argument
1475 walk_down_reloc_tree(struct btrfs_root *root, struct btrfs_path *path, int *level) walk_down_reloc_tree() argument
1520 invalidate_extent_cache(struct btrfs_root *root, struct btrfs_key *min_key, struct btrfs_key *max_key) invalidate_extent_cache() argument
1612 insert_dirty_subvol(struct btrfs_trans_handle *trans, struct reloc_control *rc, struct btrfs_root *root) insert_dirty_subvol() argument
1643 struct btrfs_root *root; clean_dirty_subvols() local
1693 merge_reloc_root(struct reloc_control *rc, struct btrfs_root *root) merge_reloc_root() argument
1861 struct btrfs_root *root = rc->extent_root; prepare_to_merge() local
1999 struct btrfs_root *root; merge_reloc_roots() local
2119 struct btrfs_root *root; record_reloc_root_in_trans() local
2160 struct btrfs_root *root; select_reloc_root() local
2282 struct btrfs_root *root; select_one_root() local
2358 struct btrfs_root *root = rc->extent_root; reserve_metadata_space() local
2411 struct btrfs_root *root; do_relocation() local
2676 struct btrfs_root *root; relocate_tree_block() local
3370 struct btrfs_root *root = fs_info->tree_root; delete_block_group_cache() local
3814 __insert_orphan_inode(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 objectid) __insert_orphan_inode() argument
3844 delete_orphan_inode(struct btrfs_trans_handle *trans, struct btrfs_root *root, u64 objectid) delete_orphan_inode() argument
3883 struct btrfs_root *root; create_reloc_inode() local
4175 mark_garbage_root(struct btrfs_root *root) mark_garbage_root() argument
4424 btrfs_reloc_cow_block(struct btrfs_trans_handle *trans, struct btrfs_root *root, struct extent_buffer *buf, struct extent_buffer *cow) btrfs_reloc_cow_block() argument
4484 struct btrfs_root *root = pending->root; btrfs_reloc_pre_snapshot() local
4519 struct btrfs_root *root = pending->root; btrfs_reloc_post_snapshot() local
[all...]
/kernel/linux/linux-5.10/include/trace/events/
H A Dcgroup.h13 TP_PROTO(struct cgroup_root *root),
15 TP_ARGS(root),
18 __field( int, root )
20 __string( name, root->name )
24 __entry->root = root->hierarchy_id;
25 __entry->ss_mask = root->subsys_mask;
26 __assign_str(name, root->name);
29 TP_printk("root=%d ss_mask=%#x name=%s",
30 __entry->root, __entr
[all...]
/kernel/linux/linux-6.6/include/trace/events/
H A Dcgroup.h13 TP_PROTO(struct cgroup_root *root),
15 TP_ARGS(root),
18 __field( int, root )
20 __string( name, root->name )
24 __entry->root = root->hierarchy_id;
25 __entry->ss_mask = root->subsys_mask;
26 __assign_str(name, root->name);
29 TP_printk("root=%d ss_mask=%#x name=%s",
30 __entry->root, __entr
[all...]

Completed in 16 milliseconds

12345678910>>...79