Home
last modified time | relevance | path

Searched refs:rb_root_cached (Results 1 – 25 of 36) sorted by relevance

12

/Linux-v4.19/drivers/infiniband/hw/usnic/
Dusnic_uiom_interval_tree.h51 struct rb_root_cached *root);
54 struct rb_root_cached *root);
56 usnic_uiom_interval_tree_iter_first(struct rb_root_cached *root,
66 int usnic_uiom_insert_interval(struct rb_root_cached *root,
74 void usnic_uiom_remove_interval(struct rb_root_cached *root,
84 struct rb_root_cached *root,
Dusnic_uiom_interval_tree.c103 find_intervals_intersection_sorted(struct rb_root_cached *root, in find_intervals_intersection_sorted()
121 struct rb_root_cached *root, in usnic_uiom_get_intervals_diff()
178 int usnic_uiom_insert_interval(struct rb_root_cached *root, unsigned long start, in usnic_uiom_insert_interval()
249 void usnic_uiom_remove_interval(struct rb_root_cached *root, in usnic_uiom_remove_interval()
Dusnic_uiom.h60 struct rb_root_cached root;
/Linux-v4.19/include/linux/
Drbtree.h57 struct rb_root_cached { struct
65 #define RB_ROOT_CACHED (struct rb_root_cached) { {NULL, }, NULL } argument
88 struct rb_root_cached *, bool);
89 extern void rb_erase_cached(struct rb_node *node, struct rb_root_cached *);
103 struct rb_root_cached *root);
Dinterval_tree.h16 struct rb_root_cached *root);
20 struct rb_root_cached *root);
23 interval_tree_iter_first(struct rb_root_cached *root,
Dinterval_tree_generic.h69 struct rb_root_cached *root) \
96 struct rb_root_cached *root) \
149 ITPREFIX ## _iter_first(struct rb_root_cached *root, \
Drbtree_augmented.h68 struct rb_root_cached *root, bool newleft, in rb_insert_augmented_cached()
282 rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, in rb_erase_augmented_cached()
Drtmutex.h32 struct rb_root_cached waiters;
Drmap.h61 struct rb_root_cached rb_root;
Dmm.h2185 struct rb_root_cached *root);
2188 struct rb_root_cached *root);
2190 struct rb_root_cached *root);
2191 struct vm_area_struct *vma_interval_tree_iter_first(struct rb_root_cached *root,
2201 struct rb_root_cached *root);
2203 struct rb_root_cached *root);
2205 anon_vma_interval_tree_iter_first(struct rb_root_cached *root,
/Linux-v4.19/mm/
Dinterval_tree.c31 struct rb_root_cached *root) in vma_interval_tree_insert_after()
77 struct rb_root_cached *root) in INTERVAL_TREE_DEFINE()
87 struct rb_root_cached *root) in anon_vma_interval_tree_remove()
93 anon_vma_interval_tree_iter_first(struct rb_root_cached *root, in anon_vma_interval_tree_iter_first()
/Linux-v4.19/lib/
Drbtree_test.c26 static struct rb_root_cached root = RB_ROOT_CACHED;
31 static void insert(struct test_node *node, struct rb_root_cached *root) in insert()
48 static void insert_cached(struct test_node *node, struct rb_root_cached *root) in insert_cached()
68 static inline void erase(struct test_node *node, struct rb_root_cached *root) in erase()
73 static inline void erase_cached(struct test_node *node, struct rb_root_cached *root) in erase_cached()
101 struct rb_root_cached *root) in RB_DECLARE_CALLBACKS()
125 struct rb_root_cached *root) in insert_augmented_cached()
153 static void erase_augmented(struct test_node *node, struct rb_root_cached *root) in erase_augmented()
159 struct rb_root_cached *root) in erase_augmented_cached()
Dinterval_tree_test.c22 static struct rb_root_cached root = RB_ROOT_CACHED;
29 search(struct rb_root_cached *root, unsigned long start, unsigned long last) in search()
Drbtree.c467 struct rb_root_cached *root, bool leftmost) in rb_insert_color_cached()
474 void rb_erase_cached(struct rb_node *node, struct rb_root_cached *root) in rb_erase_cached()
607 struct rb_root_cached *root) in rb_replace_node_cached()
/Linux-v4.19/include/rdma/
Dib_umem_odp.h120 int rbt_ib_umem_for_each_in_range(struct rb_root_cached *root,
129 struct ib_umem_odp *rbt_ib_umem_lookup(struct rb_root_cached *root,
/Linux-v4.19/Documentation/
Drbtree.txt201 order for their own logic. To this end, users can use 'struct rb_root_cached'
209 struct rb_root_cached mytree = RB_ROOT_CACHED;
212 leftmost node. This allows rb_root_cached to exist wherever rb_root does,
216 struct rb_node *rb_first_cached(struct rb_root_cached *tree);
217 void rb_insert_color_cached(struct rb_node *, struct rb_root_cached *, bool);
218 void rb_erase_cached(struct rb_node *node, struct rb_root_cached *);
223 void rb_insert_augmented_cached(struct rb_node *node, struct rb_root_cached *,
225 void rb_erase_augmented_cached(struct rb_node *, struct rb_root_cached *,
/Linux-v4.19/include/drm/
Ddrm_mm.h207 struct rb_root_cached interval_tree;
208 struct rb_root_cached holes_size;
/Linux-v4.19/drivers/infiniband/hw/hfi1/
Dmmu_rb.c57 struct rb_root_cached root;
295 struct rb_root_cached *root = &handler->root; in mmu_notifier_range_start()
/Linux-v4.19/drivers/gpu/drm/amd/amdgpu/
Damdgpu_vm.h177 struct rb_root_cached va;
Damdgpu_mn.c87 struct rb_root_cached objects;
/Linux-v4.19/drivers/vhost/
Dvhost.h71 struct rb_root_cached umem_tree;
/Linux-v4.19/drivers/gpu/drm/radeon/
Dradeon_mn.c53 struct rb_root_cached objects;
/Linux-v4.19/drivers/infiniband/core/
Dumem_odp.c813 int rbt_ib_umem_for_each_in_range(struct rb_root_cached *root, in rbt_ib_umem_for_each_in_range()
840 struct ib_umem_odp *rbt_ib_umem_lookup(struct rb_root_cached *root, in rbt_ib_umem_lookup()
/Linux-v4.19/drivers/gpu/drm/
Ddrm_mm.c172 return drm_mm_interval_tree_iter_first((struct rb_root_cached *)&mm->interval_tree, in INTERVAL_TREE_DEFINE()
247 static void insert_hole_size(struct rb_root_cached *root, in insert_hole_size()
/Linux-v4.19/kernel/sched/
Dsched.h492 struct rb_root_cached tasks_timeline;
625 struct rb_root_cached root;
649 struct rb_root_cached pushable_dl_tasks_root;

12