Home
last modified time | relevance | path

Searched refs:Intervals (Results 1 – 3 of 3) sorted by relevance

/freebsd-9-stable/contrib/llvm/lib/Analysis/
DIntervalPartition.cpp28 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in releaseMemory()
29 delete Intervals[i]; in releaseMemory()
31 Intervals.clear(); in releaseMemory()
36 for(unsigned i = 0, e = Intervals.size(); i != e; ++i) in print()
37 Intervals[i]->print(O); in print()
45 Intervals.push_back(I); in addIntervalToPartition()
83 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in runOnFunction()
84 updatePredecessors(Intervals[i]); in runOnFunction()
111 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) in IntervalPartition()
112 updatePredecessors(Intervals[i]); in IntervalPartition()
/freebsd-9-stable/contrib/llvm/lib/CodeGen/
DStackColoring.cpp115 SmallVector<LiveInterval*, 16> Intervals; member in __anonac9fc3a70111::StackColoring
448 VNInfo *ValNum = Intervals[i]->getValNumInfo(0); in calculateLiveIntervals()
453 Intervals[i]->addSegment(LiveInterval::Segment(S, F, ValNum)); in calculateLiveIntervals()
459 Intervals[i]->addSegment(LiveInterval::Segment(NewStart, F, ValNum)); in calculateLiveIntervals()
460 Intervals[i]->addSegment(LiveInterval::Segment(S, NewFin, ValNum)); in calculateLiveIntervals()
580 LiveInterval *Interval = Intervals[FromSlot]; in remapInstructions()
629 if (Intervals[Slot]->empty()) in removeInvalidSlotRanges()
634 LiveInterval *Interval = Intervals[Slot]; in removeInvalidSlotRanges()
637 Intervals[Slot]->clear(); in removeInvalidSlotRanges()
672 Intervals.clear(); in runOnMachineFunction()
[all …]
/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DIntervalPartition.h46 std::vector<Interval*> Intervals; variable
73 bool isDegeneratePartition() { return Intervals.size() == 1; } in isDegeneratePartition()
89 const std::vector<Interval*> &getIntervals() const { return Intervals; } in getIntervals()