HomeSort by relevance Sort by last modified time
    Searched refs:new_extents (Results 1 - 9 of 9) sorted by null

  /external/bsdiff/
bspatch_main.cc 16 const char* new_extents = NULL; local
23 new_extents = argv[5];
26 return bsdiff::bspatch(argv[1], argv[2], argv[3], old_extents, new_extents);
bspatch.h 19 const char* new_extents);
28 const std::vector<ex_t>& new_extents);
bspatch.cc 125 const std::vector<ex_t>& new_extents) {
138 if (old_extents.empty() && new_extents.empty())
142 for (ex_t new_ex : new_extents)
153 const char* old_extents, const char* new_extents) {
161 int using_extents = (old_extents != NULL || new_extents != NULL);
246 if (!ParseExtentStr(new_extents, &parsed_new_extents))
  /system/update_engine/payload_generator/
extent_utils.cc 108 vector<Extent> new_extents; local
110 if (new_extents.empty()) {
111 new_extents.push_back(curr_ext);
114 Extent& last_ext = new_extents.back();
121 new_extents.push_back(curr_ext);
124 *extents = new_extents;
delta_diff_utils.h 76 // stored in |new_part| in the blocks described by |new_extents| and, if it
84 const std::vector<Extent>& new_extents,
91 // |new_extents| from |new_part| and determines the smallest way to encode
92 // this |new_extents| for the diff. It stores necessary data in |out_data| and
97 // |new_extents| must not be empty. Returns true on success.
101 const std::vector<Extent>& new_extents,
delta_diff_utils_unittest.cc 170 vector<Extent> new_extents = { ExtentForRange(1, 1) }; local
173 EXPECT_TRUE(WriteExtents(new_part_.path, new_extents, kBlockSize, data_blob));
181 new_extents,
214 vector<Extent> new_extents = { local
222 EXPECT_EQ(num_blocks, BlocksInExtents(new_extents));
232 EXPECT_TRUE(WriteExtents(new_part_.path, new_extents, kBlockSize, file_data));
240 new_extents,
257 new_extents = {
274 EXPECT_EQ(new_extents.size(), static_cast<size_t>(op.dst_extents_size()));
276 EXPECT_EQ(new_extents[i].start_block(), op.dst_extents(i).start_block()
290 vector<Extent> new_extents = { ExtentForRange(2, 1) }; local
326 vector<Extent> new_extents = { ExtentForRange(2, 1) }; local
381 vector<Extent> new_extents = { ExtentForRange(1, 1) }; local
411 vector<Extent> new_extents = { ExtentForRange(2, 1) }; local
    [all...]
extent_ranges.cc 128 ExtentSet new_extents; local
144 new_extents.insert(*jt);
149 extent_set_.insert(new_extents.begin(), new_extents.end());
inplace_generator.cc 75 vector<Extent> new_extents; local
77 AppendBlockToExtents(&new_extents, block);
79 return new_extents;
135 vector<Extent> new_extents = CompressExtents(read_blocks); local
136 StoreExtents(new_extents, vertex->aop.op.mutable_src_extents());
565 // |new_extents| list of blocks and update the graph.
567 vector<Extent> new_extents; local
569 &new_extents);
575 new_extents,
delta_diff_utils.cc 375 vector<Extent>{extent}, // new_extents
435 const vector<Extent>& new_extents,
443 uint64_t total_blocks = BlocksInExtents(new_extents);
456 new_extents, block_offset, chunk_blocks);
553 const vector<Extent>& new_extents,
559 // We read blocks from old_extents and write blocks to new_extents.
561 uint64_t blocks_to_write = BlocksInExtents(new_extents);
584 vector<Extent> dst_extents = new_extents;
589 new_extents,

Completed in 341 milliseconds