HomeSort by: relevance | last modified time | path
    Searched defs:Intervals (Results 1 - 5 of 5) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
IntervalPartition.h 18 // they should be represented as distinct intervals.
38 // maximal intervals, as defined with the properties above. Intuitively, an
48 std::vector<Interval *> Intervals;
72 bool isDegeneratePartition() { return Intervals.size() == 1; }
87 // Interface to Intervals vector...
88 const std::vector<Interval*> &getIntervals() const { return Intervals; }
94 // addIntervalToPartition - Add an interval to the internal list of intervals,
101 // run through all of the intervals and propagate successor info as
  /src/external/apache2/llvm/dist/llvm/include/llvm/ADT/
CoalescingBitVector.h 10 /// into intervals.
29 /// elements into intervals. Good for representing sets which predominantly
56 : Alloc(&Alloc), Intervals(Alloc) {}
62 : Alloc(Other.Alloc), Intervals(*Other.Alloc) {
78 void clear() { Intervals.clear(); }
81 bool empty() const { return Intervals.empty(); }
86 for (auto It = Intervals.begin(), End = Intervals.end(); It != End; ++It)
107 for (auto It = Other.Intervals.begin(), End = Other.Intervals.end()
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RenameIndependentSubregs.cpp 91 const SmallVectorImpl<LiveInterval*> &Intervals) const;
96 const SmallVectorImpl<LiveInterval*> &Intervals) const;
101 const SmallVectorImpl<LiveInterval*> &Intervals) const;
135 SmallVector<LiveInterval*, 4> Intervals;
136 Intervals.push_back(&LI);
144 Intervals.push_back(&NewLI);
149 rewriteOperands(Classes, SubRangeInfos, Intervals);
150 distribute(Classes, SubRangeInfos, Intervals);
151 computeMainRangesFixFlags(Classes, SubRangeInfos, Intervals);
213 const SmallVectorImpl<LiveInterval*> &Intervals) const
    [all...]
StackColoring.cpp 276 // If we create live intervals for the variables above strictly based
277 // on the lifetime markers, we'll get the set of intervals on the
280 // var, then we get the intervals on the right.
289 // For the intervals on the left, the best we can do is overlap two
352 // now larger than if we were computing live intervals strictly based
444 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals;
593 for (unsigned I = 0, E = Intervals.size(); I != E; ++I) {
595 Intervals[I]->dump();
863 // and update the live intervals.
897 VNInfo *VNI = Intervals[Slot]->getValNumInfo(0)
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
GCNNSAReassign.cpp 83 bool tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals,
88 bool scavengeRegs(SmallVectorImpl<LiveInterval *> &Intervals) const;
107 GCNNSAReassign::tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals,
109 unsigned NumRegs = Intervals.size();
112 if (VRM->hasPhys(Intervals[N]->reg()))
113 LRM->unassign(*Intervals[N]);
116 if (LRM->checkInterference(*Intervals[N], MCRegister::from(StartReg + N)))
120 LRM->assign(*Intervals[N], MCRegister::from(StartReg + N));
141 GCNNSAReassign::scavengeRegs(SmallVectorImpl<LiveInterval *> &Intervals) const {
142 unsigned NumRegs = Intervals.size()
    [all...]

Completed in 49 milliseconds