80 	struct block_buffer *buffers = &_buffers[1];  in build_merkle_tree()  local
93 	 * Allocate the block buffers.  Buffer "-1" is for data blocks.  in build_merkle_tree()
94 	 * Buffers 0 <= level < num_levels are for the actual tree levels.  in build_merkle_tree()
98 		buffers[level].data = kzalloc(params->block_size, GFP_KERNEL);  in build_merkle_tree()
99 		if (!buffers[level].data) {  in build_merkle_tree()
104 	buffers[num_levels].data = root_hash;  in build_merkle_tree()
105 	buffers[num_levels].is_root_hash = true;  in build_merkle_tree()
115 		buffers[-1].filled = min_t(u64, params->block_size,  in build_merkle_tree()
117 		bytes_read = __kernel_read(filp, buffers[-1].data,  in build_merkle_tree()
118 					   buffers[-1].filled, &pos);  in build_merkle_tree()
124 		if (bytes_read != buffers[-1].filled) {  in build_merkle_tree()
129 		err = hash_one_block(inode, params, &buffers[-1]);  in build_merkle_tree()
133 			if (buffers[level].filled + params->digest_size <=  in build_merkle_tree()
140 			err = hash_one_block(inode, params, &buffers[level]);  in build_merkle_tree()
144 						      buffers[level].data,  in build_merkle_tree()
159 		if (buffers[level].filled != 0) {  in build_merkle_tree()
160 			err = hash_one_block(inode, params, &buffers[level]);  in build_merkle_tree()
164 						      buffers[level].data,  in build_merkle_tree()
172 	if (WARN_ON_ONCE(buffers[num_levels].filled != params->digest_size)) {  in build_merkle_tree()
179 		kfree(buffers[level].data);  in build_merkle_tree()