arch/arm/xen/p2m.c

156

struct rb_node *n;

arch/arm/xen/p2m.c

160

n = phys_to_mach.rb_node;

arch/arm/xen/p2m.c

26

struct rb_node rbnode_phys;

arch/arm/xen/p2m.c

35

struct rb_node **link = &phys_to_mach.rb_node;

arch/arm/xen/p2m.c

36

struct rb_node *parent = NULL;

arch/arm/xen/p2m.c

66

struct rb_node *n;

arch/arm/xen/p2m.c

71

n = phys_to_mach.rb_node;

arch/arm64/include/asm/kvm_pkvm.h

198

struct rb_node node;

arch/arm64/kvm/mmu.c

450

struct rb_node node;

arch/arm64/kvm/mmu.c

456

static struct hyp_shared_pfn *find_shared_pfn(u64 pfn, struct rb_node ***node,

arch/arm64/kvm/mmu.c

457

struct rb_node **parent)

arch/arm64/kvm/mmu.c

461

*node = &hyp_shared_pfns.rb_node;

arch/arm64/kvm/mmu.c

479

struct rb_node **node, *parent;

arch/arm64/kvm/mmu.c

509

struct rb_node **node, *parent;

arch/powerpc/kernel/eeh_cache.c

100

struct rb_node *n;

arch/powerpc/kernel/eeh_cache.c

106

piar = rb_entry(n, struct pci_io_addr_range, rb_node);

arch/powerpc/kernel/eeh_cache.c

121

struct rb_node **p = &pci_io_addr_cache_root.rb_root.rb_node;

arch/powerpc/kernel/eeh_cache.c

122

struct rb_node *parent = NULL;

arch/powerpc/kernel/eeh_cache.c

128

piar = rb_entry(parent, struct pci_io_addr_range, rb_node);

arch/powerpc/kernel/eeh_cache.c

154

rb_link_node(&piar->rb_node, parent, p);

arch/powerpc/kernel/eeh_cache.c

155

rb_insert_color(&piar->rb_node, &pci_io_addr_cache_root.rb_root);

arch/powerpc/kernel/eeh_cache.c

215

struct rb_node *n;

arch/powerpc/kernel/eeh_cache.c

221

piar = rb_entry(n, struct pci_io_addr_range, rb_node);

arch/powerpc/kernel/eeh_cache.c

266

struct rb_node *n;

arch/powerpc/kernel/eeh_cache.c

271

piar = rb_entry(n, struct pci_io_addr_range, rb_node);

arch/powerpc/kernel/eeh_cache.c

41

struct rb_node rb_node;

arch/powerpc/kernel/eeh_cache.c

56

struct rb_node *n = pci_io_addr_cache_root.rb_root.rb_node;

arch/powerpc/kernel/eeh_cache.c

60

piar = rb_entry(n, struct pci_io_addr_range, rb_node);

arch/powerpc/perf/hv-24x7.c

591

struct rb_node node;

arch/powerpc/perf/hv-24x7.c

625

struct rb_node **new = &(root->rb_node), *parent = NULL;

arch/s390/kvm/kvm-s390.h

267

struct rb_node *node;

arch/sh/include/asm/dwarf.h

248

struct rb_node node;

arch/sh/include/asm/dwarf.h

266

struct rb_node node;

arch/sh/kernel/dwarf.c

305

struct rb_node **rb_node = &cie_root.rb_node;

arch/sh/kernel/dwarf.c

320

while (*rb_node) {

arch/sh/kernel/dwarf.c

323

cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node);

arch/sh/kernel/dwarf.c

332

rb_node = &(*rb_node)->rb_left;

arch/sh/kernel/dwarf.c

334

rb_node = &(*rb_node)->rb_right;

arch/sh/kernel/dwarf.c

349

struct rb_node **rb_node = &fde_root.rb_node;

arch/sh/kernel/dwarf.c

355

while (*rb_node) {

arch/sh/kernel/dwarf.c

359

fde_tmp = rb_entry(*rb_node, struct dwarf_fde, node);

arch/sh/kernel/dwarf.c

366

rb_node = &(*rb_node)->rb_left;

arch/sh/kernel/dwarf.c

372

rb_node = &(*rb_node)->rb_right;

arch/sh/kernel/dwarf.c

738

struct rb_node **rb_node = &cie_root.rb_node;

arch/sh/kernel/dwarf.c

739

struct rb_node *parent = *rb_node;

arch/sh/kernel/dwarf.c

837

while (*rb_node) {

arch/sh/kernel/dwarf.c

840

cie_tmp = rb_entry(*rb_node, struct dwarf_cie, node);

arch/sh/kernel/dwarf.c

842

parent = *rb_node;

arch/sh/kernel/dwarf.c

845

rb_node = &parent->rb_left;

arch/sh/kernel/dwarf.c

847

rb_node = &parent->rb_right;

arch/sh/kernel/dwarf.c

852

rb_link_node(&cie->node, parent, rb_node);

arch/sh/kernel/dwarf.c

869

struct rb_node **rb_node = &fde_root.rb_node;

arch/sh/kernel/dwarf.c

870

struct rb_node *parent = *rb_node;

arch/sh/kernel/dwarf.c

921

while (*rb_node) {

arch/sh/kernel/dwarf.c

926

fde_tmp = rb_entry(*rb_node, struct dwarf_fde, node);

arch/sh/kernel/dwarf.c

934

parent = *rb_node;

arch/sh/kernel/dwarf.c

937

rb_node = &parent->rb_left;

arch/sh/kernel/dwarf.c

939

rb_node = &parent->rb_right;

arch/sh/kernel/dwarf.c

944

rb_link_node(&fde->node, parent, rb_node);

arch/x86/events/intel/uncore.c

1080

struct rb_node *node;

arch/x86/events/intel/uncore.c

1362

struct rb_node *node;

arch/x86/events/intel/uncore_discovery.c

118

struct rb_node *pos;

arch/x86/events/intel/uncore_discovery.c

156

static inline bool unit_less(struct rb_node *a, const struct rb_node *b)

arch/x86/events/intel/uncore_discovery.c

180

struct rb_node *node;

arch/x86/events/intel/uncore_discovery.c

35

static inline int __type_cmp(const void *key, const struct rb_node *b)

arch/x86/events/intel/uncore_discovery.c

441

struct rb_node *node;

arch/x86/events/intel/uncore_discovery.c

51

struct rb_node *node = rb_find(&type_id, &discovery_tables, __type_cmp);

arch/x86/events/intel/uncore_discovery.c

56

static inline bool __type_less(struct rb_node *a, const struct rb_node *b)

arch/x86/events/intel/uncore_discovery.c

744

struct rb_node *node;

arch/x86/events/intel/uncore_discovery.c

98

static inline int pmu_idx_cmp(const void *key, const struct rb_node *b)

arch/x86/events/intel/uncore_discovery.h

126

struct rb_node node;

arch/x86/events/intel/uncore_discovery.h

134

struct rb_node node;

arch/x86/events/intel/uncore_snbep.c

6111

struct rb_node *node;

arch/x86/events/intel/uncore_snbep.c

6338

struct rb_node *node;

arch/x86/mm/pat/memtype.h

15

struct rb_node rb;

block/bfq-iosched.c

1021

struct rb_node *rbnext = rb_next(&last->rb_node);

block/bfq-iosched.c

1022

struct rb_node *rbprev = rb_prev(&last->rb_node);

block/bfq-iosched.c

1037

if (rbnext && rbnext != &last->rb_node)

block/bfq-iosched.c

2502

rb_prev(&req->rb_node) &&

block/bfq-iosched.c

2504

blk_rq_pos(container_of(rb_prev(&req->rb_node),

block/bfq-iosched.c

2505

struct request, rb_node))) {

block/bfq-iosched.c

2587

if (!RB_EMPTY_NODE(&next->rb_node)) {

block/bfq-iosched.c

2681

struct rb_node *parent, *node;

block/bfq-iosched.c

5596

RB_CLEAR_NODE(&bfqq->entity.rb_node);

block/bfq-iosched.c

731

sector_t sector, struct rb_node **ret_parent,

block/bfq-iosched.c

732

struct rb_node ***rb_link)

block/bfq-iosched.c

734

struct rb_node **p, *parent;

block/bfq-iosched.c

738

p = &root->rb_node;

block/bfq-iosched.c

740

struct rb_node **n;

block/bfq-iosched.c

788

struct rb_node **p, *parent;

block/bfq-iosched.c

873

(bfqd->queue_weights_tree.rb_root.rb_node->rb_left ||

block/bfq-iosched.c

874

bfqd->queue_weights_tree.rb_root.rb_node->rb_right);

block/bfq-iosched.c

905

struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;

block/bfq-iosched.h

1133

struct bfq_entity *bfq_entity_of(struct rb_node *node);

block/bfq-iosched.h

121

struct rb_node weights_node;

block/bfq-iosched.h

153

struct rb_node rb_node;

block/bfq-iosched.h

272

struct rb_node pos_node;

block/bfq-wf2q.c

1300

struct rb_node *node = st->active.rb_node;

block/bfq-wf2q.c

1303

entry = rb_entry(node, struct bfq_entity, rb_node);

block/bfq-wf2q.c

1310

struct bfq_entity, rb_node);

block/bfq-wf2q.c

25

struct rb_node *node = tree->rb_node;

block/bfq-wf2q.c

27

return rb_entry(node, struct bfq_entity, rb_node);

block/bfq-wf2q.c

323

struct bfq_entity *bfq_entity_of(struct rb_node *node)

block/bfq-wf2q.c

328

entity = rb_entry(node, struct bfq_entity, rb_node);

block/bfq-wf2q.c

341

rb_erase(&entity->rb_node, root);

block/bfq-wf2q.c

353

struct rb_node *next;

block/bfq-wf2q.c

356

next = rb_next(&entity->rb_node);

block/bfq-wf2q.c

361

next = rb_prev(&entity->rb_node);

block/bfq-wf2q.c

382

struct rb_node **node = &root->rb_node;

block/bfq-wf2q.c

383

struct rb_node *parent = NULL;

block/bfq-wf2q.c

387

entry = rb_entry(parent, struct bfq_entity, rb_node);

block/bfq-wf2q.c

395

rb_link_node(&entity->rb_node, parent, node);

block/bfq-wf2q.c

396

rb_insert_color(&entity->rb_node, root);

block/bfq-wf2q.c

411

static void bfq_update_min(struct bfq_entity *entity, struct rb_node *node)

block/bfq-wf2q.c

416

child = rb_entry(node, struct bfq_entity, rb_node);

block/bfq-wf2q.c

430

static void bfq_update_active_node(struct rb_node *node)

block/bfq-wf2q.c

432

struct bfq_entity *entity = rb_entry(node, struct bfq_entity, rb_node);

block/bfq-wf2q.c

449

static void bfq_update_active_tree(struct rb_node *node)

block/bfq-wf2q.c

451

struct rb_node *parent;

block/bfq-wf2q.c

484

struct rb_node *node = &entity->rb_node;

block/bfq-wf2q.c

544

static struct rb_node *bfq_find_deepest(struct rb_node *node)

block/bfq-wf2q.c

546

struct rb_node *deepest;

block/bfq-wf2q.c

574

struct rb_node *node;

block/bfq-wf2q.c

576

node = bfq_find_deepest(&entity->rb_node);

block/blk-mq.c

382

RB_CLEAR_NODE(&rq->rb_node);

block/blk-mq.c

454

RB_CLEAR_NODE(&rq->rb_node);

block/blk-throttle.c

284

RB_CLEAR_NODE(&tg->rb_node);

block/blk-throttle.c

29

#define rb_entry_tg(node) rb_entry((node), struct throtl_grp, rb_node)

block/blk-throttle.c

369

struct rb_node *n;

block/blk-throttle.c

378

static void throtl_rb_erase(struct rb_node *n,

block/blk-throttle.c

399

struct rb_node **node = &parent_sq->pending_tree.rb_root.rb_node;

block/blk-throttle.c

400

struct rb_node *parent = NULL;

block/blk-throttle.c

417

rb_link_node(&tg->rb_node, parent, node);

block/blk-throttle.c

418

rb_insert_color_cached(&tg->rb_node, &parent_sq->pending_tree,

block/blk-throttle.c

437

throtl_rb_erase(&tg->rb_node, parent_sq);

block/blk-throttle.c

977

throtl_rb_erase(&tg->rb_node, tg->service_queue.parent_sq);

block/blk-throttle.h

74

struct rb_node rb_node;

block/elevator.c

221

struct rb_node **p = &root->rb_node;

block/elevator.c

222

struct rb_node *parent = NULL;

block/elevator.c

227

__rq = rb_entry(parent, struct request, rb_node);

block/elevator.c

235

rb_link_node(&rq->rb_node, parent, p);

block/elevator.c

236

rb_insert_color(&rq->rb_node, root);

block/elevator.c

242

BUG_ON(RB_EMPTY_NODE(&rq->rb_node));

block/elevator.c

243

rb_erase(&rq->rb_node, root);

block/elevator.c

244

RB_CLEAR_NODE(&rq->rb_node);

block/elevator.c

250

struct rb_node *n = root->rb_node;

block/elevator.c

254

rq = rb_entry(n, struct request, rb_node);

block/elevator.c

867

struct rb_node *rbprev = rb_prev(&rq->rb_node);

block/elevator.c

879

struct rb_node *rbnext = rb_next(&rq->rb_node);

block/elevator.h

213

#define rb_entry_rq(node) rb_entry((node), struct request, rb_node)

block/mq-deadline.c

135

struct rb_node *node = per_prio->sort_list[data_dir].rb_node;

block/mq-deadline.c

176

if (!RB_EMPTY_NODE(&rq->rb_node))

drivers/accel/ivpu/ivpu_gem.c

332

drm_WARN_ON(obj->dev, bo->base.base.vma_node.vm_files.rb_node);

drivers/android/binder.c

1022

struct rb_node *n = proc->refs_by_desc.rb_node;

drivers/android/binder.c

1046

struct rb_node *n;

drivers/android/binder.c

1123

struct rb_node *parent;

drivers/android/binder.c

1124

struct rb_node **p;

drivers/android/binder.c

1128

p = &proc->refs_by_node.rb_node;

drivers/android/binder.c

1156

p = &proc->refs_by_desc.rb_node;

drivers/android/binder.c

4894

rb_erase(&node->rb_node, &proc->nodes);

drivers/android/binder.c

5252

struct rb_node *parent = NULL;

drivers/android/binder.c

5253

struct rb_node **p = &proc->threads.rb_node;

drivers/android/binder.c

5257

thread = rb_entry(parent, struct binder_thread, rb_node);

drivers/android/binder.c

5275

rb_link_node(&thread->rb_node, parent, p);

drivers/android/binder.c

5276

rb_insert_color(&thread->rb_node, &proc->threads);

drivers/android/binder.c

5360

rb_erase(&thread->rb_node, &proc->threads);

drivers/android/binder.c

5587

struct rb_node *n;

drivers/android/binder.c

5595

rb_node);

drivers/android/binder.c

5611

struct rb_node *n;

drivers/android/binder.c

5618

thread = rb_entry(n, struct binder_thread, rb_node);

drivers/android/binder.c

5628

struct rb_node *n;

drivers/android/binder.c

5635

node = rb_entry(n, struct binder_node, rb_node);

drivers/android/binder.c

584

struct rb_node *n;

drivers/android/binder.c

588

thread = rb_entry(n, struct binder_thread, rb_node);

drivers/android/binder.c

6159

struct rb_node *n;

drivers/android/binder.c

6164

struct binder_thread *thread = rb_entry(n, struct binder_thread, rb_node);

drivers/android/binder.c

6263

struct rb_node *n;

drivers/android/binder.c

6295

thread = rb_entry(n, struct binder_thread, rb_node);

drivers/android/binder.c

6307

node = rb_entry(n, struct binder_node, rb_node);

drivers/android/binder.c

6315

rb_erase(&node->rb_node, &proc->nodes);

drivers/android/binder.c

6624

struct rb_node *n;

drivers/android/binder.c

6636

rb_node), print_all, hash_ptrs);

drivers/android/binder.c

6640

rb_node);

drivers/android/binder.c

6788

struct rb_node *n;

drivers/android/binder.c

701

struct rb_node *n = proc->nodes.rb_node;

drivers/android/binder.c

707

node = rb_entry(n, struct binder_node, rb_node);

drivers/android/binder.c

742

struct rb_node **p = &proc->nodes.rb_node;

drivers/android/binder.c

743

struct rb_node *parent = NULL;

drivers/android/binder.c

754

node = rb_entry(parent, struct binder_node, rb_node);

drivers/android/binder.c

773

rb_link_node(&node->rb_node, parent, p);

drivers/android/binder.c

774

rb_insert_color(&node->rb_node, &proc->nodes);

drivers/android/binder.c

905

rb_erase(&node->rb_node, &proc->nodes);

drivers/android/binder_alloc.c

100

rb_insert_color(&new_buffer->rb_node, &alloc->free_buffers);

drivers/android/binder_alloc.c

1044

struct rb_node *n;

drivers/android/binder_alloc.c

1048

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

106

struct rb_node **p = &alloc->allocated_buffers.rb_node;

drivers/android/binder_alloc.c

107

struct rb_node *parent = NULL;

drivers/android/binder_alloc.c

1101

struct rb_node *n;

drivers/android/binder_alloc.c

114

