Home
last modified time | relevance | path

Searched defs:rbtree_postorder_for_each_entry_safe (Results 1 - 19 of 19) sorted by relevance

/kernel/linux/linux-5.10/include/linux/
H A Drbtree.h109 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-5.10/tools/include/linux/
H A Drbtree.h97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-6.6/include/linux/
H A Drbtree.h99 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-5.10/fs/jffs2/
H A Dnodelist.c570 rbtree_postorder_for_each_entry_safe(frag, next, root, rb) { in jffs2_kill_fragtree() function
H A Dreadinode.c548 rbtree_postorder_for_each_entry_safe(tn, next, list, rb) { in jffs2_free_tmp_dnode_info_list() function
/kernel/linux/linux-6.6/fs/jffs2/
H A Dnodelist.c570 rbtree_postorder_for_each_entry_safe(frag, next, root, rb) { in jffs2_kill_fragtree() function
H A Dreadinode.c548 rbtree_postorder_for_each_entry_safe(tn, next, list, rb) { in jffs2_free_tmp_dnode_info_list() function
/kernel/linux/linux-6.6/tools/include/linux/
H A Drbtree.h97 #define rbtree_postorder_for_each_entry_safe(pos, n, root, field) \ macro
/kernel/linux/linux-5.10/fs/ext4/
H A Ddir.c406 rbtree_postorder_for_each_entry_safe(fname, next, root, rb_hash) in free_rb_tree_fname() function
/kernel/linux/linux-6.6/fs/ext4/
H A Ddir.c422 rbtree_postorder_for_each_entry_safe(fname, next, root, rb_hash) in free_rb_tree_fname() function
/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/drivers/md/
H A Ddm-zoned-metadata.c2838 rbtree_postorder_for_each_entry_safe(mblk, next, root, node) { in dmz_cleanup_metadata() function
/kernel/linux/linux-5.10/drivers/net/ethernet/mellanox/mlx5/core/fpga/
H A Dipsec.c1340 rbtree_postorder_for_each_entry_safe(r, tmp, root, node) { in destroy_rules_rb() function
/kernel/linux/linux-5.10/fs/btrfs/
H A Dqgroup.c4401 rbtree_postorder_for_each_entry_safe(entry, next, root, node) { in btrfs_qgroup_destroy_extent_records() function
H A Drelocation.c2565 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks() function
2571 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks() function
2580 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks() function
/kernel/linux/linux-6.6/drivers/md/
H A Ddm-zoned-metadata.c2821 rbtree_postorder_for_each_entry_safe(mblk, next, root, node) { in dmz_cleanup_metadata() function
/kernel/linux/linux-6.6/fs/btrfs/
H A Drelocation.c2789 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks() function
2797 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks() function
2806 rbtree_postorder_for_each_entry_safe(block, next, blocks, rb_node) { in relocate_tree_blocks() function
H A Dqgroup.c4452 rbtree_postorder_for_each_entry_safe(entry, next, root, node) { in btrfs_qgroup_destroy_extent_records() function

Completed in 39 milliseconds