rb_root 29 arch/arm/xen/p2m.c struct rb_root phys_to_mach = RB_ROOT; rb_root 50 arch/powerpc/kernel/eeh_cache.c struct rb_root rb_root; rb_root 56 arch/powerpc/kernel/eeh_cache.c struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; rb_root 103 arch/powerpc/kernel/eeh_cache.c n = rb_first(&cache->rb_root); rb_root 121 arch/powerpc/kernel/eeh_cache.c struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; rb_root 155 arch/powerpc/kernel/eeh_cache.c rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root); rb_root 226 arch/powerpc/kernel/eeh_cache.c n = rb_first(&pci_io_addr_cache_root.rb_root); rb_root 234 arch/powerpc/kernel/eeh_cache.c rb_erase(n, &pci_io_addr_cache_root.rb_root); rb_root 277 arch/powerpc/kernel/eeh_cache.c for (n = rb_first(&pci_io_addr_cache_root.rb_root); n; n = rb_next(n)) { rb_root 559 arch/powerpc/perf/hv-24x7.c static int event_uniq_add(struct rb_root *root, const char *name, int nl, rb_root 606 arch/powerpc/perf/hv-24x7.c static void event_uniq_destroy(struct rb_root *root) rb_root 700 arch/powerpc/perf/hv-24x7.c struct rb_root ev_uniq = RB_ROOT; rb_root 41 arch/sh/kernel/dwarf.c static struct rb_root cie_root; rb_root 44 arch/sh/kernel/dwarf.c static struct rb_root fde_root; rb_root 37 arch/x86/mm/pat_rbtree.c static struct rb_root memtype_rbroot = RB_ROOT; rb_root 63 arch/x86/mm/pat_rbtree.c static struct memtype *memtype_rb_lowest_match(struct rb_root *root, rb_root 93 arch/x86/mm/pat_rbtree.c static struct memtype *memtype_rb_match(struct rb_root *root, rb_root 120 arch/x86/mm/pat_rbtree.c static int memtype_rb_check_conflict(struct rb_root *root, rb_root 166 arch/x86/mm/pat_rbtree.c static void memtype_rb_insert(struct rb_root *root, struct memtype *newdata) rb_root 815 block/bfq-cgroup.c struct rb_root *child_active = &child_st->active; rb_root 838 block/bfq-cgroup.c struct rb_root *active = &st->active; rb_root 551 block/bfq-iosched.c bfq_rq_pos_tree_lookup(struct bfq_data *bfqd, struct rb_root *root, rb_root 693 block/bfq-iosched.c !RB_EMPTY_ROOT(&bfqd->queue_weights_tree.rb_root) && rb_root 694 block/bfq-iosched.c (bfqd->queue_weights_tree.rb_root.rb_node->rb_left || rb_root 695 block/bfq-iosched.c bfqd->queue_weights_tree.rb_root.rb_node->rb_right); rb_root 726 block/bfq-iosched.c struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; rb_root 2414 block/bfq-iosched.c struct rb_root *root = &bfq_bfqq_to_bfqg(bfqq)->rq_pos_tree; rb_root 47 block/bfq-iosched.h struct rb_root active; rb_root 49 block/bfq-iosched.h struct rb_root idle; rb_root 157 block/bfq-iosched.h struct rb_root *tree; rb_root 254 block/bfq-iosched.h struct rb_root *pos_root; rb_root 257 block/bfq-iosched.h struct rb_root sort_list; rb_root 912 block/bfq-iosched.h struct rb_root rq_pos_tree; rb_root 925 block/bfq-iosched.h struct rb_root rq_pos_tree; rb_root 23 block/bfq-wf2q.c static struct bfq_entity *bfq_root_active_entity(struct rb_root *tree) rb_root 333 block/bfq-wf2q.c static void bfq_extract(struct rb_root *root, struct bfq_entity *entity) rb_root 374 block/bfq-wf2q.c static void bfq_insert(struct rb_root *root, struct bfq_entity *entity) rb_root 654 block/blk-throttle.c struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; rb_root 255 block/elevator.c void elv_rb_add(struct rb_root *root, struct request *rq) rb_root 276 block/elevator.c void elv_rb_del(struct rb_root *root, struct request *rq) rb_root 284 block/elevator.c struct request *elv_rb_find(struct rb_root *root, sector_t sector) rb_root 44 block/mq-deadline.c struct rb_root sort_list[2]; rb_root 67 block/mq-deadline.c static inline struct rb_root * rb_root 90 block/mq-deadline.c struct rb_root *root = deadline_rb_root(dd, rq); rb_root 465 drivers/android/binder.c struct rb_root threads; rb_root 466 drivers/android/binder.c struct rb_root nodes; rb_root 467 drivers/android/binder.c struct rb_root refs_by_desc; rb_root 468 drivers/android/binder.c struct rb_root refs_by_node; rb_root 98 drivers/android/binder_alloc.h struct rb_root free_buffers; rb_root 99 drivers/android/binder_alloc.h struct rb_root allocated_buffers; rb_root 160 drivers/base/regmap/internal.h struct rb_root range_tree; rb_root 35 drivers/base/regmap/regcache-rbtree.c struct rb_root root; rb_root 96 drivers/base/regmap/regcache-rbtree.c static int regcache_rbtree_insert(struct regmap *map, struct rb_root *root, rb_root 534 drivers/base/regmap/regmap.c struct rb_root *root = &map->range_tree; rb_root 876 drivers/block/drbd/drbd_int.h struct rb_root read_requests; rb_root 877 drivers/block/drbd/drbd_int.h struct rb_root write_requests; rb_root 25 drivers/block/drbd/drbd_interval.c drbd_insert_interval(struct rb_root *root, struct drbd_interval *this) rb_root 68 drivers/block/drbd/drbd_interval.c drbd_contains_interval(struct rb_root *root, sector_t sector, rb_root 95 drivers/block/drbd/drbd_interval.c drbd_remove_interval(struct rb_root *root, struct drbd_interval *this) rb_root 112 drivers/block/drbd/drbd_interval.c drbd_find_overlap(struct rb_root *root, sector_t sector, unsigned int size) rb_root 29 drivers/block/drbd/drbd_interval.h extern bool drbd_insert_interval(struct rb_root *, struct drbd_interval *); rb_root 30 drivers/block/drbd/drbd_interval.h extern bool drbd_contains_interval(struct rb_root *, sector_t, rb_root 32 drivers/block/drbd/drbd_interval.h extern void drbd_remove_interval(struct rb_root *, struct drbd_interval *); rb_root 33 drivers/block/drbd/drbd_interval.h extern struct drbd_interval *drbd_find_overlap(struct rb_root *, sector_t, rb_root 2126 drivers/block/drbd/drbd_receiver.c find_request(struct drbd_device *device, struct rb_root *root, u64 id, rb_root 5717 drivers/block/drbd/drbd_receiver.c struct rb_root *root, const char *func, rb_root 78 drivers/block/drbd/drbd_req.c static void drbd_remove_request_interval(struct rb_root *root, rb_root 119 drivers/block/drbd/drbd_req.c struct rb_root *root; rb_root 304 drivers/block/xen-blkback/blkback.c static void free_persistent_gnts(struct xen_blkif_ring *ring, struct rb_root *root, rb_root 393 drivers/block/xen-blkback/blkback.c struct rb_root *root; rb_root 272 drivers/block/xen-blkback/common.h struct rb_root persistent_gnts; rb_root 41 drivers/dma-buf/sync_debug.h struct rb_root pt_tree; rb_root 77 drivers/fpga/dfl-afu.h struct rb_root dma_regions; rb_root 84 drivers/gpu/drm/amd/amdgpu/amdgpu_mn.c &amn->objects.rb_root, it.rb) { rb_root 2960 drivers/gpu/drm/amd/amdgpu/amdgpu_vm.c if (!RB_EMPTY_ROOT(&vm->va.rb_root)) { rb_root 2964 drivers/gpu/drm/amd/amdgpu/amdgpu_vm.c &vm->va.rb_root, rb) { rb_root 193 drivers/gpu/drm/drm_mm.c link = &mm->interval_tree.rb_root.rb_node; rb_root 240 drivers/gpu/drm/drm_mm.c struct rb_node **link = &root->rb_root.rb_node, *rb = NULL; rb_root 301 drivers/gpu/drm/drm_mm.c struct rb_node *rb = mm->holes_size.rb_root.rb_node; rb_root 148 drivers/gpu/drm/drm_vma_manager.c iter = mgr->vm_addr_space_mm.interval_tree.rb_root.rb_node; rb_root 94 drivers/gpu/drm/i915/gem/i915_gem_object_types.h struct rb_root tree; rb_root 99 drivers/gpu/drm/i915/gem/i915_gem_userptr.c if (RB_EMPTY_ROOT(&mn->objects.rb_root)) rb_root 1073 drivers/gpu/drm/i915/gt/intel_engine_cs.c if (!RB_EMPTY_ROOT(&engine->execlists.queue.rb_root)) rb_root 507 drivers/gpu/drm/i915/gt/intel_lrc.c GEM_BUG_ON(RB_EMPTY_ROOT(&engine->execlists.queue.rb_root)); rb_root 1697 drivers/gpu/drm/i915/gt/intel_lrc.c GEM_BUG_ON(RB_EMPTY_ROOT(&engine->execlists.queue.rb_root)); rb_root 2655 drivers/gpu/drm/i915/gt/intel_lrc.c if (!RB_EMPTY_ROOT(&execlists->queue.rb_root)) rb_root 3598 drivers/gpu/drm/i915/gt/intel_lrc.c parent = &sibling->execlists.virtual.rb_root.rb_node; rb_root 211 drivers/gpu/drm/i915/gvt/gvt.h struct rb_root gfn_cache; rb_root 212 drivers/gpu/drm/i915/gvt/gvt.h struct rb_root dma_addr_cache; rb_root 127 drivers/gpu/drm/i915/i915_active.c struct rb_root root; rb_root 50 drivers/gpu/drm/i915/i915_active_types.h struct rb_root tree; rb_root 1351 drivers/gpu/drm/i915/i915_drv.h struct rb_root uabi_engines; rb_root 52 drivers/gpu/drm/i915/i915_scheduler.c rb_first(&execlists->queue.rb_root)); rb_root 92 drivers/gpu/drm/i915/i915_scheduler.c parent = &execlists->queue.rb_root.rb_node; rb_root 14 drivers/gpu/drm/nouveau/include/nvkm/core/client.h struct rb_root objroot; rb_root 40 drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h struct rb_root free; rb_root 41 drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h struct rb_root root; rb_root 1236 drivers/gpu/drm/radeon/radeon_vm.c if (!RB_EMPTY_ROOT(&vm->va.rb_root)) { rb_root 1240 drivers/gpu/drm/radeon/radeon_vm.c &vm->va.rb_root, it.rb) { rb_root 122 drivers/infiniband/core/cm.c struct rb_root listen_service_table; rb_root 125 drivers/infiniband/core/cm.c struct rb_root remote_qp_table; rb_root 126 drivers/infiniband/core/cm.c struct rb_root remote_id_table; rb_root 127 drivers/infiniband/core/cm.c struct rb_root remote_sidr_table; rb_root 63 drivers/infiniband/core/multicast.c struct rb_root table; rb_root 193 drivers/infiniband/core/umem_odp.c WARN_ON(!RB_EMPTY_ROOT(&per_mm->umem_tree.rb_root)); rb_root 109 drivers/infiniband/core/uverbs.h struct rb_root xrcd_tree; rb_root 146 drivers/infiniband/hw/mlx4/cm.c struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map; rb_root 174 drivers/infiniband/hw/mlx4/cm.c struct rb_root *sl_id_map = &sriov->sl_id_map; rb_root 191 drivers/infiniband/hw/mlx4/cm.c struct rb_root *sl_id_map = &to_mdev(ibdev)->sriov.sl_id_map; rb_root 385 drivers/infiniband/hw/mlx4/cm.c struct rb_root *sl_id_map = &sriov->sl_id_map; rb_root 476 drivers/infiniband/hw/mlx4/mlx4_ib.h struct rb_root mcg_table; rb_root 498 drivers/infiniband/hw/mlx4/mlx4_ib.h struct rb_root sl_id_map; rb_root 58 drivers/infiniband/hw/qib/qib_user_sdma.c static struct rb_root qib_user_sdma_rb_root = RB_ROOT; rb_root 132 drivers/infiniband/hw/qib/qib_user_sdma.c struct rb_root dma_pages_root; rb_root 141 drivers/infiniband/hw/qib/qib_user_sdma.c qib_user_sdma_rb_search(struct rb_root *root, pid_t pid) rb_root 160 drivers/infiniband/hw/qib/qib_user_sdma.c qib_user_sdma_rb_insert(struct rb_root *root, struct qib_user_sdma_rb_node *new) rb_root 106 drivers/infiniband/sw/rxe/rxe_pool.h struct rb_root tree; rb_root 342 drivers/infiniband/ulp/ipoib/ipoib.h struct rb_root path_tree; rb_root 349 drivers/infiniband/ulp/ipoib/ipoib.h struct rb_root multicast_tree; rb_root 154 drivers/iommu/iova.c iova_insert_rbtree(struct rb_root *root, struct iova *iova, rb_root 243 drivers/md/bcache/bcache.h struct rb_root keys; rb_root 22 drivers/md/dm-bio-prison-v1.c struct rb_root cells; rb_root 24 drivers/md/dm-bio-prison-v2.c struct rb_root cells; rb_root 103 drivers/md/dm-bufio.c struct rb_root buffer_tree; rb_root 27 drivers/md/dm-cache-background-tracker.c struct rb_root pending; rb_root 144 drivers/md/dm-crypt.c struct rb_root write_tree; rb_root 1517 drivers/md/dm-crypt.c struct rb_root write_tree; rb_root 24 drivers/md/dm-dust.c struct rb_root badblocklist; rb_root 35 drivers/md/dm-dust.c static struct badblock *dust_rb_search(struct rb_root *root, sector_t blk) rb_root 53 drivers/md/dm-dust.c static bool dust_rb_insert(struct rb_root *root, struct badblock *new) rb_root 225 drivers/md/dm-dust.c static bool __dust_clear_badblocks(struct rb_root *tree, rb_root 252 drivers/md/dm-dust.c struct rb_root badblocklist; rb_root 184 drivers/md/dm-integrity.c struct rb_root journal_tree_root; rb_root 212 drivers/md/dm-integrity.c struct rb_root in_progress; rb_root 89 drivers/md/dm-snap.c struct rb_root out_of_order_tree; rb_root 354 drivers/md/dm-thin.c struct rb_root sort_bio_list; /* sorted list of deferred bios */ rb_root 112 drivers/md/dm-writecache.c struct rb_root freetree; rb_root 116 drivers/md/dm-writecache.c struct rb_root tree; rb_root 163 drivers/md/dm-zoned-metadata.c struct rb_root mblk_rbtree; rb_root 328 drivers/md/dm-zoned-metadata.c struct rb_root *root = &zmd->mblk_rbtree; rb_root 351 drivers/md/dm-zoned-metadata.c struct rb_root *root = &zmd->mblk_rbtree; rb_root 2340 drivers/md/dm-zoned-metadata.c struct rb_root *root; rb_root 71 drivers/mtd/mtdswap.c struct rb_root *root; rb_root 85 drivers/mtd/mtdswap.c struct rb_root root; rb_root 203 drivers/mtd/mtdswap.c static void __mtdswap_rb_add(struct rb_root *root, struct swap_eb *eb) rb_root 224 drivers/mtd/mtdswap.c struct rb_root *root; rb_root 236 drivers/mtd/mtdswap.c static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx) rb_root 418 drivers/mtd/mtdswap.c struct rb_root hist_root = RB_ROOT; rb_root 567 drivers/mtd/mtdswap.c struct rb_root *clean_root; rb_root 805 drivers/mtd/mtdswap.c struct rb_root *root; rb_root 848 drivers/mtd/mtdswap.c struct rb_root *rp = NULL; rb_root 1186 drivers/mtd/mtdswap.c struct rb_root *root = &d->trees[i].root; rb_root 26 drivers/mtd/ubi/fastmap-wl.c static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root) rb_root 60 drivers/mtd/ubi/fastmap-wl.c static int anchor_pebs_available(struct rb_root *root) rb_root 376 drivers/mtd/ubi/fastmap-wl.c struct rb_root *root) { rb_root 587 drivers/mtd/ubi/ubi.h struct rb_root ltree; rb_root 604 drivers/mtd/ubi/ubi.h struct rb_root used; rb_root 605 drivers/mtd/ubi/ubi.h struct rb_root erroneous; rb_root 606 drivers/mtd/ubi/ubi.h struct rb_root free; rb_root 608 drivers/mtd/ubi/ubi.h struct rb_root scrub; rb_root 718 drivers/mtd/ubi/ubi.h struct rb_root root; rb_root 758 drivers/mtd/ubi/ubi.h struct rb_root volumes; rb_root 127 drivers/mtd/ubi/wl.c struct ubi_wl_entry *e, struct rb_root *root); rb_root 139 drivers/mtd/ubi/wl.c static void wl_tree_add(struct ubi_wl_entry *e, struct rb_root *root) rb_root 236 drivers/mtd/ubi/wl.c static int in_wl_tree(struct ubi_wl_entry *e, struct rb_root *root) rb_root 319 drivers/mtd/ubi/wl.c struct rb_root *root, int diff) rb_root 362 drivers/mtd/ubi/wl.c struct rb_root *root) rb_root 1585 drivers/mtd/ubi/wl.c static void tree_destroy(struct ubi_device *ubi, struct rb_root *root) rb_root 1984 drivers/mtd/ubi/wl.c struct ubi_wl_entry *e, struct rb_root *root) rb_root 5 drivers/mtd/ubi/wl.h static int anchor_pebs_available(struct rb_root *root); rb_root 7 drivers/mtd/ubi/wl.h static struct ubi_wl_entry *find_anchor_wl_entry(struct rb_root *root); rb_root 18 drivers/mtd/ubi/wl.h struct rb_root *root); rb_root 25 drivers/mtd/ubi/wl.h struct rb_root *root) { rb_root 558 drivers/net/ethernet/mellanox/mlx4/mlx4.h struct rb_root res_tree[MLX4_NUM_OF_RESOURCE_TYPE]; rb_root 235 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c static void *res_tracker_lookup(struct rb_root *root, u64 res_id) rb_root 253 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c static int res_tracker_insert(struct rb_root *root, struct res_common *res) rb_root 1286 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c struct rb_root *root = &tracker->res_tree[type]; rb_root 5029 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c struct rb_root *root = &tracker->res_tree[RES_FS_RULE]; rb_root 120 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c struct rb_root rules_rb; rb_root 860 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c _rule_search(struct rb_root *root, struct fs_fte *fte) rb_root 891 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c static inline int _rule_insert(struct rb_root *root, rb_root 933 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c struct rb_root *root = &ipsec_dev->rules_rb; rb_root 1316 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c static void destroy_rules_rb(struct rb_root *root) rb_root 78 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_root *root = &dev->priv.page_root; rb_root 116 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_root *root = &dev->priv.page_root; rb_root 68 drivers/vfio/vfio_iommu_type1.c struct rb_root dma_list; rb_root 92 drivers/vfio/vfio_iommu_type1.c struct rb_root pfn_list; /* Ex-user pinned pfn list */ rb_root 63 drivers/xen/evtchn.c struct rb_root evtchns; rb_root 288 fs/afs/internal.h struct rb_root cells; rb_root 303 fs/afs/internal.h struct rb_root fs_servers; /* afs_server (by server UUID or address) */ rb_root 236 fs/btrfs/backref.c p = &root->rb_root.rb_node; rb_root 289 fs/btrfs/backref.c &preftree->root.rb_root, rbnode) rb_root 1236 fs/btrfs/backref.c WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect_missing_keys.root.rb_root)); rb_root 1243 fs/btrfs/backref.c WARN_ON(!RB_EMPTY_ROOT(&preftrees.indirect.root.rb_root)); rb_root 345 fs/btrfs/ctree.c struct rb_root *tm_root; rb_root 401 fs/btrfs/ctree.c struct rb_root *tm_root; rb_root 684 fs/btrfs/ctree.c struct rb_root *tm_root; rb_root 405 fs/btrfs/ctree.h struct rb_root root; rb_root 437 fs/btrfs/ctree.h struct rb_root root; rb_root 551 fs/btrfs/ctree.h struct rb_root block_group_cache_tree; rb_root 678 fs/btrfs/ctree.h struct rb_root tree_mod_log; rb_root 773 fs/btrfs/ctree.h struct rb_root defrag_inodes; rb_root 823 fs/btrfs/ctree.h struct rb_root qgroup_tree; rb_root 888 fs/btrfs/ctree.h struct rb_root swapfile_pins; rb_root 900 fs/btrfs/ctree.h struct rb_root block_tree; rb_root 953 fs/btrfs/ctree.h struct rb_root blocks[BTRFS_MAX_LEVEL]; rb_root 1023 fs/btrfs/ctree.h struct rb_root inode_tree; rb_root 341 fs/btrfs/delayed-inode.c struct rb_root *root, rb_root 395 fs/btrfs/delayed-inode.c return __btrfs_lookup_delayed_item(&delayed_node->ins_root.rb_root, key, rb_root 416 fs/btrfs/delayed-inode.c p = &root->rb_root.rb_node; rb_root 281 fs/btrfs/delayed-ref.c struct rb_node **p = &root->rb_root.rb_node; rb_root 313 fs/btrfs/delayed-ref.c struct rb_node **p = &root->rb_root.rb_node; rb_root 365 fs/btrfs/delayed-ref.c struct rb_root *root = &dr->href_root.rb_root; rb_root 488 fs/btrfs/delayed-ref.c if (RB_EMPTY_ROOT(&head->ref_tree.rb_root)) rb_root 143 fs/btrfs/delayed-ref.h struct rb_root dirty_extent_root; rb_root 1712 fs/btrfs/extent-tree.c if (RB_EMPTY_ROOT(&head->ref_tree.rb_root)) rb_root 1838 fs/btrfs/extent-tree.c if (!RB_EMPTY_ROOT(&head->ref_tree.rb_root) || head->extent_op) { rb_root 2079 fs/btrfs/extent-tree.c static u64 find_middle(struct rb_root *root) rb_root 3205 fs/btrfs/extent-tree.c if (!RB_EMPTY_ROOT(&head->ref_tree.rb_root)) rb_root 326 fs/btrfs/extent_io.c static struct rb_node *tree_insert(struct rb_root *root, rb_root 386 fs/btrfs/extent_io.c struct rb_root *root = &tree->state; rb_root 126 fs/btrfs/extent_io.h struct rb_root state; rb_root 96 fs/btrfs/extent_map.c struct rb_node **p = &root->rb_root.rb_node; rb_root 145 fs/btrfs/extent_map.c static struct rb_node *__tree_search(struct rb_root *root, u64 offset, rb_root 423 fs/btrfs/extent_map.c rb_node = __tree_search(&tree->map.rb_root, start, &prev, &next); rb_root 1449 fs/btrfs/free-space-cache.c static int tree_insert_offset(struct rb_root *root, u64 offset, rb_root 20 fs/btrfs/free-space-cache.h struct rb_root free_space_offset; rb_root 254 fs/btrfs/inode-map.c struct rb_root *rbroot = &root->free_ino_pinned->free_space_offset; rb_root 2469 fs/btrfs/inode.c struct rb_root root; rb_root 2513 fs/btrfs/inode.c static void backref_insert(struct rb_root *root, rb_root 5434 fs/btrfs/inode.c while (!RB_EMPTY_ROOT(&map_tree->map.rb_root)) { rb_root 31 fs/btrfs/ordered-data.c static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, rb_root 67 fs/btrfs/ordered-data.c static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, rb_root 144 fs/btrfs/ordered-data.c struct rb_root *root = &tree->tree; rb_root 12 fs/btrfs/ordered-data.h struct rb_root tree; rb_root 3813 fs/btrfs/qgroup.c struct rb_root *cur_root = &swapped_blocks->blocks[i]; rb_root 4033 fs/btrfs/qgroup.c struct rb_root *root; rb_root 69 fs/btrfs/ref-verify.c struct rb_root roots; rb_root 70 fs/btrfs/ref-verify.c struct rb_root refs; rb_root 75 fs/btrfs/ref-verify.c static struct block_entry *insert_block_entry(struct rb_root *root, rb_root 98 fs/btrfs/ref-verify.c static struct block_entry *lookup_block_entry(struct rb_root *root, u64 bytenr) rb_root 116 fs/btrfs/ref-verify.c static struct root_entry *insert_root_entry(struct rb_root *root, rb_root 161 fs/btrfs/ref-verify.c static struct ref_entry *insert_ref_entry(struct rb_root *root, rb_root 187 fs/btrfs/ref-verify.c static struct root_entry *lookup_root_entry(struct rb_root *root, u64 objectid) rb_root 92 fs/btrfs/relocation.c struct rb_root rb_root; rb_root 124 fs/btrfs/relocation.c struct rb_root rb_root; rb_root 196 fs/btrfs/relocation.c tree->rb_root = RB_ROOT; rb_root 203 fs/btrfs/relocation.c cache->rb_root = RB_ROOT; rb_root 234 fs/btrfs/relocation.c ASSERT(RB_EMPTY_ROOT(&cache->rb_root)); rb_root 282 fs/btrfs/relocation.c static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, rb_root 306 fs/btrfs/relocation.c static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) rb_root 411 fs/btrfs/relocation.c rb_erase(&node->rb_node, &tree->rb_root); rb_root 460 fs/btrfs/relocation.c rb_erase(&node->rb_node, &cache->rb_root); rb_root 462 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); rb_root 586 fs/btrfs/relocation.c rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); rb_root 848 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, key.offset); rb_root 958 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, eb->start); rb_root 1047 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, node->bytenr, rb_root 1096 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, upper->bytenr, rb_root 1140 fs/btrfs/relocation.c rb_erase(&upper->rb_node, &cache->rb_root); rb_root 1217 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, src->commit_root->start); rb_root 1227 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, rb_root 1264 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, new_node->bytenr, rb_root 1305 fs/btrfs/relocation.c rb_node = tree_insert(&rc->reloc_root_tree.rb_root, rb_root 1331 fs/btrfs/relocation.c rb_node = tree_search(&rc->reloc_root_tree.rb_root, rb_root 1335 fs/btrfs/relocation.c rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); rb_root 1362 fs/btrfs/relocation.c rb_node = tree_search(&rc->reloc_root_tree.rb_root, rb_root 1366 fs/btrfs/relocation.c rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); rb_root 1376 fs/btrfs/relocation.c rb_node = tree_insert(&rc->reloc_root_tree.rb_root, rb_root 2584 fs/btrfs/relocation.c static void free_block_list(struct rb_root *blocks) rb_root 3138 fs/btrfs/relocation.c struct reloc_control *rc, struct rb_root *blocks) rb_root 3450 fs/btrfs/relocation.c struct rb_root *blocks) rb_root 3509 fs/btrfs/relocation.c struct rb_root *blocks) rb_root 3652 fs/btrfs/relocation.c struct rb_root *blocks) rb_root 3820 fs/btrfs/relocation.c struct rb_root *blocks) rb_root 4072 fs/btrfs/relocation.c struct rb_root blocks = RB_ROOT; rb_root 171 fs/btrfs/send.c struct rb_root pending_dir_moves; rb_root 178 fs/btrfs/send.c struct rb_root waiting_dir_moves; rb_root 219 fs/btrfs/send.c struct rb_root orphan_dirs; rb_root 15 fs/btrfs/tests/extent-map-tests.c while (!RB_EMPTY_ROOT(&em_tree->map.rb_root)) { rb_root 53 fs/btrfs/transaction.c &transaction->delayed_refs.href_root.rb_root)); rb_root 42 fs/btrfs/ulist.h struct rb_root root; rb_root 1871 fs/btrfs/volumes.c n = rb_last(&em_tree->map.rb_root); rb_root 63 fs/cachefiles/internal.h struct rb_root active_nodes; /* active nodes (can't be culled) */ rb_root 366 fs/ceph/mds_client.h struct rb_root quotarealms_inodes; rb_root 378 fs/ceph/mds_client.h struct rb_root snap_realms; rb_root 386 fs/ceph/mds_client.h struct rb_root request_tree; /* pending mds requests */ rb_root 431 fs/ceph/mds_client.h struct rb_root snapid_map_tree; rb_root 435 fs/ceph/mds_client.h struct rb_root pool_perm_tree; rb_root 83 fs/ceph/snap.c static void __insert_snap_realm(struct rb_root *root, rb_root 297 fs/ceph/super.h struct rb_root index; rb_root 336 fs/ceph/super.h struct rb_root i_fragtree; rb_root 344 fs/ceph/super.h struct rb_root i_caps; /* cap list */ rb_root 60 fs/cifs/cifs_fs_sb.h struct rb_root tlink_tree; rb_root 1906 fs/cifs/cifsglob.h GLOBAL_EXTERN struct rb_root uidtree; rb_root 1907 fs/cifs/cifsglob.h GLOBAL_EXTERN struct rb_root gidtree; rb_root 1910 fs/cifs/cifsglob.h GLOBAL_EXTERN struct rb_root siduidtree; rb_root 1911 fs/cifs/cifsglob.h GLOBAL_EXTERN struct rb_root sidgidtree; rb_root 336 fs/cifs/connect.c static void tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink); rb_root 5166 fs/cifs/connect.c struct rb_root *root = &cifs_sb->tlink_tree; rb_root 5335 fs/cifs/connect.c tlink_rb_search(struct rb_root *root, kuid_t uid) rb_root 5355 fs/cifs/connect.c tlink_rb_insert(struct rb_root *root, struct tcon_link *new_tlink) rb_root 5472 fs/cifs/connect.c struct rb_root *root = &cifs_sb->tlink_tree; rb_root 421 fs/dlm/debug_fs.c struct rb_root *tree; rb_root 503 fs/dlm/debug_fs.c struct rb_root *tree; rb_root 109 fs/dlm/dlm_internal.h struct rb_root keep; rb_root 110 fs/dlm/dlm_internal.h struct rb_root toss; rb_root 445 fs/dlm/lock.c int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len, rb_root 470 fs/dlm/lock.c static int rsb_insert(struct dlm_rsb *rsb, struct rb_root *tree) rb_root 33 fs/dlm/lock.h int dlm_search_rsb_tree(struct rb_root *tree, char *name, int len, rb_root 1056 fs/eventpoll.c for (rbp = ep->rbr.rb_root.rb_node; rbp; ) { rb_root 1341 fs/eventpoll.c struct rb_node **p = &ep->rbr.rb_root.rb_node, *parent = NULL; rb_root 201 fs/ext2/balloc.c static void __rsv_window_dump(struct rb_root *root, int verbose, rb_root 293 fs/ext2/balloc.c search_reserve_window(struct rb_root *root, ext2_fsblk_t goal) rb_root 334 fs/ext2/balloc.c struct rb_root *root = &EXT2_SB(sb)->s_rsv_window_root; rb_root 905 fs/ext2/balloc.c struct rb_root *fs_rsv_root = &EXT2_SB(sb)->s_rsv_window_root; rb_root 106 fs/ext2/ext2.h struct rb_root s_rsv_window_root; rb_root 403 fs/ext4/dir.c static void free_rb_tree_fname(struct rb_root *root) rb_root 192 fs/ext4/ext4.h struct rb_root root; rb_root 2174 fs/ext4/ext4.h struct rb_root root; rb_root 3018 fs/ext4/ext4.h struct rb_root bb_free_root; rb_root 210 fs/ext4/extents_status.c static struct extent_status *__es_tree_search(struct rb_root *root, rb_root 1116 fs/ext4/extents_status.c static struct pending_reservation *__pr_tree_search(struct rb_root *root, rb_root 67 fs/ext4/extents_status.h struct rb_root root; rb_root 123 fs/ext4/extents_status.h struct rb_root root; rb_root 4624 fs/ext4/mballoc.c struct rb_root *entry_rb_root) rb_root 33 fs/f2fs/extent_cache.c struct rb_node *node = root->rb_root.rb_node; rb_root 66 fs/f2fs/extent_cache.c struct rb_node **p = &root->rb_root.rb_node; rb_root 104 fs/f2fs/extent_cache.c struct rb_node **pnode = &root->rb_root.rb_node; rb_root 113 fs/f2fs/extent_cache.c if (RB_EMPTY_ROOT(&root->rb_root)) rb_root 287 fs/f2fs/extent_cache.c struct rb_node **p = &et->root.rb_root.rb_node; rb_root 16 fs/fscache/object-list.c static struct rb_root fscache_object_list; rb_root 540 fs/fuse/fuse_i.h struct rb_root polled_files; rb_root 121 fs/gfs2/incore.h struct rb_root rd_rstree; /* multi-block reservation tree */ rb_root 757 fs/gfs2/incore.h struct rb_root sd_rindex_tree; rb_root 525 fs/hugetlbfs/inode.c if (!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root)) rb_root 558 fs/hugetlbfs/inode.c if (!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root)) rb_root 33 fs/jffs2/jffs2_fs_i.h struct rb_root fragtree; rb_root 59 fs/jffs2/nodelist.c uint32_t jffs2_truncate_fragtree(struct jffs2_sb_info *c, struct rb_root *list, uint32_t size) rb_root 169 fs/jffs2/nodelist.c static int no_overlapping_node(struct jffs2_sb_info *c, struct rb_root *root, rb_root 215 fs/jffs2/nodelist.c static int jffs2_add_frag_to_fragtree(struct jffs2_sb_info *c, struct rb_root *root, struct jffs2_node_frag *newfrag) rb_root 524 fs/jffs2/nodelist.c struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset) rb_root 565 fs/jffs2/nodelist.c void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c) rb_root 242 fs/jffs2/nodelist.h struct rb_root tn_root; rb_root 327 fs/jffs2/nodelist.h static inline struct jffs2_node_frag *frag_first(struct rb_root *root) rb_root 337 fs/jffs2/nodelist.h static inline struct jffs2_node_frag *frag_last(struct rb_root *root) rb_root 371 fs/jffs2/nodelist.h struct jffs2_node_frag *jffs2_lookup_node_frag(struct rb_root *fragtree, uint32_t offset); rb_root 372 fs/jffs2/nodelist.h void jffs2_kill_fragtree(struct rb_root *root, struct jffs2_sb_info *c_delete); rb_root 374 fs/jffs2/nodelist.h uint32_t jffs2_truncate_fragtree (struct jffs2_sb_info *c, struct rb_root *list, uint32_t size); rb_root 175 fs/jffs2/readinode.c static struct jffs2_tmp_dnode_info *jffs2_lookup_tn(struct rb_root *tn_root, uint32_t offset) rb_root 402 fs/jffs2/readinode.c static void eat_last(struct rb_root *root, struct rb_node *node) rb_root 424 fs/jffs2/readinode.c static void ver_insert(struct rb_root *ver_root, struct jffs2_tmp_dnode_info *tn) rb_root 456 fs/jffs2/readinode.c struct rb_root ver_root = RB_ROOT; rb_root 544 fs/jffs2/readinode.c static void jffs2_free_tmp_dnode_info_list(struct rb_root *list) rb_root 139 fs/nfs/blocklayout/blocklayout.h struct rb_root bl_ext_rw; rb_root 140 fs/nfs/blocklayout/blocklayout.h struct rb_root bl_ext_ro; rb_root 19 fs/nfs/blocklayout/extent_tree.c ext_tree_first(struct rb_root *root) rb_root 46 fs/nfs/blocklayout/extent_tree.c __ext_tree_search(struct rb_root *root, sector_t start) rb_root 95 fs/nfs/blocklayout/extent_tree.c ext_try_to_merge_left(struct rb_root *root, struct pnfs_block_extent *be) rb_root 111 fs/nfs/blocklayout/extent_tree.c ext_try_to_merge_right(struct rb_root *root, struct pnfs_block_extent *be) rb_root 136 fs/nfs/blocklayout/extent_tree.c __ext_tree_insert(struct rb_root *root, rb_root 177 fs/nfs/blocklayout/extent_tree.c __ext_tree_remove(struct rb_root *root, rb_root 258 fs/nfs/blocklayout/extent_tree.c struct rb_root *root; rb_root 322 fs/nfs/blocklayout/extent_tree.c __ext_tree_lookup(struct rb_root *root, sector_t isect, rb_root 380 fs/nfs/blocklayout/extent_tree.c ext_tree_split(struct rb_root *root, struct pnfs_block_extent *be, rb_root 408 fs/nfs/blocklayout/extent_tree.c struct rb_root *root = &bl->bl_ext_rw; rb_root 618 fs/nfs/blocklayout/extent_tree.c struct rb_root *root = &bl->bl_ext_rw; rb_root 2267 fs/nfs/dir.c struct rb_root *root_node = &nfsi->access_cache; rb_root 2394 fs/nfs/dir.c struct rb_root *root_node = &nfsi->access_cache; rb_root 25 fs/nfs/fscache.c static struct rb_root nfs_fscache_keys = RB_ROOT; rb_root 63 fs/nfsd/netns.h struct rb_root conf_name_tree; rb_root 65 fs/nfsd/netns.h struct rb_root unconf_name_tree; rb_root 2634 fs/nfsd/nfs4state.c add_clp_to_name_tree(struct nfs4_client *new_clp, struct rb_root *root) rb_root 2654 fs/nfsd/nfs4state.c find_clp_in_name_tree(struct xdr_netobj *name, struct rb_root *root) rb_root 34 fs/nfsd/nfscache.c struct rb_root rb_head; rb_root 153 fs/nilfs2/the_nilfs.h struct rb_root ns_cptree; rb_root 48 fs/ocfs2/cluster/nodemanager.h struct rb_root cl_node_ip_tree; rb_root 93 fs/ocfs2/cluster/tcp.c static struct rb_root o2net_handler_tree = RB_ROOT; rb_root 77 fs/ocfs2/ocfs2.h struct rb_root ci_tree; rb_root 453 fs/ocfs2/ocfs2.h struct rb_root osb_rf_lock_tree; rb_root 532 fs/ocfs2/refcounttree.c struct rb_root *root = &osb->osb_rf_lock_tree; rb_root 309 fs/ocfs2/reservations.c struct rb_root *root = &resmap->m_reservations; rb_root 466 fs/ocfs2/reservations.c struct rb_root *root = &resmap->m_reservations; rb_root 41 fs/ocfs2/reservations.h struct rb_root m_reservations; rb_root 131 fs/ocfs2/uptodate.c static unsigned int ocfs2_purge_copied_metadata_tree(struct rb_root *root) rb_root 160 fs/ocfs2/uptodate.c struct rb_root root = RB_ROOT; rb_root 35 fs/overlayfs/readdir.c struct rb_root root; rb_root 42 fs/overlayfs/readdir.c struct rb_root *root; rb_root 92 fs/overlayfs/readdir.c static struct ovl_cache_entry *ovl_cache_entry_find(struct rb_root *root, rb_root 356 fs/overlayfs/readdir.c struct rb_root *root) rb_root 552 fs/overlayfs/readdir.c struct rb_root *root) rb_root 922 fs/overlayfs/readdir.c struct rb_root root = RB_ROOT; rb_root 1027 fs/overlayfs/readdir.c struct rb_root root = RB_ROOT; rb_root 1092 fs/overlayfs/readdir.c struct rb_root root = RB_ROOT; rb_root 93 fs/proc/generic.c struct rb_root *root = &dir->subdir; rb_root 57 fs/proc/internal.h struct rb_root subdir; rb_root 708 fs/ubifs/debug.c for (rb = rb_first((struct rb_root *)&c->buds); rb; rb = rb_next(rb)) { rb_root 1778 fs/ubifs/debug.c struct rb_root inodes; rb_root 561 fs/ubifs/log.c static int done_already(struct rb_root *done_tree, int lnum) rb_root 593 fs/ubifs/log.c static void destroy_done_tree(struct rb_root *done_tree) rb_root 646 fs/ubifs/log.c struct rb_root done_tree = RB_ROOT; rb_root 842 fs/ubifs/orphan.c struct rb_root root; rb_root 856 fs/ubifs/orphan.c static int dbg_ins_check_orphan(struct rb_root *root, ino_t inum) rb_root 884 fs/ubifs/orphan.c static int dbg_find_check_orphan(struct rb_root *root, ino_t inum) rb_root 902 fs/ubifs/orphan.c static void dbg_free_check_tree(struct rb_root *root) rb_root 1272 fs/ubifs/ubifs.h struct rb_root buds; rb_root 1312 fs/ubifs/ubifs.h struct rb_root old_idx; rb_root 1385 fs/ubifs/ubifs.h struct rb_root orph_tree; rb_root 1490 fs/ubifs/ubifs.h struct rb_root size_tree; rb_root 379 fs/xfs/xfs_mount.h struct rb_root pagb_tree; /* ordered tree of busy extents */ rb_root 209 include/drm/drm_mm.h struct rb_root holes_addr; rb_root 48 include/drm/drm_prime.h struct rb_root dmabufs; rb_root 49 include/drm/drm_prime.h struct rb_root handles; rb_root 55 include/drm/drm_vma_manager.h struct rb_root vm_files; rb_root 214 include/linux/backing-dev-defs.h struct rb_root cgwb_congested_tree; /* their congested states */ rb_root 191 include/linux/ceph/libceph.h static void insert_##name(struct rb_root *root, type *t) \ rb_root 215 include/linux/ceph/libceph.h static void erase_##name(struct rb_root *root, type *t) \ rb_root 228 include/linux/ceph/libceph.h static type *lookup_##name(struct rb_root *root, lookup_param_type key) \ rb_root 91 include/linux/ceph/mon_client.h struct rb_root generic_request_tree; rb_root 39 include/linux/ceph/osd_client.h struct rb_root o_requests; rb_root 40 include/linux/ceph/osd_client.h struct rb_root o_linger_requests; rb_root 41 include/linux/ceph/osd_client.h struct rb_root o_backoff_mappings; rb_root 42 include/linux/ceph/osd_client.h struct rb_root o_backoffs_by_id; rb_root 299 include/linux/ceph/osd_client.h struct rb_root backoffs; rb_root 345 include/linux/ceph/osd_client.h struct rb_root osds; /* osds */ rb_root 352 include/linux/ceph/osd_client.h struct rb_root linger_requests; /* lingering requests */ rb_root 353 include/linux/ceph/osd_client.h struct rb_root map_checks; rb_root 354 include/linux/ceph/osd_client.h struct rb_root linger_map_checks; rb_root 171 include/linux/ceph/osdmap.h struct rb_root pg_temp; rb_root 172 include/linux/ceph/osdmap.h struct rb_root primary_temp; rb_root 175 include/linux/ceph/osdmap.h struct rb_root pg_upmap; /* PG := raw set */ rb_root 176 include/linux/ceph/osdmap.h struct rb_root pg_upmap_items; /* from -> to within raw set */ rb_root 180 include/linux/ceph/osdmap.h struct rb_root pg_pools; rb_root 305 include/linux/crush/crush.h struct rb_root choose_args; rb_root 149 include/linux/elevator.h extern void elv_rb_add(struct rb_root *, struct request *); rb_root 150 include/linux/elevator.h extern void elv_rb_del(struct rb_root *, struct request *); rb_root 151 include/linux/elevator.h extern struct request *elv_rb_find(struct rb_root *, sector_t); rb_root 549 include/linux/fs.h return !RB_EMPTY_ROOT(&mapping->i_mmap.rb_root); rb_root 41 include/linux/interval_tree_generic.h struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ rb_root 124 include/linux/interval_tree_generic.h if (!root->rb_root.rb_node) \ rb_root 140 include/linux/interval_tree_generic.h node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \ rb_root 70 include/linux/iova.h struct rb_root rbroot; /* iova domain rbtree root */ rb_root 87 include/linux/kernfs.h struct rb_root children; rb_root 126 include/linux/mempolicy.h struct rb_root root; rb_root 542 include/linux/mlx5/driver.h struct rb_root page_root; rb_root 237 include/linux/mm.h extern struct rb_root nommu_region_tree; rb_root 373 include/linux/mm_types.h struct rb_root mm_rb; rb_root 150 include/linux/nfs_fs.h struct rb_root access_cache; rb_root 216 include/linux/nfs_fs_sb.h struct rb_root state_owners; rb_root 730 include/linux/perf_event.h struct rb_root tree; rb_root 184 include/linux/pktcdvd.h struct rb_root bio_queue; /* Work queue of bios we need to handle */ rb_root 37 include/linux/rbtree.h #define RB_ROOT (struct rb_root) { NULL, } rb_root 49 include/linux/rbtree.h extern void rb_insert_color(struct rb_node *, struct rb_root *); rb_root 50 include/linux/rbtree.h extern void rb_erase(struct rb_node *, struct rb_root *); rb_root 56 include/linux/rbtree.h extern struct rb_node *rb_first(const struct rb_root *); rb_root 57 include/linux/rbtree.h extern struct rb_node *rb_last(const struct rb_root *); rb_root 60 include/linux/rbtree.h extern struct rb_node *rb_first_postorder(const struct rb_root *); rb_root 65 include/linux/rbtree.h struct rb_root *root); rb_root 67 include/linux/rbtree.h struct rb_root *root); rb_root 126 include/linux/rbtree.h struct rb_root rb_root; rb_root 141 include/linux/rbtree.h rb_insert_color(node, &root->rb_root); rb_root 149 include/linux/rbtree.h rb_erase(node, &root->rb_root); rb_root 158 include/linux/rbtree.h rb_replace_node(victim, new, &root->rb_root); rb_root 33 include/linux/rbtree_augmented.h extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_root 47 include/linux/rbtree_augmented.h rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_root 60 include/linux/rbtree_augmented.h rb_insert_augmented(node, &root->rb_root, augment); rb_root 170 include/linux/rbtree_augmented.h struct rb_node *parent, struct rb_root *root) rb_root 183 include/linux/rbtree_augmented.h struct rb_node *parent, struct rb_root *root) rb_root 194 include/linux/rbtree_augmented.h extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_root 198 include/linux/rbtree_augmented.h __rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_root 302 include/linux/rbtree_augmented.h rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_root 316 include/linux/rbtree_augmented.h rb_erase_augmented(node, &root->rb_root, augment); rb_root 46 include/linux/rbtree_latch.h struct rb_root tree[2]; rb_root 79 include/linux/rbtree_latch.h struct rb_root *root = <r->tree[idx]; rb_root 61 include/linux/rmap.h struct rb_root_cached rb_root; rb_root 2760 include/linux/skbuff.h unsigned int skb_rbtree_purge(struct rb_root *root); rb_root 264 include/linux/sunrpc/xprt.h struct rb_root recv_queue; /* Receive queue */ rb_root 251 include/linux/swap.h struct rb_root swap_extent_root;/* root of the swap extent rbtree */ rb_root 166 include/linux/sysctl.h struct rb_root root; rb_root 310 include/linux/tcp.h struct rb_root out_of_order_queue; rb_root 15 include/linux/timerqueue.h struct rb_root_cached rb_root; rb_root 36 include/linux/timerqueue.h struct rb_node *leftmost = rb_first_cached(&head->rb_root); rb_root 58 include/linux/timerqueue.h head->rb_root = RB_ROOT_CACHED; rb_root 107 include/net/garp.h struct rb_root gid; rb_root 86 include/net/inet_frag.h struct rb_root rb_fragments; rb_root 129 include/net/inet_frag.h unsigned int inet_frag_rbtree_purge(struct rb_root *root); rb_root 62 include/net/inetpeer.h struct rb_root rb_root; rb_root 121 include/net/mrp.h struct rb_root mad; rb_root 12 include/net/netns/nexthop.h struct rb_root rb_root; /* tree of nexthops by id */ rb_root 413 include/net/sock.h struct rb_root tcp_rtx_queue; rb_root 1814 include/net/tcp.h void tcp_rbtree_insert(struct rb_root *root, struct sk_buff *skb); rb_root 79 include/rdma/rdma_vt.h struct rb_root mcast_tree; rb_root 44 include/xen/arm/page.h extern struct rb_root phys_to_mach; rb_root 78 ipc/mqueue.c struct rb_root msg_tree; rb_root 24 kernel/bpf/local_storage.c struct rb_root root; rb_root 52 kernel/bpf/local_storage.c struct rb_root *root = &map->root; rb_root 87 kernel/bpf/local_storage.c struct rb_root *root = &map->root; rb_root 585 kernel/bpf/local_storage.c struct rb_root *root; rb_root 36 kernel/events/uprobes.c static struct rb_root uprobes_tree = RB_ROOT; rb_root 62 kernel/locking/rtmutex-debug.c DEBUG_LOCKS_WARN_ON(!RB_EMPTY_ROOT(&task->pi_waiters.rb_root)); rb_root 275 kernel/locking/rtmutex.c struct rb_node **link = &lock->waiters.rb_root.rb_node; rb_root 308 kernel/locking/rtmutex.c struct rb_node **link = &task->pi_waiters.rb_root.rb_node; rb_root 49 kernel/locking/rtmutex_common.h return !RB_EMPTY_ROOT(&lock->waiters.rb_root); rb_root 67 kernel/locking/rtmutex_common.h return !RB_EMPTY_ROOT(&p->pi_waiters.rb_root); rb_root 128 kernel/power/swap.c static struct rb_root swsusp_extents = RB_ROOT; rb_root 36 kernel/power/wakelock.c static struct rb_root wakelocks_tree = RB_ROOT; rb_root 448 kernel/sched/deadline.c struct rb_node **link = &dl_rq->pushable_dl_tasks_root.rb_root.rb_node; rb_root 498 kernel/sched/deadline.c return !RB_EMPTY_ROOT(&rq->dl.pushable_dl_tasks_root.rb_root); rb_root 1405 kernel/sched/deadline.c struct rb_node **link = &dl_rq->root.rb_root.rb_node; rb_root 567 kernel/sched/fair.c struct rb_node **link = &cfs_rq->tasks_timeline.rb_root.rb_node; rb_root 623 kernel/sched/fair.c struct rb_node *last = rb_last(&cfs_rq->tasks_timeline.rb_root); rb_root 35 kernel/trace/trace_stat.c struct rb_root stat_root; rb_root 77 kernel/trace/trace_stat.c static int insert_stat(struct rb_root *root, void *stat, cmp_stat_t cmp) rb_root 128 kernel/trace/trace_stat.c struct rb_root *root = &session->stat_root; rb_root 76 lib/rbtree.c struct rb_root *root, int color) rb_root 85 lib/rbtree.c __rb_insert(struct rb_node *node, struct rb_root *root, rb_root 227 lib/rbtree.c ____rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_root 410 lib/rbtree.c void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_root 434 lib/rbtree.c void rb_insert_color(struct rb_node *node, struct rb_root *root) rb_root 440 lib/rbtree.c void rb_erase(struct rb_node *node, struct rb_root *root) rb_root 456 lib/rbtree.c void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_root 466 lib/rbtree.c struct rb_node *rb_first(const struct rb_root *root) rb_root 479 lib/rbtree.c struct rb_node *rb_last(const struct rb_root *root) rb_root 554 lib/rbtree.c struct rb_root *root) rb_root 571 lib/rbtree.c struct rb_root *root) rb_root 623 lib/rbtree.c struct rb_node *rb_first_postorder(const struct rb_root *root) rb_root 34 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; rb_root 46 lib/rbtree_test.c rb_insert_color(&node->rb, &root->rb_root); rb_root 51 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; rb_root 71 lib/rbtree_test.c rb_erase(&node->rb, &root->rb_root); rb_root 88 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; rb_root 106 lib/rbtree_test.c rb_insert_augmented(&node->rb, &root->rb_root, &augment_callbacks); rb_root 112 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; rb_root 140 lib/rbtree_test.c rb_erase_augmented(&node->rb, &root->rb_root, &augment_callbacks); rb_root 175 lib/rbtree_test.c rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) rb_root 185 lib/rbtree_test.c for (rb = rb_first_postorder(&root.rb_root); rb; rb = rb_next_postorder(rb)) rb_root 197 lib/rbtree_test.c for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { rb_root 212 lib/rbtree_test.c WARN_ON_ONCE(count < (1 << black_path_count(rb_last(&root.rb_root))) - 1); rb_root 223 lib/rbtree_test.c for (rb = rb_first(&root.rb_root); rb; rb = rb_next(rb)) { rb_root 295 lib/rbtree_test.c for (node = rb_first(&root.rb_root); node; node = rb_next(node)) rb_root 309 lib/rbtree_test.c node = rb_first(&root.rb_root); rb_root 29 lib/timerqueue.c struct rb_node **p = &head->rb_root.rb_root.rb_node; rb_root 48 lib/timerqueue.c rb_insert_color_cached(&node->node, &head->rb_root, leftmost); rb_root 67 lib/timerqueue.c rb_erase_cached(&node->node, &head->rb_root); rb_root 70 lib/timerqueue.c return !RB_EMPTY_ROOT(&head->rb_root.rb_root); rb_root 32 mm/backing-dev.c static struct rb_root bdi_tree = RB_ROOT; rb_root 57 mm/interval_tree.c rb_insert_augmented(&node->shared.rb, &root->rb_root, rb_root 193 mm/kmemleak.c static struct rb_root object_tree_root = RB_ROOT; rb_root 222 mm/ksm.c static struct rb_root one_stable_tree[1] = { RB_ROOT }; rb_root 223 mm/ksm.c static struct rb_root one_unstable_tree[1] = { RB_ROOT }; rb_root 224 mm/ksm.c static struct rb_root *root_stable_tree = one_stable_tree; rb_root 225 mm/ksm.c static struct rb_root *root_unstable_tree = one_unstable_tree; rb_root 591 mm/ksm.c struct rb_root *root) rb_root 624 mm/ksm.c struct rb_root *root) rb_root 914 mm/ksm.c struct rb_root *root) rb_root 1356 mm/ksm.c struct rb_root *root, rb_root 1474 mm/ksm.c struct rb_root *root) rb_root 1502 mm/ksm.c struct rb_root *root, rb_root 1524 mm/ksm.c struct rb_root *root) rb_root 1531 mm/ksm.c struct rb_root *root) rb_root 1554 mm/ksm.c struct rb_root *root; rb_root 1807 mm/ksm.c struct rb_root *root; rb_root 1928 mm/ksm.c struct rb_root *root; rb_root 2623 mm/ksm.c anon_vma_interval_tree_foreach(vmac, &anon_vma->rb_root, rb_root 2742 mm/ksm.c struct rb_root *root) rb_root 2974 mm/ksm.c struct rb_root *buf; rb_root 119 mm/memcontrol.c struct rb_root rb_root; rb_root 527 mm/memcontrol.c struct rb_node **p = &mctz->rb_root.rb_node; rb_root 559 mm/memcontrol.c rb_insert_color(&mz->tree_node, &mctz->rb_root); rb_root 572 mm/memcontrol.c rb_erase(&mz->tree_node, &mctz->rb_root); rb_root 3246 mm/memcontrol.c if (!mctz || RB_EMPTY_ROOT(&mctz->rb_root)) rb_root 6996 mm/memcontrol.c rtpn->rb_root = RB_ROOT; rb_root 458 mm/memory-failure.c anon_vma_interval_tree_foreach(vmac, &av->rb_root, rb_root 2703 mm/memory.c if (unlikely(!RB_EMPTY_ROOT(&mapping->i_mmap.rb_root))) rb_root 328 mm/mmap.c struct rb_root *root = &mm->mm_rb; rb_root 374 mm/mmap.c static void validate_mm_rb(struct rb_root *root, struct vm_area_struct *ignore) rb_root 450 mm/mmap.c struct rb_root *root) rb_root 458 mm/mmap.c static void __vma_rb_erase(struct vm_area_struct *vma, struct rb_root *root) rb_root 469 mm/mmap.c struct rb_root *root, rb_root 483 mm/mmap.c struct rb_root *root) rb_root 514 mm/mmap.c anon_vma_interval_tree_remove(avc, &avc->anon_vma->rb_root); rb_root 523 mm/mmap.c anon_vma_interval_tree_insert(avc, &avc->anon_vma->rb_root); rb_root 3471 mm/mmap.c if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) { rb_root 3487 mm/mmap.c &anon_vma->root->rb_root.rb_root.rb_node)) rb_root 3589 mm/mmap.c if (test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) { rb_root 3603 mm/mmap.c &anon_vma->root->rb_root.rb_root.rb_node)) rb_root 61 mm/nommu.c struct rb_root nommu_region_tree = RB_ROOT; rb_root 145 mm/rmap.c anon_vma_interval_tree_insert(avc, &anon_vma->rb_root); rb_root 390 mm/rmap.c anon_vma_interval_tree_remove(avc, &anon_vma->rb_root); rb_root 396 mm/rmap.c if (RB_EMPTY_ROOT(&anon_vma->rb_root.rb_root)) { rb_root 430 mm/rmap.c anon_vma->rb_root = RB_ROOT_CACHED; rb_root 1831 mm/rmap.c anon_vma_interval_tree_foreach(avc, &anon_vma->rb_root, rb_root 338 mm/vmalloc.c static struct rb_root vmap_area_root = RB_ROOT; rb_root 365 mm/vmalloc.c static struct rb_root free_vmap_area_root = RB_ROOT; rb_root 439 mm/vmalloc.c struct rb_root *root, struct rb_node *from, rb_root 501 mm/vmalloc.c link_va(struct vmap_area *va, struct rb_root *root, rb_root 540 mm/vmalloc.c unlink_va(struct vmap_area *va, struct rb_root *root) rb_root 654 mm/vmalloc.c struct rb_root *root, struct list_head *head) rb_root 665 mm/vmalloc.c struct rb_node *from, struct rb_root *root, rb_root 688 mm/vmalloc.c struct rb_root *root, struct list_head *head) rb_root 173 mm/zswap.c struct rb_root rbroot; rb_root 267 mm/zswap.c static struct zswap_entry *zswap_rb_search(struct rb_root *root, pgoff_t offset) rb_root 288 mm/zswap.c static int zswap_rb_insert(struct rb_root *root, struct zswap_entry *entry, rb_root 311 mm/zswap.c static void zswap_rb_erase(struct rb_root *root, struct zswap_entry *entry) rb_root 358 mm/zswap.c static struct zswap_entry *zswap_entry_find_get(struct rb_root *root, rb_root 15 net/6lowpan/nhc.c static struct rb_root rb_root = RB_ROOT; rb_root 21 net/6lowpan/nhc.c struct rb_node **new = &rb_root.rb_node, *parent = NULL; rb_root 51 net/6lowpan/nhc.c rb_insert_color(&nhc->node, &rb_root); rb_root 58 net/6lowpan/nhc.c rb_erase(&nhc->node, &rb_root); rb_root 63 net/6lowpan/nhc.c struct rb_node *node = rb_root.rb_node; rb_root 47 net/ceph/auth_x.h struct rb_root ticket_handlers; rb_root 1838 net/ceph/osd_client.c static struct ceph_osd_backoff *lookup_containing_backoff(struct rb_root *root, rb_root 3754 net/ceph/osd_client.c struct rb_root *need_resend, rb_root 3831 net/ceph/osd_client.c struct rb_root *need_resend, rb_root 3899 net/ceph/osd_client.c struct rb_root *need_resend, rb_root 3962 net/ceph/osd_client.c struct rb_root need_resend = RB_ROOT; rb_root 639 net/ceph/osdmap.c static int __insert_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *new) rb_root 661 net/ceph/osdmap.c static struct ceph_pg_pool_info *__lookup_pg_pool(struct rb_root *root, u64 id) rb_root 722 net/ceph/osdmap.c static void __remove_pg_pool(struct rb_root *root, struct ceph_pg_pool_info *pi) rb_root 1195 net/ceph/osdmap.c static int decode_pg_mapping(void **p, void *end, struct rb_root *mapping_root, rb_root 9 net/ceph/string_table.c static struct rb_root string_tree = RB_ROOT; rb_root 3092 net/core/skbuff.c unsigned int skb_rbtree_purge(struct rb_root *root) rb_root 232 net/ipv4/inet_fragment.c unsigned int inet_frag_rbtree_purge(struct rb_root *root) rb_root 59 net/ipv4/inetpeer.c bp->rb_root = RB_ROOT; rb_root 109 net/ipv4/inetpeer.c pp = &base->rb_root.rb_node; rb_root 175 net/ipv4/inetpeer.c rb_erase(&p->rb_node, &base->rb_root); rb_root 231 net/ipv4/inetpeer.c rb_insert_color(&p->rb_node, &base->rb_root); rb_root 298 net/ipv4/inetpeer.c struct rb_node *p = rb_first(&base->rb_root); rb_root 304 net/ipv4/inetpeer.c rb_erase(&peer->rb_node, &base->rb_root); rb_root 147 net/ipv4/nexthop.c pp = &net->nexthop.rb_root.rb_node; rb_root 828 net/ipv4/nexthop.c rb_erase(&nh->rb_node, &net->nexthop.rb_root); rb_root 1011 net/ipv4/nexthop.c struct rb_root *root = &net->nexthop.rb_root; rb_root 1087 net/ipv4/nexthop.c struct rb_root *root = &net->nexthop.rb_root; rb_root 1719 net/ipv4/nexthop.c struct rb_root *root = &net->nexthop.rb_root; rb_root 1823 net/ipv4/nexthop.c net->nexthop.rb_root = RB_ROOT; rb_root 4870 net/ipv4/tcp_input.c struct rb_root *root) rb_root 4886 net/ipv4/tcp_input.c void tcp_rbtree_insert(struct rb_root *root, struct sk_buff *skb) rb_root 4913 net/ipv4/tcp_input.c tcp_collapse(struct sock *sk, struct sk_buff_head *list, struct rb_root *root, rb_root 60 net/netfilter/nf_conncount.c struct rb_root root[CONNCOUNT_SLOTS]; rb_root 276 net/netfilter/nf_conncount.c static void tree_nodes_free(struct rb_root *root, rb_root 302 net/netfilter/nf_conncount.c struct rb_root *root, rb_root 391 net/netfilter/nf_conncount.c struct rb_root *root; rb_root 448 net/netfilter/nf_conncount.c struct rb_root *root; rb_root 559 net/netfilter/nf_conncount.c static void destroy_tree(struct rb_root *r) rb_root 19 net/netfilter/nft_set_rbtree.c struct rb_root root; rb_root 102 net/rds/cong.c static struct rb_root rds_cong_tree = RB_ROOT; rb_root 65 net/rds/rdma.c static struct rds_mr *rds_mr_tree_walk(struct rb_root *root, u64 key, rb_root 652 net/rds/rds.h struct rb_root rs_rdma_keys; rb_root 144 net/rxrpc/ar-internal.h struct rb_root calls; /* User ID -> call mapping */ rb_root 278 net/rxrpc/ar-internal.h struct rb_root client_conns; /* Client connections by socket params */ rb_root 299 net/rxrpc/ar-internal.h struct rb_root service_conns; /* Service connections */ rb_root 166 net/sched/sch_etf.c struct rb_node **p = &q->head.rb_root.rb_node, *parent = NULL; rb_root 69 net/sched/sch_fq.c struct rb_root t_root; rb_root 96 net/sched/sch_fq.c struct rb_root delayed; /* for rate limited flows */ rb_root 109 net/sched/sch_fq.c struct rb_root *fq_root; rb_root 202 net/sched/sch_fq.c struct rb_root *root, rb_root 245 net/sched/sch_fq.c struct rb_root *root; rb_root 621 net/sched/sch_fq.c struct rb_root *root; rb_root 654 net/sched/sch_fq.c struct rb_root *old_array, u32 old_log, rb_root 655 net/sched/sch_fq.c struct rb_root *new_array, u32 new_log) rb_root 658 net/sched/sch_fq.c struct rb_root *oroot, *nroot; rb_root 706 net/sched/sch_fq.c struct rb_root *array; rb_root 714 net/sched/sch_fq.c array = kvmalloc_node(sizeof(struct rb_root) << log, GFP_KERNEL | __GFP_RETRY_MAYFAIL, rb_root 129 net/sched/sch_hfsc.c struct rb_root vt_tree; /* active children sorted by cl_vt */ rb_root 131 net/sched/sch_hfsc.c struct rb_root cf_tree; /* active children sorted by cl_f */ rb_root 173 net/sched/sch_hfsc.c struct rb_root eligible; /* eligible tree */ rb_root 78 net/sched/sch_htb.c struct rb_root row; rb_root 79 net/sched/sch_htb.c struct rb_root feed; rb_root 144 net/sched/sch_htb.c struct rb_root wait_pq; rb_root 274 net/sched/sch_htb.c static void htb_add_to_id_tree(struct rb_root *root, rb_root 355 net/sched/sch_htb.c static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) rb_root 708 net/sched/sch_htb.c struct rb_root *wait_pq = &q->hlevel[level].wait_pq; rb_root 74 net/sched/sch_netem.c struct rb_root t_root; rb_root 193 net/smc/smc_core.h struct rb_root conns_all; /* connection tree */ rb_root 80 net/tipc/group.c struct rb_root members; rb_root 198 net/tipc/group.c struct rb_root *tree = &grp->members; rb_root 213 net/tipc/group.c struct rb_root *tree = &grp->members; rb_root 77 net/tipc/name_table.c struct rb_root ranges; rb_root 75 net/wireless/core.h struct rb_root bss_tree; rb_root 66 net/xfrm/xfrm_policy.c struct rb_root root; rb_root 124 net/xfrm/xfrm_policy.c struct rb_root root_d; rb_root 127 net/xfrm/xfrm_policy.c struct rb_root root_s; rb_root 890 net/xfrm/xfrm_policy.c struct rb_root *new, rb_root 976 net/xfrm/xfrm_policy.c struct rb_root *root, rb_root 1051 net/xfrm/xfrm_policy.c static void xfrm_policy_inexact_gc_tree(struct rb_root *r, bool rm) rb_root 1905 net/xfrm/xfrm_policy.c xfrm_policy_lookup_inexact_addr(const struct rb_root *r, rb_root 74 security/apparmor/include/label.h struct rb_root root; rb_root 24 security/integrity/iint.c static struct rb_root integrity_iint_tree = RB_ROOT; rb_root 65 security/keys/internal.h extern struct rb_root key_user_tree; rb_root 85 security/keys/internal.h extern struct rb_root key_serial_tree; rb_root 20 security/keys/key.c struct rb_root key_serial_tree; /* tree of keys indexed by serial */ rb_root 23 security/keys/key.c struct rb_root key_user_tree; /* tree of quota records indexed by UID */ rb_root 268 security/keys/proc.c static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r) rb_root 36 tools/include/linux/rbtree.h #define RB_ROOT (struct rb_root) { NULL, } rb_root 48 tools/include/linux/rbtree.h extern void rb_insert_color(struct rb_node *, struct rb_root *); rb_root 49 tools/include/linux/rbtree.h extern void rb_erase(struct rb_node *, struct rb_root *); rb_root 55 tools/include/linux/rbtree.h extern struct rb_node *rb_first(const struct rb_root *); rb_root 56 tools/include/linux/rbtree.h extern struct rb_node *rb_last(const struct rb_root *); rb_root 59 tools/include/linux/rbtree.h extern struct rb_node *rb_first_postorder(const struct rb_root *); rb_root 64 tools/include/linux/rbtree.h struct rb_root *root); rb_root 103 tools/include/linux/rbtree.h static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) rb_root 120 tools/include/linux/rbtree.h struct rb_root rb_root; rb_root 135 tools/include/linux/rbtree.h rb_insert_color(node, &root->rb_root); rb_root 143 tools/include/linux/rbtree.h rb_erase(node, &root->rb_root); rb_root 152 tools/include/linux/rbtree.h rb_replace_node(victim, new, &root->rb_root); rb_root 35 tools/include/linux/rbtree_augmented.h extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_root 49 tools/include/linux/rbtree_augmented.h rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_root 62 tools/include/linux/rbtree_augmented.h rb_insert_augmented(node, &root->rb_root, augment); rb_root 172 tools/include/linux/rbtree_augmented.h struct rb_node *parent, struct rb_root *root) rb_root 183 tools/include/linux/rbtree_augmented.h extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_root 187 tools/include/linux/rbtree_augmented.h __rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_root 291 tools/include/linux/rbtree_augmented.h rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_root 305 tools/include/linux/rbtree_augmented.h rb_erase_augmented(node, &root->rb_root, augment); rb_root 39 tools/lib/lockdep/preload.c static struct rb_root locks = RB_ROOT; rb_root 76 tools/lib/rbtree.c struct rb_root *root, int color) rb_root 85 tools/lib/rbtree.c __rb_insert(struct rb_node *node, struct rb_root *root, rb_root 227 tools/lib/rbtree.c ____rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_root 410 tools/lib/rbtree.c void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_root 433 tools/lib/rbtree.c void rb_insert_color(struct rb_node *node, struct rb_root *root) rb_root 438 tools/lib/rbtree.c void rb_erase(struct rb_node *node, struct rb_root *root) rb_root 453 tools/lib/rbtree.c void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_root 462 tools/lib/rbtree.c struct rb_node *rb_first(const struct rb_root *root) rb_root 474 tools/lib/rbtree.c struct rb_node *rb_last(const struct rb_root *root) rb_root 546 tools/lib/rbtree.c struct rb_root *root) rb_root 591 tools/lib/rbtree.c struct rb_node *rb_first_postorder(const struct rb_root *root) rb_root 73 tools/perf/builtin-kmem.c static struct rb_root root_alloc_stat; rb_root 74 tools/perf/builtin-kmem.c static struct rb_root root_alloc_sorted; rb_root 75 tools/perf/builtin-kmem.c static struct rb_root root_caller_stat; rb_root 76 tools/perf/builtin-kmem.c static struct rb_root root_caller_sorted; rb_root 212 tools/perf/builtin-kmem.c struct rb_root *root, rb_root 293 tools/perf/builtin-kmem.c static struct rb_root page_live_tree; rb_root 294 tools/perf/builtin-kmem.c static struct rb_root page_alloc_tree; rb_root 295 tools/perf/builtin-kmem.c static struct rb_root page_alloc_sorted; rb_root 296 tools/perf/builtin-kmem.c static struct rb_root page_caller_tree; rb_root 297 tools/perf/builtin-kmem.c static struct rb_root page_caller_sorted; rb_root 989 tools/perf/builtin-kmem.c static void __print_slab_result(struct rb_root *root, rb_root 1253 tools/perf/builtin-kmem.c static void sort_slab_insert(struct rb_root *root, struct alloc_stat *data, rb_root 1283 tools/perf/builtin-kmem.c static void __sort_slab_result(struct rb_root *root, struct rb_root *root_sorted, rb_root 1300 tools/perf/builtin-kmem.c static void sort_page_insert(struct rb_root *root, struct page_stat *data, rb_root 1330 tools/perf/builtin-kmem.c static void __sort_page_result(struct rb_root *root, struct rb_root *root_sorted, rb_root 507 tools/perf/builtin-kvm.c static void insert_to_result(struct rb_root *result, struct kvm_event *event, rb_root 560 tools/perf/builtin-kvm.c static struct kvm_event *pop_from_result(struct rb_root *result) rb_root 121 tools/perf/builtin-lock.c static struct rb_root thread_stats; rb_root 249 tools/perf/builtin-lock.c static struct rb_root result; /* place to store sorted data */ rb_root 963 tools/perf/builtin-sched.c struct rb_node *node = root->rb_root.rb_node; rb_root 989 tools/perf/builtin-sched.c struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; rb_root 2879 tools/perf/builtin-sched.c callchain_param.sort(&itr->sorted_root.rb_root, &itr->callchain, rb_root 3085 tools/perf/builtin-sched.c struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; rb_root 140 tools/perf/tests/hists_cumulate.c while (!RB_EMPTY_ROOT(&root_out->rb_root)) { rb_root 183 tools/perf/tests/hists_cumulate.c struct rb_root *root; rb_root 202 tools/perf/tests/hists_cumulate.c root = &hists->entries.rb_root; rb_root 222 tools/perf/tests/hists_cumulate.c root = &he->callchain->node.rb_root; rb_root 106 tools/perf/tests/hists_output.c while (!RB_EMPTY_ROOT(&root_out->rb_root)) { rb_root 140 tools/perf/ui/browser.c struct rb_root *root = browser->entries; rb_root 31 tools/perf/ui/browsers/annotate.c struct rb_root entries; rb_root 247 tools/perf/ui/browsers/annotate.c struct rb_root *root = &browser->entries; rb_root 178 tools/perf/ui/browsers/hists.c for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { rb_root 256 tools/perf/ui/browsers/hists.c static int callchain__count_rows(struct rb_root *chain) rb_root 327 tools/perf/ui/browsers/hists.c struct rb_node *nd = rb_first(&node->rb_root); rb_root 329 tools/perf/ui/browsers/hists.c for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { rb_root 338 tools/perf/ui/browsers/hists.c !RB_EMPTY_ROOT(&child->rb_root); rb_root 341 tools/perf/ui/browsers/hists.c !RB_EMPTY_ROOT(&child->rb_root); rb_root 358 tools/perf/ui/browsers/hists.c chain->has_children = !RB_EMPTY_ROOT(&node->rb_root); rb_root 364 tools/perf/ui/browsers/hists.c static void callchain__init_have_children(struct rb_root *root) rb_root 387 tools/perf/ui/browsers/hists.c he->has_children = !RB_EMPTY_ROOT(&he->hroot_out.rb_root); rb_root 466 tools/perf/ui/browsers/hists.c for (nd = rb_first(&node->rb_root); nd; nd = rb_next(nd)) { rb_root 502 tools/perf/ui/browsers/hists.c static int callchain__set_folding(struct rb_root *chain, bool unfold) rb_root 858 tools/perf/ui/browsers/hists.c struct rb_root *root, rb_root 962 tools/perf/ui/browsers/hists.c struct rb_root *root, rb_root 1047 tools/perf/ui/browsers/hists.c struct rb_root *root, int level, rb_root 1099 tools/perf/ui/browsers/hists.c row += hist_browser__show_callchain_graph(browser, &child->rb_root, rb_root 97 tools/perf/ui/gtk/hists.c static void perf_gtk__add_callchain_flat(struct rb_root *root, GtkTreeStore *store, rb_root 160 tools/perf/ui/gtk/hists.c static void perf_gtk__add_callchain_folded(struct rb_root *root, GtkTreeStore *store, rb_root 220 tools/perf/ui/gtk/hists.c static void perf_gtk__add_callchain_graph(struct rb_root *root, GtkTreeStore *store, rb_root 265 tools/perf/ui/gtk/hists.c perf_gtk__add_callchain_graph(&node->rb_root, store, &iter, col, rb_root 270 tools/perf/ui/gtk/hists.c static void perf_gtk__add_callchain(struct rb_root *root, GtkTreeStore *store, rb_root 108 tools/perf/ui/stdio/hist.c static size_t __callchain__fprintf_graph(FILE *fp, struct rb_root *root, rb_root 164 tools/perf/ui/stdio/hist.c ret += __callchain__fprintf_graph(fp, &child->rb_root, new_total, rb_root 216 tools/perf/ui/stdio/hist.c static size_t callchain__fprintf_graph(FILE *fp, struct rb_root *root, rb_root 265 tools/perf/ui/stdio/hist.c root = &cnode->rb_root; rb_root 304 tools/perf/ui/stdio/hist.c static size_t callchain__fprintf_flat(FILE *fp, struct rb_root *tree, rb_root 355 tools/perf/ui/stdio/hist.c static size_t callchain__fprintf_folded(FILE *fp, struct rb_root *tree, rb_root 2115 tools/perf/util/annotate.c static void insert_source_line(struct rb_root *root, struct annotation_line *al, rb_root 2164 tools/perf/util/annotate.c static void __resort_source_line(struct rb_root *root, struct annotation_line *al) rb_root 2184 tools/perf/util/annotate.c static void resort_source_line(struct rb_root *dest_root, struct rb_root *src_root) rb_root 2202 tools/perf/util/annotate.c static void print_summary(struct rb_root *root, const char *filename) rb_root 2642 tools/perf/util/annotate.c struct rb_root *root, rb_root 2646 tools/perf/util/annotate.c struct rb_root tmp_root = RB_ROOT; rb_root 2674 tools/perf/util/annotate.c struct rb_root *root, rb_root 2687 tools/perf/util/annotate.c struct rb_root source_line = RB_ROOT; rb_root 2715 tools/perf/util/annotate.c struct rb_root source_line = RB_ROOT; rb_root 8 tools/perf/util/block-range.c struct rb_root root; rb_root 35 tools/perf/util/call-path.h struct rb_root children; rb_root 372 tools/perf/util/callchain.c rb_insert_callchain(struct rb_root *root, struct callchain_node *chain, rb_root 413 tools/perf/util/callchain.c __sort_chain_flat(struct rb_root *rb_root, struct callchain_node *node, rb_root 424 tools/perf/util/callchain.c __sort_chain_flat(rb_root, child, min_hit); rb_root 428 tools/perf/util/callchain.c rb_insert_callchain(rb_root, node, CHAIN_FLAT); rb_root 436 tools/perf/util/callchain.c sort_chain_flat(struct rb_root *rb_root, struct callchain_root *root, rb_root 439 tools/perf/util/callchain.c *rb_root = RB_ROOT; rb_root 440 tools/perf/util/callchain.c __sort_chain_flat(rb_root, &root->node, min_hit); rb_root 449 tools/perf/util/callchain.c node->rb_root = RB_ROOT; rb_root 458 tools/perf/util/callchain.c rb_insert_callchain(&node->rb_root, child, rb_root 464 tools/perf/util/callchain.c sort_chain_graph_abs(struct rb_root *rb_root, struct callchain_root *chain_root, rb_root 468 tools/perf/util/callchain.c rb_root->rb_node = chain_root->node.rb_root.rb_node; rb_root 478 tools/perf/util/callchain.c node->rb_root = RB_ROOT; rb_root 488 tools/perf/util/callchain.c rb_insert_callchain(&node->rb_root, child, rb_root 494 tools/perf/util/callchain.c sort_chain_graph_rel(struct rb_root *rb_root, struct callchain_root *chain_root, rb_root 498 tools/perf/util/callchain.c rb_root->rb_node = chain_root->node.rb_root.rb_node; rb_root 65 tools/perf/util/callchain.h struct rb_root rb_root_in; /* input tree of children */ rb_root 66 tools/perf/util/callchain.h struct rb_root rb_root; /* sorted output tree of children */ rb_root 81 tools/perf/util/callchain.h typedef void (*sort_chain_func_t)(struct rb_root *, struct callchain_root *, rb_root 19 tools/perf/util/comm.c static struct rb_root comm_str_root; rb_root 61 tools/perf/util/comm.c struct comm_str *__comm_str__findnew(const char *str, struct rb_root *root) rb_root 97 tools/perf/util/comm.c static struct comm_str *comm_str__findnew(const char *str, struct rb_root *root) rb_root 756 tools/perf/util/dso.c struct rb_root *root = &dso->data.cache; rb_root 773 tools/perf/util/dso.c const struct rb_root *root = &dso->data.cache; rb_root 799 tools/perf/util/dso.c struct rb_root *root = &dso->data.cache; rb_root 1101 tools/perf/util/dso.c struct rb_root *root = dso->root; rb_root 138 tools/perf/util/dso.h struct rb_root *root; /* root of rbtree that rb_node is in */ rb_root 178 tools/perf/util/dso.h struct rb_root cache; rb_root 240 tools/perf/util/dso.h return !RB_EMPTY_ROOT(&dso->symbols.rb_root); rb_root 42 tools/perf/util/dsos.c struct dso *__dsos__findnew_link_by_longname(struct rb_root *root, struct dso *dso, const char *name) rb_root 19 tools/perf/util/dsos.h struct rb_root root; /* rbtree root sorted by long name */ rb_root 31 tools/perf/util/dsos.h struct dso *__dsos__findnew_link_by_longname(struct rb_root *root, struct dso *dso, const char *name); rb_root 33 tools/perf/util/dsos.h static inline struct dso *__dsos__findnew_by_longname(struct rb_root *root, const char *name) rb_root 129 tools/perf/util/env.c struct rb_root *root; rb_root 85 tools/perf/util/env.h struct rb_root infos; rb_root 87 tools/perf/util/env.h struct rb_root btfs; rb_root 919 tools/perf/util/header.c struct rb_root *root; rb_root 968 tools/perf/util/header.c struct rb_root *root; rb_root 1535 tools/perf/util/header.c struct rb_root *root; rb_root 1559 tools/perf/util/header.c struct rb_root *root; rb_root 577 tools/perf/util/hist.c p = &hists->entries_in->rb_root.rb_node; rb_root 1400 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_root 1517 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_root 1703 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_root 1790 tools/perf/util/hist.c struct rb_node **p = &entries->rb_root.rb_node; rb_root 1933 tools/perf/util/hist.c node = rb_last(&he->hroot_out.rb_root); rb_root 2113 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_root 2291 tools/perf/util/hist.c p = &root->rb_root.rb_node; rb_root 2335 tools/perf/util/hist.c p = &root->rb_root.rb_node; rb_root 2378 tools/perf/util/hist.c n = hists->entries_collapsed.rb_root.rb_node; rb_root 2380 tools/perf/util/hist.c n = hists->entries_in->rb_root.rb_node; rb_root 2400 tools/perf/util/hist.c struct rb_node *n = root->rb_root.rb_node; rb_root 2746 tools/perf/util/hist.c while (!RB_EMPTY_ROOT(&root->rb_root)) { rb_root 52 tools/perf/util/jitdump.c struct rb_root code_root; rb_root 101 tools/perf/util/kvm-stat.h struct rb_root result; rb_root 263 tools/perf/util/machine.c struct rb_node **p = &machines->guests.rb_root.rb_node; rb_root 308 tools/perf/util/machine.c struct rb_node **p = &machines->guests.rb_root.rb_node; rb_root 498 tools/perf/util/machine.c struct rb_node **p = &threads->entries.rb_root.rb_node; rb_root 320 tools/perf/util/map.c struct rb_node *nd = rb_last(&symbols->rb_root); rb_root 597 tools/perf/util/map.c struct rb_root *root = &maps->entries; rb_root 611 tools/perf/util/map.c struct rb_root *root = &maps->names; rb_root 775 tools/perf/util/map.c struct rb_root *root; rb_root 18 tools/perf/util/map_groups.h struct rb_root entries; rb_root 19 tools/perf/util/map_groups.h struct rb_root names; rb_root 17 tools/perf/util/mem2node.c static void phys_entry__insert(struct phys_entry *entry, struct rb_root *root) rb_root 11 tools/perf/util/mem2node.h struct rb_root root; rb_root 72 tools/perf/util/rb_resort.h struct rb_root entries; \ rb_root 92 tools/perf/util/rb_resort.h struct rb_root *entries) \ rb_root 103 tools/perf/util/rb_resort.h static struct __name##_sorted *__name##_sorted__new(struct rb_root *entries, \ rb_root 143 tools/perf/util/rb_resort.h DECLARE_RESORT_RB(__name)(&__ilist->rblist.entries.rb_root, \ rb_root 148 tools/perf/util/rb_resort.h DECLARE_RESORT_RB(__name)(&__machine->threads[hash_bucket].entries.rb_root, \ rb_root 15 tools/perf/util/rblist.c struct rb_node **p = &rblist->entries.rb_root.rb_node; rb_root 57 tools/perf/util/rblist.c struct rb_node **p = &rblist->entries.rb_root.rb_node; rb_root 153 tools/perf/util/sort.h struct rb_root sorted_chain; /* leaf entry has callchains */ rb_root 616 tools/perf/util/srcline.c struct rb_node **p = &tree->rb_root.rb_node; rb_root 646 tools/perf/util/srcline.c struct rb_node *n = tree->rb_root.rb_node; rb_root 708 tools/perf/util/srcline.c struct rb_node **p = &tree->rb_root.rb_node; rb_root 730 tools/perf/util/srcline.c struct rb_node *n = tree->rb_root.rb_node; rb_root 320 tools/perf/util/symbol.c struct rb_node **p = &symbols->rb_root.rb_node; rb_root 363 tools/perf/util/symbol.c n = symbols->rb_root.rb_node; rb_root 391 tools/perf/util/symbol.c struct rb_node *n = rb_last(&symbols->rb_root); rb_root 411 tools/perf/util/symbol.c struct rb_node **p = &symbols->rb_root.rb_node; rb_root 470 tools/perf/util/symbol.c n = symbols->rb_root.rb_node; rb_root 925 tools/perf/util/symbol.c static void add_module(struct module_info *mi, struct rb_root *modules) rb_root 943 tools/perf/util/symbol.c static void delete_modules(struct rb_root *modules) rb_root 958 tools/perf/util/symbol.c struct rb_root *modules) rb_root 982 tools/perf/util/symbol.c struct rb_root *modules = arg; rb_root 1002 tools/perf/util/symbol.c static int read_proc_modules(const char *filename, struct rb_root *modules) rb_root 1017 tools/perf/util/symbol.c struct rb_root from_modules = RB_ROOT; rb_root 1018 tools/perf/util/symbol.c struct rb_root to_modules = RB_ROOT; rb_root 1064 tools/perf/util/symbol.c struct rb_root modules = RB_ROOT;