/netbsd-current/external/apache2/llvm/dist/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 39 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) 40 delete Intervals[i]; 42 Intervals.clear(); 47 for(unsigned i = 0, e = Intervals.size(); i != e; ++i) 48 Intervals[i]->print(O); 55 Intervals.push_back(I); 90 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) 91 updatePredecessors(Intervals[i]); 116 for (unsigned i = 0, e = Intervals.size(); i != e; ++i) 117 updatePredecessors(Intervals[ [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/ADT/ |
H A D | CoalescingBitVector.h | 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(); 120 const auto It = Intervals.find(Index); 121 if (It == Intervals 445 MapT Intervals; member in class:llvm::CoalescingBitVector [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/ |
H A D | GCNNSAReassign.cpp | 83 bool tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals, 88 bool scavengeRegs(SmallVectorImpl<LiveInterval *> &Intervals) const; 107 GCNNSAReassign::tryAssignRegisters(SmallVectorImpl<LiveInterval *> &Intervals, argument 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 278 SmallVector<LiveInterval *, 16> Intervals; local [all...] |
/netbsd-current/external/apache2/llvm/dist/llvm/include/llvm/Analysis/ |
H A D | IntervalPartition.h | 48 std::vector<Interval *> Intervals; member in class:llvm::IntervalPartition 72 bool isDegeneratePartition() { return Intervals.size() == 1; } 87 // Interface to Intervals vector... 88 const std::vector<Interval*> &getIntervals() const { return Intervals; }
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/ |
H A D | 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; local 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) cons [all...] |
H A D | StackColoring.cpp | 444 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals; member in class:__anon1893::StackColoring 593 for (unsigned I = 0, E = Intervals.size(); I != E; ++I) { 595 Intervals[I]->dump(); 897 VNInfo *VNI = Intervals[Slot]->getValNumInfo(0); 898 Intervals[Slot]->addSegment( 913 VNInfo *VNI = Intervals[i]->getValNumInfo(0); 914 Intervals[i]->addSegment(LiveInterval::Segment(Starts[i], EndIdx, VNI)); 1063 const LiveInterval *Interval = &*Intervals[FromSlot]; 1174 if (Intervals[Slot]->empty()) 1179 LiveInterval *Interval = &*Intervals[Slo [all...] |
H A D | StackSlotColoring.cpp | 209 SmallVector<Pair *, 16> Intervals; 211 Intervals.reserve(LS->getNumIntervals()); 213 Intervals.push_back(&I); 214 llvm::sort(Intervals, 219 for (auto *I : Intervals) {
|
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/fuzzer/ |
H A D | FuzzerCorpus.h | 279 Intervals.resize(N + 1); 281 std::iota(Intervals.begin(), Intervals.end(), 0); 295 Intervals.begin(), Intervals.end(), Weights.begin()); 299 Vector<double> Intervals;
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/datetime/ |
H A D | package.d | 33 $(TD Intervals and Ranges of Time)
|
/netbsd-current/external/gpl3/gcc/dist/libphobos/src/std/uni/ |
H A D | package.d | 2167 return Intervals!(typeof(data.array))(data.array); 2183 return Intervals!(typeof(data[]))(data[]).array; 2783 static struct Intervals(Range) 2859 return Intervals(slice, s*2+start, e*2+start); 2883 auto ivals = Intervals!(typeof(data[]))(data[]); 4483 Intervals denote ranges of !`filler` i.e. the opposite of filler.
|
/netbsd-current/external/gpl3/gcc.old/dist/libphobos/src/std/ |
H A D | uni.d | 2200 return Intervals!(typeof(data))(data); 2796 static struct Intervals(Range) 2867 return Intervals(slice, s*2+start, e*2+start); 2891 auto ivals = Intervals!(typeof(data[]))(data[]); 4490 Intervals denote ranges of !$(D filler) i.e. the opposite of filler.
|
/netbsd-current/external/apache2/llvm/dist/llvm/lib/CodeGen/SelectionDAG/ |
H A D | DAGCombiner.cpp | 23007 // Intervals records which offsets from BaseIndex have been covered. In 23014 IMap Intervals(A); 23035 Intervals.insert(0, (St->getMemoryVT().getSizeInBits() + 7) / 8, Unit); 23057 auto I = Intervals.find(Offset); 23059 if (I != Intervals.end() && I.start() < (Offset + Length)) 23062 if (I != Intervals.begin() && (--I).stop() <= Offset) 23064 Intervals.insert(Offset, Offset + Length, Unit);
|