HomeSort by: relevance | last modified time | path
    Searched refs:Segments (Results 1 - 20 of 20) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/include/llvm/CodeGen/
LiveIntervalUnion.h 9 // LiveIntervalUnion is a union of live segments across multiple live virtual
43 // A set of live virtual register segments that supports fast insertion,
62 LiveSegments Segments; // union of virtual reg segments
65 explicit LiveIntervalUnion(Allocator &a) : Segments(a) {}
67 // Iterate over all segments in the union of live virtual registers ordered
69 SegmentIter begin() { return Segments.begin(); }
70 SegmentIter end() { return Segments.end(); }
71 SegmentIter find(SlotIndex x) { return Segments.find(x); }
72 ConstSegmentIter begin() const { return Segments.begin();
    [all...]
LiveInterval.h 154 /// The Segments are organized in a static single assignment form: At places
200 using Segments = SmallVector<Segment, 2>;
203 Segments segments; // the liveness segments
212 using iterator = Segments::iterator;
213 using const_iterator = Segments::const_iterator;
215 iterator begin() { return segments.begin(); }
216 iterator end() { return segments.end(); }
218 const_iterator begin() const { return segments.begin();
    [all...]
LiveIntervals.h 430 /// Remove value numbers and related live segments starting at position
435 /// Remove value number and related live segments of \p LI and its subranges
445 /// have any segments or value numbers.
475 void extendSegmentsToUses(LiveRange &Segments,
480 /// creates/modifies live segments in \p LR to match the operands found.
  /src/external/apache2/llvm/dist/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...]
LiveIntervals.cpp 375 void LiveIntervals::extendSegmentsToUses(LiveRange &Segments,
408 if (VNInfo *ExtVNI = Segments.extendInBlock(BlockStart, Idx)) {
429 Segments.addSegment(LiveRange::Segment(BlockStart, Idx, VNI));
501 // Create new live ranges with only minimal live segments per def.
506 // Move the trimmed segments back.
507 li->segments.swap(NewLR.segments);
605 // Create a new live ranges with only minimal live segments per def.
611 SR.segments.swap(NewLR.segments);
    [all...]
LiveInterval.cpp 93 if (I == segments().end()) {
116 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI));
121 if (segments().empty())
125 if (I == segments().begin())
137 if (segments().empty())
141 if (I == segments().begin())
156 /// merge and eliminate all segments that this will overlap
159 assert(I != segments().end() && "Not a valid segment!");
165 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo)
172 // have the same value number, merge the two segments into one segment
271 CollectionT &segments() { return impl().segmentsColl(); } function in class:__anon4203::CalcLiveRangeUtilBase
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/DebugInfo/PDB/DIA/
DIATable.cpp 40 return PDB_TableType::Segments;
  /src/external/apache2/llvm/dist/llvm/lib/ProfileData/Coverage/
CoverageMapping.cpp 414 std::vector<CoverageSegment> &Segments;
417 SegmentBuilder(std::vector<CoverageSegment> &Segments) : Segments(Segments) {}
429 if (!Segments.empty() && !IsRegionEntry && !EmitSkippedRegion) {
430 const auto &Last = Segments.back();
437 Segments.emplace_back(StartLoc.first, StartLoc.second,
441 Segments.emplace_back(StartLoc.first, StartLoc.second, IsRegionEntry);
444 const auto &Last = Segments.back();
453 /// Emit segments for active regions which end before \p Loc
    [all...]
  /src/external/apache2/llvm/dist/llvm/tools/llvm-cov/
SourceCoverageViewText.cpp 103 CoverageSegmentArray Segments = LCS.getLineSegments();
115 for (const auto *S : Segments) {
179 CoverageSegmentArray Segments = Line.getLineSegments();
181 // Just consider the segments which start *and* end on this line.
182 if (Segments.size() > 1)
183 Segments = Segments.drop_back();
186 for (const auto *S : Segments) {
SourceCoverageViewHTML.cpp 505 // 1. Split the line into N+1 snippets, where N = |Segments|. The first
511 CoverageSegmentArray Segments = LCS.getLineSegments();
519 Snip(LCol - 1, Segments.empty() ? 0 : (Segments.front()->Col - 1));
521 for (unsigned I = 1, E = Segments.size(); I < E; ++I)
522 Snip(LCol - 1, Segments[I]->Col - LCol);
555 for (unsigned I = 0, E = Segments.size(); I < E; ++I) {
556 const auto *CurSeg = Segments[I];
569 if (Color.hasValue() && Segments.empty())
583 // 4. Snippets[1:N+1] correspond to \p Segments[0:N]: use these to generat
    [all...]
SourceCoverageView.cpp 122 CoverageSegmentArray Segments = LCS.getLineSegments();
123 if (Segments.empty())
125 for (unsigned I = 0, E = Segments.size() - 1; I < E; ++I) {
126 const auto *CurSeg = Segments[I];
  /src/external/apache2/llvm/dist/llvm/lib/ExecutionEngine/JITLink/
JITLinkGeneric.cpp 51 // Sort blocks into segments.
54 // Allocate memory for segments.
243 JITLinkMemoryManager::SegmentsRequestMap Segments;
267 Segments[Prot] = {SegAlign, SegContentSize,
281 Ctx->getMemoryManager().allocate(Ctx->getJITLinkDylib(), Segments))
  /src/external/apache2/llvm/dist/llvm/include/llvm/ProfileData/Coverage/
CoverageMapping.h 535 std::vector<CoverageSegment> Segments;
547 /// Get an iterator over the coverage segments for this object. The segments
550 return Segments.begin();
554 return Segments.end();
557 bool empty() const { return Segments.empty(); }
704 Line(Line), Segments(), Stats() {
731 SmallVector<const CoverageSegment *, 4> Segments;
  /src/external/apache2/llvm/dist/llvm/lib/ObjectYAML/
WasmEmitter.cpp 485 encodeULEB128(Section.Segments.size(), OS);
486 for (auto &Segment : Section.Segments) {
541 encodeULEB128(Section.Segments.size(), OS);
542 for (auto &Segment : Section.Segments) {
WasmYAML.cpp 145 IO.mapOptional("Segments", Section.Segments);
155 IO.mapRequired("Segments", Section.Segments);
  /src/external/apache2/llvm/dist/llvm/tools/llvm-objcopy/ELF/
Object.h 1017 std::vector<SegPtr> Segments;
1035 // because other segments may get assigned an offset where either of the
1037 // Other than that we use these segments to track program header offsets
1076 Range<Segment> segments() { return make_pointee_range(Segments); } function in class:llvm::objcopy::elf::Object
1077 ConstRange<Segment> segments() const { return make_pointee_range(Segments); } function in class:llvm::objcopy::elf::Object
1092 Segments.emplace_back(std::make_unique<Segment>(Data));
1093 return *Segments.back();
Object.cpp 1151 // For sections not found in segments, OriginalOffset is only used to
1204 // segments and ensures that the section "belongs" to the second segment and
1384 for (Segment &Parent : Obj.segments()) {
1471 // Now we do an O(n^2) loop through the segments in order to match up
1472 // segments.
1473 for (Segment &Child : Obj.segments())
2001 Ehdr.e_phnum = llvm::size(Obj.segments());
2039 for (auto &Seg : Obj.segments())
2074 // Segments are responsible for writing their contents, so only write the
2076 // sections in segments effectively immutable
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/ObjectYAML/
WasmYAML.h 366 std::vector<ElemSegment> Segments;
386 std::vector<DataSegment> Segments;
  /src/external/apache2/llvm/dist/llvm/tools/obj2yaml/
wasm2yaml.cpp 335 ElemSec->Segments.push_back(Seg);
366 DataSec->Segments.push_back(Seg);
  /src/external/apache2/llvm/dist/llvm/include/llvm/DebugInfo/PDB/
PDBTypes.h 92 Segments,

Completed in 134 milliseconds