Lines Matching full:ranges
127 /// two ranges into [0, 3) which is memset'able.
191 /// Ranges - A sorted list of the memset ranges. We use std::list here
193 std::list<MemsetRange> Ranges;
200 const_iterator begin() const { return Ranges.begin(); }
201 const_iterator end() const { return Ranges.end(); }
202 bool empty() const { return Ranges.empty(); }
233 /// existing ranges as appropriate.
235 /// Do a linear search of the ranges to see if this can be joined and/or to
236 /// find the insertion point in the list. We keep the ranges sorted for
238 /// however the number of ranges is limited, so this won't get crazy slow.
242 range_iterator I = Ranges.begin(), E = Ranges.end();
251 MemsetRange &R = *Ranges.insert(I, MemsetRange());
291 Ranges.erase(NextI);
370 // Join these together into ranges, so we can decide whether contiguous blocks
372 MemsetRanges Ranges(*TD);
399 Ranges.addStore(Offset, NextStore);
412 Ranges.addMemSet(Offset, MSI);
416 // If we have no ranges, then we just had a single store with nothing that
418 if (Ranges.empty())
424 Ranges.addInst(0, StartInst);
431 // Now that we have full information about ranges, loop over the ranges and
434 for (MemsetRanges::const_iterator I = Ranges.begin(), E = Ranges.end();
