| /external/llvm/lib/Analysis/ |
| D | IntervalPartition.cpp | 28 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()
|
| /external/openfst/src/include/fst/ |
| D | interval-set.h | 80 vector<Interval> *Intervals() { return &intervals_; } in Intervals() function
82 const vector<Interval> *Intervals() const { return &intervals_; } in Intervals() function
98 const vector<Interval> *intervals = iset.Intervals(); in Union()
116 return *(iset.Intervals()) == intervals_;
121 return *(iset.Intervals()) != intervals_;
202 const vector<Interval> *iintervals = iset.Intervals(); in Intersect()
203 vector<Interval> *ointervals = oset->Intervals(); in Intersect()
233 vector<Interval> *ointervals = oset->Intervals(); in Complement()
262 oset->Intervals()->clear(); in Difference()
275 const vector<Interval> *intervals = iset.Intervals(); in Overlaps()
[all …]
|
| D | state-reachable.h | 73 vector<Interval> *intervals = (*isets_)[s].Intervals(); in InitState()
114 vector<Interval> *intervals = (*isets_)[s].Intervals(); in FinishState()
|
| D | label-reachable.h | 306 const vector<Interval> *intervals = isets[s_].Intervals(); in Reach()
|
| /external/llvm/test/Verifier/ |
| D | range-1.ll | 85 ; CHECK: Intervals are overlapping
93 ; CHECK: Intervals are contiguous
101 ; CHECK: Intervals are not in order
109 ; CHECK: Intervals are contiguous
117 ; CHECK: Intervals are overlapping
125 ; CHECK: Intervals are overlapping
133 ; CHECK: Intervals are overlapping
141 ; CHECK: Intervals are contiguous
|
| /external/llvm/lib/CodeGen/ |
| D | StackColoring.cpp | 116 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals; member in __anon83007c0a0111::StackColoring
424 VNInfo *ValNum = Intervals[i]->getValNumInfo(0); in calculateLiveIntervals()
429 Intervals[i]->addSegment(LiveInterval::Segment(S, F, ValNum)); in calculateLiveIntervals()
435 Intervals[i]->addSegment(LiveInterval::Segment(NewStart, F, ValNum)); in calculateLiveIntervals()
436 Intervals[i]->addSegment(LiveInterval::Segment(S, NewFin, ValNum)); in calculateLiveIntervals()
560 const LiveInterval *Interval = &*Intervals[FromSlot]; in remapInstructions()
604 if (Intervals[Slot]->empty()) in removeInvalidSlotRanges()
609 LiveInterval *Interval = &*Intervals[Slot]; in removeInvalidSlotRanges()
651 Intervals.clear(); in runOnMachineFunction()
663 Intervals.reserve(NumSlots); in runOnMachineFunction()
[all …]
|
| D | StackSlotColoring.cpp | 188 SmallVector<Pair *, 16> Intervals; in InitializeSlots() local
189 Intervals.reserve(LS->getNumIntervals()); in InitializeSlots()
191 Intervals.push_back(&I); in InitializeSlots()
192 std::sort(Intervals.begin(), Intervals.end(), in InitializeSlots()
197 for (auto *I : Intervals) { in InitializeSlots()
|
| /external/llvm/include/llvm/Analysis/ |
| D | IntervalPartition.h | 46 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()
|
| /external/mesa3d/src/mesa/program/ |
| D | prog_optimize.c | 851 struct interval Intervals[REG_ALLOCATE_MAX_PROGRAM_TEMPS]; member
858 list->Intervals[list->Num++] = *inv; in append_interval()
868 while (i >= 0 && list->Intervals[i].End > inv->End) { in insert_interval_by_end()
869 list->Intervals[i + 1] = list->Intervals[i]; in insert_interval_by_end()
872 list->Intervals[i + 1] = *inv; in insert_interval_by_end()
879 ASSERT(list->Intervals[i].End <= list->Intervals[i + 1].End); in insert_interval_by_end()
893 if (list->Intervals[k].Reg == inv->Reg) { in remove_interval()
895 ASSERT(list->Intervals[k].Start == inv->Start); in remove_interval()
896 ASSERT(list->Intervals[k].End == inv->End); in remove_interval()
898 list->Intervals[k] = list->Intervals[k + 1]; in remove_interval()
[all …]
|
| /external/webrtc/webrtc/base/ |
| D | timeutils_unittest.cc | 80 TEST(TimeTest, Intervals) { in TEST() argument
|
| /external/skia/src/gpu/effects/ |
| D | GrDashingEffect.cpp | 1268 enum Intervals { in DRAW_BATCH_TEST_DEFINE() enum
1274 Intervals intervalType = SkPaint::kRound_Cap ? in DRAW_BATCH_TEST_DEFINE()
1276 Intervals(random->nextULessThan(kCloseOpen_Intervals + 1)); in DRAW_BATCH_TEST_DEFINE()
|
| /external/llvm/docs/ |
| D | CodeGenerator.rst | 1137 Live Intervals
1140 Live Intervals are the ranges (intervals) where a variable is *live*. They are
1184 Live Intervals Analysis argument
|
| /external/skia/src/animator/ |
| D | SkAnimateSchema.xsd | 1291 dashes and gaps. Intervals must contain an even number of entries. -->
|