size_tree 1249 fs/ubifs/recovery.c struct rb_node **p = &c->size_tree.rb_node, *parent = NULL; size_tree 1271 fs/ubifs/recovery.c rb_insert_color(&e->rb, &c->size_tree); size_tree 1283 fs/ubifs/recovery.c struct rb_node *p = c->size_tree.rb_node; size_tree 1309 fs/ubifs/recovery.c rb_erase(&e->rb, &c->size_tree); size_tree 1321 fs/ubifs/recovery.c rbtree_postorder_for_each_entry_safe(e, n, &c->size_tree, rb) { size_tree 1326 fs/ubifs/recovery.c c->size_tree = RB_ROOT; size_tree 1512 fs/ubifs/recovery.c rb_erase(&e->rb, &c->size_tree); size_tree 1530 fs/ubifs/recovery.c struct rb_node *this = rb_first(&c->size_tree); size_tree 1583 fs/ubifs/recovery.c rb_erase(&e->rb, &c->size_tree); size_tree 2104 fs/ubifs/super.c c->size_tree = RB_ROOT; size_tree 1490 fs/ubifs/ubifs.h struct rb_root size_tree;