Lines Matching defs:root
390 struct rb_root root;
550 bc->trees[i].root = RB_ROOT;
562 WARN_ON_ONCE(!RB_EMPTY_ROOT(&bc->trees[i].root));
592 static struct dm_buffer *__cache_get(const struct rb_root *root, sector_t block)
594 struct rb_node *n = root->rb_node;
620 b = __cache_get(&bc->trees[cache_index(block, bc->num_locks)].root, block);
694 rb_erase(&b->node, &bc->trees[cache_index(b->block, bc->num_locks)].root);
829 static bool __cache_insert(struct rb_root *root, struct dm_buffer *b)
831 struct rb_node **new = &root->rb_node, *parent = NULL;
846 rb_insert_color(&b->node, root);
860 r = __cache_insert(&bc->trees[cache_index(b->block, bc->num_locks)].root, b);
886 rb_erase(&b->node, &bc->trees[cache_index(b->block, bc->num_locks)].root);
899 static struct dm_buffer *__find_next(struct rb_root *root, sector_t block)
901 struct rb_node *n = root->rb_node;
923 struct rb_root *root,
932 b = __find_next(root, begin);
942 rb_erase(&b->node, root);
958 __remove_range(bc, &bc->trees[i].root, begin, end, pred, release);