rb_node 25 arch/arm/xen/p2m.c struct rb_node rbnode_phys; rb_node 34 arch/arm/xen/p2m.c struct rb_node **link = &phys_to_mach.rb_node; rb_node 35 arch/arm/xen/p2m.c struct rb_node *parent = NULL; rb_node 65 arch/arm/xen/p2m.c struct rb_node *n = phys_to_mach.rb_node; rb_node 127 arch/arm/xen/p2m.c struct rb_node *n = phys_to_mach.rb_node; rb_node 41 arch/powerpc/kernel/eeh_cache.c struct rb_node rb_node; rb_node 56 arch/powerpc/kernel/eeh_cache.c struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node; rb_node 60 arch/powerpc/kernel/eeh_cache.c piar = rb_entry(n, struct pci_io_addr_range, rb_node); rb_node 100 arch/powerpc/kernel/eeh_cache.c struct rb_node *n; rb_node 106 arch/powerpc/kernel/eeh_cache.c piar = rb_entry(n, struct pci_io_addr_range, rb_node); rb_node 121 arch/powerpc/kernel/eeh_cache.c struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node; rb_node 122 arch/powerpc/kernel/eeh_cache.c struct rb_node *parent = NULL; rb_node 128 arch/powerpc/kernel/eeh_cache.c piar = rb_entry(parent, struct pci_io_addr_range, rb_node); rb_node 154 arch/powerpc/kernel/eeh_cache.c rb_link_node(&piar->rb_node, parent, p); rb_node 155 arch/powerpc/kernel/eeh_cache.c rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root); rb_node 223 arch/powerpc/kernel/eeh_cache.c struct rb_node *n; rb_node 229 arch/powerpc/kernel/eeh_cache.c piar = rb_entry(n, struct pci_io_addr_range, rb_node); rb_node 274 arch/powerpc/kernel/eeh_cache.c struct rb_node *n; rb_node 278 arch/powerpc/kernel/eeh_cache.c piar = rb_entry(n, struct pci_io_addr_range, rb_node); rb_node 528 arch/powerpc/perf/hv-24x7.c struct rb_node node; rb_node 562 arch/powerpc/perf/hv-24x7.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 248 arch/sh/include/asm/dwarf.h struct rb_node node; rb_node 266 arch/sh/include/asm/dwarf.h struct rb_node node; rb_node 305 arch/sh/kernel/dwarf.c struct rb_node **rb_node = &cie_root.rb_node; rb_node 320 arch/sh/kernel/dwarf.c while (*rb_node) { rb_node 323 arch/sh/kernel/dwarf.c cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node); rb_node 332 arch/sh/kernel/dwarf.c rb_node = &(*rb_node)->rb_left; rb_node 334 arch/sh/kernel/dwarf.c rb_node = &(*rb_node)->rb_right; rb_node 349 arch/sh/kernel/dwarf.c struct rb_node **rb_node = &fde_root.rb_node; rb_node 355 arch/sh/kernel/dwarf.c while (*rb_node) { rb_node 359 arch/sh/kernel/dwarf.c fde_tmp = rb_entry(*rb_node, struct dwarf_fde, node); rb_node 366 arch/sh/kernel/dwarf.c rb_node = &(*rb_node)->rb_left; rb_node 372 arch/sh/kernel/dwarf.c rb_node = &(*rb_node)->rb_right; rb_node 738 arch/sh/kernel/dwarf.c struct rb_node **rb_node = &cie_root.rb_node; rb_node 739 arch/sh/kernel/dwarf.c struct rb_node *parent = *rb_node; rb_node 837 arch/sh/kernel/dwarf.c while (*rb_node) { rb_node 840 arch/sh/kernel/dwarf.c cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node); rb_node 842 arch/sh/kernel/dwarf.c parent = *rb_node; rb_node 845 arch/sh/kernel/dwarf.c rb_node = &parent->rb_left; rb_node 847 arch/sh/kernel/dwarf.c rb_node = &parent->rb_right; rb_node 852 arch/sh/kernel/dwarf.c rb_link_node(&cie->node, parent, rb_node); rb_node 869 arch/sh/kernel/dwarf.c struct rb_node **rb_node = &fde_root.rb_node; rb_node 870 arch/sh/kernel/dwarf.c struct rb_node *parent = *rb_node; rb_node 921 arch/sh/kernel/dwarf.c while (*rb_node) { rb_node 926 arch/sh/kernel/dwarf.c fde_tmp = rb_entry(*rb_node, struct dwarf_fde, node); rb_node 934 arch/sh/kernel/dwarf.c parent = *rb_node; rb_node 937 arch/sh/kernel/dwarf.c rb_node = &parent->rb_left; rb_node 939 arch/sh/kernel/dwarf.c rb_node = &parent->rb_right; rb_node 944 arch/sh/kernel/dwarf.c rb_link_node(&fde->node, parent, rb_node); rb_node 15 arch/x86/mm/pat_internal.h struct rb_node rb; rb_node 47 arch/x86/mm/pat_rbtree.c static u64 get_subtree_max_end(struct rb_node *node) rb_node 66 arch/x86/mm/pat_rbtree.c struct rb_node *node = root->rb_node; rb_node 100 arch/x86/mm/pat_rbtree.c struct rb_node *node; rb_node 125 arch/x86/mm/pat_rbtree.c struct rb_node *node; rb_node 168 arch/x86/mm/pat_rbtree.c struct rb_node **node = &(root->rb_node); rb_node 169 arch/x86/mm/pat_rbtree.c struct rb_node *parent = NULL; rb_node 251 arch/x86/mm/pat_rbtree.c struct rb_node *node; rb_node 552 block/bfq-iosched.c sector_t sector, struct rb_node **ret_parent, rb_node 553 block/bfq-iosched.c struct rb_node ***rb_link) rb_node 555 block/bfq-iosched.c struct rb_node **p, *parent; rb_node 559 block/bfq-iosched.c p = &root->rb_node; rb_node 561 block/bfq-iosched.c struct rb_node **n; rb_node 609 block/bfq-iosched.c struct rb_node **p, *parent; rb_node 694 block/bfq-iosched.c (bfqd->queue_weights_tree.rb_root.rb_node->rb_left || rb_node 695 block/bfq-iosched.c bfqd->queue_weights_tree.rb_root.rb_node->rb_right); rb_node 726 block/bfq-iosched.c struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; rb_node 894 block/bfq-iosched.c struct rb_node *rbnext = rb_next(&last->rb_node); rb_node 895 block/bfq-iosched.c struct rb_node *rbprev = rb_prev(&last->rb_node); rb_node 910 block/bfq-iosched.c if (rbnext && rbnext != &last->rb_node) rb_node 2267 block/bfq-iosched.c rb_prev(&req->rb_node) && rb_node 2269 block/bfq-iosched.c blk_rq_pos(container_of(rb_prev(&req->rb_node), rb_node 2270 block/bfq-iosched.c struct request, rb_node))) { rb_node 2415 block/bfq-iosched.c struct rb_node *parent, *node; rb_node 5048 block/bfq-iosched.c RB_CLEAR_NODE(&bfqq->entity.rb_node); rb_node 5947 block/bfq-iosched.c if (!RB_EMPTY_NODE(&rq->rb_node)) { rb_node 113 block/bfq-iosched.h struct rb_node weights_node; rb_node 145 block/bfq-iosched.h struct rb_node rb_node; rb_node 252 block/bfq-iosched.h struct rb_node pos_node; rb_node 1027 block/bfq-iosched.h struct bfq_entity *bfq_entity_of(struct rb_node *node); rb_node 25 block/bfq-wf2q.c struct rb_node *node = tree->rb_node; rb_node 27 block/bfq-wf2q.c return rb_entry(node, struct bfq_entity, rb_node); rb_node 318 block/bfq-wf2q.c struct bfq_entity *bfq_entity_of(struct rb_node *node) rb_node 323 block/bfq-wf2q.c entity = rb_entry(node, struct bfq_entity, rb_node); rb_node 336 block/bfq-wf2q.c rb_erase(&entity->rb_node, root); rb_node 348 block/bfq-wf2q.c struct rb_node *next; rb_node 351 block/bfq-wf2q.c next = rb_next(&entity->rb_node); rb_node 356 block/bfq-wf2q.c next = rb_prev(&entity->rb_node); rb_node 377 block/bfq-wf2q.c struct rb_node **node = &root->rb_node; rb_node 378 block/bfq-wf2q.c struct rb_node *parent = NULL; rb_node 382 block/bfq-wf2q.c entry = rb_entry(parent, struct bfq_entity, rb_node); rb_node 390 block/bfq-wf2q.c rb_link_node(&entity->rb_node, parent, node); rb_node 391 block/bfq-wf2q.c rb_insert_color(&entity->rb_node, root); rb_node 406 block/bfq-wf2q.c static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node) rb_node 411 block/bfq-wf2q.c child = rb_entry(node, struct bfq_entity, rb_node); rb_node 425 block/bfq-wf2q.c static void bfq_update_active_node(struct rb_node *node) rb_node 427 block/bfq-wf2q.c struct bfq_entity *entity = rb_entry(node, struct bfq_entity, rb_node); rb_node 444 block/bfq-wf2q.c static void bfq_update_active_tree(struct rb_node *node) rb_node 446 block/bfq-wf2q.c struct rb_node *parent; rb_node 479 block/bfq-wf2q.c struct rb_node *node = &entity->rb_node; rb_node 553 block/bfq-wf2q.c static struct rb_node *bfq_find_deepest(struct rb_node *node) rb_node 555 block/bfq-wf2q.c struct rb_node *deepest; rb_node 583 block/bfq-wf2q.c struct rb_node *node; rb_node 590 block/bfq-wf2q.c node = bfq_find_deepest(&entity->rb_node); rb_node 1362 block/bfq-wf2q.c struct rb_node *node = st->active.rb_node; rb_node 1365 block/bfq-wf2q.c entry = rb_entry(node, struct bfq_entity, rb_node); rb_node 1372 block/bfq-wf2q.c struct bfq_entity, rb_node); rb_node 117 block/blk-core.c RB_CLEAR_NODE(&rq->rb_node); rb_node 326 block/blk-mq.c RB_CLEAR_NODE(&rq->rb_node); rb_node 98 block/blk-throttle.c #define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node) rb_node 111 block/blk-throttle.c struct rb_node rb_node; rb_node 499 block/blk-throttle.c RB_CLEAR_NODE(&tg->rb_node); rb_node 620 block/blk-throttle.c struct rb_node *n; rb_node 632 block/blk-throttle.c static void throtl_rb_erase(struct rb_node *n, rb_node 654 block/blk-throttle.c struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node; rb_node 655 block/blk-throttle.c struct rb_node *parent = NULL; rb_node 672 block/blk-throttle.c rb_link_node(&tg->rb_node, parent, node); rb_node 673 block/blk-throttle.c rb_insert_color_cached(&tg->rb_node, &parent_sq->pending_tree, rb_node 692 block/blk-throttle.c throtl_rb_erase(&tg->rb_node, tg->service_queue.parent_sq); rb_node 257 block/elevator.c struct rb_node **p = &root->rb_node; rb_node 258 block/elevator.c struct rb_node *parent = NULL; rb_node 263 block/elevator.c __rq = rb_entry(parent, struct request, rb_node); rb_node 271 block/elevator.c rb_link_node(&rq->rb_node, parent, p); rb_node 272 block/elevator.c rb_insert_color(&rq->rb_node, root); rb_node 278 block/elevator.c BUG_ON(RB_EMPTY_NODE(&rq->rb_node)); rb_node 279 block/elevator.c rb_erase(&rq->rb_node, root); rb_node 280 block/elevator.c RB_CLEAR_NODE(&rq->rb_node); rb_node 286 block/elevator.c struct rb_node *n = root->rb_node; rb_node 290 block/elevator.c rq = rb_entry(n, struct request, rb_node); rb_node 815 block/elevator.c struct rb_node *rbprev = rb_prev(&rq->rb_node); rb_node 827 block/elevator.c struct rb_node *rbnext = rb_next(&rq->rb_node); rb_node 79 block/mq-deadline.c struct rb_node *node = rb_next(&rq->rb_node); rb_node 118 block/mq-deadline.c if (!RB_EMPTY_NODE(&rq->rb_node)) rb_node 311 drivers/android/binder.c struct rb_node rb_node; rb_node 396 drivers/android/binder.c struct rb_node rb_node_desc; rb_node 397 drivers/android/binder.c struct rb_node rb_node_node; rb_node 539 drivers/android/binder.c struct rb_node rb_node; rb_node 950 drivers/android/binder.c struct rb_node *n; rb_node 954 drivers/android/binder.c thread = rb_entry(n, struct binder_thread, rb_node); rb_node 1067 drivers/android/binder.c struct rb_node *n = proc->nodes.rb_node; rb_node 1073 drivers/android/binder.c node = rb_entry(n, struct binder_node, rb_node); rb_node 1108 drivers/android/binder.c struct rb_node **p = &proc->nodes.rb_node; rb_node 1109 drivers/android/binder.c struct rb_node *parent = NULL; rb_node 1120 drivers/android/binder.c node = rb_entry(parent, struct binder_node, rb_node); rb_node 1139 drivers/android/binder.c rb_link_node(&node->rb_node, parent, p); rb_node 1140 drivers/android/binder.c rb_insert_color(&node->rb_node, &proc->nodes); rb_node 1280 drivers/android/binder.c rb_erase(&node->rb_node, &proc->nodes); rb_node 1397 drivers/android/binder.c struct rb_node *n = proc->refs_by_desc.rb_node; rb_node 1441 drivers/android/binder.c struct rb_node **p = &proc->refs_by_node.rb_node; rb_node 1442 drivers/android/binder.c struct rb_node *parent = NULL; rb_node 1444 drivers/android/binder.c struct rb_node *n; rb_node 1475 drivers/android/binder.c p = &proc->refs_by_desc.rb_node; rb_node 4332 drivers/android/binder.c rb_erase(&node->rb_node, &proc->nodes); rb_node 4634 drivers/android/binder.c struct rb_node *parent = NULL; rb_node 4635 drivers/android/binder.c struct rb_node **p = &proc->threads.rb_node; rb_node 4639 drivers/android/binder.c thread = rb_entry(parent, struct binder_thread, rb_node); rb_node 4657 drivers/android/binder.c rb_link_node(&thread->rb_node, parent, p); rb_node 4658 drivers/android/binder.c rb_insert_color(&thread->rb_node, &proc->threads); rb_node 4728 drivers/android/binder.c rb_erase(&thread->rb_node, &proc->threads); rb_node 4977 drivers/android/binder.c struct rb_node *n; rb_node 4985 drivers/android/binder.c rb_node); rb_node 5307 drivers/android/binder.c struct rb_node *n; rb_node 5312 drivers/android/binder.c struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node); rb_node 5412 drivers/android/binder.c struct rb_node *n; rb_node 5447 drivers/android/binder.c thread = rb_entry(n, struct binder_thread, rb_node); rb_node 5459 drivers/android/binder.c node = rb_entry(n, struct binder_node, rb_node); rb_node 5467 drivers/android/binder.c rb_erase(&node->rb_node, &proc->nodes); rb_node 5710 drivers/android/binder.c struct rb_node *n; rb_node 5722 drivers/android/binder.c rb_node), print_all); rb_node 5726 drivers/android/binder.c rb_node); rb_node 5874 drivers/android/binder.c struct rb_node *n; rb_node 71 drivers/android/binder_alloc.c struct rb_node **p = &alloc->free_buffers.rb_node; rb_node 72 drivers/android/binder_alloc.c struct rb_node *parent = NULL; rb_node 87 drivers/android/binder_alloc.c buffer = rb_entry(parent, struct binder_buffer, rb_node); rb_node 97 drivers/android/binder_alloc.c rb_link_node(&new_buffer->rb_node, parent, p); rb_node 98 drivers/android/binder_alloc.c rb_insert_color(&new_buffer->rb_node, &alloc->free_buffers); rb_node 104 drivers/android/binder_alloc.c struct rb_node **p = &alloc->allocated_buffers.rb_node; rb_node 105 drivers/android/binder_alloc.c struct rb_node *parent = NULL; rb_node 112 drivers/android/binder_alloc.c buffer = rb_entry(parent, struct binder_buffer, rb_node); rb_node 122 drivers/android/binder_alloc.c rb_link_node(&new_buffer->rb_node, parent, p); rb_node 123 drivers/android/binder_alloc.c rb_insert_color(&new_buffer->rb_node, &alloc->allocated_buffers); rb_node 130 drivers/android/binder_alloc.c struct rb_node *n = alloc->allocated_buffers.rb_node; rb_node 137 drivers/android/binder_alloc.c buffer = rb_entry(n, struct binder_buffer, rb_node); rb_node 349 drivers/android/binder_alloc.c struct rb_node *n = alloc->free_buffers.rb_node; rb_node 352 drivers/android/binder_alloc.c struct rb_node *best_fit = NULL; rb_node 393 drivers/android/binder_alloc.c buffer = rb_entry(n, struct binder_buffer, rb_node); rb_node 417 drivers/android/binder_alloc.c buffer = rb_entry(n, struct binder_buffer, rb_node); rb_node 426 drivers/android/binder_alloc.c buffer = rb_entry(n, struct binder_buffer, rb_node); rb_node 444 drivers/android/binder_alloc.c buffer = rb_entry(best_fit, struct binder_buffer, rb_node); rb_node 628 drivers/android/binder_alloc.c rb_erase(&buffer->rb_node, &alloc->allocated_buffers); rb_node 634 drivers/android/binder_alloc.c rb_erase(&next->rb_node, &alloc->free_buffers); rb_node 643 drivers/android/binder_alloc.c rb_erase(&prev->rb_node, &alloc->free_buffers); rb_node 742 drivers/android/binder_alloc.c struct rb_node *n; rb_node 751 drivers/android/binder_alloc.c buffer = rb_entry(n, struct binder_buffer, rb_node); rb_node 823 drivers/android/binder_alloc.c struct rb_node *n; rb_node 828 drivers/android/binder_alloc.c rb_entry(n, struct binder_buffer, rb_node)); rb_node 875 drivers/android/binder_alloc.c struct rb_node *n; rb_node 40 drivers/android/binder_alloc.h struct rb_node rb_node; /* free entry by size or allocated entry */ rb_node 192 drivers/base/regmap/internal.h struct rb_node node; rb_node 31 drivers/base/regmap/regcache-rbtree.c struct rb_node node; rb_node 66 drivers/base/regmap/regcache-rbtree.c struct rb_node *node; rb_node 78 drivers/base/regmap/regcache-rbtree.c node = rbtree_ctx->root.rb_node; rb_node 99 drivers/base/regmap/regcache-rbtree.c struct rb_node **new, *parent; rb_node 105 drivers/base/regmap/regcache-rbtree.c new = &root->rb_node; rb_node 137 drivers/base/regmap/regcache-rbtree.c struct rb_node *node; rb_node 215 drivers/base/regmap/regcache-rbtree.c struct rb_node *next; rb_node 374 drivers/base/regmap/regcache-rbtree.c struct rb_node *node; rb_node 403 drivers/base/regmap/regcache-rbtree.c node = rbtree_ctx->root.rb_node; rb_node 469 drivers/base/regmap/regcache-rbtree.c struct rb_node *node; rb_node 511 drivers/base/regmap/regcache-rbtree.c struct rb_node *node; rb_node 537 drivers/base/regmap/regmap-debugfs.c struct rb_node *next; rb_node 535 drivers/base/regmap/regmap.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 559 drivers/base/regmap/regmap.c struct rb_node *node = map->range_tree.rb_node; rb_node 578 drivers/base/regmap/regmap.c struct rb_node *next; rb_node 10 drivers/block/drbd/drbd_interval.c sector_t interval_end(struct rb_node *node) rb_node 27 drivers/block/drbd/drbd_interval.c struct rb_node **new = &root->rb_node, *parent = NULL; rb_node 71 drivers/block/drbd/drbd_interval.c struct rb_node *node = root->rb_node; rb_node 114 drivers/block/drbd/drbd_interval.c struct rb_node *node = root->rb_node; rb_node 145 drivers/block/drbd/drbd_interval.c struct rb_node *node; rb_node 9 drivers/block/drbd/drbd_interval.h struct rb_node rb; rb_node 625 drivers/block/pktcdvd.c struct rb_node *n = rb_next(&node->rb_node); rb_node 628 drivers/block/pktcdvd.c return rb_entry(n, struct pkt_rb_node, rb_node); rb_node 633 drivers/block/pktcdvd.c rb_erase(&node->rb_node, &pd->bio_queue); rb_node 644 drivers/block/pktcdvd.c struct rb_node *n = pd->bio_queue.rb_node; rb_node 645 drivers/block/pktcdvd.c struct rb_node *next; rb_node 654 drivers/block/pktcdvd.c tmp = rb_entry(n, struct pkt_rb_node, rb_node); rb_node 678 drivers/block/pktcdvd.c struct rb_node **p = &pd->bio_queue.rb_node; rb_node 679 drivers/block/pktcdvd.c struct rb_node *parent = NULL; rb_node 685 drivers/block/pktcdvd.c tmp = rb_entry(parent, struct pkt_rb_node, rb_node); rb_node 691 drivers/block/pktcdvd.c rb_link_node(&node->rb_node, parent, p); rb_node 692 drivers/block/pktcdvd.c rb_insert_color(&node->rb_node, &pd->bio_queue); rb_node 1168 drivers/block/pktcdvd.c struct rb_node *n; rb_node 1186 drivers/block/pktcdvd.c first_node = rb_entry(n, struct pkt_rb_node, rb_node); rb_node 1204 drivers/block/pktcdvd.c node = rb_entry(n, struct pkt_rb_node, rb_node); rb_node 233 drivers/block/xen-blkback/blkback.c struct rb_node **new = NULL, *parent = NULL; rb_node 243 drivers/block/xen-blkback/blkback.c new = &ring->persistent_gnts.rb_node; rb_node 271 drivers/block/xen-blkback/blkback.c struct rb_node *node = NULL; rb_node 273 drivers/block/xen-blkback/blkback.c node = ring->persistent_gnts.rb_node; rb_node 310 drivers/block/xen-blkback/blkback.c struct rb_node *n; rb_node 390 drivers/block/xen-blkback/blkback.c struct rb_node *n; rb_node 245 drivers/block/xen-blkback/common.h struct rb_node node; rb_node 249 drivers/dma-buf/sw_sync.c struct rb_node **p = &obj->pt_tree.rb_node; rb_node 250 drivers/dma-buf/sw_sync.c struct rb_node *parent = NULL; rb_node 62 drivers/dma-buf/sync_debug.h struct rb_node node; rb_node 156 drivers/fpga/dfl-afu-dma-region.c struct rb_node **new, *parent = NULL; rb_node 161 drivers/fpga/dfl-afu-dma-region.c new = &afu->dma_regions.rb_node; rb_node 215 drivers/fpga/dfl-afu-dma-region.c struct rb_node *node = rb_first(&afu->dma_regions); rb_node 257 drivers/fpga/dfl-afu-dma-region.c struct rb_node *node = afu->dma_regions.rb_node; rb_node 58 drivers/fpga/dfl-afu.h struct rb_node node; rb_node 51 drivers/gpu/drm/amd/amdgpu/amdgpu_object.h struct rb_node rb; rb_node 171 drivers/gpu/drm/drm_mm.c struct rb_node **link, *rb; rb_node 193 drivers/gpu/drm/drm_mm.c link = &mm->interval_tree.rb_root.rb_node; rb_node 216 drivers/gpu/drm/drm_mm.c struct rb_node **link = &root.rb_node, *rb = NULL; \ rb_node 232 drivers/gpu/drm/drm_mm.c static u64 rb_to_hole_size(struct rb_node *rb) rb_node 240 drivers/gpu/drm/drm_mm.c struct rb_node **link = &root->rb_root.rb_node, *rb = NULL; rb_node 284 drivers/gpu/drm/drm_mm.c static inline struct drm_mm_node *rb_hole_size_to_node(struct rb_node *rb) rb_node 289 drivers/gpu/drm/drm_mm.c static inline struct drm_mm_node *rb_hole_addr_to_node(struct rb_node *rb) rb_node 294 drivers/gpu/drm/drm_mm.c static inline u64 rb_hole_size(struct rb_node *rb) rb_node 301 drivers/gpu/drm/drm_mm.c struct rb_node *rb = mm->holes_size.rb_root.rb_node; rb_node 321 drivers/gpu/drm/drm_mm.c struct rb_node *rb = mm->holes_addr.rb_node; rb_node 443 drivers/gpu/drm/drm_mm.c static u64 rb_to_hole_size_or_zero(struct rb_node *rb) rb_node 94 drivers/gpu/drm/drm_prime.c struct rb_node dmabuf_rb; rb_node 95 drivers/gpu/drm/drm_prime.c struct rb_node handle_rb; rb_node 102 drivers/gpu/drm/drm_prime.c struct rb_node **p, *rb; rb_node 113 drivers/gpu/drm/drm_prime.c p = &prime_fpriv->dmabufs.rb_node; rb_node 128 drivers/gpu/drm/drm_prime.c p = &prime_fpriv->handles.rb_node; rb_node 148 drivers/gpu/drm/drm_prime.c struct rb_node *rb; rb_node 150 drivers/gpu/drm/drm_prime.c rb = prime_fpriv->handles.rb_node; rb_node 170 drivers/gpu/drm/drm_prime.c struct rb_node *rb; rb_node 172 drivers/gpu/drm/drm_prime.c rb = prime_fpriv->dmabufs.rb_node; rb_node 193 drivers/gpu/drm/drm_prime.c struct rb_node *rb; rb_node 195 drivers/gpu/drm/drm_prime.c rb = prime_fpriv->dmabufs.rb_node; rb_node 145 drivers/gpu/drm/drm_vma_manager.c struct rb_node *iter; rb_node 148 drivers/gpu/drm/drm_vma_manager.c iter = mgr->vm_addr_space_mm.interval_tree.rb_root.rb_node; rb_node 265 drivers/gpu/drm/drm_vma_manager.c struct rb_node **iter; rb_node 266 drivers/gpu/drm/drm_vma_manager.c struct rb_node *parent = NULL; rb_node 278 drivers/gpu/drm/drm_vma_manager.c iter = &node->vm_files.rb_node; rb_node 329 drivers/gpu/drm/drm_vma_manager.c struct rb_node *iter; rb_node 333 drivers/gpu/drm/drm_vma_manager.c iter = node->vm_files.rb_node; rb_node 370 drivers/gpu/drm/drm_vma_manager.c struct rb_node *iter; rb_node 374 drivers/gpu/drm/drm_vma_manager.c iter = node->vm_files.rb_node; rb_node 312 drivers/gpu/drm/i915/gt/intel_engine_types.h struct rb_node uabi_node; rb_node 18 drivers/gpu/drm/i915/gt/intel_engine_user.c struct rb_node *p = i915->uabi_engines.rb_node; rb_node 54 drivers/gpu/drm/i915/gt/intel_engine_user.c container_of((struct rb_node *)A, typeof(*a), uabi_node); rb_node 56 drivers/gpu/drm/i915/gt/intel_engine_user.c container_of((struct rb_node *)B, typeof(*b), uabi_node); rb_node 83 drivers/gpu/drm/i915/gt/intel_engine_user.c container_of((struct rb_node *)pos, typeof(*engine), rb_node 198 drivers/gpu/drm/i915/gt/intel_engine_user.c struct rb_node **p, *prev; rb_node 204 drivers/gpu/drm/i915/gt/intel_engine_user.c p = &i915->uabi_engines.rb_node; rb_node 207 drivers/gpu/drm/i915/gt/intel_engine_user.c container_of((struct rb_node *)it, typeof(*engine), rb_node 202 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node rb; rb_node 264 drivers/gpu/drm/i915/gt/intel_lrc.c static inline struct i915_priolist *to_priolist(struct rb_node *rb) rb_node 306 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node *rb; rb_node 322 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node *rb) rb_node 1044 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node *rb; rb_node 2571 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node *rb; rb_node 3430 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node *node = &ve->nodes[sibling->id].rb; rb_node 3567 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node **parent, *rb; rb_node 3598 drivers/gpu/drm/i915/gt/intel_lrc.c parent = &sibling->execlists.virtual.rb_root.rb_node; rb_node 3925 drivers/gpu/drm/i915/gt/intel_lrc.c struct rb_node *rb; rb_node 75 drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c static inline struct i915_priolist *to_priolist(struct rb_node *rb) rb_node 545 drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c struct rb_node *rb; rb_node 683 drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c struct rb_node *rb; rb_node 103 drivers/gpu/drm/i915/gvt/kvmgt.c struct rb_node gfn_node; rb_node 104 drivers/gpu/drm/i915/gvt/kvmgt.c struct rb_node dma_addr_node; rb_node 222 drivers/gpu/drm/i915/gvt/kvmgt.c struct rb_node *node = vgpu->vdev.dma_addr_cache.rb_node; rb_node 240 drivers/gpu/drm/i915/gvt/kvmgt.c struct rb_node *node = vgpu->vdev.gfn_cache.rb_node; rb_node 260 drivers/gpu/drm/i915/gvt/kvmgt.c struct rb_node **link, *parent = NULL; rb_node 273 drivers/gpu/drm/i915/gvt/kvmgt.c link = &vgpu->vdev.gfn_cache.rb_node; rb_node 288 drivers/gpu/drm/i915/gvt/kvmgt.c link = &vgpu->vdev.dma_addr_cache.rb_node; rb_node 317 drivers/gpu/drm/i915/gvt/kvmgt.c struct rb_node *node = NULL; rb_node 32 drivers/gpu/drm/i915/i915_active.c struct rb_node node; rb_node 185 drivers/gpu/drm/i915/i915_active.c struct rb_node **p, *parent; rb_node 208 drivers/gpu/drm/i915/i915_active.c p = &ref->tree.rb_node; rb_node 502 drivers/gpu/drm/i915/i915_active.c struct rb_node *prev, *p; rb_node 523 drivers/gpu/drm/i915/i915_active.c p = ref->tree.rb_node; rb_node 673 drivers/gpu/drm/i915/i915_active.c struct rb_node **p, *parent; rb_node 676 drivers/gpu/drm/i915/i915_active.c p = &ref->tree.rb_node; rb_node 266 drivers/gpu/drm/i915/i915_debugfs.c struct rb_node *p = obj->vma.tree.rb_node; rb_node 47 drivers/gpu/drm/i915/i915_priolist_types.h struct rb_node node; rb_node 38 drivers/gpu/drm/i915/i915_scheduler.c static inline struct i915_priolist *to_priolist(struct rb_node *rb) rb_node 45 drivers/gpu/drm/i915/i915_scheduler.c struct rb_node *rb; rb_node 76 drivers/gpu/drm/i915/i915_scheduler.c struct rb_node **parent, *rb; rb_node 92 drivers/gpu/drm/i915/i915_scheduler.c parent = &execlists->queue.rb_root.rb_node; rb_node 104 drivers/gpu/drm/i915/i915_vma.c struct rb_node *rb, **p; rb_node 180 drivers/gpu/drm/i915/i915_vma.c p = &obj->vma.tree.rb_node; rb_node 237 drivers/gpu/drm/i915/i915_vma.c struct rb_node *rb; rb_node 239 drivers/gpu/drm/i915/i915_vma.c rb = obj->vma.tree.rb_node; rb_node 128 drivers/gpu/drm/i915/i915_vma.h struct rb_node obj_node; rb_node 20 drivers/gpu/drm/nouveau/include/nvkm/core/object.h struct rb_node node; rb_node 8 drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h struct rb_node tree; rb_node 35 drivers/gpu/drm/nouveau/nvkm/core/object.c struct rb_node *node = client->objroot.rb_node; rb_node 67 drivers/gpu/drm/nouveau/nvkm/core/object.c struct rb_node **ptr = &object->client->objroot.rb_node; rb_node 68 drivers/gpu/drm/nouveau/nvkm/core/object.c struct rb_node *parent = NULL; rb_node 801 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node **ptr = &vmm->free.rb_node; rb_node 802 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node *parent = NULL; rb_node 843 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node **ptr = &vmm->root.rb_node; rb_node 844 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node *parent = NULL; rb_node 865 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node *node = vmm->root.rb_node; rb_node 981 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node *node; rb_node 1640 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c struct rb_node *node = NULL, *temp; rb_node 1687 drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c temp = vmm->free.rb_node; rb_node 251 drivers/infiniband/core/cm.c struct rb_node remote_qp_node; rb_node 252 drivers/infiniband/core/cm.c struct rb_node remote_id_node; rb_node 262 drivers/infiniband/core/cm.c struct rb_node service_node; rb_node 263 drivers/infiniband/core/cm.c struct rb_node sidr_id_node; rb_node 663 drivers/infiniband/core/cm.c struct rb_node **link = &cm.listen_service_table.rb_node; rb_node 664 drivers/infiniband/core/cm.c struct rb_node *parent = NULL; rb_node 697 drivers/infiniband/core/cm.c struct rb_node *node = cm.listen_service_table.rb_node; rb_node 724 drivers/infiniband/core/cm.c struct rb_node **link = &cm.remote_id_table.rb_node; rb_node 725 drivers/infiniband/core/cm.c struct rb_node *parent = NULL; rb_node 754 drivers/infiniband/core/cm.c struct rb_node *node = cm.remote_id_table.rb_node; rb_node 777 drivers/infiniband/core/cm.c struct rb_node **link = &cm.remote_qp_table.rb_node; rb_node 778 drivers/infiniband/core/cm.c struct rb_node *parent = NULL; rb_node 807 drivers/infiniband/core/cm.c struct rb_node **link = &cm.remote_sidr_table.rb_node; rb_node 808 drivers/infiniband/core/cm.c struct rb_node *parent = NULL; rb_node 98 drivers/infiniband/core/multicast.c struct rb_node node; rb_node 132 drivers/infiniband/core/multicast.c struct rb_node *node = port->table.rb_node; rb_node 154 drivers/infiniband/core/multicast.c struct rb_node **link = &port->table.rb_node; rb_node 155 drivers/infiniband/core/multicast.c struct rb_node *parent = NULL; rb_node 774 drivers/infiniband/core/multicast.c struct rb_node *node; rb_node 82 drivers/infiniband/core/umem_odp.c struct rb_node *node; rb_node 472 drivers/infiniband/core/uverbs_cmd.c struct rb_node node; rb_node 482 drivers/infiniband/core/uverbs_cmd.c struct rb_node **p = &dev->xrcd_tree.rb_node; rb_node 483 drivers/infiniband/core/uverbs_cmd.c struct rb_node *parent = NULL; rb_node 516 drivers/infiniband/core/uverbs_cmd.c struct rb_node *p = dev->xrcd_tree.rb_node; rb_node 132 drivers/infiniband/hw/hfi1/mmu_rb.c struct rb_node *node; rb_node 214 drivers/infiniband/hw/hfi1/mmu_rb.c struct mmu_rb_node **rb_node) rb_node 231 drivers/infiniband/hw/hfi1/mmu_rb.c *rb_node = node; rb_node 56 drivers/infiniband/hw/hfi1/mmu_rb.h struct rb_node node; rb_node 86 drivers/infiniband/hw/hfi1/mmu_rb.h struct mmu_rb_node **rb_node); rb_node 94 drivers/infiniband/hw/hfi1/user_exp_rcv.c sizeof(struct rb_node *), rb_node 1022 drivers/infiniband/hw/hfi1/user_sdma.c struct mmu_rb_node *rb_node; rb_node 1030 drivers/infiniband/hw/hfi1/user_sdma.c iovec->iov.iov_len, &rb_node); rb_node 1031 drivers/infiniband/hw/hfi1/user_sdma.c if (rb_node) { rb_node 1032 drivers/infiniband/hw/hfi1/user_sdma.c node = container_of(rb_node, struct sdma_mmu_node, rb); rb_node 45 drivers/infiniband/hw/mlx4/cm.c struct rb_node node; rb_node 147 drivers/infiniband/hw/mlx4/cm.c struct rb_node *node = sl_id_map->rb_node; rb_node 192 drivers/infiniband/hw/mlx4/cm.c struct rb_node **link = &sl_id_map->rb_node, *parent = NULL; rb_node 387 drivers/infiniband/hw/mlx4/cm.c struct rb_node *nd; rb_node 103 drivers/infiniband/hw/mlx4/mcg.c struct rb_node node; rb_node 165 drivers/infiniband/hw/mlx4/mcg.c struct rb_node *node = ctx->mcg_table.rb_node; rb_node 186 drivers/infiniband/hw/mlx4/mcg.c struct rb_node **link = &ctx->mcg_table.rb_node; rb_node 187 drivers/infiniband/hw/mlx4/mcg.c struct rb_node *parent = NULL; rb_node 1076 drivers/infiniband/hw/mlx4/mcg.c struct rb_node *p; rb_node 1228 drivers/infiniband/hw/mlx4/mcg.c struct rb_node *p; rb_node 116 drivers/infiniband/hw/mlx5/odp.c struct rb_node *rb; rb_node 139 drivers/infiniband/hw/mlx5/odp.c struct rb_node *rb; rb_node 578 drivers/infiniband/hw/mlx5/odp.c struct rb_node *node; rb_node 61 drivers/infiniband/hw/qib/qib_user_sdma.c struct rb_node node; rb_node 144 drivers/infiniband/hw/qib/qib_user_sdma.c struct rb_node *node = root->rb_node; rb_node 162 drivers/infiniband/hw/qib/qib_user_sdma.c struct rb_node **node = &(root->rb_node); rb_node 163 drivers/infiniband/hw/qib/qib_user_sdma.c struct rb_node *parent = NULL; rb_node 40 drivers/infiniband/hw/usnic/usnic_uiom_interval_tree.h struct rb_node rb; rb_node 151 drivers/infiniband/sw/rdmavt/mcast.c struct rb_node *n; rb_node 156 drivers/infiniband/sw/rdmavt/mcast.c n = ibp->mcast_tree.rb_node; rb_node 161 drivers/infiniband/sw/rdmavt/mcast.c mcast = rb_entry(n, struct rvt_mcast, rb_node); rb_node 196 drivers/infiniband/sw/rdmavt/mcast.c struct rb_node **n = &ibp->mcast_tree.rb_node; rb_node 197 drivers/infiniband/sw/rdmavt/mcast.c struct rb_node *pn = NULL; rb_node 207 drivers/infiniband/sw/rdmavt/mcast.c tmcast = rb_entry(pn, struct rvt_mcast, rb_node); rb_node 261 drivers/infiniband/sw/rdmavt/mcast.c rb_link_node(&mcast->rb_node, pn, n); rb_node 262 drivers/infiniband/sw/rdmavt/mcast.c rb_insert_color(&mcast->rb_node, &ibp->mcast_tree); rb_node 350 drivers/infiniband/sw/rdmavt/mcast.c struct rb_node *n; rb_node 360 drivers/infiniband/sw/rdmavt/mcast.c n = ibp->mcast_tree.rb_node; rb_node 367 drivers/infiniband/sw/rdmavt/mcast.c mcast = rb_entry(n, struct rvt_mcast, rb_node); rb_node 398 drivers/infiniband/sw/rdmavt/mcast.c rb_erase(&mcast->rb_node, &ibp->mcast_tree); rb_node 440 drivers/infiniband/sw/rdmavt/mcast.c if (rdi->ports[i]->mcast_tree.rb_node) rb_node 285 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node **link = &pool->tree.rb_node; rb_node 286 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node *parent = NULL; rb_node 312 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node **link = &pool->tree.rb_node; rb_node 313 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node *parent = NULL; rb_node 479 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node *node = NULL; rb_node 488 drivers/infiniband/sw/rxe/rxe_pool.c node = pool->tree.rb_node; rb_node 510 drivers/infiniband/sw/rxe/rxe_pool.c struct rb_node *node = NULL; rb_node 520 drivers/infiniband/sw/rxe/rxe_pool.c node = pool->tree.rb_node; rb_node 88 drivers/infiniband/sw/rxe/rxe_pool.h struct rb_node node; rb_node 166 drivers/infiniband/ulp/ipoib/ipoib.h struct rb_node rb_node; rb_node 441 drivers/infiniband/ulp/ipoib/ipoib.h struct rb_node rb_node; rb_node 558 drivers/infiniband/ulp/ipoib/ipoib_main.c struct rb_node *n = priv->path_tree.rb_node; rb_node 563 drivers/infiniband/ulp/ipoib/ipoib_main.c path = rb_entry(n, struct ipoib_path, rb_node); rb_node 582 drivers/infiniband/ulp/ipoib/ipoib_main.c struct rb_node **n = &priv->path_tree.rb_node; rb_node 583 drivers/infiniband/ulp/ipoib/ipoib_main.c struct rb_node *pn = NULL; rb_node 589 drivers/infiniband/ulp/ipoib/ipoib_main.c tpath = rb_entry(pn, struct ipoib_path, rb_node); rb_node 601 drivers/infiniband/ulp/ipoib/ipoib_main.c rb_link_node(&path->rb_node, pn, n); rb_node 602 drivers/infiniband/ulp/ipoib/ipoib_main.c rb_insert_color(&path->rb_node, &priv->path_tree); rb_node 651 drivers/infiniband/ulp/ipoib/ipoib_main.c struct rb_node *n; rb_node 660 drivers/infiniband/ulp/ipoib/ipoib_main.c path = rb_entry(n, struct ipoib_path, rb_node); rb_node 724 drivers/infiniband/ulp/ipoib/ipoib_main.c rb_erase(&path->rb_node, &priv->path_tree); rb_node 162 drivers/infiniband/ulp/ipoib/ipoib_multicast.c struct rb_node *n = priv->multicast_tree.rb_node; rb_node 168 drivers/infiniband/ulp/ipoib/ipoib_multicast.c mcast = rb_entry(n, struct ipoib_mcast, rb_node); rb_node 186 drivers/infiniband/ulp/ipoib/ipoib_multicast.c struct rb_node **n = &priv->multicast_tree.rb_node, *pn = NULL; rb_node 193 drivers/infiniband/ulp/ipoib/ipoib_multicast.c tmcast = rb_entry(pn, struct ipoib_mcast, rb_node); rb_node 205 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_link_node(&mcast->rb_node, pn, n); rb_node 206 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_insert_color(&mcast->rb_node, &priv->multicast_tree); rb_node 736 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_erase(&mcast->rb_node, &priv->multicast_tree); rb_node 855 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_erase(&mcast->rb_node, &priv->multicast_tree); rb_node 860 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_erase(&priv->broadcast->rb_node, &priv->multicast_tree); rb_node 953 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_replace_node(&mcast->rb_node, rb_node 954 drivers/infiniband/ulp/ipoib/ipoib_multicast.c &nmcast->rb_node, rb_node 973 drivers/infiniband/ulp/ipoib/ipoib_multicast.c rb_erase(&mcast->rb_node, &priv->multicast_tree); rb_node 1019 drivers/infiniband/ulp/ipoib/ipoib_multicast.c struct rb_node *n; rb_node 1028 drivers/infiniband/ulp/ipoib/ipoib_multicast.c mcast = rb_entry(n, struct ipoib_mcast, rb_node); rb_node 51 drivers/iommu/iova.c rb_link_node(&iovad->anchor.node, NULL, &iovad->rbroot.rb_node); rb_node 116 drivers/iommu/iova.c static struct rb_node * rb_node 155 drivers/iommu/iova.c struct rb_node *start) rb_node 157 drivers/iommu/iova.c struct rb_node **new, *parent = NULL; rb_node 159 drivers/iommu/iova.c new = (start) ? &start : &(root->rb_node); rb_node 184 drivers/iommu/iova.c struct rb_node *curr, *prev; rb_node 320 drivers/iommu/iova.c struct rb_node *node = iovad->rbroot.rb_node; rb_node 605 drivers/iommu/iova.c __is_range_overlap(struct rb_node *node, rb_node 664 drivers/iommu/iova.c struct rb_node *node; rb_node 709 drivers/iommu/iova.c struct rb_node *node; rb_node 226 drivers/md/bcache/bcache.h struct rb_node node; rb_node 473 drivers/md/bcache/util.h struct rb_node **n = &(root)->rb_node, *parent = NULL; \ rb_node 497 drivers/md/bcache/util.h struct rb_node *n = (root)->rb_node; \ rb_node 517 drivers/md/bcache/util.h struct rb_node *n = (root)->rb_node; \ rb_node 116 drivers/md/dm-bio-prison-v1.c struct rb_node **new = &prison->cells.rb_node, *parent = NULL; rb_node 42 drivers/md/dm-bio-prison-v1.h struct rb_node node; rb_node 120 drivers/md/dm-bio-prison-v2.c struct rb_node **new = &prison->cells.rb_node, *parent = NULL; rb_node 51 drivers/md/dm-bio-prison-v2.h struct rb_node node; rb_node 134 drivers/md/dm-bufio.c struct rb_node node; rb_node 250 drivers/md/dm-bufio.c struct rb_node *n = c->buffer_tree.rb_node; rb_node 267 drivers/md/dm-bufio.c struct rb_node **new = &c->buffer_tree.rb_node, *parent = NULL; rb_node 15 drivers/md/dm-cache-background-tracker.c struct rb_node node; rb_node 84 drivers/md/dm-cache-background-tracker.c struct rb_node **new = &b->pending.rb_node, *parent = NULL; rb_node 113 drivers/md/dm-cache-background-tracker.c struct rb_node **new = &b->pending.rb_node; rb_node 77 drivers/md/dm-crypt.c struct rb_node rb_node; rb_node 1509 drivers/md/dm-crypt.c #define crypt_io_from_node(node) rb_entry((node), struct dm_crypt_io, rb_node) rb_node 1546 drivers/md/dm-crypt.c BUG_ON(rb_parent(write_tree.rb_node)); rb_node 1555 drivers/md/dm-crypt.c rb_erase(&io->rb_node, &write_tree); rb_node 1569 drivers/md/dm-crypt.c struct rb_node **rbp, *parent; rb_node 1591 drivers/md/dm-crypt.c rbp = &cc->write_tree.rb_node; rb_node 1601 drivers/md/dm-crypt.c rb_link_node(&io->rb_node, parent, rbp); rb_node 1602 drivers/md/dm-crypt.c rb_insert_color(&io->rb_node, &cc->write_tree); rb_node 18 drivers/md/dm-dust.c struct rb_node node; rb_node 37 drivers/md/dm-dust.c struct rb_node *node = root->rb_node; rb_node 56 drivers/md/dm-dust.c struct rb_node **link = &root->rb_node, *parent = NULL; rb_node 228 drivers/md/dm-dust.c struct rb_node *node = NULL, *nnode = NULL; rb_node 244 drivers/md/dm-dust.c BUG_ON(tree->rb_node != NULL); rb_node 140 drivers/md/dm-integrity.c struct rb_node node; rb_node 272 drivers/md/dm-integrity.c struct rb_node node; rb_node 1100 drivers/md/dm-integrity.c struct rb_node **n = &ic->in_progress.rb_node; rb_node 1101 drivers/md/dm-integrity.c struct rb_node *parent; rb_node 1189 drivers/md/dm-integrity.c struct rb_node **link; rb_node 1190 drivers/md/dm-integrity.c struct rb_node *parent; rb_node 1195 drivers/md/dm-integrity.c link = &ic->journal_tree_root.rb_node; rb_node 1223 drivers/md/dm-integrity.c struct rb_node *n = ic->journal_tree_root.rb_node; rb_node 1245 drivers/md/dm-integrity.c struct rb_node *next; rb_node 1265 drivers/md/dm-integrity.c struct rb_node *next; rb_node 223 drivers/md/dm-snap.c struct rb_node out_of_order_node; rb_node 1745 drivers/md/dm-snap.c struct rb_node *next; rb_node 1763 drivers/md/dm-snap.c struct rb_node *parent = NULL; rb_node 1764 drivers/md/dm-snap.c struct rb_node **p = &s->out_of_order_tree.rb_node; rb_node 590 drivers/md/dm-thin.c struct rb_node rb_node; rb_node 2108 drivers/md/dm-thin.c #define thin_pbd(node) rb_entry((node), struct dm_thin_endio_hook, rb_node) rb_node 2113 drivers/md/dm-thin.c struct rb_node **rbp, *parent; rb_node 2117 drivers/md/dm-thin.c rbp = &tc->sort_bio_list.rb_node; rb_node 2130 drivers/md/dm-thin.c rb_link_node(&pbd->rb_node, parent, rbp); rb_node 2131 drivers/md/dm-thin.c rb_insert_color(&pbd->rb_node, &tc->sort_bio_list); rb_node 2136 drivers/md/dm-thin.c struct rb_node *node; rb_node 2145 drivers/md/dm-thin.c rb_erase(&pbd->rb_node, &tc->sort_bio_list); rb_node 78 drivers/md/dm-writecache.c struct rb_node rb_node; rb_node 541 drivers/md/dm-writecache.c struct rb_node *node = wc->tree.rb_node; rb_node 547 drivers/md/dm-writecache.c e = container_of(node, struct wc_entry, rb_node); rb_node 552 drivers/md/dm-writecache.c e->rb_node.rb_left : e->rb_node.rb_right); rb_node 559 drivers/md/dm-writecache.c node = rb_next(&e->rb_node); rb_node 562 drivers/md/dm-writecache.c e = container_of(node, struct wc_entry, rb_node); rb_node 571 drivers/md/dm-writecache.c node = rb_prev(&e->rb_node); rb_node 573 drivers/md/dm-writecache.c node = rb_next(&e->rb_node); rb_node 576 drivers/md/dm-writecache.c e2 = container_of(node, struct wc_entry, rb_node); rb_node 586 drivers/md/dm-writecache.c struct rb_node **node = &wc->tree.rb_node, *parent = NULL; rb_node 589 drivers/md/dm-writecache.c e = container_of(*node, struct wc_entry, rb_node); rb_node 590 drivers/md/dm-writecache.c parent = &e->rb_node; rb_node 596 drivers/md/dm-writecache.c rb_link_node(&ins->rb_node, parent, node); rb_node 597 drivers/md/dm-writecache.c rb_insert_color(&ins->rb_node, &wc->tree); rb_node 604 drivers/md/dm-writecache.c rb_erase(&e->rb_node, &wc->tree); rb_node 610 drivers/md/dm-writecache.c struct rb_node **node = &wc->freetree.rb_node, *parent = NULL; rb_node 615 drivers/md/dm-writecache.c if (&e->rb_node < *node) rb_node 620 drivers/md/dm-writecache.c rb_link_node(&e->rb_node, parent, node); rb_node 621 drivers/md/dm-writecache.c rb_insert_color(&e->rb_node, &wc->freetree); rb_node 639 drivers/md/dm-writecache.c struct rb_node *next; rb_node 643 drivers/md/dm-writecache.c next = rb_next(&e->rb_node); rb_node 644 drivers/md/dm-writecache.c rb_erase(&e->rb_node, &wc->freetree); rb_node 647 drivers/md/dm-writecache.c wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL; rb_node 748 drivers/md/dm-writecache.c struct rb_node *rb_node = rb_prev(&e->rb_node); rb_node 750 drivers/md/dm-writecache.c if (rb_node) { rb_node 751 drivers/md/dm-writecache.c e2 = container_of(rb_node, struct wc_entry, rb_node); rb_node 800 drivers/md/dm-writecache.c struct rb_node *node = rb_next(&e->rb_node); rb_node 814 drivers/md/dm-writecache.c e = container_of(node, struct wc_entry, rb_node); rb_node 1604 drivers/md/dm-writecache.c struct rb_node *node, *next_node; rb_node 1643 drivers/md/dm-writecache.c e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node); rb_node 1652 drivers/md/dm-writecache.c node = rb_prev(&e->rb_node); rb_node 1654 drivers/md/dm-writecache.c f = container_of(node, struct wc_entry, rb_node); rb_node 1674 drivers/md/dm-writecache.c next_node = rb_next(&f->rb_node); rb_node 1677 drivers/md/dm-writecache.c g = container_of(next_node, struct wc_entry, rb_node); rb_node 1710 drivers/md/dm-writecache.c next_node = rb_next(&f->rb_node); rb_node 1712 drivers/md/dm-writecache.c g = container_of(next_node, struct wc_entry, rb_node); rb_node 101 drivers/md/dm-zoned-metadata.c struct rb_node node; rb_node 329 drivers/md/dm-zoned-metadata.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 352 drivers/md/dm-zoned-metadata.c struct rb_node *node = root->rb_node; rb_node 70 drivers/mtd/mtdswap.c struct rb_node rb; rb_node 161 drivers/mtd/mtdswap.c #define TREE_EMPTY(d, name) (TREE_ROOT(d, name)->rb_node == NULL) rb_node 205 drivers/mtd/mtdswap.c struct rb_node **p, *parent = NULL; rb_node 208 drivers/mtd/mtdswap.c p = &root->rb_node; rb_node 236 drivers/mtd/mtdswap.c static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx) rb_node 238 drivers/mtd/mtdswap.c struct rb_node *p; rb_node 419 drivers/mtd/mtdswap.c struct rb_node *medrb; rb_node 767 drivers/mtd/mtdswap.c if (d->trees[idx].root.rb_node != NULL) rb_node 810 drivers/mtd/mtdswap.c if (root->rb_node == NULL) rb_node 1188 drivers/mtd/mtdswap.c if (root->rb_node) { rb_node 108 drivers/mtd/ubi/attach.c struct rb_node **p = &ai->volumes.rb_node, *parent = NULL; rb_node 570 drivers/mtd/ubi/attach.c struct rb_node **p, *parent = NULL; rb_node 590 drivers/mtd/ubi/attach.c p = &av->root.rb_node; rb_node 1281 drivers/mtd/ubi/attach.c struct rb_node *this = av->root.rb_node; rb_node 1315 drivers/mtd/ubi/attach.c struct rb_node *rb; rb_node 1339 drivers/mtd/ubi/attach.c rb = ai->volumes.rb_node; rb_node 1378 drivers/mtd/ubi/attach.c struct rb_node *rb1, *rb2; rb_node 1663 drivers/mtd/ubi/attach.c struct rb_node *rb1, *rb2; rb_node 214 drivers/mtd/ubi/eba.c struct rb_node *p; rb_node 216 drivers/mtd/ubi/eba.c p = ubi->ltree.rb_node; rb_node 275 drivers/mtd/ubi/eba.c struct rb_node **p, *parent = NULL; rb_node 283 drivers/mtd/ubi/eba.c p = &ubi->ltree.rb_node; rb_node 1522 drivers/mtd/ubi/eba.c struct rb_node *rb; rb_node 1616 drivers/mtd/ubi/eba.c struct rb_node *rb; rb_node 28 drivers/mtd/ubi/fastmap-wl.c struct rb_node *p; rb_node 62 drivers/mtd/ubi/fastmap-wl.c struct rb_node *p; rb_node 85 drivers/mtd/ubi/fastmap-wl.c if (!ubi->free.rb_node || (ubi->free_count - ubi->beb_rsvd_pebs < 1)) rb_node 128 drivers/mtd/ubi/fastmap-wl.c if (!ubi->free.rb_node) rb_node 141 drivers/mtd/ubi/fastmap-wl.c if (!ubi->free.rb_node || rb_node 178 drivers/mtd/ubi/fastmap-wl.c while (!ubi->free.rb_node && ubi->works_count) { rb_node 379 drivers/mtd/ubi/fastmap-wl.c e = rb_entry(rb_next(root->rb_node), rb_node 208 drivers/mtd/ubi/fastmap.c struct rb_node **p = &av->root.rb_node, *parent = NULL; rb_node 246 drivers/mtd/ubi/fastmap.c struct rb_node **p = &av->root.rb_node, *parent = NULL; rb_node 373 drivers/mtd/ubi/fastmap.c struct rb_node *node, *node2; rb_node 521 drivers/mtd/ubi/fastmap.c struct rb_node *rb1, *rb2; rb_node 1137 drivers/mtd/ubi/fastmap.c struct rb_node *tmp_rb; rb_node 180 drivers/mtd/ubi/ubi.h struct rb_node rb; rb_node 202 drivers/mtd/ubi/ubi.h struct rb_node rb; rb_node 682 drivers/mtd/ubi/ubi.h struct rb_node rb; rb_node 717 drivers/mtd/ubi/ubi.h struct rb_node rb; rb_node 366 drivers/mtd/ubi/vtbl.c struct rb_node *rb; rb_node 141 drivers/mtd/ubi/wl.c struct rb_node **p, *parent = NULL; rb_node 143 drivers/mtd/ubi/wl.c p = &root->rb_node; rb_node 238 drivers/mtd/ubi/wl.c struct rb_node *p; rb_node 240 drivers/mtd/ubi/wl.c p = root->rb_node; rb_node 321 drivers/mtd/ubi/wl.c struct rb_node *p; rb_node 328 drivers/mtd/ubi/wl.c p = root->rb_node; rb_node 370 drivers/mtd/ubi/wl.c e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb); rb_node 683 drivers/mtd/ubi/wl.c if (!ubi->free.rb_node || rb_node 684 drivers/mtd/ubi/wl.c (!ubi->used.rb_node && !ubi->scrub.rb_node)) { rb_node 696 drivers/mtd/ubi/wl.c !ubi->free.rb_node, !ubi->used.rb_node); rb_node 722 drivers/mtd/ubi/wl.c } else if (!ubi->scrub.rb_node) { rb_node 724 drivers/mtd/ubi/wl.c if (!ubi->scrub.rb_node) { rb_node 1025 drivers/mtd/ubi/wl.c if (!ubi->scrub.rb_node) { rb_node 1026 drivers/mtd/ubi/wl.c if (!ubi->used.rb_node || !ubi->free.rb_node) rb_node 1587 drivers/mtd/ubi/wl.c struct rb_node *rb; rb_node 1590 drivers/mtd/ubi/wl.c rb = root->rb_node; rb_node 1738 drivers/mtd/ubi/wl.c struct rb_node *rb1, *rb2; rb_node 2047 drivers/mtd/ubi/wl.c while (!ubi->free.rb_node && ubi->works_count) { rb_node 2077 drivers/mtd/ubi/wl.c if (!ubi->free.rb_node) { rb_node 73 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c struct rb_node node; rb_node 237 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c struct rb_node *node = root->rb_node; rb_node 255 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 5030 drivers/net/ethernet/mellanox/mlx4/resource_tracker.c struct rb_node *p; rb_node 80 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c struct rb_node node; rb_node 862 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c struct rb_node *node = root->rb_node; rb_node 894 drivers/net/ethernet/mellanox/mlx5/core/fpga/ipsec.c struct rb_node **new = &root->rb_node, *parent = NULL; rb_node 57 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_node rb_node; rb_node 79 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_node **new = &root->rb_node; rb_node 80 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_node *parent = NULL; rb_node 87 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c tfp = rb_entry(parent, struct fw_page, rb_node); rb_node 107 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c rb_link_node(&nfp->rb_node, parent, new); rb_node 108 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c rb_insert_color(&nfp->rb_node, root); rb_node 117 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_node *tmp = root->rb_node; rb_node 122 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c tfp = rb_entry(tmp, struct fw_page, rb_node); rb_node 200 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c rb_erase(&fwp->rb_node, &dev->priv.page_root); rb_node 346 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_node *p; rb_node 360 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c fwp = rb_entry(p, struct fw_page, rb_node); rb_node 524 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c struct rb_node *p; rb_node 531 drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c fwp = rb_entry(p, struct fw_page, rb_node); rb_node 84 drivers/vfio/vfio_iommu_type1.c struct rb_node node; rb_node 111 drivers/vfio/vfio_iommu_type1.c struct rb_node node; rb_node 137 drivers/vfio/vfio_iommu_type1.c struct rb_node *node = iommu->dma_list.rb_node; rb_node 155 drivers/vfio/vfio_iommu_type1.c struct rb_node **link = &iommu->dma_list.rb_node, *parent = NULL; rb_node 183 drivers/vfio/vfio_iommu_type1.c struct rb_node *node = dma->pfn_list.rb_node; rb_node 201 drivers/vfio/vfio_iommu_type1.c struct rb_node **link, *parent = NULL; rb_node 204 drivers/vfio/vfio_iommu_type1.c link = &dma->pfn_list.rb_node; rb_node 1191 drivers/vfio/vfio_iommu_type1.c struct rb_node *n; rb_node 1856 drivers/vfio/vfio_iommu_type1.c struct rb_node *node; rb_node 1864 drivers/vfio/vfio_iommu_type1.c struct rb_node *n, *p; rb_node 1887 drivers/vfio/vfio_iommu_type1.c struct rb_node *n; rb_node 59 drivers/vhost/vhost.h struct rb_node rb; rb_node 84 drivers/xen/evtchn.c struct rb_node node; rb_node 109 drivers/xen/evtchn.c struct rb_node **new = &(u->evtchns.rb_node), *parent = NULL; rb_node 143 drivers/xen/evtchn.c struct rb_node *node = u->evtchns.rb_node; rb_node 673 drivers/xen/evtchn.c struct rb_node *node; rb_node 675 drivers/xen/evtchn.c while ((node = u->evtchns.rb_node)) { rb_node 51 fs/afs/cell.c struct rb_node *p; rb_node 84 fs/afs/cell.c p = rcu_dereference_raw(net->cells.rb_node); rb_node 229 fs/afs/cell.c struct rb_node *parent, **pp; rb_node 261 fs/afs/cell.c pp = &net->cells.rb_node; rb_node 757 fs/afs/cell.c struct rb_node *cursor; rb_node 369 fs/afs/internal.h struct rb_node net_node; /* Node in net->cells */ rb_node 495 fs/afs/internal.h struct rb_node uuid_rb; /* Link in net->servers */ rb_node 100 fs/afs/server.c struct rb_node *p; rb_node 116 fs/afs/server.c p = net->fs_servers.rb_node; rb_node 148 fs/afs/server.c struct rb_node **pp, *p; rb_node 156 fs/afs/server.c pp = &net->fs_servers.rb_node; rb_node 442 fs/afs/server.c struct rb_node *cursor; rb_node 229 fs/btrfs/backref.c struct rb_node **p; rb_node 230 fs/btrfs/backref.c struct rb_node *parent = NULL; rb_node 236 fs/btrfs/backref.c p = &root->rb_root.rb_node; rb_node 620 fs/btrfs/backref.c struct rb_node *rnode; rb_node 720 fs/btrfs/backref.c struct rb_node *node; rb_node 768 fs/btrfs/backref.c struct rb_node *n; rb_node 1126 fs/btrfs/backref.c struct rb_node *node; rb_node 67 fs/btrfs/backref.h struct rb_node rbnode; rb_node 154 fs/btrfs/block-group.c struct rb_node **p; rb_node 155 fs/btrfs/block-group.c struct rb_node *parent = NULL; rb_node 159 fs/btrfs/block-group.c p = &info->block_group_cache_tree.rb_node; rb_node 195 fs/btrfs/block-group.c struct rb_node *n; rb_node 199 fs/btrfs/block-group.c n = info->block_group_cache_tree.rb_node; rb_node 254 fs/btrfs/block-group.c struct rb_node *node; rb_node 3098 fs/btrfs/block-group.c struct rb_node *n; rb_node 98 fs/btrfs/block-group.h struct rb_node cache_node; rb_node 79 fs/btrfs/btrfs_inode.h struct rb_node rb_node; rb_node 288 fs/btrfs/ctree.c struct rb_node node; rb_node 346 fs/btrfs/ctree.c struct rb_node *node; rb_node 347 fs/btrfs/ctree.c struct rb_node *next; rb_node 402 fs/btrfs/ctree.c struct rb_node **new; rb_node 403 fs/btrfs/ctree.c struct rb_node *parent = NULL; rb_node 411 fs/btrfs/ctree.c new = &tm_root->rb_node; rb_node 685 fs/btrfs/ctree.c struct rb_node *node; rb_node 691 fs/btrfs/ctree.c node = tm_root->rb_node; rb_node 1224 fs/btrfs/ctree.c struct rb_node *next; rb_node 475 fs/btrfs/ctree.h struct rb_node node; rb_node 346 fs/btrfs/delayed-inode.c struct rb_node *node, *prev_node = NULL; rb_node 350 fs/btrfs/delayed-inode.c node = root->rb_node; rb_node 354 fs/btrfs/delayed-inode.c rb_node); rb_node 372 fs/btrfs/delayed-inode.c rb_node); rb_node 384 fs/btrfs/delayed-inode.c rb_node); rb_node 403 fs/btrfs/delayed-inode.c struct rb_node **p, *node; rb_node 404 fs/btrfs/delayed-inode.c struct rb_node *parent_node = NULL; rb_node 416 fs/btrfs/delayed-inode.c p = &root->rb_root.rb_node; rb_node 417 fs/btrfs/delayed-inode.c node = &ins->rb_node; rb_node 422 fs/btrfs/delayed-inode.c rb_node); rb_node 493 fs/btrfs/delayed-inode.c rb_erase_cached(&delayed_item->rb_node, root); rb_node 511 fs/btrfs/delayed-inode.c struct rb_node *p; rb_node 516 fs/btrfs/delayed-inode.c item = rb_entry(p, struct btrfs_delayed_item, rb_node); rb_node 524 fs/btrfs/delayed-inode.c struct rb_node *p; rb_node 529 fs/btrfs/delayed-inode.c item = rb_entry(p, struct btrfs_delayed_item, rb_node); rb_node 537 fs/btrfs/delayed-inode.c struct rb_node *p; rb_node 540 fs/btrfs/delayed-inode.c p = rb_next(&item->rb_node); rb_node 542 fs/btrfs/delayed-inode.c next = rb_entry(p, struct btrfs_delayed_item, rb_node); rb_node 64 fs/btrfs/delayed-inode.h struct rb_node rb_node; rb_node 279 fs/btrfs/delayed-ref.c struct rb_node *node) rb_node 281 fs/btrfs/delayed-ref.c struct rb_node **p = &root->rb_root.rb_node; rb_node 282 fs/btrfs/delayed-ref.c struct rb_node *parent_node = NULL; rb_node 313 fs/btrfs/delayed-ref.c struct rb_node **p = &root->rb_root.rb_node; rb_node 314 fs/btrfs/delayed-ref.c struct rb_node *node = &ins->ref_node; rb_node 315 fs/btrfs/delayed-ref.c struct rb_node *parent_node = NULL; rb_node 344 fs/btrfs/delayed-ref.c struct rb_node *n; rb_node 366 fs/btrfs/delayed-ref.c struct rb_node *n; rb_node 369 fs/btrfs/delayed-ref.c n = root->rb_node; rb_node 437 fs/btrfs/delayed-ref.c struct rb_node *node = rb_next(&ref->ref_node); rb_node 483 fs/btrfs/delayed-ref.c struct rb_node *node; rb_node 554 fs/btrfs/delayed-ref.c struct rb_node *node; rb_node 18 fs/btrfs/delayed-ref.h struct rb_node ref_node; rb_node 86 fs/btrfs/delayed-ref.h struct rb_node href_node; rb_node 2104 fs/btrfs/disk-io.c RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node); rb_node 4268 fs/btrfs/disk-io.c struct rb_node *node; rb_node 4284 fs/btrfs/disk-io.c struct rb_node *n; rb_node 2081 fs/btrfs/extent-tree.c struct rb_node *n = root->rb_node; rb_node 2089 fs/btrfs/extent-tree.c entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); rb_node 2094 fs/btrfs/extent-tree.c entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); rb_node 2097 fs/btrfs/extent-tree.c n = root->rb_node; rb_node 2100 fs/btrfs/extent-tree.c entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node); rb_node 2165 fs/btrfs/extent-tree.c struct rb_node *node; rb_node 2250 fs/btrfs/extent-tree.c struct rb_node *node; rb_node 33 fs/btrfs/extent_io.c return !RB_EMPTY_NODE(&state->rb_node); rb_node 115 fs/btrfs/extent_io.c struct rb_node rb_node; rb_node 273 fs/btrfs/extent_io.c struct rb_node *node; rb_node 277 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 278 fs/btrfs/extent_io.c rb_erase(&state->rb_node, &tree->state); rb_node 279 fs/btrfs/extent_io.c RB_CLEAR_NODE(&state->rb_node); rb_node 306 fs/btrfs/extent_io.c RB_CLEAR_NODE(&state->rb_node); rb_node 326 fs/btrfs/extent_io.c static struct rb_node *tree_insert(struct rb_root *root, rb_node 327 fs/btrfs/extent_io.c struct rb_node *search_start, rb_node 329 fs/btrfs/extent_io.c struct rb_node *node, rb_node 330 fs/btrfs/extent_io.c struct rb_node ***p_in, rb_node 331 fs/btrfs/extent_io.c struct rb_node **parent_in) rb_node 333 fs/btrfs/extent_io.c struct rb_node **p; rb_node 334 fs/btrfs/extent_io.c struct rb_node *parent = NULL; rb_node 343 fs/btrfs/extent_io.c p = search_start ? &search_start : &root->rb_node; rb_node 346 fs/btrfs/extent_io.c entry = rb_entry(parent, struct tree_entry, rb_node); rb_node 380 fs/btrfs/extent_io.c static struct rb_node *__etree_search(struct extent_io_tree *tree, u64 offset, rb_node 381 fs/btrfs/extent_io.c struct rb_node **next_ret, rb_node 382 fs/btrfs/extent_io.c struct rb_node **prev_ret, rb_node 383 fs/btrfs/extent_io.c struct rb_node ***p_ret, rb_node 384 fs/btrfs/extent_io.c struct rb_node **parent_ret) rb_node 387 fs/btrfs/extent_io.c struct rb_node **n = &root->rb_node; rb_node 388 fs/btrfs/extent_io.c struct rb_node *prev = NULL; rb_node 389 fs/btrfs/extent_io.c struct rb_node *orig_prev = NULL; rb_node 395 fs/btrfs/extent_io.c entry = rb_entry(prev, struct tree_entry, rb_node); rb_node 415 fs/btrfs/extent_io.c prev_entry = rb_entry(prev, struct tree_entry, rb_node); rb_node 422 fs/btrfs/extent_io.c prev_entry = rb_entry(prev, struct tree_entry, rb_node); rb_node 425 fs/btrfs/extent_io.c prev_entry = rb_entry(prev, struct tree_entry, rb_node); rb_node 432 fs/btrfs/extent_io.c static inline struct rb_node * rb_node 435 fs/btrfs/extent_io.c struct rb_node ***p_ret, rb_node 436 fs/btrfs/extent_io.c struct rb_node **parent_ret) rb_node 438 fs/btrfs/extent_io.c struct rb_node *next= NULL; rb_node 439 fs/btrfs/extent_io.c struct rb_node *ret; rb_node 447 fs/btrfs/extent_io.c static inline struct rb_node *tree_search(struct extent_io_tree *tree, rb_node 466 fs/btrfs/extent_io.c struct rb_node *other_node; rb_node 471 fs/btrfs/extent_io.c other_node = rb_prev(&state->rb_node); rb_node 473 fs/btrfs/extent_io.c other = rb_entry(other_node, struct extent_state, rb_node); rb_node 481 fs/btrfs/extent_io.c rb_erase(&other->rb_node, &tree->state); rb_node 482 fs/btrfs/extent_io.c RB_CLEAR_NODE(&other->rb_node); rb_node 486 fs/btrfs/extent_io.c other_node = rb_next(&state->rb_node); rb_node 488 fs/btrfs/extent_io.c other = rb_entry(other_node, struct extent_state, rb_node); rb_node 496 fs/btrfs/extent_io.c rb_erase(&other->rb_node, &tree->state); rb_node 497 fs/btrfs/extent_io.c RB_CLEAR_NODE(&other->rb_node); rb_node 519 fs/btrfs/extent_io.c struct rb_node ***p, rb_node 520 fs/btrfs/extent_io.c struct rb_node **parent, rb_node 523 fs/btrfs/extent_io.c struct rb_node *node; rb_node 535 fs/btrfs/extent_io.c node = tree_insert(&tree->state, NULL, end, &state->rb_node, p, parent); rb_node 538 fs/btrfs/extent_io.c found = rb_entry(node, struct extent_state, rb_node); rb_node 565 fs/btrfs/extent_io.c struct rb_node *node; rb_node 575 fs/btrfs/extent_io.c node = tree_insert(&tree->state, &orig->rb_node, prealloc->end, rb_node 576 fs/btrfs/extent_io.c &prealloc->rb_node, NULL, NULL); rb_node 586 fs/btrfs/extent_io.c struct rb_node *next = rb_next(&state->rb_node); rb_node 588 fs/btrfs/extent_io.c return rb_entry(next, struct extent_state, rb_node); rb_node 626 fs/btrfs/extent_io.c rb_erase(&state->rb_node, &tree->state); rb_node 627 fs/btrfs/extent_io.c RB_CLEAR_NODE(&state->rb_node); rb_node 676 fs/btrfs/extent_io.c struct rb_node *node; rb_node 730 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 845 fs/btrfs/extent_io.c struct rb_node *node; rb_node 861 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 944 fs/btrfs/extent_io.c struct rb_node *node; rb_node 945 fs/btrfs/extent_io.c struct rb_node **p; rb_node 946 fs/btrfs/extent_io.c struct rb_node *parent; rb_node 971 fs/btrfs/extent_io.c node = &state->rb_node; rb_node 992 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 1176 fs/btrfs/extent_io.c struct rb_node *node; rb_node 1177 fs/btrfs/extent_io.c struct rb_node **p; rb_node 1178 fs/btrfs/extent_io.c struct rb_node *parent; rb_node 1207 fs/btrfs/extent_io.c node = &state->rb_node; rb_node 1231 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 1493 fs/btrfs/extent_io.c struct rb_node *node; rb_node 1505 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 1579 fs/btrfs/extent_io.c struct rb_node *node, *prev = NULL, *next; rb_node 1599 fs/btrfs/extent_io.c state = rb_entry(prev, struct extent_state, rb_node); rb_node 1610 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 1647 fs/btrfs/extent_io.c rb_node); rb_node 1661 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 1687 fs/btrfs/extent_io.c struct rb_node *node; rb_node 1706 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 1966 fs/btrfs/extent_io.c struct rb_node *node; rb_node 1990 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 2024 fs/btrfs/extent_io.c struct rb_node *node; rb_node 2038 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 2052 fs/btrfs/extent_io.c struct rb_node *node; rb_node 2066 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 2087 fs/btrfs/extent_io.c struct rb_node *node; rb_node 2093 fs/btrfs/extent_io.c node = &cached->rb_node; rb_node 2097 fs/btrfs/extent_io.c state = rb_entry(node, struct extent_state, rb_node); rb_node 142 fs/btrfs/extent_io.h struct rb_node rb_node; rb_node 56 fs/btrfs/extent_map.c RB_CLEAR_NODE(&em->rb_node); rb_node 96 fs/btrfs/extent_map.c struct rb_node **p = &root->rb_root.rb_node; rb_node 97 fs/btrfs/extent_map.c struct rb_node *parent = NULL; rb_node 99 fs/btrfs/extent_map.c struct rb_node *orig_parent = NULL; rb_node 105 fs/btrfs/extent_map.c entry = rb_entry(parent, struct extent_map, rb_node); rb_node 120 fs/btrfs/extent_map.c entry = rb_entry(parent, struct extent_map, rb_node); rb_node 127 fs/btrfs/extent_map.c entry = rb_entry(parent, struct extent_map, rb_node); rb_node 130 fs/btrfs/extent_map.c entry = rb_entry(parent, struct extent_map, rb_node); rb_node 136 fs/btrfs/extent_map.c rb_link_node(&em->rb_node, orig_parent, p); rb_node 137 fs/btrfs/extent_map.c rb_insert_color_cached(&em->rb_node, root, leftmost); rb_node 145 fs/btrfs/extent_map.c static struct rb_node *__tree_search(struct rb_root *root, u64 offset, rb_node 146 fs/btrfs/extent_map.c struct rb_node **prev_ret, rb_node 147 fs/btrfs/extent_map.c struct rb_node **next_ret) rb_node 149 fs/btrfs/extent_map.c struct rb_node *n = root->rb_node; rb_node 150 fs/btrfs/extent_map.c struct rb_node *prev = NULL; rb_node 151 fs/btrfs/extent_map.c struct rb_node *orig_prev = NULL; rb_node 156 fs/btrfs/extent_map.c entry = rb_entry(n, struct extent_map, rb_node); rb_node 172 fs/btrfs/extent_map.c prev_entry = rb_entry(prev, struct extent_map, rb_node); rb_node 179 fs/btrfs/extent_map.c prev_entry = rb_entry(prev, struct extent_map, rb_node); rb_node 182 fs/btrfs/extent_map.c prev_entry = rb_entry(prev, struct extent_map, rb_node); rb_node 234 fs/btrfs/extent_map.c struct rb_node *rb; rb_node 248 fs/btrfs/extent_map.c rb = rb_prev(&em->rb_node); rb_node 250 fs/btrfs/extent_map.c merge = rb_entry(rb, struct extent_map, rb_node); rb_node 261 fs/btrfs/extent_map.c rb_erase_cached(&merge->rb_node, &tree->map); rb_node 262 fs/btrfs/extent_map.c RB_CLEAR_NODE(&merge->rb_node); rb_node 267 fs/btrfs/extent_map.c rb = rb_next(&em->rb_node); rb_node 269 fs/btrfs/extent_map.c merge = rb_entry(rb, struct extent_map, rb_node); rb_node 273 fs/btrfs/extent_map.c rb_erase_cached(&merge->rb_node, &tree->map); rb_node 274 fs/btrfs/extent_map.c RB_CLEAR_NODE(&merge->rb_node); rb_node 418 fs/btrfs/extent_map.c struct rb_node *rb_node; rb_node 419 fs/btrfs/extent_map.c struct rb_node *prev = NULL; rb_node 420 fs/btrfs/extent_map.c struct rb_node *next = NULL; rb_node 423 fs/btrfs/extent_map.c rb_node = __tree_search(&tree->map.rb_root, start, &prev, &next); rb_node 424 fs/btrfs/extent_map.c if (!rb_node) { rb_node 426 fs/btrfs/extent_map.c rb_node = prev; rb_node 428 fs/btrfs/extent_map.c rb_node = next; rb_node 433 fs/btrfs/extent_map.c em = rb_entry(rb_node, struct extent_map, rb_node); rb_node 487 fs/btrfs/extent_map.c rb_erase_cached(&em->rb_node, &tree->map); rb_node 492 fs/btrfs/extent_map.c RB_CLEAR_NODE(&em->rb_node); rb_node 504 fs/btrfs/extent_map.c rb_replace_node_cached(&cur->rb_node, &new->rb_node, &tree->map); rb_node 505 fs/btrfs/extent_map.c RB_CLEAR_NODE(&cur->rb_node); rb_node 512 fs/btrfs/extent_map.c struct rb_node *next; rb_node 514 fs/btrfs/extent_map.c next = rb_next(&em->rb_node); rb_node 517 fs/btrfs/extent_map.c return container_of(next, struct extent_map, rb_node); rb_node 522 fs/btrfs/extent_map.c struct rb_node *prev; rb_node 524 fs/btrfs/extent_map.c prev = rb_prev(&em->rb_node); rb_node 527 fs/btrfs/extent_map.c return container_of(prev, struct extent_map, rb_node); rb_node 31 fs/btrfs/extent_map.h struct rb_node rb_node; rb_node 67 fs/btrfs/extent_map.h return !RB_EMPTY_NODE(&em->rb_node); rb_node 38 fs/btrfs/file.c struct rb_node rb_node; rb_node 86 fs/btrfs/file.c struct rb_node **p; rb_node 87 fs/btrfs/file.c struct rb_node *parent = NULL; rb_node 90 fs/btrfs/file.c p = &fs_info->defrag_inodes.rb_node; rb_node 93 fs/btrfs/file.c entry = rb_entry(parent, struct inode_defrag, rb_node); rb_node 113 fs/btrfs/file.c rb_link_node(&defrag->rb_node, parent, p); rb_node 114 fs/btrfs/file.c rb_insert_color(&defrag->rb_node, &fs_info->defrag_inodes); rb_node 215 fs/btrfs/file.c struct rb_node *p; rb_node 216 fs/btrfs/file.c struct rb_node *parent = NULL; rb_node 223 fs/btrfs/file.c p = fs_info->defrag_inodes.rb_node; rb_node 226 fs/btrfs/file.c entry = rb_entry(parent, struct inode_defrag, rb_node); rb_node 240 fs/btrfs/file.c entry = rb_entry(parent, struct inode_defrag, rb_node); rb_node 254 fs/btrfs/file.c struct rb_node *node; rb_node 260 fs/btrfs/file.c defrag = rb_entry(node, struct inode_defrag, rb_node); rb_node 640 fs/btrfs/free-space-cache.c struct rb_node *n; rb_node 929 fs/btrfs/free-space-cache.c struct rb_node *node = rb_first(&ctl->free_space_offset); rb_node 1450 fs/btrfs/free-space-cache.c struct rb_node *node, int bitmap) rb_node 1452 fs/btrfs/free-space-cache.c struct rb_node **p = &root->rb_node; rb_node 1453 fs/btrfs/free-space-cache.c struct rb_node *parent = NULL; rb_node 1511 fs/btrfs/free-space-cache.c struct rb_node *n = ctl->free_space_offset.rb_node; rb_node 1812 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 1817 fs/btrfs/free-space-cache.c if (!ctl->free_space_offset.rb_node) rb_node 1933 fs/btrfs/free-space-cache.c struct rb_node *next = rb_next(&bitmap_info->offset_index); rb_node 2073 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 2493 fs/btrfs/free-space-cache.c struct rb_node *n; rb_node 2546 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 2585 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 2756 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 2927 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 3200 fs/btrfs/free-space-cache.c struct rb_node *node; rb_node 3686 fs/btrfs/free-space-cache.c struct rb_node *n; rb_node 10 fs/btrfs/free-space-cache.h struct rb_node offset_index; rb_node 1144 fs/btrfs/free-space-tree.c struct rb_node *node; rb_node 257 fs/btrfs/inode-map.c struct rb_node *n; rb_node 299 fs/btrfs/inode-map.c struct rb_node *n; rb_node 2447 fs/btrfs/inode.c struct rb_node node; rb_node 2516 fs/btrfs/inode.c struct rb_node **p = &root->rb_node; rb_node 2517 fs/btrfs/inode.c struct rb_node *parent = NULL; rb_node 2932 fs/btrfs/inode.c struct rb_node *node; rb_node 4445 fs/btrfs/inode.c struct rb_node *node; rb_node 4446 fs/btrfs/inode.c struct rb_node *prev; rb_node 4456 fs/btrfs/inode.c node = root->inode_tree.rb_node; rb_node 4460 fs/btrfs/inode.c entry = rb_entry(node, struct btrfs_inode, rb_node); rb_node 4471 fs/btrfs/inode.c entry = rb_entry(prev, struct btrfs_inode, rb_node); rb_node 4480 fs/btrfs/inode.c entry = rb_entry(node, struct btrfs_inode, rb_node); rb_node 5428 fs/btrfs/inode.c struct rb_node *node; rb_node 5438 fs/btrfs/inode.c em = rb_entry(node, struct extent_map, rb_node); rb_node 5476 fs/btrfs/inode.c state = rb_entry(node, struct extent_state, rb_node); rb_node 5771 fs/btrfs/inode.c struct rb_node **p; rb_node 5772 fs/btrfs/inode.c struct rb_node *parent; rb_node 5773 fs/btrfs/inode.c struct rb_node *new = &BTRFS_I(inode)->rb_node; rb_node 5780 fs/btrfs/inode.c p = &root->inode_tree.rb_node; rb_node 5783 fs/btrfs/inode.c entry = rb_entry(parent, struct btrfs_inode, rb_node); rb_node 5809 fs/btrfs/inode.c if (!RB_EMPTY_NODE(&BTRFS_I(inode)->rb_node)) { rb_node 5810 fs/btrfs/inode.c rb_erase(&BTRFS_I(inode)->rb_node, &root->inode_tree); rb_node 5811 fs/btrfs/inode.c RB_CLEAR_NODE(&BTRFS_I(inode)->rb_node); rb_node 9432 fs/btrfs/inode.c RB_CLEAR_NODE(&ei->rb_node); rb_node 10739 fs/btrfs/inode.c struct rb_node **p; rb_node 10740 fs/btrfs/inode.c struct rb_node *parent = NULL; rb_node 10750 fs/btrfs/inode.c p = &fs_info->swapfile_pins.rb_node; rb_node 10777 fs/btrfs/inode.c struct rb_node *node, *next; rb_node 31 fs/btrfs/ordered-data.c static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset, rb_node 32 fs/btrfs/ordered-data.c struct rb_node *node) rb_node 34 fs/btrfs/ordered-data.c struct rb_node **p = &root->rb_node; rb_node 35 fs/btrfs/ordered-data.c struct rb_node *parent = NULL; rb_node 40 fs/btrfs/ordered-data.c entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node); rb_node 67 fs/btrfs/ordered-data.c static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset, rb_node 68 fs/btrfs/ordered-data.c struct rb_node **prev_ret) rb_node 70 fs/btrfs/ordered-data.c struct rb_node *n = root->rb_node; rb_node 71 fs/btrfs/ordered-data.c struct rb_node *prev = NULL; rb_node 72 fs/btrfs/ordered-data.c struct rb_node *test; rb_node 77 fs/btrfs/ordered-data.c entry = rb_entry(n, struct btrfs_ordered_extent, rb_node); rb_node 96 fs/btrfs/ordered-data.c rb_node); rb_node 104 fs/btrfs/ordered-data.c rb_node); rb_node 110 fs/btrfs/ordered-data.c rb_node); rb_node 141 fs/btrfs/ordered-data.c static inline struct rb_node *tree_search(struct btrfs_ordered_inode_tree *tree, rb_node 145 fs/btrfs/ordered-data.c struct rb_node *prev = NULL; rb_node 146 fs/btrfs/ordered-data.c struct rb_node *ret; rb_node 151 fs/btrfs/ordered-data.c rb_node); rb_node 181 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 220 fs/btrfs/ordered-data.c &entry->rb_node); rb_node 308 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 324 fs/btrfs/ordered-data.c entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); rb_node 378 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 396 fs/btrfs/ordered-data.c entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); rb_node 443 fs/btrfs/ordered-data.c ASSERT(RB_EMPTY_NODE(&entry->rb_node)); rb_node 467 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 482 fs/btrfs/ordered-data.c node = &entry->rb_node; rb_node 716 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 725 fs/btrfs/ordered-data.c entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); rb_node 742 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 755 fs/btrfs/ordered-data.c entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); rb_node 783 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 792 fs/btrfs/ordered-data.c entry = rb_entry(node, struct btrfs_ordered_extent, rb_node); rb_node 810 fs/btrfs/ordered-data.c struct rb_node *node; rb_node 811 fs/btrfs/ordered-data.c struct rb_node *prev = NULL; rb_node 866 fs/btrfs/ordered-data.c node = rb_prev(&ordered->rb_node); rb_node 875 fs/btrfs/ordered-data.c rb_node); rb_node 881 fs/btrfs/ordered-data.c test = rb_entry(node, struct btrfs_ordered_extent, rb_node); rb_node 13 fs/btrfs/ordered-data.h struct rb_node *last; rb_node 120 fs/btrfs/ordered-data.h struct rb_node rb_node; rb_node 173 fs/btrfs/qgroup.c struct rb_node *n = fs_info->qgroup_tree.rb_node; rb_node 192 fs/btrfs/qgroup.c struct rb_node **p = &fs_info->qgroup_tree.rb_node; rb_node 193 fs/btrfs/qgroup.c struct rb_node *parent = NULL; rb_node 516 fs/btrfs/qgroup.c struct rb_node *n; rb_node 1548 fs/btrfs/qgroup.c struct rb_node **p = &delayed_refs->dirty_extent_root.rb_node; rb_node 1549 fs/btrfs/qgroup.c struct rb_node *parent_node = NULL; rb_node 2513 fs/btrfs/qgroup.c struct rb_node *node; rb_node 3294 fs/btrfs/qgroup.c struct rb_node *n; rb_node 3847 fs/btrfs/qgroup.c struct rb_node **cur; rb_node 3848 fs/btrfs/qgroup.c struct rb_node *parent = NULL; rb_node 3897 fs/btrfs/qgroup.c cur = &blocks->blocks[level].rb_node; rb_node 3955 fs/btrfs/qgroup.c struct rb_node *node; rb_node 3972 fs/btrfs/qgroup.c node = blocks->blocks[level].rb_node; rb_node 107 fs/btrfs/qgroup.h struct rb_node node; rb_node 125 fs/btrfs/qgroup.h struct rb_node node; rb_node 218 fs/btrfs/qgroup.h struct rb_node node; /* tree of qgroups */ rb_node 22 fs/btrfs/ref-verify.c struct rb_node node; rb_node 36 fs/btrfs/ref-verify.c struct rb_node node; rb_node 71 fs/btrfs/ref-verify.c struct rb_node node; rb_node 78 fs/btrfs/ref-verify.c struct rb_node **p = &root->rb_node; rb_node 79 fs/btrfs/ref-verify.c struct rb_node *parent_node = NULL; rb_node 100 fs/btrfs/ref-verify.c struct rb_node *n; rb_node 103 fs/btrfs/ref-verify.c n = root->rb_node; rb_node 119 fs/btrfs/ref-verify.c struct rb_node **p = &root->rb_node; rb_node 120 fs/btrfs/ref-verify.c struct rb_node *parent_node = NULL; rb_node 164 fs/btrfs/ref-verify.c struct rb_node **p = &root->rb_node; rb_node 165 fs/btrfs/ref-verify.c struct rb_node *parent_node = NULL; rb_node 189 fs/btrfs/ref-verify.c struct rb_node *n; rb_node 192 fs/btrfs/ref-verify.c n = root->rb_node; rb_node 237 fs/btrfs/ref-verify.c struct rb_node *n; rb_node 636 fs/btrfs/ref-verify.c struct rb_node *n; rb_node 897 fs/btrfs/ref-verify.c struct rb_node *n; rb_node 916 fs/btrfs/ref-verify.c struct rb_node *n; rb_node 922 fs/btrfs/ref-verify.c n = fs_info->block_tree.rb_node; rb_node 30 fs/btrfs/relocation.c struct rb_node rb_node; rb_node 38 fs/btrfs/relocation.c struct rb_node rb_node; rb_node 118 fs/btrfs/relocation.c struct rb_node rb_node; rb_node 132 fs/btrfs/relocation.c struct rb_node rb_node; rb_node 248 fs/btrfs/relocation.c RB_CLEAR_NODE(&node->rb_node); rb_node 282 fs/btrfs/relocation.c static struct rb_node *tree_insert(struct rb_root *root, u64 bytenr, rb_node 283 fs/btrfs/relocation.c struct rb_node *node) rb_node 285 fs/btrfs/relocation.c struct rb_node **p = &root->rb_node; rb_node 286 fs/btrfs/relocation.c struct rb_node *parent = NULL; rb_node 291 fs/btrfs/relocation.c entry = rb_entry(parent, struct tree_entry, rb_node); rb_node 306 fs/btrfs/relocation.c static struct rb_node *tree_search(struct rb_root *root, u64 bytenr) rb_node 308 fs/btrfs/relocation.c struct rb_node *n = root->rb_node; rb_node 312 fs/btrfs/relocation.c entry = rb_entry(n, struct tree_entry, rb_node); rb_node 324 fs/btrfs/relocation.c static void backref_tree_panic(struct rb_node *rb_node, int errno, u64 bytenr) rb_node 328 fs/btrfs/relocation.c struct backref_node *bnode = rb_entry(rb_node, struct backref_node, rb_node 329 fs/btrfs/relocation.c rb_node); rb_node 410 fs/btrfs/relocation.c if (!RB_EMPTY_NODE(&node->rb_node)) rb_node 411 fs/btrfs/relocation.c rb_erase(&node->rb_node, &tree->rb_root); rb_node 436 fs/btrfs/relocation.c if (RB_EMPTY_NODE(&upper->rb_node)) { rb_node 459 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 460 fs/btrfs/relocation.c rb_erase(&node->rb_node, &cache->rb_root); rb_node 462 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, node->bytenr, &node->rb_node); rb_node 463 fs/btrfs/relocation.c if (rb_node) rb_node 464 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, bytenr); rb_node 581 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 586 fs/btrfs/relocation.c rb_node = tree_search(&rc->reloc_root_tree.rb_root, bytenr); rb_node 587 fs/btrfs/relocation.c if (rb_node) { rb_node 588 fs/btrfs/relocation.c node = rb_entry(rb_node, struct mapping_node, rb_node); rb_node 697 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 848 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, key.offset); rb_node 849 fs/btrfs/relocation.c if (!rb_node) { rb_node 864 fs/btrfs/relocation.c upper = rb_entry(rb_node, struct backref_node, rb_node 865 fs/btrfs/relocation.c rb_node); rb_node 958 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, eb->start); rb_node 959 fs/btrfs/relocation.c if (!rb_node) { rb_node 998 fs/btrfs/relocation.c upper = rb_entry(rb_node, struct backref_node, rb_node 999 fs/btrfs/relocation.c rb_node); rb_node 1009 fs/btrfs/relocation.c if (rb_node) rb_node 1047 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, node->bytenr, rb_node 1048 fs/btrfs/relocation.c &node->rb_node); rb_node 1049 fs/btrfs/relocation.c if (rb_node) rb_node 1050 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, node->bytenr); rb_node 1070 fs/btrfs/relocation.c if (!RB_EMPTY_NODE(&upper->rb_node)) { rb_node 1096 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, upper->bytenr, rb_node 1097 fs/btrfs/relocation.c &upper->rb_node); rb_node 1098 fs/btrfs/relocation.c if (rb_node) rb_node 1099 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, rb_node 1140 fs/btrfs/relocation.c rb_erase(&upper->rb_node, &cache->rb_root); rb_node 1167 fs/btrfs/relocation.c RB_EMPTY_NODE(&lower->rb_node)) rb_node 1170 fs/btrfs/relocation.c if (!RB_EMPTY_NODE(&upper->rb_node)) rb_node 1212 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 1217 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, src->commit_root->start); rb_node 1218 fs/btrfs/relocation.c if (rb_node) { rb_node 1219 fs/btrfs/relocation.c node = rb_entry(rb_node, struct backref_node, rb_node); rb_node 1227 fs/btrfs/relocation.c rb_node = tree_search(&cache->rb_root, rb_node 1229 fs/btrfs/relocation.c if (rb_node) { rb_node 1230 fs/btrfs/relocation.c node = rb_entry(rb_node, struct backref_node, rb_node 1231 fs/btrfs/relocation.c rb_node); rb_node 1264 fs/btrfs/relocation.c rb_node = tree_insert(&cache->rb_root, new_node->bytenr, rb_node 1265 fs/btrfs/relocation.c &new_node->rb_node); rb_node 1266 fs/btrfs/relocation.c if (rb_node) rb_node 1267 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, new_node->bytenr); rb_node 1293 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 1305 fs/btrfs/relocation.c rb_node = tree_insert(&rc->reloc_root_tree.rb_root, rb_node 1306 fs/btrfs/relocation.c node->bytenr, &node->rb_node); rb_node 1308 fs/btrfs/relocation.c if (rb_node) { rb_node 1325 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 1331 fs/btrfs/relocation.c rb_node = tree_search(&rc->reloc_root_tree.rb_root, rb_node 1333 fs/btrfs/relocation.c if (rb_node) { rb_node 1334 fs/btrfs/relocation.c node = rb_entry(rb_node, struct mapping_node, rb_node); rb_node 1335 fs/btrfs/relocation.c rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); rb_node 1336 fs/btrfs/relocation.c RB_CLEAR_NODE(&node->rb_node); rb_node 1357 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 1362 fs/btrfs/relocation.c rb_node = tree_search(&rc->reloc_root_tree.rb_root, rb_node 1364 fs/btrfs/relocation.c if (rb_node) { rb_node 1365 fs/btrfs/relocation.c node = rb_entry(rb_node, struct mapping_node, rb_node); rb_node 1366 fs/btrfs/relocation.c rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root); rb_node 1376 fs/btrfs/relocation.c rb_node = tree_insert(&rc->reloc_root_tree.rb_root, rb_node 1377 fs/btrfs/relocation.c node->bytenr, &node->rb_node); rb_node 1379 fs/btrfs/relocation.c if (rb_node) rb_node 1380 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, node->bytenr); rb_node 1553 fs/btrfs/relocation.c struct rb_node *node; rb_node 1554 fs/btrfs/relocation.c struct rb_node *prev; rb_node 1560 fs/btrfs/relocation.c node = root->inode_tree.rb_node; rb_node 1564 fs/btrfs/relocation.c entry = rb_entry(node, struct btrfs_inode, rb_node); rb_node 1575 fs/btrfs/relocation.c entry = rb_entry(prev, struct btrfs_inode, rb_node); rb_node 1584 fs/btrfs/relocation.c entry = rb_entry(node, struct btrfs_inode, rb_node); rb_node 2587 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 2588 fs/btrfs/relocation.c while ((rb_node = rb_first(blocks))) { rb_node 2589 fs/btrfs/relocation.c block = rb_entry(rb_node, struct tree_block, rb_node); rb_node 2590 fs/btrfs/relocation.c rb_erase(rb_node, blocks); rb_node 3155 fs/btrfs/relocation.c rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { rb_node 3161 fs/btrfs/relocation.c rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { rb_node 3170 fs/btrfs/relocation.c rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { rb_node 3456 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 3497 fs/btrfs/relocation.c rb_node = tree_insert(blocks, block->bytenr, &block->rb_node); rb_node 3498 fs/btrfs/relocation.c if (rb_node) rb_node 3499 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, block->bytenr); rb_node 3659 fs/btrfs/relocation.c struct rb_node *rb_node; rb_node 3724 fs/btrfs/relocation.c rb_node = tree_search(blocks, leaf->start); rb_node 3725 fs/btrfs/relocation.c if (rb_node) { rb_node 3750 fs/btrfs/relocation.c rb_node = tree_search(blocks, leaf->start); rb_node 3751 fs/btrfs/relocation.c if (rb_node) { rb_node 3794 fs/btrfs/relocation.c rb_node = tree_insert(blocks, block->bytenr, rb_node 3795 fs/btrfs/relocation.c &block->rb_node); rb_node 3796 fs/btrfs/relocation.c if (rb_node) rb_node 3797 fs/btrfs/relocation.c backref_tree_panic(rb_node, -EEXIST, rb_node 203 fs/btrfs/scrub.c struct rb_node node; rb_node 323 fs/btrfs/scrub.c struct rb_node **p; rb_node 324 fs/btrfs/scrub.c struct rb_node *parent = NULL; rb_node 330 fs/btrfs/scrub.c p = &locks_root->root.rb_node; rb_node 369 fs/btrfs/scrub.c struct rb_node *node; rb_node 374 fs/btrfs/scrub.c node = locks_root->root.rb_node; rb_node 223 fs/btrfs/send.c struct rb_node node; rb_node 232 fs/btrfs/send.c struct rb_node node; rb_node 244 fs/btrfs/send.c struct rb_node node; rb_node 2861 fs/btrfs/send.c struct rb_node **p = &sctx->orphan_dirs.rb_node; rb_node 2862 fs/btrfs/send.c struct rb_node *parent = NULL; rb_node 2892 fs/btrfs/send.c struct rb_node *n = sctx->orphan_dirs.rb_node; rb_node 3029 fs/btrfs/send.c struct rb_node **p = &sctx->waiting_dir_moves.rb_node; rb_node 3030 fs/btrfs/send.c struct rb_node *parent = NULL; rb_node 3061 fs/btrfs/send.c struct rb_node *n = sctx->waiting_dir_moves.rb_node; rb_node 3093 fs/btrfs/send.c struct rb_node **p = &sctx->pending_dir_moves.rb_node; rb_node 3094 fs/btrfs/send.c struct rb_node *parent = NULL; rb_node 3156 fs/btrfs/send.c struct rb_node *n = sctx->pending_dir_moves.rb_node; rb_node 7309 fs/btrfs/send.c struct rb_node *n; rb_node 7326 fs/btrfs/send.c struct rb_node *n; rb_node 7337 fs/btrfs/send.c struct rb_node *n; rb_node 13 fs/btrfs/tests/extent-map-tests.c struct rb_node *node; rb_node 17 fs/btrfs/tests/extent-map-tests.c em = rb_entry(node, struct extent_map, rb_node); rb_node 120 fs/btrfs/ulist.c struct rb_node *n = ulist->root.rb_node; rb_node 124 fs/btrfs/ulist.c u = rb_entry(n, struct ulist_node, rb_node); rb_node 137 fs/btrfs/ulist.c rb_erase(&node->rb_node, &ulist->root); rb_node 146 fs/btrfs/ulist.c struct rb_node **p = &ulist->root.rb_node; rb_node 147 fs/btrfs/ulist.c struct rb_node *parent = NULL; rb_node 152 fs/btrfs/ulist.c cur = rb_entry(parent, struct ulist_node, rb_node); rb_node 161 fs/btrfs/ulist.c rb_link_node(&ins->rb_node, parent, p); rb_node 162 fs/btrfs/ulist.c rb_insert_color(&ins->rb_node, &ulist->root); rb_node 32 fs/btrfs/ulist.h struct rb_node rb_node; /* used to speed up search */ rb_node 1866 fs/btrfs/volumes.c struct rb_node *n; rb_node 1873 fs/btrfs/volumes.c em = rb_entry(n, struct extent_map, rb_node); rb_node 7796 fs/btrfs/volumes.c struct rb_node *node; rb_node 7801 fs/btrfs/volumes.c em = rb_entry(node, struct extent_map, rb_node); rb_node 7914 fs/btrfs/volumes.c struct rb_node *node; rb_node 7917 fs/btrfs/volumes.c node = fs_info->swapfile_pins.rb_node; rb_node 141 fs/cachefiles/daemon.c ASSERT(!cache->active_nodes.rb_node); rb_node 47 fs/cachefiles/internal.h struct rb_node active_node; /* link in active tree (dentry is key) */ rb_node 89 fs/cachefiles/namei.c struct rb_node *p; rb_node 95 fs/cachefiles/namei.c p = cache->active_nodes.rb_node; rb_node 140 fs/cachefiles/namei.c struct rb_node **_p, *_parent = NULL; rb_node 157 fs/cachefiles/namei.c _p = &cache->active_nodes.rb_node; rb_node 868 fs/cachefiles/namei.c struct rb_node *_n; rb_node 901 fs/cachefiles/namei.c _n = cache->active_nodes.rb_node; rb_node 1820 fs/ceph/addr.c struct rb_node **p, *parent; rb_node 1827 fs/ceph/addr.c p = &mdsc->pool_perm_tree.rb_node; rb_node 1859 fs/ceph/addr.c p = &mdsc->pool_perm_tree.rb_node; rb_node 2056 fs/ceph/addr.c struct rb_node *n; rb_node 436 fs/ceph/caps.c struct rb_node *n = ci->i_caps.rb_node; rb_node 466 fs/ceph/caps.c struct rb_node **p = &ci->i_caps.rb_node; rb_node 467 fs/ceph/caps.c struct rb_node *parent = NULL; rb_node 794 fs/ceph/caps.c struct rb_node *p; rb_node 827 fs/ceph/caps.c struct rb_node *p; rb_node 868 fs/ceph/caps.c struct rb_node *p; rb_node 901 fs/ceph/caps.c struct rb_node *q; rb_node 928 fs/ceph/caps.c struct rb_node *p; rb_node 991 fs/ceph/caps.c struct rb_node *p; rb_node 1242 fs/ceph/caps.c struct rb_node *p; rb_node 1830 fs/ceph/caps.c struct rb_node *p; rb_node 54 fs/ceph/debugfs.c struct rb_node *rp; rb_node 118 fs/ceph/inode.c struct rb_node **p; rb_node 119 fs/ceph/inode.c struct rb_node *parent = NULL; rb_node 123 fs/ceph/inode.c p = &ci->i_fragtree.rb_node; rb_node 158 fs/ceph/inode.c struct rb_node *n = ci->i_fragtree.rb_node; rb_node 325 fs/ceph/inode.c struct rb_node *rb_node; rb_node 340 fs/ceph/inode.c rb_node = rb_first(&ci->i_fragtree); rb_node 341 fs/ceph/inode.c frag = rb_entry(rb_node, struct ceph_inode_frag, node); rb_node 342 fs/ceph/inode.c if (frag->frag != ceph_frag_make(0, 0) || rb_next(rb_node)) rb_node 359 fs/ceph/inode.c rb_node = rb_first(&ci->i_fragtree); rb_node 370 fs/ceph/inode.c while (rb_node) { rb_node 371 fs/ceph/inode.c frag = rb_entry(rb_node, struct ceph_inode_frag, node); rb_node 376 fs/ceph/inode.c rb_node = rb_next(rb_node); rb_node 379 fs/ceph/inode.c rb_node = rb_next(rb_node); rb_node 401 fs/ceph/inode.c while (rb_node) { rb_node 402 fs/ceph/inode.c frag = rb_entry(rb_node, struct ceph_inode_frag, node); rb_node 403 fs/ceph/inode.c rb_node = rb_next(rb_node); rb_node 535 fs/ceph/inode.c struct rb_node *n; rb_node 809 fs/ceph/mds_client.c struct rb_node *p = rb_next(&req->r_node); rb_node 1274 fs/ceph/mds_client.c struct rb_node *p; rb_node 2647 fs/ceph/mds_client.c struct rb_node *p = rb_first(&mdsc->request_tree); rb_node 3213 fs/ceph/mds_client.c struct rb_node *p; rb_node 3505 fs/ceph/mds_client.c struct rb_node *p; rb_node 4257 fs/ceph/mds_client.c struct rb_node *n; rb_node 224 fs/ceph/mds_client.h struct rb_node r_node; rb_node 315 fs/ceph/mds_client.h struct rb_node node; rb_node 323 fs/ceph/mds_client.h struct rb_node node; rb_node 336 fs/ceph/mds_client.h struct rb_node node; rb_node 85 fs/ceph/quota.c struct rb_node **node, *parent = NULL; rb_node 88 fs/ceph/quota.c node = &(mdsc->quotarealms_inodes.rb_node); rb_node 177 fs/ceph/quota.c struct rb_node *node; rb_node 86 fs/ceph/snap.c struct rb_node **p = &root->rb_node; rb_node 87 fs/ceph/snap.c struct rb_node *parent = NULL; rb_node 143 fs/ceph/snap.c struct rb_node *n = mdsc->snap_realms.rb_node; rb_node 1014 fs/ceph/snap.c struct rb_node **p, *parent; rb_node 1019 fs/ceph/snap.c p = &mdsc->snapid_map_tree.rb_node; rb_node 1055 fs/ceph/snap.c p = &mdsc->snapid_map_tree.rb_node; rb_node 1138 fs/ceph/snap.c struct rb_node *p; rb_node 148 fs/ceph/super.h struct rb_node ci_node; /* per-ci cap tree */ rb_node 238 fs/ceph/super.h struct rb_node node; rb_node 255 fs/ceph/super.h struct rb_node node; rb_node 801 fs/ceph/super.h struct rb_node node; rb_node 439 fs/ceph/xattr.c struct rb_node **p; rb_node 440 fs/ceph/xattr.c struct rb_node *parent = NULL; rb_node 445 fs/ceph/xattr.c p = &ci->i_xattrs.index.rb_node; rb_node 535 fs/ceph/xattr.c struct rb_node **p; rb_node 536 fs/ceph/xattr.c struct rb_node *parent = NULL; rb_node 541 fs/ceph/xattr.c p = &ci->i_xattrs.index.rb_node; rb_node 600 fs/ceph/xattr.c struct rb_node *p; rb_node 623 fs/ceph/xattr.c struct rb_node *p, *tmp; rb_node 764 fs/ceph/xattr.c struct rb_node *p; rb_node 1131 fs/cifs/cifsglob.h struct rb_node tl_rbnode; rb_node 5167 fs/cifs/connect.c struct rb_node *node; rb_node 5337 fs/cifs/connect.c struct rb_node *node = root->rb_node; rb_node 5357 fs/cifs/connect.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 5473 fs/cifs/connect.c struct rb_node *node; rb_node 5474 fs/cifs/connect.c struct rb_node *tmp; rb_node 422 fs/dlm/debug_fs.c struct rb_node *node; rb_node 504 fs/dlm/debug_fs.c struct rb_node *next; rb_node 310 fs/dlm/dlm_internal.h struct rb_node res_hashnode; /* rsbtbl */ rb_node 416 fs/dlm/lock.c memset(&r->res_hashnode, 0, sizeof(struct rb_node)); rb_node 448 fs/dlm/lock.c struct rb_node *node = tree->rb_node; rb_node 472 fs/dlm/lock.c struct rb_node **newn = &tree->rb_node; rb_node 473 fs/dlm/lock.c struct rb_node *parent = NULL; rb_node 1085 fs/dlm/lock.c struct rb_node *n; rb_node 1650 fs/dlm/lock.c struct rb_node *n, *next; rb_node 5473 fs/dlm/lock.c struct rb_node *n; rb_node 523 fs/dlm/lockspace.c ls->ls_rsbtbl[i].keep.rb_node = NULL; rb_node 524 fs/dlm/lockspace.c ls->ls_rsbtbl[i].toss.rb_node = NULL; rb_node 768 fs/dlm/lockspace.c struct rb_node *n; rb_node 895 fs/dlm/recover.c struct rb_node *n; rb_node 937 fs/dlm/recover.c struct rb_node *n, *next; rb_node 140 fs/eventpoll.c struct rb_node rbn; rb_node 814 fs/eventpoll.c struct rb_node *rbp; rb_node 950 fs/eventpoll.c struct rb_node *rbp; rb_node 1051 fs/eventpoll.c struct rb_node *rbp; rb_node 1056 fs/eventpoll.c for (rbp = ep->rbr.rb_root.rb_node; rbp; ) { rb_node 1075 fs/eventpoll.c struct rb_node *rbp; rb_node 1341 fs/eventpoll.c struct rb_node **p = &ep->rbr.rb_root.rb_node, *parent = NULL; rb_node 1968 fs/eventpoll.c struct rb_node *rbp; rb_node 204 fs/ext2/balloc.c struct rb_node *n; rb_node 295 fs/ext2/balloc.c struct rb_node *n = root->rb_node; rb_node 335 fs/ext2/balloc.c struct rb_node *node = &rsv->rsv_node; rb_node 338 fs/ext2/balloc.c struct rb_node ** p = &root->rb_node; rb_node 339 fs/ext2/balloc.c struct rb_node * parent = NULL; rb_node 783 fs/ext2/balloc.c struct rb_node *next; rb_node 1044 fs/ext2/balloc.c struct rb_node *next; rb_node 36 fs/ext2/ext2.h struct rb_node rsv_node; rb_node 24 fs/ext4/block_validity.c struct rb_node node; rb_node 72 fs/ext4/block_validity.c struct rb_node **n = &system_blks->root.rb_node, *node; rb_node 73 fs/ext4/block_validity.c struct rb_node *parent = NULL, *new_node = NULL; rb_node 134 fs/ext4/block_validity.c struct rb_node *node; rb_node 161 fs/ext4/block_validity.c struct rb_node *n; rb_node 173 fs/ext4/block_validity.c n = system_blks->root.rb_node; rb_node 391 fs/ext4/dir.c struct rb_node rb_hash; rb_node 449 fs/ext4/dir.c struct rb_node **p, *parent = NULL; rb_node 455 fs/ext4/dir.c p = &info->root.rb_node; rb_node 2175 fs/ext4/ext4.h struct rb_node *curr_node; rb_node 181 fs/ext4/extents_status.c struct rb_node *node; rb_node 188 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 213 fs/ext4/extents_status.c struct rb_node *node = root->rb_node; rb_node 217 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 230 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 231 fs/ext4/extents_status.c return node ? rb_entry(node, struct extent_status, rb_node) : rb_node 263 fs/ext4/extents_status.c struct rb_node *node; rb_node 286 fs/ext4/extents_status.c while ((node = rb_next(&es1->rb_node)) != NULL) { rb_node 287 fs/ext4/extents_status.c es1 = rb_entry(node, struct extent_status, rb_node); rb_node 533 fs/ext4/extents_status.c struct rb_node *node; rb_node 535 fs/ext4/extents_status.c node = rb_prev(&es->rb_node); rb_node 539 fs/ext4/extents_status.c es1 = rb_entry(node, struct extent_status, rb_node); rb_node 544 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); rb_node 557 fs/ext4/extents_status.c struct rb_node *node; rb_node 559 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 563 fs/ext4/extents_status.c es1 = rb_entry(node, struct extent_status, rb_node); rb_node 751 fs/ext4/extents_status.c struct rb_node **p = &tree->root.rb_node; rb_node 752 fs/ext4/extents_status.c struct rb_node *parent = NULL; rb_node 757 fs/ext4/extents_status.c es = rb_entry(parent, struct extent_status, rb_node); rb_node 792 fs/ext4/extents_status.c rb_link_node(&es->rb_node, parent, p); rb_node 793 fs/ext4/extents_status.c rb_insert_color(&es->rb_node, &tree->root); rb_node 908 fs/ext4/extents_status.c struct rb_node *node; rb_node 929 fs/ext4/extents_status.c node = tree->root.rb_node; rb_node 931 fs/ext4/extents_status.c es1 = rb_entry(node, struct extent_status, rb_node); rb_node 953 fs/ext4/extents_status.c node = rb_next(&es1->rb_node); rb_node 956 fs/ext4/extents_status.c rb_node); rb_node 996 fs/ext4/extents_status.c struct rb_node *node; rb_node 1011 fs/ext4/extents_status.c node = rb_prev(&es->rb_node); rb_node 1014 fs/ext4/extents_status.c rb_node) : NULL; rb_node 1119 fs/ext4/extents_status.c struct rb_node *node = root->rb_node; rb_node 1123 fs/ext4/extents_status.c pr = rb_entry(node, struct pending_reservation, rb_node); rb_node 1134 fs/ext4/extents_status.c node = rb_next(&pr->rb_node); rb_node 1136 fs/ext4/extents_status.c rb_node) : NULL; rb_node 1164 fs/ext4/extents_status.c struct rb_node *node; rb_node 1195 fs/ext4/extents_status.c node = rb_prev(&es->rb_node); rb_node 1198 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 1204 fs/ext4/extents_status.c node = rb_next(&right_es->rb_node); rb_node 1206 fs/ext4/extents_status.c rb_node) : NULL; rb_node 1215 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 1219 fs/ext4/extents_status.c rb_node); rb_node 1258 fs/ext4/extents_status.c node = rb_next(&pr->rb_node); rb_node 1259 fs/ext4/extents_status.c rb_erase(&pr->rb_node, &tree->root); rb_node 1264 fs/ext4/extents_status.c rb_node); rb_node 1289 fs/ext4/extents_status.c struct rb_node *node; rb_node 1364 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 1366 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 1374 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 1375 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); rb_node 1381 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 1677 fs/ext4/extents_status.c struct rb_node *node; rb_node 1690 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 1702 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); rb_node 1708 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 1750 fs/ext4/extents_status.c struct rb_node *node; rb_node 1757 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 1760 fs/ext4/extents_status.c rb_erase(&es->rb_node, &tree->root); rb_node 1772 fs/ext4/extents_status.c struct rb_node *node; rb_node 1779 fs/ext4/extents_status.c pr = rb_entry(node, struct pending_reservation, rb_node); rb_node 1822 fs/ext4/extents_status.c struct rb_node *node; rb_node 1826 fs/ext4/extents_status.c node = (&tree->root)->rb_node; rb_node 1829 fs/ext4/extents_status.c pr = rb_entry(node, struct pending_reservation, rb_node); rb_node 1854 fs/ext4/extents_status.c struct rb_node **p = &tree->root.rb_node; rb_node 1855 fs/ext4/extents_status.c struct rb_node *parent = NULL; rb_node 1864 fs/ext4/extents_status.c pr = rb_entry(parent, struct pending_reservation, rb_node); rb_node 1883 fs/ext4/extents_status.c rb_link_node(&pr->rb_node, parent, p); rb_node 1884 fs/ext4/extents_status.c rb_insert_color(&pr->rb_node, &tree->root); rb_node 1908 fs/ext4/extents_status.c rb_erase(&pr->rb_node, &tree->root); rb_node 2026 fs/ext4/extents_status.c struct rb_node *node; rb_node 2054 fs/ext4/extents_status.c node = rb_next(&es->rb_node); rb_node 2057 fs/ext4/extents_status.c es = rb_entry(node, struct extent_status, rb_node); rb_node 60 fs/ext4/extents_status.h struct rb_node rb_node; rb_node 118 fs/ext4/extents_status.h struct rb_node rb_node; rb_node 2834 fs/ext4/mballoc.c if (!db->bb_free_root.rb_node) { rb_node 3516 fs/ext4/mballoc.c struct rb_node *n; rb_node 4656 fs/ext4/mballoc.c struct rb_node **n = &db->bb_free_root.rb_node, *node; rb_node 4657 fs/ext4/mballoc.c struct rb_node *parent = NULL, *new_node; rb_node 86 fs/ext4/mballoc.h struct rb_node efd_node; rb_node 33 fs/f2fs/extent_cache.c struct rb_node *node = root->rb_root.rb_node; rb_node 37 fs/f2fs/extent_cache.c re = rb_entry(node, struct rb_entry, rb_node); rb_node 61 fs/f2fs/extent_cache.c struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi, rb_node 63 fs/f2fs/extent_cache.c struct rb_node **parent, rb_node 66 fs/f2fs/extent_cache.c struct rb_node **p = &root->rb_root.rb_node; rb_node 71 fs/f2fs/extent_cache.c re = rb_entry(*parent, struct rb_entry, rb_node); rb_node 100 fs/f2fs/extent_cache.c struct rb_node ***insert_p, rb_node 101 fs/f2fs/extent_cache.c struct rb_node **insert_parent, rb_node 104 fs/f2fs/extent_cache.c struct rb_node **pnode = &root->rb_root.rb_node; rb_node 105 fs/f2fs/extent_cache.c struct rb_node *parent = NULL, *tmp_node; rb_node 126 fs/f2fs/extent_cache.c re = rb_entry(*pnode, struct rb_entry, rb_node); rb_node 142 fs/f2fs/extent_cache.c re = rb_entry(parent, struct rb_entry, rb_node); rb_node 146 fs/f2fs/extent_cache.c *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); rb_node 151 fs/f2fs/extent_cache.c *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); rb_node 157 fs/f2fs/extent_cache.c tmp_node = rb_prev(&re->rb_node); rb_node 158 fs/f2fs/extent_cache.c *prev_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); rb_node 162 fs/f2fs/extent_cache.c tmp_node = rb_next(&re->rb_node); rb_node 163 fs/f2fs/extent_cache.c *next_entry = rb_entry_safe(tmp_node, struct rb_entry, rb_node); rb_node 172 fs/f2fs/extent_cache.c struct rb_node *cur = rb_first_cached(root), *next; rb_node 183 fs/f2fs/extent_cache.c cur_re = rb_entry(cur, struct rb_entry, rb_node); rb_node 184 fs/f2fs/extent_cache.c next_re = rb_entry(next, struct rb_entry, rb_node); rb_node 204 fs/f2fs/extent_cache.c struct rb_node *parent, struct rb_node **p, rb_node 217 fs/f2fs/extent_cache.c rb_link_node(&en->rb_node, parent, p); rb_node 218 fs/f2fs/extent_cache.c rb_insert_color_cached(&en->rb_node, &et->root, leftmost); rb_node 227 fs/f2fs/extent_cache.c rb_erase_cached(&en->rb_node, &et->root); rb_node 287 fs/f2fs/extent_cache.c struct rb_node **p = &et->root.rb_root.rb_node; rb_node 302 fs/f2fs/extent_cache.c struct rb_node *node, *next; rb_node 309 fs/f2fs/extent_cache.c en = rb_entry(node, struct extent_node, rb_node); rb_node 463 fs/f2fs/extent_cache.c struct rb_node **insert_p, rb_node 464 fs/f2fs/extent_cache.c struct rb_node *insert_parent, rb_node 467 fs/f2fs/extent_cache.c struct rb_node **p; rb_node 468 fs/f2fs/extent_cache.c struct rb_node *parent = NULL; rb_node 504 fs/f2fs/extent_cache.c struct rb_node **insert_p = NULL, *insert_parent = NULL; rb_node 576 fs/f2fs/extent_cache.c struct rb_node *node = rb_next(&en->rb_node); rb_node 579 fs/f2fs/extent_cache.c rb_node); rb_node 287 fs/f2fs/f2fs.h struct rb_node rb_node; /* rb node located in rb-tree */ rb_node 568 fs/f2fs/f2fs.h struct rb_node rb_node; /* rb node located in rb-tree */ rb_node 580 fs/f2fs/f2fs.h struct rb_node rb_node; /* rb node located in rb-tree */ rb_node 3533 fs/f2fs/f2fs.h struct rb_node **f2fs_lookup_rb_tree_for_insert(struct f2fs_sb_info *sbi, rb_node 3535 fs/f2fs/f2fs.h struct rb_node **parent, rb_node 3540 fs/f2fs/f2fs.h struct rb_node ***insert_p, struct rb_node **insert_parent, rb_node 969 fs/f2fs/segment.c struct rb_node *parent, struct rb_node **p, rb_node 977 fs/f2fs/segment.c rb_link_node(&dc->rb_node, parent, p); rb_node 978 fs/f2fs/segment.c rb_insert_color_cached(&dc->rb_node, &dcc->root, leftmost); rb_node 990 fs/f2fs/segment.c rb_erase_cached(&dc->rb_node, &dcc->root); rb_node 1223 fs/f2fs/segment.c struct rb_node **insert_p, rb_node 1224 fs/f2fs/segment.c struct rb_node *insert_parent) rb_node 1227 fs/f2fs/segment.c struct rb_node **p; rb_node 1228 fs/f2fs/segment.c struct rb_node *parent = NULL; rb_node 1300 fs/f2fs/segment.c struct rb_node **insert_p = NULL, *insert_parent = NULL; rb_node 1322 fs/f2fs/segment.c struct rb_node *node; rb_node 1378 fs/f2fs/segment.c node = rb_next(&prev_dc->rb_node); rb_node 1379 fs/f2fs/segment.c next_dc = rb_entry_safe(node, struct discard_cmd, rb_node); rb_node 1409 fs/f2fs/segment.c struct rb_node **insert_p = NULL, *insert_parent = NULL; rb_node 1428 fs/f2fs/segment.c struct rb_node *node; rb_node 1445 fs/f2fs/segment.c node = rb_next(&dc->rb_node); rb_node 1448 fs/f2fs/segment.c dc = rb_entry_safe(node, struct discard_cmd, rb_node); rb_node 2749 fs/f2fs/segment.c struct rb_node **insert_p = NULL, *insert_parent = NULL; rb_node 2774 fs/f2fs/segment.c struct rb_node *node; rb_node 2800 fs/f2fs/segment.c node = rb_next(&dc->rb_node); rb_node 2803 fs/f2fs/segment.c dc = rb_entry_safe(node, struct discard_cmd, rb_node); rb_node 45 fs/fscache/object-list.c struct rb_node **p = &fscache_object_list.rb_node, *parent = NULL; rb_node 91 fs/fscache/object-list.c struct rb_node *p; rb_node 106 fs/fscache/object-list.c p = fscache_object_list.rb_node; rb_node 2057 fs/fuse/dev.c struct rb_node *p; rb_node 2928 fs/fuse/file.c static struct rb_node **fuse_find_polled_node(struct fuse_conn *fc, u64 kh, rb_node 2929 fs/fuse/file.c struct rb_node **parent_out) rb_node 2931 fs/fuse/file.c struct rb_node **link = &fc->polled_files.rb_node; rb_node 2932 fs/fuse/file.c struct rb_node *last = NULL; rb_node 2964 fs/fuse/file.c struct rb_node **link, *uninitialized_var(parent); rb_node 3026 fs/fuse/file.c struct rb_node **link; rb_node 212 fs/fuse/fuse_i.h struct rb_node polled_node; rb_node 97 fs/gfs2/incore.h struct rb_node rd_node; /* Link with superblock */ rb_node 309 fs/gfs2/incore.h struct rb_node rs_node; /* link to other block reservations */ rb_node 98 fs/gfs2/ops_fstype.c sdp->sd_rindex_tree.rb_node = NULL; rb_node 510 fs/gfs2/rgrp.c struct rb_node *n, *next; rb_node 514 fs/gfs2/rgrp.c n = sdp->sd_rindex_tree.rb_node; rb_node 548 fs/gfs2/rgrp.c const struct rb_node *n; rb_node 569 fs/gfs2/rgrp.c const struct rb_node *n; rb_node 709 fs/gfs2/rgrp.c struct rb_node *n; rb_node 722 fs/gfs2/rgrp.c struct rb_node *n; rb_node 868 fs/gfs2/rgrp.c struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL; rb_node 1491 fs/gfs2/rgrp.c struct rb_node **newn, *parent = NULL; rb_node 1500 fs/gfs2/rgrp.c newn = &rgd->rd_rstree.rb_node; rb_node 1621 fs/gfs2/rgrp.c struct rb_node *n; rb_node 1625 fs/gfs2/rgrp.c n = rgd->rd_rstree.rb_node; rb_node 2260 fs/gfs2/rgrp.c const struct rb_node *n; rb_node 124 fs/jffs2/nodelist.c struct rb_node *parent = &base->rb; rb_node 125 fs/jffs2/nodelist.c struct rb_node **link = &parent; rb_node 193 fs/jffs2/nodelist.c rb_link_node(&holefrag->rb, NULL, &root->rb_node); rb_node 207 fs/jffs2/nodelist.c rb_link_node(&newfrag->rb, NULL, &root->rb_node); rb_node 528 fs/jffs2/nodelist.c struct rb_node *next; rb_node 534 fs/jffs2/nodelist.c next = fragtree->rb_node; rb_node 230 fs/jffs2/nodelist.h struct rb_node rb; rb_node 271 fs/jffs2/nodelist.h struct rb_node rb; rb_node 329 fs/jffs2/nodelist.h struct rb_node *node = rb_first(root); rb_node 339 fs/jffs2/nodelist.h struct rb_node *node = rb_last(root); rb_node 177 fs/jffs2/readinode.c struct rb_node *next; rb_node 182 fs/jffs2/readinode.c next = tn_root->rb_node; rb_node 338 fs/jffs2/readinode.c struct rb_node *parent; rb_node 339 fs/jffs2/readinode.c struct rb_node **link = &rii->tn_root.rb_node; rb_node 402 fs/jffs2/readinode.c static void eat_last(struct rb_root *root, struct rb_node *node) rb_node 404 fs/jffs2/readinode.c struct rb_node *parent = rb_parent(node); rb_node 405 fs/jffs2/readinode.c struct rb_node **link; rb_node 411 fs/jffs2/readinode.c link = &root->rb_node; rb_node 426 fs/jffs2/readinode.c struct rb_node **link = &ver_root->rb_node; rb_node 427 fs/jffs2/readinode.c struct rb_node *parent = NULL; rb_node 350 fs/kernfs/dir.c struct rb_node **node = &kn->parent->dir.children.rb_node; rb_node 351 fs/kernfs/dir.c struct rb_node *parent = NULL; rb_node 835 fs/kernfs/dir.c struct rb_node *node = parent->dir.children.rb_node; rb_node 1194 fs/kernfs/dir.c struct rb_node *rbn; rb_node 1223 fs/kernfs/dir.c struct rb_node *rbn; rb_node 1621 fs/kernfs/dir.c struct rb_node *node = parent->dir.children.rb_node; rb_node 1635 fs/kernfs/dir.c struct rb_node *node = rb_next(&pos->rb); rb_node 1650 fs/kernfs/dir.c struct rb_node *node = rb_next(&pos->rb); rb_node 124 fs/nfs/blocklayout/blocklayout.h struct rb_node be_node; rb_node 13 fs/nfs/blocklayout/extent_tree.c ext_node(struct rb_node *node) rb_node 21 fs/nfs/blocklayout/extent_tree.c struct rb_node *node = rb_first(root); rb_node 28 fs/nfs/blocklayout/extent_tree.c struct rb_node *node = rb_prev(&be->be_node); rb_node 35 fs/nfs/blocklayout/extent_tree.c struct rb_node *node = rb_next(&be->be_node); rb_node 48 fs/nfs/blocklayout/extent_tree.c struct rb_node *node = root->rb_node; rb_node 139 fs/nfs/blocklayout/extent_tree.c struct rb_node **p = &root->rb_node, *parent = NULL; rb_node 325 fs/nfs/blocklayout/extent_tree.c struct rb_node *node; rb_node 328 fs/nfs/blocklayout/extent_tree.c node = root->rb_node; rb_node 2212 fs/nfs/dir.c rb_erase(&cache->rb_node, &nfsi->access_cache); rb_node 2268 fs/nfs/dir.c struct rb_node *n; rb_node 2273 fs/nfs/dir.c entry = rb_entry(n, struct nfs_access_entry, rb_node); rb_node 2301 fs/nfs/dir.c struct rb_node *n = NFS_I(inode)->access_cache.rb_node; rb_node 2305 fs/nfs/dir.c rb_entry(n, struct nfs_access_entry, rb_node); rb_node 2395 fs/nfs/dir.c struct rb_node **p = &root_node->rb_node; rb_node 2396 fs/nfs/dir.c struct rb_node *parent = NULL; rb_node 2403 fs/nfs/dir.c entry = rb_entry(parent, struct nfs_access_entry, rb_node); rb_node 2413 fs/nfs/dir.c rb_link_node(&set->rb_node, parent, p); rb_node 2414 fs/nfs/dir.c rb_insert_color(&set->rb_node, root_node); rb_node 2419 fs/nfs/dir.c rb_replace_node(parent, &set->rb_node, root_node); rb_node 2431 fs/nfs/dir.c RB_CLEAR_NODE(&cache->rb_node); rb_node 116 fs/nfs/fscache.c struct rb_node **p, *parent; rb_node 148 fs/nfs/fscache.c p = &nfs_fscache_keys.rb_node; rb_node 22 fs/nfs/fscache.h struct rb_node node; rb_node 109 fs/nfs/nfs4_fs.h struct rb_node so_server_node; rb_node 208 fs/nfs/nfs4state.c struct rb_node *pos; rb_node 403 fs/nfs/nfs4state.c struct rb_node **p = &server->state_owners.rb_node, rb_node 431 fs/nfs/nfs4state.c struct rb_node **p = &server->state_owners.rb_node, rb_node 1713 fs/nfs/nfs4state.c struct rb_node *pos; rb_node 1764 fs/nfs/nfs4state.c struct rb_node *pos; rb_node 1867 fs/nfs/nfs4state.c struct rb_node *pos; rb_node 34 fs/nfsd/cache.h struct rb_node c_node; rb_node 2636 fs/nfsd/nfs4state.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 2657 fs/nfsd/nfs4state.c struct rb_node *node = root->rb_node; rb_node 342 fs/nfsd/nfscache.c struct rb_node **p = &b->rb_head.rb_node, rb_node 301 fs/nfsd/state.h struct rb_node cl_namenode; /* link into by-name trees */ rb_node 718 fs/nilfs2/the_nilfs.c struct rb_node *n; rb_node 722 fs/nilfs2/the_nilfs.c n = nilfs->ns_cptree.rb_node; rb_node 724 fs/nilfs2/the_nilfs.c root = rb_entry(n, struct nilfs_root, rb_node); rb_node 744 fs/nilfs2/the_nilfs.c struct rb_node **p, *parent; rb_node 758 fs/nilfs2/the_nilfs.c p = &nilfs->ns_cptree.rb_node; rb_node 763 fs/nilfs2/the_nilfs.c root = rb_entry(parent, struct nilfs_root, rb_node); rb_node 784 fs/nilfs2/the_nilfs.c rb_link_node(&new->rb_node, parent, p); rb_node 785 fs/nilfs2/the_nilfs.c rb_insert_color(&new->rb_node, &nilfs->ns_cptree); rb_node 806 fs/nilfs2/the_nilfs.c rb_erase(&root->rb_node, &nilfs->ns_cptree); rb_node 239 fs/nilfs2/the_nilfs.h struct rb_node rb_node; rb_node 68 fs/ocfs2/cluster/nodemanager.c struct rb_node ***ret_p, rb_node 69 fs/ocfs2/cluster/nodemanager.c struct rb_node **ret_parent) rb_node 71 fs/ocfs2/cluster/nodemanager.c struct rb_node **p = &cluster->cl_node_ip_tree.rb_node; rb_node 72 fs/ocfs2/cluster/nodemanager.c struct rb_node *parent = NULL; rb_node 275 fs/ocfs2/cluster/nodemanager.c struct rb_node **p, *parent; rb_node 35 fs/ocfs2/cluster/nodemanager.h struct rb_node nd_ip_node; rb_node 752 fs/ocfs2/cluster/tcp.c o2net_handler_tree_lookup(u32 msg_type, u32 key, struct rb_node ***ret_p, rb_node 753 fs/ocfs2/cluster/tcp.c struct rb_node **ret_parent) rb_node 755 fs/ocfs2/cluster/tcp.c struct rb_node **p = &o2net_handler_tree.rb_node; rb_node 756 fs/ocfs2/cluster/tcp.c struct rb_node *parent = NULL; rb_node 804 fs/ocfs2/cluster/tcp.c struct rb_node **p, *parent; rb_node 180 fs/ocfs2/cluster/tcp_internal.h struct rb_node nh_node; rb_node 196 fs/ocfs2/refcounttree.c struct rb_node *n = osb->osb_rf_lock_tree.rb_node; rb_node 218 fs/ocfs2/refcounttree.c struct rb_node *parent = NULL; rb_node 219 fs/ocfs2/refcounttree.c struct rb_node **p = &osb->osb_rf_lock_tree.rb_node; rb_node 530 fs/ocfs2/refcounttree.c struct rb_node *node; rb_node 13 fs/ocfs2/refcounttree.h struct rb_node rf_node; rb_node 81 fs/ocfs2/reservations.c struct rb_node *node; rb_node 140 fs/ocfs2/reservations.c struct rb_node *node; rb_node 274 fs/ocfs2/reservations.c struct rb_node *node; rb_node 310 fs/ocfs2/reservations.c struct rb_node *parent = NULL; rb_node 311 fs/ocfs2/reservations.c struct rb_node **p = &root->rb_node; rb_node 363 fs/ocfs2/reservations.c struct rb_node *node = resmap->m_reservations.rb_node; rb_node 469 fs/ocfs2/reservations.c struct rb_node *prev, *next; rb_node 22 fs/ocfs2/reservations.h struct rb_node r_node; rb_node 52 fs/ocfs2/uptodate.c struct rb_node c_node; rb_node 134 fs/ocfs2/uptodate.c struct rb_node *node; rb_node 212 fs/ocfs2/uptodate.c struct rb_node * n = ci->ci_cache.ci_tree.rb_node; rb_node 309 fs/ocfs2/uptodate.c struct rb_node *parent = NULL; rb_node 310 fs/ocfs2/uptodate.c struct rb_node **p = &ci->ci_cache.ci_tree.rb_node; rb_node 24 fs/overlayfs/readdir.c struct rb_node node; rb_node 61 fs/overlayfs/readdir.c static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n) rb_node 67 fs/overlayfs/readdir.c struct rb_node ***link, rb_node 68 fs/overlayfs/readdir.c struct rb_node **parent) rb_node 71 fs/overlayfs/readdir.c struct rb_node **newp = *link; rb_node 95 fs/overlayfs/readdir.c struct rb_node *node = root->rb_node; rb_node 177 fs/overlayfs/readdir.c struct rb_node **newp = &rdd->root->rb_node; rb_node 178 fs/overlayfs/readdir.c struct rb_node *parent = NULL; rb_node 582 fs/overlayfs/readdir.c struct rb_node **newp = &root->rb_node; rb_node 583 fs/overlayfs/readdir.c struct rb_node *parent = NULL; rb_node 72 fs/proc/generic.c struct rb_node *node = dir->subdir.rb_node; rb_node 94 fs/proc/generic.c struct rb_node **new = &root->rb_node, *parent = NULL; rb_node 58 fs/proc/internal.h struct rb_node subdir_node; rb_node 76 fs/proc/nommu.c struct rb_node *p = _p; rb_node 83 fs/proc/nommu.c struct rb_node *p; rb_node 102 fs/proc/nommu.c return rb_next((struct rb_node *) v); rb_node 114 fs/proc/proc_sysctl.c struct rb_node *node = dir->root.rb_node; rb_node 142 fs/proc/proc_sysctl.c struct rb_node *node = &head->node[entry - head->ctl_table].node; rb_node 143 fs/proc/proc_sysctl.c struct rb_node **p = &head->parent->root.rb_node; rb_node 144 fs/proc/proc_sysctl.c struct rb_node *parent = NULL; rb_node 181 fs/proc/proc_sysctl.c struct rb_node *node = &head->node[entry - head->ctl_table].node; rb_node 384 fs/proc/proc_sysctl.c static struct ctl_node *first_usable_entry(struct rb_node *node) rb_node 25 fs/proc/task_nommu.c struct rb_node *p; rb_node 86 fs/proc/task_nommu.c struct rb_node *p; rb_node 104 fs/proc/task_nommu.c struct rb_node *p; rb_node 193 fs/proc/task_nommu.c struct rb_node *p = _p; rb_node 202 fs/proc/task_nommu.c struct rb_node *p; rb_node 245 fs/proc/task_nommu.c struct rb_node *p = _p; rb_node 578 fs/ubifs/debug.c struct rb_node *rb; rb_node 646 fs/ubifs/debug.c struct rb_node *rb; rb_node 1757 fs/ubifs/debug.c struct rb_node rb; rb_node 1795 fs/ubifs/debug.c struct rb_node **p, *parent = NULL; rb_node 1801 fs/ubifs/debug.c p = &fsckd->inodes.rb_node; rb_node 1877 fs/ubifs/debug.c struct rb_node *p; rb_node 1880 fs/ubifs/debug.c p = fsckd->inodes.rb_node; rb_node 2148 fs/ubifs/debug.c struct rb_node *this = rb_first(&fsckd->inodes); rb_node 32 fs/ubifs/log.c struct rb_node *p; rb_node 36 fs/ubifs/log.c p = c->buds.rb_node; rb_node 61 fs/ubifs/log.c struct rb_node *p; rb_node 69 fs/ubifs/log.c p = c->buds.rb_node; rb_node 114 fs/ubifs/log.c struct rb_node **p, *parent = NULL; rb_node 119 fs/ubifs/log.c p = &c->buds.rb_node; rb_node 299 fs/ubifs/log.c struct rb_node *p; rb_node 306 fs/ubifs/log.c struct rb_node *p1 = p; rb_node 549 fs/ubifs/log.c struct rb_node rb; rb_node 563 fs/ubifs/log.c struct rb_node **p = &done_tree->rb_node, *parent = NULL; rb_node 49 fs/ubifs/orphan.c struct rb_node **p, *parent = NULL; rb_node 64 fs/ubifs/orphan.c p = &c->orph_tree.rb_node; rb_node 99 fs/ubifs/orphan.c struct rb_node *p; rb_node 101 fs/ubifs/orphan.c p = c->orph_tree.rb_node; rb_node 578 fs/ubifs/orphan.c struct rb_node **p, *parent = NULL; rb_node 585 fs/ubifs/orphan.c p = &c->orph_tree.rb_node; rb_node 832 fs/ubifs/orphan.c struct rb_node rb; rb_node 859 fs/ubifs/orphan.c struct rb_node **p, *parent = NULL; rb_node 866 fs/ubifs/orphan.c p = &root->rb_node; rb_node 887 fs/ubifs/orphan.c struct rb_node *p; rb_node 889 fs/ubifs/orphan.c p = root->rb_node; rb_node 1230 fs/ubifs/recovery.c struct rb_node rb; rb_node 1249 fs/ubifs/recovery.c struct rb_node **p = &c->size_tree.rb_node, *parent = NULL; rb_node 1283 fs/ubifs/recovery.c struct rb_node *p = c->size_tree.rb_node; rb_node 1530 fs/ubifs/recovery.c struct rb_node *this = rb_first(&c->size_tree); rb_node 73 fs/ubifs/tnc.c struct rb_node **p, *parent = NULL; rb_node 81 fs/ubifs/tnc.c p = &c->old_idx.rb_node; rb_node 166 fs/ubifs/tnc_commit.c struct rb_node *p; rb_node 168 fs/ubifs/tnc_commit.c p = c->old_idx.rb_node; rb_node 278 fs/ubifs/ubifs.h struct rb_node rb; rb_node 714 fs/ubifs/ubifs.h struct rb_node rb; rb_node 925 fs/ubifs/ubifs.h struct rb_node rb; rb_node 33 fs/xfs/xfs_extent_busy.c struct rb_node **rbp; rb_node 34 fs/xfs/xfs_extent_busy.c struct rb_node *parent = NULL; rb_node 48 fs/xfs/xfs_extent_busy.c rbp = &pag->pagb_tree.rb_node; rb_node 51 fs/xfs/xfs_extent_busy.c busyp = rb_entry(parent, struct xfs_extent_busy, rb_node); rb_node 64 fs/xfs/xfs_extent_busy.c rb_link_node(&new->rb_node, parent, rbp); rb_node 65 fs/xfs/xfs_extent_busy.c rb_insert_color(&new->rb_node, &pag->pagb_tree); rb_node 89 fs/xfs/xfs_extent_busy.c struct rb_node *rbp; rb_node 96 fs/xfs/xfs_extent_busy.c rbp = pag->pagb_tree.rb_node; rb_node 100 fs/xfs/xfs_extent_busy.c busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node); rb_node 228 fs/xfs/xfs_extent_busy.c rb_erase(&busyp->rb_node, &pag->pagb_tree); rb_node 290 fs/xfs/xfs_extent_busy.c struct rb_node *rbp; rb_node 297 fs/xfs/xfs_extent_busy.c rbp = pag->pagb_tree.rb_node; rb_node 300 fs/xfs/xfs_extent_busy.c rb_entry(rbp, struct xfs_extent_busy, rb_node); rb_node 341 fs/xfs/xfs_extent_busy.c struct rb_node *rbp; rb_node 350 fs/xfs/xfs_extent_busy.c rbp = args->pag->pagb_tree.rb_node; rb_node 353 fs/xfs/xfs_extent_busy.c rb_entry(rbp, struct xfs_extent_busy, rb_node); rb_node 531 fs/xfs/xfs_extent_busy.c rb_erase(&busyp->rb_node, &pag->pagb_tree); rb_node 23 fs/xfs/xfs_extent_busy.h struct rb_node rb_node; /* ag by-bno indexed search tree */ rb_node 166 include/drm/drm_mm.h struct rb_node rb; rb_node 167 include/drm/drm_mm.h struct rb_node rb_hole_size; rb_node 168 include/drm/drm_mm.h struct rb_node rb_hole_addr; rb_node 47 include/drm/drm_vma_manager.h struct rb_node vm_rb; rb_node 107 include/linux/backing-dev-defs.h struct rb_node rb_node; /* on bdi->cgwb_congestion_tree */ rb_node 190 include/linux/backing-dev-defs.h struct rb_node rb_node; /* keyed by ->id */ rb_node 170 include/linux/blkdev.h struct rb_node rb_node; /* sort/lookup */ rb_node 50 include/linux/bpf-cgroup.h struct rb_node node; rb_node 193 include/linux/ceph/libceph.h struct rb_node **n = &root->rb_node; \ rb_node 194 include/linux/ceph/libceph.h struct rb_node *parent = NULL; \ rb_node 230 include/linux/ceph/libceph.h struct rb_node *n = root->rb_node; \ rb_node 54 include/linux/ceph/mon_client.h struct rb_node node; rb_node 37 include/linux/ceph/osd_client.h struct rb_node o_node; rb_node 178 include/linux/ceph/osd_client.h struct rb_node r_node; rb_node 179 include/linux/ceph/osd_client.h struct rb_node r_mc_node; /* map check */ rb_node 267 include/linux/ceph/osd_client.h struct rb_node node; /* osd */ rb_node 268 include/linux/ceph/osd_client.h struct rb_node osdc_node; /* osdc */ rb_node 269 include/linux/ceph/osd_client.h struct rb_node mc_node; /* map check */ rb_node 296 include/linux/ceph/osd_client.h struct rb_node node; rb_node 328 include/linux/ceph/osd_client.h struct rb_node spg_node; rb_node 329 include/linux/ceph/osd_client.h struct rb_node id_node; rb_node 45 include/linux/ceph/osdmap.h struct rb_node node; rb_node 141 include/linux/ceph/osdmap.h struct rb_node node; rb_node 13 include/linux/ceph/string_table.h struct rb_node node; rb_node 196 include/linux/crush/crush.h struct rb_node node; rb_node 164 include/linux/elevator.h #define rb_entry_rq(node) rb_entry((node), struct request, rb_node) rb_node 385 include/linux/fscache-cache.h struct rb_node objlist_link; /* link in global object list */ rb_node 8 include/linux/interval_tree.h struct rb_node rb; rb_node 41 include/linux/interval_tree_generic.h struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \ rb_node 124 include/linux/interval_tree_generic.h if (!root->rb_root.rb_node) \ rb_node 140 include/linux/interval_tree_generic.h node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \ rb_node 154 include/linux/interval_tree_generic.h struct rb_node *rb = node->ITRB.rb_right, *prev; \ rb_node 20 include/linux/iova.h struct rb_node node; rb_node 71 include/linux/iova.h struct rb_node *cached_node; /* Save last alloced node */ rb_node 72 include/linux/iova.h struct rb_node *cached32_node; /* Save last 32-bit alloced node */ rb_node 146 include/linux/kernfs.h struct rb_node rb; rb_node 177 include/linux/key.h struct rb_node serial_node; rb_node 133 include/linux/memcontrol.h struct rb_node tree_node; /* RB tree node */ rb_node 120 include/linux/mempolicy.h struct rb_node nd; rb_node 2296 include/linux/mm.h struct rb_node **, struct rb_node *); rb_node 263 include/linux/mm_types.h struct rb_node vm_rb; /* link in global region tree */ rb_node 302 include/linux/mm_types.h struct rb_node vm_rb; rb_node 323 include/linux/mm_types.h struct rb_node rb; rb_node 52 include/linux/nfs_fs.h struct rb_node rb_node; rb_node 592 include/linux/perf_event.h struct rb_node group_node; rb_node 144 include/linux/pktcdvd.h struct rb_node rb_node; rb_node 26 include/linux/rbtree.h struct rb_node *rb_right; rb_node 27 include/linux/rbtree.h struct rb_node *rb_left; rb_node 32 include/linux/rbtree.h struct rb_node *rb_node; rb_node 35 include/linux/rbtree.h #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) rb_node 40 include/linux/rbtree.h #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL) rb_node 49 include/linux/rbtree.h extern void rb_insert_color(struct rb_node *, struct rb_root *); rb_node 50 include/linux/rbtree.h extern void rb_erase(struct rb_node *, struct rb_root *); rb_node 54 include/linux/rbtree.h extern struct rb_node *rb_next(const struct rb_node *); rb_node 55 include/linux/rbtree.h extern struct rb_node *rb_prev(const struct rb_node *); rb_node 56 include/linux/rbtree.h extern struct rb_node *rb_first(const struct rb_root *); rb_node 57 include/linux/rbtree.h extern struct rb_node *rb_last(const struct rb_root *); rb_node 60 include/linux/rbtree.h extern struct rb_node *rb_first_postorder(const struct rb_root *); rb_node 61 include/linux/rbtree.h extern struct rb_node *rb_next_postorder(const struct rb_node *); rb_node 64 include/linux/rbtree.h extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, rb_node 66 include/linux/rbtree.h extern void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new, rb_node 69 include/linux/rbtree.h static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, rb_node 70 include/linux/rbtree.h struct rb_node **rb_link) rb_node 78 include/linux/rbtree.h static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent, rb_node 79 include/linux/rbtree.h struct rb_node **rb_link) rb_node 127 include/linux/rbtree.h struct rb_node *rb_leftmost; rb_node 135 include/linux/rbtree.h static inline void rb_insert_color_cached(struct rb_node *node, rb_node 144 include/linux/rbtree.h static inline void rb_erase_cached(struct rb_node *node, rb_node 152 include/linux/rbtree.h static inline void rb_replace_node_cached(struct rb_node *victim, rb_node 153 include/linux/rbtree.h struct rb_node *new, rb_node 28 include/linux/rbtree_augmented.h void (*propagate)(struct rb_node *node, struct rb_node *stop); rb_node 29 include/linux/rbtree_augmented.h void (*copy)(struct rb_node *old, struct rb_node *new); rb_node 30 include/linux/rbtree_augmented.h void (*rotate)(struct rb_node *old, struct rb_node *new); rb_node 33 include/linux/rbtree_augmented.h extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_node 34 include/linux/rbtree_augmented.h void (*augment_rotate)(struct rb_node *old, struct rb_node *new)); rb_node 47 include/linux/rbtree_augmented.h rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_node 54 include/linux/rbtree_augmented.h rb_insert_augmented_cached(struct rb_node *node, rb_node 77 include/linux/rbtree_augmented.h RBNAME ## _propagate(struct rb_node *rb, struct rb_node *stop) \ rb_node 87 include/linux/rbtree_augmented.h RBNAME ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \ rb_node 94 include/linux/rbtree_augmented.h RBNAME ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \ rb_node 148 include/linux/rbtree_augmented.h #define __rb_parent(pc) ((struct rb_node *)(pc & ~3)) rb_node 157 include/linux/rbtree_augmented.h static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) rb_node 162 include/linux/rbtree_augmented.h static inline void rb_set_parent_color(struct rb_node *rb, rb_node 163 include/linux/rbtree_augmented.h struct rb_node *p, int color) rb_node 169 include/linux/rbtree_augmented.h __rb_change_child(struct rb_node *old, struct rb_node *new, rb_node 170 include/linux/rbtree_augmented.h struct rb_node *parent, struct rb_root *root) rb_node 178 include/linux/rbtree_augmented.h WRITE_ONCE(root->rb_node, new); rb_node 182 include/linux/rbtree_augmented.h __rb_change_child_rcu(struct rb_node *old, struct rb_node *new, rb_node 183 include/linux/rbtree_augmented.h struct rb_node *parent, struct rb_root *root) rb_node 191 include/linux/rbtree_augmented.h rcu_assign_pointer(root->rb_node, new); rb_node 194 include/linux/rbtree_augmented.h extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_node 195 include/linux/rbtree_augmented.h void (*augment_rotate)(struct rb_node *old, struct rb_node *new)); rb_node 197 include/linux/rbtree_augmented.h static __always_inline struct rb_node * rb_node 198 include/linux/rbtree_augmented.h __rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_node 201 include/linux/rbtree_augmented.h struct rb_node *child = node->rb_right; rb_node 202 include/linux/rbtree_augmented.h struct rb_node *tmp = node->rb_left; rb_node 203 include/linux/rbtree_augmented.h struct rb_node *parent, *rebalance; rb_node 231 include/linux/rbtree_augmented.h struct rb_node *successor = child, *child2; rb_node 302 include/linux/rbtree_augmented.h rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_node 305 include/linux/rbtree_augmented.h struct rb_node *rebalance = __rb_erase_augmented(node, root, augment); rb_node 311 include/linux/rbtree_augmented.h rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, rb_node 41 include/linux/rbtree_latch.h struct rb_node node[2]; rb_node 70 include/linux/rbtree_latch.h __lt_from_rb(struct rb_node *node, int idx) rb_node 80 include/linux/rbtree_latch.h struct rb_node **link = &root->rb_node; rb_node 81 include/linux/rbtree_latch.h struct rb_node *node = <n->node[idx]; rb_node 82 include/linux/rbtree_latch.h struct rb_node *parent = NULL; rb_node 109 include/linux/rbtree_latch.h struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node); rb_node 81 include/linux/rmap.h struct rb_node rb; /* locked by anon_vma->rwsem */ rb_node 448 include/linux/sched.h struct rb_node run_node; rb_node 500 include/linux/sched.h struct rb_node rb_node; rb_node 724 include/linux/sched.h struct rb_node pushable_dl_tasks; rb_node 701 include/linux/skbuff.h struct rb_node rbnode; /* used in netem, ip4 defrag, and tcp stack */ rb_node 88 include/linux/sunrpc/xprt.h struct rb_node rq_recv; /* Receive queue */ rb_node 151 include/linux/swap.h struct rb_node rb_node; rb_node 137 include/linux/sysctl.h struct rb_node node; rb_node 10 include/linux/timerqueue.h struct rb_node node; rb_node 36 include/linux/timerqueue.h struct rb_node *leftmost = rb_first_cached(&head->rb_root); rb_node 56 include/linux/vmalloc.h struct rb_node rb_node; /* address sorted rbtree */ rb_node 80 include/net/garp.h struct rb_node node; rb_node 37 include/net/inetpeer.h struct rb_node rb_node; rb_node 91 include/net/mrp.h struct rb_node node; rb_node 81 include/net/nexthop.h struct rb_node rb_node; /* entry on netns rbtree */ rb_node 515 include/rdma/rdmavt_qp.h struct rb_node rb_node; rb_node 62 include/xen/arm/page.h if (phys_to_mach.rb_node != NULL) { rb_node 61 ipc/mqueue.c struct rb_node rb_node; rb_node 79 ipc/mqueue.c struct rb_node *msg_tree_rightmost; rb_node 134 ipc/mqueue.c struct rb_node **p, *parent = NULL; rb_node 138 ipc/mqueue.c p = &info->msg_tree.rb_node; rb_node 141 ipc/mqueue.c leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); rb_node 163 ipc/mqueue.c info->msg_tree_rightmost = &leaf->rb_node; rb_node 165 ipc/mqueue.c rb_link_node(&leaf->rb_node, parent, p); rb_node 166 ipc/mqueue.c rb_insert_color(&leaf->rb_node, &info->msg_tree); rb_node 177 ipc/mqueue.c struct rb_node *node = &leaf->rb_node; rb_node 192 ipc/mqueue.c struct rb_node *parent = NULL; rb_node 212 ipc/mqueue.c leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node); rb_node 53 kernel/bpf/local_storage.c struct rb_node *node; rb_node 58 kernel/bpf/local_storage.c node = root->rb_node; rb_node 88 kernel/bpf/local_storage.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 1556 kernel/events/core.c struct rb_node *parent; rb_node 1557 kernel/events/core.c struct rb_node **node; rb_node 1561 kernel/events/core.c node = &groups->tree.rb_node; rb_node 1623 kernel/events/core.c struct rb_node *node = groups->tree.rb_node; rb_node 56 kernel/events/uprobes.c struct rb_node rb_node; /* node in the rb tree */ rb_node 642 kernel/events/uprobes.c struct rb_node *n = uprobes_tree.rb_node; rb_node 647 kernel/events/uprobes.c uprobe = rb_entry(n, struct uprobe, rb_node); rb_node 677 kernel/events/uprobes.c struct rb_node **p = &uprobes_tree.rb_node; rb_node 678 kernel/events/uprobes.c struct rb_node *parent = NULL; rb_node 684 kernel/events/uprobes.c u = rb_entry(parent, struct uprobe, rb_node); rb_node 697 kernel/events/uprobes.c rb_link_node(&uprobe->rb_node, parent, p); rb_node 698 kernel/events/uprobes.c rb_insert_color(&uprobe->rb_node, &uprobes_tree); rb_node 939 kernel/events/uprobes.c return !RB_EMPTY_NODE(&uprobe->rb_node); rb_node 952 kernel/events/uprobes.c rb_erase(&uprobe->rb_node, &uprobes_tree); rb_node 954 kernel/events/uprobes.c RB_CLEAR_NODE(&uprobe->rb_node); /* for uprobe_is_active() */ rb_node 1271 kernel/events/uprobes.c static struct rb_node * rb_node 1274 kernel/events/uprobes.c struct rb_node *n = uprobes_tree.rb_node; rb_node 1277 kernel/events/uprobes.c struct uprobe *u = rb_entry(n, struct uprobe, rb_node); rb_node 1305 kernel/events/uprobes.c struct rb_node *n, *t; rb_node 1316 kernel/events/uprobes.c u = rb_entry(t, struct uprobe, rb_node); rb_node 1323 kernel/events/uprobes.c u = rb_entry(t, struct uprobe, rb_node); rb_node 1414 kernel/events/uprobes.c struct rb_node *n; rb_node 482 kernel/fork.c struct rb_node **rb_link, *rb_parent; rb_node 507 kernel/fork.c rb_link = &mm->mm_rb.rb_node; rb_node 275 kernel/locking/rtmutex.c struct rb_node **link = &lock->waiters.rb_root.rb_node; rb_node 276 kernel/locking/rtmutex.c struct rb_node *parent = NULL; rb_node 308 kernel/locking/rtmutex.c struct rb_node **link = &task->pi_waiters.rb_root.rb_node; rb_node 309 kernel/locking/rtmutex.c struct rb_node *parent = NULL; rb_node 28 kernel/locking/rtmutex_common.h struct rb_node tree_entry; rb_node 29 kernel/locking/rtmutex_common.h struct rb_node pi_tree_entry; rb_node 55 kernel/locking/rtmutex_common.h struct rb_node *leftmost = rb_first_cached(&lock->waiters); rb_node 123 kernel/power/swap.c struct rb_node node; rb_node 132 kernel/power/swap.c struct rb_node **new = &(swsusp_extents.rb_node); rb_node 133 kernel/power/swap.c struct rb_node *parent = NULL; rb_node 198 kernel/power/swap.c struct rb_node *node; rb_node 200 kernel/power/swap.c while ((node = swsusp_extents.rb_node)) { rb_node 215 kernel/power/swap.c return (swsusp_extents.rb_node != NULL); rb_node 29 kernel/power/wakelock.c struct rb_node node; rb_node 40 kernel/power/wakelock.c struct rb_node *node; rb_node 153 kernel/power/wakelock.c struct rb_node **node = &wakelocks_tree.rb_node; rb_node 154 kernel/power/wakelock.c struct rb_node *parent = *node; rb_node 2699 kernel/sched/core.c RB_CLEAR_NODE(&p->dl.rb_node); rb_node 43 kernel/sched/deadline.c return !RB_EMPTY_NODE(&dl_se->rb_node); rb_node 334 kernel/sched/deadline.c return dl_rq->root.rb_leftmost == &dl_se->rb_node; rb_node 448 kernel/sched/deadline.c struct rb_node **link = &dl_rq->pushable_dl_tasks_root.rb_root.rb_node; rb_node 449 kernel/sched/deadline.c struct rb_node *parent = NULL; rb_node 483 kernel/sched/deadline.c struct rb_node *next_node; rb_node 1358 kernel/sched/deadline.c struct rb_node *leftmost = dl_rq->root.rb_leftmost; rb_node 1361 kernel/sched/deadline.c entry = rb_entry(leftmost, struct sched_dl_entity, rb_node); rb_node 1405 kernel/sched/deadline.c struct rb_node **link = &dl_rq->root.rb_root.rb_node; rb_node 1406 kernel/sched/deadline.c struct rb_node *parent = NULL; rb_node 1410 kernel/sched/deadline.c BUG_ON(!RB_EMPTY_NODE(&dl_se->rb_node)); rb_node 1414 kernel/sched/deadline.c entry = rb_entry(parent, struct sched_dl_entity, rb_node); rb_node 1423 kernel/sched/deadline.c rb_link_node(&dl_se->rb_node, parent, link); rb_node 1424 kernel/sched/deadline.c rb_insert_color_cached(&dl_se->rb_node, &dl_rq->root, leftmost); rb_node 1433 kernel/sched/deadline.c if (RB_EMPTY_NODE(&dl_se->rb_node)) rb_node 1436 kernel/sched/deadline.c rb_erase_cached(&dl_se->rb_node, &dl_rq->root); rb_node 1437 kernel/sched/deadline.c RB_CLEAR_NODE(&dl_se->rb_node); rb_node 1768 kernel/sched/deadline.c struct rb_node *left = rb_first_cached(&dl_rq->root); rb_node 1773 kernel/sched/deadline.c return rb_entry(left, struct sched_dl_entity, rb_node); rb_node 1854 kernel/sched/deadline.c struct rb_node *next_node = rq->dl.pushable_dl_tasks_root.rb_leftmost; rb_node 533 kernel/sched/fair.c struct rb_node *leftmost = rb_first_cached(&cfs_rq->tasks_timeline); rb_node 567 kernel/sched/fair.c struct rb_node **link = &cfs_rq->tasks_timeline.rb_root.rb_node; rb_node 568 kernel/sched/fair.c struct rb_node *parent = NULL; rb_node 602 kernel/sched/fair.c struct rb_node *left = rb_first_cached(&cfs_rq->tasks_timeline); rb_node 612 kernel/sched/fair.c struct rb_node *next = rb_next(&se->run_node); rb_node 623 kernel/sched/fair.c struct rb_node *last = rb_last(&cfs_rq->tasks_timeline.rb_root); rb_node 27 kernel/trace/trace_stat.c struct rb_node node; rb_node 79 kernel/trace/trace_stat.c struct rb_node **new = &(root->rb_node), *parent = NULL; rb_node 176 kernel/trace/trace_stat.c struct rb_node *node; rb_node 200 kernel/trace/trace_stat.c struct rb_node *node = p; rb_node 59 lib/rbtree.c static inline void rb_set_black(struct rb_node *rb) rb_node 64 lib/rbtree.c static inline struct rb_node *rb_red_parent(struct rb_node *red) rb_node 66 lib/rbtree.c return (struct rb_node *)red->__rb_parent_color; rb_node 75 lib/rbtree.c __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, rb_node 78 lib/rbtree.c struct rb_node *parent = rb_parent(old); rb_node 85 lib/rbtree.c __rb_insert(struct rb_node *node, struct rb_root *root, rb_node 86 lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 88 lib/rbtree.c struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; rb_node 227 lib/rbtree.c ____rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_node 228 lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 230 lib/rbtree.c struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; rb_node 410 lib/rbtree.c void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_node 411 lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 424 lib/rbtree.c static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} rb_node 425 lib/rbtree.c static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {} rb_node 426 lib/rbtree.c static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {} rb_node 434 lib/rbtree.c void rb_insert_color(struct rb_node *node, struct rb_root *root) rb_node 440 lib/rbtree.c void rb_erase(struct rb_node *node, struct rb_root *root) rb_node 442 lib/rbtree.c struct rb_node *rebalance; rb_node 456 lib/rbtree.c void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_node 457 lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 466 lib/rbtree.c struct rb_node *rb_first(const struct rb_root *root) rb_node 468 lib/rbtree.c struct rb_node *n; rb_node 470 lib/rbtree.c n = root->rb_node; rb_node 479 lib/rbtree.c struct rb_node *rb_last(const struct rb_root *root) rb_node 481 lib/rbtree.c struct rb_node *n; rb_node 483 lib/rbtree.c n = root->rb_node; rb_node 492 lib/rbtree.c struct rb_node *rb_next(const struct rb_node *node) rb_node 494 lib/rbtree.c struct rb_node *parent; rb_node 507 lib/rbtree.c return (struct rb_node *)node; rb_node 524 lib/rbtree.c struct rb_node *rb_prev(const struct rb_node *node) rb_node 526 lib/rbtree.c struct rb_node *parent; rb_node 539 lib/rbtree.c return (struct rb_node *)node; rb_node 553 lib/rbtree.c void rb_replace_node(struct rb_node *victim, struct rb_node *new, rb_node 556 lib/rbtree.c struct rb_node *parent = rb_parent(victim); rb_node 570 lib/rbtree.c void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new, rb_node 573 lib/rbtree.c struct rb_node *parent = rb_parent(victim); rb_node 592 lib/rbtree.c static struct rb_node *rb_left_deepest_node(const struct rb_node *node) rb_node 600 lib/rbtree.c return (struct rb_node *)node; rb_node 604 lib/rbtree.c struct rb_node *rb_next_postorder(const struct rb_node *node) rb_node 606 lib/rbtree.c const struct rb_node *parent; rb_node 619 lib/rbtree.c return (struct rb_node *)parent; rb_node 623 lib/rbtree.c struct rb_node *rb_first_postorder(const struct rb_root *root) rb_node 625 lib/rbtree.c if (!root->rb_node) rb_node 628 lib/rbtree.c return rb_left_deepest_node(root->rb_node); rb_node 20 lib/rbtree_test.c struct rb_node rb; rb_node 34 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; rb_node 51 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *parent = NULL; rb_node 88 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; rb_node 112 lib/rbtree_test.c struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL; rb_node 158 lib/rbtree_test.c static bool is_red(struct rb_node *rb) rb_node 163 lib/rbtree_test.c static int black_path_count(struct rb_node *rb) rb_node 183 lib/rbtree_test.c struct rb_node *rb; rb_node 193 lib/rbtree_test.c struct rb_node *rb; rb_node 220 lib/rbtree_test.c struct rb_node *rb; rb_node 246 lib/rbtree_test.c struct rb_node *node; rb_node 29 lib/timerqueue.c struct rb_node **p = &head->rb_root.rb_root.rb_node; rb_node 30 lib/timerqueue.c struct rb_node *parent = NULL; rb_node 85 lib/timerqueue.c struct rb_node *next; rb_node 409 mm/backing-dev.c struct rb_node **node, *parent; rb_node 414 mm/backing-dev.c node = &bdi->cgwb_congested_tree.rb_node; rb_node 420 mm/backing-dev.c rb_node); rb_node 432 mm/backing-dev.c rb_link_node(&congested->rb_node, parent, node); rb_node 433 mm/backing-dev.c rb_insert_color(&congested->rb_node, &bdi->cgwb_congested_tree); rb_node 472 mm/backing-dev.c rb_erase(&congested->rb_node, rb_node 775 mm/backing-dev.c struct rb_node *rbn; rb_node 780 mm/backing-dev.c rb_entry(rbn, struct bdi_writeback_congested, rb_node); rb_node 885 mm/backing-dev.c static struct rb_node **bdi_lookup_rb_node(u64 id, struct rb_node **parentp) rb_node 887 mm/backing-dev.c struct rb_node **p = &bdi_tree.rb_node; rb_node 888 mm/backing-dev.c struct rb_node *parent = NULL; rb_node 895 mm/backing-dev.c bdi = rb_entry(parent, struct backing_dev_info, rb_node); rb_node 920 mm/backing-dev.c struct rb_node **p; rb_node 925 mm/backing-dev.c bdi = rb_entry(*p, struct backing_dev_info, rb_node); rb_node 936 mm/backing-dev.c struct rb_node *parent, **p; rb_node 957 mm/backing-dev.c rb_link_node(&bdi->rb_node, parent, p); rb_node 958 mm/backing-dev.c rb_insert_color(&bdi->rb_node, &bdi_tree); rb_node 1002 mm/backing-dev.c rb_erase(&bdi->rb_node, &bdi_tree); rb_node 293 mm/internal.h struct vm_area_struct *prev, struct rb_node *rb_parent); rb_node 32 mm/interval_tree.c struct rb_node **link; rb_node 142 mm/kmemleak.c struct rb_node rb_node; rb_node 381 mm/kmemleak.c struct rb_node *rb = object_tree_root.rb_node; rb_node 385 mm/kmemleak.c rb_entry(rb, struct kmemleak_object, rb_node); rb_node 387 mm/kmemleak.c rb = object->rb_node.rb_left; rb_node 389 mm/kmemleak.c rb = object->rb_node.rb_right; rb_node 535 mm/kmemleak.c rb_erase(&object->rb_node, &object_tree_root); rb_node 575 mm/kmemleak.c struct rb_node **link, *rb_parent; rb_node 625 mm/kmemleak.c link = &object_tree_root.rb_node; rb_node 629 mm/kmemleak.c parent = rb_entry(rb_parent, struct kmemleak_object, rb_node); rb_node 631 mm/kmemleak.c link = &parent->rb_node.rb_left; rb_node 633 mm/kmemleak.c link = &parent->rb_node.rb_right; rb_node 647 mm/kmemleak.c rb_link_node(&object->rb_node, rb_parent, link); rb_node 648 mm/kmemleak.c rb_insert_color(&object->rb_node, &object_tree_root); rb_node 157 mm/ksm.c struct rb_node node; /* when node of stable tree */ rb_node 207 mm/ksm.c struct rb_node node; /* when node of unstable tree */ rb_node 945 mm/ksm.c while (root_stable_tree[nid].rb_node) { rb_node 946 mm/ksm.c stable_node = rb_entry(root_stable_tree[nid].rb_node, rb_node 1555 mm/ksm.c struct rb_node **new; rb_node 1556 mm/ksm.c struct rb_node *parent; rb_node 1570 mm/ksm.c new = &root->rb_node; rb_node 1808 mm/ksm.c struct rb_node **new; rb_node 1809 mm/ksm.c struct rb_node *parent; rb_node 1818 mm/ksm.c new = &root->rb_node; rb_node 1927 mm/ksm.c struct rb_node **new; rb_node 1929 mm/ksm.c struct rb_node *parent = NULL; rb_node 1934 mm/ksm.c new = &root->rb_node; rb_node 2769 mm/ksm.c struct rb_node *node; rb_node 120 mm/memcontrol.c struct rb_node *rb_rightmost; rb_node 527 mm/memcontrol.c struct rb_node **p = &mctz->rb_root.rb_node; rb_node 528 mm/memcontrol.c struct rb_node *parent = NULL; rb_node 2290 mm/mempolicy.c struct rb_node *n = sp->root.rb_node; rb_node 2306 mm/mempolicy.c struct rb_node *prev = rb_prev(n); rb_node 2323 mm/mempolicy.c struct rb_node **p = &sp->root.rb_node; rb_node 2324 mm/mempolicy.c struct rb_node *parent = NULL; rb_node 2350 mm/mempolicy.c if (!sp->root.rb_node) rb_node 2518 mm/mempolicy.c struct rb_node *next = rb_next(&n->nd); rb_node 2647 mm/mempolicy.c struct rb_node *next; rb_node 2649 mm/mempolicy.c if (!p->root.rb_node) rb_node 330 mm/mmap.c struct rb_node *nd, *pn = NULL; rb_node 376 mm/mmap.c struct rb_node *nd; rb_node 528 mm/mmap.c struct rb_node ***rb_link, struct rb_node **rb_parent) rb_node 530 mm/mmap.c struct rb_node **__rb_link, *__rb_parent, *rb_prev; rb_node 532 mm/mmap.c __rb_link = &mm->mm_rb.rb_node; rb_node 589 mm/mmap.c struct rb_node **rb_link, struct rb_node *rb_parent) rb_node 633 mm/mmap.c struct vm_area_struct *prev, struct rb_node **rb_link, rb_node 634 mm/mmap.c struct rb_node *rb_parent) rb_node 641 mm/mmap.c struct vm_area_struct *prev, struct rb_node **rb_link, rb_node 642 mm/mmap.c struct rb_node *rb_parent) rb_node 668 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_node 1718 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_node 1908 mm/mmap.c vma = rb_entry(mm->mm_rb.rb_node, struct vm_area_struct, vm_rb); rb_node 1947 mm/mmap.c struct rb_node *prev = &vma->vm_rb; rb_node 2012 mm/mmap.c vma = rb_entry(mm->mm_rb.rb_node, struct vm_area_struct, vm_rb); rb_node 2051 mm/mmap.c struct rb_node *prev = &vma->vm_rb; rb_node 2237 mm/mmap.c struct rb_node *rb_node; rb_node 2245 mm/mmap.c rb_node = mm->mm_rb.rb_node; rb_node 2247 mm/mmap.c while (rb_node) { rb_node 2250 mm/mmap.c tmp = rb_entry(rb_node, struct vm_area_struct, vm_rb); rb_node 2256 mm/mmap.c rb_node = rb_node->rb_left; rb_node 2258 mm/mmap.c rb_node = rb_node->rb_right; rb_node 2281 mm/mmap.c struct rb_node *rb_node = rb_last(&mm->mm_rb); rb_node 2283 mm/mmap.c *pprev = rb_node ? rb_entry(rb_node, struct vm_area_struct, vm_rb) : NULL; rb_node 2996 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_node 3174 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_node 3216 mm/mmap.c struct rb_node **rb_link, *rb_parent; rb_node 3471 mm/mmap.c if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) { rb_node 3487 mm/mmap.c &anon_vma->root->rb_root.rb_root.rb_node)) rb_node 3589 mm/mmap.c if (test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) { rb_node 3603 mm/mmap.c &anon_vma->root->rb_root.rb_root.rb_node)) rb_node 459 mm/nommu.c struct rb_node *p, *lastp; rb_node 492 mm/nommu.c struct rb_node **p, *parent; rb_node 497 mm/nommu.c p = &nommu_region_tree.rb_node; rb_node 522 mm/nommu.c BUG_ON(!nommu_region_tree.rb_node); rb_node 551 mm/nommu.c BUG_ON(!nommu_region_tree.rb_node); rb_node 590 mm/nommu.c struct rb_node **p, *parent, *rb_prev; rb_node 610 mm/nommu.c p = &mm->mm_rb.rb_node; rb_node 1110 mm/nommu.c struct rb_node *rb; rb_node 157 mm/swapfile.c struct rb_node *rb = rb_first(&sis->swap_extent_root); rb_node 158 mm/swapfile.c return rb_entry(rb, struct swap_extent, rb_node); rb_node 163 mm/swapfile.c struct rb_node *rb = rb_next(&se->rb_node); rb_node 164 mm/swapfile.c return rb ? rb_entry(rb, struct swap_extent, rb_node) : NULL; rb_node 208 mm/swapfile.c struct rb_node *rb; rb_node 210 mm/swapfile.c rb = sis->swap_extent_root.rb_node; rb_node 212 mm/swapfile.c se = rb_entry(rb, struct swap_extent, rb_node); rb_node 2287 mm/swapfile.c struct rb_node *rb = sis->swap_extent_root.rb_node; rb_node 2288 mm/swapfile.c struct swap_extent *se = rb_entry(rb, struct swap_extent, rb_node); rb_node 2314 mm/swapfile.c struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL; rb_node 2328 mm/swapfile.c se = rb_entry(parent, struct swap_extent, rb_node); rb_node 2345 mm/swapfile.c rb_link_node(&new_se->rb_node, parent, link); rb_node 2346 mm/swapfile.c rb_insert_color(&new_se->rb_node, &sis->swap_extent_root); rb_node 274 mm/util.c struct vm_area_struct *prev, struct rb_node *rb_parent) rb_node 381 mm/vmalloc.c get_subtree_max_size(struct rb_node *node) rb_node 385 mm/vmalloc.c va = rb_entry_safe(node, struct vmap_area, rb_node); rb_node 396 mm/vmalloc.c get_subtree_max_size(va->rb_node.rb_left), rb_node 397 mm/vmalloc.c get_subtree_max_size(va->rb_node.rb_right)); rb_node 401 mm/vmalloc.c struct vmap_area, rb_node, unsigned long, subtree_max_size, va_size) rb_node 416 mm/vmalloc.c struct rb_node *n = vmap_area_root.rb_node; rb_node 421 mm/vmalloc.c va = rb_entry(n, struct vmap_area, rb_node); rb_node 437 mm/vmalloc.c static __always_inline struct rb_node ** rb_node 439 mm/vmalloc.c struct rb_root *root, struct rb_node *from, rb_node 440 mm/vmalloc.c struct rb_node **parent) rb_node 443 mm/vmalloc.c struct rb_node **link; rb_node 446 mm/vmalloc.c link = &root->rb_node; rb_node 461 mm/vmalloc.c tmp_va = rb_entry(*link, struct vmap_area, rb_node); rb_node 478 mm/vmalloc.c *parent = &tmp_va->rb_node; rb_node 483 mm/vmalloc.c get_va_next_sibling(struct rb_node *parent, struct rb_node **link) rb_node 496 mm/vmalloc.c list = &rb_entry(parent, struct vmap_area, rb_node)->list; rb_node 502 mm/vmalloc.c struct rb_node *parent, struct rb_node **link, struct list_head *head) rb_node 509 mm/vmalloc.c head = &rb_entry(parent, struct vmap_area, rb_node)->list; rb_node 515 mm/vmalloc.c rb_link_node(&va->rb_node, parent, link); rb_node 528 mm/vmalloc.c rb_insert_augmented(&va->rb_node, rb_node 532 mm/vmalloc.c rb_insert_color(&va->rb_node, root); rb_node 542 mm/vmalloc.c if (WARN_ON(RB_EMPTY_NODE(&va->rb_node))) rb_node 546 mm/vmalloc.c rb_erase_augmented(&va->rb_node, rb_node 549 mm/vmalloc.c rb_erase(&va->rb_node, root); rb_node 552 mm/vmalloc.c RB_CLEAR_NODE(&va->rb_node); rb_node 557 mm/vmalloc.c augment_tree_propagate_check(struct rb_node *n) rb_node 560 mm/vmalloc.c struct rb_node *node; rb_node 567 mm/vmalloc.c va = rb_entry(n, struct vmap_area, rb_node); rb_node 572 mm/vmalloc.c va = rb_entry(node, struct vmap_area, rb_node); rb_node 587 mm/vmalloc.c va = rb_entry(n, struct vmap_area, rb_node); rb_node 627 mm/vmalloc.c struct rb_node *node = &va->rb_node; rb_node 631 mm/vmalloc.c va = rb_entry(node, struct vmap_area, rb_node); rb_node 644 mm/vmalloc.c node = rb_parent(&va->rb_node); rb_node 648 mm/vmalloc.c augment_tree_propagate_check(free_vmap_area_root.rb_node); rb_node 656 mm/vmalloc.c struct rb_node **link; rb_node 657 mm/vmalloc.c struct rb_node *parent; rb_node 665 mm/vmalloc.c struct rb_node *from, struct rb_root *root, rb_node 668 mm/vmalloc.c struct rb_node **link; rb_node 669 mm/vmalloc.c struct rb_node *parent; rb_node 692 mm/vmalloc.c struct rb_node **link; rb_node 693 mm/vmalloc.c struct rb_node *parent; rb_node 793 mm/vmalloc.c struct rb_node *node; rb_node 797 mm/vmalloc.c node = free_vmap_area_root.rb_node; rb_node 803 mm/vmalloc.c va = rb_entry(node, struct vmap_area, rb_node); rb_node 828 mm/vmalloc.c va = rb_entry(node, struct vmap_area, rb_node); rb_node 996 mm/vmalloc.c insert_vmap_area_augment(lva, &va->rb_node, rb_node 1077 mm/vmalloc.c kmemleak_scan_area(&va->rb_node, SIZE_MAX, gfp_mask & GFP_RECLAIM_MASK); rb_node 3135 mm/vmalloc.c static struct vmap_area *node_to_va(struct rb_node *n) rb_node 3137 mm/vmalloc.c return rb_entry_safe(n, struct vmap_area, rb_node); rb_node 3153 mm/vmalloc.c struct rb_node *n; rb_node 3155 mm/vmalloc.c n = free_vmap_area_root.rb_node; rb_node 3159 mm/vmalloc.c tmp = rb_entry(n, struct vmap_area, rb_node); rb_node 3316 mm/vmalloc.c va = node_to_va(rb_prev(&va->rb_node)); rb_node 152 mm/zswap.c struct rb_node rbnode; rb_node 269 mm/zswap.c struct rb_node *node = root->rb_node; rb_node 291 mm/zswap.c struct rb_node **link = &root->rb_node, *parent = NULL; rb_node 21 net/6lowpan/nhc.c struct rb_node **new = &rb_root.rb_node, *parent = NULL; rb_node 63 net/6lowpan/nhc.c struct rb_node *node = rb_root.rb_node; rb_node 68 net/6lowpan/nhc.h struct rb_node node; rb_node 150 net/802/garp.c struct rb_node *parent = app->gid.rb_node; rb_node 170 net/802/garp.c struct rb_node *parent = NULL, **p = &app->gid.rb_node; rb_node 382 net/802/garp.c struct rb_node *node, *next; rb_node 239 net/802/mrp.c struct rb_node *parent = app->mad.rb_node; rb_node 259 net/802/mrp.c struct rb_node *parent = NULL, **p = &app->mad.rb_node; rb_node 567 net/802/mrp.c struct rb_node *node, *next; rb_node 121 net/ceph/auth_x.c struct rb_node *parent = NULL, **p = &xi->ticket_handlers.rb_node; rb_node 766 net/ceph/auth_x.c struct rb_node *p; rb_node 16 net/ceph/auth_x.h struct rb_node node; rb_node 60 net/ceph/debugfs.c struct rb_node *n; rb_node 141 net/ceph/debugfs.c struct rb_node *rp; rb_node 231 net/ceph/debugfs.c struct rb_node *n; rb_node 257 net/ceph/debugfs.c struct rb_node *n; rb_node 318 net/ceph/debugfs.c struct rb_node *n; rb_node 341 net/ceph/debugfs.c struct rb_node *n; rb_node 958 net/ceph/mon_client.c struct rb_node *p; rb_node 1156 net/ceph/osd_client.c struct rb_node *n, *p; rb_node 1309 net/ceph/osd_client.c struct rb_node *n; rb_node 1362 net/ceph/osd_client.c struct rb_node *n; rb_node 1457 net/ceph/osd_client.c struct rb_node *n; rb_node 1841 net/ceph/osd_client.c struct rb_node *n = root->rb_node; rb_node 3278 net/ceph/osd_client.c struct rb_node *n, *p; rb_node 3706 net/ceph/osd_client.c struct rb_node *n; rb_node 3758 net/ceph/osd_client.c struct rb_node *n; rb_node 3835 net/ceph/osd_client.c struct rb_node *n; rb_node 3904 net/ceph/osd_client.c struct rb_node *n; rb_node 4070 net/ceph/osd_client.c struct rb_node *n; rb_node 4280 net/ceph/osd_client.c struct rb_node *n; rb_node 4539 net/ceph/osd_client.c struct rb_node *n, *p; rb_node 5117 net/ceph/osd_client.c struct rb_node *n; rb_node 641 net/ceph/osdmap.c struct rb_node **p = &root->rb_node; rb_node 642 net/ceph/osdmap.c struct rb_node *parent = NULL; rb_node 664 net/ceph/osdmap.c struct rb_node *n = root->rb_node; rb_node 701 net/ceph/osdmap.c struct rb_node *rbp; rb_node 14 net/ceph/string_table.c struct rb_node **p, *parent; rb_node 19 net/ceph/string_table.c p = &string_tree.rb_node; rb_node 52 net/ceph/string_table.c p = &string_tree.rb_node; rb_node 3094 net/core/skbuff.c struct rb_node *p = rb_first(root); rb_node 74 net/ipv4/inet_fragment.c rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node); rb_node 234 net/ipv4/inet_fragment.c struct rb_node *p = rb_first(root); rb_node 373 net/ipv4/inet_fragment.c struct rb_node **rbn, *parent; rb_node 375 net/ipv4/inet_fragment.c rbn = &q->rb_fragments.rb_node; rb_node 481 net/ipv4/inet_fragment.c struct rb_node *rbn; rb_node 529 net/ipv4/inet_fragment.c struct rb_node *rbnext = rb_next(rbn); rb_node 103 net/ipv4/inetpeer.c struct rb_node **parent_p, rb_node 104 net/ipv4/inetpeer.c struct rb_node ***pp_p) rb_node 106 net/ipv4/inetpeer.c struct rb_node **pp, *parent, *next; rb_node 109 net/ipv4/inetpeer.c pp = &base->rb_root.rb_node; rb_node 118 net/ipv4/inetpeer.c p = rb_entry(parent, struct inet_peer, rb_node); rb_node 175 net/ipv4/inetpeer.c rb_erase(&p->rb_node, &base->rb_root); rb_node 187 net/ipv4/inetpeer.c struct rb_node **pp, *parent; rb_node 230 net/ipv4/inetpeer.c rb_link_node(&p->rb_node, parent, pp); rb_node 231 net/ipv4/inetpeer.c rb_insert_color(&p->rb_node, &base->rb_root); rb_node 298 net/ipv4/inetpeer.c struct rb_node *p = rb_first(&base->rb_root); rb_node 301 net/ipv4/inetpeer.c struct inet_peer *peer = rb_entry(p, struct inet_peer, rb_node); rb_node 304 net/ipv4/inetpeer.c rb_erase(&peer->rb_node, &base->rb_root); rb_node 145 net/ipv4/nexthop.c struct rb_node **pp, *parent = NULL, *next; rb_node 147 net/ipv4/nexthop.c pp = &net->nexthop.rb_root.rb_node; rb_node 156 net/ipv4/nexthop.c nh = rb_entry(parent, struct nexthop, rb_node); rb_node 828 net/ipv4/nexthop.c rb_erase(&nh->rb_node, &net->nexthop.rb_root); rb_node 1010 net/ipv4/nexthop.c struct rb_node **pp, *parent = NULL, *next; rb_node 1018 net/ipv4/nexthop.c pp = &root->rb_node; rb_node 1028 net/ipv4/nexthop.c nh = rb_entry(parent, struct nexthop, rb_node); rb_node 1052 net/ipv4/nexthop.c rb_link_node_rcu(&new_nh->rb_node, parent, pp); rb_node 1053 net/ipv4/nexthop.c rb_insert_color(&new_nh->rb_node, root); rb_node 1088 net/ipv4/nexthop.c struct rb_node *node; rb_node 1092 net/ipv4/nexthop.c nh = rb_entry(node, struct nexthop, rb_node); rb_node 1721 net/ipv4/nexthop.c struct rb_node *node; rb_node 1737 net/ipv4/nexthop.c nh = rb_entry(node, struct nexthop, rb_node); rb_node 2532 net/ipv4/tcp.c struct rb_node *p = rb_first(&sk->tcp_rtx_queue); rb_node 1606 net/ipv4/tcp_input.c struct rb_node *parent, **p = &sk->tcp_rtx_queue.rb_node; rb_node 3606 net/ipv4/tcp_input.c prefetch(sk->tcp_rtx_queue.rb_node); rb_node 4484 net/ipv4/tcp_input.c struct rb_node *p; rb_node 4548 net/ipv4/tcp_input.c struct rb_node **p, *parent; rb_node 4570 net/ipv4/tcp_input.c p = &tp->out_of_order_queue.rb_node; rb_node 4888 net/ipv4/tcp_input.c struct rb_node **p = &root->rb_node; rb_node 4889 net/ipv4/tcp_input.c struct rb_node *parent = NULL; rb_node 5077 net/ipv4/tcp_input.c struct rb_node *node, *prev; rb_node 50 net/netfilter/nf_conncount.c struct rb_node node; rb_node 309 net/netfilter/nf_conncount.c struct rb_node **rbnode, *parent; rb_node 319 net/netfilter/nf_conncount.c rbnode = &(root->rb_node); rb_node 392 net/netfilter/nf_conncount.c struct rb_node *parent; rb_node 400 net/netfilter/nf_conncount.c parent = rcu_dereference_raw(root->rb_node); rb_node 449 net/netfilter/nf_conncount.c struct rb_node *node; rb_node 562 net/netfilter/nf_conncount.c struct rb_node *node; rb_node 26 net/netfilter/nft_set_rbtree.c struct rb_node node; rb_node 54 net/netfilter/nft_set_rbtree.c const struct rb_node *parent; rb_node 58 net/netfilter/nft_set_rbtree.c parent = rcu_dereference_raw(priv->root.rb_node); rb_node 135 net/netfilter/nft_set_rbtree.c const struct rb_node *parent; rb_node 139 net/netfilter/nft_set_rbtree.c parent = rcu_dereference_raw(priv->root.rb_node); rb_node 224 net/netfilter/nft_set_rbtree.c struct rb_node *parent, **p; rb_node 228 net/netfilter/nft_set_rbtree.c p = &priv->root.rb_node; rb_node 318 net/netfilter/nft_set_rbtree.c const struct rb_node *parent = priv->root.rb_node; rb_node 359 net/netfilter/nft_set_rbtree.c struct rb_node *node; rb_node 390 net/netfilter/nft_set_rbtree.c struct rb_node *node; rb_node 471 net/netfilter/nft_set_rbtree.c struct rb_node *node; rb_node 475 net/netfilter/nft_set_rbtree.c while ((node = priv->root.rb_node) != NULL) { rb_node 107 net/rds/cong.c struct rb_node **p = &rds_cong_tree.rb_node; rb_node 108 net/rds/cong.c struct rb_node *parent = NULL; rb_node 401 net/rds/cong.c struct rb_node *node; rb_node 68 net/rds/rdma.c struct rb_node **p = &root->rb_node; rb_node 69 net/rds/rdma.c struct rb_node *parent = NULL; rb_node 131 net/rds/rdma.c struct rb_node *node; rb_node 65 net/rds/rds.h struct rb_node m_rb_node; rb_node 294 net/rds/rds.h struct rb_node r_rb_node; rb_node 441 net/rxrpc/ar-internal.h struct rb_node client_node; /* Node in local->client_conns */ rb_node 442 net/rxrpc/ar-internal.h struct rb_node service_node; /* Node in peer->service_conns */ rb_node 586 net/rxrpc/ar-internal.h struct rb_node sock_node; /* Node in rx->calls */ rb_node 107 net/rxrpc/call_accept.c struct rb_node *parent, **pp; rb_node 110 net/rxrpc/call_accept.c pp = &rx->calls.rb_node; rb_node 467 net/rxrpc/call_accept.c struct rb_node *parent, **pp; rb_node 484 net/rxrpc/call_accept.c pp = &rx->calls.rb_node; rb_node 522 net/rxrpc/call_accept.c pp = &rx->calls.rb_node; rb_node 66 net/rxrpc/call_object.c struct rb_node *p; rb_node 72 net/rxrpc/call_object.c p = rx->calls.rb_node; rb_node 227 net/rxrpc/call_object.c struct rb_node *parent, **pp; rb_node 254 net/rxrpc/call_object.c pp = &rx->calls.rb_node; rb_node 283 net/rxrpc/conn_client.c struct rb_node *p, **pp, *parent; rb_node 305 net/rxrpc/conn_client.c p = local->client_conns.rb_node; rb_node 370 net/rxrpc/conn_client.c pp = &local->client_conns.rb_node; rb_node 27 net/rxrpc/conn_service.c struct rb_node *p; rb_node 40 net/rxrpc/conn_service.c p = rcu_dereference_raw(peer->service_conns.rb_node); rb_node 68 net/rxrpc/conn_service.c struct rb_node **pp, *parent; rb_node 72 net/rxrpc/conn_service.c pp = &peer->service_conns.rb_node; rb_node 111 net/sched/sch_etf.c struct rb_node *p; rb_node 166 net/sched/sch_etf.c struct rb_node **p = &q->head.rb_root.rb_node, *parent = NULL; rb_node 423 net/sched/sch_etf.c struct rb_node *p = rb_first_cached(&q->head); rb_node 75 net/sched/sch_fq.c struct rb_node fq_node; /* anchor in fq_root[] trees */ rb_node 82 net/sched/sch_fq.c struct rb_node rate_node; /* anchor in q->delayed tree */ rb_node 165 net/sched/sch_fq.c struct rb_node **p = &q->delayed.rb_node, *parent = NULL; rb_node 206 net/sched/sch_fq.c struct rb_node **p, *parent; rb_node 209 net/sched/sch_fq.c p = &root->rb_node; rb_node 243 net/sched/sch_fq.c struct rb_node **p, *parent; rb_node 288 net/sched/sch_fq.c p = &root->rb_node; rb_node 388 net/sched/sch_fq.c struct rb_node **p, *parent; rb_node 405 net/sched/sch_fq.c p = &flow->t_root.rb_node; rb_node 458 net/sched/sch_fq.c struct rb_node *p; rb_node 604 net/sched/sch_fq.c struct rb_node *p = rb_first(&flow->t_root); rb_node 622 net/sched/sch_fq.c struct rb_node *p; rb_node 657 net/sched/sch_fq.c struct rb_node *op, **np, *parent; rb_node 675 net/sched/sch_fq.c np = &nroot->rb_node; rb_node 128 net/sched/sch_hfsc.c struct rb_node el_node; /* qdisc's eligible tree member */ rb_node 130 net/sched/sch_hfsc.c struct rb_node vt_node; /* parent's vt_tree member */ rb_node 132 net/sched/sch_hfsc.c struct rb_node cf_node; /* parent's cf_heap member */ rb_node 188 net/sched/sch_hfsc.c struct rb_node **p = &cl->sched->eligible.rb_node; rb_node 189 net/sched/sch_hfsc.c struct rb_node *parent = NULL; rb_node 222 net/sched/sch_hfsc.c struct rb_node *n; rb_node 238 net/sched/sch_hfsc.c struct rb_node *n; rb_node 253 net/sched/sch_hfsc.c struct rb_node **p = &cl->cl_parent->vt_tree.rb_node; rb_node 254 net/sched/sch_hfsc.c struct rb_node *parent = NULL; rb_node 286 net/sched/sch_hfsc.c struct rb_node *n; rb_node 322 net/sched/sch_hfsc.c struct rb_node **p = &cl->cl_parent->cf_tree.rb_node; rb_node 323 net/sched/sch_hfsc.c struct rb_node *parent = NULL; rb_node 653 net/sched/sch_hfsc.c struct rb_node *n = rb_first(&cl->cf_tree); rb_node 668 net/sched/sch_hfsc.c struct rb_node *n; rb_node 81 net/sched/sch_htb.c struct rb_node *ptr; rb_node 136 net/sched/sch_htb.c struct rb_node pq_node; /* node for event queue */ rb_node 137 net/sched/sch_htb.c struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */ rb_node 277 net/sched/sch_htb.c struct rb_node **p = &root->rb_node, *parent = NULL; rb_node 303 net/sched/sch_htb.c struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL; rb_node 332 net/sched/sch_htb.c static inline void htb_next_rb_node(struct rb_node **n) rb_node 355 net/sched/sch_htb.c static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root) rb_node 387 net/sched/sch_htb.c if (!hprio->row.rb_node) rb_node 411 net/sched/sch_htb.c if (p->inner.clprio[prio].feed.rb_node) rb_node 459 net/sched/sch_htb.c if (!p->inner.clprio[prio].feed.rb_node) rb_node 713 net/sched/sch_htb.c struct rb_node *p = rb_first(wait_pq); rb_node 741 net/sched/sch_htb.c static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n, rb_node 744 net/sched/sch_htb.c struct rb_node *r = NULL; rb_node 770 net/sched/sch_htb.c struct rb_node *root; rb_node 771 net/sched/sch_htb.c struct rb_node **pptr; rb_node 775 net/sched/sch_htb.c BUG_ON(!hprio->row.rb_node); rb_node 776 net/sched/sch_htb.c sp->root = hprio->row.rb_node; rb_node 811 net/sched/sch_htb.c (++sp)->root = clp->feed.rb_node; rb_node 363 net/sched/sch_netem.c struct rb_node *p = rb_first(&q->t_root); rb_node 390 net/sched/sch_netem.c struct rb_node **p = &q->t_root.rb_node, *parent = NULL; rb_node 546 net/sched/sch_netem.c if (q->t_root.rb_node) { rb_node 122 net/smc/smc.h struct rb_node alert_node; rb_node 69 net/smc/smc_core.c struct rb_node **link, *parent = NULL; rb_node 72 net/smc/smc_core.c link = &conn->lgr->conns_all.rb_node; rb_node 462 net/smc/smc_core.c struct rb_node *node; rb_node 261 net/smc/smc_core.h struct rb_node *node; rb_node 263 net/smc/smc_core.h node = lgr->conns_all.rb_node; rb_node 906 net/sunrpc/xprt.c struct rb_node *n = xprt->recv_queue.rb_node; rb_node 928 net/sunrpc/xprt.c struct rb_node **p = &xprt->recv_queue.rb_node; rb_node 929 net/sunrpc/xprt.c struct rb_node *n = NULL; rb_node 63 net/tipc/group.c struct rb_node tree_node; rb_node 234 net/tipc/group.c struct rb_node *n = grp->members.rb_node; rb_node 266 net/tipc/group.c struct rb_node *n; rb_node 280 net/tipc/group.c struct rb_node **n, *parent = NULL; rb_node 283 net/tipc/group.c n = &grp->members.rb_node; rb_node 392 net/tipc/group.c struct rb_node *n; rb_node 61 net/tipc/name_table.c struct rb_node tree_node; rb_node 146 net/tipc/name_table.c struct rb_node *n = sc->ranges.rb_node; rb_node 166 net/tipc/name_table.c struct rb_node *n = sc->ranges.rb_node; rb_node 188 net/tipc/name_table.c struct rb_node **n, *parent = NULL; rb_node 191 net/tipc/name_table.c n = &sc->ranges.rb_node; rb_node 292 net/tipc/name_table.c struct rb_node *n; rb_node 520 net/tipc/name_table.c struct rb_node *n; rb_node 555 net/tipc/name_table.c struct rb_node *n; rb_node 587 net/tipc/name_table.c struct rb_node *n; rb_node 878 net/tipc/name_table.c struct rb_node *n; rb_node 155 net/wireless/core.h struct rb_node rbn; rb_node 965 net/wireless/scan.c struct rb_node **p = &rdev->bss_tree.rb_node; rb_node 966 net/wireless/scan.c struct rb_node *parent = NULL; rb_node 996 net/wireless/scan.c struct rb_node *n = rdev->bss_tree.rb_node; rb_node 59 net/xfrm/xfrm_policy.c struct rb_node node; rb_node 894 net/xfrm/xfrm_policy.c struct rb_node **p, *parent; rb_node 900 net/xfrm/xfrm_policy.c p = &new->rb_node; rb_node 953 net/xfrm/xfrm_policy.c struct rb_node *rnode; rb_node 981 net/xfrm/xfrm_policy.c struct rb_node **p, *parent = NULL; rb_node 984 net/xfrm/xfrm_policy.c p = &root->rb_node; rb_node 1033 net/xfrm/xfrm_policy.c p = &root->rb_node; rb_node 1054 net/xfrm/xfrm_policy.c struct rb_node *rn = rb_first(r); rb_node 1909 net/xfrm/xfrm_policy.c const struct rb_node *parent; rb_node 1915 net/xfrm/xfrm_policy.c parent = rcu_dereference_raw(r->rb_node); rb_node 127 security/apparmor/include/label.h struct rb_node node; rb_node 638 security/apparmor/label.c struct rb_node **new, *parent = NULL; rb_node 647 security/apparmor/label.c new = &ls->root.rb_node; rb_node 694 security/apparmor/label.c struct rb_node *node; rb_node 700 security/apparmor/label.c node = vec_labelset(vec, n)->root.rb_node; rb_node 1116 security/apparmor/label.c struct rb_node *node; rb_node 1125 security/apparmor/label.c node = ls->root.rb_node; rb_node 1954 security/apparmor/label.c struct rb_node *node; rb_node 1986 security/apparmor/label.c struct rb_node *node; rb_node 36 security/integrity/iint.c struct rb_node *n = integrity_iint_tree.rb_node; rb_node 39 security/integrity/iint.c iint = rb_entry(n, struct integrity_iint_cache, rb_node); rb_node 97 security/integrity/iint.c struct rb_node **p; rb_node 98 security/integrity/iint.c struct rb_node *node, *parent = NULL; rb_node 111 security/integrity/iint.c p = &integrity_iint_tree.rb_node; rb_node 115 security/integrity/iint.c rb_node); rb_node 123 security/integrity/iint.c node = &iint->rb_node; rb_node 147 security/integrity/iint.c rb_erase(&iint->rb_node, &integrity_iint_tree); rb_node 120 security/integrity/integrity.h struct rb_node rb_node; /* rooted in integrity_iint_tree */ rb_node 180 security/keys/gc.c struct rb_node *cursor; rb_node 54 security/keys/internal.h struct rb_node node; rb_node 53 security/keys/key.c struct rb_node *parent, **p; rb_node 57 security/keys/key.c p = &key_user_tree.rb_node; rb_node 135 security/keys/key.c struct rb_node *parent, **p; rb_node 150 security/keys/key.c p = &key_serial_tree.rb_node; rb_node 657 security/keys/key.c struct rb_node *n; rb_node 663 security/keys/key.c n = key_serial_tree.rb_node; rb_node 1192 security/keys/key.c &key_user_tree.rb_node); rb_node 64 security/keys/proc.c static struct rb_node *key_serial_next(struct seq_file *p, struct rb_node *n) rb_node 81 security/keys/proc.c struct rb_node *n = key_serial_tree.rb_node; rb_node 129 security/keys/proc.c static inline key_serial_t key_node_serial(struct rb_node *n) rb_node 137 security/keys/proc.c struct rb_node *n; rb_node 155 security/keys/proc.c struct rb_node *_p = v; rb_node 252 security/keys/proc.c static struct rb_node *__key_user_next(struct user_namespace *user_ns, struct rb_node *n) rb_node 263 security/keys/proc.c static struct rb_node *key_user_next(struct user_namespace *user_ns, struct rb_node *n) rb_node 268 security/keys/proc.c static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r) rb_node 270 security/keys/proc.c struct rb_node *n = rb_first(r); rb_node 277 security/keys/proc.c struct rb_node *_p; rb_node 294 security/keys/proc.c return key_user_next(seq_user_ns(p), (struct rb_node *)v); rb_node 305 security/keys/proc.c struct rb_node *_p = v; rb_node 25 tools/include/linux/rbtree.h struct rb_node *rb_right; rb_node 26 tools/include/linux/rbtree.h struct rb_node *rb_left; rb_node 31 tools/include/linux/rbtree.h struct rb_node *rb_node; rb_node 34 tools/include/linux/rbtree.h #define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3)) rb_node 39 tools/include/linux/rbtree.h #define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL) rb_node 48 tools/include/linux/rbtree.h extern void rb_insert_color(struct rb_node *, struct rb_root *); rb_node 49 tools/include/linux/rbtree.h extern void rb_erase(struct rb_node *, struct rb_root *); rb_node 53 tools/include/linux/rbtree.h extern struct rb_node *rb_next(const struct rb_node *); rb_node 54 tools/include/linux/rbtree.h extern struct rb_node *rb_prev(const struct rb_node *); rb_node 55 tools/include/linux/rbtree.h extern struct rb_node *rb_first(const struct rb_root *); rb_node 56 tools/include/linux/rbtree.h extern struct rb_node *rb_last(const struct rb_root *); rb_node 59 tools/include/linux/rbtree.h extern struct rb_node *rb_first_postorder(const struct rb_root *); rb_node 60 tools/include/linux/rbtree.h extern struct rb_node *rb_next_postorder(const struct rb_node *); rb_node 63 tools/include/linux/rbtree.h extern void rb_replace_node(struct rb_node *victim, struct rb_node *new, rb_node 66 tools/include/linux/rbtree.h static inline void rb_link_node(struct rb_node *node, struct rb_node *parent, rb_node 67 tools/include/linux/rbtree.h struct rb_node **rb_link) rb_node 103 tools/include/linux/rbtree.h static inline void rb_erase_init(struct rb_node *n, struct rb_root *root) rb_node 121 tools/include/linux/rbtree.h struct rb_node *rb_leftmost; rb_node 129 tools/include/linux/rbtree.h static inline void rb_insert_color_cached(struct rb_node *node, rb_node 138 tools/include/linux/rbtree.h static inline void rb_erase_cached(struct rb_node *node, rb_node 146 tools/include/linux/rbtree.h static inline void rb_replace_node_cached(struct rb_node *victim, rb_node 147 tools/include/linux/rbtree.h struct rb_node *new, rb_node 30 tools/include/linux/rbtree_augmented.h void (*propagate)(struct rb_node *node, struct rb_node *stop); rb_node 31 tools/include/linux/rbtree_augmented.h void (*copy)(struct rb_node *old, struct rb_node *new); rb_node 32 tools/include/linux/rbtree_augmented.h void (*rotate)(struct rb_node *old, struct rb_node *new); rb_node 35 tools/include/linux/rbtree_augmented.h extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_node 36 tools/include/linux/rbtree_augmented.h void (*augment_rotate)(struct rb_node *old, struct rb_node *new)); rb_node 49 tools/include/linux/rbtree_augmented.h rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_node 56 tools/include/linux/rbtree_augmented.h rb_insert_augmented_cached(struct rb_node *node, rb_node 79 tools/include/linux/rbtree_augmented.h RBNAME ## _propagate(struct rb_node *rb, struct rb_node *stop) \ rb_node 89 tools/include/linux/rbtree_augmented.h RBNAME ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \ rb_node 96 tools/include/linux/rbtree_augmented.h RBNAME ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \ rb_node 150 tools/include/linux/rbtree_augmented.h #define __rb_parent(pc) ((struct rb_node *)(pc & ~3)) rb_node 159 tools/include/linux/rbtree_augmented.h static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p) rb_node 164 tools/include/linux/rbtree_augmented.h static inline void rb_set_parent_color(struct rb_node *rb, rb_node 165 tools/include/linux/rbtree_augmented.h struct rb_node *p, int color) rb_node 171 tools/include/linux/rbtree_augmented.h __rb_change_child(struct rb_node *old, struct rb_node *new, rb_node 172 tools/include/linux/rbtree_augmented.h struct rb_node *parent, struct rb_root *root) rb_node 180 tools/include/linux/rbtree_augmented.h WRITE_ONCE(root->rb_node, new); rb_node 183 tools/include/linux/rbtree_augmented.h extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_node 184 tools/include/linux/rbtree_augmented.h void (*augment_rotate)(struct rb_node *old, struct rb_node *new)); rb_node 186 tools/include/linux/rbtree_augmented.h static __always_inline struct rb_node * rb_node 187 tools/include/linux/rbtree_augmented.h __rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_node 190 tools/include/linux/rbtree_augmented.h struct rb_node *child = node->rb_right; rb_node 191 tools/include/linux/rbtree_augmented.h struct rb_node *tmp = node->rb_left; rb_node 192 tools/include/linux/rbtree_augmented.h struct rb_node *parent, *rebalance; rb_node 220 tools/include/linux/rbtree_augmented.h struct rb_node *successor = child, *child2; rb_node 291 tools/include/linux/rbtree_augmented.h rb_erase_augmented(struct rb_node *node, struct rb_root *root, rb_node 294 tools/include/linux/rbtree_augmented.h struct rb_node *rebalance = __rb_erase_augmented(node, root, augment); rb_node 300 tools/include/linux/rbtree_augmented.h rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root, rb_node 33 tools/lib/lockdep/preload.c struct rb_node node; rb_node 101 tools/lib/lockdep/preload.c static struct rb_node **__get_lock_node(void *lock, struct rb_node **parent) rb_node 103 tools/lib/lockdep/preload.c struct rb_node **node = &locks.rb_node; rb_node 177 tools/lib/lockdep/preload.c struct rb_node **node, *parent; rb_node 59 tools/lib/rbtree.c static inline void rb_set_black(struct rb_node *rb) rb_node 64 tools/lib/rbtree.c static inline struct rb_node *rb_red_parent(struct rb_node *red) rb_node 66 tools/lib/rbtree.c return (struct rb_node *)red->__rb_parent_color; rb_node 75 tools/lib/rbtree.c __rb_rotate_set_parents(struct rb_node *old, struct rb_node *new, rb_node 78 tools/lib/rbtree.c struct rb_node *parent = rb_parent(old); rb_node 85 tools/lib/rbtree.c __rb_insert(struct rb_node *node, struct rb_root *root, rb_node 86 tools/lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 88 tools/lib/rbtree.c struct rb_node *parent = rb_red_parent(node), *gparent, *tmp; rb_node 227 tools/lib/rbtree.c ____rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_node 228 tools/lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 230 tools/lib/rbtree.c struct rb_node *node = NULL, *sibling, *tmp1, *tmp2; rb_node 410 tools/lib/rbtree.c void __rb_erase_color(struct rb_node *parent, struct rb_root *root, rb_node 411 tools/lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 423 tools/lib/rbtree.c static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {} rb_node 424 tools/lib/rbtree.c static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {} rb_node 425 tools/lib/rbtree.c static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {} rb_node 433 tools/lib/rbtree.c void rb_insert_color(struct rb_node *node, struct rb_root *root) rb_node 438 tools/lib/rbtree.c void rb_erase(struct rb_node *node, struct rb_root *root) rb_node 440 tools/lib/rbtree.c struct rb_node *rebalance; rb_node 453 tools/lib/rbtree.c void __rb_insert_augmented(struct rb_node *node, struct rb_root *root, rb_node 454 tools/lib/rbtree.c void (*augment_rotate)(struct rb_node *old, struct rb_node *new)) rb_node 462 tools/lib/rbtree.c struct rb_node *rb_first(const struct rb_root *root) rb_node 464 tools/lib/rbtree.c struct rb_node *n; rb_node 466 tools/lib/rbtree.c n = root->rb_node; rb_node 474 tools/lib/rbtree.c struct rb_node *rb_last(const struct rb_root *root) rb_node 476 tools/lib/rbtree.c struct rb_node *n; rb_node 478 tools/lib/rbtree.c n = root->rb_node; rb_node 486 tools/lib/rbtree.c struct rb_node *rb_next(const struct rb_node *node) rb_node 488 tools/lib/rbtree.c struct rb_node *parent; rb_node 501 tools/lib/rbtree.c return (struct rb_node *)node; rb_node 517 tools/lib/rbtree.c struct rb_node *rb_prev(const struct rb_node *node) rb_node 519 tools/lib/rbtree.c struct rb_node *parent; rb_node 532 tools/lib/rbtree.c return (struct rb_node *)node; rb_node 545 tools/lib/rbtree.c void rb_replace_node(struct rb_node *victim, struct rb_node *new, rb_node 548 tools/lib/rbtree.c struct rb_node *parent = rb_parent(victim); rb_node 561 tools/lib/rbtree.c static struct rb_node *rb_left_deepest_node(const struct rb_node *node) rb_node 569 tools/lib/rbtree.c return (struct rb_node *)node; rb_node 573 tools/lib/rbtree.c struct rb_node *rb_next_postorder(const struct rb_node *node) rb_node 575 tools/lib/rbtree.c const struct rb_node *parent; rb_node 588 tools/lib/rbtree.c return (struct rb_node *)parent; rb_node 591 tools/lib/rbtree.c struct rb_node *rb_first_postorder(const struct rb_root *root) rb_node 593 tools/lib/rbtree.c if (!root->rb_node) rb_node 596 tools/lib/rbtree.c return rb_left_deepest_node(root->rb_node); rb_node 134 tools/perf/arch/powerpc/util/sym-handling.c struct rb_node *tmp; rb_node 235 tools/perf/builtin-annotate.c rb_erase_cached(&al->sym->rb_node, rb_node 313 tools/perf/builtin-annotate.c struct rb_node *nd = rb_first_cached(&hists->entries), *next; rb_node 317 tools/perf/builtin-annotate.c struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); rb_node 2106 tools/perf/builtin-c2c.c struct rb_node *next = rb_first_cached(&hists->entries); rb_node 2112 tools/perf/builtin-c2c.c he = rb_entry(next, struct hist_entry, rb_node); rb_node 2116 tools/perf/builtin-c2c.c next = rb_next(&he->rb_node); rb_node 2217 tools/perf/builtin-c2c.c struct rb_node *nd; rb_node 2236 tools/perf/builtin-c2c.c struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); rb_node 2301 tools/perf/builtin-c2c.c struct rb_node *nd = rb_first_cached(&hb->hists->entries); rb_node 2304 tools/perf/builtin-c2c.c struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node); rb_node 514 tools/perf/builtin-diff.c struct rb_node *next; rb_node 675 tools/perf/builtin-diff.c struct rb_node *next = rb_first_cached(root); rb_node 707 tools/perf/builtin-diff.c struct rb_node *next = rb_first_cached(root); rb_node 733 tools/perf/builtin-diff.c struct rb_node *next; rb_node 70 tools/perf/builtin-kmem.c struct rb_node node; rb_node 88 tools/perf/builtin-kmem.c struct rb_node **node = &root_alloc_stat.rb_node; rb_node 89 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 133 tools/perf/builtin-kmem.c struct rb_node **node = &root_caller_stat.rb_node; rb_node 134 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 215 tools/perf/builtin-kmem.c struct rb_node *node = root->rb_node; rb_node 281 tools/perf/builtin-kmem.c struct rb_node node; rb_node 338 tools/perf/builtin-kmem.c struct rb_node *node; rb_node 444 tools/perf/builtin-kmem.c struct rb_node **node = &page_live_tree.rb_node; rb_node 445 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 493 tools/perf/builtin-kmem.c struct rb_node **node = &page_alloc_tree.rb_node; rb_node 494 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 548 tools/perf/builtin-kmem.c struct rb_node **node = &page_caller_tree.rb_node; rb_node 549 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 993 tools/perf/builtin-kmem.c struct rb_node *next; rb_node 1054 tools/perf/builtin-kmem.c struct rb_node *next = rb_first(&page_alloc_sorted); rb_node 1103 tools/perf/builtin-kmem.c struct rb_node *next = rb_first(&page_caller_sorted); rb_node 1256 tools/perf/builtin-kmem.c struct rb_node **new = &(root->rb_node); rb_node 1257 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 1286 tools/perf/builtin-kmem.c struct rb_node *node; rb_node 1303 tools/perf/builtin-kmem.c struct rb_node **new = &root->rb_node; rb_node 1304 tools/perf/builtin-kmem.c struct rb_node *parent = NULL; rb_node 1333 tools/perf/builtin-kmem.c struct rb_node *node; rb_node 510 tools/perf/builtin-kvm.c struct rb_node **rb = &result->rb_node; rb_node 511 tools/perf/builtin-kvm.c struct rb_node *parent = NULL; rb_node 562 tools/perf/builtin-kvm.c struct rb_node *node = rb_first(result); rb_node 48 tools/perf/builtin-lock.c struct rb_node rb; /* used for sorting */ rb_node 115 tools/perf/builtin-lock.c struct rb_node rb; rb_node 125 tools/perf/builtin-lock.c struct rb_node *node; rb_node 128 tools/perf/builtin-lock.c node = thread_stats.rb_node; rb_node 144 tools/perf/builtin-lock.c struct rb_node **rb = &thread_stats.rb_node; rb_node 145 tools/perf/builtin-lock.c struct rb_node *parent = NULL; rb_node 202 tools/perf/builtin-lock.c rb_link_node(&st->rb, NULL, &thread_stats.rb_node); rb_node 285 tools/perf/builtin-lock.c struct rb_node **rb = &result.rb_node; rb_node 286 tools/perf/builtin-lock.c struct rb_node *parent = NULL; rb_node 306 tools/perf/builtin-lock.c struct rb_node *node = result.rb_node; rb_node 766 tools/perf/builtin-lock.c struct rb_node *node; rb_node 729 tools/perf/builtin-report.c struct rb_node *nd; rb_node 732 tools/perf/builtin-report.c struct map *map = rb_entry(nd, struct map, rb_node); rb_node 776 tools/perf/builtin-report.c struct rb_node *nd; rb_node 799 tools/perf/builtin-report.c task->thread = rb_entry(nd, struct thread, rb_node); rb_node 128 tools/perf/builtin-sched.c struct rb_node node; rb_node 963 tools/perf/builtin-sched.c struct rb_node *node = root->rb_root.rb_node; rb_node 989 tools/perf/builtin-sched.c struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; rb_node 1459 tools/perf/builtin-sched.c struct rb_node *node; rb_node 2778 tools/perf/builtin-sched.c struct rb_node *rb_node = rb_first_cached(root); rb_node 2784 tools/perf/builtin-sched.c while (rb_node) { rb_node 2785 tools/perf/builtin-sched.c chain = rb_entry(rb_node, struct callchain_node, rb_node); rb_node 2786 tools/perf/builtin-sched.c rb_node = rb_next(rb_node); rb_node 3085 tools/perf/builtin-sched.c struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL; rb_node 3126 tools/perf/builtin-sched.c struct rb_node *node; rb_node 3140 tools/perf/builtin-sched.c struct rb_node *next; rb_node 392 tools/perf/builtin-top.c struct rb_node *next; rb_node 411 tools/perf/builtin-top.c n = rb_entry(next, struct hist_entry, rb_node); rb_node 416 tools/perf/builtin-top.c next = rb_next(&n->rb_node); rb_node 3673 tools/perf/builtin-trace.c struct int_node *source = rb_entry(nd, struct int_node, rb_node); rb_node 3686 tools/perf/builtin-trace.c struct rb_node *nd; rb_node 3761 tools/perf/builtin-trace.c entry->thread = rb_entry(nd, struct thread, rb_node); rb_node 3767 tools/perf/builtin-trace.c struct rb_node *nd; rb_node 167 tools/perf/tests/hists_common.c struct rb_node *node; rb_node 197 tools/perf/tests/hists_common.c struct rb_node *node; rb_node 206 tools/perf/tests/hists_common.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 131 tools/perf/tests/hists_cumulate.c struct rb_node *node; rb_node 143 tools/perf/tests/hists_cumulate.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 184 tools/perf/tests/hists_cumulate.c struct rb_node *node; rb_node 204 tools/perf/tests/hists_cumulate.c node && (he = rb_entry(node, struct hist_entry, rb_node)); rb_node 225 tools/perf/tests/hists_cumulate.c cnode = rb_entry(rb_first(root), struct callchain_node, rb_node); rb_node 145 tools/perf/tests/hists_link.c struct rb_node *node; rb_node 195 tools/perf/tests/hists_link.c struct rb_node *node; rb_node 97 tools/perf/tests/hists_output.c struct rb_node *node; rb_node 109 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 131 tools/perf/tests/hists_output.c struct rb_node *node; rb_node 167 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 173 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 179 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 185 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 191 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 197 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 203 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 209 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 215 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 233 tools/perf/tests/hists_output.c struct rb_node *node; rb_node 267 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 272 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 289 tools/perf/tests/hists_output.c struct rb_node *node; rb_node 321 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 327 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 333 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 339 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 345 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 363 tools/perf/tests/hists_output.c struct rb_node *node; rb_node 399 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 405 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 411 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 417 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 423 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 429 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 435 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 441 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 447 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 465 tools/perf/tests/hists_output.c struct rb_node *node; rb_node 502 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 510 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 517 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 524 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 531 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 538 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 545 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 552 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 559 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 566 tools/perf/tests/hists_output.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 20 tools/perf/tests/vmlinux-kallsyms.c struct rb_node *nd; rb_node 115 tools/perf/tests/vmlinux-kallsyms.c sym = rb_entry(nd, struct symbol, rb_node); rb_node 141 tools/perf/ui/browser.c struct rb_node *nd; rb_node 170 tools/perf/ui/browser.c struct rb_node *nd; rb_node 32 tools/perf/ui/browsers/annotate.c struct rb_node *curr_hot; rb_node 248 tools/perf/ui/browsers/annotate.c struct rb_node **p = &root->rb_node; rb_node 249 tools/perf/ui/browsers/annotate.c struct rb_node *parent = NULL; rb_node 254 tools/perf/ui/browsers/annotate.c l = rb_entry(parent, struct annotation_line, rb_node); rb_node 261 tools/perf/ui/browsers/annotate.c rb_link_node(&al->rb_node, parent, p); rb_node 262 tools/perf/ui/browsers/annotate.c rb_insert_color(&al->rb_node, root); rb_node 290 tools/perf/ui/browsers/annotate.c struct rb_node *nd) rb_node 293 tools/perf/ui/browsers/annotate.c struct annotation_line * pos = rb_entry(nd, struct annotation_line, rb_node); rb_node 321 tools/perf/ui/browsers/annotate.c RB_CLEAR_NODE(&pos->al.rb_node); rb_node 336 tools/perf/ui/browsers/annotate.c RB_CLEAR_NODE(&pos->al.rb_node); rb_node 663 tools/perf/ui/browsers/annotate.c struct rb_node *nd = NULL; rb_node 50 tools/perf/ui/browsers/hists.c static struct rb_node *hists__filter_entries(struct rb_node *nd, rb_node 60 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 68 tools/perf/ui/browsers/hists.c rb_entry(nd, struct hist_entry, rb_node); rb_node 176 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 179 tools/perf/ui/browsers/hists.c struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); rb_node 258 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 262 tools/perf/ui/browsers/hists.c struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); rb_node 273 tools/perf/ui/browsers/hists.c struct rb_node *node; rb_node 286 tools/perf/ui/browsers/hists.c child = rb_entry(node, struct hist_entry, rb_node); rb_node 327 tools/perf/ui/browsers/hists.c struct rb_node *nd = rb_first(&node->rb_root); rb_node 330 tools/perf/ui/browsers/hists.c struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); rb_node 366 tools/perf/ui/browsers/hists.c struct rb_node *nd = rb_first(root); rb_node 370 tools/perf/ui/browsers/hists.c struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); rb_node 464 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 467 tools/perf/ui/browsers/hists.c struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node); rb_node 504 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 508 tools/perf/ui/browsers/hists.c struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node); rb_node 519 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 524 tools/perf/ui/browsers/hists.c child = rb_entry(nd, struct hist_entry, rb_node); rb_node 578 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 583 tools/perf/ui/browsers/hists.c he = rb_entry(nd, struct hist_entry, rb_node); rb_node 676 tools/perf/ui/browsers/hists.c struct hist_entry, rb_node); rb_node 843 tools/perf/ui/browsers/hists.c static bool check_percent_display(struct rb_node *node, u64 parent_total) rb_node 853 tools/perf/ui/browsers/hists.c child = rb_entry(node, struct callchain_node, rb_node); rb_node 865 tools/perf/ui/browsers/hists.c struct rb_node *node; rb_node 873 tools/perf/ui/browsers/hists.c struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); rb_node 874 tools/perf/ui/browsers/hists.c struct rb_node *next = rb_next(node); rb_node 969 tools/perf/ui/browsers/hists.c struct rb_node *node; rb_node 977 tools/perf/ui/browsers/hists.c struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); rb_node 978 tools/perf/ui/browsers/hists.c struct rb_node *next = rb_next(node); rb_node 1054 tools/perf/ui/browsers/hists.c struct rb_node *node; rb_node 1066 tools/perf/ui/browsers/hists.c struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node); rb_node 1067 tools/perf/ui/browsers/hists.c struct rb_node *next = rb_next(node); rb_node 1766 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 1777 tools/perf/ui/browsers/hists.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 1811 tools/perf/ui/browsers/hists.c static struct rb_node *hists__filter_entries(struct rb_node *nd, rb_node 1815 tools/perf/ui/browsers/hists.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 1834 tools/perf/ui/browsers/hists.c static struct rb_node *hists__filter_prev_entries(struct rb_node *nd, rb_node 1838 tools/perf/ui/browsers/hists.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 1854 tools/perf/ui/browsers/hists.c struct rb_node *nd; rb_node 1886 tools/perf/ui/browsers/hists.c h = rb_entry(browser->top, struct hist_entry, rb_node); rb_node 1908 tools/perf/ui/browsers/hists.c h = rb_entry(nd, struct hist_entry, rb_node); rb_node 1930 tools/perf/ui/browsers/hists.c h = rb_entry(nd, struct hist_entry, rb_node); rb_node 1967 tools/perf/ui/browsers/hists.c h = rb_entry(nd, struct hist_entry, rb_node); rb_node 1976 tools/perf/ui/browsers/hists.c h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2097 tools/perf/ui/browsers/hists.c struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries), rb_node 2102 tools/perf/ui/browsers/hists.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2765 tools/perf/ui/browsers/hists.c struct rb_node *nd = rb_first_cached(&hb->hists->entries); rb_node 2785 tools/perf/ui/browsers/hists.c struct rb_node *nd = rb_first_cached(&hb->hists->entries); rb_node 2792 tools/perf/ui/browsers/hists.c he = rb_entry(nd, struct hist_entry, rb_node); rb_node 27 tools/perf/ui/browsers/map.c struct symbol *sym = rb_entry(nd, struct symbol, rb_node); rb_node 45 tools/perf/ui/browsers/map.c return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32); rb_node 67 tools/perf/ui/browsers/map.c browser->b.top = &sym->rb_node; rb_node 116 tools/perf/ui/browsers/map.c struct rb_node *nd; rb_node 121 tools/perf/ui/browsers/map.c struct symbol *pos = rb_entry(nd, struct symbol, rb_node); rb_node 100 tools/perf/ui/gtk/hists.c struct rb_node *nd; rb_node 109 tools/perf/ui/gtk/hists.c node = rb_entry(nd, struct callchain_node, rb_node); rb_node 163 tools/perf/ui/gtk/hists.c struct rb_node *nd; rb_node 173 tools/perf/ui/gtk/hists.c node = rb_entry(nd, struct callchain_node, rb_node); rb_node 223 tools/perf/ui/gtk/hists.c struct rb_node *nd; rb_node 233 tools/perf/ui/gtk/hists.c node = rb_entry(nd, struct callchain_node, rb_node); rb_node 300 tools/perf/ui/gtk/hists.c struct rb_node *nd; rb_node 359 tools/perf/ui/gtk/hists.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 413 tools/perf/ui/gtk/hists.c struct rb_node *node; rb_node 425 tools/perf/ui/gtk/hists.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 112 tools/perf/ui/stdio/hist.c struct rb_node *node, *next; rb_node 129 tools/perf/ui/stdio/hist.c child = rb_entry(node, struct callchain_node, rb_node); rb_node 205 tools/perf/ui/stdio/hist.c static bool need_percent_display(struct rb_node *node, u64 parent_samples) rb_node 212 tools/perf/ui/stdio/hist.c cnode = rb_entry(node, struct callchain_node, rb_node); rb_node 224 tools/perf/ui/stdio/hist.c struct rb_node *node; rb_node 231 tools/perf/ui/stdio/hist.c cnode = rb_entry(node, struct callchain_node, rb_node); rb_node 310 tools/perf/ui/stdio/hist.c struct rb_node *rb_node = rb_first(tree); rb_node 312 tools/perf/ui/stdio/hist.c while (rb_node) { rb_node 313 tools/perf/ui/stdio/hist.c chain = rb_entry(rb_node, struct callchain_node, rb_node); rb_node 323 tools/perf/ui/stdio/hist.c rb_node = rb_next(rb_node); rb_node 361 tools/perf/ui/stdio/hist.c struct rb_node *rb_node = rb_first(tree); rb_node 363 tools/perf/ui/stdio/hist.c while (rb_node) { rb_node 365 tools/perf/ui/stdio/hist.c chain = rb_entry(rb_node, struct callchain_node, rb_node); rb_node 374 tools/perf/ui/stdio/hist.c rb_node = rb_next(rb_node); rb_node 798 tools/perf/ui/stdio/hist.c struct rb_node *nd; rb_node 831 tools/perf/ui/stdio/hist.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2119 tools/perf/util/annotate.c struct rb_node **p = &root->rb_node; rb_node 2120 tools/perf/util/annotate.c struct rb_node *parent = NULL; rb_node 2125 tools/perf/util/annotate.c iter = rb_entry(parent, struct annotation_line, rb_node); rb_node 2147 tools/perf/util/annotate.c rb_link_node(&al->rb_node, parent, p); rb_node 2148 tools/perf/util/annotate.c rb_insert_color(&al->rb_node, root); rb_node 2167 tools/perf/util/annotate.c struct rb_node **p = &root->rb_node; rb_node 2168 tools/perf/util/annotate.c struct rb_node *parent = NULL; rb_node 2172 tools/perf/util/annotate.c iter = rb_entry(parent, struct annotation_line, rb_node); rb_node 2180 tools/perf/util/annotate.c rb_link_node(&al->rb_node, parent, p); rb_node 2181 tools/perf/util/annotate.c rb_insert_color(&al->rb_node, root); rb_node 2187 tools/perf/util/annotate.c struct rb_node *node; rb_node 2191 tools/perf/util/annotate.c struct rb_node *next; rb_node 2193 tools/perf/util/annotate.c al = rb_entry(node, struct annotation_line, rb_node); rb_node 2205 tools/perf/util/annotate.c struct rb_node *node; rb_node 2222 tools/perf/util/annotate.c al = rb_entry(node, struct annotation_line, rb_node); rb_node 132 tools/perf/util/annotate.h struct rb_node rb_node; rb_node 19 tools/perf/util/block-range.c struct rb_node *rb; rb_node 35 tools/perf/util/block-range.c struct rb_node **p = &block_ranges.root.rb_node; rb_node 36 tools/perf/util/block-range.c struct rb_node *parent = NULL; rb_node 54 tools/perf/util/block-range.c static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node) rb_node 56 tools/perf/util/block-range.c struct rb_node **p = &node->rb_left; rb_node 64 tools/perf/util/block-range.c static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node) rb_node 66 tools/perf/util/block-range.c struct rb_node **p = &node->rb_right; rb_node 83 tools/perf/util/block-range.c struct rb_node **p = &block_ranges.root.rb_node; rb_node 84 tools/perf/util/block-range.c struct rb_node *n, *parent = NULL; rb_node 23 tools/perf/util/block-range.h struct rb_node node; rb_node 40 tools/perf/util/block-range.h struct rb_node *n = rb_next(&br->node); rb_node 23 tools/perf/util/bpf-event.h struct rb_node rb_node; rb_node 27 tools/perf/util/bpf-event.h struct rb_node rb_node; rb_node 366 tools/perf/util/build-id.c struct rb_node *nd; rb_node 374 tools/perf/util/build-id.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 399 tools/perf/util/build-id.c struct rb_node *nd; rb_node 408 tools/perf/util/build-id.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 849 tools/perf/util/build-id.c struct rb_node *nd; rb_node 862 tools/perf/util/build-id.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 875 tools/perf/util/build-id.c struct rb_node *nd; rb_node 880 tools/perf/util/build-id.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 22 tools/perf/util/call-path.c RB_CLEAR_NODE(&cp->rb_node); rb_node 81 tools/perf/util/call-path.c struct rb_node **p; rb_node 82 tools/perf/util/call-path.c struct rb_node *node_parent = NULL; rb_node 92 tools/perf/util/call-path.c p = &parent->children.rb_node; rb_node 95 tools/perf/util/call-path.c cp = rb_entry(node_parent, struct call_path, rb_node); rb_node 110 tools/perf/util/call-path.c rb_link_node(&cp->rb_node, node_parent, p); rb_node 111 tools/perf/util/call-path.c rb_insert_color(&cp->rb_node, &parent->children); rb_node 34 tools/perf/util/call-path.h struct rb_node rb_node; rb_node 375 tools/perf/util/callchain.c struct rb_node **p = &root->rb_node; rb_node 376 tools/perf/util/callchain.c struct rb_node *parent = NULL; rb_node 384 tools/perf/util/callchain.c rnode = rb_entry(parent, struct callchain_node, rb_node); rb_node 408 tools/perf/util/callchain.c rb_link_node(&chain->rb_node, parent, p); rb_node 409 tools/perf/util/callchain.c rb_insert_color(&chain->rb_node, root); rb_node 416 tools/perf/util/callchain.c struct rb_node *n; rb_node 446 tools/perf/util/callchain.c struct rb_node *n; rb_node 468 tools/perf/util/callchain.c rb_root->rb_node = chain_root->node.rb_root.rb_node; rb_node 474 tools/perf/util/callchain.c struct rb_node *n; rb_node 498 tools/perf/util/callchain.c rb_root->rb_node = chain_root->node.rb_root.rb_node; rb_node 540 tools/perf/util/callchain.c struct rb_node *n; rb_node 554 tools/perf/util/callchain.c rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node); rb_node 826 tools/perf/util/callchain.c struct rb_node *p, **pp; rb_node 842 tools/perf/util/callchain.c p = parent->rb_root_in.rb_node; rb_node 873 tools/perf/util/callchain.c struct rb_node **p = &root->rb_root_in.rb_node; rb_node 874 tools/perf/util/callchain.c struct rb_node *parent = NULL; rb_node 1002 tools/perf/util/callchain.c struct rb_node *n; rb_node 1259 tools/perf/util/callchain.c struct rb_node *n; rb_node 1458 tools/perf/util/callchain.c struct rb_node *n; rb_node 1494 tools/perf/util/callchain.c struct rb_node *n; rb_node 1543 tools/perf/util/callchain.c chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node); rb_node 63 tools/perf/util/callchain.h struct rb_node rb_node_in; /* to insert nodes in an rbtree */ rb_node 64 tools/perf/util/callchain.h struct rb_node rb_node; /* to sort nodes in an output tree */ rb_node 14 tools/perf/util/comm.c struct rb_node rb_node; rb_node 34 tools/perf/util/comm.c rb_erase(&cs->rb_node, &comm_str_root); rb_node 63 tools/perf/util/comm.c struct rb_node **p = &root->rb_node; rb_node 64 tools/perf/util/comm.c struct rb_node *parent = NULL; rb_node 70 tools/perf/util/comm.c iter = rb_entry(parent, struct comm_str, rb_node); rb_node 91 tools/perf/util/comm.c rb_link_node(&new->rb_node, parent, p); rb_node 92 tools/perf/util/comm.c rb_insert_color(&new->rb_node, root); rb_node 757 tools/perf/util/dso.c struct rb_node *next = rb_first(root); rb_node 763 tools/perf/util/dso.c cache = rb_entry(next, struct dso_cache, rb_node); rb_node 764 tools/perf/util/dso.c next = rb_next(&cache->rb_node); rb_node 765 tools/perf/util/dso.c rb_erase(&cache->rb_node, root); rb_node 774 tools/perf/util/dso.c struct rb_node * const *p = &root->rb_node; rb_node 775 tools/perf/util/dso.c const struct rb_node *parent = NULL; rb_node 782 tools/perf/util/dso.c cache = rb_entry(parent, struct dso_cache, rb_node); rb_node 800 tools/perf/util/dso.c struct rb_node **p = &root->rb_node; rb_node 801 tools/perf/util/dso.c struct rb_node *parent = NULL; rb_node 810 tools/perf/util/dso.c cache = rb_entry(parent, struct dso_cache, rb_node); rb_node 821 tools/perf/util/dso.c rb_link_node(&new->rb_node, parent, p); rb_node 822 tools/perf/util/dso.c rb_insert_color(&new->rb_node, root); rb_node 1110 tools/perf/util/dso.c rb_erase(&dso->rb_node, root); rb_node 1115 tools/perf/util/dso.c RB_CLEAR_NODE(&dso->rb_node); rb_node 1191 tools/perf/util/dso.c RB_CLEAR_NODE(&dso->rb_node); rb_node 1204 tools/perf/util/dso.c if (!RB_EMPTY_NODE(&dso->rb_node)) rb_node 1300 tools/perf/util/dso.c struct rb_node *nd; rb_node 1309 tools/perf/util/dso.c struct symbol *pos = rb_entry(nd, struct symbol, rb_node); rb_node 126 tools/perf/util/dso.h struct rb_node rb_node; rb_node 137 tools/perf/util/dso.h struct rb_node rb_node; /* rbtree node sorted by long name */ rb_node 44 tools/perf/util/dsos.c struct rb_node **p = &root->rb_node; rb_node 45 tools/perf/util/dsos.c struct rb_node *parent = NULL; rb_node 53 tools/perf/util/dsos.c struct dso *this = rb_entry(*p, struct dso, rb_node); rb_node 83 tools/perf/util/dsos.c rb_link_node(&dso->rb_node, parent, p); rb_node 84 tools/perf/util/dsos.c rb_insert_color(&dso->rb_node, root); rb_node 21 tools/perf/util/env.c struct rb_node *parent = NULL; rb_node 22 tools/perf/util/env.c struct rb_node **p; rb_node 25 tools/perf/util/env.c p = &env->bpf_progs.infos.rb_node; rb_node 29 tools/perf/util/env.c node = rb_entry(parent, struct bpf_prog_info_node, rb_node); rb_node 40 tools/perf/util/env.c rb_link_node(&info_node->rb_node, parent, p); rb_node 41 tools/perf/util/env.c rb_insert_color(&info_node->rb_node, &env->bpf_progs.infos); rb_node 51 tools/perf/util/env.c struct rb_node *n; rb_node 54 tools/perf/util/env.c n = env->bpf_progs.infos.rb_node; rb_node 57 tools/perf/util/env.c node = rb_entry(n, struct bpf_prog_info_node, rb_node); rb_node 74 tools/perf/util/env.c struct rb_node *parent = NULL; rb_node 77 tools/perf/util/env.c struct rb_node **p; rb_node 80 tools/perf/util/env.c p = &env->bpf_progs.btfs.rb_node; rb_node 84 tools/perf/util/env.c node = rb_entry(parent, struct btf_node, rb_node); rb_node 95 tools/perf/util/env.c rb_link_node(&btf_node->rb_node, parent, p); rb_node 96 tools/perf/util/env.c rb_insert_color(&btf_node->rb_node, &env->bpf_progs.btfs); rb_node 105 tools/perf/util/env.c struct rb_node *n; rb_node 108 tools/perf/util/env.c n = env->bpf_progs.btfs.rb_node; rb_node 111 tools/perf/util/env.c node = rb_entry(n, struct btf_node, rb_node); rb_node 130 tools/perf/util/env.c struct rb_node *next; rb_node 140 tools/perf/util/env.c node = rb_entry(next, struct bpf_prog_info_node, rb_node); rb_node 141 tools/perf/util/env.c next = rb_next(&node->rb_node); rb_node 142 tools/perf/util/env.c rb_erase(&node->rb_node, root); rb_node 154 tools/perf/util/env.c node = rb_entry(next, struct btf_node, rb_node); rb_node 155 tools/perf/util/env.c next = rb_next(&node->rb_node); rb_node 156 tools/perf/util/env.c rb_erase(&node->rb_node, root); rb_node 920 tools/perf/util/header.c struct rb_node *next; rb_node 936 tools/perf/util/header.c node = rb_entry(next, struct bpf_prog_info_node, rb_node); rb_node 937 tools/perf/util/header.c next = rb_next(&node->rb_node); rb_node 969 tools/perf/util/header.c struct rb_node *next; rb_node 985 tools/perf/util/header.c node = rb_entry(next, struct btf_node, rb_node); rb_node 986 tools/perf/util/header.c next = rb_next(&node->rb_node); rb_node 1536 tools/perf/util/header.c struct rb_node *next; rb_node 1546 tools/perf/util/header.c node = rb_entry(next, struct bpf_prog_info_node, rb_node); rb_node 1547 tools/perf/util/header.c next = rb_next(&node->rb_node); rb_node 1560 tools/perf/util/header.c struct rb_node *next; rb_node 1570 tools/perf/util/header.c node = rb_entry(next, struct btf_node, rb_node); rb_node 1571 tools/perf/util/header.c next = rb_next(&node->rb_node); rb_node 226 tools/perf/util/hist.c struct rb_node *next = rb_first_cached(&hists->entries); rb_node 233 tools/perf/util/hist.c n = rb_entry(next, struct hist_entry, rb_node); rb_node 236 tools/perf/util/hist.c next = rb_next(&n->rb_node); rb_node 321 tools/perf/util/hist.c struct rb_node *node = rb_first_cached(&he->hroot_out); rb_node 323 tools/perf/util/hist.c child = rb_entry(node, struct hist_entry, rb_node); rb_node 351 tools/perf/util/hist.c rb_erase_cached(&he->rb_node, root_out); rb_node 362 tools/perf/util/hist.c struct rb_node *next = rb_first_cached(&hists->entries); rb_node 366 tools/perf/util/hist.c n = rb_entry(next, struct hist_entry, rb_node); rb_node 367 tools/perf/util/hist.c next = rb_next(&n->rb_node); rb_node 378 tools/perf/util/hist.c struct rb_node *next = rb_first_cached(&hists->entries); rb_node 382 tools/perf/util/hist.c n = rb_entry(next, struct hist_entry, rb_node); rb_node 383 tools/perf/util/hist.c next = rb_next(&n->rb_node); rb_node 391 tools/perf/util/hist.c struct rb_node *next = rb_first_cached(&hists->entries); rb_node 396 tools/perf/util/hist.c n = rb_entry(next, struct hist_entry, rb_node); rb_node 400 tools/perf/util/hist.c next = rb_next(&n->rb_node); rb_node 569 tools/perf/util/hist.c struct rb_node **p; rb_node 570 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 577 tools/perf/util/hist.c p = &hists->entries_in->rb_root.rb_node; rb_node 1400 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_node 1401 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 1517 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_node 1518 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 1590 tools/perf/util/hist.c struct rb_node *next; rb_node 1677 tools/perf/util/hist.c struct rb_node *node; rb_node 1691 tools/perf/util/hist.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 1703 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_node 1704 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 1711 tools/perf/util/hist.c iter = rb_entry(parent, struct hist_entry, rb_node); rb_node 1721 tools/perf/util/hist.c rb_link_node(&he->rb_node, parent, p); rb_node 1722 tools/perf/util/hist.c rb_insert_color_cached(&he->rb_node, root, leftmost); rb_node 1738 tools/perf/util/hist.c struct rb_node *node; rb_node 1790 tools/perf/util/hist.c struct rb_node **p = &entries->rb_root.rb_node; rb_node 1791 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 1811 tools/perf/util/hist.c iter = rb_entry(parent, struct hist_entry, rb_node); rb_node 1821 tools/perf/util/hist.c rb_link_node(&he->rb_node, parent, p); rb_node 1822 tools/perf/util/hist.c rb_insert_color_cached(&he->rb_node, entries, leftmost); rb_node 1836 tools/perf/util/hist.c struct rb_node *next; rb_node 1928 tools/perf/util/hist.c struct rb_node *rb_hierarchy_last(struct rb_node *node) rb_node 1930 tools/perf/util/hist.c struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); rb_node 1934 tools/perf/util/hist.c he = rb_entry(node, struct hist_entry, rb_node); rb_node 1939 tools/perf/util/hist.c struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd) rb_node 1941 tools/perf/util/hist.c struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); rb_node 1953 tools/perf/util/hist.c node = rb_next(&he->rb_node); rb_node 1958 tools/perf/util/hist.c struct rb_node *rb_hierarchy_prev(struct rb_node *node) rb_node 1960 tools/perf/util/hist.c struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node); rb_node 1970 tools/perf/util/hist.c return &he->rb_node; rb_node 1975 tools/perf/util/hist.c struct rb_node *node; rb_node 1983 tools/perf/util/hist.c child = rb_entry(node, struct hist_entry, rb_node); rb_node 1987 tools/perf/util/hist.c child = rb_entry(node, struct hist_entry, rb_node); rb_node 2093 tools/perf/util/hist.c struct rb_node *nd; rb_node 2101 tools/perf/util/hist.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2113 tools/perf/util/hist.c struct rb_node **p = &root->rb_root.rb_node; rb_node 2114 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 2117 tools/perf/util/hist.c struct rb_node *nd; rb_node 2122 tools/perf/util/hist.c iter = rb_entry(parent, struct hist_entry, rb_node); rb_node 2132 tools/perf/util/hist.c rb_link_node(&he->rb_node, parent, p); rb_node 2133 tools/perf/util/hist.c rb_insert_color_cached(&he->rb_node, root, leftmost); rb_node 2140 tools/perf/util/hist.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2143 tools/perf/util/hist.c rb_erase_cached(&h->rb_node, &he->hroot_out); rb_node 2153 tools/perf/util/hist.c struct rb_node *nd; rb_node 2163 tools/perf/util/hist.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2176 tools/perf/util/hist.c nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD); rb_node 2185 tools/perf/util/hist.c nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING); rb_node 2195 tools/perf/util/hist.c nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING); rb_node 2207 tools/perf/util/hist.c struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node); rb_node 2210 tools/perf/util/hist.c rb_erase_cached(&h->rb_node, &hists->entries); rb_node 2280 tools/perf/util/hist.c struct rb_node **p; rb_node 2281 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 2291 tools/perf/util/hist.c p = &root->rb_root.rb_node; rb_node 2329 tools/perf/util/hist.c struct rb_node **p; rb_node 2330 tools/perf/util/hist.c struct rb_node *parent = NULL; rb_node 2335 tools/perf/util/hist.c p = &root->rb_root.rb_node; rb_node 2375 tools/perf/util/hist.c struct rb_node *n; rb_node 2378 tools/perf/util/hist.c n = hists->entries_collapsed.rb_root.rb_node; rb_node 2380 tools/perf/util/hist.c n = hists->entries_in->rb_root.rb_node; rb_node 2400 tools/perf/util/hist.c struct rb_node *n = root->rb_root.rb_node; rb_node 2428 tools/perf/util/hist.c struct rb_node *nd; rb_node 2448 tools/perf/util/hist.c struct rb_node *nd; rb_node 2476 tools/perf/util/hist.c struct rb_node *nd; rb_node 2523 tools/perf/util/hist.c struct rb_node *nd; rb_node 2555 tools/perf/util/hist.c struct rb_node *nd; rb_node 2743 tools/perf/util/hist.c struct rb_node *node; rb_node 544 tools/perf/util/hist.h struct rb_node *rb_hierarchy_last(struct rb_node *node); rb_node 545 tools/perf/util/hist.h struct rb_node *__rb_hierarchy_next(struct rb_node *node, rb_node 547 tools/perf/util/hist.h struct rb_node *rb_hierarchy_prev(struct rb_node *node); rb_node 549 tools/perf/util/hist.h static inline struct rb_node *rb_hierarchy_next(struct rb_node *node) rb_node 13 tools/perf/util/intlist.c static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused, rb_node 17 tools/perf/util/intlist.c struct rb_node *rc = NULL; rb_node 23 tools/perf/util/intlist.c rc = &node->rb_node; rb_node 35 tools/perf/util/intlist.c struct rb_node *rb_node) rb_node 37 tools/perf/util/intlist.c struct int_node *node = container_of(rb_node, struct int_node, rb_node); rb_node 42 tools/perf/util/intlist.c static int intlist__node_cmp(struct rb_node *rb_node, const void *entry) rb_node 45 tools/perf/util/intlist.c struct int_node *node = container_of(rb_node, struct int_node, rb_node); rb_node 57 tools/perf/util/intlist.c rblist__remove_node(&ilist->rblist, &node->rb_node); rb_node 64 tools/perf/util/intlist.c struct rb_node *rb_node; rb_node 70 tools/perf/util/intlist.c rb_node = rblist__findnew(&ilist->rblist, (void *)((long)i)); rb_node 72 tools/perf/util/intlist.c rb_node = rblist__find(&ilist->rblist, (void *)((long)i)); rb_node 74 tools/perf/util/intlist.c if (rb_node) rb_node 75 tools/perf/util/intlist.c node = container_of(rb_node, struct int_node, rb_node); rb_node 138 tools/perf/util/intlist.c struct rb_node *rb_node; rb_node 140 tools/perf/util/intlist.c rb_node = rblist__entry(&ilist->rblist, idx); rb_node 141 tools/perf/util/intlist.c if (rb_node) rb_node 142 tools/perf/util/intlist.c node = container_of(rb_node, struct int_node, rb_node); rb_node 11 tools/perf/util/intlist.h struct rb_node rb_node; rb_node 48 tools/perf/util/intlist.h struct rb_node *rn = rb_first_cached(&ilist->rblist.entries); rb_node 49 tools/perf/util/intlist.h return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; rb_node 53 tools/perf/util/intlist.h struct rb_node *rn; rb_node 56 tools/perf/util/intlist.h rn = rb_next(&in->rb_node); rb_node 57 tools/perf/util/intlist.h return rn ? rb_entry(rn, struct int_node, rb_node) : NULL; rb_node 29 tools/perf/util/kvm-stat.h struct rb_node rb; rb_node 85 tools/perf/util/machine.c RB_CLEAR_NODE(&machine->rb_node); rb_node 173 tools/perf/util/machine.c RB_CLEAR_NODE(&pos->rb_node); rb_node 190 tools/perf/util/machine.c struct rb_node *nd; rb_node 198 tools/perf/util/machine.c struct thread *t = rb_entry(nd, struct thread, rb_node); rb_node 263 tools/perf/util/machine.c struct rb_node **p = &machines->guests.rb_root.rb_node; rb_node 264 tools/perf/util/machine.c struct rb_node *parent = NULL; rb_node 278 tools/perf/util/machine.c pos = rb_entry(parent, struct machine, rb_node); rb_node 287 tools/perf/util/machine.c rb_link_node(&machine->rb_node, parent, p); rb_node 288 tools/perf/util/machine.c rb_insert_color_cached(&machine->rb_node, &machines->guests, leftmost); rb_node 295 tools/perf/util/machine.c struct rb_node *nd; rb_node 300 tools/perf/util/machine.c struct machine *machine = rb_entry(nd, struct machine, rb_node); rb_node 308 tools/perf/util/machine.c struct rb_node **p = &machines->guests.rb_root.rb_node; rb_node 309 tools/perf/util/machine.c struct rb_node *parent = NULL; rb_node 318 tools/perf/util/machine.c machine = rb_entry(parent, struct machine, rb_node); rb_node 369 tools/perf/util/machine.c struct rb_node *nd; rb_node 372 tools/perf/util/machine.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 379 tools/perf/util/machine.c struct rb_node *node; rb_node 386 tools/perf/util/machine.c machine = rb_entry(node, struct machine, rb_node); rb_node 498 tools/perf/util/machine.c struct rb_node **p = &threads->entries.rb_root.rb_node; rb_node 499 tools/perf/util/machine.c struct rb_node *parent = NULL; rb_node 509 tools/perf/util/machine.c th = rb_entry(parent, struct thread, rb_node); rb_node 530 tools/perf/util/machine.c rb_link_node(&th->rb_node, parent, p); rb_node 531 tools/perf/util/machine.c rb_insert_color_cached(&th->rb_node, &threads->entries, leftmost); rb_node 542 tools/perf/util/machine.c rb_erase_cached(&th->rb_node, &threads->entries); rb_node 543 tools/perf/util/machine.c RB_CLEAR_NODE(&th->rb_node); rb_node 805 tools/perf/util/machine.c struct rb_node *nd; rb_node 809 tools/perf/util/machine.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 825 tools/perf/util/machine.c struct rb_node *nd; rb_node 829 tools/perf/util/machine.c struct machine *pos = rb_entry(nd, struct machine, rb_node); rb_node 857 tools/perf/util/machine.c struct rb_node *nd; rb_node 870 tools/perf/util/machine.c struct thread *pos = rb_entry(nd, struct thread, rb_node); rb_node 1178 tools/perf/util/machine.c struct rb_node *next = rb_first_cached(&machines->guests); rb_node 1183 tools/perf/util/machine.c struct machine *pos = rb_entry(next, struct machine, rb_node); rb_node 1185 tools/perf/util/machine.c next = rb_next(&pos->rb_node); rb_node 1186 tools/perf/util/machine.c rb_erase_cached(&pos->rb_node, &machines->guests); rb_node 1766 tools/perf/util/machine.c rb_erase_cached(&th->rb_node, &threads->entries); rb_node 1767 tools/perf/util/machine.c RB_CLEAR_NODE(&th->rb_node); rb_node 2543 tools/perf/util/machine.c struct rb_node *nd; rb_node 2552 tools/perf/util/machine.c thread = rb_entry(nd, struct thread, rb_node); rb_node 2571 tools/perf/util/machine.c struct rb_node *nd; rb_node 2579 tools/perf/util/machine.c struct machine *machine = rb_entry(nd, struct machine, rb_node); rb_node 41 tools/perf/util/machine.h struct rb_node rb_node; rb_node 142 tools/perf/util/map.c RB_CLEAR_NODE(&map->rb_node); rb_node 291 tools/perf/util/map.c BUG_ON(!RB_EMPTY_NODE(&map->rb_node)); rb_node 310 tools/perf/util/map.c struct rb_node *nd = rb_first_cached(symbols); rb_node 312 tools/perf/util/map.c struct symbol *sym = rb_entry(nd, struct symbol, rb_node); rb_node 320 tools/perf/util/map.c struct rb_node *nd = rb_last(&symbols->rb_root); rb_node 322 tools/perf/util/map.c struct symbol *sym = rb_entry(nd, struct symbol, rb_node); rb_node 396 tools/perf/util/map.c RB_CLEAR_NODE(&map->rb_node); rb_node 598 tools/perf/util/map.c struct rb_node *next = rb_first(root); rb_node 601 tools/perf/util/map.c struct map *pos = rb_entry(next, struct map, rb_node); rb_node 603 tools/perf/util/map.c next = rb_next(&pos->rb_node); rb_node 604 tools/perf/util/map.c rb_erase_init(&pos->rb_node, root); rb_node 612 tools/perf/util/map.c struct rb_node *next = rb_first(root); rb_node 690 tools/perf/util/map.c struct rb_node *nd; rb_node 695 tools/perf/util/map.c struct map *pos = rb_entry(nd, struct map, rb_node); rb_node 742 tools/perf/util/map.c struct rb_node *nd; rb_node 747 tools/perf/util/map.c struct map *pos = rb_entry(nd, struct map, rb_node); rb_node 776 tools/perf/util/map.c struct rb_node *next, *first; rb_node 787 tools/perf/util/map.c next = root->rb_node; rb_node 790 tools/perf/util/map.c struct map *pos = rb_entry(next, struct map, rb_node); rb_node 803 tools/perf/util/map.c struct map *pos = rb_entry(next, struct map, rb_node); rb_node 804 tools/perf/util/map.c next = rb_next(&pos->rb_node); rb_node 825 tools/perf/util/map.c rb_erase_init(&pos->rb_node, root); rb_node 913 tools/perf/util/map.c struct rb_node **p = &maps->entries.rb_node; rb_node 914 tools/perf/util/map.c struct rb_node *parent = NULL; rb_node 920 tools/perf/util/map.c m = rb_entry(parent, struct map, rb_node); rb_node 927 tools/perf/util/map.c rb_link_node(&map->rb_node, parent, p); rb_node 928 tools/perf/util/map.c rb_insert_color(&map->rb_node, &maps->entries); rb_node 934 tools/perf/util/map.c struct rb_node **p = &maps->names.rb_node; rb_node 935 tools/perf/util/map.c struct rb_node *parent = NULL; rb_node 963 tools/perf/util/map.c rb_erase_init(&map->rb_node, &maps->entries); rb_node 979 tools/perf/util/map.c struct rb_node *p; rb_node 984 tools/perf/util/map.c p = maps->entries.rb_node; rb_node 986 tools/perf/util/map.c m = rb_entry(p, struct map, rb_node); rb_node 1003 tools/perf/util/map.c struct rb_node *first = rb_first(&maps->entries); rb_node 1006 tools/perf/util/map.c return rb_entry(first, struct map, rb_node); rb_node 1012 tools/perf/util/map.c struct rb_node *next = rb_next(&map->rb_node); rb_node 1015 tools/perf/util/map.c return rb_entry(next, struct map, rb_node); rb_node 23 tools/perf/util/map.h struct rb_node rb_node; rb_node 26 tools/perf/util/map.h struct rb_node rb_node_name; rb_node 11 tools/perf/util/mem2node.c struct rb_node rb_node; rb_node 19 tools/perf/util/mem2node.c struct rb_node **p = &root->rb_node; rb_node 20 tools/perf/util/mem2node.c struct rb_node *parent = NULL; rb_node 25 tools/perf/util/mem2node.c e = rb_entry(parent, struct phys_entry, rb_node); rb_node 33 tools/perf/util/mem2node.c rb_link_node(&entry->rb_node, parent, p); rb_node 34 tools/perf/util/mem2node.c rb_insert_color(&entry->rb_node, root); rb_node 43 tools/perf/util/mem2node.c RB_CLEAR_NODE(&entry->rb_node); rb_node 119 tools/perf/util/mem2node.c struct rb_node **p, *parent = NULL; rb_node 122 tools/perf/util/mem2node.c p = &map->root.rb_node; rb_node 125 tools/perf/util/mem2node.c entry = rb_entry(parent, struct phys_entry, rb_node); rb_node 30 tools/perf/util/metricgroup.c struct rb_node *nd; rb_node 50 tools/perf/util/metricgroup.c static int metric_event_cmp(struct rb_node *rb_node, const void *entry) rb_node 52 tools/perf/util/metricgroup.c struct metric_event *a = container_of(rb_node, rb_node 64 tools/perf/util/metricgroup.c static struct rb_node *metric_event_new(struct rblist *rblist __maybe_unused, rb_node 222 tools/perf/util/metricgroup.c struct rb_node nd; rb_node 227 tools/perf/util/metricgroup.c static int mep_cmp(struct rb_node *rb_node, const void *entry) rb_node 229 tools/perf/util/metricgroup.c struct mep *a = container_of(rb_node, struct mep, nd); rb_node 235 tools/perf/util/metricgroup.c static struct rb_node *mep_new(struct rblist *rl __maybe_unused, rb_node 259 tools/perf/util/metricgroup.c struct rb_node *nd; rb_node 274 tools/perf/util/metricgroup.c struct rb_node *nd) rb_node 306 tools/perf/util/metricgroup.c struct rb_node *node, *next; rb_node 14 tools/perf/util/metricgroup.h struct rb_node nd; rb_node 2830 tools/perf/util/probe-event.c struct rb_node *tmp; rb_node 3503 tools/perf/util/probe-event.c struct rb_node *nd; rb_node 3538 tools/perf/util/probe-event.c struct symbol_name_rb_node *pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); rb_node 57 tools/perf/util/rb_resort.h struct rb_node rb_node; \ rb_node 60 tools/perf/util/rb_resort.h static void __name##_sorted__init_entry(struct rb_node *nd, \ rb_node 63 tools/perf/util/rb_resort.h static int __name##_sorted__cmp(struct rb_node *nda, struct rb_node *ndb) \ rb_node 66 tools/perf/util/rb_resort.h a = rb_entry(nda, struct __name##_sorted_entry, rb_node); \ rb_node 67 tools/perf/util/rb_resort.h b = rb_entry(ndb, struct __name##_sorted_entry, rb_node); \ rb_node 77 tools/perf/util/rb_resort.h struct rb_node *sorted_nd) \ rb_node 79 tools/perf/util/rb_resort.h struct rb_node **p = &sorted->entries.rb_node, *parent = NULL; \ rb_node 94 tools/perf/util/rb_resort.h struct rb_node *nd; \ rb_node 99 tools/perf/util/rb_resort.h __name##_sorted__insert(sorted, &snd->rb_node); \ rb_node 120 tools/perf/util/rb_resort.h static void __name##_sorted__init_entry(struct rb_node *nd, \ rb_node 130 tools/perf/util/rb_resort.h rb_node), __nd; \ rb_node 15 tools/perf/util/rblist.c struct rb_node **p = &rblist->entries.rb_root.rb_node; rb_node 16 tools/perf/util/rblist.c struct rb_node *parent = NULL, *new_node; rb_node 46 tools/perf/util/rblist.c void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node) rb_node 48 tools/perf/util/rblist.c rb_erase_cached(rb_node, &rblist->entries); rb_node 50 tools/perf/util/rblist.c rblist->node_delete(rblist, rb_node); rb_node 53 tools/perf/util/rblist.c static struct rb_node *__rblist__findnew(struct rblist *rblist, rb_node 57 tools/perf/util/rblist.c struct rb_node **p = &rblist->entries.rb_root.rb_node; rb_node 58 tools/perf/util/rblist.c struct rb_node *parent = NULL, *new_node = NULL; rb_node 90 tools/perf/util/rblist.c struct rb_node *rblist__find(struct rblist *rblist, const void *entry) rb_node 95 tools/perf/util/rblist.c struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry) rb_node 112 tools/perf/util/rblist.c struct rb_node *pos, *next = rb_first_cached(&rblist->entries); rb_node 129 tools/perf/util/rblist.c struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx) rb_node 131 tools/perf/util/rblist.c struct rb_node *node; rb_node 26 tools/perf/util/rblist.h int (*node_cmp)(struct rb_node *rbn, const void *entry); rb_node 27 tools/perf/util/rblist.h struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry); rb_node 28 tools/perf/util/rblist.h void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node); rb_node 35 tools/perf/util/rblist.h void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node); rb_node 36 tools/perf/util/rblist.h struct rb_node *rblist__find(struct rblist *rblist, const void *entry); rb_node 37 tools/perf/util/rblist.h struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry); rb_node 38 tools/perf/util/rblist.h struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx); rb_node 88 tools/perf/util/sort.h struct rb_node rb_node_in; rb_node 89 tools/perf/util/sort.h struct rb_node rb_node; rb_node 611 tools/perf/util/srcline.c struct rb_node rb_node; rb_node 616 tools/perf/util/srcline.c struct rb_node **p = &tree->rb_root.rb_node; rb_node 617 tools/perf/util/srcline.c struct rb_node *parent = NULL; rb_node 632 tools/perf/util/srcline.c i = rb_entry(parent, struct srcline_node, rb_node); rb_node 640 tools/perf/util/srcline.c rb_link_node(&node->rb_node, parent, p); rb_node 641 tools/perf/util/srcline.c rb_insert_color_cached(&node->rb_node, tree, leftmost); rb_node 646 tools/perf/util/srcline.c struct rb_node *n = tree->rb_root.rb_node; rb_node 650 tools/perf/util/srcline.c rb_node); rb_node 666 tools/perf/util/srcline.c struct rb_node *next = rb_first_cached(tree); rb_node 669 tools/perf/util/srcline.c pos = rb_entry(next, struct srcline_node, rb_node); rb_node 670 tools/perf/util/srcline.c next = rb_next(&pos->rb_node); rb_node 671 tools/perf/util/srcline.c rb_erase_cached(&pos->rb_node, tree); rb_node 708 tools/perf/util/srcline.c struct rb_node **p = &tree->rb_root.rb_node; rb_node 709 tools/perf/util/srcline.c struct rb_node *parent = NULL; rb_node 716 tools/perf/util/srcline.c i = rb_entry(parent, struct inline_node, rb_node); rb_node 724 tools/perf/util/srcline.c rb_link_node(&inlines->rb_node, parent, p); rb_node 725 tools/perf/util/srcline.c rb_insert_color_cached(&inlines->rb_node, tree, leftmost); rb_node 730 tools/perf/util/srcline.c struct rb_node *n = tree->rb_root.rb_node; rb_node 734 tools/perf/util/srcline.c rb_node); rb_node 750 tools/perf/util/srcline.c struct rb_node *next = rb_first_cached(tree); rb_node 753 tools/perf/util/srcline.c pos = rb_entry(next, struct inline_node, rb_node); rb_node 754 tools/perf/util/srcline.c next = rb_next(&pos->rb_node); rb_node 755 tools/perf/util/srcline.c rb_erase_cached(&pos->rb_node, tree); rb_node 39 tools/perf/util/srcline.h struct rb_node rb_node; rb_node 26 tools/perf/util/stat-shadow.c struct rb_node rb_node; rb_node 37 tools/perf/util/stat-shadow.c static int saved_value_cmp(struct rb_node *rb_node, const void *entry) rb_node 39 tools/perf/util/stat-shadow.c struct saved_value *a = container_of(rb_node, rb_node 41 tools/perf/util/stat-shadow.c rb_node); rb_node 77 tools/perf/util/stat-shadow.c static struct rb_node *saved_value_new(struct rblist *rblist __maybe_unused, rb_node 85 tools/perf/util/stat-shadow.c return &nd->rb_node; rb_node 89 tools/perf/util/stat-shadow.c struct rb_node *rb_node) rb_node 93 tools/perf/util/stat-shadow.c BUG_ON(!rb_node); rb_node 94 tools/perf/util/stat-shadow.c v = container_of(rb_node, struct saved_value, rb_node); rb_node 106 tools/perf/util/stat-shadow.c struct rb_node *nd; rb_node 119 tools/perf/util/stat-shadow.c return container_of(nd, struct saved_value, rb_node); rb_node 124 tools/perf/util/stat-shadow.c return container_of(nd, struct saved_value, rb_node); rb_node 170 tools/perf/util/stat-shadow.c struct rb_node *pos, *next; rb_node 177 tools/perf/util/stat-shadow.c memset(&container_of(pos, struct saved_value, rb_node)->stats, rb_node 15 tools/perf/util/strlist.c struct rb_node *strlist__node_new(struct rblist *rblist, const void *entry) rb_node 18 tools/perf/util/strlist.c struct rb_node *rc = NULL; rb_node 29 tools/perf/util/strlist.c rc = &snode->rb_node; rb_node 47 tools/perf/util/strlist.c void strlist__node_delete(struct rblist *rblist, struct rb_node *rb_node) rb_node 50 tools/perf/util/strlist.c struct str_node *snode = container_of(rb_node, struct str_node, rb_node); rb_node 55 tools/perf/util/strlist.c static int strlist__node_cmp(struct rb_node *rb_node, const void *entry) rb_node 58 tools/perf/util/strlist.c struct str_node *snode = container_of(rb_node, struct str_node, rb_node); rb_node 97 tools/perf/util/strlist.c rblist__remove_node(&slist->rblist, &snode->rb_node); rb_node 103 tools/perf/util/strlist.c struct rb_node *rb_node = rblist__find(&slist->rblist, entry); rb_node 105 tools/perf/util/strlist.c if (rb_node) rb_node 106 tools/perf/util/strlist.c snode = container_of(rb_node, struct str_node, rb_node); rb_node 201 tools/perf/util/strlist.c struct rb_node *rb_node; rb_node 203 tools/perf/util/strlist.c rb_node = rblist__entry(&slist->rblist, idx); rb_node 204 tools/perf/util/strlist.c if (rb_node) rb_node 205 tools/perf/util/strlist.c snode = container_of(rb_node, struct str_node, rb_node); rb_node 11 tools/perf/util/strlist.h struct rb_node rb_node; rb_node 60 tools/perf/util/strlist.h struct rb_node *rn = rb_first_cached(&slist->rblist.entries); rb_node 61 tools/perf/util/strlist.h return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; rb_node 65 tools/perf/util/strlist.h struct rb_node *rn; rb_node 68 tools/perf/util/strlist.h rn = rb_next(&sn->rb_node); rb_node 69 tools/perf/util/strlist.h return rn ? rb_entry(rn, struct str_node, rb_node) : NULL; rb_node 187 tools/perf/util/symbol.c struct rb_node *nd; rb_node 196 tools/perf/util/symbol.c curr = rb_entry(nd, struct symbol, rb_node); rb_node 198 tools/perf/util/symbol.c nd = rb_next(&curr->rb_node); rb_node 199 tools/perf/util/symbol.c next = rb_entry(nd, struct symbol, rb_node); rb_node 208 tools/perf/util/symbol.c rb_erase_cached(&next->rb_node, symbols); rb_node 212 tools/perf/util/symbol.c nd = rb_next(&curr->rb_node); rb_node 213 tools/perf/util/symbol.c rb_erase_cached(&curr->rb_node, symbols); rb_node 221 tools/perf/util/symbol.c struct rb_node *nd, *prevnd = rb_first_cached(symbols); rb_node 227 tools/perf/util/symbol.c curr = rb_entry(prevnd, struct symbol, rb_node); rb_node 231 tools/perf/util/symbol.c curr = rb_entry(nd, struct symbol, rb_node); rb_node 307 tools/perf/util/symbol.c struct rb_node *next = rb_first_cached(symbols); rb_node 310 tools/perf/util/symbol.c pos = rb_entry(next, struct symbol, rb_node); rb_node 311 tools/perf/util/symbol.c next = rb_next(&pos->rb_node); rb_node 312 tools/perf/util/symbol.c rb_erase_cached(&pos->rb_node, symbols); rb_node 320 tools/perf/util/symbol.c struct rb_node **p = &symbols->rb_root.rb_node; rb_node 321 tools/perf/util/symbol.c struct rb_node *parent = NULL; rb_node 339 tools/perf/util/symbol.c s = rb_entry(parent, struct symbol, rb_node); rb_node 347 tools/perf/util/symbol.c rb_link_node(&sym->rb_node, parent, p); rb_node 348 tools/perf/util/symbol.c rb_insert_color_cached(&sym->rb_node, symbols, leftmost); rb_node 358 tools/perf/util/symbol.c struct rb_node *n; rb_node 363 tools/perf/util/symbol.c n = symbols->rb_root.rb_node; rb_node 366 tools/perf/util/symbol.c struct symbol *s = rb_entry(n, struct symbol, rb_node); rb_node 381 tools/perf/util/symbol.c struct rb_node *n = rb_first_cached(symbols); rb_node 384 tools/perf/util/symbol.c return rb_entry(n, struct symbol, rb_node); rb_node 391 tools/perf/util/symbol.c struct rb_node *n = rb_last(&symbols->rb_root); rb_node 394 tools/perf/util/symbol.c return rb_entry(n, struct symbol, rb_node); rb_node 401 tools/perf/util/symbol.c struct rb_node *n = rb_next(&sym->rb_node); rb_node 404 tools/perf/util/symbol.c return rb_entry(n, struct symbol, rb_node); rb_node 411 tools/perf/util/symbol.c struct rb_node **p = &symbols->rb_root.rb_node; rb_node 412 tools/perf/util/symbol.c struct rb_node *parent = NULL; rb_node 420 tools/perf/util/symbol.c s = rb_entry(parent, struct symbol_name_rb_node, rb_node); rb_node 428 tools/perf/util/symbol.c rb_link_node(&symn->rb_node, parent, p); rb_node 429 tools/perf/util/symbol.c rb_insert_color_cached(&symn->rb_node, symbols, leftmost); rb_node 435 tools/perf/util/symbol.c struct rb_node *nd; rb_node 438 tools/perf/util/symbol.c struct symbol *pos = rb_entry(nd, struct symbol, rb_node); rb_node 464 tools/perf/util/symbol.c struct rb_node *n; rb_node 470 tools/perf/util/symbol.c n = symbols->rb_root.rb_node; rb_node 475 tools/perf/util/symbol.c s = rb_entry(n, struct symbol_name_rb_node, rb_node); rb_node 494 tools/perf/util/symbol.c tmp = rb_entry(n, struct symbol_name_rb_node, rb_node); rb_node 550 tools/perf/util/symbol.c struct rb_node *n = rb_next(&s->rb_node); rb_node 552 tools/perf/util/symbol.c return n ? &rb_entry(n, struct symbol_name_rb_node, rb_node)->sym : NULL; rb_node 712 tools/perf/util/symbol.c struct rb_node *next = rb_first_cached(root); rb_node 722 tools/perf/util/symbol.c pos = rb_entry(next, struct symbol, rb_node); rb_node 723 tools/perf/util/symbol.c next = rb_next(&pos->rb_node); rb_node 725 tools/perf/util/symbol.c rb_erase_cached(&pos->rb_node, &old_root); rb_node 726 tools/perf/util/symbol.c RB_CLEAR_NODE(&pos->rb_node); rb_node 766 tools/perf/util/symbol.c struct rb_node *next = rb_first_cached(root); rb_node 780 tools/perf/util/symbol.c pos = rb_entry(next, struct symbol, rb_node); rb_node 781 tools/perf/util/symbol.c next = rb_next(&pos->rb_node); rb_node 880 tools/perf/util/symbol.c rb_erase_cached(&pos->rb_node, root); rb_node 888 tools/perf/util/symbol.c rb_erase_cached(&pos->rb_node, root); rb_node 920 tools/perf/util/symbol.c struct rb_node rb_node; rb_node 927 tools/perf/util/symbol.c struct rb_node **p = &modules->rb_node; rb_node 928 tools/perf/util/symbol.c struct rb_node *parent = NULL; rb_node 933 tools/perf/util/symbol.c m = rb_entry(parent, struct module_info, rb_node); rb_node 939 tools/perf/util/symbol.c rb_link_node(&mi->rb_node, parent, p); rb_node 940 tools/perf/util/symbol.c rb_insert_color(&mi->rb_node, modules); rb_node 946 tools/perf/util/symbol.c struct rb_node *next = rb_first(modules); rb_node 949 tools/perf/util/symbol.c mi = rb_entry(next, struct module_info, rb_node); rb_node 950 tools/perf/util/symbol.c next = rb_next(&mi->rb_node); rb_node 951 tools/perf/util/symbol.c rb_erase(&mi->rb_node, modules); rb_node 960 tools/perf/util/symbol.c struct rb_node *n = modules->rb_node; rb_node 966 tools/perf/util/symbol.c m = rb_entry(n, struct module_info, rb_node); rb_node 1019 tools/perf/util/symbol.c struct rb_node *from_node, *to_node; rb_node 1035 tools/perf/util/symbol.c from_m = rb_entry(from_node, struct module_info, rb_node); rb_node 1036 tools/perf/util/symbol.c to_m = rb_entry(to_node, struct module_info, rb_node); rb_node 1791 tools/perf/util/symbol.c struct rb_node *node; rb_node 1795 tools/perf/util/symbol.c for (node = maps->names.rb_node; node; ) { rb_node 46 tools/perf/util/symbol.h struct rb_node rb_node; rb_node 71 tools/perf/util/symbol.h nd && (pos = rb_entry(nd, struct symbol, rb_node)); \ rb_node 83 tools/perf/util/symbol.h struct rb_node rb_node; rb_node 66 tools/perf/util/symbol_fprintf.c struct rb_node *nd; rb_node 70 tools/perf/util/symbol_fprintf.c pos = rb_entry(nd, struct symbol_name_rb_node, rb_node); rb_node 67 tools/perf/util/thread.c RB_CLEAR_NODE(&thread->rb_node); rb_node 85 tools/perf/util/thread.c BUG_ON(!RB_EMPTY_NODE(&thread->rb_node)); rb_node 25 tools/perf/util/thread.h struct rb_node rb_node;