diff options
author | Tao Bao <tbao@google.com> | 2017-11-09 21:49:09 +0100 |
---|---|---|
committer | android-build-merger <android-build-merger@google.com> | 2017-11-09 21:49:09 +0100 |
commit | c5df2675992904311414f1c10bf74373d95d6dfb (patch) | |
tree | 43e27828da1a0f5066e141741d92ecaf1315582f /otautil/rangeset.cpp | |
parent | Merge "otautil: Remove the aborts in RangeSet::Parse()." am: 16b8b8fd1c (diff) | |
parent | Merge "Load-balancing update_verifier worker threads." (diff) | |
download | android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.tar android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.tar.gz android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.tar.bz2 android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.tar.lz android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.tar.xz android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.tar.zst android_bootable_recovery-c5df2675992904311414f1c10bf74373d95d6dfb.zip |
Diffstat (limited to 'otautil/rangeset.cpp')
-rw-r--r-- | otautil/rangeset.cpp | 40 |
1 files changed, 40 insertions, 0 deletions
diff --git a/otautil/rangeset.cpp b/otautil/rangeset.cpp index 532cba4a8..96955b9d0 100644 --- a/otautil/rangeset.cpp +++ b/otautil/rangeset.cpp @@ -103,6 +103,46 @@ void RangeSet::Clear() { blocks_ = 0; } +std::vector<RangeSet> RangeSet::Split(size_t groups) const { + if (ranges_.empty() || groups == 0) return {}; + + if (blocks_ < groups) { + groups = blocks_; + } + + // Evenly distribute blocks, with the first few groups possibly containing one more. + size_t mean = blocks_ / groups; + std::vector<size_t> blocks_per_group(groups, mean); + std::fill_n(blocks_per_group.begin(), blocks_ % groups, mean + 1); + + std::vector<RangeSet> result; + + // Forward iterate Ranges and fill up each group with the desired number of blocks. + auto it = ranges_.cbegin(); + Range range = *it; + for (const auto& blocks : blocks_per_group) { + RangeSet buffer; + size_t needed = blocks; + while (needed > 0) { + size_t range_blocks = range.second - range.first; + if (range_blocks > needed) { + // Split the current range and don't advance the iterator. + buffer.PushBack({ range.first, range.first + needed }); + range.first = range.first + needed; + break; + } + buffer.PushBack(range); + it++; + if (it != ranges_.cend()) { + range = *it; + } + needed -= range_blocks; + } + result.push_back(std::move(buffer)); + } + return result; +} + std::string RangeSet::ToString() const { if (ranges_.empty()) { return ""; |