1066 			  struct btree_iter *k_iter, struct bkey_s_c hash_k)  in hash_check_key()  argument
1075 	if (hash_k.k->type != desc.key_type)  in hash_check_key()
1078 	hash = desc.hash_bkey(hash_info, hash_k);  in hash_check_key()
1080 	if (likely(hash == hash_k.k->p.offset))  in hash_check_key()
1083 	if (hash_k.k->p.offset < hash)  in hash_check_key()
1087 				     SPOS(hash_k.k->p.inode, hash, hash_k.k->p.snapshot),  in hash_check_key()
1089 		if (bkey_eq(k.k->p, hash_k.k->p))  in hash_check_key()
1093 		    !desc.cmp_bkey(k, hash_k))  in hash_check_key()
1108 		     bch2_btree_id_str(desc.btree_id), hash_k.k->p.inode, hash_k.k->p.offset, hash,  in hash_check_key()
1110 		      bch2_bkey_val_to_text(&buf, c, hash_k), buf.buf))) {  in hash_check_key()
1111 		struct bkey_i *new = bch2_bkey_make_mut_noupdate(trans, hash_k);  in hash_check_key()
1116 				       (subvol_inum) { 0, hash_k.k->p.inode },  in hash_check_key()
1117 				       hash_k.k->p.snapshot, new,  in hash_check_key()
1137 	ret = hash_pick_winner(trans, desc, hash_info, hash_k, k);  in hash_check_key()
1145 		       bch2_bkey_val_to_text(&buf, c, hash_k),  in hash_check_key()
1159 		ret = fsck_rename_dirent(trans, s, desc, hash_info, bkey_s_c_to_dirent(hash_k)) ?:  in hash_check_key()