Searched refs:Intervals (Results 1 - 8 of 8) sorted by relevance

/external/llvm/lib/Analysis/
H A DIntervalPartition.cpp28 for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
29 delete Intervals[i];
31 Intervals.clear();
36 for(unsigned i = 0, e = Intervals.size(); i != e; ++i)
37 Intervals[i]->print(O);
45 Intervals.push_back(I);
83 for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
84 updatePredecessors(Intervals[i]);
111 for (unsigned i = 0, e = Intervals.size(); i != e; ++i)
112 updatePredecessors(Intervals[
[all...]
/external/llvm/include/llvm/Analysis/
H A DIntervalPartition.h46 std::vector<Interval*> Intervals; member in class:llvm::IntervalPartition
73 bool isDegeneratePartition() { return Intervals.size() == 1; }
88 // Interface to Intervals vector...
89 const std::vector<Interval*> &getIntervals() const { return Intervals; }
/external/llvm/lib/CodeGen/
H A DStackColoring.cpp116 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals; member in class:__anon11867::StackColoring
424 VNInfo *ValNum = Intervals[i]->getValNumInfo(0);
429 Intervals[i]->addSegment(LiveInterval::Segment(S, F, ValNum));
435 Intervals[i]->addSegment(LiveInterval::Segment(NewStart, F, ValNum));
436 Intervals[i]->addSegment(LiveInterval::Segment(S, NewFin, ValNum));
560 const LiveInterval *Interval = &*Intervals[FromSlot];
604 if (Intervals[Slot]->empty())
609 LiveInterval *Interval = &*Intervals[Slot];
651 Intervals.clear();
663 Intervals
[all...]
H A DStackSlotColoring.cpp188 SmallVector<Pair *, 16> Intervals; local
189 Intervals.reserve(LS->getNumIntervals());
191 Intervals.push_back(&I);
192 std::sort(Intervals.begin(), Intervals.end(),
197 for (auto *I : Intervals) {
/external/mesa3d/src/mesa/program/
H A Dprog_optimize.c851 struct interval Intervals[REG_ALLOCATE_MAX_PROGRAM_TEMPS]; member in struct:interval_list
858 list->Intervals[list->Num++] = *inv;
868 while (i >= 0 && list->Intervals[i].End > inv->End) {
869 list->Intervals[i + 1] = list->Intervals[i];
872 list->Intervals[i + 1] = *inv;
879 ASSERT(list->Intervals[i].End <= list->Intervals[i + 1].End);
893 if (list->Intervals[k].Reg == inv->Reg) {
895 ASSERT(list->Intervals[
[all...]
/external/opencv3/3rdparty/openexr/Imath/
H A DImathInterval.h116 typedef Interval <short> Intervals; typedef in namespace:Imath
/external/webrtc/webrtc/base/
H A Dtimeutils_unittest.cc80 TEST(TimeTest, Intervals) {
/external/skia/src/gpu/effects/
H A DGrDashingEffect.cpp1268 enum Intervals { enum
1274 Intervals intervalType = SkPaint::kRound_Cap ?
1276 Intervals(random->nextULessThan(kCloseOpen_Intervals + 1));

Completed in 3196 milliseconds