| /external/llvm/unittests/ProfileData/ |
| CoverageMappingTest.cpp | 201 std::vector<CoverageSegment> Segments(Data.begin(), Data.end());
202 ASSERT_EQ(7U, Segments.size());
203 ASSERT_EQ(CoverageSegment(1, 1, 20, true), Segments[0]);
204 ASSERT_EQ(CoverageSegment(4, 7, 30, false), Segments[1]);
205 ASSERT_EQ(CoverageSegment(5, 8, 10, true), Segments[2]);
206 ASSERT_EQ(CoverageSegment(9, 1, 30, false), Segments[3]);
207 ASSERT_EQ(CoverageSegment(9, 9, false), Segments[4]);
208 ASSERT_EQ(CoverageSegment(10, 10, 0, true), Segments[5]);
209 ASSERT_EQ(CoverageSegment(11, 11, false), Segments[6]);
219 std::vector<CoverageSegment> Segments(Data.begin(), Data.end())
[all...] |
| /frameworks/compile/mclinker/include/mcld/LD/ |
| ELFSegmentFactory.h | 27 typedef std::vector<ELFSegment*> Segments;
28 typedef Segments::const_iterator const_iterator;
29 typedef Segments::iterator iterator;
63 Segments m_Segments;
|
| /external/llvm/include/llvm/CodeGen/ |
| LiveIntervalUnion.h | 10 // LiveIntervalUnion is a union of live segments across multiple live virtual
45 // A set of live virtual register segments that supports fast insertion,
63 LiveSegments Segments; // union of virtual reg segments
66 explicit LiveIntervalUnion(Allocator &a) : Tag(0), Segments(a) {}
68 // Iterate over all segments in the union of live virtual registers ordered
70 SegmentIter begin() { return Segments.begin(); }
71 SegmentIter end() { return Segments.end(); }
72 SegmentIter find(SlotIndex x) { return Segments.find(x); }
73 bool empty() const { return Segments.empty();
[all...] |
| LiveInterval.h | 150 /// The Segments are organized in a static single assignment form: At places
192 typedef SmallVector<Segment,4> Segments;
195 Segments segments; // the liveness segments
204 typedef Segments::iterator iterator;
205 iterator begin() { return segments.begin(); }
206 iterator end() { return segments.end(); }
208 typedef Segments::const_iterator const_iterator;
209 const_iterator begin() const { return segments.begin();
[all...] |
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/src/ |
| cmsgamma.c | 30 // The curve is stored in segments, where each segment can be sampled or specified by parameters.
214 cmsInt32Number nSegments, const cmsCurveSegment* Segments,
227 cmsSignalError(ContextID, cmsERROR_RANGE, "Couldn't create tone curve with zero segments and no table");
235 // In this case, there are no segments
237 p ->Segments = NULL;
241 p ->Segments = (cmsCurveSegment*) _cmsCalloc(ContextID, nSegments, sizeof(cmsCurveSegment));
242 if (p ->Segments == NULL) goto Error;
269 // Initialize the segments stuff. The evaluator for each segment is located and a pointer to it
271 if (Segments != NULL && (nSegments > 0)) {
281 if (Segments[i].Type == 0
[all...] |
| cmstypes.c | [all...] |
| lcms2_internal.h | 776 cmsUInt32Number nSegments; // Number of segments in the curve. Zero for a 16-bit based tables
777 cmsCurveSegment* Segments; // The segments
778 cmsInterpParams** SegInterp; // Array of private optimizations for interpolation in table-based segments
[all...] |
| /external/llvm/lib/CodeGen/ |
| LiveIntervalUnion.cpp | 28 // Merge a LiveInterval's segments. Guarantee no overlaps.
34 // Insert each of the virtual register's live segments into the map.
37 SegmentIter SegPos = Segments.find(RegPos->start);
46 // We have reached the end of Segments, so it is no longer necessary to search
55 // Remove a live virtual register's segments from this union.
61 // Remove each of the virtual register's live segments from the map.
64 SegmentIter SegPos = Segments.find(RegPos->start);
72 // Skip all segments that may have been coalesced.
87 for (LiveSegments::const_iterator SI = Segments.begin(); SI.valid(); ++SI) {
97 for (SegmentIter SI = Segments.begin(); SI.valid(); ++SI
[all...] |
| LiveInterval.cpp | 66 if (I == segments().end()) {
88 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI));
93 if (segments().empty())
97 if (I == segments().begin())
109 /// merge and eliminate all segments that this will overlap
112 assert(I != segments().end() && "Not a valid segment!");
118 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo)
125 // have the same value number, merge the two segments into one segment.
126 if (MergeTo != segments().end() && MergeTo->start <= I->end &&
132 // Erase any dead segments
224 CollectionT &segments() { return impl().segmentsColl(); } function in class:__anon14740::CalcLiveRangeUtilBase
[all...] |
| /external/llvm/lib/ProfileData/ |
| CoverageMapping.cpp | 264 std::vector<CoverageSegment> Segments;
270 Segments.emplace_back(Line, Col, /*IsRegionEntry=*/false);
276 if (Segments.empty())
277 Segments.emplace_back(Line, Col, IsRegionEntry);
278 CoverageSegment S = Segments.back();
281 Segments.emplace_back(Line, Col, IsRegionEntry);
282 S = Segments.back();
288 Segments.back().setCount(Region.ExecutionCount);
322 Segments.back().addCount(Region.ExecutionCount);
333 return Segments;
[all...] |
| /external/llvm/tools/llvm-cov/ |
| SourceCoverageView.cpp | 24 ArrayRef<const coverage::CoverageSegment *> Segments,
35 for (const auto *S : Segments) {
113 raw_ostream &OS, ArrayRef<const coverage::CoverageSegment *> Segments) {
118 for (const auto *S : Segments) {
136 for (const auto *S : Segments)
|
| SourceCoverageView.h | 113 ArrayRef<const coverage::CoverageSegment *> Segments,
129 ArrayRef<const coverage::CoverageSegment *> Segments);
|
| /external/llvm/include/llvm/ProfileData/ |
| CoverageMapping.h | 370 std::vector<CoverageSegment> Segments;
380 : Filename(std::move(RHS.Filename)), Segments(std::move(RHS.Segments)),
386 std::vector<CoverageSegment>::iterator begin() { return Segments.begin(); }
387 std::vector<CoverageSegment>::iterator end() { return Segments.end(); }
388 bool empty() { return Segments.empty(); }
|
| /external/llvm/include/llvm/DebugInfo/PDB/ |
| PDBTypes.h | 84 Segments,
|
| /external/pdfium/core/src/fxcodec/lcms2/lcms2-2.6/include/ |
| lcms2.h | [all...] |
