82     return !f->hashtree().check_block_hash_with_index(n, data);  in is_erasure()
88     auto hashtree = f->hashtree();  in is_zero()  local
90     if (hashtree.hash_data.empty() || unlikely(offset >= f->data_size)) {  in is_zero()
97                  hashtree.hash_data.size() - SHA256_DIGEST_LENGTH)) {  in is_zero()
101     return !memcmp(hashtree.zero_hash.data(), &hashtree.hash_data[hash_offset],  in is_zero()
122     check(!use_erasures || !f->hashtree().hash_data.empty());  in __ecc_read()
183             } else if (f->hashtree().hash_data.empty()) {  in __ecc_read()
292     check(!f->hashtree().hash_data.empty());  in verity_read()
310         (f->hashtree().hash_data.size() - SHA256_DIGEST_LENGTH) /  in verity_read()
332         if (likely(f->hashtree().check_block_hash_with_index(curr, data))) {  in verity_read()
357             f->hashtree().check_block_hash_with_index(curr, data)) {  in verity_read()
364             f->hashtree().check_block_hash_with_index(curr, data)) {  in verity_read()
527     if (!f->hashtree().hash_data.empty()) {  in fec_pread()