Lines Matching refs:root
40 struct rb_root root;
68 static void print_tree(struct rb_root *root)
74 node = ext2fs_rb_first(root);
75 for (node = ext2fs_rb_first(root); node != NULL;
84 static void check_tree(struct rb_root *root, const char *msg)
89 for (node = ext2fs_rb_first(root); node;
133 print_tree(root);
137 #define check_tree(root, msg) do {} while (0)
138 #define print_tree(root, msg) do {} while (0)
181 bp->root = RB_ROOT;
207 static void rb_free_tree(struct rb_root *root)
212 for (node = ext2fs_rb_first(root); node; node = next) {
215 ext2fs_rb_erase(node, root);
226 rb_free_tree(&bp->root);
248 src_node = ext2fs_rb_first(&src_bp->root);
259 n = &dest_bp->root.rb_node;
263 dest_last = ext2fs_rb_last(&dest_bp->root);
268 ext2fs_rb_insert_color(dest_node, &dest_bp->root);
276 static void rb_truncate(__u64 new_max, struct rb_root *root)
281 node = ext2fs_rb_last(root);
288 ext2fs_rb_erase(node, root);
290 node = ext2fs_rb_last(root);
313 rb_truncate(new_real_end, &bp->root);
326 struct rb_node **n = &bp->root.rb_node;
387 struct rb_root *root = &bp->root;
388 struct rb_node *parent = NULL, **n = &root->rb_node;
437 ext2fs_rb_insert_color(new_node, root);
446 ext2fs_rb_erase(node, root);
466 ext2fs_rb_erase(node, root);
473 ext2fs_rb_erase(node, root);
488 struct rb_root *root = &bp->root;
489 struct rb_node *parent = NULL, **n = &root->rb_node;
495 if (EXT2FS_RB_EMPTY_ROOT(root))
528 ext2fs_rb_erase(&ext->node, root);
553 ext2fs_rb_erase(parent, root);
588 check_tree(&bp->root, __func__);
624 check_tree(&bp->root, __func__);
637 n = &bp->root.rb_node;
640 if ((len == 0) || EXT2FS_RB_EMPTY_ROOT(&bp->root))
737 n = &bp->root.rb_node;
740 if (EXT2FS_RB_EMPTY_ROOT(&bp->root))
798 rb_free_tree(&bp->root);
822 node = ext2fs_rb_first(&bp->root);
823 for (node = ext2fs_rb_first(&bp->root); node != NULL;
