Home
last modified time | relevance | path

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

/openbmc/u-boot/include/linux/
H A Drbtree.h77 #define rb_entry_safe(ptr, type, member) \ macro
92 for (pos = rb_entry_safe(rb_first_postorder(root), typeof(*pos), field); \
93 pos && ({ n = rb_entry_safe(rb_next_postorder(&pos->field), \
/openbmc/linux/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), \
/openbmc/linux/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.h38 return rb_entry_safe(leftmost, struct timerqueue_node, node); in timerqueue_getnext()
H A Dskbuff.h3899 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
/openbmc/linux/fs/xfs/scrub/
H A Dbitmap.c60 for ((bn) = rb_entry_safe(rb_first(&(bitmap)->xb_root.rb_root), \ in INTERVAL_TREE_DEFINE()
63 (bn) = rb_entry_safe(rb_next(&(bn)->bn_rbnode), \
/openbmc/linux/fs/f2fs/
H A Dextent_cache.c231 *next_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
236 *prev_entry = rb_entry_safe(tmp_node, struct extent_node, rb_node); in __lookup_extent_node_ret()
243 *prev_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
249 *next_entry = rb_entry_safe(tmp_node, in __lookup_extent_node_ret()
677 next_en = rb_entry_safe(node, struct extent_node, in __update_extent_tree_range()
H A Dsegment.c1051 *next_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1056 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1062 *prev_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1066 *next_entry = rb_entry_safe(tmp_node, struct discard_cmd, rb_node); in __lookup_discard_cmd_ret()
1517 next_dc = rb_entry_safe(node, struct discard_cmd, rb_node); in __update_discard_tree_range()
1593 dc = rb_entry_safe(node, struct discard_cmd, rb_node); in __issue_discard_cmd_orderly()
3216 dc = rb_entry_safe(node, struct discard_cmd, rb_node); in __issue_discard_cmd_range()
H A Dgc.c553 ve = rb_entry_safe(node, struct victim_entry, rb_node); in atgc_lookup_victim()
/openbmc/linux/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()
/openbmc/linux/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()
/openbmc/linux/drivers/gpu/drm/i915/
H A Di915_drv.h405 rb_entry_safe(rb, struct intel_engine_cs, uabi_node)
/openbmc/linux/drivers/gpu/drm/i915/selftests/
H A Dintel_memory_region.c1010 engine = rb_entry_safe(rb_next(&engine->uabi_node), in random_engine_class()
/openbmc/linux/mm/
H A Dvmalloc.c786 va = rb_entry_safe(node, struct vmap_area, rb_node); in get_subtree_max_size()
3942 return rb_entry_safe(n, struct vmap_area, rb_node); in node_to_va()
/openbmc/linux/kernel/events/
H A Dcore.c1766 for (event = rb_entry_safe(rb_first(&((groups)->tree)), \
1768 event = rb_entry_safe(rb_next(&event->group_node), \