160     for (auto level = std::prev(levels.end()); level != levels.begin();  in VerifyHashtree()  local
161          level--) {  in VerifyHashtree()
162       std::prev(level)->comparing_tree_offset =  in VerifyHashtree()
163           level->comparing_tree_offset + level->level_size;  in VerifyHashtree()
188     for (auto level = levels.begin(); true; level++) {  in VerifyHashtree()  local
190           level->calculating_hash_block.data() + level->calculating_offset;  in VerifyHashtree()
196       if (std::next(level) == levels.end()) {  in VerifyHashtree()
202       level->calculating_offset += padded_digest_size;  in VerifyHashtree()
206             level->calculating_hash_block.data() + level->calculating_offset, 0,  in VerifyHashtree()
207             level->calculating_hash_block.size() - level->calculating_offset);  in VerifyHashtree()
208       } else if (level->calculating_offset <  in VerifyHashtree()
209                  level->calculating_hash_block.size()) {  in VerifyHashtree()
221                   tree_offset + level->comparing_tree_offset));  in VerifyHashtree()
225             (unsigned long long)tree_offset + level->comparing_tree_offset);  in VerifyHashtree()
233         if (level == levels.begin() &&  in VerifyHashtree()
239                    level->calculating_hash_block.data() + offset,  in VerifyHashtree()
243               (unsigned long long)tree_offset + level->comparing_tree_offset,  in VerifyHashtree()
248       level->calculating_offset = 0;  in VerifyHashtree()
249       level->comparing_tree_offset += hash_block_size;  in VerifyHashtree()
250       if (level->comparing_tree_offset > tree_size) {  in VerifyHashtree()