27
27
// 2) Verify the entries are within the appropriate bounds. There's an extra
28
28
// entry after the last item which gives us the length of the last item.
29
29
for (size_t i = 0; i < resource_count_ + 1; ++i) {
31
31
const DataPackEntry* entry = reinterpret_cast<const DataPackEntry*>(
32
32
mmap_->data() + kHeaderLength + (i * sizeof(DataPackEntry)));
33
33
- if (entry->file_offset > mmap_->length()) {