Lines Matching refs:root
361 * Similarly if we're writing a new btree root - the pointer is going to
364 * But if we're writing a new btree node (that isn't a root) or
519 #define mca_reserve(c) (((!IS_ERR_OR_NULL(c->root) && c->root->level) \
520 ? c->root->level : 1) * 8 + 16)
885 * cannibalize_bucket() will take. This means every time we unlock the root of
1059 BUG_ON(b == b->c->root);
1183 unsigned int reserve = (c->root->level - b->level) * 2 + 1;
1935 /* root node keys are checked before thread created */
1936 bch_btree_iter_init(&c->root->keys, &iter, NULL);
1937 k = bch_btree_iter_next_filter(&iter, &c->root->keys, bch_ptr_bad);
1943 * Fetch a root node key index, skip the keys which
1956 &c->root->keys,
1962 * No more keys to check in root node,
1978 btree_node_prefetch(c->root, p);
1981 ret = bcache_btree(check_recurse, p, c->root, &op);
2031 /* check and mark root node keys */
2032 for_each_key_filter(&c->root->keys, k, &iter, bch_ptr_invalid)
2033 bch_initial_mark_key(c, c->root->level, k);
2035 bch_initial_mark_key(c, c->root->level + 1, &c->root->key);
2037 if (c->root->level == 0)
2049 rw_lock(0, c->root, c->root->level);
2092 rw_unlock(0, c->root);
2293 /* Depth increases, make a new root */
2308 /* Split a non root node */
2381 op->lock = b->c->root->level + 1;
2383 } else if (op->lock <= b->c->root->level) {
2384 op->lock = b->c->root->level + 1;
2508 b->c->root = b;