Searched refs:Intervals (Results 1 - 9 of 9) sorted by relevance
/external/llvm/lib/Analysis/ |
H A D | IntervalPartition.cpp | 28 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 D | IntervalPartition.h | 46 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/openfst/src/include/fst/ |
H A D | interval-set.h | 80 vector<Interval> *Intervals() { return &intervals_; } function in class:fst::IntervalSet 82 const vector<Interval> *Intervals() const { return &intervals_; } function in class:fst::IntervalSet 98 const vector<Interval> *intervals = iset.Intervals(); 116 return *(iset.Intervals()) == intervals_; 121 return *(iset.Intervals()) != intervals_; 202 const vector<Interval> *iintervals = iset.Intervals(); 203 vector<Interval> *ointervals = oset->Intervals(); 233 vector<Interval> *ointervals = oset->Intervals(); 262 oset->Intervals()->clear(); 275 const vector<Interval> *intervals = iset.Intervals(); [all...] |
H A D | state-reachable.h | 73 vector<Interval> *intervals = (*isets_)[s].Intervals(); 114 vector<Interval> *intervals = (*isets_)[s].Intervals();
|
H A D | label-reachable.h | 306 const vector<Interval> *intervals = isets[s_].Intervals();
|
/external/llvm/lib/CodeGen/ |
H A D | StackColoring.cpp | 117 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals; member in class:__anon25826::StackColoring 425 VNInfo *ValNum = Intervals[i]->getValNumInfo(0); 430 Intervals[i]->addSegment(LiveInterval::Segment(S, F, ValNum)); 436 Intervals[i]->addSegment(LiveInterval::Segment(NewStart, F, ValNum)); 437 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...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
H A D | prog_optimize.c | 851 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/mesa3d/src/mesa/program/ |
H A D | prog_optimize.c | 851 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/chromium_org/third_party/webrtc/base/ |
H A D | timeutils_unittest.cc | 79 TEST(TimeTest, Intervals) {
|
Completed in 2059 milliseconds