Lines Matching refs:extents
46 // TODO(*): Optimize this so we don't have to read all extents into memory in
49 const vector<Extent> extents,
52 brillo::Blob data(utils::BlocksInExtents(extents) * block_size);
54 utils::ReadExtents(in_path, extents, &data, data.size(), block_size));
64 utils::BlocksInExtents(file.extents) >=
69 file.extents[0].start_block() * kBlockSize,
81 // We have to shift all the Extents in |files|, based on the Extents of the
86 ShiftExtentsOverExtents(file.extents, &in_file.extents));
88 ShiftBitExtentsOverExtents(file.extents, &in_file.deflates));
91 num_blocks += utils::BlocksInExtents(in_file.extents);
95 TEST_AND_RETURN_FALSE(utils::BlocksInExtents(file.extents) == num_blocks);
197 vector<BitExtent> FindDeflates(const vector<Extent>& extents,
202 for (const auto& extent : extents) {
212 bool CompactDeflates(const vector<Extent>& extents,
217 for (const auto& extent : extents) {
228 // All given |in_deflates| items should've been inside one of the extents in
229 // |extents|.
242 bool FindAndCompactDeflates(const vector<Extent>& extents,
245 auto found_deflates = FindDeflates(extents, in_deflates);
246 TEST_AND_RETURN_FALSE(CompactDeflates(extents, found_deflates, out_deflates));
265 CopyExtentsToFile(part.path, file.extents, path.value(), kBlockSize));
301 file.extents,
303 kBlockSize * utils::BlocksInExtents(file.extents),
310 // extents in a continuous buffer later.
312 ShiftBitExtentsOverExtents(file.extents, &deflates_sub_blocks));
