lib/libevtr/evtr.c

159

RB_ENTRY(id_map) rb_node;

lib/libevtr/evtr.c

250

RB_PROTOTYPE2(id_tree, id_map, rb_node, id_map_cmp, int);

lib/libevtr/evtr.c

251

RB_GENERATE2(id_tree, id_map, rb_node, id_map_cmp, int, id);

lib/libevtr/evtr.c

254

RB_PROTOTYPE2(thread_tree, evtr_thread, rb_node, thread_cmp, void *);

lib/libevtr/evtr.c

255

RB_GENERATE2(thread_tree, evtr_thread, rb_node, thread_cmp, void *, id);

lib/libevtr/evtr.h

79

RB_ENTRY(evtr_thread) rb_node;

sys/dev/drm/amd/amdgpu/amdgpu_object.h

51

struct rb_node 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

112

struct rb_node *parent = NULL;

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

75

struct rb_node *rb;

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

90

struct rb_node *rb = &node->rb;

sys/dev/drm/drm_mm.c

183

struct rb_node **link, *rb;

sys/dev/drm/drm_mm.c

205

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

sys/dev/drm/drm_mm.c

232

struct rb_node **link = &root.rb_node, *rb = NULL; \

sys/dev/drm/drm_mm.c

248

static u64 rb_to_hole_size(struct rb_node *rb)

sys/dev/drm/drm_mm.c

256

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

sys/dev/drm/drm_mm.c

300

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

sys/dev/drm/drm_mm.c

305

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

sys/dev/drm/drm_mm.c

310

static inline u64 rb_hole_size(struct rb_node *rb)

sys/dev/drm/drm_mm.c

317

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

sys/dev/drm/drm_mm.c

337

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

sys/dev/drm/drm_mm.c

459

static u64 rb_to_hole_size_or_zero(struct rb_node *rb)

sys/dev/drm/drm_prime.c

109

p = &prime_fpriv->dmabufs.rb_node;

sys/dev/drm/drm_prime.c

124

p = &prime_fpriv->handles.rb_node;

sys/dev/drm/drm_prime.c

144

struct rb_node *rb;

sys/dev/drm/drm_prime.c

146

rb = prime_fpriv->handles.rb_node;

sys/dev/drm/drm_prime.c

166

struct rb_node *rb;

sys/dev/drm/drm_prime.c

168

rb = prime_fpriv->dmabufs.rb_node;

sys/dev/drm/drm_prime.c

261

struct rb_node *rb;

sys/dev/drm/drm_prime.c

263

rb = prime_fpriv->dmabufs.rb_node;

sys/dev/drm/drm_prime.c

85

struct rb_node dmabuf_rb;

sys/dev/drm/drm_prime.c

86

struct rb_node handle_rb;

sys/dev/drm/drm_prime.c

98

struct rb_node **p, *rb;

sys/dev/drm/drm_vma_manager.c

144

struct rb_node *iter;

sys/dev/drm/drm_vma_manager.c

147

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

sys/dev/drm/drm_vma_manager.c

264

struct rb_node **iter;

sys/dev/drm/drm_vma_manager.c

265

struct rb_node *parent = NULL;

sys/dev/drm/drm_vma_manager.c

277

iter = &node->vm_files.rb_node;

sys/dev/drm/drm_vma_manager.c

328

struct rb_node *iter;

sys/dev/drm/drm_vma_manager.c

332

iter = node->vm_files.rb_node;

sys/dev/drm/drm_vma_manager.c

369

struct rb_node *iter;

sys/dev/drm/drm_vma_manager.c

373

iter = node->vm_files.rb_node;

sys/dev/drm/i915/i915_gpu_error.c

1150

struct rb_node *rb;

sys/dev/drm/i915/i915_request.h

43

struct rb_node node;

sys/dev/drm/i915/i915_vma.c

134

struct rb_node *rb, **p;

sys/dev/drm/i915/i915_vma.c

206

p = &obj->vma_tree.rb_node;

sys/dev/drm/i915/i915_vma.c

233

struct rb_node *rb;

sys/dev/drm/i915/i915_vma.c

235

rb = obj->vma_tree.rb_node;

sys/dev/drm/i915/i915_vma.c

69

struct rb_node node;

sys/dev/drm/i915/i915_vma.c

942

