/external/llvm/lib/Analysis/ |
IntervalPartition.cpp | 19 INITIALIZE_PASS(IntervalPartition, "intervals", 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); 40 // addIntervalToPartition - Add an interval to the internal list of intervals, 45 Intervals.push_back(I); 55 // run through all of the intervals and propagate successor info as 71 assert(I != intervals_end(&F) && "No intervals in function!?!?!") [all...] |
/external/llvm/include/llvm/Analysis/ |
IntervalPartition.h | 19 // they should be represented as distinct intervals. 36 // maximal intervals, as defined with the properties above. Intuitively, an 46 std::vector<Interval*> Intervals; 73 bool isDegeneratePartition() { return Intervals.size() == 1; } 88 // Interface to Intervals vector... 89 const std::vector<Interval*> &getIntervals() const { return Intervals; } 95 // addIntervalToPartition - Add an interval to the internal list of intervals, 103 // run through all of the intervals and propagate successor info as
|
/external/openfst/src/include/fst/ |
interval-set.h | 19 // Class to represent and operate on sets of intervals. 34 // Stores and operates on a set of half-open integral intervals [a,b) 80 vector<Interval> *Intervals() { return &intervals_; } 82 const vector<Interval> *Intervals() const { return &intervals_; } 88 // Number of points in the intervals (undefined if not normalized). 98 const vector<Interval> *intervals = iset.Intervals(); local 99 for (typename vector<Interval>::const_iterator it = intervals->begin(); 100 it != intervals->end(); ++it) 104 // Requires intervals be normalized 275 const vector<Interval> *intervals = iset.Intervals(); local 295 const vector<Interval> *intervals = iset.Intervals(); local 344 const vector<Interval> *intervals = iset.Intervals(); local 366 const vector<Interval> *intervals = s.Intervals(); local [all...] |
state-reachable.h | 73 vector<Interval> *intervals = (*isets_)[s].Intervals(); local 87 intervals->push_back(Interval(index, index + 1)); 89 intervals->push_back(Interval(index_, index_ + 1)); 114 vector<Interval> *intervals = (*isets_)[s].Intervals(); local 115 (*intervals)[0].end = index_; // Update tree interval end 119 (*isets_)[p].Union((*isets_)[s]); // Propagate intervals to parent 182 // to the final states as intervals of the final state indices.
|
label-reachable.h | 195 VLOG(2) << "# of intervals/call: " << (nintervals_ / ncalls_); 306 const vector<Interval> *intervals = isets[s_].Intervals(); local 308 nintervals_ += intervals->size(); 318 if (2 * (aiter_end - aiter_begin) < intervals->size()) { 319 // Check each arc against intervals. 359 iiter = intervals->begin(); 360 iiter != intervals->end(); ++iiter) { 497 VLOG(3) << "state: " << s << " # of intervals: " << isets[s].Size(); 501 VLOG(2) << "# of intervals: " << nintervals [all...] |
/external/llvm/lib/CodeGen/ |
StackColoring.cpp | 114 /// Maps liveness intervals for each slot. 115 SmallVector<LiveInterval*, 16> Intervals; 396 // and update the live intervals. 448 VNInfo *ValNum = Intervals[i]->getValNumInfo(0); 453 Intervals[i]->addRange(LiveRange(S, F, ValNum)); 459 Intervals[i]->addRange(LiveRange(NewStart, F, ValNum)); 460 Intervals[i]->addRange(LiveRange(S, NewFin, ValNum)); 580 LiveInterval *Interval = Intervals[FromSlot]; 608 // Some intervals are suspicious! In some cases we find address 629 if (Intervals[Slot]->empty() [all...] |
/external/chromium_org/third_party/mesa/src/src/mesa/program/ |
prog_optimize.c | 847 /** A list of register intervals */ 851 struct interval Intervals[REG_ALLOCATE_MAX_PROGRAM_TEMPS]; 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) [all...] |
/external/mesa3d/src/mesa/program/ |
prog_optimize.c | 847 /** A list of register intervals */ 851 struct interval Intervals[REG_ALLOCATE_MAX_PROGRAM_TEMPS]; 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) [all...] |
/external/chromium_org/third_party/libjingle/source/talk/base/ |
timeutils_unittest.cc | 96 TEST(TimeTest, Intervals) {
|
/external/v8/src/ |
array.js | 41 function GetSortedArrayKeys(array, intervals) { 42 var length = intervals.length; 45 var key = intervals[k]; 48 var limit = j + intervals[++k]; 220 // Intervals array can contain keys and intervals. See comment in Concat. 221 var intervals = %GetArrayKeys(array, start_i + del_count); 222 var length = intervals.length; 224 var key = intervals[k]; 227 var interval_limit = j + intervals[++k] [all...] |