arch/arm/xen/p2m.c
30
struct rb_root phys_to_mach = RB_ROOT;
arch/arm64/kvm/mmu.c
454
static struct rb_root hyp_shared_pfns = RB_ROOT;
arch/arm64/kvm/pkvm.c
356
WARN_ON_ONCE(!RB_EMPTY_ROOT(&pgt->pkvm_mappings.rb_root));
arch/powerpc/kernel/eeh_cache.c
103
n = rb_first(&cache->rb_root);
arch/powerpc/kernel/eeh_cache.c
121
struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node;
arch/powerpc/kernel/eeh_cache.c
155
rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root);
arch/powerpc/kernel/eeh_cache.c
218
n = rb_first(&pci_io_addr_cache_root.rb_root);
arch/powerpc/kernel/eeh_cache.c
226
rb_erase(n, &pci_io_addr_cache_root.rb_root);
arch/powerpc/kernel/eeh_cache.c
270
for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) {
arch/powerpc/kernel/eeh_cache.c
50
struct rb_root rb_root;
arch/powerpc/kernel/eeh_cache.c
56
struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node;
arch/powerpc/perf/hv-24x7.c
622
static int event_uniq_add(struct rb_root *root, const char *name, int nl,
arch/powerpc/perf/hv-24x7.c
669
static void event_uniq_destroy(struct rb_root *root)
arch/powerpc/perf/hv-24x7.c
771
struct rb_root ev_uniq = RB_ROOT;
arch/sh/kernel/dwarf.c
41
static struct rb_root cie_root;
arch/sh/kernel/dwarf.c
44
static struct rb_root fde_root;
arch/x86/events/intel/uncore.h
108
struct rb_root *boxes;
arch/x86/events/intel/uncore_discovery.c
114
intel_uncore_find_discovery_unit(struct rb_root *units, int die,
arch/x86/events/intel/uncore_discovery.c
12
static struct rb_root discovery_tables = RB_ROOT;
arch/x86/events/intel/uncore_discovery.c
144
int intel_uncore_find_discovery_unit_id(struct rb_root *units, int die,
arch/x86/events/intel/uncore_discovery.c
177
uncore_find_unit(struct rb_root *root, unsigned int id)
arch/x86/events/intel/uncore_discovery.c
192
struct rb_root *root, u16 *num_units)
arch/x86/events/intel/uncore_discovery.h
136
struct rb_root units; /* Unit ctrl addr for all units */
arch/x86/events/intel/uncore_discovery.h
174
int intel_uncore_find_discovery_unit_id(struct rb_root *units, int die,
arch/x86/events/intel/uncore_discovery.h
179
struct rb_root *root, u16 *num_units);
arch/x86/events/intel/uncore_snbep.c
6399
struct rb_root *root;
arch/x86/events/intel/uncore_snbep.c
6414
root = kzalloc_obj(struct rb_root);
block/bfq-cgroup.c
828
struct rb_root *child_active = &child_st->active;
block/bfq-cgroup.c
852
struct rb_root *active = &st->active;
block/bfq-iosched.c
2680
struct rb_root *root = &bfqq_group(bfqq)->rq_pos_tree;
block/bfq-iosched.c
730
bfq_rq_pos_tree_lookup(struct bfq_data *bfqd, struct rb_root *root,
block/bfq-iosched.c
872
!RB_EMPTY_ROOT(&bfqd->queue_weights_tree.rb_root) &&
block/bfq-iosched.c
873
(bfqd->queue_weights_tree.rb_root.rb_node->rb_left ||
block/bfq-iosched.c
874
bfqd->queue_weights_tree.rb_root.rb_node->rb_right);
block/bfq-iosched.c
905
struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;
block/bfq-iosched.h
1021
struct rb_root rq_pos_tree;
block/bfq-iosched.h
1034
struct rb_root rq_pos_tree;
block/bfq-iosched.h
165
struct rb_root *tree;
block/bfq-iosched.h
274
struct rb_root *pos_root;
block/bfq-iosched.h
277
struct rb_root sort_list;
block/bfq-iosched.h
55
struct rb_root active;
block/bfq-iosched.h
57
struct rb_root idle;
block/bfq-wf2q.c
23
static struct bfq_entity *bfq_root_active_entity(struct rb_root *tree)
block/bfq-wf2q.c
338
static void bfq_extract(struct rb_root *root, struct bfq_entity *entity)
block/bfq-wf2q.c
379
static void bfq_insert(struct rb_root *root, struct bfq_entity *entity)
block/blk-throttle.c
399
struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node;
block/elevator.c
219
void elv_rb_add(struct rb_root *root, struct request *rq)
block/elevator.c
240
void elv_rb_del(struct rb_root *root, struct request *rq)
block/elevator.c
248
struct request *elv_rb_find(struct rb_root *root, sector_t sector)
block/elevator.h
199
extern void elv_rb_add(struct rb_root *, struct request *);
block/elevator.h
200
extern void elv_rb_del(struct rb_root *, struct request *);
block/elevator.h
201
extern struct request *elv_rb_find(struct rb_root *, sector_t);
block/mq-deadline.c
114
static inline struct rb_root *
block/mq-deadline.c
153
struct rb_root *root = deadline_rb_root(per_prio, rq);
block/mq-deadline.c
74
struct rb_root sort_list[DD_DIR_COUNT];
drivers/android/binder_alloc.h
112
struct rb_root free_buffers;
drivers/android/binder_alloc.h
113
struct rb_root allocated_buffers;
drivers/android/binder_internal.h
419
struct rb_root threads;
drivers/android/binder_internal.h
420
struct rb_root nodes;
drivers/android/binder_internal.h
421
struct rb_root refs_by_desc;
drivers/android/binder_internal.h
422
struct rb_root refs_by_node;
drivers/base/regmap/internal.h
181
struct rb_root range_tree;
drivers/base/regmap/regcache-rbtree.c
35
struct rb_root root;
drivers/base/regmap/regcache-rbtree.c
96
static int regcache_rbtree_insert(struct regmap *map, struct rb_root *root,
drivers/base/regmap/regmap.c
502
struct rb_root *root = &map->range_tree;
drivers/block/drbd/drbd_int.h
807
struct rb_root read_requests;
drivers/block/drbd/drbd_int.h
808
struct rb_root write_requests;
drivers/block/drbd/drbd_interval.c
118
drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size)
drivers/block/drbd/drbd_interval.c
25
drbd_insert_interval(struct rb_root *root, struct drbd_interval *this)
drivers/block/drbd/drbd_interval.c
69
drbd_contains_interval(struct rb_root *root, sector_t sector,
drivers/block/drbd/drbd_interval.c
96
drbd_remove_interval(struct rb_root *root, struct drbd_interval *this)
drivers/block/drbd/drbd_interval.h
32
extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *);
drivers/block/drbd/drbd_interval.h
33
extern bool drbd_contains_interval(struct rb_root *, sector_t,
drivers/block/drbd/drbd_interval.h
35
extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *);
drivers/block/drbd/drbd_interval.h
36
extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t,
drivers/block/drbd/drbd_receiver.c
1912
find_request(struct drbd_device *device, struct rb_root *root, u64 id,
drivers/block/drbd/drbd_receiver.c
5472
struct rb_root *root, const char *func,
drivers/block/drbd/drbd_req.c
58
static void drbd_remove_request_interval(struct rb_root *root,
drivers/block/drbd/drbd_req.c
99
struct rb_root *root;
drivers/block/loop.c
68
struct rb_root worker_tree;
drivers/block/xen-blkback/blkback.c
244
struct rb_root *root = &ring->persistent_gnts;
drivers/block/xen-blkback/blkback.c
338
struct rb_root *root;
drivers/block/xen-blkback/common.h
274
struct rb_root persistent_gnts;
drivers/dma-buf/sync_debug.h
41
struct rb_root pt_tree;
drivers/fpga/dfl-afu.h
76
struct rb_root dma_regions;
drivers/gpu/drm/amd/amdgpu/amdgpu_vm.c
2814
if (!RB_EMPTY_ROOT(&vm->va.rb_root)) {
drivers/gpu/drm/amd/amdgpu/amdgpu_vm.c
2818
&vm->va.rb_root, rb) {
drivers/gpu/drm/amd/amdkfd/kfd_svm.c
2831
rb_node = rb_last(&p->svms.objects.rb_root);
drivers/gpu/drm/drm_buddy.c
107
struct rb_root *root;
drivers/gpu/drm/drm_buddy.c
1287
struct rb_root *root;
drivers/gpu/drm/drm_buddy.c
328
mm->free_trees[i] = kmalloc_objs(struct rb_root,
drivers/gpu/drm/drm_buddy.c
504
struct rb_root *root = &mm->free_trees[src_tree][i];
drivers/gpu/drm/drm_buddy.c
70
rbtree_last_free_block(struct rb_root *root)
drivers/gpu/drm/drm_buddy.c
712
struct rb_root *root;
drivers/gpu/drm/drm_buddy.c
741
struct rb_root *root;
drivers/gpu/drm/drm_buddy.c
75
static bool rbtree_is_empty(struct rb_root *root)
drivers/gpu/drm/drm_buddy.c
929
struct rb_root *root;
drivers/gpu/drm/drm_gpusvm.c
1238
if (RB_EMPTY_ROOT(¬ifier->root.rb_root)) {
drivers/gpu/drm/drm_gpusvm.c
504
WARN_ON(!RB_EMPTY_ROOT(&gpusvm->root.rb_root));
drivers/gpu/drm/drm_gpusvm.c
550
WARN_ON(!RB_EMPTY_ROOT(¬ifier->root.rb_root));
drivers/gpu/drm/drm_gpuvm.c
1146
drm_WARN(gpuvm->drm, !RB_EMPTY_ROOT(&gpuvm->rb.tree.rb_root),
drivers/gpu/drm/drm_mm.c
191
link = &mm->interval_tree.rb_root.rb_node;
drivers/gpu/drm/drm_mm.c
224
struct rb_node **link = &root->rb_root.rb_node, *rb = NULL;
drivers/gpu/drm/drm_mm.c
246
static void insert_hole_addr(struct rb_root *root, struct drm_mm_node *node)
drivers/gpu/drm/drm_mm.c
308
struct rb_node *rb = mm->holes_size.rb_root.rb_node;
drivers/gpu/drm/drm_vma_manager.c
149
iter = mgr->vm_addr_space_mm.interval_tree.rb_root.rb_node;
drivers/gpu/drm/i915/gem/i915_gem_object_types.h
278
struct rb_root tree;
drivers/gpu/drm/i915/gem/i915_gem_object_types.h
330
struct rb_root offsets;
drivers/gpu/drm/i915/gt/intel_execlists_submission.c
1178
if (!RB_EMPTY_ROOT(&engine->execlists.virtual.rb_root)) {
drivers/gpu/drm/i915/gt/intel_execlists_submission.c
3858
parent = &sibling->execlists.virtual.rb_root.rb_node;
drivers/gpu/drm/i915/gvt/gvt.h
230
struct rb_root gfn_cache;
drivers/gpu/drm/i915/gvt/gvt.h
231
struct rb_root dma_addr_cache;
drivers/gpu/drm/i915/i915_active.c
128
struct rb_root root = RB_ROOT;
drivers/gpu/drm/i915/i915_active_types.h
31
struct rb_root tree;
drivers/gpu/drm/i915/i915_drv.h
213
struct rb_root uabi_engines;
drivers/gpu/drm/i915/i915_scheduler.c
48
rb_first(&sched_engine->queue.rb_root));
drivers/gpu/drm/i915/i915_scheduler.c
75
parent = &sched_engine->queue.rb_root.rb_node;
drivers/gpu/drm/i915/i915_scheduler.h
71
return RB_EMPTY_ROOT(&sched_engine->queue.rb_root);
drivers/gpu/drm/nouveau/include/nvkm/core/client.h
13
struct rb_root objroot;
drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h
57
struct rb_root free;
drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h
58
struct rb_root root;
drivers/gpu/drm/radeon/radeon_vm.c
1235
if (!RB_EMPTY_ROOT(&vm->va.rb_root))
drivers/gpu/drm/radeon/radeon_vm.c
1239
&vm->va.rb_root, it.rb) {
drivers/gpu/drm/vmwgfx/vmwgfx_bo.h
91
struct rb_root res_tree;
drivers/gpu/drm/xe/xe_range_fence.c
122
XE_WARN_ON(!RB_EMPTY_ROOT(&tree->root.rb_root));
drivers/infiniband/core/cm.c
116
struct rb_root listen_service_table;
drivers/infiniband/core/cm.c
119
struct rb_root remote_qp_table;
drivers/infiniband/core/cm.c
120
struct rb_root remote_id_table;
drivers/infiniband/core/cm.c
121
struct rb_root remote_sidr_table;
drivers/infiniband/core/cma.c
161
static struct rb_root id_table = RB_ROOT;
drivers/infiniband/core/cma.c
530
node_from_ndev_ip(struct rb_root *root, int ifindex, struct sockaddr *sa)
drivers/infiniband/core/multicast.c
63
struct rb_root table;
drivers/infiniband/core/uverbs.h
109
struct rb_root xrcd_tree;
drivers/infiniband/hw/mlx4/cm.c
156
struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map;
drivers/infiniband/hw/mlx4/cm.c
184
struct rb_root *sl_id_map = &sriov->sl_id_map;
drivers/infiniband/hw/mlx4/cm.c
201
struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map;
drivers/infiniband/hw/mlx4/cm.c
526
struct rb_root *sl_id_map = &sriov->sl_id_map;
drivers/infiniband/hw/mlx4/mlx4_ib.h
502
struct rb_root mcg_table;
drivers/infiniband/hw/mlx4/mlx4_ib.h
524
struct rb_root sl_id_map;
drivers/infiniband/hw/mlx5/mlx5_ib.h
843
struct rb_root rb_root;
drivers/infiniband/hw/mlx5/mr.c
1019
struct rb_root *root = &dev->cache.rb_root;
drivers/infiniband/hw/mlx5/mr.c
494
for (node = rb_first(&cache->rb_root); node; node = rb_next(node)) {
drivers/infiniband/hw/mlx5/mr.c
671
struct rb_node **new = &cache->rb_root.rb_node, *parent = NULL;
drivers/infiniband/hw/mlx5/mr.c
690
rb_insert_color(&ent->node, &cache->rb_root);
drivers/infiniband/hw/mlx5/mr.c
699
struct rb_node *node = dev->cache.rb_root.rb_node;
drivers/infiniband/hw/mlx5/mr.c
942
struct rb_root *root = &dev->cache.rb_root;
drivers/infiniband/hw/mlx5/mr.c
962
struct rb_root *root = &dev->cache.rb_root;
drivers/infiniband/hw/mlx5/mr.c
974
dev->cache.rb_root = RB_ROOT;
drivers/infiniband/sw/rxe/rxe_mcast.c
126
struct rb_root *tree = &rxe->mcg_tree;
drivers/infiniband/sw/rxe/rxe_mcast.c
83
struct rb_root *tree = &mcg->rxe->mcg_tree;
drivers/infiniband/sw/rxe/rxe_verbs.h
438
struct rb_root mcg_tree;
drivers/infiniband/ulp/ipoib/ipoib.h
334
struct rb_root path_tree;
drivers/infiniband/ulp/ipoib/ipoib.h
341
struct rb_root multicast_tree;
drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.h
804
struct rb_root streams;
drivers/iommu/intel/iommu.h
726
struct rb_root device_rbtree;
drivers/iommu/iommufd/io_pagetable.c
1439
!RB_EMPTY_ROOT(&iopt->area_itree.rb_root)) {
drivers/iommu/iommufd/io_pagetable.c
158
if (RB_EMPTY_ROOT(&iopt->allowed_itree.rb_root)) {
drivers/iommu/iommufd/io_pagetable.c
957
WARN_ON(!RB_EMPTY_ROOT(&iopt->reserved_itree.rb_root));
drivers/iommu/iommufd/io_pagetable.c
960
WARN_ON(!RB_EMPTY_ROOT(&iopt->area_itree.rb_root));
drivers/iommu/iommufd/pages.c
1649
WARN_ON(!RB_EMPTY_ROOT(&pages->access_itree.rb_root));
drivers/iommu/iommufd/pages.c
1650
WARN_ON(!RB_EMPTY_ROOT(&pages->domains_itree.rb_root));
drivers/iommu/iova.c
138
iova_insert_rbtree(struct rb_root *root, struct iova *iova,
drivers/md/bcache/bcache.h
244
struct rb_root keys;
drivers/md/dm-bio-prison-v1.c
138
static int __bio_detain(struct rb_root *root,
drivers/md/dm-bio-prison-v1.c
204
static void __cell_release(struct rb_root *root,
drivers/md/dm-bio-prison-v1.c
23
struct rb_root cell;
drivers/md/dm-bio-prison-v1.c
232
static void __cell_release_no_holder(struct rb_root *root,
drivers/md/dm-bio-prison-v2.c
25
struct rb_root cells;
drivers/md/dm-bufio.c
383
struct rb_root root;
drivers/md/dm-bufio.c
597
static struct dm_buffer *__cache_get(const struct rb_root *root, sector_t block)
drivers/md/dm-bufio.c
820
static bool __cache_insert(struct rb_root *root, struct dm_buffer *b)
drivers/md/dm-bufio.c
894
static struct dm_buffer *__find_next(struct rb_root *root, sector_t block)
drivers/md/dm-bufio.c
918
struct rb_root *root,
drivers/md/dm-cache-background-tracker.c
22
struct rb_root pending;
drivers/md/dm-crypt.c
169
struct rb_root write_tree;
drivers/md/dm-crypt.c
1939
struct rb_root write_tree;
drivers/md/dm-dust.c
240
static bool __dust_clear_badblocks(struct rb_root *tree,
drivers/md/dm-dust.c
25
struct rb_root badblocklist;
drivers/md/dm-dust.c
268
struct rb_root badblocklist;
drivers/md/dm-dust.c
291
struct rb_root badblocklist;
drivers/md/dm-dust.c
36
static struct badblock *dust_rb_search(struct rb_root *root, sector_t blk)
drivers/md/dm-dust.c
54
static bool dust_rb_insert(struct rb_root *root, struct badblock *new)
drivers/md/dm-integrity.c
203
struct rb_root journal_tree_root;
drivers/md/dm-integrity.c
234
struct rb_root in_progress;
drivers/md/dm-ioctl.c
64
static struct rb_root name_rb_tree = RB_ROOT;
drivers/md/dm-ioctl.c
65
static struct rb_root uuid_rb_tree = RB_ROOT;
drivers/md/dm-pcache/cache.h
97
struct rb_root root;
drivers/md/dm-snap.c
95
struct rb_root out_of_order_tree;
drivers/md/dm-thin.c
355
struct rb_root sort_bio_list; /* sorted list of deferred bios */
drivers/md/dm-writecache.c
114
struct rb_root freetree;
drivers/md/dm-writecache.c
118
struct rb_root tree;
drivers/md/dm-zoned-metadata.c
187
struct rb_root mblk_rbtree;
drivers/md/dm-zoned-metadata.c
2777
struct rb_root *root;
drivers/md/dm-zoned-metadata.c
460
struct rb_root *root = &zmd->mblk_rbtree;
drivers/md/dm-zoned-metadata.c
483
struct rb_root *root = &zmd->mblk_rbtree;
drivers/md/persistent-data/dm-transaction-manager.c
99
struct rb_root buckets[DM_HASH_SIZE];
drivers/mtd/mtdswap.c
1184
struct rb_root *root = &d->trees[i].root;
drivers/mtd/mtdswap.c
203
static void __mtdswap_rb_add(struct rb_root *root, struct swap_eb *eb)
drivers/mtd/mtdswap.c
224
struct rb_root *root;
drivers/mtd/mtdswap.c
236
static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx)
drivers/mtd/mtdswap.c
418
struct rb_root hist_root = RB_ROOT;
drivers/mtd/mtdswap.c
567
struct rb_root *clean_root;
drivers/mtd/mtdswap.c
71
struct rb_root *root;
drivers/mtd/mtdswap.c
804
struct rb_root *root;
drivers/mtd/mtdswap.c
847
struct rb_root *rp = NULL;
drivers/mtd/mtdswap.c
85
struct rb_root root;
drivers/mtd/ubi/fastmap-wl.c
26
static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root)
drivers/mtd/ubi/fastmap-wl.c
554
struct rb_root *root) {
drivers/mtd/ubi/ubi.h
586
struct rb_root ltree;
drivers/mtd/ubi/ubi.h
606
struct rb_root used;
drivers/mtd/ubi/ubi.h
607
struct rb_root erroneous;
drivers/mtd/ubi/ubi.h
608
struct rb_root free;
drivers/mtd/ubi/ubi.h
610
struct rb_root scrub;
drivers/mtd/ubi/ubi.h
720
struct rb_root root;
drivers/mtd/ubi/ubi.h
760
struct rb_root volumes;
drivers/mtd/ubi/wl.c
127
struct ubi_wl_entry *e, struct rb_root *root);
drivers/mtd/ubi/wl.c
139
static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root)
drivers/mtd/ubi/wl.c
1636
static void tree_destroy(struct ubi_device *ubi, struct rb_root *root)
drivers/mtd/ubi/wl.c
2052
struct ubi_wl_entry *e, struct rb_root *root)
drivers/mtd/ubi/wl.c
242
static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root)
drivers/mtd/ubi/wl.c
326
struct rb_root *root, int diff,
drivers/mtd/ubi/wl.c
364
struct rb_root *root)
drivers/mtd/ubi/wl.h
22
struct rb_root *root);
drivers/mtd/ubi/wl.h
29
struct rb_root *root) {
drivers/mtd/ubi/wl.h
6
static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root);
drivers/net/ethernet/mellanox/mlx4/mlx4.h
560
struct rb_root res_tree[MLX4_NUM_OF_RESOURCE_TYPE];
drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
1279
struct rb_root *root = &tracker->res_tree[type];
drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
235
static void *res_tracker_lookup(struct rb_root *root, u64 res_id)
drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
253
static int res_tracker_insert(struct rb_root *root, struct res_common *res)
drivers/net/ethernet/mellanox/mlx4/resource_tracker.c
5024
struct rb_root *root = &tracker->res_tree[RES_FS_RULE];
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
101
static struct rb_root *page_root_per_function(struct mlx5_core_dev *dev, u32 function)
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
103
struct rb_root *root;
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
128
struct rb_root *root;
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
173
struct rb_root *root;
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
257
struct rb_root *root;
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
438
struct rb_root *root;
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
485
struct rb_root *root;
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
704
struct rb_root *root, u32 function)
drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c
737
struct rb_root *root;
drivers/platform/surface/aggregator/controller.h
70
struct rb_root refcount;
drivers/staging/media/atomisp/include/hmm/hmm_bo.h
94
struct rb_root allocated_rbtree;
drivers/staging/media/atomisp/include/hmm/hmm_bo.h
96
struct rb_root free_rbtree;
drivers/staging/media/atomisp/pci/hmm/hmm_bo.c
115
static struct hmm_buffer_object *__bo_search_by_addr(struct rb_root *root,
drivers/staging/media/atomisp/pci/hmm/hmm_bo.c
141
struct rb_root *root, unsigned int start)
drivers/staging/media/atomisp/pci/hmm/hmm_bo.c
165
static void __bo_insert_to_free_rbtree(struct rb_root *root,
drivers/staging/media/atomisp/pci/hmm/hmm_bo.c
198
static void __bo_insert_to_alloc_rbtree(struct rb_root *root,
drivers/staging/media/atomisp/pci/hmm/hmm_bo.c
385
struct rb_root *root = &bdev->free_rbtree;
drivers/vfio/vfio_iommu_type1.c
69
struct rb_root dma_list;
drivers/vfio/vfio_iommu_type1.c
99
struct rb_root pfn_list; /* Ex-user pinned pfn list */
drivers/xen/evtchn.c
63
struct rb_root evtchns;
fs/afs/internal.h
293
struct rb_root cells;
fs/afs/internal.h
402
struct rb_root volumes; /* Tree of volumes on this server */
fs/afs/internal.h
407
struct rb_root fs_servers; /* afs_server (by server UUID) */
fs/btrfs/backref.c
1574
WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect_missing_keys.root.rb_root));
fs/btrfs/backref.c
1580
WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root));
fs/btrfs/backref.c
3040
cache->rb_root = RB_ROOT;
fs/btrfs/backref.c
3136
rb_erase(&node->rb_node, &tree->rb_root);
fs/btrfs/backref.c
3173
while ((node = rb_entry_safe(rb_first(&cache->rb_root),
fs/btrfs/backref.c
3239
rb_node = rb_simple_search(&cache->rb_root, ref_key->offset);
fs/btrfs/backref.c
3378
rb_node = rb_simple_search(&cache->rb_root, eb->start);
fs/btrfs/backref.c
340
&preftree->root.rb_root, rbnode) {
fs/btrfs/backref.c
3588
rb_node = rb_simple_insert(&cache->rb_root, &start->simple_node);
fs/btrfs/backref.c
3639
rb_node = rb_simple_insert(&cache->rb_root, &upper->simple_node);
fs/btrfs/backref.c
444
struct rb_node **p = &preftrees->direct.root.rb_root.rb_node;
fs/btrfs/backref.h
397
struct rb_root rb_root;
fs/btrfs/block-group.c
238
n = info->block_group_cache_tree.rb_root.rb_node;
fs/btrfs/block-group.c
4682
while ((n = rb_last(&info->block_group_cache_tree.rb_root)) != NULL) {
fs/btrfs/btrfs_inode.h
187
struct rb_root ordered_tree;
fs/btrfs/ctree.h
166
struct rb_root blocks[BTRFS_MAX_LEVEL];
fs/btrfs/delayed-inode.c
1576
item = __btrfs_lookup_delayed_item(&node->ins_root.rb_root, index);
fs/btrfs/delayed-inode.c
1608
if (RB_EMPTY_ROOT(&node->ins_root.rb_root)) {
fs/btrfs/delayed-inode.c
390
struct rb_root *root,
fs/btrfs/delayed-ref.c
1248
node = head->ref_tree.rb_root.rb_node;
fs/btrfs/delayed-ref.c
441
if (RB_EMPTY_ROOT(&head->ref_tree.rb_root))
fs/btrfs/delayed-ref.c
556
if (RB_EMPTY_ROOT(&head->ref_tree.rb_root))
fs/btrfs/extent-io-tree.c
117
struct rb_root root;
fs/btrfs/extent-io-tree.c
239
struct rb_root *root = &tree->state;
fs/btrfs/extent-io-tree.c
289
struct rb_root *root = &tree->state;
fs/btrfs/extent-io-tree.h
104
struct rb_root state;
fs/btrfs/extent-tree.c
1962
if (!RB_EMPTY_ROOT(&head->ref_tree.rb_root) || head->extent_op) {
fs/btrfs/extent-tree.c
2175
static u64 find_middle(struct rb_root *root)
fs/btrfs/extent-tree.c
3582
if (!RB_EMPTY_ROOT(&head->ref_tree.rb_root))
fs/btrfs/extent_map.c
139
static struct rb_node *tree_search(struct rb_root *root, u64 offset,
fs/btrfs/extent_map.c
91
static int tree_insert(struct rb_root *root, struct extent_map *em)
fs/btrfs/extent_map.h
103
struct rb_root root;
fs/btrfs/free-space-cache.c
1587
struct rb_root *root;
fs/btrfs/free-space-cache.h
78
struct rb_root free_space_offset;
fs/btrfs/fs.h
393
struct rb_root root;
fs/btrfs/fs.h
506
struct rb_root global_root_tree;
fs/btrfs/fs.h
659
struct rb_root tree_mod_log;
fs/btrfs/fs.h
756
struct rb_root defrag_inodes;
fs/btrfs/fs.h
804
struct rb_root qgroup_tree;
fs/btrfs/fs.h
894
struct rb_root swapfile_pins;
fs/btrfs/fs.h
951
struct rb_root block_tree;
fs/btrfs/misc.h
127
static inline struct rb_node *rb_simple_search(const struct rb_root *root, u64 bytenr)
fs/btrfs/misc.h
154
static inline struct rb_node *rb_simple_search_first(const struct rb_root *root,
fs/btrfs/misc.h
193
static inline struct rb_node *rb_simple_insert(struct rb_root *root,
fs/btrfs/ordered-data.c
36
static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,
fs/btrfs/ordered-data.c
64
static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,
fs/btrfs/qgroup.c
4691
struct rb_root *cur_root = &swapped_blocks->blocks[i];
fs/btrfs/ref-verify.c
107
static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr)
fs/btrfs/ref-verify.c
135
static struct root_entry *insert_root_entry(struct rb_root *root,
fs/btrfs/ref-verify.c
173
static struct ref_entry *insert_ref_entry(struct rb_root *root,
fs/btrfs/ref-verify.c
182
static struct root_entry *lookup_root_entry(struct rb_root *root, u64 objectid)
fs/btrfs/ref-verify.c
72
struct rb_root roots;
fs/btrfs/ref-verify.c
73
struct rb_root refs;
fs/btrfs/ref-verify.c
98
static struct block_entry *insert_block_entry(struct rb_root *root,
fs/btrfs/relocation.c
107
struct rb_root rb_root;
fs/btrfs/relocation.c
1914
static void free_block_list(struct rb_root *blocks)
fs/btrfs/relocation.c
2593
struct reloc_control *rc, struct rb_root *blocks)
fs/btrfs/relocation.c
3043
struct rb_root *blocks)
fs/btrfs/relocation.c
3142
struct rb_root *blocks)
fs/btrfs/relocation.c
315
rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr);
fs/btrfs/relocation.c
3291
struct rb_root *blocks)
fs/btrfs/relocation.c
3489
struct rb_root blocks = RB_ROOT;
fs/btrfs/relocation.c
3823
rc->reloc_root_tree.rb_root = RB_ROOT;
fs/btrfs/relocation.c
3835
&rc->reloc_root_tree.rb_root, rb_node)
fs/btrfs/relocation.c
384
rb_erase(&cur->rb_node, &cache->rb_root);
fs/btrfs/relocation.c
494
rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, &node->simple_node);
fs/btrfs/relocation.c
521
rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
fs/btrfs/relocation.c
525
rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
fs/btrfs/relocation.c
562
rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,
fs/btrfs/relocation.c
566
rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);
fs/btrfs/relocation.c
576
rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, &node->simple_node);
fs/btrfs/send.c
251
struct rb_root pending_dir_moves;
fs/btrfs/send.c
258
struct rb_root waiting_dir_moves;
fs/btrfs/send.c
2970
struct rb_root *root;
fs/btrfs/send.c
299
struct rb_root orphan_dirs;
fs/btrfs/send.c
301
struct rb_root rbtree_new_refs;
fs/btrfs/send.c
302
struct rb_root rbtree_deleted_refs;
fs/btrfs/send.c
4121
static int record_check_dir_ref_in_tree(struct rb_root *root,
fs/btrfs/send.c
4167
struct rb_root rbtree_check_dirs = RB_ROOT;
fs/btrfs/send.c
4642
static int record_ref_in_tree(struct rb_root *root, struct list_head *refs,
fs/btrfs/tree-mod-log.c
147
struct rb_root *tm_root;
fs/btrfs/tree-mod-log.c
514
struct rb_root *tm_root;
fs/btrfs/tree-mod-log.c
88
struct rb_root *tm_root;
fs/btrfs/ulist.h
43
struct rb_root root;
fs/btrfs/volumes.c
2006
n = rb_last(&fs_info->mapping_tree.rb_root);
fs/btrfs/volumes.c
3218
struct rb_node *node = fs_info->mapping_tree.rb_root.rb_node;
fs/btrfs/volumes.c
6130
while (!RB_EMPTY_ROOT(&fs_info->mapping_tree.rb_root)) {
fs/ceph/mds_client.h
469
struct rb_root quotarealms_inodes;
fs/ceph/mds_client.h
481
struct rb_root snap_realms;
fs/ceph/mds_client.h
489
struct rb_root request_tree; /* pending mds requests */
fs/ceph/mds_client.h
541
struct rb_root snapid_map_tree;
fs/ceph/mds_client.h
545
struct rb_root pool_perm_tree;
fs/ceph/snap.c
86
static void __insert_snap_realm(struct rb_root *root,
fs/ceph/super.h
362
struct rb_root index;
fs/ceph/super.h
403
struct rb_root i_fragtree;
fs/ceph/super.h
411
struct rb_root i_caps; /* cap list */
fs/eventpoll.c
1182
for (rbp = ep->rbr.rb_root.rb_node; rbp; ) {
fs/eventpoll.c
1388
struct rb_node **p = &ep->rbr.rb_root.rb_node, *parent = NULL;
fs/eventpoll.c
812
WARN_ON_ONCE(!RB_EMPTY_ROOT(&ep->rbr.rb_root));
fs/ext2/balloc.c
205
static void __rsv_window_dump(struct rb_root *root, int verbose,
fs/ext2/balloc.c
297
search_reserve_window(struct rb_root *root, ext2_fsblk_t goal)
fs/ext2/balloc.c
338
struct rb_root *root = &EXT2_SB(sb)->s_rsv_window_root;
fs/ext2/balloc.c
877
struct rb_root *fs_rsv_root = &EXT2_SB(sb)->s_rsv_window_root;
fs/ext2/ext2.h
105
struct rb_root s_rsv_window_root;
fs/ext4/dir.c
432
static void free_rb_tree_fname(struct rb_root *root)
fs/ext4/ext4.h
1137
struct rb_root i_prealloc_node;
fs/ext4/ext4.h
2620
struct rb_root root;
fs/ext4/ext4.h
270
struct rb_root root;
fs/ext4/ext4.h
3513
struct rb_root bb_free_root;
fs/ext4/extents_status.c
1309
static struct pending_reservation *__pr_tree_search(struct rb_root *root,
fs/ext4/extents_status.c
266
static struct extent_status *__es_tree_search(struct rb_root *root,
fs/ext4/extents_status.h
129
struct rb_root root;
fs/ext4/extents_status.h
73
struct rb_root root;
fs/ext4/mballoc.c
5228
static void ext4_mb_pa_rb_insert(struct rb_root *root, struct rb_node *new)
fs/ext4/mballoc.c
6394
ext4_merge_freed_extents(struct ext4_sb_info *sbi, struct rb_root *root,
fs/ext4/mballoc.c
6407
ext4_try_merge_freed_extent_prev(struct ext4_sb_info *sbi, struct rb_root *root,
fs/ext4/mballoc.c
6423
ext4_try_merge_freed_extent_next(struct ext4_sb_info *sbi, struct rb_root *root,
fs/ext4/mballoc.c
6449
struct rb_root *root = &db->bb_free_root;
fs/f2fs/extent_cache.c
185
struct rb_node *node = root->rb_root.rb_node;
fs/f2fs/extent_cache.c
225
struct rb_node **pnode = &root->rb_root.rb_node;
fs/f2fs/extent_cache.c
234
if (RB_EMPTY_ROOT(&root->rb_root))
fs/f2fs/extent_cache.c
444
&et->root.rb_root.rb_node, true);
fs/f2fs/extent_cache.c
584
struct rb_node **p = &et->root.rb_root.rb_node;
fs/f2fs/gc.c
460
struct rb_node *node = am->root.rb_root.rb_node;
fs/f2fs/gc.c
496
struct rb_node **p = &root->rb_root.rb_node;
fs/f2fs/segment.c
1030
struct rb_node *node = dcc->root.rb_root.rb_node;
fs/f2fs/segment.c
1053
struct rb_node **pnode = &root->rb_root.rb_node;
fs/f2fs/segment.c
1062
if (RB_EMPTY_ROOT(&root->rb_root))
fs/f2fs/segment.c
1396
struct rb_node **p = &dcc->root.rb_root.rb_node;
fs/fuse/dir.c
31
struct rb_root tree;
fs/fuse/fuse_i.h
692
struct rb_root polled_files;
fs/gfs2/incore.h
127
struct rb_root rd_rstree; /* multi-block reservation tree */
fs/gfs2/incore.h
752
struct rb_root sd_rindex_tree;
fs/hugetlbfs/inode.c
649
if (!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root))
fs/hugetlbfs/inode.c
710
if (!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root))
fs/jffs2/jffs2_fs_i.h
33
struct rb_root fragtree;
fs/jffs2/nodelist.c
169
static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root,
fs/jffs2/nodelist.c
215
static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag)
fs/jffs2/nodelist.c
524
struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset)
fs/jffs2/nodelist.c
565
void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c)
fs/jffs2/nodelist.c
59
uint32_t jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size)
fs/jffs2/nodelist.h
242
struct rb_root tn_root;
fs/jffs2/nodelist.h
327
static inline struct jffs2_node_frag *frag_first(struct rb_root *root)
fs/jffs2/nodelist.h
337
static inline struct jffs2_node_frag *frag_last(struct rb_root *root)
fs/jffs2/nodelist.h
371
struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset);
fs/jffs2/nodelist.h
372
void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete);
fs/jffs2/nodelist.h
374
uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size);
fs/jffs2/readinode.c
175
static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset)
fs/jffs2/readinode.c
402
static void eat_last(struct rb_root *root, struct rb_node *node)
fs/jffs2/readinode.c
424
static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn)
fs/jffs2/readinode.c
456
struct rb_root ver_root = RB_ROOT;
fs/jffs2/readinode.c
544
static void jffs2_free_tmp_dnode_info_list(struct rb_root *list)
fs/mount.h
15
struct rb_root mounts; /* Protected by namespace_sem */
fs/nfs/blocklayout/blocklayout.h
145
struct rb_root bl_ext_rw;
fs/nfs/blocklayout/blocklayout.h
146
struct rb_root bl_ext_ro;
fs/nfs/blocklayout/extent_tree.c
112
ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be)
fs/nfs/blocklayout/extent_tree.c
137
__ext_tree_insert(struct rb_root *root,
fs/nfs/blocklayout/extent_tree.c
178
__ext_tree_remove(struct rb_root *root,
fs/nfs/blocklayout/extent_tree.c
20
ext_tree_first(struct rb_root *root)
fs/nfs/blocklayout/extent_tree.c
259
struct rb_root *root;
fs/nfs/blocklayout/extent_tree.c
323
__ext_tree_lookup(struct rb_root *root, sector_t isect,
fs/nfs/blocklayout/extent_tree.c
381
ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be,
fs/nfs/blocklayout/extent_tree.c
409
struct rb_root *root = &bl->bl_ext_rw;
fs/nfs/blocklayout/extent_tree.c
47
__ext_tree_search(struct rb_root *root, sector_t start)
fs/nfs/blocklayout/extent_tree.c
697
struct rb_root *root = &bl->bl_ext_rw;
fs/nfs/blocklayout/extent_tree.c
96
ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be)
fs/nfs/dir.c
2979
struct rb_root *root_node = &nfsi->access_cache;
fs/nfs/dir.c
3184
struct rb_root *root_node = &nfsi->access_cache;
fs/nfsd/netns.h
87
struct rb_root conf_name_tree;
fs/nfsd/netns.h
89
struct rb_root unconf_name_tree;
fs/nfsd/nfs4state.c
3323
add_clp_to_name_tree(struct nfs4_client *new_clp, struct rb_root *root)
fs/nfsd/nfs4state.c
3343
find_clp_in_name_tree(struct xdr_netobj *name, struct rb_root *root)
fs/nfsd/nfscache.c
33
struct rb_root rb_head;
fs/nilfs2/the_nilfs.h
152
struct rb_root ns_cptree;
fs/ntfs3/bitmap.c
1095
struct rb_root start_tree;
fs/ntfs3/bitmap.c
1098
sizeof(struct rb_root));
fs/ntfs3/bitmap.c
1099
memset(&wnd->start_tree, 0, sizeof(struct rb_root));
fs/ntfs3/bitmap.c
1110
sizeof(struct rb_root));
fs/ntfs3/bitmap.c
142
static struct rb_node *rb_lookup(struct rb_root *root, size_t v)
fs/ntfs3/bitmap.c
167
static inline bool rb_insert_count(struct rb_root *root, struct e_node *e)
fs/ntfs3/bitmap.c
200
static inline bool rb_insert_start(struct rb_root *root, struct e_node *e)
fs/ntfs3/frecord.c
20
static struct mft_inode *ni_ins_mi(struct ntfs_inode *ni, struct rb_root *tree,
fs/ntfs3/ntfs_fs.h
158
struct rb_root start_tree; // Extents, sorted by 'start'.
fs/ntfs3/ntfs_fs.h
159
struct rb_root count_tree; // Extents, sorted by 'count + start'.
fs/ntfs3/ntfs_fs.h
384
struct rb_root mi_tree;
fs/ocfs2/cluster/nodemanager.h
46
struct rb_root cl_node_ip_tree;
fs/ocfs2/cluster/tcp.c
92
static struct rb_root o2net_handler_tree = RB_ROOT;
fs/ocfs2/ocfs2.h
494
struct rb_root osb_rf_lock_tree;
fs/ocfs2/ocfs2.h
75
struct rb_root ci_tree;
fs/ocfs2/refcounttree.c
534
struct rb_root *root = &osb->osb_rf_lock_tree;
fs/ocfs2/reservations.c
302
struct rb_root *root = &resmap->m_reservations;
fs/ocfs2/reservations.c
459
struct rb_root *root = &resmap->m_reservations;
fs/ocfs2/reservations.h
39
struct rb_root m_reservations;
fs/ocfs2/uptodate.c
129
static unsigned int ocfs2_purge_copied_metadata_tree(struct rb_root *root)
fs/ocfs2/uptodate.c
158
struct rb_root root = RB_ROOT;
fs/overlayfs/readdir.c
1081
struct rb_root root = RB_ROOT;
fs/overlayfs/readdir.c
125
static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root,
fs/overlayfs/readdir.c
40
struct rb_root root;
fs/overlayfs/readdir.c
423
struct rb_root *root)
fs/overlayfs/readdir.c
47
struct rb_root *root;
fs/overlayfs/readdir.c
649
struct rb_root *root)
fs/proc/generic.c
93
struct rb_root *root = &dir->subdir;
fs/proc/internal.h
60
struct rb_root subdir;
fs/smb/client/cached_dir.c
539
struct rb_root *root = &cifs_sb->tlink_tree;
fs/smb/client/cifs_fs_sb.h
51
struct rb_root tlink_tree;
fs/smb/client/connect.c
3971
struct rb_root *root = &cifs_sb->tlink_tree;
fs/smb/client/connect.c
4307
tlink_rb_search(struct rb_root *root, kuid_t uid)
fs/smb/client/connect.c
4327
tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink)
fs/smb/client/connect.c
4451
struct rb_root *root = &cifs_sb->tlink_tree;
fs/smb/client/connect.c
63
static void tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink);
fs/smb/client/misc.c
564
struct rb_root *root = &cifs_sb->tlink_tree;
fs/ubifs/debug.c
1808
struct rb_root inodes;
fs/ubifs/debug.c
745
for (rb = rb_first((struct rb_root *)&c->buds); rb; rb = rb_next(rb)) {
fs/ubifs/log.c
561
static int done_already(struct rb_root *done_tree, int lnum)
fs/ubifs/log.c
593
static void destroy_done_tree(struct rb_root *done_tree)
fs/ubifs/log.c
646
struct rb_root done_tree = RB_ROOT;
fs/ubifs/orphan.c
742
struct rb_root root;
fs/ubifs/orphan.c
756
static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum)
fs/ubifs/orphan.c
784
static int dbg_find_check_orphan(struct rb_root *root, ino_t inum)
fs/ubifs/orphan.c
802
static void dbg_free_check_tree(struct rb_root *root)
fs/ubifs/ubifs.h
1286
struct rb_root buds;
fs/ubifs/ubifs.h
1331
struct rb_root old_idx;
fs/ubifs/ubifs.h
1404
struct rb_root orph_tree;
fs/ubifs/ubifs.h
1509
struct rb_root size_tree;
fs/xattr.c
1290
rbp = rb_find(name, &xattrs->rb_root, rbtree_simple_xattr_cmp);
fs/xattr.c
1353
rbp = &xattrs->rb_root.rb_node;
fs/xattr.c
1376
&new_xattr->rb_node, &xattrs->rb_root);
fs/xattr.c
1378
rb_erase(&old_xattr->rb_node, &xattrs->rb_root);
fs/xattr.c
1392
rb_insert_color(&new_xattr->rb_node, &xattrs->rb_root);
fs/xattr.c
1468
for (rbp = rb_first(&xattrs->rb_root); rbp; rbp = rb_next(rbp)) {
fs/xattr.c
1517
rb_add(&new_xattr->rb_node, &xattrs->rb_root, rbtree_simple_xattr_less);
fs/xattr.c
1529
xattrs->rb_root = RB_ROOT;
fs/xattr.c
1547
rbp = rb_first(&xattrs->rb_root);
fs/xattr.c
1554
rb_erase(&xattr->rb_node, &xattrs->rb_root);
fs/xfs/scrub/bitmap.c
272
return bitmap->xb_root.rb_root.rb_node == NULL;
fs/xfs/scrub/bitmap.c
338
for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \
fs/xfs/scrub/bitmap.c
547
return bitmap->xb_root.rb_root.rb_node == NULL;
fs/xfs/scrub/bitmap.c
63
for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \
fs/xfs/xfs_extent_busy.c
25
struct rb_root eb_tree;
include/drm/drm_buddy.h
67
struct rb_root **free_trees;
include/drm/drm_mm.h
213
struct rb_root holes_addr;
include/drm/drm_prime.h
48
struct rb_root dmabufs;
include/drm/drm_prime.h
49
struct rb_root handles;
include/drm/drm_vma_manager.h
55
struct rb_root vm_files;
include/linux/bpf.h
616
void bpf_rb_root_free(const struct btf_field *field, void *rb_root,
include/linux/ceph/libceph.h
191
static bool __insert_##name(struct rb_root *root, type *t) \
include/linux/ceph/libceph.h
216
static void __maybe_unused insert_##name(struct rb_root *root, type *t) \
include/linux/ceph/libceph.h
221
static void erase_##name(struct rb_root *root, type *t) \
include/linux/ceph/libceph.h
234
static type *lookup_##name(struct rb_root *root, lookup_param_type key) \
include/linux/ceph/libceph.h
69
struct rb_root crush_locs;
include/linux/ceph/mon_client.h
91
struct rb_root generic_request_tree;
include/linux/ceph/osd_client.h
365
struct rb_root backoffs;
include/linux/ceph/osd_client.h
411
struct rb_root osds; /* osds */
include/linux/ceph/osd_client.h
418
struct rb_root linger_requests; /* lingering requests */
include/linux/ceph/osd_client.h
419
struct rb_root map_checks;
include/linux/ceph/osd_client.h
420
struct rb_root linger_map_checks;
include/linux/ceph/osd_client.h
89
struct rb_root o_requests;
include/linux/ceph/osd_client.h
90
struct rb_root o_linger_requests;
include/linux/ceph/osd_client.h
91
struct rb_root o_backoff_mappings;
include/linux/ceph/osd_client.h
92
struct rb_root o_backoffs_by_id;
include/linux/ceph/osdmap.h
182
struct rb_root pg_temp;
include/linux/ceph/osdmap.h
183
struct rb_root primary_temp;
include/linux/ceph/osdmap.h
186
struct rb_root pg_upmap; /* PG := raw set */
include/linux/ceph/osdmap.h
187
struct rb_root pg_upmap_items; /* from -> to within raw set */
include/linux/ceph/osdmap.h
191
struct rb_root pg_pools;
include/linux/ceph/osdmap.h
326
int ceph_parse_crush_location(char *crush_location, struct rb_root *locs);
include/linux/ceph/osdmap.h
327
int ceph_compare_crush_locs(struct rb_root *locs1, struct rb_root *locs2);
include/linux/ceph/osdmap.h
328
void ceph_clear_crush_locs(struct rb_root *locs);
include/linux/ceph/osdmap.h
331
struct rb_root *locs);
include/linux/crush/crush.h
305
struct rb_root type_names;
include/linux/crush/crush.h
308
struct rb_root names;
include/linux/crush/crush.h
311
struct rb_root choose_args;
include/linux/crush/crush.h
356
void clear_crush_names(struct rb_root *root);
include/linux/fs.h
555
return !RB_EMPTY_ROOT(&mapping->i_mmap.rb_root);
include/linux/interval_tree_generic.h
120
if (!root->rb_root.rb_node) \
include/linux/interval_tree_generic.h
136
node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
include/linux/interval_tree_generic.h
41
struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
include/linux/iova.h
30
struct rb_root rbroot; /* iova domain rbtree root */
include/linux/kernfs.h
161
struct rb_root children;
include/linux/kvm_host.h
756
struct rb_root gfn_tree;
include/linux/mempolicy.h
114
struct rb_root root;
include/linux/mm.h
271
extern struct rb_root nommu_region_tree;
include/linux/netdevice.h
258
struct rb_root tree;
include/linux/nfs_fs.h
189
struct rb_root access_cache;
include/linux/nfs_fs_sb.h
254
struct rb_root state_owners;
include/linux/ns/nstree_types.h
19
struct rb_root ns_rb;
include/linux/perf_event.h
998
struct rb_root tree;
include/linux/rbtree.h
142
rb_insert_color(node, &root->rb_root);
include/linux/rbtree.h
154
rb_erase(node, &root->rb_root);
include/linux/rbtree.h
165
rb_replace_node(victim, new, &root->rb_root);
include/linux/rbtree.h
196
struct rb_node **link = &tree->rb_root.rb_node;
include/linux/rbtree.h
223
rb_add(struct rb_node *node, struct rb_root *tree,
include/linux/rbtree.h
255
struct rb_node **link = &tree->rb_root.rb_node;
include/linux/rbtree.h
288
rb_find_add(struct rb_node *node, struct rb_root *tree,
include/linux/rbtree.h
324
rb_find_add_rcu(struct rb_node *node, struct rb_root *tree,
include/linux/rbtree.h
357
rb_find(const void *key, const struct rb_root *tree,
include/linux/rbtree.h
388
rb_find_rcu(const void *key, const struct rb_root *tree,
include/linux/rbtree.h
39
extern void rb_insert_color(struct rb_node *, struct rb_root *);
include/linux/rbtree.h
40
extern void rb_erase(struct rb_node *, struct rb_root *);
include/linux/rbtree.h
416
rb_find_first(const void *key, const struct rb_root *tree,
include/linux/rbtree.h
50
static inline struct rb_node *rb_first(const struct rb_root *root)
include/linux/rbtree.h
65
static inline struct rb_node *rb_last(const struct rb_root *root)
include/linux/rbtree.h
78
extern struct rb_node *rb_first_postorder(const struct rb_root *);
include/linux/rbtree.h
83
struct rb_root *root);
include/linux/rbtree.h
85
struct rb_root *root);
include/linux/rbtree_augmented.h
196
struct rb_node *parent, struct rb_root *root)
include/linux/rbtree_augmented.h
209
struct rb_node *parent, struct rb_root *root)
include/linux/rbtree_augmented.h
220
extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
include/linux/rbtree_augmented.h
224
__rb_erase_augmented(struct rb_node *node, struct rb_root *root,
include/linux/rbtree_augmented.h
326
rb_erase_augmented(struct rb_node *node, struct rb_root *root,
include/linux/rbtree_augmented.h
33
extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
include/linux/rbtree_augmented.h
340
rb_erase_augmented(node, &root->rb_root, augment);
include/linux/rbtree_augmented.h
47
rb_insert_augmented(struct rb_node *node, struct rb_root *root,
include/linux/rbtree_augmented.h
60
rb_insert_augmented(node, &root->rb_root, augment);
include/linux/rbtree_augmented.h
68
struct rb_node **link = &tree->rb_root.rb_node;
include/linux/rbtree_latch.h
46
struct rb_root tree[2];
include/linux/rbtree_latch.h
79
struct rb_root *root = <r->tree[idx];
include/linux/rbtree_types.h
27
struct rb_root rb_root;
include/linux/rbtree_types.h
31
#define RB_ROOT (struct rb_root) { NULL, }
include/linux/rmap.h
67
struct rb_root_cached rb_root;
include/linux/sched/ext.h
75
struct rb_root priq; /* used to order by p->scx.dsq_vtime */
include/linux/skbuff.h
3442
unsigned int skb_rbtree_purge(struct rb_root *root);
include/linux/sunrpc/xprt.h
295
struct rb_root recv_queue; /* Receive queue */
include/linux/swap.h
281
struct rb_root swap_extent_root;/* root of the swap extent rbtree */
include/linux/sysctl.h
225
struct rb_root root;
include/linux/tcp.h
252
struct rb_root out_of_order_queue;
include/linux/timerqueue.h
25
struct rb_node *leftmost = rb_first_cached(&head->rb_root);
include/linux/timerqueue.h
42
head->rb_root = RB_ROOT_CACHED;
include/linux/timerqueue_types.h
14
struct rb_root_cached rb_root;
include/linux/xattr.h
109
struct rb_root rb_root;
include/net/garp.h
109
struct rb_root gid;
include/net/inet_frag.h
94
struct rb_root rb_fragments;
include/net/inetpeer.h
62
struct rb_root rb_root;
include/net/mrp.h
125
struct rb_root mad;
include/net/netns/nexthop.h
13
struct rb_root rb_root; /* tree of nexthops by id */
include/net/sock.h
484
struct rb_root tcp_rtx_queue;
include/net/tcp.h
2257
void tcp_rbtree_insert(struct rb_root *root, struct sk_buff *skb);
include/rdma/rdma_vt.h
37
struct rb_root mcast_tree;
include/xen/arm/page.h
44
extern struct rb_root phys_to_mach;
ipc/mqueue.c
138
struct rb_root msg_tree;
kernel/bpf/helpers.c
2279
void bpf_rb_root_free(const struct btf_field *field, void *rb_root,
kernel/bpf/helpers.c
2282
struct rb_root_cached orig_root, *root = rb_root;
kernel/bpf/helpers.c
2294
bpf_rbtree_postorder_for_each_entry_safe(pos, n, &orig_root.rb_root) {
kernel/bpf/helpers.c
2508
struct rb_node **link = &((struct rb_root_cached *)root)->rb_root.rb_node;
kernel/bpf/helpers.c
2559
return (struct bpf_rb_node *)r->rb_root.rb_node;
kernel/bpf/local_storage.c
105
struct rb_root *root = &map->root;
kernel/bpf/local_storage.c
25
struct rb_root root;
kernel/bpf/local_storage.c
602
struct rb_root *root;
kernel/bpf/local_storage.c
70
struct rb_root *root = &map->root;
kernel/bpf/range_tree.c
57
struct rb_node *rb = rt->range_size_root.rb_root.rb_node;
kernel/bpf/range_tree.c
88
struct rb_node **link = &root->rb_root.rb_node, *rb = NULL;
kernel/events/core.c
4542
struct rb_root *tree;
kernel/events/uprobes.c
39
static struct rb_root uprobes_tree = RB_ROOT;
kernel/locking/rtmutex_api.c
511
DEBUG_LOCKS_WARN_ON(!RB_EMPTY_ROOT(&task->pi_waiters.rb_root));
kernel/locking/rtmutex_common.h
113
return !RB_EMPTY_ROOT(&lock->waiters.rb_root);
kernel/locking/rtmutex_common.h
145
return !RB_EMPTY_ROOT(&p->pi_waiters.rb_root);
kernel/locking/ww_mutex.h
123
struct rb_node *n = rb_last(&lock->rtmutex.waiters.rb_root);
kernel/locking/ww_mutex.h
96
struct rb_node *n = rb_first(&lock->rtmutex.waiters.rb_root);
kernel/power/swap.c
126
static struct rb_root swsusp_extents = RB_ROOT;
kernel/power/wakelock.c
36
static struct rb_root wakelocks_tree = RB_ROOT;
kernel/sched/deadline.c
571
return !RB_EMPTY_ROOT(&rq->dl.pushable_dl_tasks_root.rb_root);
kernel/sched/fair.c
1012
struct rb_node *node = cfs_rq->tasks_timeline.rb_root.rb_node;
kernel/sched/fair.c
1088
struct rb_node *last = rb_last(&cfs_rq->tasks_timeline.rb_root);
kernel/sched/fair.c
932
struct rb_node *root = cfs_rq->tasks_timeline.rb_root.rb_node;
kernel/sched/sched.h
1326
struct rb_root core_tree;
kernel/trace/trace_stat.c
126
struct rb_root *root = &session->stat_root;
kernel/trace/trace_stat.c
35
struct rb_root stat_root;
kernel/trace/trace_stat.c
75
static int insert_stat(struct rb_root *root, void *stat, cmp_func_t cmp)
lib/rbtree.c
227
____rb_erase_color(struct rb_node *parent, struct rb_root *root,
lib/rbtree.c
410
void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
lib/rbtree.c
434
void rb_insert_color(struct rb_node *node, struct rb_root *root)
lib/rbtree.c
440
void rb_erase(struct rb_node *node, struct rb_root *root)
lib/rbtree.c
456
void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
lib/rbtree.c
525
struct rb_root *root)
lib/rbtree.c
542
struct rb_root *root)
lib/rbtree.c
594
struct rb_node *rb_first_postorder(const struct rb_root *root)
lib/rbtree.c
76
struct rb_root *root, int color)
lib/rbtree.c
85
__rb_insert(struct rb_node *node, struct rb_root *root,
lib/rbtree_test.c
107
rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks);
lib/rbtree_test.c
113
struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
lib/rbtree_test.c
141
rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks);
lib/rbtree_test.c
176
rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb)
lib/rbtree_test.c
186
for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb))
lib/rbtree_test.c
198
for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
lib/rbtree_test.c
213
WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1);
lib/rbtree_test.c
224
for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) {
lib/rbtree_test.c
291
for (node = rb_first(&root.rb_root); node; node = rb_next(node))
lib/rbtree_test.c
305
node = rb_first(&root.rb_root);
lib/rbtree_test.c
35
struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
lib/rbtree_test.c
47
rb_insert_color(&node->rb, &root->rb_root);
lib/rbtree_test.c
52
struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;
lib/rbtree_test.c
72
rb_erase(&node->rb, &root->rb_root);
lib/rbtree_test.c
89
struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;
lib/timerqueue.c
40
return rb_add_cached(&node->node, &head->rb_root, __timerqueue_less);
lib/timerqueue.c
57
rb_erase_cached(&node->node, &head->rb_root);
lib/timerqueue.c
60
return !RB_EMPTY_ROOT(&head->rb_root.rb_root);
mm/backing-dev.c
32
static struct rb_root bdi_tree = RB_ROOT;
mm/interval_tree.c
57
rb_insert_augmented(&node->shared.rb, &root->rb_root,
mm/kmemleak.c
200
static struct rb_root object_tree_root = RB_ROOT;
mm/kmemleak.c
202
static struct rb_root object_phys_tree_root = RB_ROOT;
mm/kmemleak.c
204
static struct rb_root object_percpu_tree_root = RB_ROOT;
mm/kmemleak.c
405
static struct rb_root *object_tree(unsigned long objflags)
mm/ksm.c
1142
struct rb_root *root)
mm/ksm.c
1661
struct rb_root *root,
mm/ksm.c
1789
struct rb_root *root,
mm/ksm.c
1804
struct rb_root *root)
mm/ksm.c
1811
struct rb_root *root)
mm/ksm.c
1828
struct rb_root *root;
mm/ksm.c
2043
struct rb_root *root;
mm/ksm.c
2139
struct rb_root *root;
mm/ksm.c
228
static struct rb_root one_stable_tree[1] = { RB_ROOT };
mm/ksm.c
229
static struct rb_root one_unstable_tree[1] = { RB_ROOT };
mm/ksm.c
230
static struct rb_root *root_stable_tree = one_stable_tree;
mm/ksm.c
231
static struct rb_root *root_unstable_tree = one_unstable_tree;
mm/ksm.c
3183
anon_vma_interval_tree_foreach(vmac, &anon_vma->rb_root,
mm/ksm.c
3249
anon_vma_interval_tree_foreach(vmac, &av->rb_root, 0,
mm/ksm.c
3321
struct rb_root *root)
mm/ksm.c
3581
struct rb_root *buf;
mm/ksm.c
839
struct rb_root *root)
mm/ksm.c
872
struct rb_root *root)
mm/memcontrol-v1.c
113
struct rb_node **p = &mctz->rb_root.rb_node;
mm/memcontrol-v1.c
140
rb_insert_color(&mz->tree_node, &mctz->rb_root);
mm/memcontrol-v1.c
153
rb_erase(&mz->tree_node, &mctz->rb_root);
mm/memcontrol-v1.c
2235
rtpn->rb_root = RB_ROOT;
mm/memcontrol-v1.c
25
struct rb_root rb_root;
mm/memcontrol-v1.c
346
if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root))
mm/memory-failure.c
567
anon_vma_interval_tree_foreach(vmac, &av->rb_root,
mm/memory.c
4300
if (unlikely(!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root)))
mm/memory.c
4330
if (unlikely(!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root)))
mm/nommu.c
53
struct rb_root nommu_region_tree = RB_ROOT;
mm/rmap.c
214
anon_vma_interval_tree_insert(avc, &anon_vma->rb_root);
mm/rmap.c
2981
anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root,
mm/rmap.c
357
anon_vma_interval_tree_insert(avc, &anon_vma->rb_root);
mm/rmap.c
437
anon_vma_interval_tree_insert(avc, &anon_vma->rb_root);
mm/rmap.c
502
anon_vma_interval_tree_remove(avc, &anon_vma->rb_root);
mm/rmap.c
508
if (RB_EMPTY_ROOT(&anon_vma->rb_root.rb_root)) {
mm/rmap.c
549
anon_vma->rb_root = RB_ROOT_CACHED;
mm/shmem_quota.c
127
node = ((struct rb_root *)info->dqi_priv)->rb_node;
mm/shmem_quota.c
178
n = &((struct rb_root *)info->dqi_priv)->rb_node;
mm/shmem_quota.c
210
rb_insert_color(new_node, (struct rb_root *)info->dqi_priv);
mm/shmem_quota.c
279
node = ((struct rb_root *)info->dqi_priv)->rb_node;
mm/shmem_quota.c
70
info->dqi_priv = kzalloc_obj(struct rb_root, GFP_NOFS);
mm/shmem_quota.c
96
struct rb_root *root = info->dqi_priv;
mm/vma.c
2120
if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) {
mm/vma.c
2136
&anon_vma->root->rb_root.rb_root.rb_node))
mm/vma.c
2255
if (test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) {
mm/vma.c
2269
&anon_vma->root->rb_root.rb_root.rb_node))
mm/vma.c
272
anon_vma_interval_tree_remove(avc, &avc->anon_vma->rb_root);
mm/vma.c
281
anon_vma_interval_tree_insert(avc, &avc->anon_vma->rb_root);
mm/vmalloc.c
1079
static struct vmap_area *__find_vmap_area(unsigned long addr, struct rb_root *root)
mm/vmalloc.c
1102
__find_vmap_area_exceed_addr(unsigned long addr, struct rb_root *root)
mm/vmalloc.c
1183
struct rb_root *root, struct rb_node *from,
mm/vmalloc.c
1247
__link_va(struct vmap_area *va, struct rb_root *root,
mm/vmalloc.c
1287
link_va(struct vmap_area *va, struct rb_root *root,
mm/vmalloc.c
1295
link_va_augment(struct vmap_area *va, struct rb_root *root,
mm/vmalloc.c
1303
__unlink_va(struct vmap_area *va, struct rb_root *root, bool augment)
mm/vmalloc.c
1319
unlink_va(struct vmap_area *va, struct rb_root *root)
mm/vmalloc.c
1325
unlink_va_augment(struct vmap_area *va, struct rb_root *root)
mm/vmalloc.c
1401
struct rb_root *root, struct list_head *head)
mm/vmalloc.c
1413
struct rb_node *from, struct rb_root *root,
mm/vmalloc.c
1443
struct rb_root *root, struct list_head *head, bool augment)
mm/vmalloc.c
1527
struct rb_root *root, struct list_head *head)
mm/vmalloc.c
1534
struct rb_root *root, struct list_head *head)
mm/vmalloc.c
1570
find_vmap_lowest_match(struct rb_root *root, unsigned long size,
mm/vmalloc.c
1653
find_vmap_lowest_match_check(struct rb_root *root, struct list_head *head,
mm/vmalloc.c
1707
va_clip(struct rb_root *root, struct list_head *head,
mm/vmalloc.c
1808
struct rb_root *root, struct list_head *head,
mm/vmalloc.c
1837
__alloc_vmap_area(struct rb_root *root, struct list_head *head,
mm/vmalloc.c
2227
struct rb_root decay_root = RB_ROOT;
mm/vmalloc.c
898
static struct rb_root free_vmap_area_root = RB_ROOT;
mm/vmalloc.c
914
struct rb_root root;
net/bridge/br_private.h
364
struct rb_root eht_set_tree;
net/bridge/br_private.h
365
struct rb_root eht_host_tree;
net/bridge/br_private_mcast_eht.h
45
struct rb_root entry_tree;
net/ceph/auth_x.h
47
struct rb_root ticket_handlers;
net/ceph/osd_client.c
1940
static struct ceph_osd_backoff *lookup_containing_backoff(struct rb_root *root,
net/ceph/osd_client.c
3931
struct rb_root *need_resend,
net/ceph/osd_client.c
4008
struct rb_root *need_resend,
net/ceph/osd_client.c
4078
struct rb_root *need_resend,
net/ceph/osd_client.c
4141
struct rb_root need_resend = RB_ROOT;
net/ceph/osdmap.c
1381
static int decode_pg_mapping(void **p, void *end, struct rb_root *mapping_root,
net/ceph/osdmap.c
184
static int decode_crush_names(void **p, void *end, struct rb_root *root)
net/ceph/osdmap.c
219
void clear_crush_names(struct rb_root *root)
net/ceph/osdmap.c
2923
int ceph_parse_crush_location(char *crush_location, struct rb_root *locs)
net/ceph/osdmap.c
2968
int ceph_compare_crush_locs(struct rb_root *locs1, struct rb_root *locs2)
net/ceph/osdmap.c
2992
void ceph_clear_crush_locs(struct rb_root *locs)
net/ceph/osdmap.c
3085
struct rb_root *locs)
net/ceph/osdmap.c
784
static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi)
net/ceph/string_table.c
9
static struct rb_root string_tree = RB_ROOT;
net/core/skbuff.c
4035
unsigned int skb_rbtree_purge(struct rb_root *root)
net/ipv4/inet_fragment.c
302
inet_frag_rbtree_purge(struct rb_root *root, enum skb_drop_reason reason)
net/ipv4/inetpeer.c
100
pp = &base->rb_root.rb_node;
net/ipv4/inetpeer.c
163
rb_erase(&p->rb_node, &base->rb_root);
net/ipv4/inetpeer.c
211
rb_insert_color(&p->rb_node, &base->rb_root);
net/ipv4/inetpeer.c
276
struct rb_node *p = rb_first(&base->rb_root);
net/ipv4/inetpeer.c
282
rb_erase(&peer->rb_node, &base->rb_root);
net/ipv4/inetpeer.c
59
bp->rb_root = RB_ROOT;
net/ipv4/nexthop.c
2187
rb_erase(&nh->rb_node, &net->nexthop.rb_root);
net/ipv4/nexthop.c
2589
struct rb_root *root = &net->nexthop.rb_root;
net/ipv4/nexthop.c
2663
rb_erase(&new_nh->rb_node, &net->nexthop.rb_root);
net/ipv4/nexthop.c
2702
struct rb_root *root = &net->nexthop.rb_root;
net/ipv4/nexthop.c
3520
struct rb_root *root,
net/ipv4/nexthop.c
3597
struct rb_root *root = &net->nexthop.rb_root;
net/ipv4/nexthop.c
3795
struct rb_root *root = &net->nexthop.rb_root;
net/ipv4/nexthop.c
3955
struct rb_root *root = &net->nexthop.rb_root;
net/ipv4/nexthop.c
4118
net->nexthop.rb_root = RB_ROOT;
net/ipv4/nexthop.c
593
pp = &net->nexthop.rb_root.rb_node;
net/ipv4/tcp_input.c
5768
struct rb_root *root)
net/ipv4/tcp_input.c
5792
tcp_collapse(struct sock *sk, struct sk_buff_head *list, struct rb_root *root,
net/ipv4/tcp_output.c
70
void tcp_rbtree_insert(struct rb_root *root, struct sk_buff *skb)
net/mptcp/protocol.h
332
struct rb_root out_of_order_queue;
net/netfilter/nf_conncount.c
371
static void tree_nodes_free(struct rb_root *root,
net/netfilter/nf_conncount.c
399
struct rb_root *root,
net/netfilter/nf_conncount.c
494
struct rb_root *root;
net/netfilter/nf_conncount.c
554
struct rb_root *root;
net/netfilter/nf_conncount.c
61
struct rb_root root[CONNCOUNT_SLOTS];
net/netfilter/nf_conncount.c
659
static void destroy_tree(struct rb_root *r)
net/netfilter/nft_set_rbtree.c
32
struct rb_root root;
net/rds/cong.c
102
static struct rb_root rds_cong_tree = RB_ROOT;
net/rds/rdma.c
65
static struct rds_mr *rds_mr_tree_walk(struct rb_root *root, u64 key,
net/rds/rds.h
680
struct rb_root rs_rdma_keys;
net/rxrpc/ar-internal.h
156
struct rb_root pending_oobq; /* OOB messages awaiting userspace to respond to */
net/rxrpc/ar-internal.h
165
struct rb_root calls; /* User ID -> call mapping */
net/rxrpc/ar-internal.h
348
struct rb_root client_bundles; /* Client connection bundles by socket params */
net/rxrpc/ar-internal.h
387
struct rb_root service_conns; /* Service connections */
net/sched/sch_etf.c
166
struct rb_node **p = &q->head.rb_root.rb_node, *parent = NULL;
net/sched/sch_fq.c
124
struct rb_root *fq_root;
net/sched/sch_fq.c
138
struct rb_root delayed; /* for rate limited flows */
net/sched/sch_fq.c
257
struct rb_root *root,
net/sched/sch_fq.c
358
struct rb_root *root;
net/sched/sch_fq.c
71
struct rb_root t_root;
net/sched/sch_fq.c
803
struct rb_root *root;
net/sched/sch_fq.c
839
struct rb_root *old_array, u32 old_log,
net/sched/sch_fq.c
840
struct rb_root *new_array, u32 new_log)
net/sched/sch_fq.c
843
struct rb_root *oroot, *nroot;
net/sched/sch_fq.c
891
struct rb_root *array;
net/sched/sch_fq.c
899
array = kvmalloc_node(sizeof(struct rb_root) << log, GFP_KERNEL | __GFP_RETRY_MAYFAIL,
net/sched/sch_hfsc.c
128
struct rb_root vt_tree; /* active children sorted by cl_vt */
net/sched/sch_hfsc.c
130
struct rb_root cf_tree; /* active children sorted by cl_f */
net/sched/sch_hfsc.c
172
struct rb_root eligible; /* eligible tree */
net/sched/sch_htb.c
145
struct rb_root wait_pq;
net/sched/sch_htb.c
287
static void htb_add_to_id_tree(struct rb_root *root,
net/sched/sch_htb.c
376
static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)
net/sched/sch_htb.c
755
struct rb_root *wait_pq = &q->hlevel[level].wait_pq;
net/sched/sch_htb.c
78
struct rb_root row;
net/sched/sch_htb.c
79
struct rb_root feed;
net/sched/sch_netem.c
76
struct rb_root t_root;
net/smc/smc_core.h
288
struct rb_root conns_all; /* connection tree */
net/tipc/group.c
199
struct rb_root *tree = &grp->members;
net/tipc/group.c
214
struct rb_root *tree = &grp->members;
net/tipc/group.c
81
struct rb_root members;
net/tipc/name_table.c
84
struct rb_root ranges;
net/wireless/core.h
77
struct rb_root bss_tree;
net/xfrm/xfrm_policy.c
1043
struct rb_root *root,
net/xfrm/xfrm_policy.c
1118
static void xfrm_policy_inexact_gc_tree(struct rb_root *r, bool rm)
net/xfrm/xfrm_policy.c
135
struct rb_root root_d;
net/xfrm/xfrm_policy.c
138
struct rb_root root_s;
net/xfrm/xfrm_policy.c
1991
xfrm_policy_lookup_inexact_addr(const struct rb_root *r,
net/xfrm/xfrm_policy.c
73
struct rb_root root;
net/xfrm/xfrm_policy.c
957
struct rb_root *new,
rust/helpers/rbtree.c
12
__rust_helper struct rb_node *rust_helper_rb_first(const struct rb_root *root)
rust/helpers/rbtree.c
17
__rust_helper struct rb_node *rust_helper_rb_last(const struct rb_root *root)
security/apparmor/include/label.h
75
struct rb_root root;
security/keys/internal.h
66
extern struct rb_root key_user_tree;
security/keys/internal.h
86
extern struct rb_root key_serial_tree;
security/keys/key.c
20
struct rb_root key_serial_tree; /* tree of keys indexed by serial */
security/keys/key.c
23
struct rb_root key_user_tree; /* tree of quota records indexed by UID */
security/keys/proc.c
268
static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r)
security/landlock/ruleset.c
147
static struct rb_root *get_root(struct landlock_ruleset *const ruleset,
security/landlock/ruleset.c
213
struct rb_root *root;
security/landlock/ruleset.c
323
struct rb_root *src_root;
security/landlock/ruleset.c
408
struct rb_root *parent_root;
security/landlock/ruleset.c
592
const struct rb_root *root;
security/landlock/ruleset.h
126
struct rb_root root_inode;
security/landlock/ruleset.h
135
struct rb_root root_net_port;
tools/bpf/resolve_btfids/main.c
143
struct rb_root sets;
tools/bpf/resolve_btfids/main.c
144
struct rb_root structs;
tools/bpf/resolve_btfids/main.c
145
struct rb_root unions;
tools/bpf/resolve_btfids/main.c
146
struct rb_root typedefs;
tools/bpf/resolve_btfids/main.c
147
struct rb_root funcs;
tools/bpf/resolve_btfids/main.c
209
static struct btf_id *btf_id__find(struct rb_root *root, const char *name)
tools/bpf/resolve_btfids/main.c
228
static struct btf_id *__btf_id__add(struct rb_root *root,
tools/bpf/resolve_btfids/main.c
265
static inline struct btf_id *btf_id__add(struct rb_root *root,
tools/bpf/resolve_btfids/main.c
272
static inline struct btf_id *btf_id__add_unique(struct rb_root *root,
tools/bpf/resolve_btfids/main.c
344
static struct btf_id *add_symbol(struct rb_root *root, char *name, size_t size)
tools/bpf/resolve_btfids/main.c
356
static void btf_id__free_all(struct rb_root *root)
tools/bpf/resolve_btfids/main.c
635
struct rb_root *root;
tools/bpf/resolve_btfids/main.c
719
static int __symbols_patch(struct object *obj, struct rb_root *root)
tools/include/linux/interval_tree_generic.h
120
if (!root->rb_root.rb_node) \
tools/include/linux/interval_tree_generic.h
136
node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \
tools/include/linux/interval_tree_generic.h
41
struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \
tools/include/linux/rbtree.h
103
static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)
tools/include/linux/rbtree.h
120
struct rb_root rb_root;
tools/include/linux/rbtree.h
135
rb_insert_color(node, &root->rb_root);
tools/include/linux/rbtree.h
143
rb_erase(node, &root->rb_root);
tools/include/linux/rbtree.h
152
rb_replace_node(victim, new, &root->rb_root);
tools/include/linux/rbtree.h
181
struct rb_node **link = &tree->rb_root.rb_node;
tools/include/linux/rbtree.h
206
rb_add(struct rb_node *node, struct rb_root *tree,
tools/include/linux/rbtree.h
234
rb_find_add(struct rb_node *node, struct rb_root *tree,
tools/include/linux/rbtree.h
267
rb_find(const void *key, const struct rb_root *tree,
tools/include/linux/rbtree.h
295
rb_find_first(const void *key, const struct rb_root *tree,
tools/include/linux/rbtree.h
36
#define RB_ROOT (struct rb_root) { NULL, }
tools/include/linux/rbtree.h
48
extern void rb_insert_color(struct rb_node *, struct rb_root *);
tools/include/linux/rbtree.h
49
extern void rb_erase(struct rb_node *, struct rb_root *);
tools/include/linux/rbtree.h
55
extern struct rb_node *rb_first(const struct rb_root *);
tools/include/linux/rbtree.h
56
extern struct rb_node *rb_last(const struct rb_root *);
tools/include/linux/rbtree.h
59
extern struct rb_node *rb_first_postorder(const struct rb_root *);
tools/include/linux/rbtree.h
64
struct rb_root *root);
tools/include/linux/rbtree_augmented.h
172
struct rb_node *parent, struct rb_root *root)
tools/include/linux/rbtree_augmented.h
183
extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
tools/include/linux/rbtree_augmented.h
187
__rb_erase_augmented(struct rb_node *node, struct rb_root *root,
tools/include/linux/rbtree_augmented.h
291
rb_erase_augmented(struct rb_node *node, struct rb_root *root,
tools/include/linux/rbtree_augmented.h
305
rb_erase_augmented(node, &root->rb_root, augment);
tools/include/linux/rbtree_augmented.h
35
extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
tools/include/linux/rbtree_augmented.h
49
rb_insert_augmented(struct rb_node *node, struct rb_root *root,
tools/include/linux/rbtree_augmented.h
62
rb_insert_augmented(node, &root->rb_root, augment);
tools/lib/rbtree.c
227
____rb_erase_color(struct rb_node *parent, struct rb_root *root,
tools/lib/rbtree.c
410
void __rb_erase_color(struct rb_node *parent, struct rb_root *root,
tools/lib/rbtree.c
433
void rb_insert_color(struct rb_node *node, struct rb_root *root)
tools/lib/rbtree.c
438
void rb_erase(struct rb_node *node, struct rb_root *root)
tools/lib/rbtree.c
453
void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,
tools/lib/rbtree.c
462
struct rb_node *rb_first(const struct rb_root *root)
tools/lib/rbtree.c
474
struct rb_node *rb_last(const struct rb_root *root)
tools/lib/rbtree.c
546
struct rb_root *root)
tools/lib/rbtree.c
591
struct rb_node *rb_first_postorder(const struct rb_root *root)
tools/lib/rbtree.c
76
struct rb_root *root, int color)
tools/lib/rbtree.c
85
__rb_insert(struct rb_node *node, struct rb_root *root,
tools/objtool/elf.c
239
n = rb_find(&hole, &sec->symbol_tree.rb_root, symbol_hole_by_offset);
tools/perf/builtin-kmem.c
1263
static void sort_slab_insert(struct rb_root *root, struct alloc_stat *data,
tools/perf/builtin-kmem.c
1293
static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted,
tools/perf/builtin-kmem.c
1310
static void sort_page_insert(struct rb_root *root, struct page_stat *data,
tools/perf/builtin-kmem.c
1340
static void __sort_page_result(struct rb_root *root, struct rb_root *root_sorted,
tools/perf/builtin-kmem.c
223
struct rb_root *root,
tools/perf/builtin-kmem.c
303
static struct rb_root page_live_tree;
tools/perf/builtin-kmem.c
304
static struct rb_root page_alloc_tree;
tools/perf/builtin-kmem.c
305
static struct rb_root page_alloc_sorted;
tools/perf/builtin-kmem.c
306
static struct rb_root page_caller_tree;
tools/perf/builtin-kmem.c
307
static struct rb_root page_caller_sorted;
tools/perf/builtin-kmem.c
75
static struct rb_root root_alloc_stat;
tools/perf/builtin-kmem.c
76
static struct rb_root root_alloc_sorted;
tools/perf/builtin-kmem.c
77
static struct rb_root root_caller_stat;
tools/perf/builtin-kmem.c
78
static struct rb_root root_caller_sorted;
tools/perf/builtin-kmem.c
999
static void __print_slab_result(struct rb_root *root,
tools/perf/builtin-kwork.c
316
struct rb_node *node = root->rb_root.rb_node;
tools/perf/builtin-kwork.c
340
struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;
tools/perf/builtin-lock.c
1823
struct rb_root root = RB_ROOT;
tools/perf/builtin-lock.c
268
static struct rb_root sorted; /* place to store intermediate data */
tools/perf/builtin-lock.c
269
static struct rb_root result; /* place to store sorted data */
tools/perf/builtin-lock.c
423
static void insert_to(struct rb_root *rr, struct lock_stat *st,
tools/perf/builtin-lock.c
453
static inline struct lock_stat *pop_from(struct rb_root *rr)
tools/perf/builtin-lock.c
49
static struct rb_root thread_stats;
tools/perf/builtin-sched.c
1015
struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;
tools/perf/builtin-sched.c
3153
callchain_param.sort(&itr->sorted_root.rb_root, &itr->callchain,
tools/perf/builtin-sched.c
3424
struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;
tools/perf/builtin-sched.c
989
struct rb_node *node = root->rb_root.rb_node;
tools/perf/tests/code-reading.c
379
struct rb_root *tested_sections)
tools/perf/tests/code-reading.c
50
struct rb_root *tested_sections)
tools/perf/tests/code-reading.c
531
struct rb_root *tested_sections)
tools/perf/tests/code-reading.c
561
union perf_event *event, struct rb_root *tested_sections)
tools/perf/tests/code-reading.c
585
struct rb_root *tested_sections)
tools/perf/tests/code-reading.c
697
struct rb_root tested_sections = RB_ROOT;
tools/perf/tests/code-reading.c
92
static void tested_sections__free(struct rb_root *root)
tools/perf/tests/hists_cumulate.c
144
while (!RB_EMPTY_ROOT(&root_out->rb_root)) {
tools/perf/tests/hists_cumulate.c
196
struct rb_root *root;
tools/perf/tests/hists_cumulate.c
215
root = &hists->entries.rb_root;
tools/perf/tests/hists_cumulate.c
235
root = &he->callchain->node.rb_root;
tools/perf/tests/hists_output.c
109
while (!RB_EMPTY_ROOT(&root_out->rb_root)) {
tools/perf/ui/browser.c
140
struct rb_root *root = browser->entries;
tools/perf/ui/browsers/annotate.c
285
struct rb_root *root = &browser->entries;
tools/perf/ui/browsers/annotate.c
30
struct rb_root entries;
tools/perf/ui/browsers/hists.c
1014
struct rb_root *root,
tools/perf/ui/browsers/hists.c
1099
struct rb_root *root, int level,
tools/perf/ui/browsers/hists.c
1151
row += hist_browser__show_callchain_graph(browser, &child->rb_root,
tools/perf/ui/browsers/hists.c
182
for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
tools/perf/ui/browsers/hists.c
260
static int callchain__count_rows(struct rb_root *chain)
tools/perf/ui/browsers/hists.c
331
struct rb_node *nd = rb_first(&node->rb_root);
tools/perf/ui/browsers/hists.c
333
for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
tools/perf/ui/browsers/hists.c
342
!RB_EMPTY_ROOT(&child->rb_root);
tools/perf/ui/browsers/hists.c
345
!RB_EMPTY_ROOT(&child->rb_root);
tools/perf/ui/browsers/hists.c
362
chain->has_children = !RB_EMPTY_ROOT(&node->rb_root);
tools/perf/ui/browsers/hists.c
368
static void callchain__init_have_children(struct rb_root *root)
tools/perf/ui/browsers/hists.c
391
he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root);
tools/perf/ui/browsers/hists.c
516
for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) {
tools/perf/ui/browsers/hists.c
552
static int callchain__set_folding(struct rb_root *chain, bool unfold)
tools/perf/ui/browsers/hists.c
910
struct rb_root *root,
tools/perf/ui/gtk/hists.c
160
static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store,
tools/perf/ui/gtk/hists.c
220
static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store,
tools/perf/ui/gtk/hists.c
265
perf_gtk__add_callchain_graph(&node->rb_root, store, &iter, col,
tools/perf/ui/gtk/hists.c
270
static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store,
tools/perf/ui/gtk/hists.c
97
static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store,
tools/perf/ui/stdio/hist.c
113
static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root,
tools/perf/ui/stdio/hist.c
169
ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total,
tools/perf/ui/stdio/hist.c
221
static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root,
tools/perf/ui/stdio/hist.c
270
root = &cnode->rb_root;
tools/perf/ui/stdio/hist.c
309
static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree,
tools/perf/ui/stdio/hist.c
360
static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree,
tools/perf/util/annotate-data.c
1766
void annotated_data_type__tree_delete(struct rb_root *root)
tools/perf/util/annotate-data.c
707
void global_var_type__tree_delete(struct rb_root *root)
tools/perf/util/annotate-data.h
237
void annotated_data_type__tree_delete(struct rb_root *root);
tools/perf/util/annotate-data.h
240
void global_var_type__tree_delete(struct rb_root *root);
tools/perf/util/annotate-data.h
283
static inline void annotated_data_type__tree_delete(struct rb_root *root __maybe_unused)
tools/perf/util/annotate-data.h
287
static inline void global_var_type__tree_delete(struct rb_root *root __maybe_unused)
tools/perf/util/annotate.c
1062
static void insert_source_line(struct rb_root *root, struct annotation_line *al)
tools/perf/util/annotate.c
1111
static void __resort_source_line(struct rb_root *root, struct annotation_line *al)
tools/perf/util/annotate.c
1131
static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root)
tools/perf/util/annotate.c
1149
static void print_summary(struct rb_root *root, const char *filename)
tools/perf/util/annotate.c
1626
struct rb_root *root)
tools/perf/util/annotate.c
1629
struct rb_root tmp_root = RB_ROOT;
tools/perf/util/annotate.c
1658
static void symbol__calc_lines(struct map_symbol *ms, struct rb_root *root)
tools/perf/util/annotate.c
1670
struct rb_root source_line = RB_ROOT;
tools/perf/util/annotate.c
1710
struct rb_root source_line = RB_ROOT;
tools/perf/util/block-range.c
8
struct rb_root root;
tools/perf/util/bpf-trace-summary.c
24
static struct rb_root cgroups = RB_ROOT;
tools/perf/util/call-path.h
35
struct rb_root children;
tools/perf/util/callchain.c
1766
struct rb_root *root = &he->sorted_chain;
tools/perf/util/callchain.c
390
rb_insert_callchain(struct rb_root *root, struct callchain_node *chain,
tools/perf/util/callchain.c
431
__sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node,
tools/perf/util/callchain.c
442
__sort_chain_flat(rb_root, child, min_hit);
tools/perf/util/callchain.c
446
rb_insert_callchain(rb_root, node, CHAIN_FLAT);
tools/perf/util/callchain.c
454
sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root,
tools/perf/util/callchain.c
457
*rb_root = RB_ROOT;
tools/perf/util/callchain.c
458
__sort_chain_flat(rb_root, &root->node, min_hit);
tools/perf/util/callchain.c
467
node->rb_root = RB_ROOT;
tools/perf/util/callchain.c
476
rb_insert_callchain(&node->rb_root, child,
tools/perf/util/callchain.c
482
sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root,
tools/perf/util/callchain.c
486
rb_root->rb_node = chain_root->node.rb_root.rb_node;
tools/perf/util/callchain.c
496
node->rb_root = RB_ROOT;
tools/perf/util/callchain.c
506
rb_insert_callchain(&node->rb_root, child,
tools/perf/util/callchain.c
512
sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root,
tools/perf/util/callchain.c
516
rb_root->rb_node = chain_root->node.rb_root.rb_node;
tools/perf/util/callchain.h
66
struct rb_root rb_root_in; /* input tree of children */
tools/perf/util/callchain.h
67
struct rb_root rb_root; /* sorted output tree of children */
tools/perf/util/callchain.h
82
typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *,
tools/perf/util/cgroup.c
515
static struct cgroup *__cgroup__findnew(struct rb_root *root, uint64_t id,
tools/perf/util/cgroup.c
569
struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id)
tools/perf/util/cgroup.c
600
void read_all_cgroups(struct rb_root *root)
tools/perf/util/cgroup.h
40
struct cgroup *__cgroup__find(struct rb_root *root, uint64_t id);
tools/perf/util/cgroup.h
54
void read_all_cgroups(struct rb_root *root);
tools/perf/util/dso.c
897
struct rb_root *root = &dso__data(dso)->cache;
tools/perf/util/dso.c
914
const struct rb_root *root = &dso__data(dso)->cache;
tools/perf/util/dso.c
940
struct rb_root *root = &dso__data(dso)->cache;
tools/perf/util/dso.h
227
struct rb_root cache;
tools/perf/util/dso.h
260
struct rb_root data_types;
tools/perf/util/dso.h
261
struct rb_root global_vars;
tools/perf/util/dso.h
663
static inline struct rb_root *dso__data_types(struct dso *dso)
tools/perf/util/dso.h
668
static inline struct rb_root *dso__global_vars(struct dso *dso)
tools/perf/util/dso.h
769
return !RB_EMPTY_ROOT(&RC_CHK_ACCESS(dso)->symbols.rb_root);
tools/perf/util/env.c
176
struct rb_root *root;
tools/perf/util/env.h
132
struct rb_root infos;
tools/perf/util/env.h
134
struct rb_root btfs;
tools/perf/util/env.h
141
struct rb_root tree;
tools/perf/util/header.c
1034
struct rb_root *root;
tools/perf/util/header.c
1076
struct rb_root *root;
tools/perf/util/header.c
1987
struct rb_root *root;
tools/perf/util/header.c
2014
struct rb_root *root;
tools/perf/util/hist.c
1455
struct rb_root *root = &he->hroot_out.rb_root;
tools/perf/util/hist.c
1629
struct rb_node **p = &root->rb_root.rb_node;
tools/perf/util/hist.c
1750
struct rb_node **p = &root->rb_root.rb_node;
tools/perf/util/hist.c
1933
struct rb_node **p = &root->rb_root.rb_node;
tools/perf/util/hist.c
2020
struct rb_node **p = &entries->rb_root.rb_node;
tools/perf/util/hist.c
2163
node = rb_last(&he->hroot_out.rb_root);
tools/perf/util/hist.c
2353
struct rb_node **p = &root->rb_root.rb_node;
tools/perf/util/hist.c
2556
p = &root->rb_root.rb_node;
tools/perf/util/hist.c
2599
p = &root->rb_root.rb_node;
tools/perf/util/hist.c
2637
n = hists->entries_collapsed.rb_root.rb_node;
tools/perf/util/hist.c
2639
n = hists->entries_in->rb_root.rb_node;
tools/perf/util/hist.c
2659
struct rb_node *n = root->rb_root.rb_node;
tools/perf/util/hist.c
3031
while (!RB_EMPTY_ROOT(&root->rb_root)) {
tools/perf/util/hist.c
692
p = &hists->entries_in->rb_root.rb_node;
tools/perf/util/hist.h
316
struct rb_root sorted_chain; /* leaf entry has callchains */
tools/perf/util/intel-pt.c
162
struct rb_root vmcs_info;
tools/perf/util/intel-pt.c
318
static struct intel_pt_vmcs_info *intel_pt_findnew_vmcs(struct rb_root *rb_root,
tools/perf/util/intel-pt.c
322
struct rb_node **p = &rb_root->rb_node;
tools/perf/util/intel-pt.c
346
rb_insert_color(&v->rb_node, rb_root);
tools/perf/util/jitdump.c
55
struct rb_root code_root;
tools/perf/util/lock-contention.h
151
struct rb_root cgroups;
tools/perf/util/machine.c
247
struct rb_node **p = &machines->guests.rb_root.rb_node;
tools/perf/util/machine.c
294
struct rb_node **p = &machines->guests.rb_root.rb_node;
tools/perf/util/map.c
332
struct rb_node *nd = rb_last(&symbols->rb_root);
tools/perf/util/mem2node.c
18
static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root)
tools/perf/util/mem2node.h
11
struct rb_root root;
tools/perf/util/rblist.c
15
struct rb_node **p = &rblist->entries.rb_root.rb_node;
tools/perf/util/rblist.c
57
struct rb_node **p = &rblist->entries.rb_root.rb_node;
tools/perf/util/srcline.c
365
struct rb_node **p = &tree->rb_root.rb_node;
tools/perf/util/srcline.c
395
struct rb_node *n = tree->rb_root.rb_node;
tools/perf/util/srcline.c
457
struct rb_node **p = &tree->rb_root.rb_node;
tools/perf/util/srcline.c
479
struct rb_node *n = tree->rb_root.rb_node;
tools/perf/util/stream.c
101
struct rb_root *root = &he->sorted_chain;
tools/perf/util/symbol.c
1039
static void add_module(struct module_info *mi, struct rb_root *modules)
tools/perf/util/symbol.c
1057
static void delete_modules(struct rb_root *modules)
tools/perf/util/symbol.c
1072
struct rb_root *modules)
tools/perf/util/symbol.c
1096
struct rb_root *modules = arg;
tools/perf/util/symbol.c
1116
static int read_proc_modules(const char *filename, struct rb_root *modules)
tools/perf/util/symbol.c
1131
struct rb_root from_modules = RB_ROOT;
tools/perf/util/symbol.c
1132
struct rb_root to_modules = RB_ROOT;
tools/perf/util/symbol.c
1172
struct rb_root *modules = data;
tools/perf/util/symbol.c
1190
struct rb_root modules = RB_ROOT;
tools/perf/util/symbol.c
363
struct rb_node **p = &symbols->rb_root.rb_node;
tools/perf/util/symbol.c
406
n = symbols->rb_root.rb_node;
tools/perf/util/symbol.c
434
struct rb_node *n = rb_last(&symbols->rb_root);
tools/testing/selftests/kvm/include/kvm_util.h
78
struct rb_root gpa_tree;
tools/testing/selftests/kvm/include/kvm_util.h
79
struct rb_root hva_tree;
tools/testing/selftests/kvm/lib/kvm_util.c
869
static void vm_userspace_mem_region_gpa_insert(struct rb_root *gpa_tree,
tools/testing/selftests/kvm/lib/kvm_util.c
895
static void vm_userspace_mem_region_hva_insert(struct rb_root *hva_tree,
tools/testing/vma/include/custom.h
39
struct rb_root_cached rb_root;
virt/kvm/kvm_main.c
1470
struct rb_root *gfn_tree = &slots->gfn_tree;
