| /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
70 assert(I != intervals_end(&F) && "No intervals in function!?!?!")
[all...] |
| /external/swiftshader/third_party/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/swiftshader/third_party/LLVM/include/llvm/Analysis/ |
| IntervalPartition.h | 19 // they should be represented as distinct intervals.
36 // maximal intervals, as defined with the properties above. Intuitively, a
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/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| MachineLoopRanges.h | 41 /// Map intervals to a bit mask.
43 Map Intervals;
68 const Map &getMap() { return Intervals; }
|
| /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/ |
| RenameIndependentSubregs.cpp | 91 const SmallVectorImpl<LiveInterval*> &Intervals) const;
96 const SmallVectorImpl<LiveInterval*> &Intervals) const;
101 const SmallVectorImpl<LiveInterval*> &Intervals) const;
135 SmallVector<LiveInterval*, 4> Intervals;
136 Intervals.push_back(&LI);
144 Intervals.push_back(&NewLI);
149 rewriteOperands(Classes, SubRangeInfos, Intervals);
150 distribute(Classes, SubRangeInfos, Intervals);
151 computeMainRangesFixFlags(Classes, SubRangeInfos, Intervals);
213 const SmallVectorImpl<LiveInterval*> &Intervals) const
[all...] |
| StackColoring.cpp | 143 // If we create live intervals for the variables above strictly based
144 // on the lifetime markers, we'll get the set of intervals on the
147 // var, then we get the intervals on the right.
156 // For the intervals on the left, the best we can do is overlap two
216 // now larger than if we were computing live intervals strictly based
275 /// Maps liveness intervals for each slot.
276 SmallVector<std::unique_ptr<LiveInterval>, 16> Intervals;
418 for (unsigned I = 0, E = Intervals.size(); I != E; ++I) {
420 DEBUG(Intervals[I]->dump());
682 // and update the live intervals
[all...] |
| StackSlotColoring.cpp | 54 // SSIntervals - Spill slot intervals.
81 // Assignments - Color to intervals mapping.
128 // IntervalSorter - Comparison predicate that sort live intervals by
189 SmallVector<Pair *, 16> Intervals;
190 Intervals.reserve(LS->getNumIntervals());
192 Intervals.push_back(&I);
193 std::sort(Intervals.begin(), Intervals.end(),
197 DEBUG(dbgs() << "Spill slot intervals:\n");
198 for (auto *I : Intervals) {
[all...] |
| /external/swiftshader/third_party/LLVM/lib/CodeGen/ |
| MachineLoopRanges.cpp | 60 : Loop(loop), Intervals(alloc), Area(0) {
65 Intervals.insert(Range.first, Range.second, 1u);
73 Map::const_iterator I = Intervals.find(Start);
109 for (Map::const_iterator I = Intervals.begin(); I.valid(); ++I)
|
| /prebuilts/clang/host/linux-x86/clang-3859424/prebuilt_include/llvm/lib/Fuzzer/ |
| FuzzerCorpus.h | 187 Intervals.resize(N + 1);
189 std::iota(Intervals.begin(), Intervals.end(), 0);
196 Intervals.begin(), Intervals.end(), Weights.begin());
200 std::vector<double> Intervals;
|
| /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/llvm/lib/Fuzzer/ |
| FuzzerLoop.cpp | 757 std::vector<double> Intervals(N + 1);
759 std::iota(Intervals.begin(), Intervals.end(), 0);
762 Intervals.begin(), Intervals.end(), Weights.begin());
|
| /external/webrtc/webrtc/base/ |
| timeutils_unittest.cc | 80 TEST(TimeTest, Intervals) {
|
| /external/skia/src/gpu/ops/ |
| GrDashOp.cpp | 50 const SkScalar* intervals = style.dashIntervals(); local
51 if (0 == intervals[0] && 0 == intervals[1]) {
57 if (SkPaint::kRound_Cap == cap && intervals[0] != 0.f) {
114 // Assumes phase < sum of all intervals
115 static SkScalar calc_start_adjustment(const SkScalar intervals[2], SkScalar phase) {
116 SkASSERT(phase < intervals[0] + intervals[1]);
117 if (phase >= intervals[0] && phase != 0) {
118 SkScalar srcIntervalLen = intervals[0] + intervals[1]
691 const SkScalar* intervals = style.dashIntervals(); local
1220 SkScalar intervals[2]; local
[all...] |
