Lines Matching defs:ranges_
88 MemoryTypeTable(MemoryTypeTable&& table) : ranges_(std::move(table.ranges_)) {}
91 ranges_ = std::move(table.ranges_);
98 int last = static_cast<int>(ranges_.size()) - 1;
101 if (address < ranges_[m].Start()) {
103 } else if (address >= ranges_[m].Limit()) {
106 DCHECK(ranges_[m].Contains(address))
107 << reinterpret_cast<void*>(address) << " " << ranges_[m];
108 return &ranges_[m];
114 size_t Size() const { return ranges_.size(); }
117 for (const auto& range : ranges_) {
123 std::vector<MemoryTypeRange<T>> ranges_;
148 inline size_t Size() const { return ranges_.size(); }
153 for (const auto& it : ranges_) {
154 table.ranges_.push_back(it.second);
160 std::map<uintptr_t, MemoryTypeRange<T>> ranges_;
200 succ = ranges_.lower_bound(range.Limit());
203 if (succ == ranges_.begin()) {
205 pred = ranges_.end();
206 } else if (succ != ranges_.end()) {
211 pred = ranges_.find(ranges_.rbegin()->first);
215 if (succ != ranges_.end()) {
221 succ = ranges_.end();
226 if (pred != ranges_.end()) {
231 pred = ranges_.end();
235 if (pred == ranges_.end()) {
236 if (succ == ranges_.end()) {
239 DCHECK(ranges_.find(range.Limit()) == ranges_.end());
240 ranges_[range.Limit()] = range;
245 ranges_.erase(succ);
246 ranges_[limit] = MemoryTypeRange<T>(range.Start(), limit, range.Type());
249 if (succ == ranges_.end()) {
255 ranges_.erase(pred);
256 ranges_[limit] = MemoryTypeRange<T>(start, limit, range.Type());
263 ranges_.erase(pred, ++succ);
264 ranges_[limit] = MemoryTypeRange<T>(start, limit, range.Type());
272 auto it = ranges_.upper_bound(address);
273 if (it != ranges_.end() && it->second.Contains(address)) {
