Lines Matching full:aranges
78 Aranges.reserve(count);
79 AddArangeDescriptors range_adder(Aranges);
102 const Range &range = Aranges[i];
114 if (!Aranges.empty()) {
115 if (Aranges.back().Offset == offset && Aranges.back().HiPC() == low_pc) {
116 Aranges.back().setHiPC(high_pc);
120 Aranges.push_back(Range(low_pc, high_pc, offset));
124 const size_t orig_arange_size = Aranges.size();
129 std::stable_sort(Aranges.begin(), Aranges.end(), RangeLessThan);
146 if (!Range::SortedOverlapCheck(Aranges[i-1], Aranges[i], n))
150 // If the sizes are the same, then no consecutive aranges can be
159 minimal_aranges[j] = Aranges[0];
161 if(Range::SortedOverlapCheck (minimal_aranges[j], Aranges[i], n)) {
162 minimal_aranges[j].setHiPC (Aranges[i].HiPC());
165 minimal_aranges[++j] = Aranges[i];
170 // Now swap our new minimal aranges into place. The local
173 minimal_aranges.swap(Aranges);
177 if (!Aranges.empty()) {
179 RangeCollIterator begin = Aranges.begin();
180 RangeCollIterator end = Aranges.end();
196 if (Aranges.empty())
200 RangeCollIterator begin = Aranges.begin();
201 for (RangeCollIterator pos = begin, end = Aranges.end(); pos != end;
208 LoPC = Aranges.front().LoPC;
210 HiPC = Aranges.back().HiPC();
215 if (Aranges.empty())
218 LoPC = Aranges.front().LoPC;
220 HiPC = Aranges.back().HiPC();
