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

  /external/llvm/unittests/ProfileData/
CoverageMappingTest.cpp 308 std::vector<CoverageSegment> Segments(Data.begin(), Data.end());
309 ASSERT_EQ(2U, Segments.size());
311 EXPECT_EQ(CoverageSegment(1, 1, 10, true), Segments[0]);
312 EXPECT_EQ(CoverageSegment(5, 5, false), Segments[1]);
315 EXPECT_EQ(CoverageSegment(2, 2, 20, true), Segments[0]);
316 EXPECT_EQ(CoverageSegment(6, 6, false), Segments[1]);
349 std::vector<CoverageSegment> Segments(Data.begin(), Data.end());
350 ASSERT_EQ(7U, Segments.size());
351 ASSERT_EQ(CoverageSegment(1, 1, 20, true), Segments[0]);
352 ASSERT_EQ(CoverageSegment(4, 7, 30, false), Segments[1])
    [all...]
  /external/swiftshader/third_party/LLVM/lib/CodeGen/
LiveIntervalUnion.h 10 // LiveIntervalUnion is a union of live segments across multiple live virtual
48 // A set of live virtual register segments that supports fast insertion,
67 LiveSegments Segments; // union of virtual reg segments
70 LiveIntervalUnion(unsigned r, Allocator &a) : RepReg(r), Tag(0), Segments(a)
73 // Iterate over all segments in the union of live virtual registers ordered
75 SegmentIter begin() { return Segments.begin(); }
76 SegmentIter end() { return Segments.end(); }
77 SegmentIter find(SlotIndex x) { return Segments.find(x); }
78 bool empty() const { return Segments.empty();
    [all...]
LiveIntervalUnion.cpp 27 // Merge a LiveInterval's segments. Guarantee no overlaps.
33 // Insert each of the virtual register's live segments into the map.
36 SegmentIter SegPos = Segments.find(RegPos->start);
45 // We have reached the end of Segments, so it is no longer necessary to search
54 // Remove a live virtual register's segments from this union.
60 // Remove each of the virtual register's live segments from the map.
63 SegmentIter SegPos = Segments.find(RegPos->start);
71 // 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...]
  /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;
67 Segments m_Segments;
  /external/llvm/lib/DebugInfo/CodeView/
ListRecordBuilder.cpp 76 // Get the continuation segments as a reversed vector of StringRefs for
78 SmallVector<StringRef, 1> Segments;
82 Segments.push_back(Data.slice(LastEnd, SegEnd));
85 Segments.push_back(Data.slice(LastEnd, Builder.size()));
88 StringRef LastRec = Segments.pop_back_val();
93 for (StringRef Rec : reverse(Segments)) {
  /external/llvm/tools/llvm-cov/
SourceCoverageViewHTML.cpp 288 CoverageSegmentArray Segments, unsigned ExpansionCol, unsigned) {
293 // 1. Split the line into N+1 snippets, where N = |Segments|. The first
307 Snip(LCol - 1, Segments.empty() ? 0 : (Segments.front()->Col - 1));
309 for (unsigned I = 1, E = Segments.size(); I < E; ++I) {
310 assert(LCol == Segments[I - 1]->Col && "Snippet start position is wrong");
311 Snip(LCol - 1, Segments[I]->Col - LCol);
337 CheckIfUncovered(Segments.empty() ? nullptr : Segments.front())) {
343 for (unsigned I = 1, E = Segments.size(); I < E; ++I)
    [all...]
SourceCoverageViewHTML.h 51 CoverageSegmentArray Segments, unsigned ExpansionCol,
56 CoverageSegmentArray Segments, unsigned ExpansionCol,
70 void renderRegionMarkers(raw_ostream &OS, CoverageSegmentArray Segments,
SourceCoverageViewText.h 51 CoverageSegmentArray Segments, unsigned ExpansionCol,
56 CoverageSegmentArray Segments, unsigned ExpansionCol,
70 void renderRegionMarkers(raw_ostream &OS, CoverageSegmentArray Segments,
SourceCoverageViewText.cpp 93 CoverageSegmentArray Segments, unsigned ExpansionCol, unsigned ViewDepth) {
106 for (const auto *S : Segments) {
164 raw_ostream &OS, CoverageSegmentArray Segments, unsigned ViewDepth) {
169 for (const auto *S : Segments) {
183 for (const auto *S : Segments)
190 CoverageSegmentArray Segments, unsigned ExpansionCol, unsigned ViewDepth) {
193 renderLine(OS, L, WrappedSegment, Segments, ExpansionCol, ViewDepth);
SourceCoverageView.h 209 CoverageSegmentArray Segments, unsigned ExpansionCol,
221 CoverageSegmentArray Segments,
228 CoverageSegmentArray Segments, unsigned ExpansionCol,
  /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 151 /// The Segments are organized in a static single assignment form: At places
193 typedef SmallVector<Segment, 2> Segments;
196 Segments segments; // the liveness segments
205 typedef Segments::iterator iterator;
206 iterator begin() { return segments.begin(); }
207 iterator end() { return segments.end(); }
209 typedef Segments::const_iterator const_iterator;
210 const_iterator begin() const { return segments.begin();
    [all...]
  /external/pdfium/third_party/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/ProfileData/Coverage/
CoverageMapping.cpp 280 std::vector<CoverageSegment> &Segments;
283 SegmentBuilder(std::vector<CoverageSegment> &Segments) : Segments(Segments) {}
288 Segments.emplace_back(Line, Col, /*IsRegionEntry=*/false);
295 if (!Segments.empty() && Segments.back().Line == Line &&
296 Segments.back().Col == Col)
297 Segments.pop_back();
302 Segments.emplace_back(Line, Col, Region.ExecutionCount, IsRegionEntry)
    [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:__anon25191::CalcLiveRangeUtilBase
    [all...]
  /external/llvm/include/llvm/ProfileData/Coverage/
CoverageMapping.h 405 std::vector<CoverageSegment> Segments;
415 : Filename(std::move(RHS.Filename)), Segments(std::move(RHS.Segments)),
421 std::vector<CoverageSegment>::iterator begin() { return Segments.begin(); }
422 std::vector<CoverageSegment>::iterator end() { return Segments.end(); }
423 bool empty() { return Segments.empty(); }
  /external/llvm/include/llvm/DebugInfo/PDB/
PDBTypes.h 89 Segments,
  /prebuilts/go/darwin-x86/src/image/jpeg/
reader.go 528 // Process the remaining segments until the End Of Image marker.
579 // only occur between Entropy Coded Segments and not after the final ECS.
  /prebuilts/go/linux-x86/src/image/jpeg/
reader.go 528 // Process the remaining segments until the End Of Image marker.
579 // only occur between Entropy Coded Segments and not after the final ECS.
  /external/pdfium/third_party/lcms2-2.6/include/
lcms2.h     [all...]

Completed in 319 milliseconds