buffer = rb_entry(parent, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

124

rb_link_node(&new_buffer->rb_node, parent, p);

drivers/android/binder_alloc.c

125

rb_insert_color(&new_buffer->rb_node, &alloc->allocated_buffers);

drivers/android/binder_alloc.c

132

struct rb_node *n = alloc->allocated_buffers.rb_node;

drivers/android/binder_alloc.c

136

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

435

struct rb_node *n;

drivers/android/binder_alloc.c

438

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

447

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

475

struct rb_node *n;

drivers/android/binder_alloc.c

488

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

521

struct rb_node *n = alloc->free_buffers.rb_node;

drivers/android/binder_alloc.c

522

struct rb_node *best_fit = NULL;

drivers/android/binder_alloc.c

537

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

563

buffer = rb_entry(best_fit, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

589

rb_erase(&buffer->rb_node, &alloc->free_buffers);

drivers/android/binder_alloc.c

73

struct rb_node **p = &alloc->free_buffers.rb_node;

drivers/android/binder_alloc.c

74

struct rb_node *parent = NULL;

drivers/android/binder_alloc.c

770

rb_erase(&buffer->rb_node, &alloc->allocated_buffers);

drivers/android/binder_alloc.c

776

rb_erase(&next->rb_node, &alloc->free_buffers);

drivers/android/binder_alloc.c

785

rb_erase(&prev->rb_node, &alloc->free_buffers);

drivers/android/binder_alloc.c

89

buffer = rb_entry(parent, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

965

struct rb_node *n;

drivers/android/binder_alloc.c

974

buffer = rb_entry(n, struct binder_buffer, rb_node);

drivers/android/binder_alloc.c

99

rb_link_node(&new_buffer->rb_node, parent, p);

drivers/android/binder_alloc.h

43

struct rb_node rb_node; /* free entry by size or allocated entry */

drivers/android/binder_internal.h

235

struct rb_node rb_node;

drivers/android/binder_internal.h

330

struct rb_node rb_node_desc;

drivers/android/binder_internal.h

331

struct rb_node rb_node_node;

drivers/android/binder_internal.h

494

struct rb_node rb_node;

drivers/android/tests/binder_alloc_kunit.c

425

struct rb_node *n;

drivers/android/tests/binder_alloc_kunit.c

434

buf = rb_entry(n, struct binder_buffer, rb_node);

drivers/base/regmap/internal.h

214

struct rb_node node;

drivers/base/regmap/regcache-rbtree.c

105

new = &root->rb_node;

drivers/base/regmap/regcache-rbtree.c

137

struct rb_node *node;

drivers/base/regmap/regcache-rbtree.c

201

struct rb_node *next;

drivers/base/regmap/regcache-rbtree.c

31

struct rb_node node;

drivers/base/regmap/regcache-rbtree.c

373

struct rb_node *node;

drivers/base/regmap/regcache-rbtree.c

402

node = rbtree_ctx->root.rb_node;

drivers/base/regmap/regcache-rbtree.c

469

struct rb_node *node;

drivers/base/regmap/regcache-rbtree.c

515

struct rb_node *node;

drivers/base/regmap/regcache-rbtree.c

66

struct rb_node *node;

drivers/base/regmap/regcache-rbtree.c

78

node = rbtree_ctx->root.rb_node;

drivers/base/regmap/regcache-rbtree.c

99

struct rb_node **new, *parent;

drivers/base/regmap/regcache.c

380

static int rbtree_all(const void *key, const struct rb_node *node)

drivers/base/regmap/regcache.c

402

struct rb_node *node;

drivers/base/regmap/regmap-debugfs.c

538

struct rb_node *next;

drivers/base/regmap/regmap.c

503

struct rb_node **new = &(root->rb_node), *parent = NULL;

drivers/base/regmap/regmap.c

527

struct rb_node *node = map->range_tree.rb_node;

drivers/base/regmap/regmap.c

546

struct rb_node *next;

drivers/block/drbd/drbd_interval.c

10

sector_t interval_end(struct rb_node *node)

drivers/block/drbd/drbd_interval.c

120

struct rb_node *node = root->rb_node;

drivers/block/drbd/drbd_interval.c

151

struct rb_node *node;

drivers/block/drbd/drbd_interval.c

27

struct rb_node **new = &root->rb_node, *parent = NULL;

drivers/block/drbd/drbd_interval.c

72

struct rb_node *node = root->rb_node;

drivers/block/drbd/drbd_interval.h

9

struct rb_node rb;

drivers/block/loop.c

773

struct rb_node rb_node;

drivers/block/loop.c

798

struct rb_node **node, *parent = NULL;

drivers/block/loop.c

808

node = &lo->worker_tree.rb_node;

drivers/block/loop.c

812

cur_worker = container_of(*node, struct loop_worker, rb_node);

drivers/block/loop.c

844

rb_link_node(&worker->rb_node, parent, node);

drivers/block/loop.c

845

rb_insert_color(&worker->rb_node, &lo->worker_tree);

drivers/block/loop.c

883

rb_erase(&worker->rb_node, &lo->worker_tree);

drivers/block/xen-blkback/blkback.c

171

struct rb_node **new = NULL, *parent = NULL;

drivers/block/xen-blkback/blkback.c

181

new = &ring->persistent_gnts.rb_node;

drivers/block/xen-blkback/blkback.c

209

struct rb_node *node = NULL;

drivers/block/xen-blkback/blkback.c

211

node = ring->persistent_gnts.rb_node;

drivers/block/xen-blkback/blkback.c

248

struct rb_node *n;

drivers/block/xen-blkback/blkback.c

335

struct rb_node *n;

drivers/block/xen-blkback/common.h

247

struct rb_node node;

drivers/dma-buf/sw_sync.c

266

struct rb_node **p = &obj->pt_tree.rb_node;

drivers/dma-buf/sw_sync.c

267

struct rb_node *parent = NULL;

drivers/dma-buf/sync_debug.h

63

struct rb_node node;

drivers/fpga/dfl-afu-dma-region.c

147

struct rb_node **new, *parent = NULL;

drivers/fpga/dfl-afu-dma-region.c

152

new = &afu->dma_regions.rb_node;

drivers/fpga/dfl-afu-dma-region.c

206

struct rb_node *node = rb_first(&afu->dma_regions);

drivers/fpga/dfl-afu-dma-region.c

248

struct rb_node *node = afu->dma_regions.rb_node;

drivers/fpga/dfl-afu.h

58

struct rb_node node;

drivers/gpu/drm/amd/amdgpu/amdgpu_object.h

67

struct rb_node rb;

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

2805

struct rb_node *rb_node;

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

2826

rb_node = rb_prev(&node->rb);

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

2831

rb_node = rb_last(&p->svms.objects.rb_root);

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

2833

if (rb_node) {

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

2834

node = container_of(rb_node, struct interval_tree_node, rb);

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

2877

mapping = container_of((struct rb_node *)node,

drivers/gpu/drm/amd/amdkfd/kfd_svm.c

3425

mapping = container_of((struct rb_node *)node,

drivers/gpu/drm/drm_buddy.c

241

struct rb_node *iter = rb_last(&mm->free_trees[tree][i]);

drivers/gpu/drm/drm_buddy.c

64

rbtree_get_free_block(const struct rb_node *node)

drivers/gpu/drm/drm_buddy.c

86

static bool rbtree_block_offset_less(struct rb_node *block,

drivers/gpu/drm/drm_buddy.c

87

const struct rb_node *node)

drivers/gpu/drm/drm_buddy.c

930

struct rb_node *iter;

drivers/gpu/drm/drm_gpusvm.c

434

static struct drm_gpusvm_notifier *to_drm_gpusvm_notifier(struct rb_node *node)

drivers/gpu/drm/drm_gpusvm.c

449

struct rb_node *node;

drivers/gpu/drm/drm_gpusvm.c

564

static struct drm_gpusvm_range *to_drm_gpusvm_range(struct rb_node *node)

drivers/gpu/drm/drm_gpusvm.c

579

struct rb_node *node;

drivers/gpu/drm/drm_gpuvm.c

1985

struct rb_node *node;

drivers/gpu/drm/drm_mm.c

169

struct rb_node **link, *rb;

drivers/gpu/drm/drm_mm.c

191

link = &mm->interval_tree.rb_root.rb_node;

drivers/gpu/drm/drm_mm.c

216

static u64 rb_to_hole_size(struct rb_node *rb)

drivers/gpu/drm/drm_mm.c

224

struct rb_node **link = &root->rb_root.rb_node, *rb = NULL;

drivers/gpu/drm/drm_mm.c

248

struct rb_node **link = &root->rb_node, *rb_parent = NULL;

drivers/gpu/drm/drm_mm.c

296

static inline struct drm_mm_node *rb_hole_size_to_node(struct rb_node *rb)

drivers/gpu/drm/drm_mm.c

301

static inline struct drm_mm_node *rb_hole_addr_to_node(struct rb_node *rb)

drivers/gpu/drm/drm_mm.c

308

struct rb_node *rb = mm->holes_size.rb_root.rb_node;

drivers/gpu/drm/drm_mm.c

326

static bool usable_hole_addr(struct rb_node *rb, u64 size)

drivers/gpu/drm/drm_mm.c

333

struct rb_node *rb = mm->holes_addr.rb_node;

drivers/gpu/drm/drm_mm.c

393

struct rb_node *parent, *node = &entry->rb_hole_addr; \

drivers/gpu/drm/drm_mm.c

494

static u64 rb_to_hole_size_or_zero(struct rb_node *rb)

drivers/gpu/drm/drm_prime.c

101

struct rb_node **p, *rb;

drivers/gpu/drm/drm_prime.c

112

p = &prime_fpriv->dmabufs.rb_node;

drivers/gpu/drm/drm_prime.c

127

p = &prime_fpriv->handles.rb_node;

drivers/gpu/drm/drm_prime.c

147

struct rb_node *rb;

drivers/gpu/drm/drm_prime.c

149

rb = prime_fpriv->handles.rb_node;

drivers/gpu/drm/drm_prime.c

169

struct rb_node *rb;

drivers/gpu/drm/drm_prime.c

171

rb = prime_fpriv->dmabufs.rb_node;

drivers/gpu/drm/drm_prime.c

192

struct rb_node *rb;

drivers/gpu/drm/drm_prime.c

194

rb = prime_fpriv->handles.rb_node;

drivers/gpu/drm/drm_prime.c

93

struct rb_node dmabuf_rb;

drivers/gpu/drm/drm_prime.c

94

struct rb_node handle_rb;

drivers/gpu/drm/drm_vma_manager.c

146

struct rb_node *iter;

drivers/gpu/drm/drm_vma_manager.c

149

iter = mgr->vm_addr_space_mm.interval_tree.rb_root.rb_node;

drivers/gpu/drm/drm_vma_manager.c

247

struct rb_node **iter;

drivers/gpu/drm/drm_vma_manager.c

248

struct rb_node *parent = NULL;

drivers/gpu/drm/drm_vma_manager.c

260

iter = &node->vm_files.rb_node;

drivers/gpu/drm/drm_vma_manager.c

362

struct rb_node *iter;

drivers/gpu/drm/drm_vma_manager.c

366

iter = node->vm_files.rb_node;

drivers/gpu/drm/drm_vma_manager.c

403

struct rb_node *iter;

drivers/gpu/drm/drm_vma_manager.c

407

iter = node->vm_files.rb_node;

drivers/gpu/drm/i915/gem/i915_gem_mman.c

661

struct rb_node *rb;

drivers/gpu/drm/i915/gem/i915_gem_mman.c

664

rb = obj->mmo.offsets.rb_node;

drivers/gpu/drm/i915/gem/i915_gem_mman.c

687

struct rb_node *rb, **p;

drivers/gpu/drm/i915/gem/i915_gem_mman.c

691

p = &obj->mmo.offsets.rb_node;

drivers/gpu/drm/i915/gem/i915_gem_object_types.h

228

struct rb_node offset;

drivers/gpu/drm/i915/gt/intel_engine_types.h

417

struct rb_node uabi_node;

drivers/gpu/drm/i915/gt/intel_engine_user.c

21

struct rb_node *p = i915->uabi_engines.rb_node;

drivers/gpu/drm/i915/gt/intel_engine_user.c

211

struct rb_node **p, *prev;

drivers/gpu/drm/i915/gt/intel_engine_user.c

217

p = &i915->uabi_engines.rb_node;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

1025

struct rb_node *rb = rb_first_cached(&el->virtual);

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

1278

struct rb_node *rb;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

198

struct rb_node rb;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

257

static struct i915_priolist *to_priolist(struct rb_node *rb)

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

287

struct rb_node *rb;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

298

struct rb_node *rb = rb_first_cached(&el->virtual);

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

3149

struct rb_node *rb;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

3634

struct rb_node *node = &ve->nodes[sibling->id].rb;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

3825

struct rb_node **parent, *rb;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

3858

parent = &sibling->execlists.virtual.rb_root.rb_node;

drivers/gpu/drm/i915/gt/intel_execlists_submission.c

4086

struct rb_node *rb;

drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c

1978

struct rb_node *rb;

drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c

404

static inline struct i915_priolist *to_priolist(struct rb_node *rb)

drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c

5495

struct rb_node *rb;

drivers/gpu/drm/i915/gt/uc/intel_guc_submission.c

932

struct rb_node *rb;

drivers/gpu/drm/i915/gvt/kvmgt.c

100

struct rb_node dma_addr_node;

drivers/gpu/drm/i915/gvt/kvmgt.c

213

struct rb_node *node = vgpu->dma_addr_cache.rb_node;

drivers/gpu/drm/i915/gvt/kvmgt.c

231

struct rb_node *node = vgpu->gfn_cache.rb_node;

drivers/gpu/drm/i915/gvt/kvmgt.c

251

struct rb_node **link, *parent = NULL;

drivers/gpu/drm/i915/gvt/kvmgt.c

264

link = &vgpu->gfn_cache.rb_node;

drivers/gpu/drm/i915/gvt/kvmgt.c

279

link = &vgpu->dma_addr_cache.rb_node;

drivers/gpu/drm/i915/gvt/kvmgt.c

308

struct rb_node *node = NULL;

drivers/gpu/drm/i915/gvt/kvmgt.c

99

struct rb_node gfn_node;

drivers/gpu/drm/i915/i915_active.c

143

ref->cache = fetch_node(ref->tree.rb_node);

drivers/gpu/drm/i915/i915_active.c

152

rb_link_node(&ref->cache->node, NULL, &ref->tree.rb_node);

drivers/gpu/drm/i915/i915_active.c

154

GEM_BUG_ON(ref->tree.rb_node != &ref->cache->node);

drivers/gpu/drm/i915/i915_active.c

27

struct rb_node node;

drivers/gpu/drm/i915/i915_active.c

271

it = fetch_node(ref->tree.rb_node);

drivers/gpu/drm/i915/i915_active.c

291

struct rb_node **p, *parent;

drivers/gpu/drm/i915/i915_active.c

301

p = &ref->tree.rb_node;

drivers/gpu/drm/i915/i915_active.c

757

struct rb_node *prev, *p;

drivers/gpu/drm/i915/i915_active.c

777

p = ref->tree.rb_node;

drivers/gpu/drm/i915/i915_active.c

936

struct rb_node **p, *parent;

drivers/gpu/drm/i915/i915_active.c

941

p = &ref->tree.rb_node;

drivers/gpu/drm/i915/i915_priolist_types.h

43

struct rb_node node;

drivers/gpu/drm/i915/i915_scheduler.c

34

static inline struct i915_priolist *to_priolist(struct rb_node *rb)

drivers/gpu/drm/i915/i915_scheduler.c

41

struct rb_node *rb;

drivers/gpu/drm/i915/i915_scheduler.c

63

struct rb_node **parent, *rb;

drivers/gpu/drm/i915/i915_scheduler.c

75

parent = &sched_engine->queue.rb_root.rb_node;

drivers/gpu/drm/i915/i915_vma.c

154

struct rb_node *rb, **p;

drivers/gpu/drm/i915/i915_vma.c

238

p = &obj->vma.tree.rb_node;

drivers/gpu/drm/i915/i915_vma.c

291

struct rb_node *rb;

drivers/gpu/drm/i915/i915_vma.c

293

rb = obj->vma.tree.rb_node;

drivers/gpu/drm/i915/i915_vma_resource.h

107

struct rb_node rb;

drivers/gpu/drm/i915/i915_vma_types.h

244

struct rb_node obj_node;

drivers/gpu/drm/nouveau/include/nvkm/core/object.h

20

struct rb_node node;

drivers/gpu/drm/nouveau/include/nvkm/subdev/mmu.h

9

struct rb_node tree;

drivers/gpu/drm/nouveau/nvkm/core/object.c

37

struct rb_node *node = client->objroot.rb_node;

drivers/gpu/drm/nouveau/nvkm/core/object.c

76

struct rb_node **ptr;

drivers/gpu/drm/nouveau/nvkm/core/object.c

77

struct rb_node *parent = NULL;

drivers/gpu/drm/nouveau/nvkm/core/object.c

81

ptr = &object->client->objroot.rb_node;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

1055

struct rb_node *node;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

1729

struct rb_node *node = NULL, *temp;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

1776

temp = vmm->free.rb_node;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

876

struct rb_node **ptr = &vmm->free.rb_node;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

877

struct rb_node *parent = NULL;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

918

struct rb_node **ptr = &vmm->root.rb_node;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

919

struct rb_node *parent = NULL;

drivers/gpu/drm/nouveau/nvkm/subdev/mmu/vmm.c

940

struct rb_node *node = vmm->root.rb_node;

drivers/gpu/drm/scheduler/sched_main.c

136

static __always_inline bool drm_sched_entity_compare_before(struct rb_node *a,

drivers/gpu/drm/scheduler/sched_main.c

137

const struct rb_node *b)

drivers/gpu/drm/scheduler/sched_main.c

316

struct rb_node *rb;

drivers/gpu/drm/vmwgfx/vmwgfx_bo.c

862

struct rb_node *rb_itr = vbo->res_tree.rb_node;

drivers/gpu/drm/vmwgfx/vmwgfx_drv.h

148

struct rb_node mob_node;

drivers/gpu/drm/vmwgfx/vmwgfx_resource.c

1103

struct rb_node *cur = vbo->res_tree.rb_node;

drivers/gpu/drm/vmwgfx/vmwgfx_resource.c

45

struct rb_node **new = &gbo->res_tree.rb_node, *parent = NULL;

drivers/gpu/drm/vmwgfx/vmwgfx_resource.c

769

struct rb_node *node = vbo->res_tree.rb_node;

drivers/gpu/drm/xe/xe_range_fence.h

25

struct rb_node rb;

drivers/gpu/drm/xe/xe_vm.h

32

int xe_vma_cmp_vma_cb(const void *key, const struct rb_node *node);

drivers/infiniband/core/cm.c

200

struct rb_node remote_qp_node;

drivers/infiniband/core/cm.c

201

struct rb_node remote_id_node;

drivers/infiniband/core/cm.c

211

struct rb_node service_node;

drivers/infiniband/core/cm.c

212

struct rb_node sidr_id_node;

drivers/infiniband/core/cm.c

634

struct rb_node **link = &cm.listen_service_table.rb_node;

drivers/infiniband/core/cm.c

635

struct rb_node *parent = NULL;

drivers/infiniband/core/cm.c

681

struct rb_node *node = cm.listen_service_table.rb_node;

drivers/infiniband/core/cm.c

706

struct rb_node **link = &cm.remote_id_table.rb_node;

drivers/infiniband/core/cm.c

707

struct rb_node *parent = NULL;

drivers/infiniband/core/cm.c

736

struct rb_node *node = cm.remote_id_table.rb_node;

drivers/infiniband/core/cm.c

765

struct rb_node **link = &cm.remote_qp_table.rb_node;

drivers/infiniband/core/cm.c

766

struct rb_node *parent = NULL;

drivers/infiniband/core/cm.c

795

struct rb_node **link = &cm.remote_sidr_table.rb_node;

drivers/infiniband/core/cm.c

796

struct rb_node *parent = NULL;

drivers/infiniband/core/cma.c

200

struct rb_node rb_node;

drivers/infiniband/core/cma.c

488

struct rb_node **new, *parent = NULL;

drivers/infiniband/core/cma.c

498

new = &id_table.rb_node;

drivers/infiniband/core/cma.c

500

this = container_of(*new, struct id_table_entry, rb_node);

drivers/infiniband/core/cma.c

521

rb_link_node(&node->rb_node, parent, new);

drivers/infiniband/core/cma.c

522

rb_insert_color(&node->rb_node, &id_table);

drivers/infiniband/core/cma.c

532

struct rb_node *node = root->rb_node;

drivers/infiniband/core/cma.c

537

data = container_of(node, struct id_table_entry, rb_node);

drivers/infiniband/core/cma.c

567

rb_erase(&data->rb_node, &id_table);

drivers/infiniband/core/multicast.c

132

struct rb_node *node = port->table.rb_node;

drivers/infiniband/core/multicast.c

154

struct rb_node **link = &port->table.rb_node;

drivers/infiniband/core/multicast.c

155

struct rb_node *parent = NULL;

drivers/infiniband/core/multicast.c

775

struct rb_node *node;

drivers/infiniband/core/multicast.c

98

struct rb_node node;

drivers/infiniband/core/uverbs_cmd.c

500

struct rb_node node;

drivers/infiniband/core/uverbs_cmd.c

510

struct rb_node **p = &dev->xrcd_tree.rb_node;

drivers/infiniband/core/uverbs_cmd.c

511

struct rb_node *parent = NULL;

drivers/infiniband/core/uverbs_cmd.c

544

struct rb_node *p = dev->xrcd_tree.rb_node;

drivers/infiniband/hw/hfi1/mmu_rb.c

81

struct rb_node *node;

drivers/infiniband/hw/hfi1/mmu_rb.h

16

struct rb_node node;

drivers/infiniband/hw/hfi1/pin_system.c

101

rb_node = hfi1_mmu_rb_get_first(handler, start, (end - start));

drivers/infiniband/hw/hfi1/pin_system.c

102

if (!rb_node) {

drivers/infiniband/hw/hfi1/pin_system.c

108

kref_get(&rb_node->refcount);

drivers/infiniband/hw/hfi1/pin_system.c

111

return container_of(rb_node, struct sdma_mmu_node, rb);

drivers/infiniband/hw/hfi1/pin_system.c

97

struct mmu_rb_node *rb_node;

drivers/infiniband/hw/mlx4/cm.c

157

struct rb_node *node = sl_id_map->rb_node;

drivers/infiniband/hw/mlx4/cm.c

202

struct rb_node **link = &sl_id_map->rb_node, *parent = NULL;

drivers/infiniband/hw/mlx4/cm.c

45

struct rb_node node;

drivers/infiniband/hw/mlx4/cm.c

528

struct rb_node *nd;

drivers/infiniband/hw/mlx4/mcg.c

103

struct rb_node node;

drivers/infiniband/hw/mlx4/mcg.c

1086

struct rb_node *p;

drivers/infiniband/hw/mlx4/mcg.c

1238

struct rb_node *p;

drivers/infiniband/hw/mlx4/mcg.c

165

struct rb_node *node = ctx->mcg_table.rb_node;

drivers/infiniband/hw/mlx4/mcg.c

186

struct rb_node **link = &ctx->mcg_table.rb_node;

drivers/infiniband/hw/mlx4/mcg.c

187

struct rb_node *parent = NULL;

drivers/infiniband/hw/mlx5/mlx5_ib.h

809

struct rb_node node;

drivers/infiniband/hw/mlx5/mr.c

1021

struct rb_node *node;

drivers/infiniband/hw/mlx5/mr.c

490

struct rb_node *node;

drivers/infiniband/hw/mlx5/mr.c

671

struct rb_node **new = &cache->rb_root.rb_node, *parent = NULL;

drivers/infiniband/hw/mlx5/mr.c

699

struct rb_node *node = dev->cache.rb_root.rb_node;

drivers/infiniband/hw/mlx5/mr.c

944

struct rb_node *node;

drivers/infiniband/hw/mlx5/mr.c

968

struct rb_node *node;

drivers/infiniband/hw/usnic/usnic_uiom_interval_tree.h

40

struct rb_node rb;

drivers/infiniband/sw/rdmavt/mcast.c

109

struct rb_node *n;

drivers/infiniband/sw/rdmavt/mcast.c

114

n = ibp->mcast_tree.rb_node;

drivers/infiniband/sw/rdmavt/mcast.c

119

mcast = rb_entry(n, struct rvt_mcast, rb_node);

drivers/infiniband/sw/rdmavt/mcast.c

154

struct rb_node **n = &ibp->mcast_tree.rb_node;

drivers/infiniband/sw/rdmavt/mcast.c

155

struct rb_node *pn = NULL;

drivers/infiniband/sw/rdmavt/mcast.c

165

tmcast = rb_entry(pn, struct rvt_mcast, rb_node);

drivers/infiniband/sw/rdmavt/mcast.c

219

rb_link_node(&mcast->rb_node, pn, n);

drivers/infiniband/sw/rdmavt/mcast.c

220

rb_insert_color(&mcast->rb_node, &ibp->mcast_tree);

drivers/infiniband/sw/rdmavt/mcast.c

308

struct rb_node *n;

drivers/infiniband/sw/rdmavt/mcast.c

318

n = ibp->mcast_tree.rb_node;

drivers/infiniband/sw/rdmavt/mcast.c

325

mcast = rb_entry(n, struct rvt_mcast, rb_node);

drivers/infiniband/sw/rdmavt/mcast.c

356

rb_erase(&mcast->rb_node, &ibp->mcast_tree);

drivers/infiniband/sw/rdmavt/mcast.c

398

if (rdi->ports[i]->mcast_tree.rb_node)

drivers/infiniband/sw/rxe/rxe_mcast.c

128

struct rb_node *node;

drivers/infiniband/sw/rxe/rxe_mcast.c

131

node = tree->rb_node;

drivers/infiniband/sw/rxe/rxe_mcast.c

84

struct rb_node **link = &tree->rb_node;

drivers/infiniband/sw/rxe/rxe_mcast.c

85

struct rb_node *node = NULL;

drivers/infiniband/sw/rxe/rxe_verbs.h

392

struct rb_node node;

drivers/infiniband/ulp/ipoib/ipoib.h

166

struct rb_node rb_node;

drivers/infiniband/ulp/ipoib/ipoib.h

438

struct rb_node rb_node;

drivers/infiniband/ulp/ipoib/ipoib_main.c

601

struct rb_node *n = priv->path_tree.rb_node;

drivers/infiniband/ulp/ipoib/ipoib_main.c

606

path = rb_entry(n, struct ipoib_path, rb_node);

drivers/infiniband/ulp/ipoib/ipoib_main.c

625

struct rb_node **n = &priv->path_tree.rb_node;

drivers/infiniband/ulp/ipoib/ipoib_main.c

626

struct rb_node *pn = NULL;

drivers/infiniband/ulp/ipoib/ipoib_main.c

632

tpath = rb_entry(pn, struct ipoib_path, rb_node);

drivers/infiniband/ulp/ipoib/ipoib_main.c

644

rb_link_node(&path->rb_node, pn, n);

drivers/infiniband/ulp/ipoib/ipoib_main.c

645

rb_insert_color(&path->rb_node, &priv->path_tree);

drivers/infiniband/ulp/ipoib/ipoib_main.c

694

struct rb_node *n;

drivers/infiniband/ulp/ipoib/ipoib_main.c

703

path = rb_entry(n, struct ipoib_path, rb_node);

drivers/infiniband/ulp/ipoib/ipoib_main.c

767

rb_erase(&path->rb_node, &priv->path_tree);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

1001

struct rb_node *n;

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

1010

mcast = rb_entry(n, struct ipoib_mcast, rb_node);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

161

struct rb_node *n = priv->multicast_tree.rb_node;

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

167

mcast = rb_entry(n, struct ipoib_mcast, rb_node);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

185

struct rb_node **n = &priv->multicast_tree.rb_node, *pn = NULL;

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

192

tmcast = rb_entry(pn, struct ipoib_mcast, rb_node);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

204

rb_link_node(&mcast->rb_node, pn, n);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

205

rb_insert_color(&mcast->rb_node, &priv->multicast_tree);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

718

rb_erase(&mcast->rb_node, &priv->multicast_tree);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

837

rb_erase(&mcast->rb_node, &priv->multicast_tree);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

842

rb_erase(&priv->broadcast->rb_node, &priv->multicast_tree);

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

935

rb_replace_node(&mcast->rb_node,

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

936

&nmcast->rb_node,

drivers/infiniband/ulp/ipoib/ipoib_multicast.c

955

rb_erase(&mcast->rb_node, &priv->multicast_tree);

drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.c

1809

static int arm_smmu_streams_cmp_key(const void *lhs, const struct rb_node *rhs)

drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.c

1822

static int arm_smmu_streams_cmp_node(struct rb_node *lhs,

drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.c

1823

const struct rb_node *rhs)

drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.c

1832

struct rb_node *node;

drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.c

3527

struct rb_node *existing;

drivers/iommu/arm/arm-smmu-v3/arm-smmu-v3.h

811

struct rb_node node;

drivers/iommu/intel/iommu.c

104

static int device_rid_cmp(struct rb_node *lhs, const struct rb_node *rhs)

drivers/iommu/intel/iommu.c

127

struct rb_node *node;

drivers/iommu/intel/iommu.c

142

struct rb_node *curr;

drivers/iommu/intel/iommu.c

89

static int device_rid_cmp_key(const void *key, const struct rb_node *node)

drivers/iommu/intel/iommu.h

766

struct rb_node node;

drivers/iommu/iova.c

101

struct rb_node *node, *next;

drivers/iommu/iova.c

113

node = iovad->rbroot.rb_node;

drivers/iommu/iova.c

139

struct rb_node *start)

drivers/iommu/iova.c

141

struct rb_node **new, *parent = NULL;

drivers/iommu/iova.c

143

new = (start) ? &start : &(root->rb_node);

drivers/iommu/iova.c

168

struct rb_node *curr, *prev;

drivers/iommu/iova.c

278

struct rb_node *node = iovad->rbroot.rb_node;

drivers/iommu/iova.c

32

static struct iova *to_iova(struct rb_node *node)

drivers/iommu/iova.c

459

__is_range_overlap(struct rb_node *node,

drivers/iommu/iova.c

518

struct rb_node *node;

drivers/iommu/iova.c

57

rb_link_node(&iovad->anchor.node, NULL, &iovad->rbroot.rb_node);

drivers/iommu/iova.c

62

static struct rb_node *

drivers/iommu/iova.c

99

static struct rb_node *iova_find_limit(struct iova_domain *iovad, unsigned long limit_pfn)

drivers/md/bcache/bcache.h

227

struct rb_node node;

drivers/md/bcache/util.h

453

struct rb_node **n = &(root)->rb_node, *parent = NULL; \

drivers/md/bcache/util.h

477

struct rb_node *n = (root)->rb_node; \

drivers/md/bcache/util.h

497

struct rb_node *n = (root)->rb_node; \

drivers/md/dm-bio-prison-v1.c

145

struct rb_node **new = &root->rb_node, *parent = NULL;

drivers/md/dm-bio-prison-v1.h

53

struct rb_node node;

drivers/md/dm-bio-prison-v2.c

121

struct rb_node **new = &prison->cells.rb_node, *parent = NULL;

drivers/md/dm-bio-prison-v2.h

52

struct rb_node node;

drivers/md/dm-bufio.c

321

struct rb_node node;

drivers/md/dm-bufio.c

599

struct rb_node *n = root->rb_node;

drivers/md/dm-bufio.c

822

struct rb_node **new = &root->rb_node, *parent = NULL;

drivers/md/dm-bufio.c

896

struct rb_node *n = root->rb_node;

drivers/md/dm-cache-background-tracker.c

109

struct rb_node **new = &b->pending.rb_node;

drivers/md/dm-cache-background-tracker.c

80

struct rb_node **new = &b->pending.rb_node, *parent = NULL;

drivers/md/dm-cache-background-tracker.h

31

struct rb_node node;

drivers/md/dm-crypt.c

1931

#define crypt_io_from_node(node) rb_entry((node), struct dm_crypt_io, rb_node)

drivers/md/dm-crypt.c

1967

BUG_ON(rb_parent(write_tree.rb_node));

drivers/md/dm-crypt.c

1976

rb_erase(&io->rb_node, &write_tree);

drivers/md/dm-crypt.c

1991

struct rb_node **rbp, *parent;

drivers/md/dm-crypt.c

2012

rbp = &cc->write_tree.rb_node;

drivers/md/dm-crypt.c

2022

rb_link_node(&io->rb_node, parent, rbp);

drivers/md/dm-crypt.c

2023

rb_insert_color(&io->rb_node, &cc->write_tree);

drivers/md/dm-crypt.c

95

struct rb_node rb_node;

drivers/md/dm-dust.c

18

struct rb_node node;

drivers/md/dm-dust.c

243

struct rb_node *node = NULL, *nnode = NULL;

drivers/md/dm-dust.c

259

BUG_ON(tree->rb_node != NULL);

drivers/md/dm-dust.c

292

struct rb_node *node;

drivers/md/dm-dust.c

38

struct rb_node *node = root->rb_node;

drivers/md/dm-dust.c

57

struct rb_node **link = &root->rb_node, *parent = NULL;

drivers/md/dm-integrity.c

1215

struct rb_node **n = &ic->in_progress.rb_node;

drivers/md/dm-integrity.c

1216

struct rb_node *parent;

drivers/md/dm-integrity.c

1305

struct rb_node **link;

drivers/md/dm-integrity.c

1306

struct rb_node *parent;

drivers/md/dm-integrity.c

1311

link = &ic->journal_tree_root.rb_node;

drivers/md/dm-integrity.c

1340

struct rb_node *n = ic->journal_tree_root.rb_node;

drivers/md/dm-integrity.c

1363

struct rb_node *next;

drivers/md/dm-integrity.c

1383

struct rb_node *next;

drivers/md/dm-integrity.c

158

struct rb_node node;

drivers/md/dm-integrity.c

305

struct rb_node node;

drivers/md/dm-ioctl.c

110

struct rb_node *n = uuid_rb_tree.rb_node;

drivers/md/dm-ioctl.c

145

struct rb_node **n, *parent;

drivers/md/dm-ioctl.c

151

n = &name_rb_tree.rb_node;

drivers/md/dm-ioctl.c

170

struct rb_node **n, *parent;

drivers/md/dm-ioctl.c

176

n = &uuid_rb_tree.rb_node;

drivers/md/dm-ioctl.c

339

struct rb_node *n;

drivers/md/dm-ioctl.c

45

struct rb_node name_node;

drivers/md/dm-ioctl.c

46

struct rb_node uuid_node;

drivers/md/dm-ioctl.c

593

struct rb_node *n;

drivers/md/dm-ioctl.c

91

struct rb_node *n = name_rb_tree.rb_node;

drivers/md/dm-pcache/cache.h

114

struct rb_node rb_node;

drivers/md/dm-pcache/cache.h

262

struct rb_node *start_node;

drivers/md/dm-pcache/cache.h

30

#define CACHE_KEY(node) (container_of(node, struct pcache_cache_key, rb_node))

drivers/md/dm-pcache/cache.h

322

struct rb_node *cache_subtree_search(struct pcache_cache_subtree *cache_subtree, struct pcache_cache_key *key,

drivers/md/dm-pcache/cache.h

323

struct rb_node **parentp, struct rb_node ***newp,

drivers/md/dm-pcache/cache.h

458

rb_erase(&key->rb_node, &cache_subtree->root);

drivers/md/dm-pcache/cache_key.c

14

RB_CLEAR_NODE(&key->rb_node);

drivers/md/dm-pcache/cache_key.c

241

struct rb_node *node_tmp;

drivers/md/dm-pcache/cache_key.c

360

struct rb_node *cache_subtree_search(struct pcache_cache_subtree *cache_subtree, struct pcache_cache_key *key,

drivers/md/dm-pcache/cache_key.c

361

struct rb_node **parentp, struct rb_node ***newp,

drivers/md/dm-pcache/cache_key.c

364

struct rb_node **new, *parent = NULL;

drivers/md/dm-pcache/cache_key.c

366

struct rb_node *prev_node = NULL;

drivers/md/dm-pcache/cache_key.c

368

new = &(cache_subtree->root.rb_node);

drivers/md/dm-pcache/cache_key.c

370

key_tmp = container_of(*new, struct pcache_cache_key, rb_node);

drivers/md/dm-pcache/cache_key.c

579

struct rb_node **new, *parent = NULL;

drivers/md/dm-pcache/cache_key.c

582

struct rb_node *prev_node = NULL;

drivers/md/dm-pcache/cache_key.c

632

rb_link_node(&key->rb_node, parent, new);

drivers/md/dm-pcache/cache_key.c

633

rb_insert_color(&key->rb_node, &cache_subtree->root);

drivers/md/dm-pcache/cache_key.c

649

struct rb_node *node;

drivers/md/dm-pcache/cache_key.c

865

struct rb_node *node;

drivers/md/dm-pcache/cache_req.c

667

struct rb_node *prev_node = NULL;

drivers/md/dm-pcache/cache_writeback.c

145

struct rb_node *node;

drivers/md/dm-snap.c

1743

struct rb_node *next;

drivers/md/dm-snap.c

1761

struct rb_node *parent = NULL;

drivers/md/dm-snap.c

1762

struct rb_node **p = &s->out_of_order_tree.rb_node;

drivers/md/dm-snap.c

229

struct rb_node out_of_order_node;

drivers/md/dm-thin.c

2115

#define thin_pbd(node) rb_entry((node), struct dm_thin_endio_hook, rb_node)

drivers/md/dm-thin.c

2120

struct rb_node **rbp, *parent;

drivers/md/dm-thin.c

2124

rbp = &tc->sort_bio_list.rb_node;

drivers/md/dm-thin.c

2137

rb_link_node(&pbd->rb_node, parent, rbp);

drivers/md/dm-thin.c

2138

rb_insert_color(&pbd->rb_node, &tc->sort_bio_list);

drivers/md/dm-thin.c

2143

struct rb_node *node;

drivers/md/dm-thin.c

2152

rb_erase(&pbd->rb_node, &tc->sort_bio_list);

drivers/md/dm-thin.c

591

struct rb_node rb_node;

drivers/md/dm-writecache.c

1400

struct rb_node *next = rb_next(&e->rb_node);

drivers/md/dm-writecache.c

1404

f = container_of(next, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

1946

struct rb_node *node, *next_node;

drivers/md/dm-writecache.c

2009

e = container_of(rb_first(&wc->tree), struct wc_entry, rb_node);

drivers/md/dm-writecache.c

2018

node = rb_prev(&e->rb_node);

drivers/md/dm-writecache.c

2020

f = container_of(node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

2038

next_node = rb_next(&f->rb_node);

drivers/md/dm-writecache.c

2041

g = container_of(next_node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

2073

next_node = rb_next(&f->rb_node);

drivers/md/dm-writecache.c

2075

g = container_of(next_node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

610

struct rb_node *node = wc->tree.rb_node;

drivers/md/dm-writecache.c

616

e = container_of(node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

621

e->rb_node.rb_left : e->rb_node.rb_right);

drivers/md/dm-writecache.c

628

node = rb_next(&e->rb_node);

drivers/md/dm-writecache.c

632

e = container_of(node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

641

node = rb_prev(&e->rb_node);

drivers/md/dm-writecache.c

643

node = rb_next(&e->rb_node);

drivers/md/dm-writecache.c

646

e2 = container_of(node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

656

struct rb_node **node = &wc->tree.rb_node, *parent = NULL;

drivers/md/dm-writecache.c

659

e = container_of(*node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

660

parent = &e->rb_node;

drivers/md/dm-writecache.c

666

rb_link_node(&ins->rb_node, parent, node);

drivers/md/dm-writecache.c

667

rb_insert_color(&ins->rb_node, &wc->tree);

drivers/md/dm-writecache.c

675

rb_erase(&e->rb_node, &wc->tree);

drivers/md/dm-writecache.c

681

struct rb_node **node = &wc->freetree.rb_node, *parent = NULL;

drivers/md/dm-writecache.c

687

if (&e->rb_node < *node)

drivers/md/dm-writecache.c

692

rb_link_node(&e->rb_node, parent, node);

drivers/md/dm-writecache.c

693

rb_insert_color(&e->rb_node, &wc->freetree);

drivers/md/dm-writecache.c

721

struct rb_node *next;

drivers/md/dm-writecache.c

728

next = rb_next(&e->rb_node);

drivers/md/dm-writecache.c

729

rb_erase(&e->rb_node, &wc->freetree);

drivers/md/dm-writecache.c

732

wc->current_free = next ? container_of(next, struct wc_entry, rb_node) : NULL;

drivers/md/dm-writecache.c

82

struct rb_node rb_node;

drivers/md/dm-writecache.c

837

struct rb_node *rb_node = rb_prev(&e->rb_node);

drivers/md/dm-writecache.c

839

if (rb_node) {

drivers/md/dm-writecache.c

840

e2 = container_of(rb_node, struct wc_entry, rb_node);

drivers/md/dm-writecache.c

890

struct rb_node *node = rb_next(&e->rb_node);

drivers/md/dm-writecache.c

908

e = container_of(node, struct wc_entry, rb_node);

drivers/md/dm-zoned-metadata.c

110

struct rb_node node;

drivers/md/dm-zoned-metadata.c

461

struct rb_node **new = &(root->rb_node), *parent = NULL;

drivers/md/dm-zoned-metadata.c

484

struct rb_node *node = root->rb_node;

drivers/md/md.h

381

struct rb_node node;

drivers/md/persistent-data/dm-transaction-manager.c

110

struct rb_node **node;

drivers/md/persistent-data/dm-transaction-manager.c

113

node = &tm->buckets[bucket].rb_node;

drivers/md/persistent-data/dm-transaction-manager.c

142

struct rb_node **node, *parent;

drivers/md/persistent-data/dm-transaction-manager.c

147

node = &tm->buckets[bucket].rb_node;

drivers/md/persistent-data/dm-transaction-manager.c

172

rb_entry(tm->buckets[i].rb_node, struct shadow_info, node);

drivers/md/persistent-data/dm-transaction-manager.c

81

struct rb_node node;

drivers/mtd/mtdswap.c

1186

if (root->rb_node) {

drivers/mtd/mtdswap.c

161

#define TREE_EMPTY(d, name) (TREE_ROOT(d, name)->rb_node == NULL)

drivers/mtd/mtdswap.c

205

struct rb_node **p, *parent = NULL;

drivers/mtd/mtdswap.c

208

p = &root->rb_node;

drivers/mtd/mtdswap.c

236

static struct rb_node *mtdswap_rb_index(struct rb_root *root, unsigned int idx)

drivers/mtd/mtdswap.c

238

struct rb_node *p;

drivers/mtd/mtdswap.c

419

struct rb_node *medrb;

drivers/mtd/mtdswap.c

70

struct rb_node rb;

drivers/mtd/mtdswap.c

766

if (d->trees[idx].root.rb_node != NULL)

drivers/mtd/mtdswap.c

809

if (root->rb_node == NULL)

drivers/mtd/ubi/attach.c

108

struct rb_node **p = &ai->volumes.rb_node, *parent = NULL;

drivers/mtd/ubi/attach.c

1281

struct rb_node *this = av->root.rb_node;

drivers/mtd/ubi/attach.c

1315

struct rb_node *rb;

drivers/mtd/ubi/attach.c

1339

rb = ai->volumes.rb_node;

drivers/mtd/ubi/attach.c

1378

struct rb_node *rb1, *rb2;

drivers/mtd/ubi/attach.c

1665

struct rb_node *rb1, *rb2;

drivers/mtd/ubi/attach.c

570

struct rb_node **p, *parent = NULL;

drivers/mtd/ubi/attach.c

590

p = &av->root.rb_node;

drivers/mtd/ubi/eba.c

1534

struct rb_node *rb;

drivers/mtd/ubi/eba.c

1625

struct rb_node *rb;

drivers/mtd/ubi/eba.c

209

struct rb_node *p;

drivers/mtd/ubi/eba.c

211

p = ubi->ltree.rb_node;

drivers/mtd/ubi/eba.c

270

struct rb_node **p, *parent = NULL;

drivers/mtd/ubi/eba.c

278

p = &ubi->ltree.rb_node;

drivers/mtd/ubi/fastmap-wl.c

151

if (!ubi->free.rb_node)

drivers/mtd/ubi/fastmap-wl.c

275

while (!ubi->free.rb_node && ubi->works_count) {

drivers/mtd/ubi/fastmap-wl.c

28

struct rb_node *p;

drivers/mtd/ubi/fastmap-wl.c

388

if (!ubi->used.rb_node)

drivers/mtd/ubi/fastmap-wl.c

393

if (!ubi->free.rb_node)

drivers/mtd/ubi/fastmap-wl.c

399

if (ubi->free.rb_node) {

drivers/mtd/ubi/fastmap-wl.c

557

e = rb_entry(rb_next(root->rb_node),

drivers/mtd/ubi/fastmap-wl.c

79

if (!ubi->free.rb_node)

drivers/mtd/ubi/fastmap.c

1146

struct rb_node *tmp_rb;

drivers/mtd/ubi/fastmap.c

208

struct rb_node **p = &av->root.rb_node, *parent = NULL;

drivers/mtd/ubi/fastmap.c

246

struct rb_node **p = &av->root.rb_node, *parent = NULL;

drivers/mtd/ubi/fastmap.c

373

struct rb_node *node, *node2;

drivers/mtd/ubi/fastmap.c

523

struct rb_node *rb1, *rb2;

drivers/mtd/ubi/ubi.h

172

struct rb_node rb;

drivers/mtd/ubi/ubi.h

194

struct rb_node rb;

drivers/mtd/ubi/ubi.h

684

struct rb_node rb;

drivers/mtd/ubi/ubi.h

719

struct rb_node rb;

drivers/mtd/ubi/vtbl.c

366

struct rb_node *rb;

drivers/mtd/ubi/wl.c

1043

if (!ubi->scrub.rb_node) {

drivers/mtd/ubi/wl.c

1051

if (!ubi->used.rb_node || !ubi->free.rb_node)

drivers/mtd/ubi/wl.c

141

struct rb_node **p, *parent = NULL;

drivers/mtd/ubi/wl.c

143

p = &root->rb_node;

drivers/mtd/ubi/wl.c

1638

struct rb_node *rb;

drivers/mtd/ubi/wl.c

1641

rb = root->rb_node;

drivers/mtd/ubi/wl.c

1802

struct rb_node *rb1, *rb2;

drivers/mtd/ubi/wl.c

2115

while (!ubi->free.rb_node && ubi->works_count) {

drivers/mtd/ubi/wl.c

2145

if (!ubi->free.rb_node) {

drivers/mtd/ubi/wl.c

244

struct rb_node *p;

drivers/mtd/ubi/wl.c

246

p = root->rb_node;

drivers/mtd/ubi/wl.c

329

struct rb_node *p;

drivers/mtd/ubi/wl.c

336

p = root->rb_node;

drivers/mtd/ubi/wl.c

372

e = rb_entry(root->rb_node, struct ubi_wl_entry, u.rb);

drivers/mtd/ubi/wl.c

688

if (!ubi->free.rb_node ||

drivers/mtd/ubi/wl.c

690

(!ubi->used.rb_node && !ubi->scrub.rb_node)) {

drivers/mtd/ubi/wl.c

702

!ubi->free.rb_node, !ubi->used.rb_node);

drivers/mtd/ubi/wl.c

732

} else if (!ubi->scrub.rb_node) {

drivers/mtd/ubi/wl.c

734

if (!ubi->scrub.rb_node) {

drivers/net/ethernet/mellanox/mlx4/resource_tracker.c

237

struct rb_node *node = root->rb_node;

drivers/net/ethernet/mellanox/mlx4/resource_tracker.c

255

struct rb_node **new = &(root->rb_node), *parent = NULL;

drivers/net/ethernet/mellanox/mlx4/resource_tracker.c

5025

struct rb_node *p;

drivers/net/ethernet/mellanox/mlx4/resource_tracker.c

73

struct rb_node node;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

127

struct rb_node *parent = NULL;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

129

struct rb_node **new;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

138

new = &root->rb_node;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

142

tfp = rb_entry(parent, struct fw_page, rb_node);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

162

rb_link_node(&nfp->rb_node, parent, new);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

163

rb_insert_color(&nfp->rb_node, root);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

174

struct rb_node *tmp;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

181

tmp = root->rb_node;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

184

tfp = rb_entry(tmp, struct fw_page, rb_node);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

263

rb_erase(&fwp->rb_node, root);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

439

struct rb_node *p;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

449

struct fw_page *fwp = rb_entry(p, struct fw_page, rb_node);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

487

struct rb_node *p;

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

510

fwp = rb_entry(p, struct fw_page, rb_node);

drivers/net/ethernet/mellanox/mlx5/core/pagealloc.c

58

struct rb_node rb_node;

drivers/platform/surface/aggregator/controller.c

2569

struct rb_node *n;

drivers/platform/surface/aggregator/controller.c

2614

struct rb_node *n;

drivers/platform/surface/aggregator/controller.c

291

struct rb_node node;

drivers/platform/surface/aggregator/controller.c

320

struct rb_node **link = &nf->refcount.rb_node;

drivers/platform/surface/aggregator/controller.c

321

struct rb_node *parent = NULL;

drivers/platform/surface/aggregator/controller.c

382

struct rb_node *node = nf->refcount.rb_node;

drivers/staging/media/atomisp/include/hmm/hmm_bo.h

115

struct rb_node node;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

118

struct rb_node *n = root->rb_node;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

143

struct rb_node *n = root->rb_node;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

168

struct rb_node **new = &root->rb_node;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

169

struct rb_node *parent = NULL;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

201

struct rb_node **new = &root->rb_node;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

202

struct rb_node *parent = NULL;

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

397

bo = __bo_search_and_remove_from_free_rbtree(root->rb_node, pgnr);

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

504

rbtree_node_to_hmm_bo(bdev->allocated_rbtree.rb_node));

drivers/staging/media/atomisp/pci/hmm/hmm_bo.c

65

struct rb_node *node, unsigned int pgnr)

drivers/vfio/vfio_iommu_type1.c

129

struct rb_node node;

drivers/vfio/vfio_iommu_type1.c

1312

struct rb_node *n;

drivers/vfio/vfio_iommu_type1.c

1405

struct rb_node *n, *first_n;

drivers/vfio/vfio_iommu_type1.c

1502

struct rb_node *last_n = n;

drivers/vfio/vfio_iommu_type1.c

169

struct rb_node *node = iommu->dma_list.rb_node;

drivers/vfio/vfio_iommu_type1.c

1809

struct rb_node *n;

drivers/vfio/vfio_iommu_type1.c

187

static struct rb_node *vfio_find_dma_first_node(struct vfio_iommu *iommu,

drivers/vfio/vfio_iommu_type1.c

191

struct rb_node *res = NULL;

drivers/vfio/vfio_iommu_type1.c

192

struct rb_node *node = iommu->dma_list.rb_node;

drivers/vfio/vfio_iommu_type1.c

217

struct rb_node **link = &iommu->dma_list.rb_node, *parent = NULL;

drivers/vfio/vfio_iommu_type1.c

2431

struct rb_node *node;

drivers/vfio/vfio_iommu_type1.c

2439

struct rb_node *n, *p;

drivers/vfio/vfio_iommu_type1.c

270

struct rb_node *p;

drivers/vfio/vfio_iommu_type1.c

282

struct rb_node *n;

drivers/vfio/vfio_iommu_type1.c

294

struct rb_node *n;

drivers/vfio/vfio_iommu_type1.c

302

struct rb_node *p;

drivers/vfio/vfio_iommu_type1.c

319

struct rb_node *n;

drivers/vfio/vfio_iommu_type1.c

340

struct rb_node *node = dma->pfn_list.rb_node;

drivers/vfio/vfio_iommu_type1.c

363

struct rb_node **link, *parent = NULL;

drivers/vfio/vfio_iommu_type1.c

366

link = &dma->pfn_list.rb_node;

drivers/vfio/vfio_iommu_type1.c

646

struct rb_node *prev;

drivers/vfio/vfio_iommu_type1.c

647

struct rb_node *next;

drivers/vfio/vfio_iommu_type1.c

89

struct rb_node node;

drivers/xen/evtchn.c

110

struct rb_node **new = &(u->evtchns.rb_node), *parent = NULL;

drivers/xen/evtchn.c

145

struct rb_node *node = u->evtchns.rb_node;

drivers/xen/evtchn.c

671

struct rb_node *node;

drivers/xen/evtchn.c

673

while ((node = u->evtchns.rb_node)) {

drivers/xen/evtchn.c

84

struct rb_node node;

fs/afs/callback.c

115

struct rb_node *p;

fs/afs/callback.c

126

p = rcu_dereference_raw(cell->volumes.rb_node);

fs/afs/cell.c

253

struct rb_node *parent, **pp;

fs/afs/cell.c

289

pp = &net->cells.rb_node;

fs/afs/cell.c

49

struct rb_node *p;

fs/afs/cell.c

67

p = net->cells.rb_node;

fs/afs/cell.c

896

struct rb_node *cursor;

fs/afs/internal.h

374

struct rb_node net_node; /* Node in net->cells */

fs/afs/internal.h

544

struct rb_node uuid_rb; /* Link in cell->fs_servers */

fs/afs/internal.h

630

struct rb_node cell_node; /* Link in cell->volumes */

fs/afs/server.c

40

struct rb_node *p;

fs/afs/server.c

45

p = cell->fs_servers.rb_node;

fs/afs/server.c

515

struct rb_node *rb;

fs/afs/server.c

74

struct rb_node **pp, *p;

fs/afs/server.c

80

pp = &cell->fs_servers.rb_node;

fs/afs/vl_alias.c

147

pvol = afs_get_volume(rb_entry(p->volumes.rb_node,

fs/afs/volume.c

25

struct rb_node *parent = NULL, **pp;

fs/afs/volume.c

29

pp = &cell->volumes.rb_node;

fs/btrfs/backref.c

1388

struct rb_node *node;

fs/btrfs/backref.c

253

static int prelim_ref_rb_add_cmp(const struct rb_node *new,

fs/btrfs/backref.c

254

const struct rb_node *exist)

fs/btrfs/backref.c

296

struct rb_node *exist;

fs/btrfs/backref.c

3062

RB_CLEAR_NODE(&node->rb_node);

fs/btrfs/backref.c

3135

if (!RB_EMPTY_NODE(&node->rb_node))

fs/btrfs/backref.c

3136

rb_erase(&node->rb_node, &tree->rb_root);

fs/btrfs/backref.c

3174

struct btrfs_backref_node, rb_node)))

fs/btrfs/backref.c

3210

struct rb_node *rb_node;

fs/btrfs/backref.c

3239

rb_node = rb_simple_search(&cache->rb_root, ref_key->offset);

fs/btrfs/backref.c

3240

if (!rb_node) {

fs/btrfs/backref.c

3256

upper = rb_entry(rb_node, struct btrfs_backref_node, rb_node);

fs/btrfs/backref.c

3290

struct rb_node *rb_node;

fs/btrfs/backref.c

3378

rb_node = rb_simple_search(&cache->rb_root, eb->start);

fs/btrfs/backref.c

3379

if (!rb_node) {

fs/btrfs/backref.c

3423

upper = rb_entry(rb_node, struct btrfs_backref_node,

fs/btrfs/backref.c

3424

rb_node);

fs/btrfs/backref.c

3432

if (rb_node) {

fs/btrfs/backref.c

3583

struct rb_node *rb_node;

fs/btrfs/backref.c

3588

rb_node = rb_simple_insert(&cache->rb_root, &start->simple_node);

fs/btrfs/backref.c

3589

if (rb_node)

fs/btrfs/backref.c

3628

if (!RB_EMPTY_NODE(&upper->rb_node)) {

fs/btrfs/backref.c

3639

rb_node = rb_simple_insert(&cache->rb_root, &upper->simple_node);

fs/btrfs/backref.c

3640

if (unlikely(rb_node))

fs/btrfs/backref.c

3681

RB_EMPTY_NODE(&lower->rb_node))

fs/btrfs/backref.c

3684

if (!RB_EMPTY_NODE(&upper->rb_node))

fs/btrfs/backref.c

444

struct rb_node **p = &preftrees->direct.root.rb_root.rb_node;

fs/btrfs/backref.c

445

struct rb_node *parent = NULL;

fs/btrfs/backref.c

739

struct rb_node *rnode;

fs/btrfs/backref.c

841

struct rb_node *node;

fs/btrfs/backref.c

892

struct rb_node *n;

fs/btrfs/backref.h

263

struct rb_node rbnode;

fs/btrfs/backref.h

323

struct rb_node rb_node;

fs/btrfs/block-group.c

189

static int btrfs_bg_start_cmp(const struct rb_node *new,

fs/btrfs/block-group.c

190

const struct rb_node *exist)

fs/btrfs/block-group.c

210

struct rb_node *exist;

fs/btrfs/block-group.c

234

struct rb_node *n;

fs/btrfs/block-group.c

238

n = info->block_group_cache_tree.rb_root.rb_node;

fs/btrfs/block-group.c

2552

struct rb_node *node;

fs/btrfs/block-group.c

2559

map = rb_entry(node, struct btrfs_chunk_map, rb_node);

fs/btrfs/block-group.c

289

struct rb_node *node;

fs/btrfs/block-group.c

4624

struct rb_node *n;

fs/btrfs/block-group.c

4899

struct rb_node *node_bg, *node_chunk;

fs/btrfs/block-group.c

4909

map = rb_entry(node_chunk, struct btrfs_chunk_map, rb_node);

fs/btrfs/block-group.h

188

struct rb_node cache_node;

fs/btrfs/block-rsv.c

340

rb_node) {

fs/btrfs/btrfs_inode.h

188

struct rb_node *ordered_tree_last;

fs/btrfs/ctree.h

174

struct rb_node rb_node;

fs/btrfs/defrag.c

165

struct rb_node *p;

fs/btrfs/defrag.c

166

struct rb_node *parent = NULL;

fs/btrfs/defrag.c

173

p = fs_info->defrag_inodes.rb_node;

fs/btrfs/defrag.c

176

entry = rb_entry(parent, struct inode_defrag, rb_node);

fs/btrfs/defrag.c

189

entry = rb_entry_safe(parent, struct inode_defrag, rb_node);

fs/btrfs/defrag.c

205

&fs_info->defrag_inodes, rb_node)

fs/btrfs/defrag.c

27

struct rb_node rb_node;

fs/btrfs/defrag.c

64

static int inode_defrag_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/defrag.c

66

const struct inode_defrag *new_defrag = rb_entry(new, struct inode_defrag, rb_node);

fs/btrfs/defrag.c

67

const struct inode_defrag *existing_defrag = rb_entry(existing, struct inode_defrag, rb_node);

fs/btrfs/defrag.c

83

struct rb_node *node;

fs/btrfs/defrag.c

85

node = rb_find_add(&defrag->rb_node, &fs_info->defrag_inodes, inode_defrag_cmp);

fs/btrfs/defrag.c

89

entry = rb_entry(node, struct inode_defrag, rb_node);

fs/btrfs/delayed-inode.c

358

RB_CLEAR_NODE(&item->rb_node);

fs/btrfs/delayed-inode.c

366

static int delayed_item_index_cmp(const void *key, const struct rb_node *node)

fs/btrfs/delayed-inode.c

370

struct btrfs_delayed_item, rb_node);

fs/btrfs/delayed-inode.c

393

struct rb_node *node;

fs/btrfs/delayed-inode.c

396

return rb_entry_safe(node, struct btrfs_delayed_item, rb_node);

fs/btrfs/delayed-inode.c

399

static int btrfs_delayed_item_cmp(const struct rb_node *new,

fs/btrfs/delayed-inode.c

400

const struct rb_node *exist)

fs/btrfs/delayed-inode.c

403

rb_entry(new, struct btrfs_delayed_item, rb_node);

fs/btrfs/delayed-inode.c

412

struct rb_node *exist;

fs/btrfs/delayed-inode.c

419

exist = rb_find_add_cached(&ins->rb_node, root, btrfs_delayed_item_cmp);

fs/btrfs/delayed-inode.c

448

if (RB_EMPTY_NODE(&delayed_item->rb_node))

fs/btrfs/delayed-inode.c

459

rb_erase_cached(&delayed_item->rb_node, root);

fs/btrfs/delayed-inode.c

460

RB_CLEAR_NODE(&delayed_item->rb_node);

fs/btrfs/delayed-inode.c

477

struct rb_node *p = rb_first_cached(&delayed_node->ins_root);

fs/btrfs/delayed-inode.c

479

return rb_entry_safe(p, struct btrfs_delayed_item, rb_node);

fs/btrfs/delayed-inode.c

485

struct rb_node *p = rb_first_cached(&delayed_node->del_root);

fs/btrfs/delayed-inode.c

487

return rb_entry_safe(p, struct btrfs_delayed_item, rb_node);

fs/btrfs/delayed-inode.c

493

struct rb_node *p = rb_next(&item->rb_node);

fs/btrfs/delayed-inode.c

495

return rb_entry_safe(p, struct btrfs_delayed_item, rb_node);

fs/btrfs/delayed-inode.h

92

struct rb_node rb_node;

fs/btrfs/delayed-ref.c

1242

struct rb_node *node;

fs/btrfs/delayed-ref.c

1248

node = head->ref_tree.rb_root.rb_node;

fs/btrfs/delayed-ref.c

1281

struct rb_node *n;

fs/btrfs/delayed-ref.c

320

static int cmp_refs_node(const struct rb_node *new, const struct rb_node *exist)

fs/btrfs/delayed-ref.c

333

struct rb_node *node = &ins->ref_node;

fs/btrfs/delayed-ref.c

334

struct rb_node *exist = rb_find_add_cached(node, root, cmp_refs_node);

fs/btrfs/delayed-ref.c

391

struct rb_node *node = rb_next(&ref->ref_node);

fs/btrfs/delayed-ref.c

436

struct rb_node *node;

fs/btrfs/delayed-ref.h

62

struct rb_node ref_node;

fs/btrfs/dev-replace.c

814

struct rb_node *node;

fs/btrfs/dev-replace.c

827

struct rb_node *next = rb_next(node);

fs/btrfs/dev-replace.c

831

map = rb_entry(node, struct btrfs_chunk_map, rb_node);

fs/btrfs/dev-replace.c

842

node = &map->rb_node;

fs/btrfs/disk-io.c

1185

struct rb_node *node;

fs/btrfs/disk-io.c

1188

root = rb_entry(node, struct btrfs_root, rb_node);

fs/btrfs/disk-io.c

1189

rb_erase(&root->rb_node, &fs_info->global_root_tree);

fs/btrfs/disk-io.c

1773

rb_node)

fs/btrfs/disk-io.c

614

RB_CLEAR_NODE(&root->rb_node);

fs/btrfs/disk-io.c

689

static int global_root_cmp(struct rb_node *a_node, const struct rb_node *b_node)

fs/btrfs/disk-io.c

691

const struct btrfs_root *a = rb_entry(a_node, struct btrfs_root, rb_node);

fs/btrfs/disk-io.c

692

const struct btrfs_root *b = rb_entry(b_node, struct btrfs_root, rb_node);

fs/btrfs/disk-io.c

697

static int global_root_key_cmp(const void *k, const struct rb_node *node)

fs/btrfs/disk-io.c

700

const struct btrfs_root *root = rb_entry(node, struct btrfs_root, rb_node);

fs/btrfs/disk-io.c

708

struct rb_node *tmp;

fs/btrfs/disk-io.c

712

tmp = rb_find_add(&root->rb_node, &fs_info->global_root_tree, global_root_cmp);

fs/btrfs/disk-io.c

728

rb_erase(&root->rb_node, &fs_info->global_root_tree);

fs/btrfs/disk-io.c

735

struct rb_node *node;

fs/btrfs/disk-io.c

741

root = container_of(node, struct btrfs_root, rb_node);

fs/btrfs/extent-io-tree.c

1051

struct rb_node **p = NULL;

fs/btrfs/extent-io-tree.c

1052

struct rb_node *parent = NULL;

fs/btrfs/extent-io-tree.c

124

rbtree_postorder_for_each_entry_safe(state, tmp, &root, rb_node) {

fs/btrfs/extent-io-tree.c

126

RB_CLEAR_NODE(&state->rb_node);

fs/btrfs/extent-io-tree.c

1321

struct rb_node **p = NULL;

fs/btrfs/extent-io-tree.c

1322

struct rb_node *parent = NULL;

fs/btrfs/extent-io-tree.c

15

return !RB_EMPTY_NODE(&state->rb_node);

fs/btrfs/extent-io-tree.c

158

RB_CLEAR_NODE(&state->rb_node);

fs/btrfs/extent-io-tree.c

203

struct rb_node *next = rb_next(&state->rb_node);

fs/btrfs/extent-io-tree.c

205

return rb_entry_safe(next, struct extent_state, rb_node);

fs/btrfs/extent-io-tree.c

210

struct rb_node *next = rb_prev(&state->rb_node);

fs/btrfs/extent-io-tree.c

212

return rb_entry_safe(next, struct extent_state, rb_node);

fs/btrfs/extent-io-tree.c

236

struct rb_node ***node_ret,

fs/btrfs/extent-io-tree.c

237

struct rb_node **parent_ret)

fs/btrfs/extent-io-tree.c

240

struct rb_node **node = &root->rb_node;

fs/btrfs/extent-io-tree.c

241

struct rb_node *prev = NULL;

fs/btrfs/extent-io-tree.c

246

entry = rb_entry(prev, struct extent_state, rb_node);

fs/btrfs/extent-io-tree.c

290

struct rb_node **node = &root->rb_node;

fs/btrfs/extent-io-tree.c

298

entry = rb_entry(*node, struct extent_state, rb_node);

fs/btrfs/extent-io-tree.c

348

rb_erase(&prev->rb_node, &tree->state);

fs/btrfs/extent-io-tree.c

349

RB_CLEAR_NODE(&prev->rb_node);

fs/btrfs/extent-io-tree.c

363

rb_erase(&next->rb_node, &tree->state);

fs/btrfs/extent-io-tree.c

364

RB_CLEAR_NODE(&next->rb_node);

fs/btrfs/extent-io-tree.c

422

struct rb_node **node;

fs/btrfs/extent-io-tree.c

423

struct rb_node *parent = NULL;

fs/btrfs/extent-io-tree.c

430

node = &tree->state.rb_node;

fs/btrfs/extent-io-tree.c

435

entry = rb_entry(parent, struct extent_state, rb_node);

fs/btrfs/extent-io-tree.c

466

rb_link_node(&state->rb_node, parent, node);

fs/btrfs/extent-io-tree.c

467

rb_insert_color(&state->rb_node, &tree->state);

fs/btrfs/extent-io-tree.c

476

struct extent_state *state, struct rb_node **node,

fs/btrfs/extent-io-tree.c

477

struct rb_node *parent, unsigned bits,

fs/btrfs/extent-io-tree.c

481

rb_link_node(&state->rb_node, parent, node);

fs/btrfs/extent-io-tree.c

482

rb_insert_color(&state->rb_node, &tree->state);

fs/btrfs/extent-io-tree.c

503

struct rb_node *parent = NULL;

fs/btrfs/extent-io-tree.c

504

struct rb_node **node;

fs/btrfs/extent-io-tree.c

514

parent = &orig->rb_node;

fs/btrfs/extent-io-tree.c

520

entry = rb_entry(parent, struct extent_state, rb_node);

fs/btrfs/extent-io-tree.c

532

rb_link_node(&prealloc->rb_node, parent, node);

fs/btrfs/extent-io-tree.c

533

rb_insert_color(&prealloc->rb_node, &tree->state);

fs/btrfs/extent-io-tree.c

577

rb_erase(&state->rb_node, &tree->state);

fs/btrfs/extent-io-tree.c

578

RB_CLEAR_NODE(&state->rb_node);

fs/btrfs/extent-io-tree.h

126

struct rb_node rb_node;

fs/btrfs/extent-tree.c

2177

struct rb_node *n = root->rb_node;

fs/btrfs/extent-tree.c

2185

entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node);

fs/btrfs/extent-tree.c

2190

entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node);

fs/btrfs/extent-tree.c

2193

n = root->rb_node;

fs/btrfs/extent-tree.c

2196

entry = rb_entry(n, struct btrfs_delayed_ref_node, rb_node);

fs/btrfs/extent-tree.c

2298

struct rb_node *node;

fs/btrfs/extent-tree.c

2666

struct rb_node *leftmost;

fs/btrfs/extent_map.c

101

entry = rb_entry(parent, struct extent_map, rb_node);

fs/btrfs/extent_map.c

114

entry = rb_entry(parent, struct extent_map, rb_node);

fs/btrfs/extent_map.c

1140

struct rb_node *node;

fs/btrfs/extent_map.c

1163

struct rb_node *next = rb_next(node);

fs/btrfs/extent_map.c

1166

em = rb_entry(node, struct extent_map, rb_node);

fs/btrfs/extent_map.c

121

entry = rb_entry(parent, struct extent_map, rb_node);

fs/btrfs/extent_map.c

124

entry = rb_entry(parent, struct extent_map, rb_node);

fs/btrfs/extent_map.c

130

rb_link_node(&em->rb_node, orig_parent, p);

fs/btrfs/extent_map.c

131

rb_insert_color(&em->rb_node, root);

fs/btrfs/extent_map.c

139

static struct rb_node *tree_search(struct rb_root *root, u64 offset,

fs/btrfs/extent_map.c

140

struct rb_node **prev_or_next_ret)

fs/btrfs/extent_map.c

142

struct rb_node *n = root->rb_node;

fs/btrfs/extent_map.c

143

struct rb_node *prev = NULL;

fs/btrfs/extent_map.c

144

struct rb_node *orig_prev = NULL;

fs/btrfs/extent_map.c

151

entry = rb_entry(n, struct extent_map, rb_node);

fs/btrfs/extent_map.c

166

prev_entry = rb_entry(prev, struct extent_map, rb_node);

fs/btrfs/extent_map.c

179

prev_entry = rb_entry(prev, struct extent_map, rb_node);

fs/btrfs/extent_map.c

182

prev_entry = rb_entry(prev, struct extent_map, rb_node);

fs/btrfs/extent_map.c

358

struct rb_node *rb;

fs/btrfs/extent_map.c

375

rb = rb_prev(&em->rb_node);

fs/btrfs/extent_map.c

376

merge = rb_entry_safe(rb, struct extent_map, rb_node);

fs/btrfs/extent_map.c

393

rb = rb_next(&em->rb_node);

fs/btrfs/extent_map.c

394

merge = rb_entry_safe(rb, struct extent_map, rb_node);

fs/btrfs/extent_map.c

51

RB_CLEAR_NODE(&em->rb_node);

fs/btrfs/extent_map.c

527

struct rb_node *rb_node;

fs/btrfs/extent_map.c

528

struct rb_node *prev_or_next = NULL;

fs/btrfs/extent_map.c

531

rb_node = tree_search(&tree->root, start, &prev_or_next);

fs/btrfs/extent_map.c

532

if (!rb_node) {

fs/btrfs/extent_map.c

534

rb_node = prev_or_next;

fs/btrfs/extent_map.c

539

em = rb_entry(rb_node, struct extent_map, rb_node);

fs/btrfs/extent_map.c

622

rb_replace_node(&cur->rb_node, &new->rb_node, &tree->root);

fs/btrfs/extent_map.c

623

RB_CLEAR_NODE(&cur->rb_node);

fs/btrfs/extent_map.c

630

struct rb_node *next;

fs/btrfs/extent_map.c

632

next = rb_next(&em->rb_node);

fs/btrfs/extent_map.c

635

return container_of(next, struct extent_map, rb_node);

fs/btrfs/extent_map.c

640

struct rb_node *prev;

fs/btrfs/extent_map.c

642

prev = rb_prev(&em->rb_node);

fs/btrfs/extent_map.c

645

return container_of(prev, struct extent_map, rb_node);

fs/btrfs/extent_map.c

776

struct rb_node *node;

fs/btrfs/extent_map.c

782

struct rb_node *next = rb_next(node);

fs/btrfs/extent_map.c

784

em = rb_entry(node, struct extent_map, rb_node);

fs/btrfs/extent_map.c

84

rb_erase(&em->rb_node, &inode->extent_tree.root);

fs/btrfs/extent_map.c

85

RB_CLEAR_NODE(&em->rb_node);

fs/btrfs/extent_map.c

93

struct rb_node **p = &root->rb_node;

fs/btrfs/extent_map.c

94

struct rb_node *parent = NULL;

fs/btrfs/extent_map.c

96

struct rb_node *orig_parent = NULL;

fs/btrfs/extent_map.h

149

return !RB_EMPTY_NODE(&em->rb_node);

fs/btrfs/extent_map.h

45

struct rb_node rb_node;

fs/btrfs/free-space-cache.c

1079

struct rb_node *node = rb_first(&ctl->free_space_offset);

fs/btrfs/free-space-cache.c

1588

struct rb_node **p;

fs/btrfs/free-space-cache.c

1589

struct rb_node *parent = NULL;

fs/btrfs/free-space-cache.c

1600

p = &root->rb_node;

fs/btrfs/free-space-cache.c

1683

static bool entry_less(struct rb_node *node, const struct rb_node *parent)

fs/btrfs/free-space-cache.c

1703

struct rb_node *n = ctl->free_space_offset.rb_node;

fs/btrfs/free-space-cache.c

2011

struct rb_node *node;

fs/btrfs/free-space-cache.c

2016

if (!ctl->free_space_offset.rb_node)

fs/btrfs/free-space-cache.c

2080

struct rb_node *old_next = rb_next(node);

fs/btrfs/free-space-cache.c

2183

struct rb_node *next = rb_next(&bitmap_info->offset_index);

fs/btrfs/free-space-cache.c

2335

struct rb_node *node;

fs/btrfs/free-space-cache.c

2454

struct rb_node *right_prev = NULL;

fs/btrfs/free-space-cache.c

2916

struct rb_node *n;

fs/btrfs/free-space-cache.c

2980

struct rb_node *node;

fs/btrfs/free-space-cache.c

3060

struct rb_node *node;

fs/btrfs/free-space-cache.c

3232

struct rb_node *node;

fs/btrfs/free-space-cache.c

3426

struct rb_node *node;

fs/btrfs/free-space-cache.c

3725

struct rb_node *node;

fs/btrfs/free-space-cache.c

4158

struct rb_node *node;

fs/btrfs/free-space-cache.c

4328

struct rb_node *n;

fs/btrfs/free-space-cache.c

68

struct rb_node *node;

fs/btrfs/free-space-cache.c

903

struct rb_node *n;

fs/btrfs/free-space-cache.h

38

struct rb_node offset_index;

fs/btrfs/free-space-cache.h

39

struct rb_node bytes_index;

fs/btrfs/free-space-tree.c

1166

struct rb_node *node;

fs/btrfs/free-space-tree.c

1227

struct rb_node *node;

fs/btrfs/free-space-tree.c

1332

struct rb_node *node;

fs/btrfs/inode.c

10141

struct rb_node **p;

fs/btrfs/inode.c

10142

struct rb_node *parent = NULL;

fs/btrfs/inode.c

10153

p = &fs_info->swapfile_pins.rb_node;

fs/btrfs/inode.c

10182

struct rb_node *node, *next;

fs/btrfs/inode.c

5527

struct rb_node *node;

fs/btrfs/inode.c

5559

state = rb_entry(node, struct extent_state, rb_node);

fs/btrfs/misc.h

123

struct rb_node rb_node;

fs/btrfs/misc.h

127

static inline struct rb_node *rb_simple_search(const struct rb_root *root, u64 bytenr)

fs/btrfs/misc.h

129

struct rb_node *node = root->rb_node;

fs/btrfs/misc.h

133

entry = rb_entry(node, struct rb_simple_node, rb_node);

fs/btrfs/misc.h

154

static inline struct rb_node *rb_simple_search_first(const struct rb_root *root,

fs/btrfs/misc.h

157

struct rb_node *node = root->rb_node, *ret = NULL;

fs/btrfs/misc.h

161

entry = rb_entry(node, struct rb_simple_node, rb_node);

fs/btrfs/misc.h

180

static int rb_simple_node_bytenr_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/misc.h

182

struct rb_simple_node *new_entry = rb_entry(new, struct rb_simple_node, rb_node);

fs/btrfs/misc.h

183

struct rb_simple_node *existing_entry = rb_entry(existing, struct rb_simple_node, rb_node);

fs/btrfs/misc.h

193

static inline struct rb_node *rb_simple_insert(struct rb_root *root,

fs/btrfs/misc.h

196

return rb_find_add(&simple_node->rb_node, root, rb_simple_node_bytenr_cmp);

fs/btrfs/ordered-data.c

1005

entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

101

rb_node);

fs/btrfs/ordered-data.c

1034

struct rb_node *n;

fs/btrfs/ordered-data.c

1042

ordered = rb_entry(n, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

1062

struct rb_node *node;

fs/btrfs/ordered-data.c

107

rb_node);

fs/btrfs/ordered-data.c

1070

entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

1090

struct rb_node *node;

fs/btrfs/ordered-data.c

1091

struct rb_node *cur;

fs/btrfs/ordered-data.c

1092

struct rb_node *prev;

fs/btrfs/ordered-data.c

1093

struct rb_node *next;

fs/btrfs/ordered-data.c

1097

node = inode->ordered_tree.rb_node;

fs/btrfs/ordered-data.c

1105

entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

1124

cur = &entry->rb_node;

fs/btrfs/ordered-data.c

1134

entry = rb_entry(prev, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

1139

entry = rb_entry(next, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

1237

struct rb_node *node;

fs/btrfs/ordered-data.c

127

static inline struct rb_node *ordered_tree_search(struct btrfs_inode *inode,

fs/btrfs/ordered-data.c

130

struct rb_node *prev = NULL;

fs/btrfs/ordered-data.c

131

struct rb_node *ret;

fs/btrfs/ordered-data.c

1333

node = tree_insert(&inode->ordered_tree, new->file_offset, &new->rb_node);

fs/btrfs/ordered-data.c

136

rb_node);

fs/btrfs/ordered-data.c

230

struct rb_node *node;

fs/btrfs/ordered-data.c

242

&entry->rb_node);

fs/btrfs/ordered-data.c

36

static struct rb_node *tree_insert(struct rb_root *root, u64 file_offset,

fs/btrfs/ordered-data.c

37

struct rb_node *node)

fs/btrfs/ordered-data.c

39

struct rb_node **p = &root->rb_node;

fs/btrfs/ordered-data.c

40

struct rb_node *parent = NULL;

fs/btrfs/ordered-data.c

45

entry = rb_entry(parent, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

481

struct rb_node *node;

fs/btrfs/ordered-data.c

499

entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

512

rb_node);

fs/btrfs/ordered-data.c

570

struct rb_node *node;

fs/btrfs/ordered-data.c

584

entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

629

ASSERT(RB_EMPTY_NODE(&entry->rb_node));

fs/btrfs/ordered-data.c

64

static struct rb_node *__tree_search(struct rb_root *root, u64 file_offset,

fs/btrfs/ordered-data.c

646

struct rb_node *node;

fs/btrfs/ordered-data.c

65

struct rb_node **prev_ret)

fs/btrfs/ordered-data.c

67

struct rb_node *n = root->rb_node;

fs/btrfs/ordered-data.c

677

node = &entry->rb_node;

fs/btrfs/ordered-data.c

68

struct rb_node *prev = NULL;

fs/btrfs/ordered-data.c

69

struct rb_node *test;

fs/btrfs/ordered-data.c

74

entry = rb_entry(n, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

93

rb_node);

fs/btrfs/ordered-data.c

967

struct rb_node *node;

fs/btrfs/ordered-data.c

975

entry = rb_entry(node, struct btrfs_ordered_extent, rb_node);

fs/btrfs/ordered-data.c

993

struct rb_node *node;

fs/btrfs/ordered-data.h

146

struct rb_node rb_node;

fs/btrfs/qgroup.c

163

static int btrfs_qgroup_qgroupid_key_cmp(const void *key, const struct rb_node *node)

fs/btrfs/qgroup.c

180

struct rb_node *node;

fs/btrfs/qgroup.c

186

static int btrfs_qgroup_qgroupid_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/qgroup.c

205

struct rb_node *node;

fs/btrfs/qgroup.c

4014

struct rb_node *n;

fs/btrfs/qgroup.c

4121

struct rb_node *node;

fs/btrfs/qgroup.c

4122

struct rb_node *next;

fs/btrfs/qgroup.c

4126

node = reserved->range_changed.root.rb_node;

fs/btrfs/qgroup.c

4130

entry = rb_entry(node, struct ulist_node, rb_node);

fs/btrfs/qgroup.c

4137

if (entry->val > start && rb_prev(&entry->rb_node))

fs/btrfs/qgroup.c

4138

entry = rb_entry(rb_prev(&entry->rb_node), struct ulist_node,

fs/btrfs/qgroup.c

4139

rb_node);

fs/btrfs/qgroup.c

4141

rbtree_iterate_from_safe(node, next, &entry->rb_node) {

fs/btrfs/qgroup.c

4147

entry = rb_entry(node, struct ulist_node, rb_node);

fs/btrfs/qgroup.c

4705

static int qgroup_swapped_block_bytenr_key_cmp(const void *key, const struct rb_node *node)

fs/btrfs/qgroup.c

4719

static int qgroup_swapped_block_bytenr_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/qgroup.c

4746

struct rb_node *node;

fs/btrfs/qgroup.c

4839

struct rb_node *node;

fs/btrfs/qgroup.c

636

struct rb_node *node;

fs/btrfs/qgroup.c

671

struct rb_node *n;

fs/btrfs/qgroup.h

155

struct rb_node node;

fs/btrfs/qgroup.h

275

struct rb_node node; /* tree of qgroups */

fs/btrfs/ref-verify.c

101

struct rb_node *node;

fs/btrfs/ref-verify.c

109

struct rb_node *node;

fs/btrfs/ref-verify.c

115

static int root_entry_root_objectid_key_cmp(const void *key, const struct rb_node *node)

fs/btrfs/ref-verify.c

128

static int root_entry_root_objectid_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/ref-verify.c

138

struct rb_node *node;

fs/btrfs/ref-verify.c

165

static int ref_entry_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/ref-verify.c

176

struct rb_node *node;

fs/btrfs/ref-verify.c

184

struct rb_node *node;

fs/btrfs/ref-verify.c

222

struct rb_node *n;

fs/btrfs/ref-verify.c

25

struct rb_node node;

fs/btrfs/ref-verify.c

39

struct rb_node node;

fs/btrfs/ref-verify.c

619

struct rb_node *n;

fs/btrfs/ref-verify.c

74

struct rb_node node;

fs/btrfs/ref-verify.c

78

static int block_entry_bytenr_key_cmp(const void *key, const struct rb_node *node)

fs/btrfs/ref-verify.c

891

struct rb_node *n;

fs/btrfs/ref-verify.c

91

static int block_entry_bytenr_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/ref-verify.c

910

struct rb_node *n;

fs/btrfs/ref-verify.c

916

n = fs_info->block_tree.rb_node;

fs/btrfs/relocation.c

118

struct rb_node rb_node;

fs/btrfs/relocation.c

1917

struct rb_node *rb_node;

fs/btrfs/relocation.c

1918

while ((rb_node = rb_first(blocks))) {

fs/btrfs/relocation.c

1919

block = rb_entry(rb_node, struct tree_block, rb_node);

fs/btrfs/relocation.c

1920

rb_erase(rb_node, blocks);

fs/btrfs/relocation.c

2609

rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {

fs/btrfs/relocation.c

2617

rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {

fs/btrfs/relocation.c

2626

rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) {

fs/btrfs/relocation.c

3049

struct rb_node *rb_node;

fs/btrfs/relocation.c

309

struct rb_node *rb_node;

fs/btrfs/relocation.c

3129

rb_node = rb_simple_insert(blocks, &block->simple_node);

fs/btrfs/relocation.c

3130

if (rb_node)

fs/btrfs/relocation.c

315

rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root, bytenr);

fs/btrfs/relocation.c

316

if (rb_node) {

fs/btrfs/relocation.c

317

node = rb_entry(rb_node, struct mapping_node, rb_node);

fs/btrfs/relocation.c

3835

&rc->reloc_root_tree.rb_root, rb_node)

fs/btrfs/relocation.c

384

rb_erase(&cur->rb_node, &cache->rb_root);

fs/btrfs/relocation.c

482

struct rb_node *rb_node;

fs/btrfs/relocation.c

494

rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, &node->simple_node);

fs/btrfs/relocation.c

496

if (rb_node) {

fs/btrfs/relocation.c

514

struct rb_node *rb_node;

fs/btrfs/relocation.c

521

rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,

fs/btrfs/relocation.c

523

if (rb_node) {

fs/btrfs/relocation.c

524

node = rb_entry(rb_node, struct mapping_node, rb_node);

fs/btrfs/relocation.c

525

rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);

fs/btrfs/relocation.c

526

RB_CLEAR_NODE(&node->rb_node);

fs/btrfs/relocation.c

557

struct rb_node *rb_node;

fs/btrfs/relocation.c

562

rb_node = rb_simple_search(&rc->reloc_root_tree.rb_root,

fs/btrfs/relocation.c

564

if (rb_node) {

fs/btrfs/relocation.c

565

node = rb_entry(rb_node, struct mapping_node, rb_node);

fs/btrfs/relocation.c

566

rb_erase(&node->rb_node, &rc->reloc_root_tree.rb_root);

fs/btrfs/relocation.c

576

rb_node = rb_simple_insert(&rc->reloc_root_tree.rb_root, &node->simple_node);

fs/btrfs/relocation.c

578

if (rb_node)

fs/btrfs/relocation.c

97

struct rb_node rb_node;

fs/btrfs/send.c

2969

struct rb_node node;

fs/btrfs/send.c

3067

struct rb_node **p = &sctx->orphan_dirs.rb_node;

fs/btrfs/send.c

3068

struct rb_node *parent = NULL;

fs/btrfs/send.c

3102

struct rb_node *n = sctx->orphan_dirs.rb_node;

fs/btrfs/send.c

314

struct rb_node node;

fs/btrfs/send.c

323

struct rb_node node;

fs/btrfs/send.c

3283

struct rb_node **p = &sctx->waiting_dir_moves.rb_node;

fs/btrfs/send.c

3284

struct rb_node *parent = NULL;

fs/btrfs/send.c

3316

struct rb_node *n = sctx->waiting_dir_moves.rb_node;

fs/btrfs/send.c

3348

struct rb_node **p = &sctx->pending_dir_moves.rb_node;

fs/btrfs/send.c

3349

struct rb_node *parent = NULL;

fs/btrfs/send.c

336

struct rb_node node;

fs/btrfs/send.c

3411

struct rb_node *n = sctx->pending_dir_moves.rb_node;

fs/btrfs/send.c

4098

static int rbtree_check_dir_ref_comp(const void *k, const struct rb_node *node)

fs/btrfs/send.c

4114

static bool rbtree_check_dir_ref_less(struct rb_node *node, const struct rb_node *parent)

fs/btrfs/send.c

4615

static int rbtree_ref_comp(const void *k, const struct rb_node *node)

fs/btrfs/send.c

4635

static bool rbtree_ref_less(struct rb_node *node, const struct rb_node *parent)

fs/btrfs/send.c

4688

struct rb_node *node = NULL;

fs/btrfs/send.c

4717

struct rb_node *node = NULL;

fs/btrfs/send.c

8245

struct rb_node *n;

fs/btrfs/send.c

8262

struct rb_node *n;

fs/btrfs/send.c

8273

struct rb_node *n;

fs/btrfs/tests/extent-io-tests.c

101

state = rb_entry(node, struct extent_state, rb_node);

fs/btrfs/tests/extent-io-tests.c

93

struct rb_node *node;

fs/btrfs/tests/extent-map-tests.c

18

struct rb_node *node;

fs/btrfs/tests/extent-map-tests.c

24

em = rb_entry(node, struct extent_map, rb_node);

fs/btrfs/tests/extent-map-tests.c

566

struct rb_node *n;

fs/btrfs/tests/extent-map-tests.c

572

struct extent_map *entry = rb_entry(n, struct extent_map, rb_node);

fs/btrfs/tests/free-space-tests.c

841

struct rb_node *node;

fs/btrfs/tree-mod-log.c

148

struct rb_node **new;

fs/btrfs/tree-mod-log.c

149

struct rb_node *parent = NULL;

fs/btrfs/tree-mod-log.c

157

new = &tm_root->rb_node;

fs/btrfs/tree-mod-log.c

16

struct rb_node node;

fs/btrfs/tree-mod-log.c

515

struct rb_node *node;

fs/btrfs/tree-mod-log.c

521

node = tm_root->rb_node;

fs/btrfs/tree-mod-log.c

832

struct rb_node *next;

fs/btrfs/tree-mod-log.c

89

struct rb_node *node;

fs/btrfs/tree-mod-log.c

90

struct rb_node *next;

fs/btrfs/ulist.c

132

static int ulist_node_val_key_cmp(const void *key, const struct rb_node *node)

fs/btrfs/ulist.c

135

const struct ulist_node *unode = rb_entry(node, struct ulist_node, rb_node);

fs/btrfs/ulist.c

147

struct rb_node *node;

fs/btrfs/ulist.c

150

return rb_entry_safe(node, struct ulist_node, rb_node);

fs/btrfs/ulist.c

155

rb_erase(&node->rb_node, &ulist->root);

fs/btrfs/ulist.c

162

static int ulist_node_val_cmp(struct rb_node *new, const struct rb_node *existing)

fs/btrfs/ulist.c

164

const struct ulist_node *unode = rb_entry(new, struct ulist_node, rb_node);

fs/btrfs/ulist.c

171

struct rb_node *node;

fs/btrfs/ulist.c

173

node = rb_find_add(&ins->rb_node, &ulist->root, ulist_node_val_cmp);

fs/btrfs/ulist.h

33

struct rb_node rb_node; /* used to speed up search */

fs/btrfs/volumes.c

2002

struct rb_node *n;

fs/btrfs/volumes.c

2010

map = rb_entry(n, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

3218

struct rb_node *node = fs_info->mapping_tree.rb_root.rb_node;

fs/btrfs/volumes.c

3219

struct rb_node *prev = NULL;

fs/btrfs/volumes.c

3220

struct rb_node *orig_prev;

fs/btrfs/volumes.c

3225

map = rb_entry(node, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

3245

prev_map = rb_entry(prev, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

3250

prev_map = rb_entry(prev, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

3253

prev_map = rb_entry(prev, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

5744

rb_erase_cached(&map->rb_node, &fs_info->mapping_tree);

fs/btrfs/volumes.c

5745

RB_CLEAR_NODE(&map->rb_node);

fs/btrfs/volumes.c

5753

static int btrfs_chunk_map_cmp(const struct rb_node *new,

fs/btrfs/volumes.c

5754

const struct rb_node *exist)

fs/btrfs/volumes.c

5757

rb_entry(new, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

5759

rb_entry(exist, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

5771

struct rb_node *exist;

fs/btrfs/volumes.c

5774

exist = rb_find_add_cached(&map->rb_node, &fs_info->mapping_tree,

fs/btrfs/volumes.c

5798

RB_CLEAR_NODE(&map->rb_node);

fs/btrfs/volumes.c

6132

struct rb_node *node;

fs/btrfs/volumes.c

6135

map = rb_entry(node, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

6136

rb_erase_cached(&map->rb_node, &fs_info->mapping_tree);

fs/btrfs/volumes.c

6137

RB_CLEAR_NODE(&map->rb_node);

fs/btrfs/volumes.c

8327

struct rb_node *node;

fs/btrfs/volumes.c

8334

map = rb_entry(node, struct btrfs_chunk_map, rb_node);

fs/btrfs/volumes.c

8491

struct rb_node *node;

fs/btrfs/volumes.c

8494

node = fs_info->swapfile_pins.rb_node;

fs/btrfs/volumes.h

228

struct rb_node node;

fs/btrfs/volumes.h

612

struct rb_node rb_node;

fs/btrfs/volumes.h

633

ASSERT(RB_EMPTY_NODE(&map->rb_node));

fs/ceph/addr.c

2370

struct rb_node **p, *parent;

fs/ceph/addr.c

2377

p = &mdsc->pool_perm_tree.rb_node;

fs/ceph/addr.c

2409

p = &mdsc->pool_perm_tree.rb_node;

fs/ceph/addr.c

2607

struct rb_node *n;

fs/ceph/caps.c

1089

struct rb_node *p;

fs/ceph/caps.c

1369

struct rb_node *p;

fs/ceph/caps.c

2021

struct rb_node *p;

fs/ceph/caps.c

445

struct rb_node *n = ci->i_caps.rb_node;

fs/ceph/caps.c

475

struct rb_node **p = &ci->i_caps.rb_node;

fs/ceph/caps.c

476

struct rb_node *parent = NULL;

fs/ceph/caps.c

819

struct rb_node *p;

fs/ceph/caps.c

852

struct rb_node *p;

fs/ceph/caps.c

897

struct rb_node *p;

fs/ceph/caps.c

929

struct rb_node *q;

fs/ceph/caps.c

971

struct rb_node *p;

fs/ceph/debugfs.c

57

struct rb_node *rp;

fs/ceph/inode.c

306

struct rb_node **p;

fs/ceph/inode.c

307

struct rb_node *parent = NULL;

fs/ceph/inode.c

311

p = &ci->i_fragtree.rb_node;

fs/ceph/inode.c

3197

struct rb_node *p;

fs/ceph/inode.c

345

struct rb_node *n = ci->i_fragtree.rb_node;

fs/ceph/inode.c

516

struct rb_node *rb_node;

fs/ceph/inode.c

531

rb_node = rb_first(&ci->i_fragtree);

fs/ceph/inode.c

532

frag = rb_entry(rb_node, struct ceph_inode_frag, node);

fs/ceph/inode.c

533

if (frag->frag != ceph_frag_make(0, 0) || rb_next(rb_node))

fs/ceph/inode.c

550

rb_node = rb_first(&ci->i_fragtree);

fs/ceph/inode.c

561

while (rb_node) {

fs/ceph/inode.c

562

frag = rb_entry(rb_node, struct ceph_inode_frag, node);

fs/ceph/inode.c

567

rb_node = rb_next(rb_node);

fs/ceph/inode.c

570

rb_node = rb_next(rb_node);

fs/ceph/inode.c

592

while (rb_node) {

fs/ceph/inode.c

593

frag = rb_entry(rb_node, struct ceph_inode_frag, node);

fs/ceph/inode.c

594

rb_node = rb_next(rb_node);

fs/ceph/inode.c

739

struct rb_node *n;

fs/ceph/mds_client.c

1215

struct rb_node *p = rb_next(&req->r_node);

fs/ceph/mds_client.c

1785

struct rb_node *p;

fs/ceph/mds_client.c

3684

struct rb_node *p = rb_first(&mdsc->request_tree);

fs/ceph/mds_client.c

4491

struct rb_node *p;

fs/ceph/mds_client.c

4825

struct rb_node *p;

fs/ceph/mds_client.c

5877

struct rb_node *n;

fs/ceph/mds_client.h

284

struct rb_node r_node;

fs/ceph/mds_client.h

393

struct rb_node node;

fs/ceph/mds_client.h

401

struct rb_node node;

fs/ceph/mds_client.h

414

struct rb_node node;

fs/ceph/quota.c

182

struct rb_node *node;

fs/ceph/quota.c

88

struct rb_node **node, *parent = NULL;

fs/ceph/quota.c

92

node = &(mdsc->quotarealms_inodes.rb_node);

fs/ceph/snap.c

1193

struct rb_node **p, *parent;

fs/ceph/snap.c

1198

p = &mdsc->snapid_map_tree.rb_node;

fs/ceph/snap.c

1235

p = &mdsc->snapid_map_tree.rb_node;

fs/ceph/snap.c

1321

struct rb_node *p;

fs/ceph/snap.c

154

struct rb_node *n = mdsc->snap_realms.rb_node;

fs/ceph/snap.c

89

struct rb_node **p = &root->rb_node;

fs/ceph/snap.c

90

struct rb_node *parent = NULL;

fs/ceph/super.h

204

struct rb_node ci_node; /* per-ci cap tree */

fs/ceph/super.h

297

struct rb_node node;

fs/ceph/super.h

314

struct rb_node node;

fs/ceph/super.h

952

struct rb_node node;

fs/ceph/xattr.c

574

struct rb_node **p;

fs/ceph/xattr.c

575

struct rb_node *parent = NULL;

fs/ceph/xattr.c

580

p = &ci->i_xattrs.index.rb_node;

fs/ceph/xattr.c

673

struct rb_node **p;

fs/ceph/xattr.c

674

struct rb_node *parent = NULL;

fs/ceph/xattr.c

679

p = &ci->i_xattrs.index.rb_node;

fs/ceph/xattr.c

741

struct rb_node *p;

fs/ceph/xattr.c

765

struct rb_node *p, *tmp;

fs/ceph/xattr.c

909

struct rb_node *p;

fs/eventpoll.c

1075

struct rb_node *rbp;

fs/eventpoll.c

1177

struct rb_node *rbp;

fs/eventpoll.c

1182

for (rbp = ep->rbr.rb_root.rb_node; rbp; ) {

fs/eventpoll.c

1201

struct rb_node *rbp;

fs/eventpoll.c

134

struct rb_node rbn;

fs/eventpoll.c

1388

struct rb_node **p = &ep->rbr.rb_root.rb_node, *parent = NULL;

fs/eventpoll.c

2070

struct rb_node *rbp;

fs/eventpoll.c

901

struct rb_node *rbp, *next;

fs/ext2/balloc.c

1016

struct rb_node *next;

fs/ext2/balloc.c

208

struct rb_node *n;

fs/ext2/balloc.c

299

struct rb_node *n = root->rb_node;

fs/ext2/balloc.c

339

struct rb_node *node = &rsv->rsv_node;

fs/ext2/balloc.c

342

struct rb_node ** p = &root->rb_node;

fs/ext2/balloc.c

343

struct rb_node * parent = NULL;

fs/ext2/balloc.c

762

struct rb_node *next;

fs/ext2/ext2.h

38

struct rb_node rsv_node;

fs/ext4/block_validity.c

127

struct rb_node *node;

fs/ext4/block_validity.c

24

struct rb_node node;

fs/ext4/block_validity.c

301

struct rb_node *n;

fs/ext4/block_validity.c

319

n = system_blks->root.rb_node;

fs/ext4/block_validity.c

74

struct rb_node **n = &system_blks->root.rb_node, *node;

fs/ext4/block_validity.c

75

struct rb_node *parent = NULL, *new_node;

fs/ext4/dir.c

420

struct rb_node rb_hash;

fs/ext4/dir.c

475

struct rb_node **p, *parent = NULL;

fs/ext4/dir.c

480

p = &info->root.rb_node;

fs/ext4/ext4.h

2621

struct rb_node *curr_node;

fs/ext4/extents_status.c

1099

struct rb_node *node;

fs/ext4/extents_status.c

1121

node = tree->root.rb_node;

fs/ext4/extents_status.c

1123

es1 = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

1145

node = rb_next(&es1->rb_node);

fs/ext4/extents_status.c

1148

rb_node);

fs/ext4/extents_status.c

1190

struct rb_node *node;

fs/ext4/extents_status.c

1205

node = rb_prev(&es->rb_node);

fs/ext4/extents_status.c

1208

rb_node) : NULL;

fs/ext4/extents_status.c

1312

struct rb_node *node = root->rb_node;

fs/ext4/extents_status.c

1316

pr = rb_entry(node, struct pending_reservation, rb_node);

fs/ext4/extents_status.c

1327

node = rb_next(&pr->rb_node);

fs/ext4/extents_status.c

1329

rb_node) : NULL;

fs/ext4/extents_status.c

1356

struct rb_node *node;

fs/ext4/extents_status.c

1387

node = rb_prev(&es->rb_node);

fs/ext4/extents_status.c

1390

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

1396

node = rb_next(&right_es->rb_node);

fs/ext4/extents_status.c

1398

rb_node) : NULL;

fs/ext4/extents_status.c

1407

node = rb_next(&es->rb_node);

fs/ext4/extents_status.c

1411

rb_node);

fs/ext4/extents_status.c

1450

node = rb_next(&pr->rb_node);

fs/ext4/extents_status.c

1451

rb_erase(&pr->rb_node, &tree->root);

fs/ext4/extents_status.c

1456

rb_node);

fs/ext4/extents_status.c

1487

struct rb_node *node;

fs/ext4/extents_status.c

1565

node = rb_next(&es->rb_node);

fs/ext4/extents_status.c

1567

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

1578

node = rb_next(&es->rb_node);

fs/ext4/extents_status.c

1579

rb_erase(&es->rb_node, &tree->root);

fs/ext4/extents_status.c

1585

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

1906

struct rb_node *node;

fs/ext4/extents_status.c

1919

node = rb_next(&es->rb_node);

fs/ext4/extents_status.c

1928

rb_erase(&es->rb_node, &tree->root);

fs/ext4/extents_status.c

1934

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

1976

struct rb_node *node;

fs/ext4/extents_status.c

1983

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

1986

rb_erase(&es->rb_node, &tree->root);

fs/ext4/extents_status.c

1998

struct rb_node *node;

fs/ext4/extents_status.c

2005

pr = rb_entry(node, struct pending_reservation, rb_node);

fs/ext4/extents_status.c

2046

struct rb_node *node;

fs/ext4/extents_status.c

2050

node = (&tree->root)->rb_node;

fs/ext4/extents_status.c

2053

pr = rb_entry(node, struct pending_reservation, rb_node);

fs/ext4/extents_status.c

2080

struct rb_node **p = &tree->root.rb_node;

fs/ext4/extents_status.c

2081

struct rb_node *parent = NULL;

fs/ext4/extents_status.c

2090

pr = rb_entry(parent, struct pending_reservation, rb_node);

fs/ext4/extents_status.c

2114

rb_link_node(&pr->rb_node, parent, p);

fs/ext4/extents_status.c

2115

rb_insert_color(&pr->rb_node, &tree->root);

fs/ext4/extents_status.c

2140

rb_erase(&pr->rb_node, &tree->root);

fs/ext4/extents_status.c

215

struct rb_node *node;

fs/ext4/extents_status.c

222

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

269

struct rb_node *node = root->rb_node;

fs/ext4/extents_status.c

273

es = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

286

node = rb_next(&es->rb_node);

fs/ext4/extents_status.c

287

return node ? rb_entry(node, struct extent_status, rb_node) :

fs/ext4/extents_status.c

319

struct rb_node *node;

fs/ext4/extents_status.c

340

while ((node = rb_next(&es1->rb_node)) != NULL) {

fs/ext4/extents_status.c

341

es1 = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

628

struct rb_node *node;

fs/ext4/extents_status.c

630

node = rb_prev(&es->rb_node);

fs/ext4/extents_status.c

634

es1 = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

639

rb_erase(&es->rb_node, &tree->root);

fs/ext4/extents_status.c

652

struct rb_node *node;

fs/ext4/extents_status.c

654

node = rb_next(&es->rb_node);

fs/ext4/extents_status.c

658

es1 = rb_entry(node, struct extent_status, rb_node);

fs/ext4/extents_status.c

846

struct rb_node **p = &tree->root.rb_node;

fs/ext4/extents_status.c

847

struct rb_node *parent = NULL;

fs/ext4/extents_status.c

852

es = rb_entry(parent, struct extent_status, rb_node);

fs/ext4/extents_status.c

892

rb_link_node(&es->rb_node, parent, p);

fs/ext4/extents_status.c

893

rb_insert_color(&es->rb_node, &tree->root);

fs/ext4/extents_status.h

124

struct rb_node rb_node;

fs/ext4/extents_status.h

66

struct rb_node rb_node;

fs/ext4/mballoc.c

4002

if (!db->bb_free_root.rb_node) {

fs/ext4/mballoc.c

4331

static inline struct rb_node*

fs/ext4/mballoc.c

4332

ext4_mb_pa_rb_next_iter(ext4_lblk_t new_start, ext4_lblk_t cur_start, struct rb_node *node)

fs/ext4/mballoc.c

4349

struct rb_node *iter;

fs/ext4/mballoc.c

4352

for (iter = ei->i_prealloc_node.rb_node; iter;

fs/ext4/mballoc.c

4384

struct rb_node *iter;

fs/ext4/mballoc.c

4399

for (iter = ei->i_prealloc_node.rb_node; iter;

fs/ext4/mballoc.c

4421

struct rb_node *tmp;

fs/ext4/mballoc.c

4431

struct rb_node *tmp;

fs/ext4/mballoc.c

4889

struct rb_node *iter;

fs/ext4/mballoc.c

4915

for (iter = ei->i_prealloc_node.rb_node; iter;

fs/ext4/mballoc.c

4928

struct rb_node *tmp;

fs/ext4/mballoc.c

5228

static void ext4_mb_pa_rb_insert(struct rb_root *root, struct rb_node *new)

fs/ext4/mballoc.c

5230

struct rb_node **iter = &root->rb_node, *parent = NULL;

fs/ext4/mballoc.c

5622

struct rb_node *iter;

fs/ext4/mballoc.c

6411

struct rb_node *node;

fs/ext4/mballoc.c

6427

struct rb_node *node;

fs/ext4/mballoc.c

6450

struct rb_node **n = &root->rb_node;

fs/ext4/mballoc.c

6451

struct rb_node *parent = NULL, *new_node;

fs/ext4/mballoc.h

105

struct rb_node efd_node;

fs/ext4/mballoc.h

120

struct rb_node inode_node; /* for inode PA rbtree */

fs/f2fs/extent_cache.c

185

struct rb_node *node = root->rb_root.rb_node;

fs/f2fs/extent_cache.c

195

en = rb_entry(node, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

221

struct rb_node ***insert_p,

fs/f2fs/extent_cache.c

222

struct rb_node **insert_parent,

fs/f2fs/extent_cache.c

225

struct rb_node **pnode = &root->rb_root.rb_node;

fs/f2fs/extent_cache.c

226

struct rb_node *parent = NULL, *tmp_node;

fs/f2fs/extent_cache.c

244

en = rb_entry(*pnode, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

259

en = rb_entry(parent, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

263

*next_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

268

*prev_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

274

tmp_node = rb_prev(&en->rb_node);

fs/f2fs/extent_cache.c

276

struct extent_node, rb_node);

fs/f2fs/extent_cache.c

280

tmp_node = rb_next(&en->rb_node);

fs/f2fs/extent_cache.c

282

struct extent_node, rb_node);

fs/f2fs/extent_cache.c

292

struct rb_node *parent, struct rb_node **p,

fs/f2fs/extent_cache.c

306

rb_link_node(&en->rb_node, parent, p);

fs/f2fs/extent_cache.c

307

rb_insert_color_cached(&en->rb_node, &et->root, leftmost);

fs/f2fs/extent_cache.c

318

rb_erase_cached(&en->rb_node, &et->root);

fs/f2fs/extent_cache.c

384

struct rb_node *node, *next;

fs/f2fs/extent_cache.c

392

en = rb_entry(node, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

444

&et->root.rb_root.rb_node, true);

fs/f2fs/extent_cache.c

579

struct rb_node **insert_p,

fs/f2fs/extent_cache.c

580

struct rb_node *insert_parent,

fs/f2fs/extent_cache.c

584

struct rb_node **p = &et->root.rb_root.rb_node;

fs/f2fs/extent_cache.c

585

struct rb_node *parent = NULL;

fs/f2fs/extent_cache.c

599

en = rb_entry(parent, struct extent_node, rb_node);

fs/f2fs/extent_cache.c

664

struct rb_node **insert_p = NULL, *insert_parent = NULL;

fs/f2fs/extent_cache.c

759

struct rb_node *node = rb_next(&en->rb_node);

fs/f2fs/extent_cache.c

762

rb_node);

fs/f2fs/extent_cache.c

839

struct rb_node **insert_p = NULL, *insert_parent = NULL;

fs/f2fs/f2fs.h

470

struct rb_node rb_node; /* rb node located in rb-tree */

fs/f2fs/f2fs.h

787

struct rb_node rb_node; /* rb node located in rb-tree */

fs/f2fs/gc.c

433

struct rb_node *cur = rb_first_cached(root), *next;

fs/f2fs/gc.c

441

cur_ve = rb_entry(cur, struct victim_entry, rb_node);

fs/f2fs/gc.c

442

next_ve = rb_entry(next, struct victim_entry, rb_node);

fs/f2fs/gc.c

460

struct rb_node *node = am->root.rb_root.rb_node;

fs/f2fs/gc.c

464

ve = rb_entry(node, struct victim_entry, rb_node);

fs/f2fs/gc.c

496

struct rb_node **p = &root->rb_root.rb_node;

fs/f2fs/gc.c

497

struct rb_node *parent = NULL;

fs/f2fs/gc.c

504

ve = rb_entry(parent, struct victim_entry, rb_node);

fs/f2fs/gc.c

516

rb_link_node(&ve->rb_node, parent, p);

fs/f2fs/gc.c

517

rb_insert_color_cached(&ve->rb_node, root, left_most);

fs/f2fs/gc.c

558

struct rb_node *node;

fs/f2fs/gc.c

585

ve = rb_entry_safe(node, struct victim_entry, rb_node);

fs/f2fs/gc.c

679

ve = rb_entry(stage == 0 ? rb_prev(&ve->rb_node) :

fs/f2fs/gc.c

680

rb_next(&ve->rb_node),

fs/f2fs/gc.c

681

struct victim_entry, rb_node);

fs/f2fs/gc.h

81

struct rb_node rb_node; /* rb node located in rb-tree */

fs/f2fs/segment.c

1002

struct rb_node *cur = rb_first_cached(&dcc->root), *next;

fs/f2fs/segment.c

1010

cur_dc = rb_entry(cur, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1011

next_dc = rb_entry(next, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1030

struct rb_node *node = dcc->root.rb_root.rb_node;

fs/f2fs/segment.c

1034

dc = rb_entry(node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1050

struct rb_node ***insert_p,

fs/f2fs/segment.c

1051

struct rb_node **insert_parent)

fs/f2fs/segment.c

1053

struct rb_node **pnode = &root->rb_root.rb_node;

fs/f2fs/segment.c

1054

struct rb_node *parent = NULL, *tmp_node;

fs/f2fs/segment.c

1067

dc = rb_entry(*pnode, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1080

dc = rb_entry(parent, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1084

*next_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1089

*prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1094

tmp_node = rb_prev(&dc->rb_node);

fs/f2fs/segment.c

1095

*prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1098

tmp_node = rb_next(&dc->rb_node);

fs/f2fs/segment.c

1099

*next_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1110

rb_erase_cached(&dc->rb_node, &dcc->root);

fs/f2fs/segment.c

1396

struct rb_node **p = &dcc->root.rb_root.rb_node;

fs/f2fs/segment.c

1397

struct rb_node *parent = NULL;

fs/f2fs/segment.c

1404

dc = rb_entry(parent, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1419

rb_link_node(&dc->rb_node, parent, p);

fs/f2fs/segment.c

1420

rb_insert_color_cached(&dc->rb_node, &dcc->root, leftmost);

fs/f2fs/segment.c

1473

struct rb_node **insert_p = NULL, *insert_parent = NULL;

fs/f2fs/segment.c

1491

struct rb_node *node;

fs/f2fs/segment.c

1546

node = rb_next(&prev_dc->rb_node);

fs/f2fs/segment.c

1547

next_dc = rb_entry_safe(node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

1589

struct rb_node **insert_p = NULL, *insert_parent = NULL;

fs/f2fs/segment.c

1603

struct rb_node *node;

fs/f2fs/segment.c

1620

node = rb_next(&dc->rb_node);

fs/f2fs/segment.c

1623

dc = rb_entry_safe(node, struct discard_cmd, rb_node);

fs/f2fs/segment.c

3418

struct rb_node **insert_p = NULL, *insert_parent = NULL;

fs/f2fs/segment.c

3439

struct rb_node *node;

fs/f2fs/segment.c

3465

node = rb_next(&dc->rb_node);

fs/f2fs/segment.c

3468

dc = rb_entry_safe(node, struct discard_cmd, rb_node);

fs/fuse/dev.c

2420

struct rb_node *p;

fs/fuse/dir.c

102

struct rb_node node;

fs/fuse/dir.c

131

struct rb_node **p, *parent = NULL;

fs/fuse/dir.c

142

p = &bucket->tree.rb_node;

fs/fuse/dir.c

164

struct rb_node *node;

fs/fuse/file.c

2683

static struct rb_node **fuse_find_polled_node(struct fuse_conn *fc, u64 kh,

fs/fuse/file.c

2684

struct rb_node **parent_out)

fs/fuse/file.c

2686

struct rb_node **link = &fc->polled_files.rb_node;

fs/fuse/file.c

2687

struct rb_node *last = NULL;

fs/fuse/file.c

2719

struct rb_node **link, *parent;

fs/fuse/file.c

2781

struct rb_node **link;

fs/fuse/fuse_i.h

293

struct rb_node polled_node;

fs/gfs2/incore.h

102

struct rb_node rd_node; /* Link with superblock */

fs/gfs2/incore.h

289

struct rb_node rs_node; /* node within rd_rstree */

fs/gfs2/ops_fstype.c

100

sdp->sd_rindex_tree.rb_node = NULL;

fs/gfs2/rgrp.c

1490

struct rb_node **newn, *parent = NULL;

fs/gfs2/rgrp.c

1498

newn = &rgd->rd_rstree.rb_node;

fs/gfs2/rgrp.c

1629

struct rb_node *n;

fs/gfs2/rgrp.c

1633

n = rgd->rd_rstree.rb_node;

fs/gfs2/rgrp.c

2299

const struct rb_node *n;

fs/gfs2/rgrp.c

526

struct rb_node *n, *next;

fs/gfs2/rgrp.c

530

n = sdp->sd_rindex_tree.rb_node;

fs/gfs2/rgrp.c

564

const struct rb_node *n;

fs/gfs2/rgrp.c

585

const struct rb_node *n;

fs/gfs2/rgrp.c

705

struct rb_node *n;

fs/gfs2/rgrp.c

718

struct rb_node *n;

fs/gfs2/rgrp.c

866

struct rb_node **newn = &sdp->sd_rindex_tree.rb_node, *parent = NULL;

fs/jffs2/nodelist.c

124

struct rb_node *parent = &base->rb;

fs/jffs2/nodelist.c

125

struct rb_node **link = &parent;

fs/jffs2/nodelist.c

193

rb_link_node(&holefrag->rb, NULL, &root->rb_node);

fs/jffs2/nodelist.c

207

rb_link_node(&newfrag->rb, NULL, &root->rb_node);

fs/jffs2/nodelist.c

528

struct rb_node *next;

fs/jffs2/nodelist.c

534

next = fragtree->rb_node;

fs/jffs2/nodelist.h

230

struct rb_node rb;

fs/jffs2/nodelist.h

271

struct rb_node rb;

fs/jffs2/nodelist.h

329

struct rb_node *node = rb_first(root);

fs/jffs2/nodelist.h

339

struct rb_node *node = rb_last(root);

fs/jffs2/readinode.c

177

struct rb_node *next;

fs/jffs2/readinode.c

182

next = tn_root->rb_node;

fs/jffs2/readinode.c

338

struct rb_node *parent;

fs/jffs2/readinode.c

339

struct rb_node **link = &rii->tn_root.rb_node;

fs/jffs2/readinode.c

402

static void eat_last(struct rb_root *root, struct rb_node *node)

fs/jffs2/readinode.c

404

struct rb_node *parent = rb_parent(node);

fs/jffs2/readinode.c

405

struct rb_node **link;

fs/jffs2/readinode.c

411

link = &root->rb_node;

fs/jffs2/readinode.c

426

struct rb_node **link = &ver_root->rb_node;

fs/jffs2/readinode.c

427

struct rb_node *parent = NULL;

fs/kernfs/dir.c

1345

struct rb_node *rbn;

fs/kernfs/dir.c

1376

struct rb_node *rbn;

fs/kernfs/dir.c

1847

struct rb_node *node = parent->dir.children.rb_node;

fs/kernfs/dir.c

1861

struct rb_node *node = rb_next(&pos->rb);

fs/kernfs/dir.c

1876

struct rb_node *node = rb_next(&pos->rb);

fs/kernfs/dir.c

367

struct rb_node *parent = NULL;

fs/kernfs/dir.c

369

struct rb_node **node;

fs/kernfs/dir.c

372

node = &kn_parent->dir.children.rb_node;

fs/kernfs/dir.c

861

struct rb_node *node = parent->dir.children.rb_node;

fs/mount.h

16

struct rb_node *mnt_last_node; /* last (rightmost) mount in the rbtree */

fs/mount.h

17

struct rb_node *mnt_first_node; /* first (leftmost) mount in the rbtree */

fs/mount.h

51

struct rb_node mnt_node; /* node in the ns->mounts rbtree */

fs/namespace.c

1070

static inline struct mount *node_to_mount(struct rb_node *node)

fs/namespace.c

1077

struct rb_node **link = &ns->mounts.rb_node;

fs/namespace.c

1078

struct rb_node *parent = NULL;

fs/namespace.c

1486

struct rb_node *node = ns->mounts.rb_node;

fs/namespace.c

1510

struct rb_node *node = ns->mounts.rb_node;

fs/namespace.c

1547

struct rb_node *node = rb_next(&mnt->mnt_node);

fs/namespace.c

5623

struct rb_node *node;

fs/nfs/blocklayout/blocklayout.h

130

struct rb_node be_node;

fs/nfs/blocklayout/extent_tree.c

14

ext_node(struct rb_node *node)

fs/nfs/blocklayout/extent_tree.c

140

struct rb_node **p = &root->rb_node, *parent = NULL;

fs/nfs/blocklayout/extent_tree.c

22

struct rb_node *node = rb_first(root);

fs/nfs/blocklayout/extent_tree.c

29

struct rb_node *node = rb_prev(&be->be_node);

fs/nfs/blocklayout/extent_tree.c

326

struct rb_node *node;

fs/nfs/blocklayout/extent_tree.c

329

node = root->rb_node;

fs/nfs/blocklayout/extent_tree.c

36

struct rb_node *node = rb_next(&be->be_node);

fs/nfs/blocklayout/extent_tree.c

49

struct rb_node *node = root->rb_node;

fs/nfs/dir.c

2924

rb_erase(&cache->rb_node, &nfsi->access_cache);

fs/nfs/dir.c

2980

struct rb_node *n;

fs/nfs/dir.c

2985

entry = rb_entry(n, struct nfs_access_entry, rb_node);

fs/nfs/dir.c

3050

struct rb_node *n = NFS_I(inode)->access_cache.rb_node;

fs/nfs/dir.c

3054

rb_entry(n, struct nfs_access_entry, rb_node);

fs/nfs/dir.c

3185

struct rb_node **p = &root_node->rb_node;

fs/nfs/dir.c

3186

struct rb_node *parent = NULL;

fs/nfs/dir.c

3193

entry = rb_entry(parent, struct nfs_access_entry, rb_node);

fs/nfs/dir.c

3203

rb_link_node(&set->rb_node, parent, p);

fs/nfs/dir.c

3204

rb_insert_color(&set->rb_node, root_node);

fs/nfs/dir.c

3209

rb_replace_node(parent, &set->rb_node, root_node);

fs/nfs/dir.c

3222

RB_CLEAR_NODE(&cache->rb_node);

fs/nfs/nfs4_fs.h

119

struct rb_node so_server_node;

fs/nfs/nfs4state.c

164

struct rb_node *pos;

fs/nfs/nfs4state.c

1687

struct rb_node *pos;

fs/nfs/nfs4state.c

1739

struct rb_node *pos;

fs/nfs/nfs4state.c

1845

struct rb_node *pos;

fs/nfs/nfs4state.c

357

struct rb_node **p = &server->state_owners.rb_node,

fs/nfs/nfs4state.c

385

struct rb_node **p = &server->state_owners.rb_node,

fs/nfsd/cache.h

34

struct rb_node c_node;

fs/nfsd/nfs4state.c

3325

struct rb_node **new = &(root->rb_node), *parent = NULL;

fs/nfsd/nfs4state.c

3346

struct rb_node *node = root->rb_node;

fs/nfsd/nfscache.c

412

struct rb_node **p = &b->rb_head.rb_node,

fs/nfsd/state.h

450

struct rb_node cl_namenode; /* link into by-name trees */

fs/nilfs2/the_nilfs.c

846

struct rb_node *n;

fs/nilfs2/the_nilfs.c

850

n = nilfs->ns_cptree.rb_node;

fs/nilfs2/the_nilfs.c

852

root = rb_entry(n, struct nilfs_root, rb_node);

fs/nilfs2/the_nilfs.c

872

struct rb_node **p, *parent;

fs/nilfs2/the_nilfs.c

886

p = &nilfs->ns_cptree.rb_node;

fs/nilfs2/the_nilfs.c

891

root = rb_entry(parent, struct nilfs_root, rb_node);

fs/nilfs2/the_nilfs.c

912

rb_link_node(&new->rb_node, parent, p);

fs/nilfs2/the_nilfs.c

913

rb_insert_color(&new->rb_node, &nilfs->ns_cptree);

fs/nilfs2/the_nilfs.c

931

rb_erase(&root->rb_node, &nilfs->ns_cptree);

fs/nilfs2/the_nilfs.h

231

struct rb_node rb_node;

fs/ntfs3/bitmap.c

1028

cr = wnd->start_tree.rb_node;

fs/ntfs3/bitmap.c

125

struct rb_node *node, *next;

fs/ntfs3/bitmap.c

142

static struct rb_node *rb_lookup(struct rb_root *root, size_t v)

fs/ntfs3/bitmap.c

144

struct rb_node **p = &root->rb_node;

fs/ntfs3/bitmap.c

145

struct rb_node *r = NULL;

fs/ntfs3/bitmap.c

169

struct rb_node **p = &root->rb_node;

fs/ntfs3/bitmap.c

170

struct rb_node *parent = NULL;

fs/ntfs3/bitmap.c

202

struct rb_node **p = &root->rb_node;

fs/ntfs3/bitmap.c

203

struct rb_node *parent = NULL;

fs/ntfs3/bitmap.c

236

struct rb_node *n;

fs/ntfs3/bitmap.c

26

struct rb_node node;

fs/ntfs3/bitmap.c

364

struct rb_node *n, *n3;

fs/ntfs3/bitmap.c

890

struct rb_node *n;

fs/ntfs3/bitmap.c

928

struct rb_node *n;

fs/ntfs3/bitmap.c

985

const struct rb_node *pr, *cr;

fs/ntfs3/frecord.c

103

struct rb_node *node;

fs/ntfs3/frecord.c

113

struct rb_node *next = rb_next(node);

fs/ntfs3/frecord.c

1201

struct rb_node *node;

fs/ntfs3/frecord.c

1526

struct rb_node *node;

fs/ntfs3/frecord.c

1575

struct rb_node *next = rb_next(node);

fs/ntfs3/frecord.c

21

CLST ino, struct rb_node *ins)

fs/ntfs3/frecord.c

23

struct rb_node **p = &tree->rb_node;

fs/ntfs3/frecord.c

24

struct rb_node *pr = NULL;

fs/ntfs3/frecord.c

2823

struct rb_node *node;

fs/ntfs3/frecord.c

3103

struct rb_node *node, *next;

fs/ntfs3/frecord.c

903

struct rb_node *node;

fs/ntfs3/ntfs_fs.h

336

struct rb_node node;

fs/ocfs2/cluster/nodemanager.c

274

struct rb_node **p, *parent;

fs/ocfs2/cluster/nodemanager.c

67

struct rb_node ***ret_p,

fs/ocfs2/cluster/nodemanager.c

68

struct rb_node **ret_parent)

fs/ocfs2/cluster/nodemanager.c

70

struct rb_node **p = &cluster->cl_node_ip_tree.rb_node;

fs/ocfs2/cluster/nodemanager.c

71

struct rb_node *parent = NULL;

fs/ocfs2/cluster/nodemanager.h

33

struct rb_node nd_ip_node;

fs/ocfs2/cluster/tcp.c

753

o2net_handler_tree_lookup(u32 msg_type, u32 key, struct rb_node ***ret_p,

fs/ocfs2/cluster/tcp.c

754

struct rb_node **ret_parent)

fs/ocfs2/cluster/tcp.c

756

struct rb_node **p = &o2net_handler_tree.rb_node;

fs/ocfs2/cluster/tcp.c

757

struct rb_node *parent = NULL;

fs/ocfs2/cluster/tcp.c

805

struct rb_node **p, *parent;

fs/ocfs2/cluster/tcp_internal.h

178

struct rb_node nh_node;

fs/ocfs2/refcounttree.c

198

struct rb_node *n = osb->osb_rf_lock_tree.rb_node;

fs/ocfs2/refcounttree.c

220

struct rb_node *parent = NULL;

fs/ocfs2/refcounttree.c

221

struct rb_node **p = &osb->osb_rf_lock_tree.rb_node;

fs/ocfs2/refcounttree.c

532

struct rb_node *node;

fs/ocfs2/refcounttree.h

11

struct rb_node rf_node;

fs/ocfs2/reservations.c

135

struct rb_node *node;

fs/ocfs2/reservations.c

267

struct rb_node *node;

fs/ocfs2/reservations.c

303

struct rb_node *parent = NULL;

fs/ocfs2/reservations.c

304

struct rb_node **p = &root->rb_node;

fs/ocfs2/reservations.c

356

struct rb_node *node = resmap->m_reservations.rb_node;

fs/ocfs2/reservations.c

462

struct rb_node *prev, *next;

fs/ocfs2/reservations.c

76

struct rb_node *node;

fs/ocfs2/reservations.h

20

struct rb_node r_node;

fs/ocfs2/uptodate.c

132

struct rb_node *node;

fs/ocfs2/uptodate.c

210

struct rb_node * n = ci->ci_cache.ci_tree.rb_node;

fs/ocfs2/uptodate.c

307

struct rb_node *parent = NULL;

fs/ocfs2/uptodate.c

308

struct rb_node **p = &ci->ci_cache.ci_tree.rb_node;

fs/ocfs2/uptodate.c

50

struct rb_node c_node;

fs/overlayfs/readdir.c

100

struct rb_node ***link,

fs/overlayfs/readdir.c

101

struct rb_node **parent)

fs/overlayfs/readdir.c

104

struct rb_node **newp = *link;

fs/overlayfs/readdir.c

128

struct rb_node *node = root->rb_node;

fs/overlayfs/readdir.c

223

struct rb_node **newp = &rdd->root->rb_node;

fs/overlayfs/readdir.c

224

struct rb_node *parent = NULL;

fs/overlayfs/readdir.c

26

struct rb_node node;

fs/overlayfs/readdir.c

679

struct rb_node **newp = &root->rb_node;

fs/overlayfs/readdir.c

68

static struct ovl_cache_entry *ovl_cache_entry_from_node(struct rb_node *n)

fs/overlayfs/readdir.c

680

struct rb_node *parent = NULL;

fs/proc/generic.c

72

struct rb_node *node = dir->subdir.rb_node;

fs/proc/generic.c

94

struct rb_node **new = &root->rb_node, *parent = NULL;

fs/proc/internal.h

61

struct rb_node subdir_node;

fs/proc/nommu.c

100

return rb_next((struct rb_node *) v);

fs/proc/nommu.c

74

struct rb_node *p = _p;

fs/proc/nommu.c

81

struct rb_node *p;

fs/proc/proc_sysctl.c

118

struct rb_node *node = dir->root.rb_node;

fs/proc/proc_sysctl.c

148

struct rb_node *node = &head->node[entry - head->ctl_table].node;

fs/proc/proc_sysctl.c

149

struct rb_node **p = &head->parent->root.rb_node;

fs/proc/proc_sysctl.c

150

struct rb_node *parent = NULL;

fs/proc/proc_sysctl.c

187

struct rb_node *node = &head->node[entry - head->ctl_table].node;

fs/proc/proc_sysctl.c

370

static struct ctl_node *first_usable_entry(struct rb_node *node)

fs/smb/client/cached_dir.c

540

struct rb_node *node;

fs/smb/client/cifsglob.h

1309

struct rb_node tl_rbnode;

fs/smb/client/connect.c

3972

struct rb_node *node;

fs/smb/client/connect.c

4309

struct rb_node *node = root->rb_node;

fs/smb/client/connect.c

4329

struct rb_node **new = &(root->rb_node), *parent = NULL;

fs/smb/client/connect.c

4452

struct rb_node *node;

fs/smb/client/connect.c

4453

struct rb_node *tmp;

fs/smb/client/misc.c

565

struct rb_node *node;

fs/ubifs/debug.c

1787

struct rb_node rb;

fs/ubifs/debug.c

1825

struct rb_node **p, *parent = NULL;

fs/ubifs/debug.c

1831

p = &fsckd->inodes.rb_node;

fs/ubifs/debug.c

1907

struct rb_node *p;

fs/ubifs/debug.c

1910

p = fsckd->inodes.rb_node;

fs/ubifs/debug.c

2178

struct rb_node *this = rb_first(&fsckd->inodes);

fs/ubifs/debug.c

615

struct rb_node *rb;

fs/ubifs/debug.c

683

struct rb_node *rb;

fs/ubifs/log.c

114

struct rb_node **p, *parent = NULL;

fs/ubifs/log.c

119

p = &c->buds.rb_node;

fs/ubifs/log.c

299

struct rb_node *p;

fs/ubifs/log.c

306

struct rb_node *p1 = p;

fs/ubifs/log.c

32

struct rb_node *p;

fs/ubifs/log.c

36

p = c->buds.rb_node;

fs/ubifs/log.c

549

struct rb_node rb;

fs/ubifs/log.c

563

struct rb_node **p = &done_tree->rb_node, *parent = NULL;

fs/ubifs/log.c

61

struct rb_node *p;

fs/ubifs/log.c

69

p = c->buds.rb_node;

fs/ubifs/orphan.c

100

struct rb_node *p;

fs/ubifs/orphan.c

102

p = c->orph_tree.rb_node;

fs/ubifs/orphan.c

56

struct rb_node **p, *parent = NULL;

fs/ubifs/orphan.c

70

p = &c->orph_tree.rb_node;

fs/ubifs/orphan.c

732

struct rb_node rb;

fs/ubifs/orphan.c

759

struct rb_node **p, *parent = NULL;

fs/ubifs/orphan.c

766

p = &root->rb_node;

fs/ubifs/orphan.c

787

struct rb_node *p;

fs/ubifs/orphan.c

789

p = root->rb_node;

fs/ubifs/recovery.c

1230

struct rb_node rb;

fs/ubifs/recovery.c

1249

struct rb_node **p = &c->size_tree.rb_node, *parent = NULL;

fs/ubifs/recovery.c

1283

struct rb_node *p = c->size_tree.rb_node;

fs/ubifs/recovery.c

1528

struct rb_node *this = rb_first(&c->size_tree);

fs/ubifs/tnc.c

51

struct rb_node **p, *parent = NULL;

fs/ubifs/tnc.c

53

p = &c->old_idx.rb_node;

fs/ubifs/tnc_commit.c

166

struct rb_node *p;

fs/ubifs/tnc_commit.c

168

p = c->old_idx.rb_node;

fs/ubifs/ubifs.h

275

struct rb_node rb;

fs/ubifs/ubifs.h

717

struct rb_node rb;

fs/ubifs/ubifs.h

922

struct rb_node rb;

fs/xattr.c

1240

static int rbtree_simple_xattr_cmp(const void *key, const struct rb_node *node)

fs/xattr.c

1245

xattr = rb_entry(node, struct simple_xattr, rb_node);

fs/xattr.c

1259

static int rbtree_simple_xattr_node_cmp(struct rb_node *new_node,

fs/xattr.c

1260

const struct rb_node *node)

fs/xattr.c

1263

xattr = rb_entry(new_node, struct simple_xattr, rb_node);

fs/xattr.c

1286

struct rb_node *rbp;

fs/xattr.c

1292

xattr = rb_entry(rbp, struct simple_xattr, rb_node);

fs/xattr.c

1336

struct rb_node *parent = NULL, **rbp;

fs/xattr.c

1353

rbp = &xattrs->rb_root.rb_node;

fs/xattr.c

1362

old_xattr = rb_entry(*rbp, struct simple_xattr, rb_node);

fs/xattr.c

1375

rb_replace_node(&old_xattr->rb_node,

fs/xattr.c

1376

&new_xattr->rb_node, &xattrs->rb_root);

fs/xattr.c

1378

rb_erase(&old_xattr->rb_node, &xattrs->rb_root);

fs/xattr.c

1391

rb_link_node(&new_xattr->rb_node, parent, rbp);

fs/xattr.c

1392

rb_insert_color(&new_xattr->rb_node, &xattrs->rb_root);

fs/xattr.c

1447

struct rb_node *rbp;

fs/xattr.c

1469

xattr = rb_entry(rbp, struct simple_xattr, rb_node);

fs/xattr.c

1498

static bool rbtree_simple_xattr_less(struct rb_node *new_node,

fs/xattr.c

1499

const struct rb_node *node)

fs/xattr.c

1517

rb_add(&new_xattr->rb_node, &xattrs->rb_root, rbtree_simple_xattr_less);

fs/xattr.c

1543

struct rb_node *rbp;

fs/xattr.c

1550

struct rb_node *rbp_next;

fs/xattr.c

1553

xattr = rb_entry(rbp, struct simple_xattr, rb_node);

fs/xattr.c

1554

rb_erase(&xattr->rb_node, &xattrs->rb_root);

fs/xfs/scrub/bitmap.c

22

struct rb_node bn_rbnode;

fs/xfs/scrub/bitmap.c

272

return bitmap->xb_root.rb_root.rb_node == NULL;

fs/xfs/scrub/bitmap.c

300

struct rb_node bn_rbnode;

fs/xfs/scrub/bitmap.c

547

return bitmap->xb_root.rb_root.rb_node == NULL;

fs/xfs/xfs_extent_busy.c

117

struct rb_node *rbp;

fs/xfs/xfs_extent_busy.c

123

rbp = eb->eb_tree.rb_node;

fs/xfs/xfs_extent_busy.c

125

busyp = rb_entry(rbp, struct xfs_extent_busy, rb_node);

fs/xfs/xfs_extent_busy.c

253

rb_erase(&busyp->rb_node, &eb->eb_tree);

fs/xfs/xfs_extent_busy.c

314

struct rb_node *rbp;

fs/xfs/xfs_extent_busy.c

319

rbp = eb->eb_tree.rb_node;

fs/xfs/xfs_extent_busy.c

322

rb_entry(rbp, struct xfs_extent_busy, rb_node);

fs/xfs/xfs_extent_busy.c

365

struct rb_node *rbp;

fs/xfs/xfs_extent_busy.c

373

rbp = eb->eb_tree.rb_node;

fs/xfs/xfs_extent_busy.c

376

rb_entry(rbp, struct xfs_extent_busy, rb_node);

fs/xfs/xfs_extent_busy.c

41

struct rb_node **rbp;

fs/xfs/xfs_extent_busy.c

42

struct rb_node *parent = NULL;

fs/xfs/xfs_extent_busy.c

546

rb_erase(&busyp->rb_node, &eb->eb_tree);

fs/xfs/xfs_extent_busy.c

55

rbp = &eb->eb_tree.rb_node;

fs/xfs/xfs_extent_busy.c

58

busyp = rb_entry(parent, struct xfs_extent_busy, rb_node);

fs/xfs/xfs_extent_busy.c

71

rb_link_node(&new->rb_node, parent, rbp);

fs/xfs/xfs_extent_busy.c

72

rb_insert_color(&new->rb_node, &eb->eb_tree);

fs/xfs/xfs_extent_busy.h

20

struct rb_node rb_node; /* group by-bno indexed search tree */

include/drm/drm_buddy.h

49

struct rb_node rb;

include/drm/drm_gpuvm.h

133

struct rb_node node;

include/drm/drm_mm.h

168

struct rb_node rb;

include/drm/drm_mm.h

169

struct rb_node rb_hole_size;

include/drm/drm_mm.h

170

struct rb_node rb_hole_addr;

include/drm/drm_vma_manager.h

47

struct rb_node vm_rb;

include/drm/gpu_scheduler.h

234

struct rb_node rb_tree_node;

include/linux/backing-dev-defs.h

170

struct rb_node rb_node; /* keyed by ->id */

include/linux/blk-mq.h

194

struct rb_node rb_node; /* sort/lookup */

include/linux/bpf-cgroup.h

96

struct rb_node node;

include/linux/bpf.h

271

struct rb_node rb_node;

include/linux/bpf.h

460

RB_CLEAR_NODE((struct rb_node *)addr);

include/linux/ceph/libceph.h

193

struct rb_node **n = &root->rb_node; \

include/linux/ceph/libceph.h

194

struct rb_node *parent = NULL; \

include/linux/ceph/libceph.h

236

struct rb_node *n = root->rb_node; \

include/linux/ceph/mon_client.h

54

struct rb_node node;

include/linux/ceph/osd_client.h

238

struct rb_node r_node;

include/linux/ceph/osd_client.h

239

struct rb_node r_mc_node; /* map check */

include/linux/ceph/osd_client.h

330

struct rb_node node; /* osd */

include/linux/ceph/osd_client.h

331

struct rb_node osdc_node; /* osdc */

include/linux/ceph/osd_client.h

332

struct rb_node mc_node; /* map check */

include/linux/ceph/osd_client.h

362

struct rb_node node;

include/linux/ceph/osd_client.h

394

struct rb_node spg_node;

include/linux/ceph/osd_client.h

395

struct rb_node id_node;

include/linux/ceph/osd_client.h

86

struct rb_node o_node;

include/linux/ceph/osdmap.h

152

struct rb_node node;

include/linux/ceph/osdmap.h

321

struct rb_node cl_node;

include/linux/ceph/osdmap.h

45

struct rb_node node;

include/linux/ceph/string_table.h

13

struct rb_node node;

include/linux/crush/crush.h

196

struct rb_node node;

include/linux/interval_tree.h

8

struct rb_node rb;

include/linux/interval_tree_generic.h

120

if (!root->rb_root.rb_node) \

include/linux/interval_tree_generic.h

136

node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \

include/linux/interval_tree_generic.h

150

struct rb_node *rb = node->ITRB.rb_right, *prev; \

include/linux/interval_tree_generic.h

41

struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \

include/linux/iova.h

19

struct rb_node node;

include/linux/iova.h

31

struct rb_node *cached_node; /* Save last alloced node */

include/linux/iova.h

32

struct rb_node *cached32_node; /* Save last 32-bit alloced node */

include/linux/kernfs.h

210

struct rb_node rb;

include/linux/key.h

200

struct rb_node serial_node;

include/linux/kvm_host.h

1120

struct rb_node *node;

include/linux/kvm_host.h

1138

struct rb_node *tmp;

include/linux/kvm_host.h

1148

for (tmp = slots->gfn_tree.rb_node; tmp; ) {

include/linux/kvm_host.h

1830

struct rb_node *node;

include/linux/kvm_host.h

1834

for (node = slots->gfn_tree.rb_node; node; ) {

include/linux/kvm_host.h

595

struct rb_node gfn_node[2];

include/linux/memcontrol.h

104

struct rb_node tree_node; /* RB tree node */

include/linux/mempolicy.h

118

struct rb_node nd;

include/linux/mm_types.h

1041

struct rb_node rb;

include/linux/mm_types.h

705

struct rb_node vm_rb; /* link in global region tree */

include/linux/netdevice.h

239

struct rb_node node;

include/linux/nfs_fs.h

61

struct rb_node rb_node;

include/linux/ns/nstree_types.h

32

struct rb_node ns_node;

include/linux/nstree.h

28

struct rb_node *ns_tree_node_add(struct ns_tree_node *node,

include/linux/nstree.h

30

int (*cmp)(struct rb_node *, const struct rb_node *));

include/linux/perf_event.h

783

struct rb_node group_node;

include/linux/rbtree.h

136

static inline void rb_insert_color_cached(struct rb_node *node,

include/linux/rbtree.h

146

static inline struct rb_node *

include/linux/rbtree.h

147

rb_erase_cached(struct rb_node *node, struct rb_root_cached *root)

include/linux/rbtree.h

149

struct rb_node *leftmost = NULL;

include/linux/rbtree.h

159

static inline void rb_replace_node_cached(struct rb_node *victim,

include/linux/rbtree.h

160

struct rb_node *new,

include/linux/rbtree.h

192

static __always_inline struct rb_node *

include/linux/rbtree.h

193

rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,

include/linux/rbtree.h

194

bool (*less)(struct rb_node *, const struct rb_node *))

include/linux/rbtree.h

196

struct rb_node **link = &tree->rb_root.rb_node;

include/linux/rbtree.h

197

struct rb_node *parent = NULL;

include/linux/rbtree.h

223

rb_add(struct rb_node *node, struct rb_root *tree,

include/linux/rbtree.h

224

bool (*less)(struct rb_node *, const struct rb_node *))

include/linux/rbtree.h

226

struct rb_node **link = &tree->rb_node;

include/linux/rbtree.h

227

struct rb_node *parent = NULL;

include/linux/rbtree.h

250

static __always_inline struct rb_node *

include/linux/rbtree.h

251

rb_find_add_cached(struct rb_node *node, struct rb_root_cached *tree,

include/linux/rbtree.h

252

int (*cmp)(const struct rb_node *new, const struct rb_node *exist))

include/linux/rbtree.h

255

struct rb_node **link = &tree->rb_root.rb_node;

include/linux/rbtree.h

256

struct rb_node *parent = NULL;

include/linux/rbtree.h

26

#define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))

include/linux/rbtree.h

287

static __always_inline struct rb_node *

include/linux/rbtree.h

288

rb_find_add(struct rb_node *node, struct rb_root *tree,

include/linux/rbtree.h

289

int (*cmp)(struct rb_node *, const struct rb_node *))

include/linux/rbtree.h

291

struct rb_node **link = &tree->rb_node;

include/linux/rbtree.h

292

struct rb_node *parent = NULL;

include/linux/rbtree.h

30

#define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)

include/linux/rbtree.h

323

static __always_inline struct rb_node *

include/linux/rbtree.h

324

rb_find_add_rcu(struct rb_node *node, struct rb_root *tree,

include/linux/rbtree.h

325

int (*cmp)(struct rb_node *, const struct rb_node *))

include/linux/rbtree.h

327

struct rb_node **link = &tree->rb_node;

include/linux/rbtree.h

328

struct rb_node *parent = NULL;

include/linux/rbtree.h

356

static __always_inline struct rb_node *

include/linux/rbtree.h

358

int (*cmp)(const void *key, const struct rb_node *))

include/linux/rbtree.h

360

struct rb_node *node = tree->rb_node;

include/linux/rbtree.h

387

static __always_inline struct rb_node *

include/linux/rbtree.h

389

int (*cmp)(const void *key, const struct rb_node *))

include/linux/rbtree.h

39

extern void rb_insert_color(struct rb_node *, struct rb_root *);

include/linux/rbtree.h

391

struct rb_node *node = tree->rb_node;

include/linux/rbtree.h

40

extern void rb_erase(struct rb_node *, struct rb_root *);

include/linux/rbtree.h

415

static __always_inline struct rb_node *

include/linux/rbtree.h

417

int (*cmp)(const void *key, const struct rb_node *))

include/linux/rbtree.h

419

struct rb_node *node = tree->rb_node;

include/linux/rbtree.h

420

struct rb_node *match = NULL;

include/linux/rbtree.h

44

extern struct rb_node *rb_next(const struct rb_node *);

include/linux/rbtree.h

445

static __always_inline struct rb_node *

include/linux/rbtree.h

446

rb_next_match(const void *key, struct rb_node *node,

include/linux/rbtree.h

447

int (*cmp)(const void *key, const struct rb_node *))

include/linux/rbtree.h

45

extern struct rb_node *rb_prev(const struct rb_node *);

include/linux/rbtree.h

50

static inline struct rb_node *rb_first(const struct rb_root *root)

include/linux/rbtree.h

52

struct rb_node *n;

include/linux/rbtree.h

54

n = root->rb_node;

include/linux/rbtree.h

65

static inline struct rb_node *rb_last(const struct rb_root *root)

include/linux/rbtree.h

67

struct rb_node *n;

include/linux/rbtree.h

69

n = root->rb_node;

include/linux/rbtree.h

78

extern struct rb_node *rb_first_postorder(const struct rb_root *);

include/linux/rbtree.h

79

extern struct rb_node *rb_next_postorder(const struct rb_node *);

include/linux/rbtree.h

82

extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,

include/linux/rbtree.h

84

extern void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new,

include/linux/rbtree.h

87

static inline void rb_link_node(struct rb_node *node, struct rb_node *parent,

include/linux/rbtree.h

88

struct rb_node **rb_link)

include/linux/rbtree.h

96

static inline void rb_link_node_rcu(struct rb_node *node, struct rb_node *parent,

include/linux/rbtree.h

97

struct rb_node **rb_link)

include/linux/rbtree_augmented.h

103

RBNAME ## _propagate(struct rb_node *rb, struct rb_node *stop) \

include/linux/rbtree_augmented.h

113

RBNAME ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \

include/linux/rbtree_augmented.h

120

RBNAME ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \

include/linux/rbtree_augmented.h

174

#define __rb_parent(pc) ((struct rb_node *)(pc & ~3))

include/linux/rbtree_augmented.h

183

static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)

include/linux/rbtree_augmented.h

188

static inline void rb_set_parent_color(struct rb_node *rb,

include/linux/rbtree_augmented.h

189

struct rb_node *p, int color)

include/linux/rbtree_augmented.h

195

__rb_change_child(struct rb_node *old, struct rb_node *new,

include/linux/rbtree_augmented.h

196

struct rb_node *parent, struct rb_root *root)

include/linux/rbtree_augmented.h

204

WRITE_ONCE(root->rb_node, new);

include/linux/rbtree_augmented.h

208

__rb_change_child_rcu(struct rb_node *old, struct rb_node *new,

include/linux/rbtree_augmented.h

209

struct rb_node *parent, struct rb_root *root)

include/linux/rbtree_augmented.h

217

rcu_assign_pointer(root->rb_node, new);

include/linux/rbtree_augmented.h

220

extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,

include/linux/rbtree_augmented.h

221

void (*augment_rotate)(struct rb_node *old, struct rb_node *new));

include/linux/rbtree_augmented.h

223

static __always_inline struct rb_node *

include/linux/rbtree_augmented.h

224

__rb_erase_augmented(struct rb_node *node, struct rb_root *root,

include/linux/rbtree_augmented.h

227

struct rb_node *child = node->rb_right;

include/linux/rbtree_augmented.h

228

struct rb_node *tmp = node->rb_left;

include/linux/rbtree_augmented.h

229

struct rb_node *parent, *rebalance;

include/linux/rbtree_augmented.h

257

struct rb_node *successor = child, *child2;

include/linux/rbtree_augmented.h

28

void (*propagate)(struct rb_node *node, struct rb_node *stop);

include/linux/rbtree_augmented.h

29

void (*copy)(struct rb_node *old, struct rb_node *new);

include/linux/rbtree_augmented.h

30

void (*rotate)(struct rb_node *old, struct rb_node *new);

include/linux/rbtree_augmented.h

326

rb_erase_augmented(struct rb_node *node, struct rb_root *root,

include/linux/rbtree_augmented.h

329

struct rb_node *rebalance = __rb_erase_augmented(node, root, augment);

include/linux/rbtree_augmented.h

33

extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,

include/linux/rbtree_augmented.h

335

rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root,

include/linux/rbtree_augmented.h

34

void (*augment_rotate)(struct rb_node *old, struct rb_node *new));

include/linux/rbtree_augmented.h

47

rb_insert_augmented(struct rb_node *node, struct rb_root *root,

include/linux/rbtree_augmented.h

54

rb_insert_augmented_cached(struct rb_node *node,

include/linux/rbtree_augmented.h

63

static __always_inline struct rb_node *

include/linux/rbtree_augmented.h

64

rb_add_augmented_cached(struct rb_node *node, struct rb_root_cached *tree,

include/linux/rbtree_augmented.h

65

bool (*less)(struct rb_node *, const struct rb_node *),

include/linux/rbtree_augmented.h

68

struct rb_node **link = &tree->rb_root.rb_node;

include/linux/rbtree_augmented.h

69

struct rb_node *parent = NULL;

include/linux/rbtree_latch.h

109

struct rb_node *node = rcu_dereference_raw(ltr->tree[idx].rb_node);

include/linux/rbtree_latch.h

41

struct rb_node node[2];

include/linux/rbtree_latch.h

70

__lt_from_rb(struct rb_node *node, int idx)

include/linux/rbtree_latch.h

80

struct rb_node **link = &root->rb_node;

include/linux/rbtree_latch.h

81

struct rb_node *node = &ltn->node[idx];

include/linux/rbtree_latch.h

82

struct rb_node *parent = NULL;

include/linux/rbtree_types.h

13

struct rb_node *rb_node;

include/linux/rbtree_types.h

28

struct rb_node *rb_leftmost;

include/linux/rbtree_types.h

7

struct rb_node *rb_right;

include/linux/rbtree_types.h

8

struct rb_node *rb_left;

include/linux/rmap.h

87

struct rb_node rb; /* locked by anon_vma->rwsem */

include/linux/sched.h

578

struct rb_node run_node;

include/linux/sched.h

645

struct rb_node rb_node;

include/linux/sched.h

881

struct rb_node core_node;

include/linux/sched.h

956

struct rb_node pushable_dl_tasks;

include/linux/sched/ext.h

166

struct rb_node dsq_priq; /* p->scx.dsq_vtime order */

include/linux/skbuff.h

901

struct rb_node rbnode; /* used in netem, ip4 defrag, and tcp stack */

include/linux/sunrpc/xprt.h

80

struct rb_node rq_recv; /* Receive queue */

include/linux/swap.h

192

struct rb_node rb_node;

include/linux/sysctl.h

179

struct rb_node node;

include/linux/timerqueue.h

25

struct rb_node *leftmost = rb_first_cached(&head->rb_root);

include/linux/timerqueue_types.h

9

struct rb_node node;

include/linux/vhost_iotlb.h

8

struct rb_node rb;

include/linux/vmalloc.h

75

struct rb_node rb_node; /* address sorted rbtree */

include/linux/xattr.h

114

struct rb_node rb_node;

include/net/garp.h

82

struct rb_node node;

include/net/inetpeer.h

37

struct rb_node rb_node;

include/net/mrp.h

95

struct rb_node node;

include/net/nexthop.h

143

struct rb_node rb_node; /* entry on netns rbtree */

include/rdma/rdmavt_qp.h

520

struct rb_node rb_node;

include/xen/arm/page.h

62

if (phys_to_mach.rb_node != NULL) {

ipc/mqueue.c

139

struct rb_node *msg_tree_rightmost;

ipc/mqueue.c

192

struct rb_node **p, *parent = NULL;

ipc/mqueue.c

196

p = &info->msg_tree.rb_node;

ipc/mqueue.c

199

leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node);

ipc/mqueue.c

221

info->msg_tree_rightmost = &leaf->rb_node;

ipc/mqueue.c

223

rb_link_node(&leaf->rb_node, parent, p);

ipc/mqueue.c

224

rb_insert_color(&leaf->rb_node, &info->msg_tree);

ipc/mqueue.c

235

struct rb_node *node = &leaf->rb_node;

ipc/mqueue.c

249

struct rb_node *parent = NULL;

ipc/mqueue.c

269

leaf = rb_entry(parent, struct posix_msg_tree_node, rb_node);

ipc/mqueue.c

61

struct rb_node rb_node;

kernel/bpf/helpers.c

2283

struct rb_node *pos, *n;

kernel/bpf/helpers.c

2487

struct rb_node *n = &node_internal->rb_node;

kernel/bpf/helpers.c

2508

struct rb_node **link = &((struct rb_root_cached *)root)->rb_root.rb_node;

kernel/bpf/helpers.c

2509

struct rb_node *parent = NULL, *n = &node->rb_node;

kernel/bpf/helpers.c

2559

return (struct bpf_rb_node *)r->rb_root.rb_node;

kernel/bpf/helpers.c

2569

return (struct bpf_rb_node *)node_internal->rb_node.rb_left;

kernel/bpf/helpers.c

2579

return (struct bpf_rb_node *)node_internal->rb_node.rb_right;

kernel/bpf/local_storage.c

106

struct rb_node **new = &(root->rb_node), *parent = NULL;

kernel/bpf/local_storage.c

71

struct rb_node *node;

kernel/bpf/local_storage.c

76

node = root->rb_node;

kernel/bpf/range_tree.c

37

struct rb_node rn_rbnode;

kernel/bpf/range_tree.c

38

struct rb_node rb_range_size;

kernel/bpf/range_tree.c

44

static struct range_node *rb_to_range_node(struct rb_node *rb)

kernel/bpf/range_tree.c

57

struct rb_node *rb = rt->range_size_root.rb_root.rb_node;

kernel/bpf/range_tree.c

88

struct rb_node **link = &root->rb_root.rb_node, *rb = NULL;

kernel/events/core.c

1827

static inline bool __group_less(struct rb_node *a, const struct rb_node *b)

kernel/events/core.c

1840

static inline int __group_cmp(const void *key, const struct rb_node *node)

kernel/events/core.c

1850

__group_cmp_ignore_cgroup(const void *key, const struct rb_node *node)

kernel/events/core.c

1924

struct rb_node *node;

kernel/events/core.c

1941

struct rb_node *next;

kernel/events/core.c

4541

struct rb_node *node;

kernel/events/uprobes.c

1007

RB_CLEAR_NODE(&uprobe->rb_node);

kernel/events/uprobes.c

1498

static struct rb_node *

kernel/events/uprobes.c

1501

struct rb_node *n = uprobes_tree.rb_node;

kernel/events/uprobes.c

1504

struct uprobe *u = rb_entry(n, struct uprobe, rb_node);

kernel/events/uprobes.c

1532

struct rb_node *n, *t;

kernel/events/uprobes.c

1543

u = rb_entry(t, struct uprobe, rb_node);

kernel/events/uprobes.c

1551

u = rb_entry(t, struct uprobe, rb_node);

kernel/events/uprobes.c

1643

struct rb_node *n;

kernel/events/uprobes.c

63

struct rb_node rb_node; /* node in the rb tree */

kernel/events/uprobes.c

656

return !RB_EMPTY_NODE(&uprobe->rb_node);

kernel/events/uprobes.c

681

rb_erase(&uprobe->rb_node, &uprobes_tree);

kernel/events/uprobes.c

878

rb_entry((node), struct uprobe, rb_node)

kernel/events/uprobes.c

885

static inline int __uprobe_cmp_key(const void *key, const struct rb_node *b)

kernel/events/uprobes.c

891

static inline int __uprobe_cmp(struct rb_node *a, const struct rb_node *b)

kernel/events/uprobes.c

907

struct rb_node *node;

kernel/events/uprobes.c

947

struct rb_node *node;

kernel/events/uprobes.c

949

node = rb_find_add_rcu(&uprobe->rb_node, &uprobes_tree, __uprobe_cmp);

kernel/events/uprobes.c

955

RB_CLEAR_NODE(&u->rb_node);

kernel/locking/rtmutex.c

453

static __always_inline bool __waiter_less(struct rb_node *a, const struct rb_node *b)

kernel/locking/rtmutex.c

502

static __always_inline bool __pi_waiter_less(struct rb_node *a, const struct rb_node *b)

kernel/locking/rtmutex_common.h

124

struct rb_node *leftmost = rb_first_cached(&lock->waiters);

kernel/locking/rtmutex_common.h

131

struct rb_node *leftmost = rb_first_cached(&lock->waiters);

kernel/locking/rtmutex_common.h

33

struct rb_node entry;

kernel/locking/ww_mutex.h

105

struct rb_node *n = rb_next(&w->tree.entry);

kernel/locking/ww_mutex.h

114

struct rb_node *n = rb_prev(&w->tree.entry);

kernel/locking/ww_mutex.h

123

struct rb_node *n = rb_last(&lock->rtmutex.waiters.rb_root);

kernel/locking/ww_mutex.h

96

struct rb_node *n = rb_first(&lock->rtmutex.waiters.rb_root);

kernel/nstree.c

114

struct rb_node *ns_tree_node_add(struct ns_tree_node *node,

kernel/nstree.c

116

int (*cmp)(struct rb_node *, const struct rb_node *))

kernel/nstree.c

118

struct rb_node *ret, *prev;

kernel/nstree.c

152

static inline struct ns_common *node_to_ns(const struct rb_node *node)

kernel/nstree.c

159

static inline struct ns_common *node_to_ns_unified(const struct rb_node *node)

kernel/nstree.c

166

static inline struct ns_common *node_to_ns_owner(const struct rb_node *node)

kernel/nstree.c

182

static int ns_cmp(struct rb_node *a, const struct rb_node *b)

kernel/nstree.c

187

static int ns_cmp_unified(struct rb_node *a, const struct rb_node *b)

kernel/nstree.c

192

static int ns_cmp_owner(struct rb_node *a, const struct rb_node *b)

kernel/nstree.c

199

struct rb_node *node;

kernel/nstree.c

262

static int ns_find(const void *key, const struct rb_node *node)

kernel/nstree.c

274

static int ns_find_unified(const void *key, const struct rb_node *node)

kernel/nstree.c

312

struct rb_node *node;

kernel/nstree.c

328

struct rb_node *node;

kernel/nstree.c

468

struct rb_node *node;

kernel/nstree.c

474

node = owner->ns_owner_root.ns_rb.rb_node;

kernel/nstree.c

629

struct rb_node *node;

kernel/nstree.c

640

node = ns_tree->ns_rb.rb_node;

kernel/nstree.c

642

node = ns_unified_root.ns_rb.rb_node;

kernel/power/swap.c

121

struct rb_node node;

kernel/power/swap.c

130

struct rb_node **new = &(swsusp_extents.rb_node);

kernel/power/swap.c

131

struct rb_node *parent = NULL;

kernel/power/swap.c

190

struct rb_node *node;

kernel/power/swap.c

196

while ((node = swsusp_extents.rb_node)) {

kernel/power/swap.c

211

return (swsusp_extents.rb_node != NULL);

kernel/power/wakelock.c

153

struct rb_node **node = &wakelocks_tree.rb_node;

kernel/power/wakelock.c

154

struct rb_node *parent = *node;

kernel/power/wakelock.c

29

struct rb_node node;

kernel/power/wakelock.c

40

struct rb_node *node;

kernel/sched/core.c

283

static inline bool rb_sched_core_less(struct rb_node *a, const struct rb_node *b)

kernel/sched/core.c

288

static inline int rb_sched_core_cmp(const void *key, const struct rb_node *node)

kernel/sched/core.c

347

struct rb_node *node = &p->core_node;

kernel/sched/core.c

371

struct rb_node *node;

kernel/sched/deadline.c

2026

rb_entry((node), struct sched_dl_entity, rb_node)

kernel/sched/deadline.c

2055

struct rb_node *leftmost = rb_first_cached(&dl_rq->root);

kernel/sched/deadline.c

2088

static inline bool __dl_less(struct rb_node *a, const struct rb_node *b)

kernel/sched/deadline.c

2167

WARN_ON_ONCE(!RB_EMPTY_NODE(&dl_se->rb_node));

kernel/sched/deadline.c

2169

rb_add_cached(&dl_se->rb_node, &dl_rq->root, __dl_less);

kernel/sched/deadline.c

2178

if (RB_EMPTY_NODE(&dl_se->rb_node))

kernel/sched/deadline.c

2181

rb_erase_cached(&dl_se->rb_node, &dl_rq->root);

kernel/sched/deadline.c

2183

RB_CLEAR_NODE(&dl_se->rb_node);

kernel/sched/deadline.c

2590

struct rb_node *left = rb_first_cached(&dl_rq->root);

kernel/sched/deadline.c

2694

struct rb_node *next_node;

kernel/sched/deadline.c

3711

RB_CLEAR_NODE(&dl_se->rb_node);

kernel/sched/deadline.c

501

return rb_first_cached(&dl_rq->root) == &dl_se->rb_node;

kernel/sched/deadline.c

564

static inline bool __pushable_less(struct rb_node *a, const struct rb_node *b)

kernel/sched/deadline.c

580

struct rb_node *leftmost;

kernel/sched/deadline.c

600

struct rb_node *leftmost;

kernel/sched/deadline.c

93

return !RB_EMPTY_NODE(&dl_se->rb_node);

kernel/sched/ext.c

1053

struct rb_node *rbp;

kernel/sched/ext.c

966

static bool scx_dsq_priq_less(struct rb_node *node_a,

kernel/sched/ext.c

967

const struct rb_node *node_b)

kernel/sched/fair.c

1012

struct rb_node *node = cfs_rq->tasks_timeline.rb_root.rb_node;

kernel/sched/fair.c

1048

struct rb_node *left = node->rb_left;

kernel/sched/fair.c

1088

struct rb_node *last = rb_last(&cfs_rq->tasks_timeline.rb_root);

kernel/sched/fair.c

848

static inline bool __entity_less(struct rb_node *a, const struct rb_node *b)

kernel/sched/fair.c

853

static inline void __min_vruntime_update(struct sched_entity *se, struct rb_node *node)

kernel/sched/fair.c

863

static inline void __min_slice_update(struct sched_entity *se, struct rb_node *node)

kernel/sched/fair.c

872

static inline void __max_slice_update(struct sched_entity *se, struct rb_node *node)

kernel/sched/fair.c

889

struct rb_node *node = &se->run_node;

kernel/sched/fair.c

932

struct rb_node *root = cfs_rq->tasks_timeline.rb_root.rb_node;

kernel/sched/fair.c

942

struct rb_node *left = rb_first_cached(&cfs_rq->tasks_timeline);

kernel/trace/trace_stat.c

171

struct rb_node *node;

kernel/trace/trace_stat.c

195

struct rb_node *node = p;

kernel/trace/trace_stat.c

27

struct rb_node node;

kernel/trace/trace_stat.c

77

struct rb_node **new = &(root->rb_node), *parent = NULL;

lib/rbtree.c

227

____rb_erase_color(struct rb_node *parent, struct rb_root *root,

lib/rbtree.c

228

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

lib/rbtree.c

230

struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;

lib/rbtree.c

410

void __rb_erase_color(struct rb_node *parent, struct rb_root *root,

lib/rbtree.c

411

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

lib/rbtree.c

424

static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}

lib/rbtree.c

425

static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {}

lib/rbtree.c

426

static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {}

lib/rbtree.c

434

void rb_insert_color(struct rb_node *node, struct rb_root *root)

lib/rbtree.c

440

void rb_erase(struct rb_node *node, struct rb_root *root)

lib/rbtree.c

442

struct rb_node *rebalance;

lib/rbtree.c

456

void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,

lib/rbtree.c

457

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

lib/rbtree.c

463

struct rb_node *rb_next(const struct rb_node *node)

lib/rbtree.c

465

struct rb_node *parent;

lib/rbtree.c

478

return (struct rb_node *)node;

lib/rbtree.c

495

struct rb_node *rb_prev(const struct rb_node *node)

lib/rbtree.c

497

struct rb_node *parent;

lib/rbtree.c

510

return (struct rb_node *)node;

lib/rbtree.c

524

void rb_replace_node(struct rb_node *victim, struct rb_node *new,

lib/rbtree.c

527

struct rb_node *parent = rb_parent(victim);

lib/rbtree.c

541

void rb_replace_node_rcu(struct rb_node *victim, struct rb_node *new,

lib/rbtree.c

544

struct rb_node *parent = rb_parent(victim);

lib/rbtree.c

563

static struct rb_node *rb_left_deepest_node(const struct rb_node *node)

lib/rbtree.c

571

return (struct rb_node *)node;

lib/rbtree.c

575

struct rb_node *rb_next_postorder(const struct rb_node *node)

lib/rbtree.c

577

const struct rb_node *parent;

lib/rbtree.c

59

static inline void rb_set_black(struct rb_node *rb)

lib/rbtree.c

590

return (struct rb_node *)parent;

lib/rbtree.c

594

struct rb_node *rb_first_postorder(const struct rb_root *root)

lib/rbtree.c

596

if (!root->rb_node)

lib/rbtree.c

599

return rb_left_deepest_node(root->rb_node);

lib/rbtree.c

64

static inline struct rb_node *rb_red_parent(struct rb_node *red)

lib/rbtree.c

66

return (struct rb_node *)red->__rb_parent_color;

lib/rbtree.c

75

__rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,

lib/rbtree.c

78

struct rb_node *parent = rb_parent(old);

lib/rbtree.c

85

__rb_insert(struct rb_node *node, struct rb_root *root,

lib/rbtree.c

86

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

lib/rbtree.c

88

struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;

lib/rbtree_test.c

113

struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;

lib/rbtree_test.c

159

static bool is_red(struct rb_node *rb)

lib/rbtree_test.c

164

static int black_path_count(struct rb_node *rb)

lib/rbtree_test.c

184

struct rb_node *rb;

lib/rbtree_test.c

194

struct rb_node *rb;

lib/rbtree_test.c

21

struct rb_node rb;

lib/rbtree_test.c

221

struct rb_node *rb;

lib/rbtree_test.c

247

struct rb_node *node;

lib/rbtree_test.c

35

struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;

lib/rbtree_test.c

52

struct rb_node **new = &root->rb_root.rb_node, *parent = NULL;

lib/rbtree_test.c

89

struct rb_node **new = &root->rb_root.rb_node, *rb_parent = NULL;

lib/timerqueue.c

20

static inline bool __timerqueue_less(struct rb_node *a, const struct rb_node *b)

lib/timerqueue.c

75

struct rb_node *next;

mm/backing-dev.c

1041

static struct rb_node **bdi_lookup_rb_node(u64 id, struct rb_node **parentp)

mm/backing-dev.c

1043

struct rb_node **p = &bdi_tree.rb_node;

mm/backing-dev.c

1044

struct rb_node *parent = NULL;

mm/backing-dev.c

1051

bdi = rb_entry(parent, struct backing_dev_info, rb_node);

mm/backing-dev.c

1076

struct rb_node **p;

mm/backing-dev.c

1081

bdi = rb_entry(*p, struct backing_dev_info, rb_node);

mm/backing-dev.c

1092

struct rb_node *parent, **p;

mm/backing-dev.c

1113

rb_link_node(&bdi->rb_node, parent, p);

mm/backing-dev.c

1114

rb_insert_color(&bdi->rb_node, &bdi_tree);

mm/backing-dev.c

1149

rb_erase(&bdi->rb_node, &bdi_tree);

mm/interval_tree.c

32

struct rb_node **link;

mm/kmemleak.c

140

struct rb_node rb_node;

mm/kmemleak.c

423

struct rb_node *rb = object_tree(objflags)->rb_node;

mm/kmemleak.c

430

object = rb_entry(rb, struct kmemleak_object, rb_node);

mm/kmemleak.c

434

rb = object->rb_node.rb_left;

mm/kmemleak.c

436

rb = object->rb_node.rb_right;

mm/kmemleak.c

605

rb_erase(&object->rb_node, object_tree(object->flags));

mm/kmemleak.c

711

struct rb_node **link, *rb_parent;

mm/kmemleak.c

734

link = &object_tree(objflags)->rb_node;

mm/kmemleak.c

738

parent = rb_entry(rb_parent, struct kmemleak_object, rb_node);

mm/kmemleak.c

741

link = &parent->rb_node.rb_left;

mm/kmemleak.c

743

link = &parent->rb_node.rb_right;

mm/kmemleak.c

761

rb_link_node(&object->rb_node, rb_parent, link);

mm/kmemleak.c

762

rb_insert_color(&object->rb_node, object_tree(objflags));

mm/ksm.c

1173

while (root_stable_tree[nid].rb_node) {

mm/ksm.c

1174

stable_node = rb_entry(root_stable_tree[nid].rb_node,

mm/ksm.c

161

struct rb_node node; /* when node of stable tree */

mm/ksm.c

1829

struct rb_node **new;

mm/ksm.c

1830

struct rb_node *parent;

mm/ksm.c

1846

new = &root->rb_node;

mm/ksm.c

2044

struct rb_node **new;

mm/ksm.c

2045

struct rb_node *parent;

mm/ksm.c

2054

new = &root->rb_node;

mm/ksm.c

2138

struct rb_node **new;

mm/ksm.c

2140

struct rb_node *parent = NULL;

mm/ksm.c

2145

new = &root->rb_node;

mm/ksm.c

215

struct rb_node node; /* when node of unstable tree */

mm/ksm.c

3348

struct rb_node *node;

mm/memcontrol-v1.c

113

struct rb_node **p = &mctz->rb_root.rb_node;

mm/memcontrol-v1.c

114

struct rb_node *parent = NULL;

mm/memcontrol-v1.c

26

struct rb_node *rb_rightmost;

mm/mempolicy.c

2893

struct rb_node *n = sp->root.rb_node;

mm/mempolicy.c

2909

struct rb_node *prev = rb_prev(n);

mm/mempolicy.c

2926

struct rb_node **p = &sp->root.rb_node;

mm/mempolicy.c

2927

struct rb_node *parent = NULL;

mm/mempolicy.c

2951

if (!sp->root.rb_node)

mm/mempolicy.c

3147

struct rb_node *next = rb_next(&n->nd);

mm/mempolicy.c

3273

struct rb_node *next;

mm/mempolicy.c

3275

if (!sp->root.rb_node)

mm/nommu.c

1024

struct rb_node *rb;

mm/nommu.c

441

struct rb_node *p, *lastp;

mm/nommu.c

474

struct rb_node **p, *parent;

mm/nommu.c

479

p = &nommu_region_tree.rb_node;

mm/nommu.c

504

BUG_ON(!nommu_region_tree.rb_node);

mm/nommu.c

533

BUG_ON(!nommu_region_tree.rb_node);

mm/shmem_quota.c

117

struct rb_node *node;

mm/shmem_quota.c

127

node = ((struct rb_root *)info->dqi_priv)->rb_node;

mm/shmem_quota.c

167

struct rb_node **n;

mm/shmem_quota.c

169

struct rb_node *parent = NULL, *new_node = NULL;

mm/shmem_quota.c

178

n = &((struct rb_root *)info->dqi_priv)->rb_node;

mm/shmem_quota.c

268

struct rb_node *node;

mm/shmem_quota.c

279

node = ((struct rb_root *)info->dqi_priv)->rb_node;

mm/shmem_quota.c

47

struct rb_node node;

mm/shmem_quota.c

98

struct rb_node *node;

mm/swapfile.c

2527

struct rb_node *rb = sis->swap_extent_root.rb_node;

mm/swapfile.c

2528

struct swap_extent *se = rb_entry(rb, struct swap_extent, rb_node);

mm/swapfile.c

2554

struct rb_node **link = &sis->swap_extent_root.rb_node, *parent = NULL;

mm/swapfile.c

2568

se = rb_entry(parent, struct swap_extent, rb_node);

mm/swapfile.c

2585

rb_link_node(&new_se->rb_node, parent, link);

mm/swapfile.c

2586

rb_insert_color(&new_se->rb_node, &sis->swap_extent_root);

mm/swapfile.c

268

struct rb_node *rb = rb_first(&sis->swap_extent_root);

mm/swapfile.c

269

return rb_entry(rb, struct swap_extent, rb_node);

mm/swapfile.c

274

struct rb_node *rb = rb_next(&se->rb_node);

mm/swapfile.c

275

return rb ? rb_entry(rb, struct swap_extent, rb_node) : NULL;

mm/swapfile.c

319

struct rb_node *rb;

mm/swapfile.c

321

rb = sis->swap_extent_root.rb_node;

mm/swapfile.c

323

se = rb_entry(rb, struct swap_extent, rb_node);

mm/vma.c

2120

if (!test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) {

mm/vma.c

2136

&anon_vma->root->rb_root.rb_root.rb_node))

mm/vma.c

2255

if (test_bit(0, (unsigned long *) &anon_vma->root->rb_root.rb_root.rb_node)) {

mm/vma.c

2269

&anon_vma->root->rb_root.rb_root.rb_node))

mm/vmalloc.c

1055

get_subtree_max_size(struct rb_node *node)

mm/vmalloc.c

1059

va = rb_entry_safe(node, struct vmap_area, rb_node);

mm/vmalloc.c

1064

struct vmap_area, rb_node, unsigned long, subtree_max_size, va_size)

mm/vmalloc.c

1081

struct rb_node *n = root->rb_node;

mm/vmalloc.c

1088

va = rb_entry(n, struct vmap_area, rb_node);

mm/vmalloc.c

1105

struct rb_node *n = root->rb_node;

mm/vmalloc.c

1112

tmp = rb_entry(n, struct vmap_area, rb_node);

mm/vmalloc.c

1181

static __always_inline struct rb_node **

mm/vmalloc.c

1183

struct rb_root *root, struct rb_node *from,

mm/vmalloc.c

1184

struct rb_node **parent)

mm/vmalloc.c

1187

struct rb_node **link;

mm/vmalloc.c

1190

link = &root->rb_node;

mm/vmalloc.c

1205

tmp_va = rb_entry(*link, struct vmap_area, rb_node);

mm/vmalloc.c

1224

*parent = &tmp_va->rb_node;

mm/vmalloc.c

1229

get_va_next_sibling(struct rb_node *parent, struct rb_node **link)

mm/vmalloc.c

1242

list = &rb_entry(parent, struct vmap_area, rb_node)->list;

mm/vmalloc.c

1248

struct rb_node *parent, struct rb_node **link,

mm/vmalloc.c

1256

head = &rb_entry(parent, struct vmap_area, rb_node)->list;

mm/vmalloc.c

1262

rb_link_node(&va->rb_node, parent, link);

mm/vmalloc.c

1275

rb_insert_augmented(&va->rb_node,

mm/vmalloc.c

1279

rb_insert_color(&va->rb_node, root);

mm/vmalloc.c

1288

struct rb_node *parent, struct rb_node **link,

mm/vmalloc.c

1296

struct rb_node *parent, struct rb_node **link,

mm/vmalloc.c

1305

if (WARN_ON(RB_EMPTY_NODE(&va->rb_node)))

mm/vmalloc.c

1309

rb_erase_augmented(&va->rb_node,

mm/vmalloc.c

1312

rb_erase(&va->rb_node, root);

mm/vmalloc.c

1315

RB_CLEAR_NODE(&va->rb_node);

mm/vmalloc.c

1338

get_subtree_max_size(va->rb_node.rb_left),

mm/vmalloc.c

1339

get_subtree_max_size(va->rb_node.rb_right));

mm/vmalloc.c

1392

free_vmap_area_rb_augment_cb_propagate(&va->rb_node, NULL);

mm/vmalloc.c

1403

struct rb_node **link;

mm/vmalloc.c

1404

struct rb_node *parent;

mm/vmalloc.c

1413

struct rb_node *from, struct rb_root *root,

mm/vmalloc.c

1416

struct rb_node **link;

mm/vmalloc.c

1417

struct rb_node *parent;

mm/vmalloc.c

1447

struct rb_node **link;

mm/vmalloc.c

1448

struct rb_node *parent;

mm/vmalloc.c

1574

struct rb_node *node;

mm/vmalloc.c

1578

node = root->rb_node;

mm/vmalloc.c

1584

va = rb_entry(node, struct vmap_area, rb_node);

mm/vmalloc.c

1610

va = rb_entry(node, struct vmap_area, rb_node);

mm/vmalloc.c

1800

insert_vmap_area_augment(lva, &va->rb_node, root, head);

mm/vmalloc.c

2073

kmemleak_scan_area(&va->rb_node, SIZE_MAX, gfp_mask);

mm/vmalloc.c

2367

WRITE_ONCE(vn->lazy.root.rb_node, NULL);

mm/vmalloc.c

4792

static struct vmap_area *node_to_va(struct rb_node *n)

mm/vmalloc.c

4794

return rb_entry_safe(n, struct vmap_area, rb_node);

mm/vmalloc.c

4810

struct rb_node *n;

mm/vmalloc.c

4812

n = free_vmap_area_root.rb_node;

mm/vmalloc.c

4816

tmp = rb_entry(n, struct vmap_area, rb_node);

mm/vmalloc.c

4973

va = node_to_va(rb_prev(&va->rb_node));

net/802/garp.c

151

struct rb_node *parent = app->gid.rb_node;

net/802/garp.c

171

struct rb_node *parent = NULL, **p = &app->gid.rb_node;

net/802/garp.c

209

struct rb_node *node, *next;

net/802/garp.c

396

struct rb_node *node, *next;

net/802/mrp.c

240

struct rb_node *parent = app->mad.rb_node;

net/802/mrp.c

260

struct rb_node *parent = NULL, **p = &app->mad.rb_node;

net/802/mrp.c

298

struct rb_node *node, *next;

net/802/mrp.c

581

struct rb_node *node, *next;

net/bridge/br_multicast_eht.c

107

struct rb_node *node = pg->eht_set_tree.rb_node;

net/bridge/br_multicast_eht.c

114

rb_node);

net/bridge/br_multicast_eht.c

133

rb_erase(&eht_host->rb_node, &eht_host->pg->eht_host_tree);

net/bridge/br_multicast_eht.c

134

RB_CLEAR_NODE(&eht_host->rb_node);

net/bridge/br_multicast_eht.c

143

WARN_ON(!RB_EMPTY_NODE(&set_h->rb_node));

net/bridge/br_multicast_eht.c

154

WARN_ON(!RB_EMPTY_NODE(&eht_set->rb_node));

net/bridge/br_multicast_eht.c

166

rb_erase(&set_h->rb_node, &set_h->eht_set->entry_tree);

net/bridge/br_multicast_eht.c

167

RB_CLEAR_NODE(&set_h->rb_node);

net/bridge/br_multicast_eht.c

182

struct rb_node *node;

net/bridge/br_multicast_eht.c

186

rb_node);

net/bridge/br_multicast_eht.c

190

rb_erase(&eht_set->rb_node, &eht_set->pg->eht_set_tree);

net/bridge/br_multicast_eht.c

191

RB_CLEAR_NODE(&eht_set->rb_node);

net/bridge/br_multicast_eht.c

199

struct rb_node *node;

net/bridge/br_multicast_eht.c

203

rb_node);

net/bridge/br_multicast_eht.c

216

if (RB_EMPTY_NODE(&set_h->rb_node) || timer_pending(&set_h->timer))

net/bridge/br_multicast_eht.c

234

if (RB_EMPTY_NODE(&eht_set->rb_node) || timer_pending(&eht_set->timer))

net/bridge/br_multicast_eht.c

247

struct rb_node **link = &pg->eht_host_tree.rb_node, *parent = NULL;

net/bridge/br_multicast_eht.c

255

rb_node);

net/bridge/br_multicast_eht.c

278

rb_link_node(&eht_host->rb_node, parent, link);

net/bridge/br_multicast_eht.c

279

rb_insert_color(&eht_host->rb_node, &pg->eht_host_tree);

net/bridge/br_multicast_eht.c

292

struct rb_node **link = &eht_set->entry_tree.rb_node, *parent = NULL;

net/bridge/br_multicast_eht.c

300

rb_node);

net/bridge/br_multicast_eht.c

329

rb_link_node(&set_h->rb_node, parent, link);

net/bridge/br_multicast_eht.c

330

rb_insert_color(&set_h->rb_node, &eht_set->entry_tree);

net/bridge/br_multicast_eht.c

344

struct rb_node **link = &pg->eht_set_tree.rb_node, *parent = NULL;

net/bridge/br_multicast_eht.c

352

rb_node);

net/bridge/br_multicast_eht.c

374

rb_link_node(&eht_set->rb_node, parent, link);

net/bridge/br_multicast_eht.c

375

rb_insert_color(&eht_set->rb_node, &pg->eht_set_tree);

net/bridge/br_multicast_eht.c

47

struct rb_node *node = pg->eht_host_tree.rb_node;

net/bridge/br_multicast_eht.c

54

rb_node);

net/bridge/br_multicast_eht.c

83

struct rb_node *node = eht_set->entry_tree.rb_node;

net/bridge/br_multicast_eht.c

90

rb_node);

net/bridge/br_private_mcast_eht.h

18

struct rb_node rb_node;

net/bridge/br_private_mcast_eht.h

29

struct rb_node rb_node;

net/bridge/br_private_mcast_eht.h

42

struct rb_node rb_node;

net/ceph/auth_x.c

155

struct rb_node *parent = NULL, **p = &xi->ticket_handlers.rb_node;

net/ceph/auth_x.c

984

struct rb_node *p;

net/ceph/auth_x.h

16

struct rb_node node;

net/ceph/ceph_common.c

608

struct rb_node *n;

net/ceph/debugfs.c

149

struct rb_node *rp;

net/ceph/debugfs.c

242

struct rb_node *n;

net/ceph/debugfs.c

268

struct rb_node *n;

net/ceph/debugfs.c

329

struct rb_node *n;

net/ceph/debugfs.c

352

struct rb_node *n;

net/ceph/debugfs.c

64

struct rb_node *n;

net/ceph/mon_client.c

1068

struct rb_node *p;

net/ceph/osd_client.c

1177

struct rb_node *n, *p;

net/ceph/osd_client.c

1341

struct rb_node *n;

net/ceph/osd_client.c

1394

struct rb_node *n;

net/ceph/osd_client.c

1493

struct rb_node *n;

net/ceph/osd_client.c

1943

struct rb_node *n = root->rb_node;

net/ceph/osd_client.c

3437

struct rb_node *n, *p;

net/ceph/osd_client.c

3883

struct rb_node *n;

net/ceph/osd_client.c

3935

struct rb_node *n;

net/ceph/osd_client.c

4012

struct rb_node *n;

net/ceph/osd_client.c

4083

struct rb_node *n;

net/ceph/osd_client.c

4249

struct rb_node *n;

net/ceph/osd_client.c

4462

struct rb_node *n;

net/ceph/osd_client.c

4723

struct rb_node *n, *p;

net/ceph/osd_client.c

5183

struct rb_node *n;

net/ceph/osdmap.c

158

struct rb_node cn_node;

net/ceph/osdmap.c

2970

struct rb_node *n1 = rb_first(locs1);

net/ceph/osdmap.c

2971

struct rb_node *n2 = rb_first(locs2);

net/ceph/osdmap.c

763

struct rb_node *rbp;

net/ceph/string_table.c

14

struct rb_node **p, *parent;

net/ceph/string_table.c

19

p = &string_tree.rb_node;

net/ceph/string_table.c

52

p = &string_tree.rb_node;

net/core/dev_addr_lists.c

170

struct rb_node *node;

net/core/dev_addr_lists.c

172

node = list->tree.rb_node;

net/core/dev_addr_lists.c

24

struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL;

net/core/dev_addr_lists.c

78

struct rb_node **ins_point = &list->tree.rb_node, *parent = NULL;

net/core/skbuff.c

4034

struct rb_node *p = rb_first(root);

net/ipv4/inet_fragment.c

304

struct rb_node *p = rb_first(root);

net/ipv4/inet_fragment.c

461

struct rb_node **rbn, *parent;

net/ipv4/inet_fragment.c

463

rbn = &q->rb_fragments.rb_node;

net/ipv4/inet_fragment.c

609

struct rb_node *rbn;

net/ipv4/inet_fragment.c

657

struct rb_node *rbnext = rb_next(rbn);

net/ipv4/inet_fragment.c

77

rb_link_node(&skb->rbnode, NULL, &q->rb_fragments.rb_node);

net/ipv4/inetpeer.c

100

pp = &base->rb_root.rb_node;

net/ipv4/inetpeer.c

109

p = rb_entry(parent, struct inet_peer, rb_node);

net/ipv4/inetpeer.c

163

rb_erase(&p->rb_node, &base->rb_root);

net/ipv4/inetpeer.c

175

struct rb_node **pp, *parent;

net/ipv4/inetpeer.c

210

rb_link_node(&p->rb_node, parent, pp);

net/ipv4/inetpeer.c

211

rb_insert_color(&p->rb_node, &base->rb_root);

net/ipv4/inetpeer.c

276

struct rb_node *p = rb_first(&base->rb_root);

net/ipv4/inetpeer.c

279

struct inet_peer *peer = rb_entry(p, struct inet_peer, rb_node);

net/ipv4/inetpeer.c

282

rb_erase(&peer->rb_node, &base->rb_root);

net/ipv4/inetpeer.c

93

struct rb_node **parent_p,

net/ipv4/inetpeer.c

94

struct rb_node ***pp_p)

net/ipv4/inetpeer.c

96

struct rb_node **pp, *parent, *next;

net/ipv4/nexthop.c

2202

rb_erase(&nh->rb_node, &net->nexthop.rb_root);

net/ipv4/nexthop.c

2603

struct rb_node **pp, *parent = NULL, *next;

net/ipv4/nexthop.c

2611

pp = &root->rb_node;

net/ipv4/nexthop.c

2621

nh = rb_entry(parent, struct nexthop, rb_node);

net/ipv4/nexthop.c

2670

rb_link_node_rcu(&new_nh->rb_node, parent, pp);

net/ipv4/nexthop.c

2671

rb_insert_color(&new_nh->rb_node, root);

net/ipv4/nexthop.c

2678

rb_erase(&new_nh->rb_node, &net->nexthop.rb_root);

net/ipv4/nexthop.c

2718

struct rb_node *node;

net/ipv4/nexthop.c

2722

nh = rb_entry(node, struct nexthop, rb_node);

net/ipv4/nexthop.c

3542

struct rb_node *node;

net/ipv4/nexthop.c

3557

struct rb_node *tmp = root->rb_node;

net/ipv4/nexthop.c

3563

nh = rb_entry(tmp, struct nexthop, rb_node);

net/ipv4/nexthop.c

3582

nh = rb_entry(node, struct nexthop, rb_node);

net/ipv4/nexthop.c

3971

struct rb_node *node;

net/ipv4/nexthop.c

3977

nh = rb_entry(node, struct nexthop, rb_node);

net/ipv4/nexthop.c

591

struct rb_node **pp, *parent = NULL, *next;

net/ipv4/nexthop.c

593

pp = &net->nexthop.rb_root.rb_node;

net/ipv4/nexthop.c

602

nh = rb_entry(parent, struct nexthop, rb_node);

net/ipv4/tcp.c

3369

struct rb_node *p = rb_first(&sk->tcp_rtx_queue);

net/ipv4/tcp_input.c

2167

struct rb_node *parent, **p = &sk->tcp_rtx_queue.rb_node;

net/ipv4/tcp_input.c

4270

prefetch(sk->tcp_rtx_queue.rb_node);

net/ipv4/tcp_input.c

5332

struct rb_node *p;

net/ipv4/tcp_input.c

5404

struct rb_node **p, *parent;

net/ipv4/tcp_input.c

5429

p = &tp->out_of_order_queue.rb_node;

net/ipv4/tcp_input.c

5961

struct rb_node *node, *prev;

net/ipv4/tcp_output.c

2814

const struct rb_node *node = sk->tcp_rtx_queue.rb_node;

net/ipv4/tcp_output.c

72

struct rb_node **p = &root->rb_node;

net/ipv4/tcp_output.c

73

struct rb_node *parent = NULL;

net/mptcp/protocol.c

246

struct rb_node **p, *parent;

net/mptcp/protocol.c

266

p = &msk->out_of_order_queue.rb_node;

net/mptcp/protocol.c

778

struct rb_node *p;

net/netfilter/nf_conncount.c

407

struct rb_node **rbnode, *parent;

net/netfilter/nf_conncount.c

416

rbnode = &(root->rb_node);

net/netfilter/nf_conncount.c

495

struct rb_node *parent;

net/netfilter/nf_conncount.c

502

parent = rcu_dereference_raw(root->rb_node);

net/netfilter/nf_conncount.c

51

struct rb_node node;

net/netfilter/nf_conncount.c

555

struct rb_node *node;

net/netfilter/nf_conncount.c

662

struct rb_node *node;

net/netfilter/nft_set_rbtree.c

1003

while ((node = priv->root.rb_node) != NULL) {

net/netfilter/nft_set_rbtree.c

1047

struct rb_node *node;

net/netfilter/nft_set_rbtree.c

1163

struct rb_node *node;

net/netfilter/nft_set_rbtree.c

212

struct rb_node *prev = rb_prev(&rbe->node);

net/netfilter/nft_set_rbtree.c

242

struct rb_node *first)

net/netfilter/nft_set_rbtree.c

259

struct rb_node *node;

net/netfilter/nft_set_rbtree.c

269

__nft_rbtree_next_active(struct rb_node *node, u8 genmask)

net/netfilter/nft_set_rbtree.c

343

struct rb_node *node, *next, *parent, **p, *first = NULL;

net/netfilter/nft_set_rbtree.c

354

p = &priv->root.rb_node;

net/netfilter/nft_set_rbtree.c

45

struct rb_node node;

net/netfilter/nft_set_rbtree.c

520

p = &priv->root.rb_node;

net/netfilter/nft_set_rbtree.c

738

struct rb_node *node;

net/netfilter/nft_set_rbtree.c

791

const struct rb_node *parent = priv->root.rb_node;

net/netfilter/nft_set_rbtree.c

848

struct rb_node *node;

net/netfilter/nft_set_rbtree.c

900

struct rb_node *node, *next;

net/netfilter/nft_set_rbtree.c

996

struct rb_node *node;

net/rds/cong.c

107

struct rb_node **p = &rds_cong_tree.rb_node;

net/rds/cong.c

108

struct rb_node *parent = NULL;

net/rds/cong.c

401

struct rb_node *node;

net/rds/rdma.c

130

struct rb_node *node;

net/rds/rdma.c

68

struct rb_node **p = &root->rb_node;

net/rds/rdma.c

69

struct rb_node *parent = NULL;

net/rds/rds.h

314

struct rb_node r_rb_node;

net/rds/rds.h

64

struct rb_node m_rb_node;

net/rxrpc/af_rxrpc.c

896

skb = rb_entry(rx->pending_oobq.rb_node, struct sk_buff, rbnode);

net/rxrpc/ar-internal.h

512

struct rb_node local_node; /* Node in local->client_conns */

net/rxrpc/ar-internal.h

556

struct rb_node service_node; /* Node in peer->service_conns */

net/rxrpc/ar-internal.h

724

struct rb_node sock_node; /* Node in rx->calls */

net/rxrpc/call_accept.c

110

pp = &rx->calls.rb_node;

net/rxrpc/call_accept.c

42

struct rb_node *parent, **pp;

net/rxrpc/call_object.c

331

struct rb_node *parent, **pp;

net/rxrpc/call_object.c

363

pp = &rx->calls.rb_node;

net/rxrpc/call_object.c

89

struct rb_node *p;

net/rxrpc/call_object.c

95

p = rx->calls.rb_node;

net/rxrpc/conn_client.c

254

struct rb_node *p, **pp, *parent;

net/rxrpc/conn_client.c

270

p = local->client_bundles.rb_node;

net/rxrpc/conn_client.c

297

pp = &local->client_bundles.rb_node;

net/rxrpc/conn_service.c

27

struct rb_node *p;

net/rxrpc/conn_service.c

41

p = rcu_dereference_raw(peer->service_conns.rb_node);

net/rxrpc/conn_service.c

69

struct rb_node **pp, *parent;

net/rxrpc/conn_service.c

73

pp = &peer->service_conns.rb_node;

net/rxrpc/oob.c

71

struct rb_node *p;

net/rxrpc/oob.c

74

p = rx->pending_oobq.rb_node;

net/rxrpc/oob.c

97

struct rb_node **pp = &rx->pending_oobq.rb_node, *p = NULL;

net/sched/sch_etf.c

111

struct rb_node *p;

net/sched/sch_etf.c

166

struct rb_node **p = &q->head.rb_root.rb_node, *parent = NULL;

net/sched/sch_etf.c

420

struct rb_node *p = rb_first_cached(&q->head);

net/sched/sch_fq.c

222

struct rb_node **p = &q->delayed.rb_node, *parent = NULL;

net/sched/sch_fq.c

261

struct rb_node **p, *parent;

net/sched/sch_fq.c

264

p = &root->rb_node;

net/sched/sch_fq.c

356

struct rb_node **p, *parent;

net/sched/sch_fq.c

405

p = &root->rb_node;

net/sched/sch_fq.c

506

struct rb_node **p, *parent;

net/sched/sch_fq.c

521

p = &flow->t_root.rb_node;

net/sched/sch_fq.c

612

struct rb_node *p;

net/sched/sch_fq.c

78

struct rb_node fq_node; /* anchor in fq_root[] trees */

net/sched/sch_fq.c

786

struct rb_node *p = rb_first(&flow->t_root);

net/sched/sch_fq.c

804

struct rb_node *p;

net/sched/sch_fq.c

842

struct rb_node *op, **np, *parent;

net/sched/sch_fq.c

860

np = &nroot->rb_node;

net/sched/sch_fq.c

93

struct rb_node rate_node; /* anchor in q->delayed tree */

net/sched/sch_hfsc.c

127

struct rb_node el_node; /* qdisc's eligible tree member */

net/sched/sch_hfsc.c

129

struct rb_node vt_node; /* parent's vt_tree member */

net/sched/sch_hfsc.c

131

struct rb_node cf_node; /* parent's cf_heap member */

net/sched/sch_hfsc.c

192

struct rb_node **p = &cl->sched->eligible.rb_node;

net/sched/sch_hfsc.c

193

struct rb_node *parent = NULL;

net/sched/sch_hfsc.c

229

struct rb_node *n;

net/sched/sch_hfsc.c

245

struct rb_node *n;

net/sched/sch_hfsc.c

260

struct rb_node **p = &cl->cl_parent->vt_tree.rb_node;

net/sched/sch_hfsc.c

261

struct rb_node *parent = NULL;

net/sched/sch_hfsc.c

293

struct rb_node *n;

net/sched/sch_hfsc.c

329

struct rb_node **p = &cl->cl_parent->cf_tree.rb_node;

net/sched/sch_hfsc.c

330

struct rb_node *parent = NULL;

net/sched/sch_hfsc.c

660

struct rb_node *n = rb_first(&cl->cf_tree);

net/sched/sch_hfsc.c

675

struct rb_node *n;

net/sched/sch_htb.c

137

struct rb_node pq_node; /* node for event queue */

net/sched/sch_htb.c

138

struct rb_node node[TC_HTB_NUMPRIO]; /* node for self or feed tree */

net/sched/sch_htb.c

290

struct rb_node **p = &root->rb_node, *parent = NULL;

net/sched/sch_htb.c

319

struct rb_node **p = &q->hlevel[cl->level].wait_pq.rb_node, *parent = NULL;

net/sched/sch_htb.c

349

static inline void htb_next_rb_node(struct rb_node **n)

net/sched/sch_htb.c

376

static void htb_safe_rb_erase(struct rb_node *rb, struct rb_root *root)

net/sched/sch_htb.c

411

if (!hprio->row.rb_node)

net/sched/sch_htb.c

440

if (p->inner.clprio[prio].feed.rb_node)

net/sched/sch_htb.c

490

if (!p->inner.clprio[prio].feed.rb_node)

net/sched/sch_htb.c

760

struct rb_node *p = rb_first(wait_pq);

net/sched/sch_htb.c

788

static struct rb_node *htb_id_find_next_upper(int prio, struct rb_node *n,

net/sched/sch_htb.c

791

struct rb_node *r = NULL;

net/sched/sch_htb.c

81

struct rb_node *ptr;

net/sched/sch_htb.c

819

struct rb_node *root;

net/sched/sch_htb.c

820

struct rb_node **pptr;

net/sched/sch_htb.c

824

if (unlikely(!hprio->row.rb_node))

net/sched/sch_htb.c

827

sp->root = hprio->row.rb_node;

net/sched/sch_htb.c

862

(++sp)->root = clp->feed.rb_node;

net/sched/sch_netem.c

375

struct rb_node *p = rb_first(&q->t_root);

net/sched/sch_netem.c

403

struct rb_node **p = &q->t_root.rb_node, *parent = NULL;

net/sched/sch_netem.c

570

if (q->t_root.rb_node) {

net/smc/smc.h

196

struct rb_node alert_node;

net/smc/smc_core.c

103

struct rb_node **link, *parent = NULL;

net/smc/smc_core.c

106

link = &conn->lgr->conns_all.rb_node;

net/smc/smc_core.c

1103

struct rb_node *node;

net/smc/smc_core.c

1563

struct rb_node *node;

net/smc/smc_core.h

465

struct rb_node *node;

net/smc/smc_core.h

467

node = lgr->conns_all.rb_node;

net/sunrpc/xprt.c

1008

struct rb_node *n = xprt->recv_queue.rb_node;

net/sunrpc/xprt.c

1030

struct rb_node **p = &xprt->recv_queue.rb_node;

net/sunrpc/xprt.c

1031

struct rb_node *n = NULL;

net/tipc/group.c

235

struct rb_node *n = grp->members.rb_node;

net/tipc/group.c

267

struct rb_node *n;

net/tipc/group.c

281

struct rb_node **n, *parent = NULL;

net/tipc/group.c

284

n = &grp->members.rb_node;

net/tipc/group.c

399

struct rb_node *n;

net/tipc/group.c

64

struct rb_node tree_node;

net/tipc/name_table.c

1035

struct rb_node *n;

net/tipc/name_table.c

111

for (sr = service_range_match_first((sc)->ranges.rb_node, \

net/tipc/name_table.c

128

static struct service_range *service_range_match_first(struct rb_node *n,

net/tipc/name_table.c

132

struct rb_node *l, *r;

net/tipc/name_table.c

178

static struct service_range *service_range_match_next(struct rb_node *n,

net/tipc/name_table.c

182

struct rb_node *p, *r;

net/tipc/name_table.c

299

struct rb_node **n, *parent = NULL;

net/tipc/name_table.c

304

n = &sc->ranges.rb_node;

net/tipc/name_table.c

649

sr = service_range_match_first(sc->ranges.rb_node, inst, inst);

net/tipc/name_table.c

65

struct rb_node tree_node;

net/tipc/name_table.c

738

struct rb_node *n;

net/wireless/core.h

189

struct rb_node rbn;

net/wireless/scan.c

1654

struct rb_node **p = &rdev->bss_tree.rb_node;

net/wireless/scan.c

1655

struct rb_node *parent = NULL;

net/wireless/scan.c

1686

struct rb_node *n = rdev->bss_tree.rb_node;

net/xfrm/xfrm_policy.c

1020

struct rb_node *rnode;

net/xfrm/xfrm_policy.c

1048

struct rb_node **p, *parent = NULL;

net/xfrm/xfrm_policy.c

1051

p = &root->rb_node;

net/xfrm/xfrm_policy.c

1100

p = &root->rb_node;

net/xfrm/xfrm_policy.c

1121

struct rb_node *rn = rb_first(r);

net/xfrm/xfrm_policy.c

1995

const struct rb_node *parent;

net/xfrm/xfrm_policy.c

2001

parent = rcu_dereference_raw(r->rb_node);

net/xfrm/xfrm_policy.c

66

struct rb_node node;

net/xfrm/xfrm_policy.c

961

struct rb_node **p, *parent;

net/xfrm/xfrm_policy.c

967

p = &new->rb_node;

rust/helpers/rbtree.c

12

__rust_helper struct rb_node *rust_helper_rb_first(const struct rb_root *root)

rust/helpers/rbtree.c

17

__rust_helper struct rb_node *rust_helper_rb_last(const struct rb_root *root)

rust/helpers/rbtree.c

5

__rust_helper void rust_helper_rb_link_node(struct rb_node *node,

rust/helpers/rbtree.c

6

struct rb_node *parent,

rust/helpers/rbtree.c

7

struct rb_node **rb_link)

security/apparmor/include/label.h

129

struct rb_node node;

security/apparmor/label.c

1139

struct rb_node *node;

security/apparmor/label.c

1148

node = ls->root.rb_node;

security/apparmor/label.c

1956

struct rb_node *node;

security/apparmor/label.c

1988

struct rb_node *node;

security/apparmor/label.c

679

struct rb_node **new, *parent = NULL;

security/apparmor/label.c

688

new = &ls->root.rb_node;

security/apparmor/label.c

736

struct rb_node *node;

security/apparmor/label.c

742

node = vec_labelset(vec, n)->root.rb_node;

security/keys/gc.c

189

struct rb_node *cursor;

security/keys/internal.h

55

struct rb_node node;

security/keys/key.c

1289

&key_user_tree.rb_node);

security/keys/key.c

135

struct rb_node *parent, **p;

security/keys/key.c

150

p = &key_serial_tree.rb_node;

security/keys/key.c

53

struct rb_node *parent, **p;

security/keys/key.c

57

p = &key_user_tree.rb_node;

security/keys/key.c

675

struct rb_node *n;

security/keys/key.c

681

n = key_serial_tree.rb_node;

security/keys/proc.c

129

static inline key_serial_t key_node_serial(struct rb_node *n)

security/keys/proc.c

137

struct rb_node *n;

security/keys/proc.c

155

struct rb_node *_p = v;

security/keys/proc.c

252

static struct rb_node *__key_user_next(struct user_namespace *user_ns, struct rb_node *n)

security/keys/proc.c

263

static struct rb_node *key_user_next(struct user_namespace *user_ns, struct rb_node *n)

security/keys/proc.c

268

static struct rb_node *key_user_first(struct user_namespace *user_ns, struct rb_root *r)

security/keys/proc.c

270

struct rb_node *n = rb_first(r);

security/keys/proc.c

277

struct rb_node *_p;

security/keys/proc.c

294

return key_user_next(seq_user_ns(p), (struct rb_node *)v);

security/keys/proc.c

305

struct rb_node *_p = v;

security/keys/proc.c

64

static struct rb_node *key_serial_next(struct seq_file *p, struct rb_node *n)

security/keys/proc.c

81

struct rb_node *n = key_serial_tree.rb_node;

security/landlock/ruleset.c

210

struct rb_node **walker_node;

security/landlock/ruleset.c

211

struct rb_node *parent_node = NULL;

security/landlock/ruleset.c

227

walker_node = &root->rb_node;

security/landlock/ruleset.c

593

const struct rb_node *node;

security/landlock/ruleset.c

598

node = root->rb_node;

security/landlock/ruleset.h

93

struct rb_node node;

tools/bpf/resolve_btfids/main.c

111

struct rb_node rb_node;

tools/bpf/resolve_btfids/main.c

211

struct rb_node *p = root->rb_node;

tools/bpf/resolve_btfids/main.c

216

id = rb_entry(p, struct btf_id, rb_node);

tools/bpf/resolve_btfids/main.c

233

struct rb_node **p = &root->rb_node;

tools/bpf/resolve_btfids/main.c

234

struct rb_node *parent = NULL;

tools/bpf/resolve_btfids/main.c

240

id = rb_entry(parent, struct btf_id, rb_node);

tools/bpf/resolve_btfids/main.c

259

rb_link_node(&id->rb_node, parent, p);

tools/bpf/resolve_btfids/main.c

260

rb_insert_color(&id->rb_node, root);

tools/bpf/resolve_btfids/main.c

358

struct rb_node *next;

tools/bpf/resolve_btfids/main.c

363

id = rb_entry(next, struct btf_id, rb_node);

tools/bpf/resolve_btfids/main.c

364

next = rb_next(&id->rb_node);

tools/bpf/resolve_btfids/main.c

365

rb_erase(&id->rb_node, root);

tools/bpf/resolve_btfids/main.c

721

struct rb_node *next;

tools/bpf/resolve_btfids/main.c

726

id = rb_entry(next, struct btf_id, rb_node);

tools/bpf/resolve_btfids/main.c

746

struct rb_node *next;

tools/bpf/resolve_btfids/main.c

756

id = rb_entry(next, struct btf_id, rb_node);

tools/bpf/resolve_btfids/main.c

959

struct rb_node *next;

tools/bpf/resolve_btfids/main.c

964

set_id = rb_entry(next, struct btf_id, rb_node);

tools/include/linux/interval_tree_generic.h

120

if (!root->rb_root.rb_node) \

tools/include/linux/interval_tree_generic.h

136

node = rb_entry(root->rb_root.rb_node, ITSTRUCT, ITRB); \

tools/include/linux/interval_tree_generic.h

150

struct rb_node *rb = node->ITRB.rb_right, *prev; \

tools/include/linux/interval_tree_generic.h

41

struct rb_node **link = &root->rb_root.rb_node, *rb_parent = NULL; \

tools/include/linux/rbtree.h

103

static inline void rb_erase_init(struct rb_node *n, struct rb_root *root)

tools/include/linux/rbtree.h

121

struct rb_node *rb_leftmost;

tools/include/linux/rbtree.h

129

static inline void rb_insert_color_cached(struct rb_node *node,

tools/include/linux/rbtree.h

138

static inline void rb_erase_cached(struct rb_node *node,

tools/include/linux/rbtree.h

146

static inline void rb_replace_node_cached(struct rb_node *victim,

tools/include/linux/rbtree.h

147

struct rb_node *new,

tools/include/linux/rbtree.h

178

rb_add_cached(struct rb_node *node, struct rb_root_cached *tree,

tools/include/linux/rbtree.h

179

bool (*less)(struct rb_node *, const struct rb_node *))

tools/include/linux/rbtree.h

181

struct rb_node **link = &tree->rb_root.rb_node;

tools/include/linux/rbtree.h

182

struct rb_node *parent = NULL;

tools/include/linux/rbtree.h

206

rb_add(struct rb_node *node, struct rb_root *tree,

tools/include/linux/rbtree.h

207

bool (*less)(struct rb_node *, const struct rb_node *))

tools/include/linux/rbtree.h

209

struct rb_node **link = &tree->rb_node;

tools/include/linux/rbtree.h

210

struct rb_node *parent = NULL;

tools/include/linux/rbtree.h

233

static __always_inline struct rb_node *

tools/include/linux/rbtree.h

234

rb_find_add(struct rb_node *node, struct rb_root *tree,

tools/include/linux/rbtree.h

235

int (*cmp)(struct rb_node *, const struct rb_node *))

tools/include/linux/rbtree.h

237

struct rb_node **link = &tree->rb_node;

tools/include/linux/rbtree.h

238

struct rb_node *parent = NULL;

tools/include/linux/rbtree.h

25

struct rb_node *rb_right;

tools/include/linux/rbtree.h

26

struct rb_node *rb_left;

tools/include/linux/rbtree.h

266

static __always_inline struct rb_node *

tools/include/linux/rbtree.h

268

int (*cmp)(const void *key, const struct rb_node *))

tools/include/linux/rbtree.h

270

struct rb_node *node = tree->rb_node;

tools/include/linux/rbtree.h

294

static __always_inline struct rb_node *

tools/include/linux/rbtree.h

296

int (*cmp)(const void *key, const struct rb_node *))

tools/include/linux/rbtree.h

298

struct rb_node *node = tree->rb_node;

tools/include/linux/rbtree.h

299

struct rb_node *match = NULL;

tools/include/linux/rbtree.h

31

struct rb_node *rb_node;

tools/include/linux/rbtree.h

324

static __always_inline struct rb_node *

tools/include/linux/rbtree.h

325

rb_next_match(const void *key, struct rb_node *node,

tools/include/linux/rbtree.h

326

int (*cmp)(const void *key, const struct rb_node *))

tools/include/linux/rbtree.h

34

#define rb_parent(r) ((struct rb_node *)((r)->__rb_parent_color & ~3))

tools/include/linux/rbtree.h

39

#define RB_EMPTY_ROOT(root) (READ_ONCE((root)->rb_node) == NULL)

tools/include/linux/rbtree.h

48

extern void rb_insert_color(struct rb_node *, struct rb_root *);

tools/include/linux/rbtree.h

49

extern void rb_erase(struct rb_node *, struct rb_root *);

tools/include/linux/rbtree.h

53

extern struct rb_node *rb_next(const struct rb_node *);

tools/include/linux/rbtree.h

54

extern struct rb_node *rb_prev(const struct rb_node *);

tools/include/linux/rbtree.h

55

extern struct rb_node *rb_first(const struct rb_root *);

tools/include/linux/rbtree.h

56

extern struct rb_node *rb_last(const struct rb_root *);

tools/include/linux/rbtree.h

59

extern struct rb_node *rb_first_postorder(const struct rb_root *);

tools/include/linux/rbtree.h

60

extern struct rb_node *rb_next_postorder(const struct rb_node *);

tools/include/linux/rbtree.h

63

extern void rb_replace_node(struct rb_node *victim, struct rb_node *new,

tools/include/linux/rbtree.h

66

static inline void rb_link_node(struct rb_node *node, struct rb_node *parent,

tools/include/linux/rbtree.h

67

struct rb_node **rb_link)

tools/include/linux/rbtree_augmented.h

150

#define __rb_parent(pc) ((struct rb_node *)(pc & ~3))

tools/include/linux/rbtree_augmented.h

159

static inline void rb_set_parent(struct rb_node *rb, struct rb_node *p)

tools/include/linux/rbtree_augmented.h

164

static inline void rb_set_parent_color(struct rb_node *rb,

tools/include/linux/rbtree_augmented.h

165

struct rb_node *p, int color)

tools/include/linux/rbtree_augmented.h

171

__rb_change_child(struct rb_node *old, struct rb_node *new,

tools/include/linux/rbtree_augmented.h

172

struct rb_node *parent, struct rb_root *root)

tools/include/linux/rbtree_augmented.h

180

WRITE_ONCE(root->rb_node, new);

tools/include/linux/rbtree_augmented.h

183

extern void __rb_erase_color(struct rb_node *parent, struct rb_root *root,

tools/include/linux/rbtree_augmented.h

184

void (*augment_rotate)(struct rb_node *old, struct rb_node *new));

tools/include/linux/rbtree_augmented.h

186

static __always_inline struct rb_node *

tools/include/linux/rbtree_augmented.h

187

__rb_erase_augmented(struct rb_node *node, struct rb_root *root,

tools/include/linux/rbtree_augmented.h

190

struct rb_node *child = node->rb_right;

tools/include/linux/rbtree_augmented.h

191

struct rb_node *tmp = node->rb_left;

tools/include/linux/rbtree_augmented.h

192

struct rb_node *parent, *rebalance;

tools/include/linux/rbtree_augmented.h

220

struct rb_node *successor = child, *child2;

tools/include/linux/rbtree_augmented.h

291

rb_erase_augmented(struct rb_node *node, struct rb_root *root,

tools/include/linux/rbtree_augmented.h

294

struct rb_node *rebalance = __rb_erase_augmented(node, root, augment);

tools/include/linux/rbtree_augmented.h

30

void (*propagate)(struct rb_node *node, struct rb_node *stop);

tools/include/linux/rbtree_augmented.h

300

rb_erase_augmented_cached(struct rb_node *node, struct rb_root_cached *root,

tools/include/linux/rbtree_augmented.h

31

void (*copy)(struct rb_node *old, struct rb_node *new);

tools/include/linux/rbtree_augmented.h

32

void (*rotate)(struct rb_node *old, struct rb_node *new);

tools/include/linux/rbtree_augmented.h

35

extern void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,

tools/include/linux/rbtree_augmented.h

36

void (*augment_rotate)(struct rb_node *old, struct rb_node *new));

tools/include/linux/rbtree_augmented.h

49

rb_insert_augmented(struct rb_node *node, struct rb_root *root,

tools/include/linux/rbtree_augmented.h

56

rb_insert_augmented_cached(struct rb_node *node,

tools/include/linux/rbtree_augmented.h

79

RBNAME ## _propagate(struct rb_node *rb, struct rb_node *stop) \

tools/include/linux/rbtree_augmented.h

89

RBNAME ## _copy(struct rb_node *rb_old, struct rb_node *rb_new) \

tools/include/linux/rbtree_augmented.h

96

RBNAME ## _rotate(struct rb_node *rb_old, struct rb_node *rb_new) \

tools/lib/rbtree.c

227

____rb_erase_color(struct rb_node *parent, struct rb_root *root,

tools/lib/rbtree.c

228

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

tools/lib/rbtree.c

230

struct rb_node *node = NULL, *sibling, *tmp1, *tmp2;

tools/lib/rbtree.c

410

void __rb_erase_color(struct rb_node *parent, struct rb_root *root,

tools/lib/rbtree.c

411

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

tools/lib/rbtree.c

423

static inline void dummy_propagate(struct rb_node *node, struct rb_node *stop) {}

tools/lib/rbtree.c

424

static inline void dummy_copy(struct rb_node *old, struct rb_node *new) {}

tools/lib/rbtree.c

425

static inline void dummy_rotate(struct rb_node *old, struct rb_node *new) {}

tools/lib/rbtree.c

433

void rb_insert_color(struct rb_node *node, struct rb_root *root)

tools/lib/rbtree.c

438

void rb_erase(struct rb_node *node, struct rb_root *root)

tools/lib/rbtree.c

440

struct rb_node *rebalance;

tools/lib/rbtree.c

453

void __rb_insert_augmented(struct rb_node *node, struct rb_root *root,

tools/lib/rbtree.c

454

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

tools/lib/rbtree.c

462

struct rb_node *rb_first(const struct rb_root *root)

tools/lib/rbtree.c

464

struct rb_node *n;

tools/lib/rbtree.c

466

n = root->rb_node;

tools/lib/rbtree.c

474

struct rb_node *rb_last(const struct rb_root *root)

tools/lib/rbtree.c

476

struct rb_node *n;

tools/lib/rbtree.c

478

n = root->rb_node;

tools/lib/rbtree.c

486

struct rb_node *rb_next(const struct rb_node *node)

tools/lib/rbtree.c

488

struct rb_node *parent;

tools/lib/rbtree.c

501

return (struct rb_node *)node;

tools/lib/rbtree.c

517

struct rb_node *rb_prev(const struct rb_node *node)

tools/lib/rbtree.c

519

struct rb_node *parent;

tools/lib/rbtree.c

532

return (struct rb_node *)node;

tools/lib/rbtree.c

545

void rb_replace_node(struct rb_node *victim, struct rb_node *new,

tools/lib/rbtree.c

548

struct rb_node *parent = rb_parent(victim);

tools/lib/rbtree.c

561

static struct rb_node *rb_left_deepest_node(const struct rb_node *node)

tools/lib/rbtree.c

569

return (struct rb_node *)node;

tools/lib/rbtree.c

573

struct rb_node *rb_next_postorder(const struct rb_node *node)

tools/lib/rbtree.c

575

const struct rb_node *parent;

tools/lib/rbtree.c

588

return (struct rb_node *)parent;

tools/lib/rbtree.c

59

static inline void rb_set_black(struct rb_node *rb)

tools/lib/rbtree.c

591

struct rb_node *rb_first_postorder(const struct rb_root *root)

tools/lib/rbtree.c

593

if (!root->rb_node)

tools/lib/rbtree.c

596

return rb_left_deepest_node(root->rb_node);

tools/lib/rbtree.c

64

static inline struct rb_node *rb_red_parent(struct rb_node *red)

tools/lib/rbtree.c

66

return (struct rb_node *)red->__rb_parent_color;

tools/lib/rbtree.c

75

__rb_rotate_set_parents(struct rb_node *old, struct rb_node *new,

tools/lib/rbtree.c

78

struct rb_node *parent = rb_parent(old);

tools/lib/rbtree.c

85

__rb_insert(struct rb_node *node, struct rb_root *root,

tools/lib/rbtree.c

86

void (*augment_rotate)(struct rb_node *old, struct rb_node *new))

tools/lib/rbtree.c

88

struct rb_node *parent = rb_red_parent(node), *gparent, *tmp;

tools/objtool/elf.c

117

static int symbol_hole_by_offset(const void *key, const struct rb_node *node)

tools/objtool/elf.c

233

struct rb_node *n;

tools/objtool/elf.c

477

struct rb_node *pnode;

tools/objtool/include/objtool/elf.h

63

struct rb_node node;

tools/perf/arch/powerpc/util/sym-handling.c

124

struct rb_node *tmp;

tools/perf/builtin-annotate.c

259

rb_erase_cached(&al->sym->rb_node, dso__symbols(dso));

tools/perf/builtin-annotate.c

413

struct rb_node *nd = rb_first_cached(&hists->entries), *next;

tools/perf/builtin-annotate.c

422

struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/builtin-c2c.c

2385

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/builtin-c2c.c

2391

he = rb_entry(next, struct hist_entry, rb_node);

tools/perf/builtin-c2c.c

2395

next = rb_next(&he->rb_node);

tools/perf/builtin-c2c.c

2501

struct rb_node *nd;

tools/perf/builtin-c2c.c

2531

struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/builtin-c2c.c

2633

struct rb_node *nd = rb_first_cached(&hb->hists->entries);

tools/perf/builtin-c2c.c

2636

struct hist_entry *he = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/builtin-diff.c

529

struct rb_node *next;

tools/perf/builtin-diff.c

587

struct rb_node *next = rb_first_cached(root);

tools/perf/builtin-diff.c

654

struct rb_node *next = rb_first_cached(root);

tools/perf/builtin-diff.c

673

struct rb_node *next;

tools/perf/builtin-kmem.c

1003

struct rb_node *next;

tools/perf/builtin-kmem.c

1064

struct rb_node *next = rb_first(&page_alloc_sorted);

tools/perf/builtin-kmem.c

1113

struct rb_node *next = rb_first(&page_caller_sorted);

tools/perf/builtin-kmem.c

1266

struct rb_node **new = &(root->rb_node);

tools/perf/builtin-kmem.c

1267

struct rb_node *parent = NULL;

tools/perf/builtin-kmem.c

1296

struct rb_node *node;

tools/perf/builtin-kmem.c

1313

struct rb_node **new = &root->rb_node;

tools/perf/builtin-kmem.c

1314

struct rb_node *parent = NULL;

tools/perf/builtin-kmem.c

1343

struct rb_node *node;

tools/perf/builtin-kmem.c

135

struct rb_node **node = &root_caller_stat.rb_node;

tools/perf/builtin-kmem.c

136

struct rb_node *parent = NULL;

tools/perf/builtin-kmem.c

226

struct rb_node *node = root->rb_node;

tools/perf/builtin-kmem.c

291

struct rb_node node;

tools/perf/builtin-kmem.c

348

struct rb_node *node;

tools/perf/builtin-kmem.c

464

struct rb_node **node = &page_live_tree.rb_node;

tools/perf/builtin-kmem.c

465

struct rb_node *parent = NULL;

tools/perf/builtin-kmem.c

513

struct rb_node **node = &page_alloc_tree.rb_node;

tools/perf/builtin-kmem.c

514

struct rb_node *parent = NULL;

tools/perf/builtin-kmem.c

568

struct rb_node **node = &page_caller_tree.rb_node;

tools/perf/builtin-kmem.c

569

struct rb_node *parent = NULL;

tools/perf/builtin-kmem.c

72

struct rb_node node;

tools/perf/builtin-kmem.c

90

struct rb_node **node = &root_alloc_stat.rb_node;

tools/perf/builtin-kmem.c

91

struct rb_node *parent = NULL;

tools/perf/builtin-kvm.c

1059

struct rb_node *nd;

tools/perf/builtin-kvm.c

1082

he = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/builtin-kvm.c

519

struct rb_node *nd = rb_first_cached(&hb->hists->entries);

tools/perf/builtin-kvm.c

524

rb_node);

tools/perf/builtin-kvm.c

643

struct rb_node *nd;

tools/perf/builtin-kwork.c

1688

struct rb_node *node;

tools/perf/builtin-kwork.c

1906

struct rb_node *next;

tools/perf/builtin-kwork.c

2001

struct rb_node *next;

tools/perf/builtin-kwork.c

2073

struct rb_node *next;

tools/perf/builtin-kwork.c

2115

struct rb_node *node;

tools/perf/builtin-kwork.c

2153

struct rb_node *next;

tools/perf/builtin-kwork.c

316

struct rb_node *node = root->rb_root.rb_node;

tools/perf/builtin-kwork.c

340

struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;

tools/perf/builtin-kwork.c

550

struct rb_node *next;

tools/perf/builtin-lock.c

1341

struct rb_node *node;

tools/perf/builtin-lock.c

149

rb_link_node(&st->rb, NULL, &thread_stats.rb_node);

tools/perf/builtin-lock.c

381

struct rb_node **rb = &sorted.rb_node;

tools/perf/builtin-lock.c

382

struct rb_node *parent = NULL;

tools/perf/builtin-lock.c

426

struct rb_node **rb = &rr->rb_node;

tools/perf/builtin-lock.c

427

struct rb_node *parent = NULL;

tools/perf/builtin-lock.c

455

struct rb_node *node = rr->rb_node;

tools/perf/builtin-lock.c

72

struct rb_node *node;

tools/perf/builtin-lock.c

75

node = thread_stats.rb_node;

tools/perf/builtin-lock.c

91

struct rb_node **rb = &thread_stats.rb_node;

tools/perf/builtin-lock.c

92

struct rb_node *parent = NULL;

tools/perf/builtin-sched.c

1015

struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;

tools/perf/builtin-sched.c

117

struct rb_node node;

tools/perf/builtin-sched.c

1502

struct rb_node *node;

tools/perf/builtin-sched.c

3054

struct rb_node *rb_node = rb_first_cached(root);

tools/perf/builtin-sched.c

3060

while (rb_node) {

tools/perf/builtin-sched.c

3061

chain = rb_entry(rb_node, struct callchain_node, rb_node);

tools/perf/builtin-sched.c

3062

rb_node = rb_next(rb_node);

tools/perf/builtin-sched.c

3424

struct rb_node **new = &(root->rb_root.rb_node), *parent = NULL;

tools/perf/builtin-sched.c

3466

struct rb_node *node;

tools/perf/builtin-sched.c

3507

struct rb_node *next;

tools/perf/builtin-sched.c

989

struct rb_node *node = root->rb_root.rb_node;

tools/perf/builtin-top.c

399

struct rb_node *next;

tools/perf/builtin-top.c

418

n = rb_entry(next, struct hist_entry, rb_node);

tools/perf/builtin-top.c

423

next = rb_next(&n->rb_node);

tools/perf/tests/code-reading.c

44

struct rb_node rb_node;

tools/perf/tests/code-reading.c

52

struct rb_node **node = &tested_sections->rb_node;

tools/perf/tests/code-reading.c

53

struct rb_node *parent = NULL;

tools/perf/tests/code-reading.c

60

data = rb_entry(*node, struct tested_section, rb_node);

tools/perf/tests/code-reading.c

87

rb_link_node(&data->rb_node, parent, node);

tools/perf/tests/code-reading.c

88

rb_insert_color(&data->rb_node, tested_sections);

tools/perf/tests/code-reading.c

95

struct rb_node *node = rb_first(root);

tools/perf/tests/code-reading.c

98

rb_node);

tools/perf/tests/hists_common.c

167

struct rb_node *node;

tools/perf/tests/hists_common.c

199

struct rb_node *node;

tools/perf/tests/hists_common.c

208

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_cumulate.c

135

struct rb_node *node;

tools/perf/tests/hists_cumulate.c

147

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_cumulate.c

197

struct rb_node *node;

tools/perf/tests/hists_cumulate.c

217

node && (he = rb_entry(node, struct hist_entry, rb_node));

tools/perf/tests/hists_cumulate.c

238

cnode = rb_entry(rb_first(root), struct callchain_node, rb_node);

tools/perf/tests/hists_link.c

164

struct rb_node *node;

tools/perf/tests/hists_link.c

214

struct rb_node *node;

tools/perf/tests/hists_output.c

100

struct rb_node *node;

tools/perf/tests/hists_output.c

112

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

144

struct rb_node *node;

tools/perf/tests/hists_output.c

180

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

186

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

192

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

198

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

204

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

210

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

216

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

222

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

228

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

246

struct rb_node *node;

tools/perf/tests/hists_output.c

280

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

285

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

302

struct rb_node *node;

tools/perf/tests/hists_output.c

334

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

340

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

346

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

352

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

358

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

376

struct rb_node *node;

tools/perf/tests/hists_output.c

412

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

418

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

424

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

430

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

436

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

442

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

448

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

454

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

460

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

478

struct rb_node *node;

tools/perf/tests/hists_output.c

515

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

523

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

530

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

537

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

544

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

551

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

558

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

565

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

572

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/hists_output.c

579

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/tests/symbols.c

118

struct rb_node *nd;

tools/perf/tests/symbols.c

126

struct symbol *sym = rb_entry(nd, struct symbol, rb_node);

tools/perf/tests/vmlinux-kallsyms.c

192

struct rb_node *nd;

tools/perf/tests/vmlinux-kallsyms.c

291

sym = rb_entry(nd, struct symbol, rb_node);

tools/perf/ui/browser.c

141

struct rb_node *nd;

tools/perf/ui/browser.c

170

struct rb_node *nd;

tools/perf/ui/browsers/annotate.c

1009

browser->curr_hot = al ? &al->rb_node : NULL;

tools/perf/ui/browsers/annotate.c

286

struct rb_node **p = &root->rb_node;

tools/perf/ui/browsers/annotate.c

287

struct rb_node *parent = NULL;

tools/perf/ui/browsers/annotate.c

292

l = rb_entry(parent, struct annotation_line, rb_node);

tools/perf/ui/browsers/annotate.c

299

rb_link_node(&al->rb_node, parent, p);

tools/perf/ui/browsers/annotate.c

300

rb_insert_color(&al->rb_node, root);

tools/perf/ui/browsers/annotate.c

31

struct rb_node *curr_hot;

tools/perf/ui/browsers/annotate.c

327

struct rb_node *nd)

tools/perf/ui/browsers/annotate.c

329

struct annotation_line * pos = rb_entry(nd, struct annotation_line, rb_node);

tools/perf/ui/browsers/annotate.c

357

RB_CLEAR_NODE(&pos->al.rb_node);

tools/perf/ui/browsers/annotate.c

372

RB_CLEAR_NODE(&pos->al.rb_node);

tools/perf/ui/browsers/annotate.c

860

al = rb_entry(browser->curr_hot, struct annotation_line, rb_node);

tools/perf/ui/browsers/annotate.c

881

struct rb_node *nd = NULL;

tools/perf/ui/browsers/annotate.c

899

browser->curr_hot = &browser->selection->rb_node;

tools/perf/ui/browsers/hists.c

1021

struct rb_node *node;

tools/perf/ui/browsers/hists.c

1029

struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

1030

struct rb_node *next = rb_next(node);

tools/perf/ui/browsers/hists.c

1106

struct rb_node *node;

tools/perf/ui/browsers/hists.c

1118

struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

1119

struct rb_node *next = rb_next(node);

tools/perf/ui/browsers/hists.c

180

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

183

struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

1859

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

1870

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

1908

static struct rb_node *hists__filter_entries(struct rb_node *nd,

tools/perf/ui/browsers/hists.c

1912

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

1931

static struct rb_node *hists__filter_prev_entries(struct rb_node *nd,

tools/perf/ui/browsers/hists.c

1935

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

1951

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

1983

h = rb_entry(browser->top, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

2005

h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

2027

h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

2064

h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

2073

h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

2194

struct rb_node *nd = hists__filter_entries(rb_first(browser->b.entries),

tools/perf/ui/browsers/hists.c

2199

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

262

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

266

struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

277

struct rb_node *node;

tools/perf/ui/browsers/hists.c

290

child = rb_entry(node, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

2941

struct rb_node *nd = rb_first_cached(&hb->hists->entries);

tools/perf/ui/browsers/hists.c

2961

struct rb_node *nd = rb_first_cached(&hb->hists->entries);

tools/perf/ui/browsers/hists.c

2968

he = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

331

struct rb_node *nd = rb_first(&node->rb_root);

tools/perf/ui/browsers/hists.c

334

struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

370

struct rb_node *nd = rb_first(root);

tools/perf/ui/browsers/hists.c

374

struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

514

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

517

struct callchain_node *child = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

54

static struct rb_node *hists__filter_entries(struct rb_node *nd,

tools/perf/ui/browsers/hists.c

554

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

558

struct callchain_node *node = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

569

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

574

child = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

605

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

611

he = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

64

struct rb_node *nd;

tools/perf/ui/browsers/hists.c

703

struct hist_entry *h = rb_entry(browser->b.top, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

72

rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/browsers/hists.c

895

static bool check_percent_display(struct rb_node *node, u64 parent_total)

tools/perf/ui/browsers/hists.c

905

child = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

917

struct rb_node *node;

tools/perf/ui/browsers/hists.c

925

struct callchain_node *child = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/browsers/hists.c

926

struct rb_node *next = rb_next(node);

tools/perf/ui/browsers/map.c

118

struct rb_node *nd;

tools/perf/ui/browsers/map.c

123

struct symbol *pos = rb_entry(nd, struct symbol, rb_node);

tools/perf/ui/browsers/map.c

27

struct symbol *sym = rb_entry(nd, struct symbol, rb_node);

tools/perf/ui/browsers/map.c

45

return ((void *)browser) - sizeof(struct rb_node) - sizeof(u32);

tools/perf/ui/browsers/map.c

67

browser->b.top = &sym->rb_node;

tools/perf/ui/gtk/hists.c

100

struct rb_node *nd;

tools/perf/ui/gtk/hists.c

109

node = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/gtk/hists.c

163

struct rb_node *nd;

tools/perf/ui/gtk/hists.c

173

node = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/gtk/hists.c

223

struct rb_node *nd;

tools/perf/ui/gtk/hists.c

233

node = rb_entry(nd, struct callchain_node, rb_node);

tools/perf/ui/gtk/hists.c

300

struct rb_node *nd;

tools/perf/ui/gtk/hists.c

359

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/ui/gtk/hists.c

413

struct rb_node *node;

tools/perf/ui/gtk/hists.c

425

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/ui/stdio/hist.c

117

struct rb_node *node, *next;

tools/perf/ui/stdio/hist.c

134

child = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/stdio/hist.c

210

static bool need_percent_display(struct rb_node *node, u64 parent_samples)

tools/perf/ui/stdio/hist.c

217

cnode = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/stdio/hist.c

229

struct rb_node *node;

tools/perf/ui/stdio/hist.c

236

cnode = rb_entry(node, struct callchain_node, rb_node);

tools/perf/ui/stdio/hist.c

315

struct rb_node *rb_node = rb_first(tree);

tools/perf/ui/stdio/hist.c

317

while (rb_node) {

tools/perf/ui/stdio/hist.c

318

chain = rb_entry(rb_node, struct callchain_node, rb_node);

tools/perf/ui/stdio/hist.c

328

rb_node = rb_next(rb_node);

tools/perf/ui/stdio/hist.c

366

struct rb_node *rb_node = rb_first(tree);

tools/perf/ui/stdio/hist.c

368

while (rb_node) {

tools/perf/ui/stdio/hist.c

370

chain = rb_entry(rb_node, struct callchain_node, rb_node);

tools/perf/ui/stdio/hist.c

379

rb_node = rb_next(rb_node);

tools/perf/ui/stdio/hist.c

838

struct rb_node *nd;

tools/perf/ui/stdio/hist.c

871

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/util/annotate-data.c

1771

struct rb_node *node = rb_first(root);

tools/perf/util/annotate-data.c

199

static int data_type_cmp(const void *_key, const struct rb_node *node)

tools/perf/util/annotate-data.c

211

static bool data_type_less(struct rb_node *node_a, const struct rb_node *node_b)

tools/perf/util/annotate-data.c

360

struct rb_node *node;

tools/perf/util/annotate-data.c

638

struct rb_node node;

tools/perf/util/annotate-data.c

645

static int global_var_cmp(const void *_key, const struct rb_node *node)

tools/perf/util/annotate-data.c

657

static bool global_var_less(struct rb_node *node_a, const struct rb_node *node_b)

tools/perf/util/annotate-data.c

670

struct rb_node *node;

tools/perf/util/annotate-data.c

712

struct rb_node *node = rb_first(root);

tools/perf/util/annotate-data.h

94

struct rb_node node;

tools/perf/util/annotate.c

1065

struct rb_node **p = &root->rb_node;

tools/perf/util/annotate.c

1066

struct rb_node *parent = NULL;

tools/perf/util/annotate.c

1072

iter = rb_entry(parent, struct annotation_line, rb_node);

tools/perf/util/annotate.c

1094

rb_link_node(&al->rb_node, parent, p);

tools/perf/util/annotate.c

1095

rb_insert_color(&al->rb_node, root);

tools/perf/util/annotate.c

1114

struct rb_node **p = &root->rb_node;

tools/perf/util/annotate.c

1115

struct rb_node *parent = NULL;

tools/perf/util/annotate.c

1119

iter = rb_entry(parent, struct annotation_line, rb_node);

tools/perf/util/annotate.c

1127

rb_link_node(&al->rb_node, parent, p);

tools/perf/util/annotate.c

1128

rb_insert_color(&al->rb_node, root);

tools/perf/util/annotate.c

1134

struct rb_node *node;

tools/perf/util/annotate.c

1138

struct rb_node *next;

tools/perf/util/annotate.c

1140

al = rb_entry(node, struct annotation_line, rb_node);

tools/perf/util/annotate.c

1152

struct rb_node *node;

tools/perf/util/annotate.c

1169

al = rb_entry(node, struct annotation_line, rb_node);

tools/perf/util/annotate.h

114

struct rb_node rb_node;

tools/perf/util/block-info.c

443

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/block-info.c

454

he = rb_entry(next, struct hist_entry, rb_node);

tools/perf/util/block-info.c

457

next = rb_next(&he->rb_node);

tools/perf/util/block-range.c

15

struct rb_node *rb;

tools/perf/util/block-range.c

31

struct rb_node **p = &block_ranges.root.rb_node;

tools/perf/util/block-range.c

32

struct rb_node *parent = NULL;

tools/perf/util/block-range.c

50

static inline void rb_link_left_of_node(struct rb_node *left, struct rb_node *node)

tools/perf/util/block-range.c

52

struct rb_node **p = &node->rb_left;

tools/perf/util/block-range.c

60

static inline void rb_link_right_of_node(struct rb_node *right, struct rb_node *node)

tools/perf/util/block-range.c

62

struct rb_node **p = &node->rb_right;

tools/perf/util/block-range.c

79

struct rb_node **p = &block_ranges.root.rb_node;

tools/perf/util/block-range.c

80

struct rb_node *n, *parent = NULL;

tools/perf/util/block-range.h

23

struct rb_node node;

tools/perf/util/block-range.h

40

struct rb_node *n = rb_next(&br->node);

tools/perf/util/bpf-event.h

29

struct rb_node rb_node;

tools/perf/util/bpf-event.h

33

struct rb_node rb_node;

tools/perf/util/bpf_lock_contention.c

844

struct rb_node *node = rb_first(&con->cgroups);

tools/perf/util/build-id.c

368

struct rb_node *nd;

tools/perf/util/build-id.c

376

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/build-id.c

920

struct rb_node *nd;

tools/perf/util/build-id.c

924

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/build-id.c

955

struct rb_node *nd;

tools/perf/util/build-id.c

960

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/call-path.c

110

rb_link_node(&cp->rb_node, node_parent, p);

tools/perf/util/call-path.c

111

rb_insert_color(&cp->rb_node, &parent->children);

tools/perf/util/call-path.c

22

RB_CLEAR_NODE(&cp->rb_node);

tools/perf/util/call-path.c

81

struct rb_node **p;

tools/perf/util/call-path.c

82

struct rb_node *node_parent = NULL;

tools/perf/util/call-path.c

92

p = &parent->children.rb_node;

tools/perf/util/call-path.c

95

cp = rb_entry(node_parent, struct call_path, rb_node);

tools/perf/util/call-path.h

34

struct rb_node rb_node;

tools/perf/util/callchain.c

1040

struct rb_node *n;

tools/perf/util/callchain.c

1305

struct rb_node *n;

tools/perf/util/callchain.c

1499

struct rb_node *n;

tools/perf/util/callchain.c

1537

struct rb_node *n;

tools/perf/util/callchain.c

1586

chain->has_children = rb_prev(&node->rb_node) || rb_next(&node->rb_node);

tools/perf/util/callchain.c

1767

struct rb_node *rb_node = rb_first(root);

tools/perf/util/callchain.c

1771

while (rb_node) {

tools/perf/util/callchain.c

1772

node = rb_entry(rb_node, struct callchain_node, rb_node);

tools/perf/util/callchain.c

1774

rb_node = rb_next(rb_node);

tools/perf/util/callchain.c

1782

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/callchain.c

1787

rb_node);

tools/perf/util/callchain.c

1790

next = rb_next(&he->rb_node);

tools/perf/util/callchain.c

393

struct rb_node **p = &root->rb_node;

tools/perf/util/callchain.c

394

struct rb_node *parent = NULL;

tools/perf/util/callchain.c

402

rnode = rb_entry(parent, struct callchain_node, rb_node);

tools/perf/util/callchain.c

426

rb_link_node(&chain->rb_node, parent, p);

tools/perf/util/callchain.c

427

rb_insert_color(&chain->rb_node, root);

tools/perf/util/callchain.c

434

struct rb_node *n;

tools/perf/util/callchain.c

464

struct rb_node *n;

tools/perf/util/callchain.c

486

rb_root->rb_node = chain_root->node.rb_root.rb_node;

tools/perf/util/callchain.c

492

struct rb_node *n;

tools/perf/util/callchain.c

516

rb_root->rb_node = chain_root->node.rb_root.rb_node;

tools/perf/util/callchain.c

558

struct rb_node *n;

tools/perf/util/callchain.c

572

rb_link_node(&new->rb_node_in, NULL, &parent->rb_root_in.rb_node);

tools/perf/util/callchain.c

861

struct rb_node *p, **pp;

tools/perf/util/callchain.c

877

p = parent->rb_root_in.rb_node;

tools/perf/util/callchain.c

908

struct rb_node **p = &root->rb_root_in.rb_node;

tools/perf/util/callchain.c

909

struct rb_node *parent = NULL;

tools/perf/util/callchain.h

64

struct rb_node rb_node_in; /* to insert nodes in an rbtree */

tools/perf/util/callchain.h

65

struct rb_node rb_node; /* to sort nodes in an output tree */

tools/perf/util/cgroup.c

518

struct rb_node **p = &root->rb_node;

tools/perf/util/cgroup.c

519

struct rb_node *parent = NULL;

tools/perf/util/cgroup.c

586

struct rb_node *node;

tools/perf/util/cgroup.h

13

struct rb_node node;

tools/perf/util/dso.c

1804

struct rb_node *nd;

tools/perf/util/dso.c

1813

struct symbol *pos = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/dso.c

898

struct rb_node *next = rb_first(root);

tools/perf/util/dso.c

904

cache = rb_entry(next, struct dso_cache, rb_node);

tools/perf/util/dso.c

905

next = rb_next(&cache->rb_node);

tools/perf/util/dso.c

906

rb_erase(&cache->rb_node, root);

tools/perf/util/dso.c

915

struct rb_node * const *p = &root->rb_node;

tools/perf/util/dso.c

916

const struct rb_node *parent = NULL;

tools/perf/util/dso.c

923

cache = rb_entry(parent, struct dso_cache, rb_node);

tools/perf/util/dso.c

941

struct rb_node **p = &root->rb_node;

tools/perf/util/dso.c

942

struct rb_node *parent = NULL;

tools/perf/util/dso.c

951

cache = rb_entry(parent, struct dso_cache, rb_node);

tools/perf/util/dso.c

962

rb_link_node(&new->rb_node, parent, p);

tools/perf/util/dso.c

963

rb_insert_color(&new->rb_node, root);

tools/perf/util/dso.h

220

struct rb_node rb_node;

tools/perf/util/env.c

101

for (struct rb_node *node = first; node != NULL; node = rb_next(node))

tools/perf/util/env.c

102

(*cb)(rb_entry(node, struct bpf_prog_info_node, rb_node), data);

tools/perf/util/env.c

118

struct rb_node *parent = NULL;

tools/perf/util/env.c

121

struct rb_node **p;

tools/perf/util/env.c

123

p = &env->bpf_progs.btfs.rb_node;

tools/perf/util/env.c

127

node = rb_entry(parent, struct btf_node, rb_node);

tools/perf/util/env.c

138

rb_link_node(&btf_node->rb_node, parent, p);

tools/perf/util/env.c

139

rb_insert_color(&btf_node->rb_node, &env->bpf_progs.btfs);

tools/perf/util/env.c

157

struct rb_node *n;

tools/perf/util/env.c

159

n = env->bpf_progs.btfs.rb_node;

tools/perf/util/env.c

162

node = rb_entry(n, struct btf_node, rb_node);

tools/perf/util/env.c

177

struct rb_node *next;

tools/perf/util/env.c

187

node = rb_entry(next, struct bpf_prog_info_node, rb_node);

tools/perf/util/env.c

188

next = rb_next(&node->rb_node);

tools/perf/util/env.c

189

rb_erase(&node->rb_node, root);

tools/perf/util/env.c

203

node = rb_entry(next, struct btf_node, rb_node);

tools/perf/util/env.c

204

next = rb_next(&node->rb_node);

tools/perf/util/env.c

205

rb_erase(&node->rb_node, root);

tools/perf/util/env.c

43

struct rb_node *parent = NULL;

tools/perf/util/env.c

44

struct rb_node **p;

tools/perf/util/env.c

46

p = &env->bpf_progs.infos.rb_node;

tools/perf/util/env.c

50

node = rb_entry(parent, struct bpf_prog_info_node, rb_node);

tools/perf/util/env.c

61

rb_link_node(&info_node->rb_node, parent, p);

tools/perf/util/env.c

62

rb_insert_color(&info_node->rb_node, &env->bpf_progs.infos);

tools/perf/util/env.c

71

struct rb_node *n;

tools/perf/util/env.c

74

n = env->bpf_progs.infos.rb_node;

tools/perf/util/env.c

77

node = rb_entry(n, struct bpf_prog_info_node, rb_node);

tools/perf/util/env.c

97

struct rb_node *first;

tools/perf/util/header.c

1035

struct rb_node *next;

tools/perf/util/header.c

1051

node = rb_entry(next, struct bpf_prog_info_node, rb_node);

tools/perf/util/header.c

1052

next = rb_next(&node->rb_node);

tools/perf/util/header.c

1077

struct rb_node *next;

tools/perf/util/header.c

1093

node = rb_entry(next, struct btf_node, rb_node);

tools/perf/util/header.c

1094

next = rb_next(&node->rb_node);

tools/perf/util/header.c

1988

struct rb_node *next;

tools/perf/util/header.c

2001

node = rb_entry(next, struct bpf_prog_info_node, rb_node);

tools/perf/util/header.c

2002

next = rb_next(&node->rb_node);

tools/perf/util/header.c

2015

struct rb_node *next;

tools/perf/util/header.c

2028

node = rb_entry(next, struct btf_node, rb_node);

tools/perf/util/header.c

2029

next = rb_next(&node->rb_node);

tools/perf/util/hist.c

1458

rbtree_postorder_for_each_entry_safe(child, tmp, root, rb_node)

tools/perf/util/hist.c

1629

struct rb_node **p = &root->rb_root.rb_node;

tools/perf/util/hist.c

1630

struct rb_node *parent = NULL;

tools/perf/util/hist.c

1750

struct rb_node **p = &root->rb_root.rb_node;

tools/perf/util/hist.c

1751

struct rb_node *parent = NULL;

tools/perf/util/hist.c

1829

struct rb_node *next;

tools/perf/util/hist.c

1902

struct rb_node *node;

tools/perf/util/hist.c

1918

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

1933

struct rb_node **p = &root->rb_root.rb_node;

tools/perf/util/hist.c

1934

struct rb_node *parent = NULL;

tools/perf/util/hist.c

1941

iter = rb_entry(parent, struct hist_entry, rb_node);

tools/perf/util/hist.c

1951

rb_link_node(&he->rb_node, parent, p);

tools/perf/util/hist.c

1952

rb_insert_color_cached(&he->rb_node, root, leftmost);

tools/perf/util/hist.c

1968

struct rb_node *node;

tools/perf/util/hist.c

2020

struct rb_node **p = &entries->rb_root.rb_node;

tools/perf/util/hist.c

2021

struct rb_node *parent = NULL;

tools/perf/util/hist.c

2041

iter = rb_entry(parent, struct hist_entry, rb_node);

tools/perf/util/hist.c

2051

rb_link_node(&he->rb_node, parent, p);

tools/perf/util/hist.c

2052

rb_insert_color_cached(&he->rb_node, entries, leftmost);

tools/perf/util/hist.c

2066

struct rb_node *next;

tools/perf/util/hist.c

2158

struct rb_node *rb_hierarchy_last(struct rb_node *node)

tools/perf/util/hist.c

2160

struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

2164

he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

2169

struct rb_node *__rb_hierarchy_next(struct rb_node *node, enum hierarchy_move_dir hmd)

tools/perf/util/hist.c

2171

struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

2183

node = rb_next(&he->rb_node);

tools/perf/util/hist.c

2188

struct rb_node *rb_hierarchy_prev(struct rb_node *node)

tools/perf/util/hist.c

2190

struct hist_entry *he = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

2200

return &he->rb_node;

tools/perf/util/hist.c

2205

struct rb_node *node;

tools/perf/util/hist.c

2213

child = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

2217

child = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

2333

struct rb_node *nd;

tools/perf/util/hist.c

2341

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/util/hist.c

2353

struct rb_node **p = &root->rb_root.rb_node;

tools/perf/util/hist.c

2354

struct rb_node *parent = NULL;

tools/perf/util/hist.c

2357

struct rb_node *nd;

tools/perf/util/hist.c

2362

iter = rb_entry(parent, struct hist_entry, rb_node);

tools/perf/util/hist.c

2372

rb_link_node(&he->rb_node, parent, p);

tools/perf/util/hist.c

2373

rb_insert_color_cached(&he->rb_node, root, leftmost);

tools/perf/util/hist.c

2380

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/util/hist.c

2383

rb_erase_cached(&h->rb_node, &he->hroot_out);

tools/perf/util/hist.c

2393

struct rb_node *nd;

tools/perf/util/hist.c

2403

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/util/hist.c

2416

nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_CHILD);

tools/perf/util/hist.c

2425

nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);

tools/perf/util/hist.c

2435

nd = __rb_hierarchy_next(&h->rb_node, HMD_FORCE_SIBLING);

tools/perf/util/hist.c

2447

struct hist_entry *h = rb_entry(nd, struct hist_entry, rb_node);

tools/perf/util/hist.c

2450

rb_erase_cached(&h->rb_node, &hists->entries);

tools/perf/util/hist.c

2545

struct rb_node **p;

tools/perf/util/hist.c

2546

struct rb_node *parent = NULL;

tools/perf/util/hist.c

2556

p = &root->rb_root.rb_node;

tools/perf/util/hist.c

2594

struct rb_node **p;

tools/perf/util/hist.c

2595

struct rb_node *parent = NULL;

tools/perf/util/hist.c

2599

p = &root->rb_root.rb_node;

tools/perf/util/hist.c

2634

struct rb_node *n;

tools/perf/util/hist.c

2637

n = hists->entries_collapsed.rb_root.rb_node;

tools/perf/util/hist.c

2639

n = hists->entries_in->rb_root.rb_node;

tools/perf/util/hist.c

265

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/hist.c

2659

struct rb_node *n = root->rb_root.rb_node;

tools/perf/util/hist.c

2681

struct rb_node *nd;

tools/perf/util/hist.c

2701

struct rb_node *nd;

tools/perf/util/hist.c

272

n = rb_entry(next, struct hist_entry, rb_node);

tools/perf/util/hist.c

2729

struct rb_node *nd;

tools/perf/util/hist.c

275

next = rb_next(&n->rb_node);

tools/perf/util/hist.c

2776

struct rb_node *nd;

tools/perf/util/hist.c

2808

struct rb_node *nd;

tools/perf/util/hist.c

3028

struct rb_node *node;

tools/perf/util/hist.c

432

struct rb_node *node = rb_first_cached(&he->hroot_out);

tools/perf/util/hist.c

434

child = rb_entry(node, struct hist_entry, rb_node);

tools/perf/util/hist.c

462

rb_erase_cached(&he->rb_node, root_out);

tools/perf/util/hist.c

473

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/hist.c

477

n = rb_entry(next, struct hist_entry, rb_node);

tools/perf/util/hist.c

478

next = rb_next(&n->rb_node);

tools/perf/util/hist.c

489

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/hist.c

493

n = rb_entry(next, struct hist_entry, rb_node);

tools/perf/util/hist.c

494

next = rb_next(&n->rb_node);

tools/perf/util/hist.c

502

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/hist.c

507

n = rb_entry(next, struct hist_entry, rb_node);

tools/perf/util/hist.c

511

next = rb_next(&n->rb_node);

tools/perf/util/hist.c

684

struct rb_node **p;

tools/perf/util/hist.c

685

struct rb_node *parent = NULL;

tools/perf/util/hist.c

692

p = &hists->entries_in->rb_root.rb_node;

tools/perf/util/hist.h

239

struct rb_node rb_node_in;

tools/perf/util/hist.h

240

struct rb_node rb_node;

tools/perf/util/hist.h

814

struct rb_node *rb_hierarchy_last(struct rb_node *node);

tools/perf/util/hist.h

815

struct rb_node *__rb_hierarchy_next(struct rb_node *node,

tools/perf/util/hist.h

817

struct rb_node *rb_hierarchy_prev(struct rb_node *node);

tools/perf/util/hist.h

819

static inline struct rb_node *rb_hierarchy_next(struct rb_node *node)

tools/perf/util/intel-pt-decoder/intel-pt-decoder.h

209

struct rb_node rb_node;

tools/perf/util/intel-pt.c

322

struct rb_node **p = &rb_root->rb_node;

tools/perf/util/intel-pt.c

323

struct rb_node *parent = NULL;

tools/perf/util/intel-pt.c

328

v = rb_entry(parent, struct intel_pt_vmcs_info, rb_node);

tools/perf/util/intel-pt.c

345

rb_link_node(&v->rb_node, parent, p);

tools/perf/util/intel-pt.c

346

rb_insert_color(&v->rb_node, rb_root);

tools/perf/util/intel-pt.c

366

struct rb_node *n;

tools/perf/util/intel-pt.c

370

v = rb_entry(n, struct intel_pt_vmcs_info, rb_node);

tools/perf/util/intel-pt.c

372

rb_erase(&v->rb_node, &pt->vmcs_info);

tools/perf/util/intlist.c

13

static struct rb_node *intlist__node_new(struct rblist *rblist __maybe_unused,

tools/perf/util/intlist.c

143

struct rb_node *rb_node;

tools/perf/util/intlist.c

145

rb_node = rblist__entry(&ilist->rblist, idx);

tools/perf/util/intlist.c

146

if (rb_node)

tools/perf/util/intlist.c

147

node = container_of(rb_node, struct int_node, rb_node);

tools/perf/util/intlist.c

17

struct rb_node *rc = NULL;

tools/perf/util/intlist.c

23

rc = &node->rb_node;

tools/perf/util/intlist.c

35

struct rb_node *rb_node)

tools/perf/util/intlist.c

37

struct int_node *node = container_of(rb_node, struct int_node, rb_node);

tools/perf/util/intlist.c

42

static int intlist__node_cmp(struct rb_node *rb_node, const void *entry)

tools/perf/util/intlist.c

45

struct int_node *node = container_of(rb_node, struct int_node, rb_node);

tools/perf/util/intlist.c

62

rblist__remove_node(&ilist->rblist, &node->rb_node);

tools/perf/util/intlist.c

69

struct rb_node *rb_node;

tools/perf/util/intlist.c

75

rb_node = rblist__findnew(&ilist->rblist, (void *)i);

tools/perf/util/intlist.c

77

rb_node = rblist__find(&ilist->rblist, (void *)i);

tools/perf/util/intlist.c

79

if (rb_node)

tools/perf/util/intlist.c

80

node = container_of(rb_node, struct int_node, rb_node);

tools/perf/util/intlist.h

11

struct rb_node rb_node;

tools/perf/util/intlist.h

48

struct rb_node *rn = rb_first_cached(&ilist->rblist.entries);

tools/perf/util/intlist.h

49

return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;

tools/perf/util/intlist.h

53

struct rb_node *rn;

tools/perf/util/intlist.h

56

rn = rb_next(&in->rb_node);

tools/perf/util/intlist.h

57

return rn ? rb_entry(rn, struct int_node, rb_node) : NULL;

tools/perf/util/kwork.h

103

struct rb_node node;

tools/perf/util/lock-contention.h

102

struct rb_node rb;

tools/perf/util/lock-contention.h

29

struct rb_node rb; /* used for sorting */

tools/perf/util/machine.c

1261

struct rb_node *next = rb_first_cached(&machines->guests);

tools/perf/util/machine.c

1266

struct machine *pos = rb_entry(next, struct machine, rb_node);

tools/perf/util/machine.c

1268

next = rb_next(&pos->rb_node);

tools/perf/util/machine.c

1269

rb_erase_cached(&pos->rb_node, &machines->guests);

tools/perf/util/machine.c

247

struct rb_node **p = &machines->guests.rb_root.rb_node;

tools/perf/util/machine.c

248

struct rb_node *parent = NULL;

tools/perf/util/machine.c

262

pos = rb_entry(parent, struct machine, rb_node);

tools/perf/util/machine.c

271

rb_link_node(&machine->rb_node, parent, p);

tools/perf/util/machine.c

272

rb_insert_color_cached(&machine->rb_node, &machines->guests, leftmost);

tools/perf/util/machine.c

281

struct rb_node *nd;

tools/perf/util/machine.c

286

struct machine *machine = rb_entry(nd, struct machine, rb_node);

tools/perf/util/machine.c

294

struct rb_node **p = &machines->guests.rb_root.rb_node;

tools/perf/util/machine.c

295

struct rb_node *parent = NULL;

tools/perf/util/machine.c

304

machine = rb_entry(parent, struct machine, rb_node);

tools/perf/util/machine.c

3062

struct rb_node *nd;

tools/perf/util/machine.c

3070

struct machine *machine = rb_entry(nd, struct machine, rb_node);

tools/perf/util/machine.c

451

struct rb_node *nd;

tools/perf/util/machine.c

454

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/machine.c

461

struct rb_node *node;

tools/perf/util/machine.c

468

machine = rb_entry(node, struct machine, rb_node);

tools/perf/util/machine.c

84

RB_CLEAR_NODE(&machine->rb_node);

tools/perf/util/machine.c

904

struct rb_node *nd;

tools/perf/util/machine.c

908

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/machine.c

924

struct rb_node *nd;

tools/perf/util/machine.c

928

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/machine.h

33

struct rb_node rb_node;

tools/perf/util/map.c

319

struct rb_node *nd = rb_first_cached(symbols);

tools/perf/util/map.c

322

struct symbol *sym = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/map.c

332

struct rb_node *nd = rb_last(&symbols->rb_root);

tools/perf/util/map.c

335

struct symbol *sym = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/mem2node.c

12

struct rb_node rb_node;

tools/perf/util/mem2node.c

121

struct rb_node **p, *parent = NULL;

tools/perf/util/mem2node.c

124

p = &map->root.rb_node;

tools/perf/util/mem2node.c

127

entry = rb_entry(parent, struct phys_entry, rb_node);

tools/perf/util/mem2node.c

20

struct rb_node **p = &root->rb_node;

tools/perf/util/mem2node.c

21

struct rb_node *parent = NULL;

tools/perf/util/mem2node.c

26

e = rb_entry(parent, struct phys_entry, rb_node);

tools/perf/util/mem2node.c

34

rb_link_node(&entry->rb_node, parent, p);

tools/perf/util/mem2node.c

35

rb_insert_color(&entry->rb_node, root);

tools/perf/util/mem2node.c

44

RB_CLEAR_NODE(&entry->rb_node);

tools/perf/util/metricgroup.c

1652

struct rb_node *nd;

tools/perf/util/metricgroup.c

40

struct rb_node *nd;

tools/perf/util/metricgroup.c

62

static int metric_event_cmp(struct rb_node *rb_node, const void *entry)

tools/perf/util/metricgroup.c

64

struct metric_event *a = container_of(rb_node,

tools/perf/util/metricgroup.c

76

static struct rb_node *metric_event_new(struct rblist *rblist __maybe_unused,

tools/perf/util/metricgroup.c

91

struct rb_node *rb_node)

tools/perf/util/metricgroup.c

93

struct metric_event *me = container_of(rb_node, struct metric_event, nd);

tools/perf/util/metricgroup.h

23

struct rb_node nd;

tools/perf/util/print-events.c

187

struct rb_node nd;

tools/perf/util/print-events.c

199

static int mep_cmp(struct rb_node *rb_node, const void *entry)

tools/perf/util/print-events.c

201

struct mep *a = container_of(rb_node, struct mep, nd);

tools/perf/util/print-events.c

212

static struct rb_node *mep_new(struct rblist *rl __maybe_unused, const void *entry)

tools/perf/util/print-events.c

224

struct rb_node *nd)

tools/perf/util/print-events.c

235

struct rb_node *nd;

tools/perf/util/print-events.c

290

struct rb_node *node, *next;

tools/perf/util/probe-event.c

3056

struct rb_node *tmp;

tools/perf/util/python.c

1310

struct rb_node *node;

tools/perf/util/python.c

1412

struct rb_node *node;

tools/perf/util/python.c

2003

struct rb_node *node;

tools/perf/util/rblist.c

112

struct rb_node *pos, *next = rb_first_cached(&rblist->entries);

tools/perf/util/rblist.c

129

struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx)

tools/perf/util/rblist.c

131

struct rb_node *node;

tools/perf/util/rblist.c

15

struct rb_node **p = &rblist->entries.rb_root.rb_node;

tools/perf/util/rblist.c

16

struct rb_node *parent = NULL, *new_node;

tools/perf/util/rblist.c

46

void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node)

tools/perf/util/rblist.c

48

rb_erase_cached(rb_node, &rblist->entries);

tools/perf/util/rblist.c

50

rblist->node_delete(rblist, rb_node);

tools/perf/util/rblist.c

53

static struct rb_node *__rblist__findnew(struct rblist *rblist,

tools/perf/util/rblist.c

57

struct rb_node **p = &rblist->entries.rb_root.rb_node;

tools/perf/util/rblist.c

58

struct rb_node *parent = NULL, *new_node = NULL;

tools/perf/util/rblist.c

90

struct rb_node *rblist__find(struct rblist *rblist, const void *entry)

tools/perf/util/rblist.c

95

struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry)

tools/perf/util/rblist.h

26

int (*node_cmp)(struct rb_node *rbn, const void *entry);

tools/perf/util/rblist.h

27

struct rb_node *(*node_new)(struct rblist *rlist, const void *new_entry);

tools/perf/util/rblist.h

28

void (*node_delete)(struct rblist *rblist, struct rb_node *rb_node);

tools/perf/util/rblist.h

35

void rblist__remove_node(struct rblist *rblist, struct rb_node *rb_node);

tools/perf/util/rblist.h

36

struct rb_node *rblist__find(struct rblist *rblist, const void *entry);

tools/perf/util/rblist.h

37

struct rb_node *rblist__findnew(struct rblist *rblist, const void *entry);

tools/perf/util/rblist.h

38

struct rb_node *rblist__entry(const struct rblist *rblist, unsigned int idx);

tools/perf/util/session.c

2735

for (struct rb_node *nd = rb_first_cached(&session->machines.guests); nd; nd = rb_next(nd)) {

tools/perf/util/session.c

2736

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/session.c

2943

struct rb_node *nd;

tools/perf/util/session.c

2952

struct machine *pos = rb_entry(nd, struct machine, rb_node);

tools/perf/util/srcline.c

360

struct rb_node rb_node;

tools/perf/util/srcline.c

365

struct rb_node **p = &tree->rb_root.rb_node;

tools/perf/util/srcline.c

366

struct rb_node *parent = NULL;

tools/perf/util/srcline.c

381

i = rb_entry(parent, struct srcline_node, rb_node);

tools/perf/util/srcline.c

389

rb_link_node(&node->rb_node, parent, p);

tools/perf/util/srcline.c

390

rb_insert_color_cached(&node->rb_node, tree, leftmost);

tools/perf/util/srcline.c

395

struct rb_node *n = tree->rb_root.rb_node;

tools/perf/util/srcline.c

399

rb_node);

tools/perf/util/srcline.c

415

struct rb_node *next = rb_first_cached(tree);

tools/perf/util/srcline.c

418

pos = rb_entry(next, struct srcline_node, rb_node);

tools/perf/util/srcline.c

419

next = rb_next(&pos->rb_node);

tools/perf/util/srcline.c

420

rb_erase_cached(&pos->rb_node, tree);

tools/perf/util/srcline.c

457

struct rb_node **p = &tree->rb_root.rb_node;

tools/perf/util/srcline.c

458

struct rb_node *parent = NULL;

tools/perf/util/srcline.c

465

i = rb_entry(parent, struct inline_node, rb_node);

tools/perf/util/srcline.c

473

rb_link_node(&inlines->rb_node, parent, p);

tools/perf/util/srcline.c

474

rb_insert_color_cached(&inlines->rb_node, tree, leftmost);

tools/perf/util/srcline.c

479

struct rb_node *n = tree->rb_root.rb_node;

tools/perf/util/srcline.c

483

rb_node);

tools/perf/util/srcline.c

499

struct rb_node *next = rb_first_cached(tree);

tools/perf/util/srcline.c

502

pos = rb_entry(next, struct inline_node, rb_node);

tools/perf/util/srcline.c

503

next = rb_next(&pos->rb_node);

tools/perf/util/srcline.c

504

rb_erase_cached(&pos->rb_node, tree);

tools/perf/util/srcline.h

42

struct rb_node rb_node;

tools/perf/util/stream.c

102

struct rb_node *rb_node = rb_first(root);

tools/perf/util/stream.c

105

while (rb_node) {

tools/perf/util/stream.c

106

cnode = rb_entry(rb_node, struct callchain_node, rb_node);

tools/perf/util/stream.c

108

rb_node = rb_next(rb_node);

tools/perf/util/stream.c

114

struct rb_node *next = rb_first_cached(&hists->entries);

tools/perf/util/stream.c

119

he = rb_entry(next, struct hist_entry, rb_node);

tools/perf/util/stream.c

121

next = rb_next(&he->rb_node);

tools/perf/util/strlist.c

100

snode = container_of(rb_node, struct str_node, rb_node);

tools/perf/util/strlist.c

15

struct rb_node *strlist__node_new(struct rblist *rblist __maybe_unused, const void *entry)

tools/perf/util/strlist.c

18

struct rb_node *rc = NULL;

tools/perf/util/strlist.c

196

struct rb_node *rb_node;

tools/perf/util/strlist.c

198

rb_node = rblist__entry(&slist->rblist, idx);

tools/perf/util/strlist.c

199

if (rb_node)

tools/perf/util/strlist.c

200

snode = container_of(rb_node, struct str_node, rb_node);

tools/perf/util/strlist.c

25

rc = &snode->rb_node;

tools/perf/util/strlist.c

42

void strlist__node_delete(struct rblist *rblist __maybe_unused, struct rb_node *rb_node)

tools/perf/util/strlist.c

44

struct str_node *snode = container_of(rb_node, struct str_node, rb_node);

tools/perf/util/strlist.c

49

static int strlist__node_cmp(struct rb_node *rb_node, const void *entry)

tools/perf/util/strlist.c

52

struct str_node *snode = container_of(rb_node, struct str_node, rb_node);

tools/perf/util/strlist.c

91

rblist__remove_node(&slist->rblist, &snode->rb_node);

tools/perf/util/strlist.c

97

struct rb_node *rb_node = rblist__find(&slist->rblist, entry);

tools/perf/util/strlist.c

99

if (rb_node)

tools/perf/util/strlist.h

11

struct rb_node rb_node;

tools/perf/util/strlist.h

58

struct rb_node *rn = rb_first_cached(&slist->rblist.entries);

tools/perf/util/strlist.h

59

return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;

tools/perf/util/strlist.h

63

struct rb_node *rn;

tools/perf/util/strlist.h

66

rn = rb_next(&sn->rb_node);

tools/perf/util/strlist.h

67

return rn ? rb_entry(rn, struct str_node, rb_node) : NULL;

tools/perf/util/symbol.c

1002

rb_erase_cached(&pos->rb_node, root);

tools/perf/util/symbol.c

1034

struct rb_node rb_node;

tools/perf/util/symbol.c

1041

struct rb_node **p = &modules->rb_node;

tools/perf/util/symbol.c

1042

struct rb_node *parent = NULL;

tools/perf/util/symbol.c

1047

m = rb_entry(parent, struct module_info, rb_node);

tools/perf/util/symbol.c

1053

rb_link_node(&mi->rb_node, parent, p);

tools/perf/util/symbol.c

1054

rb_insert_color(&mi->rb_node, modules);

tools/perf/util/symbol.c

1060

struct rb_node *next = rb_first(modules);

tools/perf/util/symbol.c

1063

mi = rb_entry(next, struct module_info, rb_node);

tools/perf/util/symbol.c

1064

next = rb_next(&mi->rb_node);

tools/perf/util/symbol.c

1065

rb_erase(&mi->rb_node, modules);

tools/perf/util/symbol.c

1074

struct rb_node *n = modules->rb_node;

tools/perf/util/symbol.c

1080

m = rb_entry(n, struct module_info, rb_node);

tools/perf/util/symbol.c

1133

struct rb_node *from_node, *to_node;

tools/perf/util/symbol.c

1149

from_m = rb_entry(from_node, struct module_info, rb_node);

tools/perf/util/symbol.c

1150

to_m = rb_entry(to_node, struct module_info, rb_node);

tools/perf/util/symbol.c

209

struct rb_node *nd;

tools/perf/util/symbol.c

218

curr = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/symbol.c

220

nd = rb_next(&curr->rb_node);

tools/perf/util/symbol.c

224

next = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/symbol.c

231

rb_erase_cached(&next->rb_node, symbols);

tools/perf/util/symbol.c

237

nd = rb_next(&curr->rb_node);

tools/perf/util/symbol.c

238

rb_erase_cached(&curr->rb_node, symbols);

tools/perf/util/symbol.c

247

struct rb_node *nd, *prevnd = rb_first_cached(symbols);

tools/perf/util/symbol.c

253

curr = rb_entry(prevnd, struct symbol, rb_node);

tools/perf/util/symbol.c

257

curr = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/symbol.c

350

struct rb_node *next = rb_first_cached(symbols);

tools/perf/util/symbol.c

353

pos = rb_entry(next, struct symbol, rb_node);

tools/perf/util/symbol.c

354

next = rb_next(&pos->rb_node);

tools/perf/util/symbol.c

355

rb_erase_cached(&pos->rb_node, symbols);

tools/perf/util/symbol.c

363

struct rb_node **p = &symbols->rb_root.rb_node;

tools/perf/util/symbol.c

364

struct rb_node *parent = NULL;

tools/perf/util/symbol.c

382

s = rb_entry(parent, struct symbol, rb_node);

tools/perf/util/symbol.c

390

rb_link_node(&sym->rb_node, parent, p);

tools/perf/util/symbol.c

391

rb_insert_color_cached(&sym->rb_node, symbols, leftmost);

tools/perf/util/symbol.c

401

struct rb_node *n;

tools/perf/util/symbol.c

406

n = symbols->rb_root.rb_node;

tools/perf/util/symbol.c

409

struct symbol *s = rb_entry(n, struct symbol, rb_node);

tools/perf/util/symbol.c

424

struct rb_node *n = rb_first_cached(symbols);

tools/perf/util/symbol.c

427

return rb_entry(n, struct symbol, rb_node);

tools/perf/util/symbol.c

434

struct rb_node *n = rb_last(&symbols->rb_root);

tools/perf/util/symbol.c

437

return rb_entry(n, struct symbol, rb_node);

tools/perf/util/symbol.c

444

struct rb_node *n = rb_next(&sym->rb_node);

tools/perf/util/symbol.c

447

return rb_entry(n, struct symbol, rb_node);

tools/perf/util/symbol.c

462

struct rb_node *nd;

tools/perf/util/symbol.c

474

struct symbol *pos = rb_entry(nd, struct symbol, rb_node);

tools/perf/util/symbol.c

569

rb_erase_cached(&sym->rb_node, dso__symbols(dso));

tools/perf/util/symbol.c

809

struct rb_node *next = rb_first_cached(root);

tools/perf/util/symbol.c

821

pos = rb_entry(next, struct symbol, rb_node);

tools/perf/util/symbol.c

822

next = rb_next(&pos->rb_node);

tools/perf/util/symbol.c

824

rb_erase_cached(&pos->rb_node, &old_root);

tools/perf/util/symbol.c

825

RB_CLEAR_NODE(&pos->rb_node);

tools/perf/util/symbol.c

866

struct rb_node *next = rb_first_cached(root);

tools/perf/util/symbol.c

880

pos = rb_entry(next, struct symbol, rb_node);

tools/perf/util/symbol.c

881

next = rb_next(&pos->rb_node);

tools/perf/util/symbol.c

994

rb_erase_cached(&pos->rb_node, root);

tools/perf/util/symbol.h

49

struct rb_node rb_node;

tools/perf/util/symbol.h

86

nd && (pos = rb_entry(nd, struct symbol, rb_node)); \

tools/sched_ext/scx_flatcg.bpf.c

102

struct bpf_rb_node rb_node;

tools/sched_ext/scx_flatcg.bpf.c

108

private(CGV_TREE) struct bpf_rb_root cgv_tree __contains(cgv_node, rb_node);

tools/sched_ext/scx_flatcg.bpf.c

144

cgc_a = container_of(a, struct cgv_node, rb_node);

tools/sched_ext/scx_flatcg.bpf.c

145

cgc_b = container_of(b, struct cgv_node, rb_node);

tools/sched_ext/scx_flatcg.bpf.c

302

bpf_rbtree_add(&cgv_tree, &cgv_node->rb_node, cgv_node_less);

tools/sched_ext/scx_flatcg.bpf.c

609

struct bpf_rb_node *rb_node;

tools/sched_ext/scx_flatcg.bpf.c

619

rb_node = bpf_rbtree_first(&cgv_tree);

tools/sched_ext/scx_flatcg.bpf.c

620

if (!rb_node) {

tools/sched_ext/scx_flatcg.bpf.c

627

rb_node = bpf_rbtree_remove(&cgv_tree, rb_node);

tools/sched_ext/scx_flatcg.bpf.c

630

if (!rb_node) {

tools/sched_ext/scx_flatcg.bpf.c

640

cgv_node = container_of(rb_node, struct cgv_node, rb_node);

tools/sched_ext/scx_flatcg.bpf.c

686

bpf_rbtree_add(&cgv_tree, &cgv_node->rb_node, cgv_node_less);

tools/sched_ext/scx_flatcg.bpf.c

709

bpf_rbtree_add(&cgv_tree, &cgv_node->rb_node, cgv_node_less);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

124

private(A) struct bpf_rb_root fq_delayed __contains(fq_flow_node, rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

160

flow_a = container_of(a, struct fq_flow_node, rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

161

flow_b = container_of(b, struct fq_flow_node, rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

406

flow = container_of(node, struct fq_flow_node, rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

413

node = bpf_rbtree_remove(&fq_delayed, &flow->rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

420

flow = container_of(node, struct fq_flow_node, rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

435

bpf_rbtree_add(&fq_delayed, &flow->rb_node, fn_time_next_packet_less);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

462

struct bpf_rb_node *rb_node;

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

498

rb_node = bpf_rbtree_first(&flow->queue);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

499

if (!rb_node) {

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

511

skbn = container_of(rb_node, struct skb_node, node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

523

rb_node = bpf_rbtree_remove(&flow->queue, rb_node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

526

if (!rb_node)

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

529

skbn = container_of(rb_node, struct skb_node, node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

551

struct bpf_rb_node *rb_node;

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

565

rb_node = bpf_rbtree_first(&flow->queue);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

566

if (!rb_node) {

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

571

skbn = container_of(rb_node, struct skb_node, node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

572

rb_node = bpf_rbtree_remove(&flow->queue, &skbn->node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

575

if (!rb_node)

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

578

skbn = container_of(rb_node, struct skb_node, node);

tools/testing/selftests/bpf/progs/bpf_qdisc_fq.c

82

struct bpf_rb_node rb_node;

tools/testing/selftests/bpf/progs/local_kptr_stash.c

22

struct bpf_rb_node rb_node;

tools/testing/selftests/kvm/include/kvm_util.h

48

struct rb_node gpa_node;

tools/testing/selftests/kvm/include/kvm_util.h

49

struct rb_node hva_node;

tools/testing/selftests/kvm/lib/kvm_util.c

1656

struct rb_node *node;

tools/testing/selftests/kvm/lib/kvm_util.c

1658

for (node = vm->regions.hva_tree.rb_node; node; ) {

tools/testing/selftests/kvm/lib/kvm_util.c

720

struct rb_node *node;

tools/testing/selftests/kvm/lib/kvm_util.c

722

for (node = vm->regions.gpa_tree.rb_node; node; ) {

tools/testing/selftests/kvm/lib/kvm_util.c

872

struct rb_node **cur, *parent;

tools/testing/selftests/kvm/lib/kvm_util.c

874

for (cur = &gpa_tree->rb_node, parent = NULL; *cur; ) {

tools/testing/selftests/kvm/lib/kvm_util.c

898

struct rb_node **cur, *parent;

tools/testing/selftests/kvm/lib/kvm_util.c

900

for (cur = &hva_tree->rb_node, parent = NULL; *cur; ) {

tools/testing/vma/include/dup.h

594

struct rb_node rb;

virt/kvm/kvm_main.c

1471

struct rb_node **node, *parent;

virt/kvm/kvm_main.c

1475

for (node = &gfn_tree->rb_node; *node; ) {