Home
last modified time | relevance | path

Searched refs:rb_entry_safe (Results 1 – 15 of 15) sorted by relevance

/linux-6.15/tools/include/linux/
H A Drbtree.h75 #define rb_entry_safe(ptr, type, member) \ macro
98 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
99 pos && ({ n = rb_entry_safe(rb_next_postorder(&pos->field), \
/linux-6.15/include/linux/
H A Drbtree.h77 #define rb_entry_safe(ptr, type, member) \ macro
100 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
101 pos && ({ n = rb_entry_safe(rb_next_postorder(&pos->field), \
H A Dtimerqueue.h27 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
H A Dskbuff.h4039 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
/linux-6.15/fs/xfs/scrub/
H A Dbitmap.c63 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
66 (bn) = rb_entry_safe(rb_next(&(bn)->bn_rbnode), \
338 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
341 (bn) = rb_entry_safe(rb_next(&(bn)->bn_rbnode), \
/linux-6.15/fs/f2fs/
H A Dextent_cache.c263 *next_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
268 *prev_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
275 *prev_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
281 *next_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
746 next_en = rb_entry_safe(node, struct extent_node, in __update_extent_tree_range()
H A Dsegment.c1073 *next_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1078 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1084 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1088 *next_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1552 next_dc = rb_entry_safe(node, struct discard_cmd, rb_node); in __update_discard_tree_range()
1628 dc = rb_entry_safe(node, struct discard_cmd, rb_node); in __issue_discard_cmd_orderly()
3416 dc = rb_entry_safe(node, struct discard_cmd, rb_node); in __issue_discard_cmd_range()
H A Dgc.c580 ve = rb_entry_safe(node, struct victim_entry, rb_node); in atgc_lookup_victim()
/linux-6.15/fs/proc/
H A Dgeneric.c58 return rb_entry_safe(rb_first(&dir->subdir), struct proc_dir_entry, in pde_subdir_first()
64 return rb_entry_safe(rb_next(&dir->subdir_node), struct proc_dir_entry, in pde_subdir_next()
/linux-6.15/drivers/gpu/drm/
H A Ddrm_mm.c297 return rb_entry_safe(rb, struct drm_mm_node, rb_hole_size); in rb_hole_size_to_node()
302 return rb_entry_safe(rb, struct drm_mm_node, rb_hole_addr); in rb_hole_addr_to_node()
/linux-6.15/drivers/gpu/drm/i915/
H A Di915_drv.h384 rb_entry_safe(rb, struct intel_engine_cs, uabi_node)
/linux-6.15/drivers/gpu/drm/i915/selftests/
H A Dintel_memory_region.c1010 engine = rb_entry_safe(rb_next(&engine->uabi_node), in random_engine_class()
/linux-6.15/mm/
H A Dvmalloc.c981 va = rb_entry_safe(node, struct vmap_area, rb_node); in get_subtree_max_size()
4554 return rb_entry_safe(n, struct vmap_area, rb_node); in node_to_va()
/linux-6.15/fs/btrfs/
H A Dbackref.c3154 while ((node = rb_entry_safe(rb_first(&cache->rb_root), in btrfs_backref_release_cache()
/linux-6.15/kernel/events/
H A Dcore.c1842 for (event = rb_entry_safe(rb_first(&((groups)->tree)), \
1844 event = rb_entry_safe(rb_next(&event->group_node), \