struct rb_node **p, *parent;

sys/dev/drm/i915/i915_vma.c

968

p = &vma->active.rb_node;

sys/dev/drm/i915/i915_vma.h

116

struct rb_node obj_node;

sys/dev/drm/i915/intel_breadcrumbs.c

345

static inline struct intel_wait *to_wait(struct rb_node *node)

sys/dev/drm/i915/intel_breadcrumbs.c

373

struct rb_node *next)

sys/dev/drm/i915/intel_breadcrumbs.c

395

struct rb_node **p, *parent, *completed;

sys/dev/drm/i915/intel_breadcrumbs.c

429

p = &b->waiters.rb_node;

sys/dev/drm/i915/intel_breadcrumbs.c

480

struct rb_node *next = rb_next(completed);

sys/dev/drm/i915/intel_breadcrumbs.c

515

static inline bool chain_wakeup(struct rb_node *rb, int priority)

sys/dev/drm/i915/intel_breadcrumbs.c

541

struct rb_node *next;

sys/dev/drm/i915/intel_breadcrumbs.c

566

struct rb_node *n = rb_next(next);

sys/dev/drm/i915/intel_engine_cs.c

1452

struct rb_node *rb;

sys/dev/drm/i915/intel_guc_submission.c

721

struct rb_node *rb;

sys/dev/drm/i915/intel_guc_submission.c

84

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

sys/dev/drm/i915/intel_lrc.c

175

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

sys/dev/drm/i915/intel_lrc.c

267

struct rb_node **parent, *rb;

sys/dev/drm/i915/intel_lrc.c

276

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

sys/dev/drm/i915/intel_lrc.c

604

struct rb_node *rb;

sys/dev/drm/i915/intel_lrc.c

849

struct rb_node *rb;

sys/dev/drm/i915/intel_ringbuffer.h

193

struct rb_node node;

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

166

struct rb_node rb;

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

167

struct rb_node rb_hole_size;

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

168

struct rb_node rb_hole_addr;

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

35

struct rb_node vm_rb;

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

41

name##_iter_from(struct rb_node *rb, valtype start, valtype last) \

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

74

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

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

75

struct rb_node *parent = NULL; \

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

108

static inline struct rb_node *

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

109

__rb_deepest_left(struct rb_node *node)

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

111

struct rb_node *parent = NULL;

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

122

static inline struct rb_node *

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

123

rb_next_postorder(const struct rb_node *node)

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

125

struct rb_node *parent = RB_PARENT(node, __entry);

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

136

