21 const char *bch_ptr_status(struct cache_set *c, const struct bkey *k)  in bch_ptr_status()  argument
25 	for (i = 0; i < KEY_PTRS(k); i++)  in bch_ptr_status()
26 		if (ptr_available(c, k, i)) {  in bch_ptr_status()
27 			struct cache *ca = PTR_CACHE(c, k, i);  in bch_ptr_status()
28 			size_t bucket = PTR_BUCKET_NR(c, k, i);  in bch_ptr_status()
29 			size_t r = bucket_remainder(c, PTR_OFFSET(k, i));  in bch_ptr_status()
31 			if (KEY_SIZE(k) + r > c->sb.bucket_size)  in bch_ptr_status()
37 			if (ptr_stale(c, k, i))  in bch_ptr_status()
41 	if (!bkey_cmp(k, &ZERO_KEY))  in bch_ptr_status()
43 	if (!KEY_PTRS(k))  in bch_ptr_status()
45 	if (!KEY_SIZE(k))  in bch_ptr_status()
50 struct keyprint_hack bch_pkey(const struct bkey *k)  in bch_pkey()  argument
58 	p("%llu:%llu len %llu -> [", KEY_INODE(k), KEY_OFFSET(k), KEY_SIZE(k));  in bch_pkey()
60 	if (KEY_PTRS(k))  in bch_pkey()
63 			  PTR_DEV(k, i), PTR_OFFSET(k, i), PTR_GEN(k, i));  in bch_pkey()
65 			if (++i == KEY_PTRS(k))  in bch_pkey()
73 	if (KEY_DIRTY(k))  in bch_pkey()
75 	if (KEY_CSUM(k))  in bch_pkey()
76 		p(" cs%llu %llx", KEY_CSUM(k), k->ptr[1]);  in bch_pkey()
92 static bool skipped_backwards(struct btree *b, struct bkey *k)  in skipped_backwards()  argument
94 	return bkey_cmp(k, (!b->level)  in skipped_backwards()
95 			? &START_KEY(bkey_next(k))  in skipped_backwards()
96 			: bkey_next(k)) > 0;  in skipped_backwards()
101 	struct bkey *k;  in dump_bset()  local
104 	for (k = i->start; k < end(i); k = bkey_next(k)) {  in dump_bset()
106 		       (uint64_t *) k - i->d, i->keys, pkey(k));  in dump_bset()
108 		for (j = 0; j < KEY_PTRS(k); j++) {  in dump_bset()
109 			size_t n = PTR_BUCKET_NR(b->c, k, j);  in dump_bset()
114 				       PTR_BUCKET(b->c, k, j)->prio);  in dump_bset()
117 		printk(" %s\n", bch_ptr_status(b->c, k));  in dump_bset()
119 		if (bkey_next(k) < end(i) &&  in dump_bset()
120 		    skipped_backwards(b, k))  in dump_bset()
243 	struct bkey *k;  in bch_count_data()  local
246 		for_each_key(b, k, &iter)  in bch_count_data()
247 			ret += KEY_SIZE(k);  in bch_count_data()
271 	struct bkey *k;  in bch_check_key_order_msg()  local
276 	for (k = i->start; bkey_next(k) < end(i); k = bkey_next(k))  in bch_check_key_order_msg()
277 		if (skipped_backwards(b, k)) {  in bch_check_key_order_msg()
289 	struct bkey *k, *p = NULL;  in bch_check_keys()  local
295 	for_each_key(b, k, &iter) {  in bch_check_keys()
296 		if (p && bkey_cmp(&START_KEY(p), &START_KEY(k)) > 0) {  in bch_check_keys()
301 		if (bch_ptr_invalid(b, k))  in bch_check_keys()
304 		if (p && bkey_cmp(p, &START_KEY(k)) > 0) {  in bch_check_keys()
308 		p = k;  in bch_check_keys()
330 static bool dump_pred(struct keybuf *buf, struct bkey *k)  in dump_pred()  argument
415 static ssize_t btree_fuzz(struct kobject *k, struct kobj_attribute *a,
469 			struct bkey *k = op.keys.top;
472 			bkey_init(k);
480 			SET_KEY_SIZE(k, bucket_remainder(c, rand));
484 			SET_KEY_OFFSET(k, rand);
486 			SET_KEY_PTRS(k, 1);
522 			struct bkey *k, *l;
524 			for (k = i->start,
526 			     k < end(i);
527 			     k = bkey_next(k), l = bkey_next(l))
528 				if (bkey_cmp(k, l) ||
529 				    KEY_SIZE(k) != KEY_SIZE(l))
531 					       (uint64_t *) k - i->d,
532 					       pkey(k), pkey(l));