130   verity_tree_.emplace_back(std::move(base_level));  in Initialize()
201     if (!HashBlocks(leftover_.data(), leftover_.size(), &verity_tree_[0])) {  in Update()
218   return HashBlocks(data, len, &verity_tree_[0]);  in Update()
231   CHECK_EQ(1, verity_tree_.size());  in BuildHashTree()
240   AppendPaddings(&verity_tree_.back());  in BuildHashTree()
243   CHECK_EQ(base_level_blocks * block_size_, verity_tree_[0].size());  in BuildHashTree()
245   while (verity_tree_.back().size() > block_size_) {  in BuildHashTree()
246     const auto& current_level = verity_tree_.back();  in BuildHashTree()
259     verity_tree_.emplace_back(std::move(next_level));  in BuildHashTree()
262   CHECK_EQ(block_size_, verity_tree_.back().size());  in BuildHashTree()
263   return CalculateRootDigest(verity_tree_.back(), &root_hash_);  in BuildHashTree()
270   for (size_t i = verity_tree_.size(); i > 0; i--) {  in CheckHashTree()
271     const auto& level_blocks = verity_tree_[i - 1];  in CheckHashTree()
307   CHECK(!verity_tree_.empty());  in WriteHashTree()
310   for (size_t i = verity_tree_.size(); i > 0; i--) {  in WriteHashTree()
311     const auto& level_blocks = verity_tree_[i - 1];  in WriteHashTree()
322   CHECK(!verity_tree_.empty());  in WriteHashTreeToFd()