#ifdef __ANDROID__ #include <private/android_filesystem_config.h> // Set this to 0 to interpret 'erase' transfers to mean do a BLKDISCARD ioctl (the normal behavior). // Set to 1 to interpret erase to mean fill the region with zeroes. #define DEBUG_ERASE 0 #else #define DEBUG_ERASE 1 #define AID_SYSTEM -1 #endif// __ANDROID__
// Parse the last command index of the last update and save the result to |last_command_index|. // Return true if we successfully read the index. staticbool ParseLastCommandFile(size_t* last_command_index) { const std::string& last_command_file = Paths::Get().last_command_file();
android::base::unique_fd fd(TEMP_FAILURE_RETRY(open(last_command_file.c_str(), O_RDONLY))); if (fd == -1) { if (errno != ENOENT) {
PLOG(ERROR) << "Failed to open " << last_command_file; returnfalse;
}
// Now that the last_command file exists, parse the last command index of previous update.
std::string content; if (!android::base::ReadFdToString(fd.get(), &content)) {
LOG(ERROR) << "Failed to read: " << last_command_file; returnfalse;
}
std::vector<std::string> lines = android::base::Split(android::base::Trim(content), "\n"); if (lines.size() != 2) {
LOG(ERROR) << "Unexpected line counts in last command file: " << content; returnfalse;
}
if (!android::base::ParseUint(lines[0], last_command_index)) {
LOG(ERROR) << "Failed to parse integer in: " << lines[0]; returnfalse;
}
// Update the last executed command index in the last_command_file. staticbool UpdateLastCommandIndex(size_t command_index, const std::string& command_string) { const std::string& last_command_file = Paths::Get().last_command_file();
std::string last_command_tmp = last_command_file + ".tmp";
std::string content = std::to_string(command_index) + "\n" + command_string;
android::base::unique_fd wfd(
TEMP_FAILURE_RETRY(open(last_command_tmp.c_str(), O_WRONLY | O_CREAT | O_TRUNC, 0660))); if (wfd == -1 || !android::base::WriteStringToFd(content, wfd)) {
PLOG(ERROR) << "Failed to update last command"; returnfalse;
}
if (fsync(wfd) == -1) {
PLOG(ERROR) << "Failed to fsync " << last_command_tmp; returnfalse;
}
if (chown(last_command_tmp.c_str(), AID_SYSTEM, AID_SYSTEM) == -1) {
PLOG(ERROR) << "Failed to change owner for " << last_command_tmp; returnfalse;
}
if (rename(last_command_tmp.c_str(), last_command_file.c_str()) == -1) {
PLOG(ERROR) << "Failed to rename" << last_command_tmp; returnfalse;
}
if (!FsyncDir(android::base::Dirname(last_command_file))) { returnfalse;
}
returntrue;
}
bool SetUpdatedMarker(const std::string& marker) { auto dirname = android::base::Dirname(marker); auto res = mkdir(dirname.c_str(), MARKER_DIRECTORY_MODE); if (res == -1 && errno != EEXIST) {
PLOG(ERROR) << "Failed to create directory for marker: " << dirname; returnfalse;
}
if (!android::base::WriteStringToFile("", marker)) {
PLOG(ERROR) << "Failed to write to marker file " << marker; returnfalse;
} if (!FsyncDir(dirname)) { returnfalse;
}
LOG(INFO) << "Wrote updated marker to " << marker; returntrue;
}
staticbool discard_blocks(int fd, off64_t offset, uint64_t size, bool force = false) { // Don't discard blocks unless the update is a retry run or force == true if (!is_retry && !force) { returntrue;
}
uint64_t args[2] = { static_cast<uint64_t>(offset), size }; if (ioctl(fd, BLKDISCARD, &args) == -1) { // On devices that does not support BLKDISCARD, ignore the error. if (errno == EOPNOTSUPP) { returntrue;
}
PLOG(ERROR) << "BLKDISCARD ioctl failed"; returnfalse;
} returntrue;
}
staticvoid allocate(size_t size, std::vector<uint8_t>* buffer) { // If the buffer's big enough, reuse it. if (size <= buffer->size()) return;
buffer->resize(size);
}
private: // Set up the output cursor, move to next range if needed. bool SeekToOutputRange() { // We haven't finished the current range yet. if (current_range_left_ != 0) { returntrue;
} // We can't write any more; let the write function return how many bytes have been written // so far. if (next_range_ >= tgt_.size()) { returnfalse;
}
if (!discard_blocks(fd_, offset, current_range_left_)) { returnfalse;
} if (!check_lseek(fd_, offset, SEEK_SET)) { returnfalse;
} returntrue;
}
// The output file descriptor. int fd_; // The destination ranges for the data. const RangeSet& tgt_; // The next range that we should write to.
size_t next_range_; // The number of bytes to write before moving to the next range.
size_t current_range_left_; // Total bytes written by the writer.
size_t bytes_written_;
};
while (size > 0) { // Wait for nti->writer to be non-null, indicating some of this data is wanted.
pthread_mutex_lock(&nti->mu); while (nti->writer == nullptr) { // End the new data receiver if we encounter an error when performing block image update. if (!nti->receiver_available) {
pthread_mutex_unlock(&nti->mu); returnfalse;
}
pthread_cond_wait(&nti->cv, &nti->mu);
}
pthread_mutex_unlock(&nti->mu);
// At this point nti->writer is set, and we own it. The main thread is waiting for it to // disappear from nti.
size_t write_now = std::min(size, nti->writer->AvailableSpace()); if (nti->writer->Write(data, write_now) != write_now) {
LOG(ERROR) << "Failed to write " << write_now << " bytes."; returnfalse;
}
data += write_now;
size -= write_now;
if (nti->writer->Finished()) { // We have written all the bytes desired by this writer.
while (size > 0 || BrotliDecoderHasMoreOutput(nti->brotli_decoder_state)) { // Wait for nti->writer to be non-null, indicating some of this data is wanted.
pthread_mutex_lock(&nti->mu); while (nti->writer == nullptr) { // End the receiver if we encounter an error when performing block image update. if (!nti->receiver_available) {
pthread_mutex_unlock(&nti->mu); returnfalse;
}
pthread_cond_wait(&nti->cv, &nti->mu);
}
pthread_mutex_unlock(&nti->mu);
// At this point nti->writer is set, and we own it. The main thread is waiting for it to // disappear from nti.
size_t buffer_size = std::min<size_t>(32768, nti->writer->AvailableSpace()); if (buffer_size == 0) {
LOG(ERROR) << "No space left in output range"; returnfalse;
}
uint8_t buffer[buffer_size];
size_t available_in = size;
size_t available_out = buffer_size;
uint8_t* next_out = buffer;
// The brotli decoder will update |data|, |available_in|, |next_out| and |available_out|.
BrotliDecoderResult result = BrotliDecoderDecompressStream(
nti->brotli_decoder_state, &available_in, &data, &available_out, &next_out, nullptr);
if (result == BROTLI_DECODER_RESULT_ERROR) {
LOG(ERROR) << "Decompression failed with "
<< BrotliDecoderErrorString(BrotliDecoderGetErrorCode(nti->brotli_decoder_state)); returnfalse;
}
// Parameters for transfer list command functions struct CommandParameters {
std::vector<std::string> tokens;
size_t cpos;
std::string cmdname;
std::string cmdline;
std::string freestash;
std::string stashbase; bool canwrite; int createdstash;
android::base::unique_fd fd; bool foundwrites; bool isunresumable; int version;
size_t written;
size_t stashed;
NewThreadInfo nti;
pthread_t thread;
std::vector<uint8_t> buffer;
uint8_t* patch_start; bool target_verified; // The target blocks have expected contents already.
};
// Print the hash in hex for corrupted source blocks (excluding the stashed blocks which is // handled separately). staticvoid PrintHashForCorruptedSourceBlocks(const CommandParameters& params, const std::vector<uint8_t>& buffer) {
LOG(INFO) << "unexpected contents of source blocks in cmd:\n" << params.cmdline;
CHECK(params.tokens[0] == "move" || params.tokens[0] == "bsdiff" ||
params.tokens[0] == "imgdiff");
size_t pos = 0; // Command example: // move <onehash> <tgt_range> <src_blk_count> <src_range> [<loc_range> <stashed_blocks>] // bsdiff <offset> <len> <src_hash> <tgt_hash> <tgt_range> <src_blk_count> <src_range> // [<loc_range> <stashed_blocks>] if (params.tokens[0] == "move") { // src_range for move starts at the 4th position. if (params.tokens.size() < 5) {
LOG(ERROR) << "failed to parse source range in cmd:\n" << params.cmdline; return;
}
pos = 4;
} else { // src_range for diff starts at the 7th position. if (params.tokens.size() < 8) {
LOG(ERROR) << "failed to parse source range in cmd:\n" << params.cmdline; return;
}
pos = 7;
}
// Source blocks in stash only, no work to do. if (params.tokens[pos] == "-") { return;
}
RangeSet src = RangeSet::Parse(params.tokens[pos++]); if (!src) {
LOG(ERROR) << "Failed to parse range in " << params.cmdline; return;
}
RangeSet locs; // If there's no stashed blocks, content in the buffer is consecutive and has the same // order as the source blocks. if (pos == params.tokens.size()) {
locs = RangeSet(std::vector<Range>{ Range{ 0, src.blocks() } });
} else { // Otherwise, the next token is the offset of the source blocks in the target range. // Example: for the tokens <4,63946,63947,63948,63979> <4,6,7,8,39> <stashed_blocks>; // We want to print SHA-1 for the data in buffer[6], buffer[8], buffer[9] ... buffer[38]; // this corresponds to the 32 src blocks #63946, #63948, #63949 ... #63978.
locs = RangeSet::Parse(params.tokens[pos++]);
CHECK_EQ(src.blocks(), locs.blocks());
}
LOG(INFO) << "printing hash in hex for " << src.blocks() << " source blocks"; for (size_t i = 0; i < src.blocks(); i++) {
size_t block_num = src.GetBlockNumber(i);
size_t buffer_index = locs.GetBlockNumber(i);
CHECK_LE((buffer_index + 1) * BLOCKSIZE, buffer.size());
// If the calculated hash for the whole stash doesn't match the stash id, print the SHA-1 // in hex for each block. staticvoid PrintHashForCorruptedStashedBlocks(const std::string& id, const std::vector<uint8_t>& buffer, const RangeSet& src) {
LOG(INFO) << "printing hash in hex for stash_id: " << id;
CHECK_EQ(src.blocks() * BLOCKSIZE, buffer.size());
for (size_t i = 0; i < src.blocks(); i++) {
size_t block_num = src.GetBlockNumber(i);
// If the stash file doesn't exist, read the source blocks this stash contains and print the // SHA-1 for these blocks. staticvoid PrintHashForMissingStashedBlocks(const std::string& id, int fd) { if (stash_map.find(id) == stash_map.end()) {
LOG(ERROR) << "No stash saved for id: " << id; return;
}
LOG(INFO) << "print hash in hex for source blocks in missing stash: " << id; const RangeSet& src = stash_map[id];
std::vector<uint8_t> buffer(src.blocks() * BLOCKSIZE); if (ReadBlocks(src, &buffer, fd) == -1) {
LOG(ERROR) << "failed to read source blocks for stash: " << id; return;
}
PrintHashForCorruptedStashedBlocks(id, buffer, src);
}
// Does a best effort enumeration of stash files. Ignores possible non-file items in the stash // directory and continues despite of errors. Calls the 'callback' function for each file. staticvoid EnumerateStash(const std::string& dirname, const std::function<void(const std::string&)>& callback) { if (dirname.empty()) return;
// Deletes the stash directory and all files in it. Assumes that it only // contains files. There is nothing we can do about unlikely, but possible // errors, so they are merely logged. staticvoid DeleteFile(const std::string& fn) { if (fn.empty()) return;
staticint LoadStash(const CommandParameters& params, const std::string& id, bool verify,
std::vector<uint8_t>* buffer, bool printnoent) { // In verify mode, if source range_set was saved for the given hash, check contents in the source // blocks first. If the check fails, search for the stashed files on /cache as usual. if (!params.canwrite) { if (stash_map.find(id) != stash_map.end()) { const RangeSet& src = stash_map[id];
allocate(src.blocks() * BLOCKSIZE, buffer);
if (ReadBlocks(src, buffer, params.fd) == -1) {
LOG(ERROR) << "failed to read source blocks in stash map."; return -1;
} if (VerifyBlocks(id, *buffer, src.blocks(), true) != 0) {
LOG(ERROR) << "failed to verify loaded source blocks in stash map."; if (!is_retry) {
PrintHashForCorruptedStashedBlocks(id, *buffer, src);
} return -1;
} return0;
}
}
if (exists) { struct stat sb; int res = stat(cn.c_str(), &sb);
if (res == 0) { // The file already exists and since the name is the hash of the contents, // it's safe to assume the contents are identical (accidental hash collisions // are unlikely)
LOG(INFO) << " skipping " << blocks << " existing blocks in " << cn;
*exists = true; return0;
}
// Creates a directory for storing stash files and checks if the /cache partition // hash enough space for the expected amount of blocks we need to store. Returns // >0 if we created the directory, zero if it existed already, and <0 of failure. staticint CreateStash(State* state, size_t maxblocks, const std::string& base) {
std::string dirname = GetStashFileName(base, "", ""); struct stat sb; int res = stat(dirname.c_str(), &sb); if (res == -1 && errno != ENOENT) {
ErrorAbort(state, kStashCreationFailure, "stat \"%s\" failed: %s", dirname.c_str(),
strerror(errno)); return -1;
}
if (chown(dirname.c_str(), AID_SYSTEM, AID_SYSTEM) != 0) { // system user
ErrorAbort(state, kStashCreationFailure, "chown \"%s\" failed: %s", dirname.c_str(),
strerror(errno)); return -1;
}
if (!CheckAndFreeSpaceOnCache(max_stash_size)) {
ErrorAbort(state, kStashCreationFailure, "not enough space for stash (%zu needed)",
max_stash_size); return -1;
}
return1; // Created directory
}
LOG(INFO) << "using existing stash " << dirname;
// If the directory already exists, calculate the space already allocated to stash files and check // if there's enough for all required blocks. Delete any partially completed stash files first.
EnumerateStash(dirname, [](const std::string& fn) { if (android::base::EndsWith(fn, ".partial")) {
DeleteFile(fn);
}
});
// Source contains packed data, which we want to move to the locations given in locs in the dest // buffer. source and dest may be the same buffer. staticvoid MoveRange(std::vector<uint8_t>& dest, const RangeSet& locs, const std::vector<uint8_t>& source) { const uint8_t* from = source.data();
uint8_t* to = dest.data();
size_t start = locs.blocks(); // Must do the movement backward. for (auto it = locs.crbegin(); it != locs.crend(); it++) {
size_t blocks = it->second - it->first;
start -= blocks;
memmove(to + (it->first * BLOCKSIZE), from + (start * BLOCKSIZE), blocks * BLOCKSIZE);
}
}
// <[stash_id:stash_range]> while (params.cpos < params.tokens.size()) { // Each word is a an index into the stash table, a colon, and then a RangeSet describing where // in the source block that stashed data should go.
std::vector<std::string> tokens = android::base::Split(params.tokens[params.cpos++], ":"); if (tokens.size() != 2) {
LOG(ERROR) << "invalid parameter"; return -1;
}
std::vector<uint8_t> stash; if (LoadStash(params, tokens[0], false, &stash, true) == -1) { // These source blocks will fail verification if used later, but we // will let the caller decide if this is a fatal failure
LOG(ERROR) << "failed to load stash " << tokens[0]; continue;
}
// At least it needs to provide three parameters: <tgt_range>, <src_block_count> and // "-"/<src_range>. if (params.cpos + 2 >= params.tokens.size()) {
LOG(ERROR) << "invalid parameters"; return -1;
}
if (VerifyBlocks(srchash, params.buffer, *src_blocks, true) == 0) { // If source and target blocks overlap, stash the source blocks so we can resume from possible // write errors. In verify mode, we can skip stashing because the source blocks won't be // overwritten. if (overlap && params.canwrite) {
LOG(INFO) << "stashing " << *src_blocks << " overlapping blocks to " << srchash;
params.stashed += *src_blocks; // Can be deleted when the write has completed. if (!stash_exists) {
params.freestash = srchash;
}
}
// Source blocks have expected content, command can proceed. return0;
}
if (overlap && LoadStash(params, srchash, true, ¶ms.buffer, true) == 0) { // Overlapping source blocks were previously stashed, command can proceed. We are recovering // from an interrupted command, so we don't know if the stash can safely be deleted after this // command. return0;
}
// Valid source data not available, update cannot be resumed.
LOG(ERROR) << "partition has unexpected contents";
PrintHashForCorruptedSourceBlocks(params, params.buffer);
params.isunresumable = true;
return -1;
}
staticint PerformCommandMove(CommandParameters& params) {
size_t blocks = 0;
RangeSet tgt; int status = LoadSrcTgtVersion3(params, &tgt, &blocks, true);
if (status == -1) {
LOG(ERROR) << "failed to read blocks for move"; return -1;
}
if (status == 0) {
params.foundwrites = true;
} else {
params.target_verified = true; if (params.foundwrites) {
LOG(WARNING) << "warning: commands executed out of order [" << params.cmdname << "]";
}
}
if (params.canwrite) { if (status == 0) {
LOG(INFO) << " moving " << blocks << " blocks";
if (!params.freestash.empty()) {
FreeStash(params.stashbase, params.freestash);
params.freestash.clear();
}
params.written += tgt.blocks();
return0;
}
staticint PerformCommandStash(CommandParameters& params) { // <stash_id> <src_range> if (params.cpos + 1 >= params.tokens.size()) {
LOG(ERROR) << "missing id and/or src range fields in stash command"; return -1;
}
const std::string& id = params.tokens[params.cpos++]; if (LoadStash(params, id, true, ¶ms.buffer, false) == 0) { // Stash file already exists and has expected contents. Do not read from source again, as the // source may have been already overwritten during a previous attempt. return0;
}
if (VerifyBlocks(id, params.buffer, blocks, true) != 0) { // Source blocks have unexpected contents. If we actually need this data later, this is an // unrecoverable error. However, the command that uses the data may have already completed // previously, so the possible failure will occur during source block verification.
LOG(ERROR) << "failed to load source blocks for stash " << id; return0;
}
// In verify mode, we don't need to stash any blocks. if (!params.canwrite) { return0;
}
LOG(INFO) << "stashing " << blocks << " blocks to " << id; int result = WriteStash(params.stashbase, id, blocks, params.buffer, false, nullptr); if (result == 0) {
params.stashed += blocks;
} return result;
}
staticint PerformCommandFree(CommandParameters& params) { // <stash_id> if (params.cpos >= params.tokens.size()) {
LOG(ERROR) << "missing stash id in free command"; return -1;
}
const std::string& id = params.tokens[params.cpos++];
stash_map.erase(id);
if (params.createdstash || params.canwrite) { return FreeStash(params.stashbase, id);
}
return0;
}
staticint PerformCommandZero(CommandParameters& params) { if (params.cpos >= params.tokens.size()) {
LOG(ERROR) << "missing target blocks for zero"; return -1;
}
if (params.cmdname[0] == 'z') { // Update only for the zero command, as the erase command will call // this if DEBUG_ERASE is defined.
params.written += tgt.blocks();
}
return0;
}
staticint PerformCommandNew(CommandParameters& params) { if (params.cpos >= params.tokens.size()) {
LOG(ERROR) << "missing target blocks for new"; return -1;
}
// Computes the hash_tree bytes based on the parameters, checks if the root hash of the tree // matches the expected hash and writes the result to the specified range on the block_device. // Hash_tree computation arguments: // hash_tree_ranges // source_ranges // hash_algorithm // salt_hex // root_hash staticint PerformCommandComputeHashTree(CommandParameters& params) { if (params.cpos + 5 != params.tokens.size()) {
LOG(ERROR) << "Invalid arguments count in hash computation " << params.cmdline; return -1;
}
// Expects the hash_tree data to be contiguous.
RangeSet hash_tree_ranges = RangeSet::Parse(params.tokens[params.cpos++]); if (!hash_tree_ranges || hash_tree_ranges.size() != 1) {
LOG(ERROR) << "Invalid hash tree ranges in " << params.cmdline; return -1;
}
RangeSet source_ranges = RangeSet::Parse(params.tokens[params.cpos++]); if (!source_ranges) {
LOG(ERROR) << "Invalid source ranges in " << params.cmdline; return -1;
}
auto hash_function = HashTreeBuilder::HashFunction(params.tokens[params.cpos++]); if (hash_function == nullptr) {
LOG(ERROR) << "Invalid hash algorithm in " << params.cmdline; return -1;
}
std::vector<unsignedchar> salt;
std::string salt_hex = params.tokens[params.cpos++]; if (salt_hex.empty() || !HashTreeBuilder::ParseBytesArrayFromString(salt_hex, &salt)) {
LOG(ERROR) << "Failed to parse salt in " << params.cmdline; return -1;
}
std::string expected_root_hash = params.tokens[params.cpos++]; if (expected_root_hash.empty()) {
LOG(ERROR) << "Invalid root hash in " << params.cmdline; return -1;
}
// Starts the hash_tree computation.
HashTreeBuilder builder(BLOCKSIZE, hash_function); if (!builder.Initialize(static_cast<int64_t>(source_ranges.blocks()) * BLOCKSIZE, salt)) {
LOG(ERROR) << "Failed to initialize hash tree computation, source " << source_ranges.ToString()
<< ", salt " << salt_hex; return -1;
}
// Iterates through every block in the source_ranges and updates the hash tree structure // accordingly. for (constauto& [begin, end] : source_ranges) {
uint8_t buffer[BLOCKSIZE]; if (!check_lseek(params.fd, static_cast<off64_t>(begin) * BLOCKSIZE, SEEK_SET)) {
PLOG(ERROR) << "Failed to seek to block: " << begin; return -1;
}
for (size_t i = begin; i < end; i++) { if (!android::base::ReadFully(params.fd, buffer, BLOCKSIZE)) {
failure_type = errno == EIO ? kEioFailure : kFreadFailure;
LOG(ERROR) << "Failed to read data in " << begin << ":" << end; return -1;
}
if (!builder.Update(reinterpret_cast<unsignedchar*>(buffer), BLOCKSIZE)) {
LOG(ERROR) << "Failed to update hash tree builder"; return -1;
}
}
}
if (!builder.BuildHashTree()) {
LOG(ERROR) << "Failed to build hash tree"; return -1;
}
std::string root_hash_hex = HashTreeBuilder::BytesArrayToString(builder.root_hash()); if (root_hash_hex != expected_root_hash) {
LOG(ERROR) << "Root hash of the verity hash tree doesn't match the expected value. Expected: "
<< expected_root_hash << ", actual: " << root_hash_hex; return -1;
}
uint64_t write_offset = static_cast<uint64_t>(hash_tree_ranges.GetBlockNumber(0)) * BLOCKSIZE; if (params.canwrite && !builder.WriteHashTreeToFd(params.fd, write_offset)) {
LOG(ERROR) << "Failed to write hash tree to output"; return -1;
}
// TODO(xunchang) validates the written bytes
return0;
}
using CommandFunction = std::function<int(CommandParameters&)>;
using CommandMap = std::unordered_map<Command::Type, CommandFunction>;
staticbool Sha1DevicePath(const std::string& path, uint8_t digest[SHA_DIGEST_LENGTH]) { auto device_name = android::base::Basename(path); auto dm_target_name_path = "/sys/block/" + device_name + "/dm/name";
struct stat sb; if (stat(dm_target_name_path.c_str(), &sb) == 0) { // This is a device mapper target. Use partition name as part of the hash instead. Do not // include extents as part of the hash, because the size of a partition may be shrunk after // the patches are applied.
std::string dm_target_name; if (!android::base::ReadFileToString(dm_target_name_path, &dm_target_name)) {
PLOG(ERROR) << "Cannot read " << dm_target_name_path; returnfalse;
}
SHA1(reinterpret_cast<const uint8_t*>(dm_target_name.data()), dm_target_name.size(), digest); returntrue;
}
if (errno != ENOENT) { // This is a device mapper target, but its name cannot be retrieved.
PLOG(ERROR) << "Cannot get dm target name for " << path; returnfalse;
}
// This doesn't appear to be a device mapper target, but if its name starts with dm-, something // else might have gone wrong. if (android::base::StartsWith(device_name, "dm-")) {
LOG(WARNING) << "Device " << path << " starts with dm- but is not mapped by device-mapper.";
}
// Stash directory should be different for each partition to avoid conflicts when updating // multiple partitions at the same time, so we use the hash of the block device name as the base // directory.
SHA1(reinterpret_cast<const uint8_t*>(path.data()), path.size(), digest); returntrue;
}
std::vector<std::unique_ptr<Value>> args; if (!ReadValueArgs(state, argv, &args)) { return nullptr;
}
// args: // - block device (or file) to modify in-place // - transfer list (blob) // - new data stream (filename within package.zip) // - patch stream (filename within package.zip, must be uncompressed) const std::unique_ptr<Value>& blockdev_filename = args[0]; const std::unique_ptr<Value>& transfer_list_value = args[1]; const std::unique_ptr<Value>& new_data_fn = args[2]; const std::unique_ptr<Value>& patch_data_fn = args[3];
if (blockdev_filename->type != Value::Type::STRING) {
ErrorAbort(state, kArgsParsingFailure, "blockdev_filename argument to %s must be string", name); return StringValue("");
} if (transfer_list_value->type != Value::Type::BLOB) {
ErrorAbort(state, kArgsParsingFailure, "transfer_list argument to %s must be blob", name); return StringValue("");
} if (new_data_fn->type != Value::Type::STRING) {
ErrorAbort(state, kArgsParsingFailure, "new_data_fn argument to %s must be string", name); return StringValue("");
} if (patch_data_fn->type != Value::Type::STRING) {
ErrorAbort(state, kArgsParsingFailure, "patch_data_fn argument to %s must be string", name); return StringValue("");
}
auto updater = state->updater; auto block_device_path = updater->FindBlockDeviceName(blockdev_filename->data); if (block_device_path.empty()) {
LOG(ERROR) << "Block device path for " << blockdev_filename->data << " not found. " << name
<< " failed."; return StringValue("");
}
ZipArchiveHandle za = updater->GetPackageHandle(); if (za == nullptr) { return StringValue("");
}
std::string_view path_data(patch_data_fn->data);
ZipEntry64 patch_entry; if (FindEntry(za, path_data, &patch_entry) != 0) {
LOG(ERROR) << name << "(): no file \"" << patch_data_fn->data << "\" in package"; return StringValue("");
}
params.patch_start = updater->GetMappedPackageAddress() + patch_entry.offset;
std::string_view new_data(new_data_fn->data);
ZipEntry64 new_entry; if (FindEntry(za, new_data, &new_entry) != 0) {
LOG(ERROR) << name << "(): no file \"" << new_data_fn->data << "\" in package"; return StringValue("");
}
// Possibly do return early on retry, by checking the marker. If the update on this partition has // been finished (but interrupted at a later point), there could be leftover on /cache that would // fail the no-op retry.
std::string updated_marker = GetStashFileName(params.stashbase + ".UPDATED", "", ""); if (is_retry) { struct stat sb; int result = stat(updated_marker.c_str(), &sb); if (result == 0) {
LOG(INFO) << "Skipping already updated partition " << block_device_path << " based on marker"; return StringValue("t");
}
} else { // Delete the obsolete marker if any.
std::string err; if (!android::base::RemoveFileIfExists(updated_marker, &err)) {
LOG(ERROR) << "Failed to remove partition updated marker " << updated_marker << ": " << err; return StringValue("");
}
}
static constexpr size_t kTransferListHeaderLines = 4;
std::vector<std::string> lines = android::base::Split(transfer_list_value->data, "\n"); if (lines.size() < kTransferListHeaderLines) {
ErrorAbort(state, kArgsParsingFailure, "too few lines in the transfer list [%zu]",
lines.size()); return StringValue("");
}
// First line in transfer list is the version number. if (!android::base::ParseInt(lines[0], ¶ms.version, 3, 4)) {
LOG(ERROR) << "unexpected transfer list version [" << lines[0] << "]"; return StringValue("");
}
LOG(INFO) << "blockimg version is " << params.version;
// Second line in transfer list is the total number of blocks we expect to write.
size_t total_blocks; if (!android::base::ParseUint(lines[1], &total_blocks)) {
ErrorAbort(state, kArgsParsingFailure, "unexpected block count [%s]", lines[1].c_str()); return StringValue("");
}
if (total_blocks == 0) { return StringValue("t");
}
// Third line is how many stash entries are needed simultaneously.
LOG(INFO) << "maximum stash entries " << lines[2];
// Fourth line is the maximum number of blocks that will be stashed simultaneously
size_t stash_max_blocks; if (!android::base::ParseUint(lines[3], &stash_max_blocks)) {
ErrorAbort(state, kArgsParsingFailure, "unexpected maximum stash blocks [%s]",
lines[3].c_str()); return StringValue("");
}
int res = CreateStash(state, stash_max_blocks, params.stashbase); if (res == -1) { return StringValue("");
}
params.createdstash = res;
// Set up the new data writer. if (params.canwrite) {
params.nti.za = za;
params.nti.entry = new_entry;
params.nti.brotli_compressed = android::base::EndsWith(new_data_fn->data, ".br"); if (params.nti.brotli_compressed) { // Initialize brotli decoder state.
params.nti.brotli_decoder_state = BrotliDecoderCreateInstance(nullptr, nullptr, nullptr);
}
params.nti.receiver_available = true;
// When performing an update, save the index and cmdline of the current command into the // last_command_file. // Upon resuming an update, read the saved index first; then // 1. In verification mode, check if the 'move' or 'diff' commands before the saved index has // the expected target blocks already. If not, these commands cannot be skipped and we need // to attempt to execute them again. Therefore, we will delete the last_command_file so that // the update will resume from the start of the transfer list. // 2. In update mode, skip all commands before the saved index. Therefore, we can avoid deleting // stashes with duplicate id unintentionally (b/69858743); and also speed up the update. // If an update succeeds or is unresumable, delete the last_command_file. bool skip_executed_command = true;
size_t saved_last_command_index; if (!ParseLastCommandFile(&saved_last_command_index)) {
DeleteLastCommandFile(); // We failed to parse the last command. Disallow skipping executed commands.
skip_executed_command = false;
}
int rc = -1;
// Subsequent lines are all individual transfer commands for (size_t i = kTransferListHeaderLines; i < lines.size(); i++) { const std::string& line = lines[i]; if (line.empty()) continue;
// Skip the command if we explicitly set the corresponding function pointer to nullptr, e.g. // "erase" during block_image_verify. if (performer == nullptr) {
LOG(DEBUG) << "skip executing command [" << line << "]"; continue;
}
// Skip all commands before the saved last command index when resuming an update, except for // "new" command. Because new commands read in the data sequentially. if (params.canwrite && skip_executed_command && cmdindex <= saved_last_command_index &&
cmd_type != Command::Type::NEW) {
LOG(INFO) << "Skipping already executed command: " << cmdindex
<< ", last executed command for previous update: " << saved_last_command_index; continue;
}
if (performer(params) == -1) {
LOG(ERROR) << "failed to execute command [" << line << "]"; if (cmd_type == Command::Type::COMPUTE_HASH_TREE && failure_type == kNoCause) {
failure_type = kHashTreeComputationFailure;
} goto pbiudone;
}
// In verify mode, check if the commands before the saved last_command_index have been executed // correctly. If some target blocks have unexpected contents, delete the last command file so // that we will resume the update from the first command in the transfer list. if (!params.canwrite && skip_executed_command && cmdindex <= saved_last_command_index) { // TODO(xunchang) check that the cmdline of the saved index is correct. if ((cmd_type == Command::Type::MOVE || cmd_type == Command::Type::BSDIFF ||
cmd_type == Command::Type::IMGDIFF) &&
!params.target_verified) {
LOG(WARNING) << "Previously executed command " << saved_last_command_index << ": "
<< params.cmdline << " doesn't produce expected target blocks.";
skip_executed_command = false;
DeleteLastCommandFile();
}
}
pbiudone: if (params.canwrite) {
pthread_mutex_lock(¶ms.nti.mu); if (params.nti.receiver_available) {
LOG(WARNING) << "new data receiver is still available after executing all commands.";
}
params.nti.receiver_available = false;
pthread_cond_broadcast(¶ms.nti.cv);
pthread_mutex_unlock(¶ms.nti.mu); int ret = pthread_join(params.thread, nullptr); if (ret != 0) {
LOG(WARNING) << "pthread join returned with " << strerror(ret);
}
constchar* partition = strrchr(block_device_path.c_str(), '/'); if (partition != nullptr && *(partition + 1) != 0) {
updater->WriteToCommandPipe(
android::base::StringPrintf("log bytes_written_%s: %" PRIu64, partition + 1, static_cast<uint64_t>(params.written) * BLOCKSIZE));
updater->WriteToCommandPipe(
android::base::StringPrintf("log bytes_stashed_%s: %" PRIu64, partition + 1, static_cast<uint64_t>(params.stashed) * BLOCKSIZE), true);
} // Delete stash only after successfully completing the update, as it may contain blocks needed // to complete the update later.
DeleteStash(params.stashbase);
DeleteLastCommandFile();
// Create a marker on /cache partition, which allows skipping the update on this partition on // retry. The marker will be removed once booting into normal boot, or before starting next // fresh install. if (!SetUpdatedMarker(updated_marker)) {
LOG(WARNING) << "Failed to set updated marker; continuing";
}
}
pthread_mutex_destroy(¶ms.nti.mu);
pthread_cond_destroy(¶ms.nti.cv);
} elseif (rc == 0) {
LOG(INFO) << "verified partition contents; update may be resumed";
}
if (fsync(params.fd) == -1) {
failure_type = errno == EIO ? kEioFailure : kFsyncFailure;
PLOG(ERROR) << "fsync failed";
} // params.fd will be automatically closed because it's a unique_fd.
if (params.nti.brotli_decoder_state != nullptr) {
BrotliDecoderDestroyInstance(params.nti.brotli_decoder_state);
}
// Delete the last command file if the update cannot be resumed. if (params.isunresumable) {
DeleteLastCommandFile();
}
// Only delete the stash if the update cannot be resumed, or it's a verification run and we // created the stash. if (params.isunresumable || (!params.canwrite && params.createdstash)) {
DeleteStash(params.stashbase);
}
if (blockdev_filename->type != Value::Type::STRING) {
ErrorAbort(state, kArgsParsingFailure, "blockdev_filename argument to %s must be string", name); return StringValue("");
} if (ranges->type != Value::Type::STRING) {
ErrorAbort(state, kArgsParsingFailure, "ranges argument to %s must be string", name); return StringValue("");
}
auto block_device_path = state->updater->FindBlockDeviceName(blockdev_filename->data); if (block_device_path.empty()) {
LOG(ERROR) << "Block device path for " << blockdev_filename->data << " not found. " << name
<< " failed."; return StringValue("");
}
// This function checks if a device has been remounted R/W prior to an incremental // OTA update. This is a common cause of update abortion. The function reads the // 1st block of each partition and check for mounting time/count. It return string "t" // if executes successfully and an empty string otherwise.
if (arg_filename->type != Value::Type::STRING) {
ErrorAbort(state, kArgsParsingFailure, "filename argument to %s must be string", name); return StringValue("");
}
auto block_device_path = state->updater->FindBlockDeviceName(arg_filename->data); if (block_device_path.empty()) {
LOG(ERROR) << "Block device path for " << arg_filename->data << " not found. " << name
<< " failed."; return StringValue("");
}
// https://ext4.wiki.kernel.org/index.php/Ext4_Disk_Layout // Super block starts from block 0, offset 0x400 // 0x2C: len32 Mount time // 0x30: len32 Write time // 0x34: len16 Number of mounts since the last fsck // 0x38: len16 Magic signature 0xEF53
// If we want to be able to recover from a situation where rewriting a corrected // block doesn't guarantee the same data will be returned when re-read later, we // can save a copy of corrected blocks to /cache. Note: // // 1. Maximum space required from /cache is the same as the maximum number of // corrupted blocks we can correct. For RS(255, 253) and a 2 GiB partition, // this would be ~16 MiB, for example. // // 2. To find out if this block was corrupted, call fec_get_status after each // read and check if the errors field value has increased.
}
}
LOG(INFO) << "..." << block_device_path << " image recovered successfully."; return StringValue("t");
}
Die Informationen auf dieser Webseite wurden
nach bestem Wissen sorgfältig zusammengestellt. Es wird jedoch weder Vollständigkeit, noch Richtigkeit,
noch Qualität der bereit gestellten Informationen zugesichert.
Bemerkung:
Die farbliche Syntaxdarstellung und die Messung sind noch experimentell.