Home
last modified time | relevance | path

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

/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), \
/linux/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/fs/btrfs/
H A Dref-verify.c104 return rb_entry_safe(node, struct block_entry, node); in insert_block_entry()
112 return rb_entry_safe(node, struct block_entry, node); in lookup_block_entry()
141 return rb_entry_safe(node, struct root_entry, node); in insert_root_entry()
179 return rb_entry_safe(node, struct ref_entry, node); in insert_ref_entry()
187 return rb_entry_safe(node, struct root_entry, node); in lookup_root_entry()
H A Dulist.c150 return rb_entry_safe(node, struct ulist_node, rb_node); in ulist_rbtree_search()
H A Ddelayed-inode.c396 return rb_entry_safe(node, struct btrfs_delayed_item, rb_node); in __btrfs_lookup_delayed_item()
479 return rb_entry_safe(p, struct btrfs_delayed_item, rb_node); in __btrfs_first_delayed_insertion_item()
487 return rb_entry_safe(p, struct btrfs_delayed_item, rb_node); in __btrfs_first_delayed_deletion_item()
495 return rb_entry_safe(p, struct btrfs_delayed_item, rb_node); in __btrfs_next_delayed_item()
H A Dextent_map.c376 merge = rb_entry_safe(rb, struct extent_map, rb_node); in try_merge_map()
394 merge = rb_entry_safe(rb, struct extent_map, rb_node); in try_merge_map()
H A Ddefrag.c189 entry = rb_entry_safe(parent, struct inode_defrag, rb_node); in btrfs_pick_defrag_inode()
H A Dbackref.c3163 while ((node = rb_entry_safe(rb_first(&cache->rb_root), in btrfs_backref_release_cache()
H A Dqgroup.c183 return rb_entry_safe(node, struct btrfs_qgroup, node); in find_qgroup_rb()
/linux/mm/
H A Dvmalloc.c1059 va = rb_entry_safe(node, struct vmap_area, rb_node); in get_subtree_max_size()
4794 return rb_entry_safe(n, struct vmap_area, rb_node); in node_to_va()
/linux/include/linux/
H A Dskbuff.h4154 #define rb_to_skb(rb) rb_entry_safe(rb, struct sk_buff, rbnode)
/linux/kernel/events/
H A Dcore.c1958 for (event = rb_entry_safe(rb_first(&((groups)->tree)), \
1960 event = rb_entry_safe(rb_next(&event->group_node), \