HomeSort by relevance Sort by last modified time
    Searched refs:Intervals (Results 1 - 8 of 8) sorted by null

  /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/llvm/lib/CodeGen/
StackColoring.cpp 115 /// Maps liveness intervals for each slot.
116 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals;
375 // and update the live intervals.
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];
585 // Some intervals are suspicious! In some cases we find address
604 if (Intervals[Slot]->empty()
    [all...]
StackSlotColoring.cpp 54 // SSIntervals - Spill slot intervals.
81 // Assignments - Color to intervals mapping.
128 // IntervalSorter - Comparison predicate that sort live intervals by
188 SmallVector<Pair *, 16> Intervals;
189 Intervals.reserve(LS->getNumIntervals());
191 Intervals.push_back(&I);
192 std::sort(Intervals.begin(), Intervals.end(),
196 DEBUG(dbgs() << "Spill slot intervals:\n");
197 for (auto *I : Intervals) {
    [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/opencv3/3rdparty/openexr/Imath/
ImathInterval.h 116 typedef Interval <short> Intervals;
  /external/webrtc/webrtc/base/
timeutils_unittest.cc 80 TEST(TimeTest, Intervals) {
  /external/skia/src/gpu/effects/
GrDashingEffect.cpp 51 const SkScalar* intervals = strokeInfo.getDashIntervals(); local
52 if (0 == intervals[0] && 0 == intervals[1]) {
58 if (SkPaint::kRound_Cap == cap && intervals[0] != 0.f) {
123 // Assumes phase < sum of all intervals
124 static SkScalar calc_start_adjustment(const SkScalar intervals[2], SkScalar phase) {
125 SkASSERT(phase < intervals[0] + intervals[1]);
126 if (phase >= intervals[0] && phase != 0) {
127 SkScalar srcIntervalLen = intervals[0] + intervals[1]
698 const SkScalar* intervals = strokeInfo.getDashIntervals(); local
1265 SkScalar intervals[2]; local
    [all...]

Completed in 1498 milliseconds