mapping_tree
for (node = rb_first_cached(&fs_info->mapping_tree); node; node = rb_next(node)) {
node_chunk = rb_first_cached(&fs_info->mapping_tree);
node = rb_first_cached(&fs_info->mapping_tree);
fs_info->mapping_tree = RB_ROOT_CACHED;
struct rb_root_cached mapping_tree;
struct mapping_tree reloc_root_tree;
n = rb_last(&fs_info->mapping_tree.rb_root);
struct rb_node *node = fs_info->mapping_tree.rb_root.rb_node;
rb_erase_cached(&map->rb_node, &fs_info->mapping_tree);
exist = rb_find_add_cached(&map->rb_node, &fs_info->mapping_tree,
while (!RB_EMPTY_ROOT(&fs_info->mapping_tree.rb_root)) {
node = rb_first_cached(&fs_info->mapping_tree);
rb_erase_cached(&map->rb_node, &fs_info->mapping_tree);
for (node = rb_first_cached(&fs_info->mapping_tree); node; node = rb_next(node)) {