Home
last modified time | relevance | path

Searched refs:Blocks (Results 1 – 25 of 259) sorted by relevance

1234567891011

/llvm-project-15.0.7/bolt/lib/Core/
H A DFunctionLayout.cpp22 Fragments.emplace_back(Blocks.size()); in addFragment()
39 BB->setLayoutIndex(Blocks.size()); in addBasicBlock()
40 Blocks.emplace_back(BB); in addBasicBlock()
74 Blocks.erase(std::remove_if(Blocks.begin(), Blocks.end(), IsErased), in eraseBasicBlocks()
75 Blocks.end()); in eraseBasicBlocks()
91 Blocks.clear(); in update()
126 Blocks = {}; in clear()
135 if (BBPos == Blocks.end()) in getBasicBlockAfter()
139 if (BlockAfter == Blocks.end()) in getBasicBlockAfter()
161 return find(Blocks, BB); in findBasicBlockPos()
[all …]
/llvm-project-15.0.7/bolt/lib/Passes/
H A DThreeWayBranch.cpp99 std::vector<std::pair<BinaryBasicBlock *, unsigned>> Blocks; in runOnFunction() local
100 Blocks.push_back(std::make_pair(FirstEndpoint, FirstCC)); in runOnFunction()
101 Blocks.push_back(std::make_pair(SecondEndpoint, SecondCC)); in runOnFunction()
102 Blocks.push_back(std::make_pair(ThirdEndpoint, ThirdCC)); in runOnFunction()
116 BB->addSuccessor(Blocks[2].first, Blocks[2].first->getExecutionCount()); in runOnFunction()
120 BB->addSuccessor(Blocks[2].first, Blocks[2].first->getExecutionCount()); in runOnFunction()
125 SecondBranch->addSuccessor(Blocks[0].first, in runOnFunction()
127 SecondBranch->addSuccessor(Blocks[1].first, in runOnFunction()
135 Ctx, Blocks[2].second); in runOnFunction()
139 BC.MIB->getInvertedCondCode(Blocks[2].second)); in runOnFunction()
[all …]
/llvm-project-15.0.7/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp175 Blocks[BlockID] = this; in topologicalSort()
201 Blocks[BlockID] = this; in topologicalFinalSort()
262 for (auto *Block : Blocks) in renumberInstrs()
292 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
297 Blocks[NI] = Blocks[I]; in computeNormalForm()
298 Blocks[NI]->BlockID = NI; in computeNormalForm()
301 Blocks.drop(NumUnreachableBlocks); in computeNormalForm()
305 for (auto *Block : Blocks) in computeNormalForm()
318 for (auto *Block : Blocks.reverse()) { in computeNormalForm()
324 for (auto *Block : Blocks) { in computeNormalForm()
[all …]
/llvm-project-15.0.7/llvm/unittests/DebugInfo/MSF/
H A DMSFCommonTest.cpp107 EXPECT_EQ(1u, SL.Blocks.size()); in TEST()
108 EXPECT_EQ(SB.FreeBlockMapBlock, SL.Blocks.front()); in TEST()
112 EXPECT_EQ(1u, SL.Blocks.size()); in TEST()
113 EXPECT_EQ(3u - SB.FreeBlockMapBlock, SL.Blocks.front()); in TEST()
119 EXPECT_EQ(2u, SL.Blocks.size()); in TEST()
120 EXPECT_EQ(SB.FreeBlockMapBlock, SL.Blocks[0]); in TEST()
121 EXPECT_EQ(SB.FreeBlockMapBlock + SB.BlockSize, SL.Blocks[1]); in TEST()
125 EXPECT_EQ(2u, SL.Blocks.size()); in TEST()
126 EXPECT_EQ(3u - SB.FreeBlockMapBlock, SL.Blocks[0]); in TEST()
127 EXPECT_EQ(3u - SB.FreeBlockMapBlock + SB.BlockSize, SL.Blocks[1]); in TEST()
[all …]
H A DMSFBuilderTest.cpp85 std::vector<uint32_t> Blocks = {4, 5, 6, 7, 8, 9, 10, 11, 12}; in TEST_F() local
93 EXPECT_THAT_EXPECTED(Msf.addStream(Blocks.size() * 4096, Blocks), in TEST_F()
96 for (auto B : Blocks) { in TEST_F()
100 uint32_t FreeBlockStart = Blocks.back() + 1; in TEST_F()
128 auto Blocks = Msf2.getStreamBlocks(0); in TEST_F() local
129 EXPECT_EQ(1U, Blocks.size()); in TEST_F()
251 std::vector<uint32_t> Blocks = {2, 3}; in TEST_F() local
252 EXPECT_THAT_EXPECTED(Msf.addStream(6144, Blocks), Failed()); in TEST_F()
382 std::vector<uint32_t> Blocks(BlocksRef.begin(), BlocksRef.end()); in TEST_F() local
392 EXPECT_THAT(Blocks, Not(Contains(1 + I * 4096))); in TEST_F()
[all …]
/llvm-project-15.0.7/llvm/include/llvm/XRay/
H A DProfile.h89 : Blocks(std::move(O.Blocks)), NodeStorage(std::move(O.NodeStorage)), in Profile()
94 Blocks = std::move(O.Blocks);
107 swap(L.Blocks, R.Blocks); in swap()
125 BlockList Blocks; variable
141 const_iterator begin() const { return Blocks.begin(); } in begin()
142 const_iterator end() const { return Blocks.end(); } in end()
143 bool empty() const { return Blocks.empty(); } in empty()
/llvm-project-15.0.7/llvm/test/tools/llvm-pdbutil/
H A Dstripped.test25 ; CHECK-NEXT: Blocks: [4]
27 ; CHECK-NEXT: Blocks: [14]
29 ; CHECK-NEXT: Blocks: [13]
31 ; CHECK-NEXT: Blocks: [7]
33 ; CHECK-NEXT: Blocks: [6]
35 ; CHECK-NEXT: Blocks: []
37 ; CHECK-NEXT: Blocks: [8]
39 ; CHECK-NEXT: Blocks: [9]
41 ; CHECK-NEXT: Blocks: [11]
45 ; CHECK-NEXT: Blocks: []
[all …]
/llvm-project-15.0.7/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp87 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
90 for (auto *MBB : Blocks) { in ReachabilityGraph()
126 const BlockSet &Blocks; member in __anon537f6e6b0111::ReachabilityGraph
143 for (auto *MBB : Blocks) { in calculate()
168 for (auto *MBB : Blocks) { in calculate()
199 BlockSet &getBlocks() { return Blocks; } in getBlocks()
205 BlockSet Blocks; member in __anon537f6e6b0111::LoopBlocks
212 Blocks.insert(Entry); in calculate()
223 if (Blocks.insert(MBB).second) { in calculate()
361 Blocks.insert(Dispatch); in makeSingleEntryLoop()
[all …]
H A DWebAssemblyExceptionInfo.h47 std::vector<MachineBasicBlock *> Blocks; variable
73 void addToBlocksVector(MachineBasicBlock *MBB) { Blocks.push_back(MBB); } in addToBlocksVector()
75 Blocks.push_back(MBB); in addBlock()
78 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; } in getBlocks()
85 unsigned getNumBlocks() const { return Blocks.size(); } in getNumBlocks()
86 std::vector<MachineBasicBlock *> &getBlocksVector() { return Blocks; } in getBlocksVector()
103 void reserveBlocks(unsigned Size) { Blocks.reserve(Size); } in reserveBlocks()
105 std::reverse(Blocks.begin() + From, Blocks.end());
/llvm-project-15.0.7/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp174 assert(Blocks.count(H)); in createNaturalLoopInternal()
223 for (auto BB : Blocks) { in createNaturalLoopInternal()
257 SetVector<BasicBlock *> &Blocks, in createNaturalLoop() argument
259 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers); in createNaturalLoop()
263 SetVector<BasicBlock *> &Blocks, in createNaturalLoop() argument
265 createNaturalLoopInternal(LI, DT, &L, Blocks, Headers); in createNaturalLoop()
275 SetVector<BasicBlock *> Blocks; in makeReducible() local
280 Blocks.insert(BB); in makeReducible()
291 for (auto BB : reverse(Blocks)) { in makeReducible()
296 if (!Blocks.count(P)) { in makeReducible()
[all …]
H A DCodeExtractor.cpp292 if (Blocks.count(Succ)) in getCommonExitBlock()
378 if (Blocks.count(&BB)) in isLegalToShrinkwrapLifetimeMarkers()
392 if (!Blocks.count(Pred)) in findOrCreateBlockForHoisting()
430 if (Blocks.count(Pred)) in findOrCreateBlockForHoisting()
520 if (Blocks.count(BB)) in findAllocas()
620 if (Blocks.empty()) in isEligible()
637 if (Blocks.count(&BB)) in isEligible()
701 Blocks.remove(OldPred); in severSplitPHINodesOfEntry()
702 Blocks.insert(NewBB); in severSplitPHINodesOfEntry()
775 Blocks.insert(NewBB); in severSplitPHINodesOfExits()
[all …]
H A DSampleProfileInference.cpp614 auto &Block = Func.Blocks[I]; in joinIsolatedComponents()
621 Func.Blocks[Func.Entry].Flow += 1; in joinIsolatedComponents()
762 auto SrcBlock = &Func.Blocks[I]; in rebalanceUnknownSubgraphs()
1037 uint64_t NumBlocks = Func.Blocks.size(); in initializeNetwork()
1042 if (Func.Blocks[Func.Entry].Weight == 0) { in initializeNetwork()
1043 Func.Blocks[Func.Entry].Weight = 1; in initializeNetwork()
1057 auto &Block = Func.Blocks[B]; in initializeNetwork()
1133 uint64_t NumBlocks = Func.Blocks.size(); in extractWeights()
1137 auto &Block = Func.Blocks[Src]; in extractWeights()
1187 auto &Block = Func.Blocks[I]; in verifyWeights()
[all …]
/llvm-project-15.0.7/bolt/include/bolt/Core/
H A DFunctionLayout.h133 BasicBlockListType Blocks;
177 BinaryBasicBlock *getBlock(unsigned Index) const { return Blocks[Index]; } in getBlock()
201 size_t block_size() const { return Blocks.size(); } in block_size()
202 bool block_empty() const { return Blocks.empty(); } in block_empty()
203 BinaryBasicBlock *block_front() const { return Blocks.front(); } in block_front()
204 BinaryBasicBlock *block_back() const { return Blocks.back(); } in block_back()
205 block_const_iterator block_begin() const { return Blocks.begin(); } in block_begin()
206 block_const_iterator block_end() const { return Blocks.end(); } in block_end()
210 block_const_reverse_iterator block_rbegin() const { return Blocks.rbegin(); } in block_rbegin()
211 block_const_reverse_iterator block_rend() const { return Blocks.rend(); } in block_rend()
/llvm-project-15.0.7/llvm/lib/DebugInfo/PDB/Native/
H A DLinePrinter.cpp149 ArrayRef<support::ulittle32_t> Blocks = Layout.Blocks; in computeBlockRuns() local
150 assert(!Blocks.empty()); in computeBlockRuns()
152 uint32_t CurrentBlock = Blocks[0]; in computeBlockRuns()
154 while (!Blocks.empty()) { in computeBlockRuns()
156 uint32_t NextBlock = Blocks.front(); in computeBlockRuns()
166 Blocks = Blocks.drop_front(); in computeBlockRuns()
254 auto Blocks = makeArrayRef(StreamLayout.Blocks); in formatMsfStreamBlocks() local
259 assert(!Blocks.empty()); in formatMsfStreamBlocks()
260 OS << formatv("Block {0} (\n", uint32_t(Blocks.front())); in formatMsfStreamBlocks()
265 uint64_t BaseOffset = Blocks.front(); in formatMsfStreamBlocks()
[all …]
/llvm-project-15.0.7/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp193 Blocks.insert(Pred); in collectElseRegionBlocks()
196 if (Cur < Blocks.size()) in collectElseRegionBlocks()
197 MBB = Blocks[Cur++]; in collectElseRegionBlocks()
204 for (auto *MBB : Blocks) in collectElseRegionBlocks()
339 Blocks.insert(MBB); in collectWaterfallCandidateRegisters()
379 if (!Blocks.contains(Succ) && in collectWaterfallCandidateRegisters()
402 SetVector<MachineBasicBlock *> Blocks; in updateLiveRangeInThenRegion() local
412 Blocks.insert(Succ); in updateLiveRangeInThenRegion()
559 if (Blocks.contains(UseBlock)) in optimizeWaterfallLiveRange()
567 if (Blocks.contains(Pred)) in optimizeWaterfallLiveRange()
[all …]
/llvm-project-15.0.7/clang-tools-extra/clang-tidy/llvm/
H A DIncludeOrderCheck.cpp115 std::vector<unsigned> Blocks(1, 0); in EndOfMainFile() local
119 Blocks.push_back(I); in EndOfMainFile()
120 Blocks.push_back(FileDirectives.size()); // Sentinel value. in EndOfMainFile()
128 for (unsigned BI = 0, BE = Blocks.size() - 1; BI != BE; ++BI) in EndOfMainFile()
129 llvm::sort(IncludeIndices.begin() + Blocks[BI], in EndOfMainFile()
130 IncludeIndices.begin() + Blocks[BI + 1], in EndOfMainFile()
146 for (unsigned BI = 0, BE = Blocks.size() - 1; BI != BE; ++BI) { in EndOfMainFile()
149 for (I = Blocks[BI], E = Blocks[BI + 1]; I != E; ++I) in EndOfMainFile()
/llvm-project-15.0.7/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp118 ArrayRef<BasicBlock *> Blocks; member in __anon7f9656e30111::LockstepReverseIterator
124 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
131 for (BasicBlock *BB : Blocks) in reset()
134 for (BasicBlock *BB : Blocks) { in reset()
198 SmallVector<BasicBlock *, 4> Blocks; member
241 Blocks.push_back(P.first); in ModelledPHI()
273 auto BI = Blocks.begin(); in restrictToBlocks()
275 while (BI != Blocks.end()) { in restrictToBlocks()
278 BI = Blocks.erase(BI); in restrictToBlocks()
309 return Values == Other.Values && Blocks == Other.Blocks; in operator ==()
[all …]
H A DMergeICmps.cpp406 [](const auto &Blocks) { return Blocks.size() > 1; }); in atLeastOneMerged() argument
426 for (const BCECmpBlock &Block : Blocks) in getMinOrigOrder()
438 llvm::sort(Blocks, in mergeBlocks()
445 for (BCECmpBlock &Block : Blocks) { in mergeBlocks()
473 for (BasicBlock *const Block : Blocks) { in BCECmpChain()
744 Blocks[BlockIndex] = CurBlock; in getOrderedBlocks()
760 Blocks[0] = CurBlock; in getOrderedBlocks()
761 return Blocks; in getOrderedBlocks()
820 const auto Blocks = in processPhi() local
822 if (Blocks.empty()) return false; in processPhi()
[all …]
H A DFlattenCFGPass.cpp51 std::vector<WeakVH> Blocks; in iterativelyFlattenCFG() local
52 Blocks.reserve(F.size()); in iterativelyFlattenCFG()
54 Blocks.push_back(&BB); in iterativelyFlattenCFG()
60 for (WeakVH &BlockHandle : Blocks) { in iterativelyFlattenCFG()
/llvm-project-15.0.7/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h74 std::vector<FlowBlock> Blocks;
169 Func.Blocks.reserve(BasicBlocks.size());
180 Block.Index = Func.Blocks.size();
181 Func.Blocks.push_back(Block);
193 Func.Blocks[BlockIndex[BB]].HasSelfEdge = true;
198 Func.Blocks[Jump.Source].SuccJumps.push_back(&Jump);
199 Func.Blocks[Jump.Target].PredJumps.push_back(&Jump);
206 for (size_t I = 0; I < Func.Blocks.size(); I++) {
207 if (Func.Blocks[I].isEntry()) {
220 BlockWeights[BB] = Func.Blocks[BlockIndex[BB]].Flow;
/llvm-project-15.0.7/llvm/tools/bugpoint/
H A DCrashDebugger.cpp467 if (NumPrint < Blocks.size()) in TestBlocks()
500 for (BasicBlock *BB : Blocks) in TestBlocks()
507 if (!Blocks.count(&BB)) in TestBlocks()
588 if (NumPrint < Blocks.size()) in TestBlocks()
595 if (!Blocks.count(&BB)) { in TestBlocks()
615 if (!Blocks.count(&BB)) in TestBlocks()
692 if (NumPrint < Blocks.size()) in TestBlocks()
1256 Blocks.push_back(&BB); in DebugACrash()
1265 if (Blocks.size() < OldSize) in DebugACrash()
1278 Blocks.push_back(&BB); in DebugACrash()
[all …]
/llvm-project-15.0.7/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h74 std::vector<const CFGBlock *> Blocks; variable
87 iterator begin() { return Blocks.rbegin(); } in begin()
88 iterator end() { return Blocks.rend(); } in end()
90 const_iterator begin() const { return Blocks.rbegin(); } in begin()
91 const_iterator end() const { return Blocks.rend(); } in end()
/llvm-project-15.0.7/llvm/lib/CodeGen/
H A DMachinePostDominators.cpp52 ArrayRef<MachineBasicBlock *> Blocks) const { in findNearestCommonDominator()
53 assert(!Blocks.empty()); in findNearestCommonDominator()
55 MachineBasicBlock *NCD = Blocks.front(); in findNearestCommonDominator()
56 for (MachineBasicBlock *BB : Blocks.drop_front()) { in findNearestCommonDominator()
/llvm-project-15.0.7/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h70 std::vector<BlockT *> Blocks; variable
82 Blocks.clear(); in clear()
88 void appendBlock(BlockT *Block) { Blocks.push_back(Block); } in appendBlock()
112 return is_contained(Blocks, Block); in contains()
175 return const_block_iterator{Blocks.begin()}; in block_begin()
178 return const_block_iterator{Blocks.end()}; in block_end()
180 size_t getNumBlocks() const { return Blocks.size(); } in getNumBlocks()
213 for (auto *Block : Blocks) { in print()
/llvm-project-15.0.7/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp63 SL.Blocks = Layout.StreamMap[StreamIndex]; in createIndexedStream()
74 SL.Blocks = Layout.DirectoryBlocks; in createDirectoryStream()
175 if (StreamLayout.Blocks[Last] != StreamLayout.Blocks[Last + 1] - 1) in readLongestContiguousChunk()
186 uint64_t MsfOffset = blockToOffset(StreamLayout.Blocks[First], BlockSize); in readLongestContiguousChunk()
215 uint64_t E = StreamLayout.Blocks[BlockNum]; in tryReadContiguously()
217 if (StreamLayout.Blocks[I + BlockNum] != E) in tryReadContiguously()
227 uint64_t FirstBlockAddr = StreamLayout.Blocks[BlockNum]; in tryReadContiguously()
251 uint64_t StreamBlockAddr = StreamLayout.Blocks[BlockNum]; in readBytes()
331 SL.Blocks = Layout.StreamMap[StreamIndex]; in createIndexedStream()
341 SL.Blocks = Layout.DirectoryBlocks; in createDirectoryStream()
[all …]

1234567891011