md/bcache/btree.c

103 #define insert_lock(s, b)	((b)->level <= (s)->lock)
114 	if (b->level && b->keys.nsets)
518 #define mca_reserve(c)	(((!IS_ERR_OR_NULL(c->root) && c->root->level) \
519 			  ? c->root->level : 1) * 8 + 16)
568 	return -cmp_int(a->level, b->level) ?: bkey_cmp(&a->key, &b->key);
575 	printk(KERN_CONT " l=%u %llu:%llu", b->level,
922 			       struct bkey *k, int level)
967 	lock_set_subclass(&b->lock.dep_map, level + 1, _THIS_IP_);
971 	b->level	= level;
973 	if (!b->level)
999  * level and op->lock.
1005 				 struct bkey *k, int level, bool write,
1011 	BUG_ON(level < 0);
1020 		b = mca_alloc(c, op, k, level);
1033 		rw_lock(write, b, level);
1038 		BUG_ON(b->level != level);
1066 	b = mca_alloc(parent->c, NULL, k, parent->level - 1);
1119 				     int level, bool wait,
1135 	b = mca_alloc(c, op, &k.key, level);
1162 					  struct btree_op *op, int level,
1165 	return __bch_btree_node_alloc(c, op, level, op != NULL, parent);
1171 	struct btree *n = bch_btree_node_alloc(b->c, op, b->level, b->parent);
1206 	unsigned int reserve = (c->root->level - b->level) * 2 + 1;
1225 static uint8_t __bch_btree_mark_key(struct cache_set *c, int level,
1255 			     (GC_MARK(g) == GC_MARK_METADATA) != (level != 0),
1256 			     c, "inconsistent ptrs: mark = %llu, level = %i",
1257 			     GC_MARK(g), level);
1259 		if (level)
1277 #define btree_mark_key(b, k)	__bch_btree_mark_key(b->c, b->level, k)
1279 void bch_initial_mark_key(struct cache_set *c, int level, struct bkey *k)
1290 			if (level && bkey_cmp(k, &ZERO_KEY))
1292 			else if (!level && b->prio == BTREE_PRIO)
1296 	__bch_btree_mark_key(c, level, k);
1624 			r->b = bch_btree_node_get(b->c, op, k, b->level - 1,
1649 			if (last->b->level) {
1718 	__bch_btree_mark_key(b->c, b->level + 1, &b->key);
1720 	if (b->level) {
1920 		bch_initial_mark_key(b->c, b->level, k);
1922 	bch_initial_mark_key(b->c, b->level + 1, &b->key);
1924 	if (b->level) {
2062 		bch_initial_mark_key(c, c->root->level, k);
2064 	bch_initial_mark_key(c, c->root->level + 1, &c->root->key);
2066 	if (c->root->level == 0)
2078 	rw_lock(0, c->root, c->root->level);
2209 			if (!b->level)
2231 	BUG_ON(!bch_keylist_empty(insert_keys) && b->level);
2251 		if (!b->level)
2269 		n2 = bch_btree_node_alloc(b->c, op, b->level, b->parent);
2274 			n3 = bch_btree_node_alloc(b->c, op, b->level + 1, NULL);
2361 	WARN(1, "bcache: btree split failed (level %u)", b->level);
2378 	BUG_ON(b->level && replace_key);
2396 		if (!b->level)
2410 		op->lock = b->c->root->level + 1;
2412 	} else if (op->lock <= b->c->root->level) {
2413 		op->lock = b->c->root->level + 1;
2440 		rw_lock(true, b, b->level);
2444 			op->lock = b->level;
2551 	if (b->level) {
2568 	if (!b->level || flags == MAP_ALL_NODES)
2592 		ret = !b->level
2602 	if (!b->level && (flags & MAP_END_KEY))