56 			if (KEY_SIZE(k) + r > c->sb.bucket_size ||  in __ptr_invalid()
77 			if (KEY_SIZE(k) + r > c->sb.bucket_size)  in bch_ptr_status()
91 	if (!KEY_SIZE(k))  in bch_ptr_status()
103 	p("%llu:%llu len %llu -> [", KEY_INODE(k), KEY_START(k), KEY_SIZE(k));  in bch_extent_to_text()
152 	if (!KEY_PTRS(k) || !KEY_SIZE(k) || KEY_DIRTY(k))  in __bch_btree_ptr_invalid()
277 		if (!KEY_SIZE(i->k)) {  in bch_extent_sort_fixup()
332 	BUG_ON(!KEY_SIZE(insert));  in bch_extent_insert_fixup()
340 			if (KEY_SIZE(k))  in bch_extent_insert_fixup()
350 		old_size = KEY_SIZE(k);  in bch_extent_insert_fixup()
360 		if (replace_key && KEY_SIZE(k)) {  in bch_extent_insert_fixup()
405 				       KEY_SIZE(insert));  in bch_extent_insert_fixup()
455 		bch_subtract_dirty(k, c, old_offset, old_size - KEY_SIZE(k));  in bch_extent_insert_fixup()
462 		} else if (sectors_found < KEY_SIZE(insert)) {  in bch_extent_insert_fixup()
464 				       (KEY_SIZE(insert) - sectors_found));  in bch_extent_insert_fixup()
472 					     KEY_SIZE(insert));  in bch_extent_insert_fixup()
481 	if (!KEY_SIZE(k))  in __bch_extent_invalid()
484 	if (KEY_SIZE(k) > KEY_OFFSET(k))  in __bch_extent_invalid()
558 		btree_bug_on(stale && KEY_DIRTY(k) && KEY_SIZE(k),  in bch_extent_bad()
587 		if (l->ptr[i] + PTR(0, KEY_SIZE(l), 0) != r->ptr[i] ||  in bch_extent_merge()
594 	if (KEY_SIZE(l) + KEY_SIZE(r) > USHRT_MAX) {  in bch_extent_merge()
595 		SET_KEY_OFFSET(l, KEY_OFFSET(l) + USHRT_MAX - KEY_SIZE(l));  in bch_extent_merge()
609 	SET_KEY_OFFSET(l, KEY_OFFSET(l) + KEY_SIZE(r));  in bch_extent_merge()
610 	SET_KEY_SIZE(l, KEY_SIZE(l) + KEY_SIZE(r));  in bch_extent_merge()