Lines Matching refs:Ranges
487 // live-range starts. If there are no intervening live ranges between them in
576 LiveInterval::Ranges::iterator BI =
577 std::upper_bound(IntB.ranges.begin(), IntB.ranges.end(), AI->start);
578 if (BI != IntB.ranges.begin())
580 for (; BI != IntB.ranges.end() && AI->end >= BI->start; ++BI) {
778 // Extend BValNo by merging in IntA live ranges of AValNo. Val# definition
1073 // ranges. The data structure performance is really bad when that
1076 LIS->getInterval(CP.getDstReg()).ranges.size() > 1000) {
1216 if (!CP.getSubIdx() && LIS->getInterval(CP.getSrcReg()).ranges.size() >
1217 LIS->getInterval(CP.getDstReg()).ranges.size())
1235 // If we can eliminate the copy without merging the live ranges, do so now.
1268 // ranges for this, and they are preserved.
1302 /// ranges
1431 // than the full interfeence check below. We allow overlapping live ranges
1454 // Check that LHS ranges beginning in this range are copies.
1470 // Compute the final value assignment, assuming that the live ranges can be
1588 // Determine if these two live ranges overlap.
1615 // Update kill info. Some live ranges are extended due to copy coalescing.
1624 // Update kill info. Some live ranges are extended due to copy coalescing.
1665 // If we get here, we know that we can coalesce the live ranges. Ask the
