Searched defs:extents (Results 1 - 24 of 24) sorted by relevance

/system/update_engine/payload_generator/
H A Dgraph_utils_unittest.cc40 vector<Extent>& extents = graph[0].out_edges[1].extents; local
42 EXPECT_EQ(0U, extents.size());
43 AppendBlockToExtents(&extents, 0);
44 EXPECT_EQ(1U, extents.size());
45 AppendBlockToExtents(&extents, 1);
46 AppendBlockToExtents(&extents, 2);
47 EXPECT_EQ(1U, extents.size());
48 AppendBlockToExtents(&extents, 4);
50 EXPECT_EQ(2U, extents
[all...]
H A Dextent_utils_unittest.cc35 vector<Extent> extents; local
37 EXPECT_EQ(0U, extents.size());
38 AppendBlockToExtents(&extents, kSparseHole);
39 EXPECT_EQ(1U, extents.size());
40 AppendBlockToExtents(&extents, 0);
41 EXPECT_EQ(2U, extents.size());
42 AppendBlockToExtents(&extents, kSparseHole);
43 AppendBlockToExtents(&extents, kSparseHole);
45 ASSERT_EQ(3U, extents.size());
46 EXPECT_EQ(kSparseHole, extents[
56 vector<Extent> extents; local
66 google::protobuf::RepeatedPtrField<Extent> extents; local
97 vector<Extent> extents; local
108 vector<Extent> extents = { local
124 vector<Extent> extents = { local
[all...]
H A Dfilesystem_interface.h62 // between 0 and GetBlockCount() - 1. The blocks are encoded in extents,
64 std::vector<Extent> extents; member in struct:chromeos_update_engine::FilesystemInterface::File
H A Dextent_utils.h32 // into an arbitrary place in the extents.
33 void AppendBlockToExtents(std::vector<Extent>* extents, uint64_t block);
56 std::vector<uint64_t> ExpandExtents(const T& extents) { argument
58 for (size_t i = 0, e = static_cast<size_t>(extents.size()); i != e; ++i) {
59 const Extent extent = GetElement(extents, i);
72 // Stores all Extents in 'extents' into 'out'.
73 void StoreExtents(const std::vector<Extent>& extents,
76 // Stores all extents in |extents| into |out_vector|.
77 void ExtentsToVector(const google::protobuf::RepeatedPtrField<Extent>& extents,
[all...]
H A Dmapfile_filesystem_unittest.cc46 // Checks that all the blocks in |extents| are in the range [0, total_blocks).
47 void ExpectBlocksInRange(const vector<Extent>& extents, uint64_t total_blocks) { argument
48 for (const Extent& extent : extents) {
94 ExpectBlocksInRange(file.extents, fs->GetBlockCount());
97 EXPECT_EQ(map_files["/fileA"].extents,
99 EXPECT_EQ(map_files["/fileB"].extents,
102 map_files["/fileC"].extents,
105 EXPECT_EQ(map_files["/file with spaces"].extents,
107 EXPECT_EQ(map_files["/1234"].extents, (vector<Extent>{ExtentForRange(7, 1)}));
H A Dannotated_operation.cc29 // Output the list of extents as (start_block, num_blocks) in the passed output
32 const google::protobuf::RepeatedPtrField<Extent>& extents) {
33 for (const auto& extent : extents) {
31 OutputExtents(std::ostream* os, const google::protobuf::RepeatedPtrField<Extent>& extents) argument
H A Dfake_filesystem.cc42 const std::vector<Extent> extents) {
45 file.extents = extents;
46 for (const Extent& extent : extents) {
41 AddFile(const std::string& filename, const std::vector<Extent> extents) argument
H A Dext2_filesystem_unittest.cc51 // Checks that all the blocks in |extents| are in the range [0, total_blocks).
52 void ExpectBlocksInRange(const vector<Extent>& extents, uint64_t total_blocks) { argument
53 for (const Extent& extent : extents) {
91 ExpectBlocksInRange(file.extents, fs->GetBlockCount());
94 EXPECT_FALSE(map_files["<free-space>"].extents.empty());
122 ExpectBlocksInRange(file.extents, fs->GetBlockCount());
158 EXPECT_TRUE(map_files["/link-short_symlink"].extents.empty());
159 EXPECT_EQ(1U, BlocksInExtents(map_files["/link-long_symlink"].extents));
162 EXPECT_EQ(map_files["/link-hard-regular-16k"].extents,
163 map_files["/regular-16k"].extents);
[all...]
H A Dgraph_types.h38 // Read-before extents. I.e., blocks in |extents| must be read by the
41 std::vector<Extent> extents; member in struct:chromeos_update_engine::EdgeProperties
43 // Write before extents. I.e., blocks in |write_extents| must be written
49 return extents == that.extents && write_extents == that.write_extents;
H A Dgraph_utils.cc40 const vector<Extent>& extents = local
41 graph[edge.first].out_edges.find(edge.second)->second.extents;
42 for (vector<Extent>::const_iterator it = extents.begin();
43 it != extents.end(); ++it) {
61 AppendBlockToExtents(&edge_it->second.extents, block);
66 const vector<Extent>& extents) {
68 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end();
85 if (it->second.extents.empty()) {
117 DumpExtents(it->second.extents,
64 AddReadBeforeDepExtents(Vertex* src, Vertex::Index dst, const vector<Extent>& extents) argument
[all...]
H A Dextent_utils.cc38 void AppendBlockToExtents(vector<Extent>* extents, uint64_t block) { argument
39 // First try to extend the last extent in |extents|, if any.
40 if (!extents->empty()) {
41 Extent& extent = extents->back();
53 extents->push_back(new_extent);
67 google::protobuf::RepeatedPtrField<Extent>* extents,
71 ExtentsToVector(*extents, &extents_vector);
77 extents->Clear();
78 StoreExtents(extents_vector, extents);
81 // Stores all Extents in 'extents' int
66 ExtendExtents( google::protobuf::RepeatedPtrField<Extent>* extents, const google::protobuf::RepeatedPtrField<Extent>& extents_to_add) argument
82 StoreExtents(const vector<Extent>& extents, google::protobuf::RepeatedPtrField<Extent>* out) argument
91 ExtentsToVector(const google::protobuf::RepeatedPtrField<Extent>& extents, vector<Extent>* out_vector) argument
99 ExtentsToString(const vector<Extent>& extents) argument
107 NormalizeExtents(vector<Extent>* extents) argument
127 ExtentsSublist(const vector<Extent>& extents, uint64_t block_offset, uint64_t block_count) argument
[all...]
H A Ddelta_diff_utils_unittest.cc43 // Writes the |data| in the blocks specified by |extents| on the partition
47 const vector<Extent>& extents,
54 for (const Extent& extent : extents) {
204 // tail (src) and head (dst) of extents. The final block (29) is used for
252 // The expected old and new extents that actually moved. See comment above.
593 // source extents should cover only the first copy of the source file since
692 // There should be only one SOURCE_COPY, with a complicate list of extents.
46 WriteExtents(const string& part_path, const vector<Extent>& extents, off_t block_size, const brillo::Blob& data) argument
H A Dext2_filesystem.cc50 vector<Extent>* extents = static_cast<vector<Extent>*>(priv); local
51 AppendBlockToExtents(extents, *blocknr);
222 &file.extents);
281 AppendBlockToExtents(&inode_file.extents, block);
296 AppendBlockToExtents(&free_space.extents, block);
306 if (ino_file.second.extents.empty())
311 ranges.AddExtents(file.extents);
312 file.extents = ranges.GetExtentsForBlockCount(ranges.blocks());
334 vector<Extent> extents;
338 &extents);
[all...]
H A Dextent_ranges.cc167 void ExtentRanges::AddExtents(const vector<Extent>& extents) { argument
168 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end();
174 void ExtentRanges::SubtractExtents(const vector<Extent>& extents) { argument
175 for (vector<Extent>::const_iterator it = extents.begin(), e = extents.end();
255 vector<Extent> FilterExtentRanges(const vector<Extent>& extents, argument
259 for (Extent extent : extents) {
260 // The extents are sorted by the start_block. We want to iterate all the
H A Dinplace_generator_unittest.cc68 EdgeProperties EdgeWithReadDep(const vector<Extent>& extents) { argument
70 ret.extents = extents;
74 EdgeProperties EdgeWithWriteDep(const vector<Extent>& extents) { argument
76 ret.write_extents = extents;
192 vector<Extent> extents; local
193 AppendBlockToExtents(&extents, 3);
194 AppendBlockToExtents(&extents, 5);
195 AppendBlockToExtents(&extents, 7);
196 StoreExtents(extents, grap
215 vector<Extent> extents; local
[all...]
H A Dinplace_generator.cc83 // their destination extents given the index of the operations in the graph.
133 // Convert read_blocks back to extents
150 (*graph)[edge.first].out_edges[edge.second].extents;
174 // Set src/dst extents and other proto variables for copy operation
176 StoreExtents(cut_edge_properties.extents,
187 (*graph)[edge.first].out_edges[edge.second].extents,
229 AppendBlockToExtents(&edge_it->second.extents, i);
301 bool TempBlocksExistInExtents(const T& extents) { argument
302 for (int i = 0, e = extents.size(); i < e; ++i) {
303 Extent extent = GetElement(extents,
681 const google::protobuf::RepeatedPtrField<Extent>& extents = local
[all...]
H A Ddelta_diff_utils.cc59 // position |*idx_p| of |extents|. If |do_remove| is true, this range will be
63 bool ProcessExtentBlockRange(vector<Extent>* extents, size_t* idx_p, argument
67 uint64_t start_block = (*extents)[idx].start_block();
68 uint64_t num_blocks = (*extents)[idx].num_blocks();
74 extents->erase(extents->begin() + idx);
77 (*extents)[idx].set_num_blocks(num_blocks - range_size);
81 (*extents)[idx].set_start_block(start_block + range_size);
82 (*extents)[idx].set_num_blocks(num_blocks - range_size);
85 (*extents)[id
[all...]
/system/update_engine/payload_consumer/
H A Dbzip_extent_writer.cc28 const vector<Extent>& extents,
37 return next_->Init(fd, extents, block_size);
27 Init(FileDescriptorPtr fd, const vector<Extent>& extents, uint32_t block_size) argument
H A Dbzip_extent_writer_unittest.cc58 vector<Extent> extents; local
62 extents.push_back(extent);
75 EXPECT_TRUE(bzip_writer.Init(fd_, extents, kBlockSize));
105 vector<Extent> extents; local
109 extents.push_back(extent);
113 EXPECT_TRUE(bzip_writer.Init(fd_, extents, kBlockSize));
H A Dxz_extent_writer.cc58 const vector<Extent>& extents,
62 return underlying_writer_->Init(fd, extents, block_size);
57 Init(FileDescriptorPtr fd, const vector<Extent>& extents, uint32_t block_size) argument
H A Dextent_writer_unittest.cc68 vector<Extent> extents; local
72 extents.push_back(extent);
77 EXPECT_TRUE(direct_writer.Init(fd_, extents, kBlockSize));
94 vector<Extent> extents; local
98 extents.push_back(extent);
101 EXPECT_TRUE(direct_writer.Init(fd_, extents, kBlockSize));
120 vector<Extent> extents; local
124 extents.push_back(extent);
127 extents.push_back(extent);
130 extents
175 vector<Extent> extents; local
219 vector<Extent> extents; local
[all...]
H A Ddelta_performer_unittest.cc518 google::protobuf::RepeatedPtrField<Extent> extents; local
520 *(extents.Add()) = ExtentForRange(test[i], test[i + 1]);
525 EXPECT_TRUE(DeltaPerformer::ExtentsToBsdiffPositionsString(extents,
H A Ddelta_performer.cc924 // Create a vector of extents to pass to the ExtentWriter.
925 vector<Extent> extents; local
927 extents.push_back(operation.dst_extents(i));
930 TEST_AND_RETURN_FALSE(writer->Init(target_fd_, extents, block_size_));
1033 // Takes |extents| and fills an empty vector |blocks| with a block index for
1034 // each block in |extents|. For example, [(3, 2), (8, 1)] would give [3, 4, 8].
1035 void ExtentsToBlocks(const RepeatedPtrField<Extent>& extents, argument
1037 for (Extent ext : extents) {
1043 // Takes |extents| and returns the number of blocks in those extents
1044 GetBlockCount(const RepeatedPtrField<Extent>& extents) argument
1149 ExtentsToBsdiffPositionsString( const RepeatedPtrField<Extent>& extents, uint64_t block_size, uint64_t full_length, string* positions_string) argument
[all...]
/system/update_engine/common/
H A Dutils.cc1197 bool ReadExtents(const string& path, const vector<Extent>& extents, argument
1206 for (const Extent& extent : extents) {

Completed in 145 milliseconds