Lines Matching defs:level
104 #define insert_lock(s, b) ((b)->level <= (s)->lock)
115 if (b->level && b->keys.nsets)
519 #define mca_reserve(c) (((!IS_ERR_OR_NULL(c->root) && c->root->level) \
520 ? c->root->level : 1) * 8 + 16)
571 return -cmp_int(a->level, b->level) ?: bkey_cmp(&a->key, &b->key);
578 printk(KERN_CONT " l=%u %llu:%llu", b->level,
920 struct bkey *k, int level)
965 lock_set_subclass(&b->lock.dep_map, level + 1, _THIS_IP_);
969 b->level = level;
971 if (!b->level)
997 * level and op->lock.
1003 struct bkey *k, int level, bool write,
1009 BUG_ON(level < 0);
1018 b = mca_alloc(c, op, k, level);
1031 rw_lock(write, b, level);
1036 BUG_ON(b->level != level);
1064 b = mca_alloc(parent->c, NULL, k, parent->level - 1);
1117 int level, bool wait,
1133 b = mca_alloc(c, op, &k.key, level);
1160 struct btree_op *op, int level,
1163 return __bch_btree_node_alloc(c, op, level, op != NULL, parent);
1169 struct btree *n = bch_btree_node_alloc(b->c, op, b->level, b->parent);
1204 unsigned int reserve = (c->root->level - b->level) * 2 + 1;
1223 static uint8_t __bch_btree_mark_key(struct cache_set *c, int level,
1253 (GC_MARK(g) == GC_MARK_METADATA) != (level != 0),
1254 c, "inconsistent ptrs: mark = %llu, level = %i",
1255 GC_MARK(g), level);
1257 if (level)
1275 #define btree_mark_key(b, k) __bch_btree_mark_key(b->c, b->level, k)
1277 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k)
1288 if (level && bkey_cmp(k, &ZERO_KEY))
1290 else if (!level && b->prio == BTREE_PRIO)
1294 __bch_btree_mark_key(c, level, k);
1621 r->b = bch_btree_node_get(b->c, op, k, b->level - 1,
1646 if (last->b->level) {
1715 __bch_btree_mark_key(b->c, b->level + 1, &b->key);
1717 if (b->level) {
1912 bch_initial_mark_key(b->c, b->level, k);
1914 bch_initial_mark_key(b->c, b->level + 1, &b->key);
1916 if (b->level) {
2054 bch_initial_mark_key(c, c->root->level, k);
2056 bch_initial_mark_key(c, c->root->level + 1, &c->root->key);
2058 if (c->root->level == 0)
2070 rw_lock(0, c->root, c->root->level);
2201 if (!b->level)
2223 BUG_ON(!bch_keylist_empty(insert_keys) && b->level);
2243 if (!b->level)
2261 n2 = bch_btree_node_alloc(b->c, op, b->level, b->parent);
2266 n3 = bch_btree_node_alloc(b->c, op, b->level + 1, NULL);
2353 WARN(1, "bcache: btree split failed (level %u)", b->level);
2370 BUG_ON(b->level && replace_key);
2388 if (!b->level)
2402 op->lock = b->c->root->level + 1;
2404 } else if (op->lock <= b->c->root->level) {
2405 op->lock = b->c->root->level + 1;
2432 rw_lock(true, b, b->level);
2436 op->lock = b->level;
2543 if (b->level) {
2560 if (!b->level || flags == MAP_ALL_NODES)
2583 ret = !b->level
2593 if (!b->level && (flags & MAP_END_KEY))