Symbol: rb_entry
lib/libkvm/kvm_vm_map.c
102
if (ken == copy->rb_entry.rbe_left) {
lib/libkvm/kvm_vm_map.c
105
while (ken == copy->rb_entry.rbe_right) {
lib/libkvm/kvm_vm_map.c
107
ken2 = copy->rb_entry.rbe_parent;
lib/libkvm/kvm_vm_map.c
72
while (copy->rb_entry.rbe_left) {
lib/libkvm/kvm_vm_map.c
73
ken = copy->rb_entry.rbe_left;
lib/libkvm/kvm_vm_map.c
88
if (copy->rb_entry.rbe_right) {
lib/libkvm/kvm_vm_map.c
89
ken = copy->rb_entry.rbe_right;
lib/libkvm/kvm_vm_map.c
92
while (copy->rb_entry.rbe_left) {
lib/libkvm/kvm_vm_map.c
93
ken = copy->rb_entry.rbe_left;
lib/libkvm/kvm_vm_map.c
98
if ((ken2 = copy->rb_entry.rbe_parent) == NULL)
sbin/hammer/cmd_dedup.c
148
RB_GENERATE2(sim_dedup_entry_rb_tree, sim_dedup_entry, rb_entry,
sbin/hammer/cmd_dedup.c
150
RB_GENERATE2(dedup_entry_rb_tree, dedup_entry, rb_entry,
sbin/hammer/cmd_dedup.c
47
RB_PROTOTYPE2(sim_dedup_entry_rb_tree, sim_dedup_entry, rb_entry,
sbin/hammer/cmd_dedup.c
54
RB_ENTRY(sim_dedup_entry) rb_entry;
sbin/hammer/cmd_dedup.c
67
RB_ENTRY(dedup_entry) rb_entry;
sbin/hammer/cmd_dedup.c
86
RB_PROTOTYPE2(dedup_entry_rb_tree, dedup_entry, rb_entry,
sbin/vquota/vquota.c
188
RB_PROTOTYPE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
sbin/vquota/vquota.c
189
RB_PROTOTYPE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
sbin/vquota/vquota.c
190
RB_GENERATE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
sbin/vquota/vquota.c
191
RB_GENERATE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
sbin/vquota/vquota.c
87
RB_ENTRY(hl_node) rb_entry;
sbin/vquota/vquota.c
94
RB_PROTOTYPE(hl_tree, hl_node, rb_entry, rb_hl_node_cmp);
sbin/vquota/vquota.c
99
RB_GENERATE(hl_tree, hl_node, rb_entry, rb_hl_node_cmp);
sys/dev/drm/amd/amdgpu/amdgpu_vm.c
117
iter_node = rb_entry(*iter, struct amdgpu_bo_va_mapping, rb);
sys/dev/drm/amd/amdgpu/amdgpu_vm.c
78
node = rb_entry(rb, typeof(*node), rb);
sys/dev/drm/amd/amdgpu/amdgpu_vm.c
93
node = rb_entry(rb, typeof(*node), rb);
sys/dev/drm/drm_mm.c
192
parent = rb_entry(rb, struct drm_mm_node, rb);
sys/dev/drm/drm_mm.c
211
parent = rb_entry(rb, struct drm_mm_node, rb);
sys/dev/drm/drm_mm.c
236
if (x < expr(rb_entry(rb, struct drm_mm_node, member))) \
sys/dev/drm/drm_mm.c
250
return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;
sys/dev/drm/drm_mm.c
312
return rb_entry(rb, struct drm_mm_node, rb_hole_size)->hole_size;
sys/dev/drm/drm_mm.c
322
rb_entry(rb, struct drm_mm_node, rb_hole_size);
sys/dev/drm/drm_prime.c
114
pos = rb_entry(rb, struct drm_prime_member, dmabuf_rb);
sys/dev/drm/drm_prime.c
129
pos = rb_entry(rb, struct drm_prime_member, handle_rb);
sys/dev/drm/drm_prime.c
150
member = rb_entry(rb, struct drm_prime_member, handle_rb);
sys/dev/drm/drm_prime.c
172
member = rb_entry(rb, struct drm_prime_member, dmabuf_rb);
sys/dev/drm/drm_prime.c
267
member = rb_entry(rb, struct drm_prime_member, dmabuf_rb);
sys/dev/drm/drm_vma_manager.c
151
node = rb_entry(iter, struct drm_mm_node, rb);
sys/dev/drm/drm_vma_manager.c
281
entry = rb_entry(*iter, struct drm_vma_offset_file, vm_rb);
sys/dev/drm/drm_vma_manager.c
334
entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb);
sys/dev/drm/drm_vma_manager.c
375
entry = rb_entry(iter, struct drm_vma_offset_file, vm_rb);
sys/dev/drm/i915/i915_gpu_error.c
1185
struct intel_wait *w = rb_entry(rb, typeof(*w), node);
sys/dev/drm/i915/i915_vma.c
211
pos = rb_entry(rb, struct i915_vma, obj_node);
sys/dev/drm/i915/i915_vma.c
237
struct i915_vma *vma = rb_entry(rb, struct i915_vma, obj_node);
sys/dev/drm/i915/i915_vma.c
972
active = rb_entry(parent, struct i915_vma_active, node);
sys/dev/drm/i915/intel_breadcrumbs.c
347
return rb_entry(node, struct intel_wait, node);
sys/dev/drm/i915/intel_engine_cs.c
1541
rb_entry(rb, typeof(*p), node);
sys/dev/drm/i915/intel_engine_cs.c
1563
struct intel_wait *w = rb_entry(rb, typeof(*w), node);
sys/dev/drm/i915/intel_guc_submission.c
86
return rb_entry(rb, struct i915_priolist, node);
sys/dev/drm/i915/intel_lrc.c
177
return rb_entry(rb, struct i915_priolist, node);
sys/dev/drm/include/linux/interval_tree_generic.h
46
node = rb_entry(rb, type, field); \
sys/dev/drm/include/linux/interval_tree_generic.h
81
iter_node = rb_entry(parent, type, field); \
sys/dev/drm/include/linux/rbtree.h
85
(ptr ? rb_entry(ptr, type, member) : NULL)
sys/kern/vfs_quota.c
50
RB_PROTOTYPE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
sys/kern/vfs_quota.c
51
RB_PROTOTYPE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
sys/kern/vfs_quota.c
58
RB_GENERATE(ac_utree, ac_unode, rb_entry, rb_ac_unode_cmp);
sys/kern/vfs_quota.c
59
RB_GENERATE(ac_gtree, ac_gnode, rb_entry, rb_ac_gnode_cmp);
sys/sys/mount.h
163
RB_ENTRY(ac_unode) rb_entry;
sys/sys/mount.h
169
RB_ENTRY(ac_gnode) rb_entry;
sys/sys/vkernel.h
65
RB_PROTOTYPE(vmspace_rb_tree, vmspace_entry, rb_entry, rb_vmspace_compare);
sys/sys/vkernel.h
99
RB_ENTRY(vmspace_entry) rb_entry;
sys/vm/vm_map.c
1227
tmp = RB_RIGHT(tmp, rb_entry);
sys/vm/vm_map.c
1229
tmp = RB_LEFT(tmp, rb_entry);
sys/vm/vm_map.c
275
RB_GENERATE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare);
sys/vm/vm_map.h
103
RB_PROTOTYPE(vm_map_rb_tree, vm_map_entry, rb_entry, rb_vm_map_compare);
sys/vm/vm_map.h
226
RB_ENTRY(vm_map_entry) rb_entry;
sys/vm/vm_map.h
240
#define MAPENT_FREELIST(ent) (ent)->rb_entry.rbe_left
sys/vm/vm_page.c
167
RB_GENERATE2(vm_page_rb_tree, vm_page, rb_entry, rb_vm_page_compare,
sys/vm/vm_page.h
177
RB_PROTOTYPE2(vm_page_rb_tree, vm_page, rb_entry,
sys/vm/vm_page.h
183
RB_ENTRY(vm_page) rb_entry; /* Red-Black tree based at object */
sys/vm/vm_vmspace.c
573
RB_GENERATE(vmspace_rb_tree, vmspace_entry, rb_entry, rb_vmspace_compare);
test/debug/vmobjinfo.c
236
dump_memq(kd, pg.rb_entry.rbe_left);
test/debug/vmobjinfo.c
261
dump_memq(kd, pg.rb_entry.rbe_right);
usr.bin/gcore/elfcore.c
216
for (entry = map; entry; entry = entry->rb_entry.rbe_parent)
usr.bin/gcore/elfcore.c
362
vm_map_entry_t next = map->rb_entry.rbe_parent;
usr.bin/gcore/elfcore.c
534
linkp = &ent->rb_entry.rbe_parent;