Home
last modified time | relevance | path

Searched refs:rbtree_postorder_for_each_entry_safe (Results 1 - 25 of 70) sorted by relevance

123

/kernel/linux/linux-6.6/security/landlock/
H A Druleset.c287 rbtree_postorder_for_each_entry_safe(walker_rule, next_rule, &src->root, in merge_ruleset()
329 rbtree_postorder_for_each_entry_safe(walker_rule, next_rule, in inherit_ruleset()
364 rbtree_postorder_for_each_entry_safe(freeme, next, &ruleset->root, node) in free_ruleset()
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/selftests/
H A Di915_active.c288 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { in i915_active_print()
339 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) in i915_active_unlock_wait()
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/gem/
H A Di915_gem_object.c133 rbtree_postorder_for_each_entry_safe(mmo, mn, &obj->mmo.offsets, offset) in i915_gem_close_object()
186 rbtree_postorder_for_each_entry_safe(mmo, mn, in __i915_gem_object_free_mmaps()
H A Di915_gem_mman.c509 rbtree_postorder_for_each_entry_safe(mmo, mn, in i915_gem_object_release_mmap_offset()
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/selftests/
H A Di915_active.c289 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { in i915_active_print()
340 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) in i915_active_unlock_wait()
/kernel/linux/linux-5.10/include/linux/
H A Drbtree.h93 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
101 * rbtree_postorder_for_each_entry_safe() provides a similar guarantee as
109 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-5.10/tools/include/linux/
H A Drbtree.h81 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
89 * rbtree_postorder_for_each_entry_safe() provides a similar guarantee as
97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-5.10/drivers/gpu/drm/i915/
H A Di915_active.c175 rbtree_postorder_for_each_entry_safe(it, n, &root, node) { in __active_retire()
621 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { in flush_lazy_signals()
742 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { in await_active()
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/
H A Di915_active.c170 rbtree_postorder_for_each_entry_safe(it, n, &root, node) { in __active_retire()
590 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { in flush_lazy_signals()
711 rbtree_postorder_for_each_entry_safe(it, n, &ref->tree, node) { in await_active()
/kernel/linux/linux-6.6/include/linux/
H A Drbtree.h83 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
91 * rbtree_postorder_for_each_entry_safe() provides a similar guarantee as
99 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-6.6/tools/include/linux/
H A Drbtree.h81 * rbtree_postorder_for_each_entry_safe - iterate in post-order over rb_root of
89 * rbtree_postorder_for_each_entry_safe() provides a similar guarantee as
97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-6.6/drivers/gpu/drm/i915/gem/
H A Di915_gem_object.c261 rbtree_postorder_for_each_entry_safe(mmo, mn, &obj->mmo.offsets, offset) in i915_gem_close_object()
313 rbtree_postorder_for_each_entry_safe(mmo, mn, in __i915_gem_object_free_mmaps()
/kernel/linux/linux-5.10/fs/ext4/
H A Dblock_validity.c59 rbtree_postorder_for_each_entry_safe(entry, n, in release_system_zone()
H A Ddir.c406 rbtree_postorder_for_each_entry_safe(fname, next, root, rb_hash) in free_rb_tree_fname() function
/kernel/linux/linux-5.10/kernel/trace/
H A Dtrace_stat.c51 rbtree_postorder_for_each_entry_safe(snode, n, &session->stat_root, node) { in __reset_stat_session()
/kernel/linux/linux-6.6/fs/ext4/
H A Dblock_validity.c59 rbtree_postorder_for_each_entry_safe(entry, n, in release_system_zone()
/kernel/linux/linux-6.6/kernel/trace/
H A Dtrace_stat.c51 rbtree_postorder_for_each_entry_safe(snode, n, &session->stat_root, node) { in __reset_stat_session()
/kernel/linux/linux-5.10/arch/sh/kernel/
H A Ddwarf.c1004 rbtree_postorder_for_each_entry_safe(fde, next_fde, &fde_root, node) in dwarf_unwinder_cleanup()
1007 rbtree_postorder_for_each_entry_safe(cie, next_cie, &cie_root, node) in dwarf_unwinder_cleanup()
/kernel/linux/linux-6.6/arch/sh/kernel/
H A Ddwarf.c1004 rbtree_postorder_for_each_entry_safe(fde, next_fde, &fde_root, node) in dwarf_unwinder_cleanup()
1007 rbtree_postorder_for_each_entry_safe(cie, next_cie, &cie_root, node) in dwarf_unwinder_cleanup()
/kernel/linux/linux-5.10/net/tipc/
H A Dgroup.c203 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_join() function
219 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_delete() function
/kernel/linux/linux-6.6/net/tipc/
H A Dgroup.c204 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_join() function
220 rbtree_postorder_for_each_entry_safe(m, tmp, tree, tree_node) { in tipc_group_delete() function
/kernel/linux/linux-5.10/lib/
H A Drbtree_test.c175 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
/kernel/linux/linux-6.6/fs/btrfs/
H A Dblock-rsv.c341 rbtree_postorder_for_each_entry_safe(root, tmp, &fs_info->global_root_tree, in btrfs_update_global_block_rsv()
/kernel/linux/linux-6.6/lib/
H A Drbtree_test.c175 rbtree_postorder_for_each_entry_safe(cur, n, &root.rb_root, rb) in check_postorder_foreach()
/kernel/linux/linux-5.10/fs/ubifs/
H A Dlog.c597 rbtree_postorder_for_each_entry_safe(dr, n, done_tree, rb) in destroy_done_tree()

Completed in 24 milliseconds

123