lib/libc/gen/tree.c

101

struct rb_entry *parent;

lib/libc/gen/tree.c

102

struct rb_entry *tmp;

lib/libc/gen/tree.c

133

struct rb_entry *rbe)

lib/libc/gen/tree.c

135

struct rb_entry *parent;

lib/libc/gen/tree.c

136

struct rb_entry *tmp;

lib/libc/gen/tree.c

167

struct rb_entry *rbe)

lib/libc/gen/tree.c

169

struct rb_entry *parent, *gparent, *tmp;

lib/libc/gen/tree.c

219

struct rb_entry *parent, struct rb_entry *rbe)

lib/libc/gen/tree.c

221

struct rb_entry *tmp;

lib/libc/gen/tree.c

242

struct rb_entry *oleft;

lib/libc/gen/tree.c

280

struct rb_entry *oright;

lib/libc/gen/tree.c

307

static inline struct rb_entry *

lib/libc/gen/tree.c

308

rbe_remove(const struct rb_type *t, struct rb_tree *rbt, struct rb_entry *rbe)

lib/libc/gen/tree.c

310

struct rb_entry *child, *parent, *old = rbe;

lib/libc/gen/tree.c

318

struct rb_entry *tmp;

lib/libc/gen/tree.c

392

struct rb_entry *rbe = rb_n2e(t, elm);

lib/libc/gen/tree.c

393

struct rb_entry *old;

lib/libc/gen/tree.c

404

struct rb_entry *rbe = rb_n2e(t, elm);

lib/libc/gen/tree.c

405

struct rb_entry *tmp;

lib/libc/gen/tree.c

406

struct rb_entry *parent = NULL;

lib/libc/gen/tree.c

446

struct rb_entry *tmp = RBH_ROOT(rbt);

lib/libc/gen/tree.c

46

static inline struct rb_entry *

lib/libc/gen/tree.c

469

struct rb_entry *tmp = RBH_ROOT(rbt);

lib/libc/gen/tree.c

493

struct rb_entry *rbe = rb_n2e(t, elm);

lib/libc/gen/tree.c

51

return ((struct rb_entry *)(addr + t->t_offset));

lib/libc/gen/tree.c

518

struct rb_entry *rbe = rb_n2e(t, elm);

lib/libc/gen/tree.c

543

struct rb_entry *rbe = RBH_ROOT(rbt);

lib/libc/gen/tree.c

55

rb_e2n(const struct rb_type *t, struct rb_entry *rbe)

lib/libc/gen/tree.c

552

struct rb_entry *rbe = RBH_ROOT(rbt);

lib/libc/gen/tree.c

553

struct rb_entry *parent = NULL;

lib/libc/gen/tree.c

567

struct rb_entry *rbe = RBH_ROOT(rbt);

lib/libc/gen/tree.c

568

struct rb_entry *parent = NULL;

lib/libc/gen/tree.c

582

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

591

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

600

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

609

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

610

struct rb_entry *rbl = (left == NULL) ? NULL : rb_n2e(t, left);

lib/libc/gen/tree.c

619

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

620

struct rb_entry *rbr = (right == NULL) ? NULL : rb_n2e(t, right);

lib/libc/gen/tree.c

629

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

630

struct rb_entry *rbp = (parent == NULL) ? NULL : rb_n2e(t, parent);

lib/libc/gen/tree.c

639

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

642

(struct rb_entry *)poison;

lib/libc/gen/tree.c

649

struct rb_entry *rbe = rb_n2e(t, node);

lib/libc/gen/tree.c

70

rbe_set(struct rb_entry *rbe, struct rb_entry *parent)

lib/libc/gen/tree.c

78

rbe_set_blackred(struct rb_entry *black, struct rb_entry *red)

lib/libc/gen/tree.c

85

rbe_augment(const struct rb_type *t, struct rb_entry *rbe)

lib/libc/gen/tree.c

91

rbe_if_augment(const struct rb_type *t, struct rb_entry *rbe)

lib/libc/gen/tree.c

99

struct rb_entry *rbe)

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

105

node = rb_entry(rb, typeof(*node), rb);

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

119

node = rb_entry(rb, typeof(*node), rb);

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

143

iter_node = rb_entry(*iter, struct amdgpu_bo_va_mapping, rb);

sys/dev/pci/drm/drm_buddy.c

75

return node ? rb_entry(node, struct drm_buddy_block, rb) : NULL;

sys/dev/pci/drm/drm_linux.c

3134

node = rb_entry(rb, typeof(*node), rb);

sys/dev/pci/drm/drm_linux.c

3158

iter_node = rb_entry(*iter, struct interval_tree_node, rb);

sys/dev/pci/drm/drm_mm.c

168

node = rb_entry(rb, typeof(*node), rb);

sys/dev/pci/drm/drm_mm.c

204

parent = rb_entry(rb, struct drm_mm_node, rb);

sys/dev/pci/drm/drm_mm.c

223

parent = rb_entry(rb, struct drm_mm_node, rb);

sys/dev/pci/drm/drm_mm.c

