Home
last modified time | relevance | path

Searched full:segments (Results 1 – 25 of 390) sorted by relevance

12345678910>>...16

/llvm-project/llvm/unittests/ProfileData/
H A DCoverageMappingTest.cpp430 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); in TEST_P()
431 ASSERT_EQ(2U, Segments.size()); in TEST_P()
433 EXPECT_EQ(CoverageSegment(1, 1, 10, true), Segments[0]); in TEST_P()
434 EXPECT_EQ(CoverageSegment(5, 5, false), Segments[1]); in TEST_P()
437 EXPECT_EQ(CoverageSegment(2, 2, 20, true), Segments[0]); in TEST_P()
438 EXPECT_EQ(CoverageSegment(6, 6, false), Segments[1]); in TEST_P()
457 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); in TEST_P()
459 ASSERT_EQ(2U, Segments.size()); in TEST_P()
460 EXPECT_EQ(CoverageSegment(1, 1, 6, true), Segments[0]); in TEST_P()
461 EXPECT_EQ(CoverageSegment(2, 2, false), Segments[ in TEST_P()
391 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
418 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
436 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
468 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
520 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
545 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
570 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
597 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
620 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
651 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
691 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
745 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
758 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
775 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
793 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
815 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
837 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
985 std::vector<CoverageSegment> Segments(Data.begin(), Data.end()); TEST_P() local
[all...]
/llvm-project/llvm/test/tools/llvm-objcopy/ELF/
H A Dihex-writer.test4 # Check ihex output, when we have segments in ELF file
5 # In such case only sections in PT_LOAD segments will
7 # RUN: yaml2obj %p/Inputs/ihex-elf-segments.yaml -o %t-segs
8 # RUN: llvm-objcopy -O ihex %t-segs - | FileCheck %s --check-prefix=SEGMENTS
10 # Check that non-load segments are ignored:
54 # SEGMENTS: :020000040010EA
55 # SEGMENTS-NEXT: :10000000000102030405060708090A0B0C0D0E0F78
56 # SEGMENTS-NEXT: :05001000101112131491
57 # SEGMENTS-NEXT: :0B001800303132333435363738394090
58 # SEGMENTS-NEXT: :0400280040414243CE
[all …]
H A Dpreserve-segment-contents.test1 # We want to preserve areas in segments that are not covered by section headers.
4 # To create inputs with arbitrary data in segments, not covered by sections, we
5 # use yaml2obj to create segments with sections covering all areas, then remove
6 # some sections in those segments, and finally write over the areas of the
341 # The next few segments test behaviour of fully nested segments.
387 # The next batch of segments are segments that only partially overlap other segments.
462 # The next batch of segments represent groups of three nested/overlapping segments,
463 # with one parent segment containing two overlapping segments.
/llvm-project/llvm/include/llvm/CodeGen/
H A DLiveIntervalUnion.h9 // 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 variable
65 explicit LiveIntervalUnion(Allocator &a) : Segments(a) {} in LiveIntervalUnion()
67 // Iterate over all segments in the union of live virtual registers ordered
69 SegmentIter begin() { return Segments.begin(); } in begin()
70 SegmentIter end() { return Segments.end(); } in end()
71 SegmentIter find(SlotIndex x) { return Segments.find(x); } in find()
72 ConstSegmentIter begin() const { return Segments in find()
[all...]
H A DLiveInterval.h154 /// The Segments are organized in a static single assignment form: At places
200 using Segments = SmallVector<Segment, 2>; variable
203 Segments segments; // the liveness segments variable
212 using iterator = Segments::iterator;
213 using const_iterator = Segments::const_iterator;
215 iterator begin() { return segments.begin(); } in begin()
216 iterator end() { return segments.end(); } in end()
218 const_iterator begin() const { return segments
[all...]
/llvm-project/llvm/lib/CodeGen/
H A DLiveInterval.cpp93 if (I == segments().end()) { in createDeadDef()
116 segments().insert(I, Segment(Def, Def.getDeadSlot(), VNI)); in createDeadDef()
121 if (segments().empty()) in extendInBlock()
125 if (I == segments().begin()) in extendInBlock()
137 if (segments().empty()) in extendInBlock()
141 if (I == segments().begin()) in extendInBlock()
156 /// merge and eliminate all segments that this will overlap
159 assert(I != segments().end() && "Not a valid segment!"); in extendSegmentEndTo()
165 for (; MergeTo != segments().end() && NewEnd >= MergeTo->end; ++MergeTo) in extendSegmentEndTo()
172 // have the same value number, merge the two segments int in extendSegmentEndTo()
271 CollectionT &segments() { return impl().segmentsColl(); } segments() function in __anon753de2fc0111::CalcLiveRangeUtilBase
[all...]
H A DLiveIntervalUnion.cpp27 // Merge a LiveInterval's segments. Guarantee no overlaps.
34 // Insert each of the virtual register's live segments into the map. in unify()
37 SegmentIter SegPos = Segments.find(RegPos->start); in unify()
46 // We have reached the end of Segments, so it is no longer necessary to search in unify()
55 // Remove a live virtual register's segments from this union.
62 // Remove each of the virtual register's live segments from the map. in extract()
65 SegmentIter SegPos = Segments.find(RegPos->start); in extract()
73 // Skip all segments that may have been coalesced. in extract()
88 for (LiveSegments::const_iterator SI = Segments.begin(); SI.valid(); ++SI) { in print()
98 for (SegmentIter SI = Segments.begin(); SI.valid(); ++SI) in verify()
[all …]
H A DLiveRangeUtils.h21 /// corresponding segments of a primary live range \p LR to a list of newly
28 // Move segments to new intervals. in DistributeRange()
36 SplitLRs[eq-1]->segments.push_back(*I); in DistributeRange()
40 LR.segments.erase(J, E); in DistributeRange()
/llvm-project/llvm/include/llvm/ExecutionEngine/JITLink/
H A DJITLinkMemoryManager.h208 /// BasicLayout groups Sections into Segments based on their memory protection
211 /// Segments. These addreses will be mapped back onto the Graph blocks in
241 /// A convenience class that further groups segments based on memory
243 /// one for all standard segments, and one for all finalize segments.
260 /// Returns the total number of required to allocate all segments (with each
261 /// segment padded out to page size) for all standard segments, and all
262 /// finalize segments.
264 /// This is a convenience function for the common case where the segments will
272 /// Returns an iterator over the segments o in segments()
270 iterator_range<SegmentMap::iterator> segments() { segments() function
284 SegmentMap Segments; global() variable
[all...]
/llvm-project/lldb/source/Plugins/DynamicLoader/MacOSX-DYLD/
H A DDynamicLoaderDarwin.cpp249 // Update the load addresses for all segments in MODULE using the updated INFO in UpdateImageLoadAddress()
262 const size_t num_segments = info.segments.size(); in UpdateImageLoadAddress()
267 section_list->FindSectionByName(info.segments[i].name)); in UpdateImageLoadAddress()
269 if (info.segments[i].maxprot == 0) { in UpdateImageLoadAddress()
273 info.segments[i].vmaddr + info.slide; in UpdateImageLoadAddress()
290 // If the loaded the file (it changed) and we have segments that are in UpdateImageLoadAddress()
300 section_list->FindSectionByName(info.segments[seg_idx].name)); in UpdateImageLoadAddress()
306 const lldb::addr_t vmaddr = info.segments[seg_idx].vmaddr; in UpdateImageLoadAddress()
307 const lldb::addr_t vmsize = info.segments[seg_idx].vmsize; in UpdateImageLoadAddress()
327 // Unload the segments i in UnloadModuleSections()
451 StructuredData::Array *segments = JSONImageInformationIntoImageInfo() local
[all...]
/llvm-project/llvm/lib/ExecutionEngine/JITLink/
H A DJITLinkMemoryManager.cpp32 auto &Seg = Segments[{Sec.getMemProt(), Sec.getMemLifetime()}]; in BasicLayout()
40 // Build Segments map. in BasicLayout()
51 for (auto &KV : Segments) { in BasicLayout()
84 for (auto &KV : segments()) { in getContiguousPageBasedLayoutSizes()
103 for (auto &KV : Segments) { in apply()
149 SegmentMap Segments, in Create()
166 for (auto &KV : Segments) { in Create()
171 "NoAlloc segments are not supported by SimpleSegmentAlloc"); in Create()
208 Triple TT, const JITLinkDylib *JD, SegmentMap Segments) { in Create()
211 Create(MemMgr, std::move(SSP), std::move(TT), JD, std::move(Segments), in Create()
147 Create(JITLinkMemoryManager & MemMgr,const JITLinkDylib * JD,SegmentMap Segments,OnCreatedFunction OnCreated) Create() argument
205 Create(JITLinkMemoryManager & MemMgr,const JITLinkDylib * JD,SegmentMap Segments) Create() argument
[all...]
/llvm-project/lld/wasm/
H A DWriter.cpp127 std::vector<OutputSegment *> segments; member in lld::wasm::__anon6c9455020111::Writer
376 // segments. in layoutMemory()
381 for (OutputSegment *seg : segments) { in layoutMemory()
550 addSection(make<DataSection>(segments)); in addSections()
618 // Find TLS data segments in populateTargetFeatures()
622 tlsUsed = tlsUsed || llvm::any_of(file->segments, isTLS); in populateTargetFeatures()
676 // Normally we don't include bss segments in the binary. In particular if in populateTargetFeatures()
679 // instruction, then we can also avoid including the segments. in populateTargetFeatures()
681 // the bss segments, so these segments nee in populateTargetFeatures()
[all...]
H A DOutputSections.cpp99 unsigned segmentCount = llvm::count_if(segments, [](OutputSegment *segment) { in finalizeContents()
103 unsigned activeCount = llvm::count_if(segments, [](OutputSegment *segment) { in finalizeContents()
110 "output segments should have been combined by now"); in finalizeContents()
116 for (OutputSegment *segment : segments) { in finalizeContents()
175 for (const OutputSegment *segment : segments) { in writeTo()
190 for (const OutputSegment *seg : segments) in writeTo()
197 for (const OutputSegment *seg : segments) in getNumRelocations()
203 for (const OutputSegment *seg : segments) in writeRelocations()
H A DMarkLive.cpp72 // Mark retained segments in the object that defines this symbol live. in enqueue()
99 // Mark segments flagged by segment-level no-strip. Segment-level no-strip is in enqueueRetainedSegments()
100 // usually used to retain segments without having symbol table entry. in enqueueRetainedSegments()
102 for (InputChunk *chunk : file->segments) in enqueueRetainedSegments()
124 // Enqueue retained segments in objects explicitly live from the in run()
183 for (InputChunk *c : obj->segments) in markLive()
H A DOutputSegment.h26 // In most circumstances BSS segments don't need to be written
29 // memory feature) then we include BSS segments verbatim.
44 // Sum of the size of the all the input segments
H A DOutputSections.h81 explicit DataSection(ArrayRef<OutputSegment *> segments) in DataSection() argument
82 : OutputSection(llvm::wasm::WASM_SEC_DATA), segments(segments) {} in DataSection()
95 ArrayRef<OutputSegment *> segments; variable
/llvm-project/llvm/utils/TableGen/Common/
H A DVarLenCodeEmitterGen.h35 SmallVector<EncodingSegment, 4> Segments; variable
47 using const_iterator = decltype(Segments)::const_iterator;
49 const_iterator begin() const { return Segments.begin(); } in begin()
50 const_iterator end() const { return Segments.end(); } in end()
51 size_t getNumSegments() const { return Segments.size(); } in getNumSegments()
/llvm-project/llvm/test/tools/yaml2obj/ELF/
H A Dprogram-header-nobits.yaml3 ## multiple segments, we check each and allocate the space if at least one matches the
6 ## Case A. In this case there are no non-nobits sections after SHT_NOBITS sections in segments.
9 # RUN: llvm-readelf --sections --segments %t1 | FileCheck %s --check-prefix=NO-ALLOC
27 # RUN: llvm-readelf --sections --segments %t2 | FileCheck %s --check-prefix=ALLOC-FIRST
44 # RUN: llvm-readelf --sections --segments %t3 | FileCheck %s --check-prefix=FILL-AT-END
86 ## We have 2 segments, the first is predefined and the second can be customized.
103 # RUN: llvm-readelf --sections --segments %t4 | FileCheck %s --check-prefix=MIDDLE
/llvm-project/lld/test/wasm/
H A Ddata-segment-merging.ll17 ; MERGE-NEXT: Segments:
38 ; RUN: wasm-ld -no-gc-sections --no-entry --no-merge-data-segments -o %t.separate.wasm %t.o
43 ; SEPARATE-NEXT: Segments:
88 ; PASSIVE-MERGE-NEXT: Segments:
105 …sections --no-entry --shared-memory --max-memory=131072 --no-merge-data-segments -o %t.separate.pa…
107 …sections --no-entry --shared-memory --max-memory=131072 --no-merge-data-segments -o %t.separate.pa…
113 ; PASSIVE-SEPARATE-NEXT: Segments:
/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/
H A DMachOBuilder.h319 Segments.push_back(Segment(*this, SegName));
320 return Segments.back();
350 for (auto &Seg : Segments) {
363 for (auto &Seg : Segments) {
390 for (auto &Seg : Segments) {
406 for (auto &Seg : Segments) {
473 Header.ncmds = Segments.size() + LoadCommands.size();
478 for (auto &Seg : Segments)
490 for (auto &Seg : Segments) {
509 for (auto &Seg : Segments) {
[all...]
/llvm-project/llvm/lib/ProfileData/Coverage/
H A DCoverageMapping.cpp1131 std::vector<CoverageSegment> &Segments; in startSegment()
1134 SegmentBuilder(std::vector<CoverageSegment> &Segments) : Segments(Segments) {} in startSegment()
1146 if (!Segments.empty() && !IsRegionEntry && !EmitSkippedRegion) {
1147 const auto &Last = Segments.back(); in completeRegionsUntil()
1154 Segments.emplace_back(StartLoc.first, StartLoc.second, in completeRegionsUntil()
1158 Segments.emplace_back(StartLoc.first, StartLoc.second, IsRegionEntry); in completeRegionsUntil()
1161 const auto &Last = Segments.back(); in completeRegionsUntil()
1170 /// Emit segments fo in completeRegionsUntil()
1103 std::vector<CoverageSegment> &Segments; global() member in __anonbff5a1500b11::SegmentBuilder
1106 SegmentBuilder(std::vector<CoverageSegment> & Segments) SegmentBuilder() argument
1315 std::vector<CoverageSegment> Segments; buildSegments() local
[all...]
/llvm-project/llvm/include/llvm/ExecutionEngine/Orc/Shared/
H A DTargetProcessControlTypes.h57 std::vector<SegFinalizeRequest> Segments; member
68 std::vector<SharedMemorySegFinalizeRequest> Segments; member
222 return FRAL::size(FR.Segments, FR.Actions); in size()
227 return FRAL::serialize(OB, FR.Segments, FR.Actions); in serialize()
231 return FRAL::deserialize(IB, FR.Segments, FR.Actions); in deserialize()
263 return FRAL::size(FR.Segments, FR.Actions); in size()
268 return FRAL::serialize(OB, FR.Segments, FR.Actions); in serialize()
273 return FRAL::deserialize(IB, FR.Segments, FR.Actions); in deserialize()
/llvm-project/llvm/unittests/CodeGen/
H A DMLRegAllocDevelopmentFeatures.cpp50 setupOverlapProblem(const SmallVectorImpl<LRPosInfoIndexes> &Segments, in setupOverlapProblem()
53 PositionsToReturn.reserve(Segments.size()); in setupOverlapProblem()
54 for (auto CurrentPosIndexInfo : Segments) { in setupOverlapProblem()
61 while (CurrentSegmentIndex < Segments.size()) { in setupOverlapProblem()
68 CurrentPosInfoIndex < Segments.size(); ++CurrentPosInfoIndex) { in setupOverlapProblem()
70 Segments[CurrentPosInfoIndex].StartIndex) { in setupOverlapProblem()
74 Segments[CurrentPosInfoIndex].EndIndex) { in setupOverlapProblem()
49 setupOverlapProblem(const SmallVectorImpl<LRPosInfoIndexes> & Segments,simple_ilist<IndexListEntry> & IndexList) setupOverlapProblem() argument
/llvm-project/compiler-rt/lib/xray/
H A Dxray_segmented_array.h11 // Defines the implementation of a segmented array, with fixed-size segments
12 // backing the segments.
56 // kCacheLineSize-multiple segments, minus the size of two pointers.
167 // Here we keep track of segments in the freelist, to allow us to re-use
168 // segments when elements are trimmed off the end.
205 // allow us to re-use segments we've allocated before. For this we look into in NewSegment()
462 // We compute the number of segments we're going to return from the tail by in trim()
468 // To compute the number of segments to return, we need to perform the in trim()
469 // following calculations for the number of segments required given 'x' in trim()
490 // of segments we need to remove from the end of the data structure: in trim()
[all …]
/llvm-project/lld/test/ELF/
H A Dseparate-segments.s22 ## -z separate-loadable-segments makes all segments separate.
23 # RUN: ld.lld -pie %t.o -z separate-loadable-segments -o %t

12345678910>>...16