Home
last modified time | relevance | path

Searched refs:chain_ (Results 1 – 2 of 2) sorted by relevance

/system/core/adb/
Dtypes.cpp20 chain_ = std::move(move.chain_); in operator =()
34 if (!chain_.empty()) { in clear()
35 res = std::move(chain_.back()); in clear()
37 chain_.clear(); in clear()
53 const auto next = chain_[start_index_].size() - begin_offset_; in drop_front()
76 while (chain_[start_index_].size() - begin_offset_ <= len) { in take_front()
77 chain_length_ -= chain_[start_index_].size(); in take_front()
78 len -= chain_[start_index_].size() - begin_offset_; in take_front()
79 if (chain_[start_index_].size() > begin_offset_) { in take_front()
80 res.append(std::move(chain_[start_index_])); in take_front()
[all …]
Dtypes.h154 if (chain_.empty()) { in front_data()
158 return chain_[start_index_].data() + begin_offset_; in front_data()
162 if (chain_.empty()) { in front_size()
166 return chain_[start_index_].size() - begin_offset_; in front_size()
188 chain_.emplace_back(std::move(block)); in append()
206 for (size_t i = start_index_; i < chain_.size(); ++i) { in iterate_blocks()
207 const auto& block = chain_[i]; in iterate_blocks()
244 if (chain_.size() == start_index_ + 1) { in coalesced()
246 return f(chain_[start_index_].data() + begin_offset_, size()); in coalesced()
263 std::vector<block_type> chain_; member