248

if (x < expr(rb_entry(rb, struct drm_mm_node, member))) \

sys/dev/pci/drm/drm_mm.c

262

return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;

sys/dev/pci/drm/drm_mm.c

324

return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;

sys/dev/pci/drm/drm_mm.c

334

rb_entry(rb, struct drm_mm_node, rb_hole_size);

sys/dev/pci/drm/drm_prime.c

116

pos = rb_entry(rb, struct drm_prime_member, dmabuf_rb);

sys/dev/pci/drm/drm_prime.c

131

pos = rb_entry(rb, struct drm_prime_member, handle_rb);

sys/dev/pci/drm/drm_prime.c

152

member = rb_entry(rb, struct drm_prime_member, handle_rb);

sys/dev/pci/drm/drm_prime.c

174

member = rb_entry(rb, struct drm_prime_member, dmabuf_rb);

sys/dev/pci/drm/drm_prime.c

197

member = rb_entry(rb, struct drm_prime_member, handle_rb);

sys/dev/pci/drm/drm_vma_manager.c

153

node = rb_entry(iter, struct drm_mm_node, rb);

sys/dev/pci/drm/drm_vma_manager.c

264

entry = rb_entry(*iter, struct drm_vma_offset_file, vm_rb);

sys/dev/pci/drm/drm_vma_manager.c

368

entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb);

sys/dev/pci/drm/drm_vma_manager.c

409

entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb);

sys/dev/pci/drm/i915/gem/i915_gem_mman.c

1060

rb_entry(rb, typeof(*mmo), offset);

sys/dev/pci/drm/i915/gem/i915_gem_mman.c

1089

pos = rb_entry(rb, typeof(*pos), offset);

sys/dev/pci/drm/i915/gt/intel_engine_user.c

23

rb_entry(p, typeof(*it), uabi_node);

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

1030

rb_entry(rb, typeof(*ve), nodes[engine->id].rb);

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

257

return rb_entry(rb, struct i915_priolist, node);

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

298

return rb ? rb_entry(rb, struct ve_node, rb)->prio : INT_MIN;

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

3203

rb_entry(rb, typeof(*ve), nodes[engine->id].rb);

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

3873

other = rb_entry(rb, typeof(*other), rb);

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

4124

struct i915_priolist *p = rb_entry(rb, typeof(*p), node);

sys/dev/pci/drm/i915/gt/intel_execlists_submission.c

4146

rb_entry(rb, typeof(*ve), nodes[engine->id].rb);

sys/dev/pci/drm/i915/gt/uc/intel_guc_submission.c

406

return rb_entry(rb, struct i915_priolist, node);

sys/dev/pci/drm/i915/gvt/kvmgt.c

216

itr = rb_entry(node, struct gvt_dma, dma_addr_node);

sys/dev/pci/drm/i915/gvt/kvmgt.c

234

itr = rb_entry(node, struct gvt_dma, gfn_node);

sys/dev/pci/drm/i915/gvt/kvmgt.c

266

itr = rb_entry(parent, struct gvt_dma, gfn_node);

sys/dev/pci/drm/i915/gvt/kvmgt.c

281

itr = rb_entry(parent, struct gvt_dma, dma_addr_node);

sys/dev/pci/drm/i915/gvt/kvmgt.c

316

dma = rb_entry(node, struct gvt_dma, gfn_node);

sys/dev/pci/drm/i915/i915_active.c

309

node = rb_entry(parent, struct active_node, node);

sys/dev/pci/drm/i915/i915_active.c

33

#define fetch_node(x) rb_entry(READ_ONCE(x), typeof(struct active_node), node)

sys/dev/pci/drm/i915/i915_active.c

796

rb_entry(p, struct active_node, node);

sys/dev/pci/drm/i915/i915_active.c

816

rb_entry(p, struct active_node, node);

sys/dev/pci/drm/i915/i915_active.c

851

return rb_entry(p, struct active_node, node);

sys/dev/pci/drm/i915/i915_active.c

971

it = rb_entry(parent, struct active_node, node);

sys/dev/pci/drm/i915/i915_scheduler.c

36

return rb_entry(rb, struct i915_priolist, node);

sys/dev/pci/drm/i915/i915_vma.c

251

pos = rb_entry(rb, struct i915_vma, obj_node);

sys/dev/pci/drm/i915/i915_vma.c

303

struct i915_vma *vma = rb_entry(rb, struct i915_vma, obj_node);

sys/dev/pci/drm/i915/i915_vma_resource.c

52

node = rb_entry(rb, typeof(*node), rb);

sys/dev/pci/drm/i915/i915_vma_resource.c

66

node = rb_entry(rb, typeof(*node), rb);

sys/dev/pci/drm/i915/i915_vma_resource.c

90

iter_node = rb_entry(*iter, struct i915_vma_resource, rb);

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

68

(ptr ? rb_entry(ptr, type, member) : NULL)

sys/dev/pci/drm/scheduler/sched_main.c

141

struct drm_sched_entity *ent_a = rb_entry((a), struct drm_sched_entity, rb_tree_node);

