lib/libkvm/kvm_vm_map.c

67

ken = map->rb_root.rbh_root;

sys/dev/drm/amd/amdgpu/amdgpu_mn.c

123

&amn->objects.rb_root, it.rb) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

111

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

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

3180

if (!RB_EMPTY_ROOT(&vm->va.rb_root) || vm->root.entries) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

3313

if (!RB_EMPTY_ROOT(&vm->va.rb_root)) {

sys/dev/drm/amd/amdgpu/amdgpu_vm.c

3318

&vm->va.rb_root, rb) {

sys/dev/drm/drm_mm.c

205

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

sys/dev/drm/drm_mm.c

256

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

sys/dev/drm/drm_mm.c

317

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

sys/dev/drm/drm_vma_manager.c

147

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

sys/dev/drm/i915/gvt/gvt.h

180

struct rb_root cache;

sys/dev/drm/i915/i915_gem_object.h

105

struct rb_root vma_tree;

sys/dev/drm/i915/i915_gem_userptr.c

127

if (RB_EMPTY_ROOT(&mn->objects.rb_root))

sys/dev/drm/i915/i915_vma.h

99

struct rb_root active;

sys/dev/drm/i915/intel_engine_cs.c

961

if (!RB_EMPTY_ROOT(&engine->execlists.queue.rb_root))

sys/dev/drm/i915/intel_lrc.c

1143

GEM_BUG_ON(RB_EMPTY_ROOT(&engine->execlists.queue.rb_root));

sys/dev/drm/i915/intel_lrc.c

2014

if (!RB_EMPTY_ROOT(&execlists->queue.rb_root))

sys/dev/drm/i915/intel_lrc.c

276

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

sys/dev/drm/i915/intel_ringbuffer.h

396

struct rb_root waiters; /* sorted by retirement, priority */

sys/dev/drm/include/drm/drm_mm.h

209

struct rb_root holes_addr;

sys/dev/drm/include/drm/drm_prime.h

49

struct rb_root dmabufs;

sys/dev/drm/include/drm/drm_prime.h

50

struct rb_root handles;

sys/dev/drm/include/drm/drm_vma_manager.h

43

struct rb_root vm_files;

sys/dev/drm/include/linux/interval_tree.h

41

interval_tree_insert(struct interval_tree_node *node, struct rb_root *root);

sys/dev/drm/include/linux/interval_tree.h

44

interval_tree_remove(struct interval_tree_node *node, struct rb_root *root);

sys/dev/drm/include/linux/interval_tree.h

47

interval_tree_iter_first(struct rb_root *root,

sys/dev/drm/include/linux/interval_tree_generic.h

74

struct rb_node **iter = &root->rb_root.rb_node; \

sys/dev/drm/include/linux/rbtree.h

101

linux_root_RB_INSERT_COLOR((struct linux_root *)(&(root)->rb_root), (node))

sys/dev/drm/include/linux/rbtree.h

103

linux_root_RB_REMOVE((struct linux_root *)(&(root)->rb_root), (node))

sys/dev/drm/include/linux/rbtree.h

104

#define rb_first_cached(root) RB_MIN(linux_root, (struct linux_root *)(&(root)->rb_root))

sys/dev/drm/include/linux/rbtree.h

106

rb_replace_node(old, new, &(root)->rb_root)

sys/dev/drm/include/linux/rbtree.h

154

struct rb_root *root)

sys/dev/drm/include/linux/rbtree.h

173

#define LINUX_RB_ROOT (struct rb_root) { NULL }

sys/dev/drm/include/linux/rbtree.h

65

struct rb_root rb_root;

sys/dev/drm/linux_interval_tree.c

34

interval_tree_insert(struct interval_tree_node *node, struct rb_root *root)

sys/dev/drm/linux_interval_tree.c

51

interval_tree_remove(struct interval_tree_node *node, struct rb_root *root)

sys/dev/drm/linux_interval_tree.c

79

interval_tree_iter_first(struct rb_root *root,

sys/dev/drm/radeon/radeon.h

928

struct rb_root va;

sys/dev/drm/radeon/radeon_mn.c

79

&rmn->objects.rb_root, it.rb) {

sys/kern/imgact_elf.c

1199

RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) {

sys/vfs/procfs/procfs_map.c

89

RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_map.c

1175

if (vm_map_rb_tree_RB_INSERT(&map->rb_root, entry))

sys/vm/vm_map.c

1189

vm_map_rb_tree_RB_REMOVE(&map->rb_root, entry);

sys/vm/vm_map.c

1218

tmp = RB_ROOT(&map->rb_root);

sys/vm/vm_map.c

1294

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

1559

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

2140

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

2189

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

2334

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

2561

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

3258

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

3725

RB_FOREACH(old_entry, vm_map_rb_tree, &old_map->rb_root) {

sys/vm/vm_map.c

4040

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4071

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4149

stack_entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4259

next = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_map.c

4769

RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_map.c

566

RB_FOREACH(cur, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_map.c

603

RB_FOREACH(cur, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_map.c

634

RB_INIT(&map->rb_root);

sys/vm/vm_map.h

341

struct vm_map_rb_tree rb_root; /* Organize map entries */

sys/vm/vm_mmap.c

1066

RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_mmap.c

1092

RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_mmap.c

1126

RB_FOREACH(entry, vm_map_rb_tree, &map->rb_root) {

sys/vm/vm_mmap.c

822

entry = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_object.c

1749

tmpe = RB_MIN(vm_map_rb_tree, &map->rb_root);

sys/vm/vm_object.c

1762

tmpe = RB_MIN(vm_map_rb_tree, &tmpm->rb_root);