for ((x) = rb_entry_safe(__rb_deepest_left((head)->rb_node), \

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

143

rb_link_node(struct rb_node *node, struct rb_node *parent,

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

144

struct rb_node **rb_link)

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

153

rb_replace_node(struct rb_node *victim, struct rb_node *new,

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

156

struct rb_node *p;

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

165

root->rb_node = new;

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

40

RB_ENTRY(rb_node) __entry;

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

49

struct rb_node *rb_node; /* only member under linux */

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

66

struct rb_node *rb_leftmost;

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

72

int panic_cmp(struct rb_node *one, struct rb_node *two);

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

74

RB_HEAD(linux_root, rb_node);

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

75

RB_PROTOTYPE(linux_root, rb_node, __entry, panic_cmp);

sys/dev/drm/linux_compat.c

35

panic_cmp(struct rb_node *one, struct rb_node *two)

sys/dev/drm/linux_compat.c

40

RB_GENERATE(linux_root, rb_node, __entry, panic_cmp);

sys/dev/drm/linux_interval_tree.c

38

scan = (itnode_t *)root->rb_node;

sys/dev/drm/linux_interval_tree.c

44

root->rb_node = (void *)node;

sys/dev/drm/linux_interval_tree.c

55

scan = (itnode_t *)root->rb_node;

sys/dev/drm/linux_interval_tree.c

65

root->rb_node = NULL;

sys/dev/drm/linux_interval_tree.c

67

} else if ((itnode_t *)root->rb_node == node) {

sys/dev/drm/linux_interval_tree.c

74

root->rb_node = (void *)scan;

sys/dev/drm/linux_interval_tree.c

84

scan = (itnode_t *)root->rb_node;

sys/dev/drm/radeon/radeon_vm.c

1250

while (vm->va.rb_node) {

sys/dev/drm/radeon/radeon_vm.c

1251

bo_va = container_of((void *)vm->va.rb_node, struct radeon_bo_va, it);

sys/kern/uipc_mbuf.c

116

RB_PROTOTYPE2(mbuf_rb_tree, mbtrack, rb_node, mbtrack_cmp, struct mbuf *);

sys/kern/uipc_mbuf.c

119

RB_ENTRY(mbtrack) rb_node;

sys/kern/uipc_mbuf.c

134

RB_GENERATE2(mbuf_rb_tree, mbtrack, rb_node, mbtrack_cmp, struct mbuf *, m);

sys/libprop/prop_dictionary.c

64

struct rb_node pdk_link;

sys/libprop/prop_number.c

51

struct rb_node pn_link;

sys/libprop/prop_rb.c

1002

rb_tree_check_node(const struct rb_tree *rbt, const struct rb_node *self,

sys/libprop/prop_rb.c

1003

const struct rb_node *prev, bool red_check)

sys/libprop/prop_rb.c

1019

KASSERT(RB_FATHER(self) == (const struct rb_node *) &rbt->rbt_root);

sys/libprop/prop_rb.c

1040

const struct rb_node *prev0 = rb_tree_iterate_const(rbt, self, RB_DIR_LEFT);

sys/libprop/prop_rb.c

1041

const struct rb_node *next0 = rb_tree_iterate_const(rbt, self, RB_DIR_RIGHT);

sys/libprop/prop_rb.c

1058

const struct rb_node *brother;

sys/libprop/prop_rb.c

1115

const struct rb_node *relative0, *relative;

sys/libprop/prop_rb.c

113

struct rb_node *parent, *tmp, *self = RB_ITEMTONODE(rbto, object);

sys/libprop/prop_rb.c

1187

const struct rb_node *prev0;

sys/libprop/prop_rb.c

1188

const struct rb_node *next0;

sys/libprop/prop_rb.c

1206

const struct rb_node *self;

sys/libprop/prop_rb.c

1207

const struct rb_node *prev;

sys/libprop/prop_rb.c

1248

rb_tree_mark_depth(const struct rb_tree *rbt, const struct rb_node *self,

sys/libprop/prop_rb.c

127

parent = (struct rb_node *)(void *)&rbt->rbt_root;

sys/libprop/prop_rb.c

150

struct rb_node *prev = NULL, *next = NULL;

sys/libprop/prop_rb.c

180

if (__predict_false(parent == (struct rb_node *)(void *)&rbt->rbt_root)) {

sys/libprop/prop_rb.c

254

rb_tree_reparent_nodes(struct rb_tree *rbt, struct rb_node *old_father,

sys/libprop/prop_rb.c

258

struct rb_node * const grandpa = RB_FATHER(old_father);

sys/libprop/prop_rb.c

259

struct rb_node * const old_child = old_father->rb_nodes[which];

sys/libprop/prop_rb.c

260

struct rb_node * const new_father = old_child;

sys/libprop/prop_rb.c

261

struct rb_node * const new_child = old_father;

sys/libprop/prop_rb.c

292

struct rb_node tmp;

sys/libprop/prop_rb.c

318

rb_tree_insert_rebalance(struct rb_tree *rbt, struct rb_node *self)

sys/libprop/prop_rb.c

320

struct rb_node * father = RB_FATHER(self);

sys/libprop/prop_rb.c

321

struct rb_node * grandpa = RB_FATHER(father);

sys/libprop/prop_rb.c

322

struct rb_node * uncle;

sys/libprop/prop_rb.c

424

rb_tree_prune_node(struct rb_tree *rbt, struct rb_node *self, bool rebalance)

sys/libprop/prop_rb.c

427

struct rb_node *father = RB_FATHER(self);

sys/libprop/prop_rb.c

476

rb_tree_swap_prune_and_rebalance(struct rb_tree *rbt, struct rb_node *self,

sys/libprop/prop_rb.c

477

struct rb_node *standin)

sys/libprop/prop_rb.c

48

static void rb_tree_insert_rebalance(struct rb_tree *, struct rb_node *);

sys/libprop/prop_rb.c

481

struct rb_node *standin_son;

sys/libprop/prop_rb.c

482

struct rb_node *standin_father = RB_FATHER(standin);

sys/libprop/prop_rb.c

49

static void rb_tree_removal_rebalance(struct rb_tree *, struct rb_node *,

sys/libprop/prop_rb.c

52

static const struct rb_node *rb_tree_iterate_const(const struct rb_tree *,

sys/libprop/prop_rb.c

53

const struct rb_node *, const unsigned int);

sys/libprop/prop_rb.c

54

static bool rb_tree_check_node(const struct rb_tree *, const struct rb_node *,

sys/libprop/prop_rb.c

55

const struct rb_node *, bool);

sys/libprop/prop_rb.c

629

rb_tree_prune_blackred_branch(struct rb_tree *rbt, struct rb_node *self,

sys/libprop/prop_rb.c

632

struct rb_node *father = RB_FATHER(self);

sys/libprop/prop_rb.c

633

struct rb_node *son = self->rb_nodes[which];

sys/libprop/prop_rb.c

677

struct rb_node *standin, *self = RB_ITEMTONODE(rbto, object);

sys/libprop/prop_rb.c

739

rb_tree_removal_rebalance(struct rb_tree *rbt, struct rb_node *parent,

sys/libprop/prop_rb.c

749

struct rb_node *brother = parent->rb_nodes[other];

sys/libprop/prop_rb.c

894

struct rb_node *self;

sys/libprop/prop_rb.c

939

static const struct rb_node *

sys/libprop/prop_rb.c

94

struct rb_node *parent = rbt->rbt_root;

sys/libprop/prop_rb.c

940

rb_tree_iterate_const(const struct rb_tree *rbt, const struct rb_node *self,

sys/libprop/prop_rb.c

986

rb_tree_count_black(const struct rb_node *self)

sys/libprop/prop_rb_impl.h

107

TAILQ_ENTRY(rb_node) rb_link;

sys/libprop/prop_rb_impl.h

121

TAILQ_HEAD(rb_node_qh, rb_node);

sys/libprop/prop_rb_impl.h

150

struct rb_node *rbt_root;

sys/libprop/prop_rb_impl.h

152

struct rb_node *rbt_minmax[2];

sys/libprop/prop_rb_impl.h

55

struct rb_node *rb_nodes[2];

sys/libprop/prop_rb_impl.h

72

((struct rb_node *)((rb)->rb_info & ~RB_FLAG_MASK))

sys/vfs/hammer/hammer.h

232

RB_PROTOTYPE2(hammer_pfs_rb_tree, hammer_pseudofs_inmem, rb_node,

sys/vfs/hammer/hammer.h

236

RB_ENTRY(hammer_pseudofs_inmem) rb_node;

sys/vfs/hammer/hammer.h

318

RB_PROTOTYPEX(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,

sys/vfs/hammer/hammer.h

327

RB_PROTOTYPEX(hammer_rec_rb_tree, INFO, hammer_record, rb_node,

sys/vfs/hammer/hammer.h

334

RB_ENTRY(hammer_inode) rb_node;

sys/vfs/hammer/hammer.h

507

RB_ENTRY(hammer_record) rb_node;

sys/vfs/hammer/hammer.h

562

RB_PROTOTYPE2(hammer_vol_rb_tree, hammer_volume, rb_node,

sys/vfs/hammer/hammer.h

564

RB_PROTOTYPE2(hammer_buf_rb_tree, hammer_buffer, rb_node,

sys/vfs/hammer/hammer.h

566

RB_PROTOTYPE2(hammer_nod_rb_tree, hammer_node, rb_node,

sys/vfs/hammer/hammer.h

568

RB_PROTOTYPE2(hammer_und_rb_tree, hammer_undo, rb_node,

sys/vfs/hammer/hammer.h

570

RB_PROTOTYPE2(hammer_res_rb_tree, hammer_reserve, rb_node,

sys/vfs/hammer/hammer.h

572

RB_PROTOTYPE2(hammer_mod_rb_tree, hammer_io, rb_node,

sys/vfs/hammer/hammer.h

601

RB_ENTRY(hammer_io) rb_node; /* if modified */

sys/vfs/hammer/hammer.h

648

RB_ENTRY(hammer_volume) rb_node;

sys/vfs/hammer/hammer.h

664

RB_ENTRY(hammer_buffer) rb_node;

sys/vfs/hammer/hammer.h

684

RB_ENTRY(hammer_node) rb_node; /* per-mount linkage */

sys/vfs/hammer/hammer.h

738

RB_ENTRY(hammer_reserve) rb_node;

sys/vfs/hammer/hammer.h

763

RB_ENTRY(hammer_undo) rb_node;

sys/vfs/hammer/hammer_blockmap.c

78

RB_GENERATE2(hammer_res_rb_tree, hammer_reserve, rb_node,

sys/vfs/hammer/hammer_inode.c

162

RB_GENERATE(hammer_ino_rb_tree, hammer_inode, rb_node, hammer_ino_rb_compare);

sys/vfs/hammer/hammer_inode.c

163

RB_GENERATE_XLOOKUP(hammer_ino_rb_tree, INFO, hammer_inode, rb_node,

sys/vfs/hammer/hammer_inode.c

165

RB_GENERATE2(hammer_pfs_rb_tree, hammer_pseudofs_inmem, rb_node,

sys/vfs/hammer/hammer_io.c

84

RB_GENERATE(hammer_mod_rb_tree, hammer_io, rb_node, hammer_mod_rb_compare);

sys/vfs/hammer/hammer_object.c

255

RB_GENERATE(hammer_rec_rb_tree, hammer_record, rb_node, hammer_rec_rb_compare);

sys/vfs/hammer/hammer_ondisk.c

88

RB_GENERATE2(hammer_vol_rb_tree, hammer_volume, rb_node,

sys/vfs/hammer/hammer_ondisk.c

90

RB_GENERATE2(hammer_buf_rb_tree, hammer_buffer, rb_node,

sys/vfs/hammer/hammer_ondisk.c

92

RB_GENERATE2(hammer_nod_rb_tree, hammer_node, rb_node,

sys/vfs/hammer/hammer_recover.c

147

RB_ENTRY(hammer_rterm) rb_node;

sys/vfs/hammer/hammer_recover.c

158

RB_PROTOTYPE(hammer_rterm_rb_tree, hammer_rterm, rb_node, hammer_rterm_rb_cmp);

sys/vfs/hammer/hammer_recover.c

188

RB_GENERATE(hammer_rterm_rb_tree, hammer_rterm, rb_node, hammer_rterm_rb_cmp);

sys/vfs/hammer/hammer_undo.c

51

RB_GENERATE2(hammer_und_rb_tree, hammer_undo, rb_node,

sys/vfs/tmpfs/tmpfs.h

68

RB_ENTRY(tmpfs_dirent) rb_node;

sys/vfs/tmpfs/tmpfs.h

86

RB_PROTOTYPE(tmpfs_dirtree, tmpfs_dirent, rb_node,

sys/vfs/tmpfs/tmpfs_subr.c

62

RB_GENERATE(tmpfs_dirtree, tmpfs_dirent, rb_node, tmpfs_dirtree_compare);

test/debug/mbufinfo.c

164

if (mt.rb_node.rbe_left)

test/debug/mbufinfo.c

165

dumpmb(kd, mt.rb_node.rbe_left);

test/debug/mbufinfo.c

190

if (mt.rb_node.rbe_right)

test/debug/mbufinfo.c

191

dumpmb(kd, mt.rb_node.rbe_right);

test/debug/mbufinfo.c

76

RB_ENTRY(mbtrack) rb_node;

test/debug/mbufinfo.c

82

RB_PROTOTYPE2(mbuf_rb_tree, mbtrack, rb_node, mbtrack_cmp, struct mbuf *);

usr.bin/systat/netbw.c

153

RB_PROTOTYPE(mytcpcb_tree, mytcpcb, rb_node, mytcpcb_cmp);

usr.bin/systat/netbw.c

154

RB_GENERATE(mytcpcb_tree, mytcpcb, rb_node, mytcpcb_cmp);

usr.bin/systat/netbw.c

74

RB_ENTRY(mytcpcb) rb_node;

usr.bin/systat/pftop.c

181

RB_PROTOTYPE(mypfstate_tree, mypfstate, rb_node, mypfstate_cmp);

usr.bin/systat/pftop.c

182

RB_GENERATE(mypfstate_tree, mypfstate, rb_node, mypfstate_cmp);

usr.bin/systat/pftop.c

81

RB_ENTRY(mypfstate) rb_node;