sys/dev/pci/drm/scheduler/sched_main.c

142

struct drm_sched_entity *ent_b = rb_entry((b), struct drm_sched_entity, rb_tree_node);

sys/dev/pci/drm/scheduler/sched_main.c

324

entity = rb_entry(rb, struct drm_sched_entity, rb_tree_node);

sys/dev/pci/drm/scheduler/sched_main.c

340

return rb ? rb_entry(rb, struct drm_sched_entity, rb_tree_node) : NULL;

sys/dev/pci/drm/ttm/ttm_pool.c

278

p->objt.rbt_parent = (struct rb_entry *)dma;

sys/kern/subr_tree.c

101

struct rb_entry *parent;

sys/kern/subr_tree.c

102

struct rb_entry *tmp;

sys/kern/subr_tree.c

133

struct rb_entry *rbe)

sys/kern/subr_tree.c

135

struct rb_entry *parent;

sys/kern/subr_tree.c

136

struct rb_entry *tmp;

sys/kern/subr_tree.c

167

struct rb_entry *rbe)

sys/kern/subr_tree.c

169

struct rb_entry *parent, *gparent, *tmp;

sys/kern/subr_tree.c

219

struct rb_entry *parent, struct rb_entry *rbe)

sys/kern/subr_tree.c

221

struct rb_entry *tmp;

sys/kern/subr_tree.c

242

struct rb_entry *oleft;

sys/kern/subr_tree.c

280

struct rb_entry *oright;

sys/kern/subr_tree.c

307

static inline struct rb_entry *

sys/kern/subr_tree.c

308

rbe_remove(const struct rb_type *t, struct rb_tree *rbt, struct rb_entry *rbe)

sys/kern/subr_tree.c

310

struct rb_entry *child, *parent, *old = rbe;

sys/kern/subr_tree.c

318

struct rb_entry *tmp;

sys/kern/subr_tree.c

392

struct rb_entry *rbe = rb_n2e(t, elm);

sys/kern/subr_tree.c

393

struct rb_entry *old;

sys/kern/subr_tree.c

403

struct rb_entry *rbe = rb_n2e(t, elm);

sys/kern/subr_tree.c

404

struct rb_entry *tmp;

sys/kern/subr_tree.c

405

struct rb_entry *parent = NULL;

sys/kern/subr_tree.c

444

struct rb_entry *tmp = RBH_ROOT(rbt);

sys/kern/subr_tree.c

46

static inline struct rb_entry *

sys/kern/subr_tree.c

466

struct rb_entry *tmp = RBH_ROOT(rbt);

sys/kern/subr_tree.c

489

struct rb_entry *rbe = rb_n2e(t, elm);

sys/kern/subr_tree.c

51

return ((struct rb_entry *)(addr + t->t_offset));

sys/kern/subr_tree.c

513

struct rb_entry *rbe = rb_n2e(t, elm);

sys/kern/subr_tree.c

537

struct rb_entry *rbe = RBH_ROOT(rbt);

sys/kern/subr_tree.c

545

struct rb_entry *rbe = RBH_ROOT(rbt);

sys/kern/subr_tree.c

546

struct rb_entry *parent = NULL;

sys/kern/subr_tree.c

55

rb_e2n(const struct rb_type *t, struct rb_entry *rbe)

sys/kern/subr_tree.c

559

struct rb_entry *rbe = RBH_ROOT(rbt);

sys/kern/subr_tree.c

560

struct rb_entry *parent = NULL;

sys/kern/subr_tree.c

573

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

581

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

589

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

597

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

598

struct rb_entry *rbl = (left == NULL) ? NULL : rb_n2e(t, left);

sys/kern/subr_tree.c

606

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

607

struct rb_entry *rbr = (right == NULL) ? NULL : rb_n2e(t, right);

sys/kern/subr_tree.c

615

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

616

struct rb_entry *rbp = (parent == NULL) ? NULL : rb_n2e(t, parent);

sys/kern/subr_tree.c

624

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

627

(struct rb_entry *)poison;

sys/kern/subr_tree.c

633

struct rb_entry *rbe = rb_n2e(t, node);

sys/kern/subr_tree.c

70

rbe_set(struct rb_entry *rbe, struct rb_entry *parent)

sys/kern/subr_tree.c

78

rbe_set_blackred(struct rb_entry *black, struct rb_entry *red)

sys/kern/subr_tree.c

85

rbe_augment(const struct rb_type *t, struct rb_entry *rbe)

sys/kern/subr_tree.c

91

rbe_if_augment(const struct rb_type *t, struct rb_entry *rbe)

sys/kern/subr_tree.c

99

struct rb_entry *rbe)

sys/sys/tree.h

772

struct rb_entry *rbt_root;

sys/sys/tree.h

776

struct rb_entry *rbt_parent;

sys/sys/tree.h

777

struct rb_entry *rbt_left;

sys/sys/tree.h

778

struct rb_entry *rbt_right;

sys/sys/tree.h

787

#define RBT_ENTRY(_type) struct rb_entry