Home
last modified time | relevance | path

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

12345678

/openbsd-src/gnu/llvm/clang/lib/Analysis/
H A DThreadSafetyTIL.cpp165 unsigned BasicBlock::topologicalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalSort() argument
170 ID = Block->topologicalSort(Blocks, ID); in topologicalSort()
175 Blocks[BlockID] = this; in topologicalSort()
189 unsigned BasicBlock::topologicalFinalSort(SimpleArray<BasicBlock *> &Blocks, in topologicalFinalSort() argument
196 ID = DominatorNode.Parent->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
198 ID = Pred->topologicalFinalSort(Blocks, ID); in topologicalFinalSort()
199 assert(static_cast<size_t>(ID) < Blocks.size()); in topologicalFinalSort()
201 Blocks[BlockID] = this; in topologicalFinalSort()
262 for (auto *Block : Blocks) in renumberInstrs()
292 unsigned NumUnreachableBlocks = Entry->topologicalSort(Blocks, Blocks.size()); in computeNormalForm()
[all …]
H A DPostOrderCFGView.cpp22 Blocks.reserve(cfg->getNumBlockIDs()); in PostOrderCFGView()
27 BlockOrder[*I] = Blocks.size() + 1; in PostOrderCFGView()
28 Blocks.push_back(*I); in PostOrderCFGView()
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/lib/Target/WebAssembly/
H A DWebAssemblyFixIrreducibleControlFlow.cpp86 ReachabilityGraph(MachineBasicBlock *Entry, const BlockSet &Blocks) in ReachabilityGraph() argument
87 : Entry(Entry), Blocks(Blocks) { in ReachabilityGraph()
90 for (auto *MBB : Blocks) { in ReachabilityGraph()
126 const BlockSet &Blocks; member in __anon177248720111::ReachabilityGraph
131 bool inRegion(MachineBasicBlock *MBB) const { return Blocks.count(MBB); } in inRegion()
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 __anon177248720111::LoopBlocks
212 Blocks.insert(Entry); in calculate()
[all …]
H A DWebAssemblyExceptionInfo.h46 std::vector<MachineBasicBlock *> Blocks; variable
72 void addToBlocksVector(MachineBasicBlock *MBB) { Blocks.push_back(MBB); } in addToBlocksVector()
74 Blocks.push_back(MBB); in addBlock()
77 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; } in getBlocks()
84 unsigned getNumBlocks() const { return Blocks.size(); } in getNumBlocks()
85 std::vector<MachineBasicBlock *> &getBlocksVector() { return Blocks; } in getBlocksVector()
102 void reserveBlocks(unsigned Size) { Blocks.reserve(Size); } in reserveBlocks()
104 std::reverse(Blocks.begin() + From, Blocks.end());
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp119 SetVector<BasicBlock *> &Blocks, in INITIALIZE_PASS_DEPENDENCY()
128 return L == NewLoop || !Blocks.contains(L->getHeader()); in INITIALIZE_PASS_DEPENDENCY()
169 SetVector<BasicBlock *> &Blocks, in createNaturalLoopInternal() argument
174 assert(Blocks.count(H)); in createNaturalLoopInternal()
223 for (auto *BB : Blocks) { in createNaturalLoopInternal()
236 reconnectChildLoops(LI, ParentLoop, NewLoop, Blocks, Headers); 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()
[all …]
H A DCodeExtractor.cpp252 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), in CodeExtractor()
261 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, in CodeExtractor()
268 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
270 if (Blocks.count(I->getParent())) in definedInRegion()
278 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
281 if (!Blocks.count(I->getParent())) in definedInCaller()
286 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { in getCommonExitBlock() argument
291 if (Blocks.count(Succ)) in getCommonExitBlock()
303 if (any_of(Blocks, hasNonCommonExitSucc)) in getCommonExitBlock()
375 Function *Func = (*Blocks.begin())->getParent(); in isLegalToShrinkwrapLifetimeMarkers()
[all …]
H A DSampleProfileInference.cpp625 auto &Block = Func.Blocks[I]; in joinIsolatedComponents()
632 Func.Blocks[Func.Entry].Flow += 1; in joinIsolatedComponents()
635 Func.Blocks[Jump->Target].Flow += 1; in joinIsolatedComponents()
654 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findReachable()
686 if (Func.Blocks[Source].isExit() && Target == AnyExitBlock) in findShortestPath()
702 (Func.Blocks[Src].isExit() && Target == AnyExitBlock)) in findShortestPath()
705 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findShortestPath()
721 if (Func.Blocks[I].isExit() && Parent[I] != nullptr) { in findShortestPath()
757 std::min(Func.Blocks[Func.Entry].Flow, in jumpDistance()
764 uint64_t NumBlocks() const { return Func.Blocks.size(); } in NumBlocks()
[all …]
/openbsd-src/gnu/llvm/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 = ArrayRef(StreamLayout.Blocks); in formatMsfStreamBlocks() local
259 assert(!Blocks.empty()); in formatMsfStreamBlocks()
260 OS << formatv("Block {0} (\n", uint32_t(Blocks.front())); in formatMsfStreamBlocks()
264 cantFail(File.getBlockData(Blocks.front(), File.getBlockSize())); in formatMsfStreamBlocks()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Target/AMDGPU/
H A DSIOptimizeVGPRLiveRange.cpp117 SmallSetVector<MachineBasicBlock *, 2> &Blocks,
185 SmallSetVector<MachineBasicBlock *, 16> &Blocks) const { in collectElseRegionBlocks()
192 if (Pred != Flow && !Blocks.contains(Pred)) in collectElseRegionBlocks()
193 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()
333 SmallSetVector<MachineBasicBlock *, 2> &Blocks, in collectWaterfallCandidateRegisters() argument
339 Blocks.insert(MBB); in collectWaterfallCandidateRegisters()
372 if (!Blocks.contains(DefMBB) && !CandidateRegs.contains(MOReg)) { in collectWaterfallCandidateRegisters()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp116 ArrayRef<BasicBlock *> Blocks; member in __anon97a272aa0111::LockstepReverseIterator
122 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
129 for (BasicBlock *BB : Blocks) in reset()
132 for (BasicBlock *BB : Blocks) { in reset()
155 void restrictToBlocks(SmallSetVector<BasicBlock *, 4> &Blocks) { in restrictToBlocks() argument
157 if (!llvm::is_contained(Blocks, (*II)->getParent())) { in restrictToBlocks()
196 SmallVector<BasicBlock *, 4> Blocks; member
227 SmallVector<BasicBlock *, 4> Blocks; member in __anon97a272aa0111::ModelledPHI
239 Blocks.push_back(P.first); in ModelledPHI()
257 llvm::copy(B, std::back_inserter(Blocks)); in ModelledPHI()
[all …]
H A DMergeICmps.cpp403 BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi,
411 [](const auto &Blocks) { return Blocks.size() > 1; }); in atLeastOneMerged() argument
429 static unsigned getMinOrigOrder(const BCECmpChain::ContiguousBlocks &Blocks) { in getMinOrigOrder() argument
431 for (const BCECmpBlock &Block : Blocks) in getMinOrigOrder()
439 mergeBlocks(std::vector<BCECmpBlock> &&Blocks) { in mergeBlocks() argument
443 llvm::sort(Blocks, in mergeBlocks()
450 for (BCECmpBlock &Block : Blocks) { in mergeBlocks()
471 BCECmpChain::BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi, in BCECmpChain() argument
474 assert(!Blocks.empty() && "a chain should have at least one block"); in BCECmpChain()
478 for (BasicBlock *const Block : Blocks) { in BCECmpChain()
[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()
/openbsd-src/gnu/llvm/llvm/tools/bugpoint/
H A DCrashDebugger.cpp457 SmallPtrSet<BasicBlock *, 8> Blocks; in TestBlocks() local
459 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); in TestBlocks()
462 unsigned NumPrint = Blocks.size(); in TestBlocks()
467 if (NumPrint < Blocks.size()) in TestBlocks()
468 outs() << "... <" << Blocks.size() << " total>"; in TestBlocks()
474 if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { in TestBlocks()
500 for (BasicBlock *BB : Blocks) in TestBlocks()
507 if (!Blocks.count(&BB)) in TestBlocks()
577 SmallPtrSet<const BasicBlock *, 8> Blocks; in TestBlocks() local
579 Blocks.insert(cast<BasicBlock>(VMap[BB])); in TestBlocks()
[all …]
/openbsd-src/gnu/llvm/compiler-rt/lib/scudo/standalone/tests/
H A Dprimary_test.cpp198 typename Primary::CacheT::CompactPtrT Blocks[TransferBatch::MaxNumCached]; in TEST() local
213 B->copyToArray(Blocks); in TEST()
214 Allocator.pushBlocks(&Cache, ClassId, Blocks, B->getCount()); in TEST()
349 std::vector<scudo::uptr> Blocks; in SCUDO_TYPED_TEST() local
353 Blocks.push_back(reinterpret_cast<scudo::uptr>(Cache.allocate(ClassId))); in SCUDO_TYPED_TEST()
355 std::shuffle(Blocks.begin(), Blocks.end(), R); in SCUDO_TYPED_TEST()
358 while (!Blocks.empty()) { in SCUDO_TYPED_TEST()
359 Cache.deallocate(ClassId, reinterpret_cast<void *>(Blocks.back())); in SCUDO_TYPED_TEST()
360 Blocks.pop_back(); in SCUDO_TYPED_TEST()
365 Blocks.push_back(reinterpret_cast<scudo::uptr>(Cache.allocate(ClassId))); in SCUDO_TYPED_TEST()
[all …]
/openbsd-src/gnu/llvm/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()
/openbsd-src/gnu/llvm/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h77 std::vector<FlowBlock> Blocks;
241 BlockWeights[BB] = Func.Blocks[BlockIndex[BB]].Flow;
267 Func.Blocks.reserve(BasicBlocks.size());
278 Block.Index = Func.Blocks.size();
279 Func.Blocks.push_back(Block);
295 Func.Blocks[Src].SuccJumps.push_back(&Jump);
296 Func.Blocks[Dst].PredJumps.push_back(&Jump);
303 for (size_t I = 0; I < Func.Blocks.size(); I++) {
304 if (Func.Blocks[I].isEntry()) {
312 auto &EntryBlock = Func.Blocks[Func.Entry];
/openbsd-src/gnu/llvm/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()
H A DEdgeBundles.cpp57 Blocks.clear(); in runOnMachineFunction()
58 Blocks.resize(getNumBundles()); in runOnMachineFunction()
63 Blocks[b0].push_back(i); in runOnMachineFunction()
65 Blocks[b1].push_back(i); in runOnMachineFunction()
/openbsd-src/gnu/llvm/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()
114 return is_contained(Blocks, Block); in contains()
177 return const_block_iterator{Blocks.begin()}; in block_begin()
180 return const_block_iterator{Blocks.end()}; in block_end()
182 size_t getNumBlocks() const { return Blocks.size(); } in getNumBlocks()
215 for (auto *Block : Blocks) { in print()
H A DGenericCycleImpl.h180 NewParent->Blocks.insert(NewParent->Blocks.end(), Child->block_begin(), in moveTopLevelCycleToNewParent()
268 assert(!is_contained(NewCycle->Blocks, Block)); in run()
269 NewCycle->Blocks.push_back(Block); in run()
399 DenseSet<BlockT *> Blocks; in validateTree() local
419 for (BlockT *Block : Cycle->Blocks) { in validateTree()
423 check(Blocks.insert(Block).second); // duplicates in block list? in validateTree()
425 Blocks.clear(); in validateTree()
430 check(is_contained(Cycle->Blocks, Entry)); in validateTree()
450 check(is_contained(Cycle->Blocks, Block)); in validateTree()
/openbsd-src/gnu/llvm/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 …]
/openbsd-src/gnu/llvm/llvm/include/llvm/Analysis/
H A DLoopInfo.h80 std::vector<BlockT *> Blocks; variable
190 return Blocks; in getBlocks()
204 return Blocks.size(); in getNumBlocks()
211 return Blocks; in getBlocksVector()
442 Blocks.push_back(BB); in addBlockEntry()
449 std::reverse(Blocks.begin() + from, Blocks.end()); in reverseBlock()
455 Blocks.reserve(size); in reserveBlocks()
462 if (Blocks[0] == BB) in moveToHeader()
465 assert(i != Blocks.size() && "Loop does not contain BB!"); in moveToHeader()
466 if (Blocks[i] == BB) { in moveToHeader()
[all …]
/openbsd-src/gnu/llvm/llvm/lib/DebugInfo/CodeView/
H A DDebugLinesSubsection.cpp78 Blocks.emplace_back(Offset); in createBlock()
82 Block &B = Blocks.back(); in addLineInfo()
93 Block &B = Blocks.back(); in addLineAndColumnInfo()
113 for (const auto &B : Blocks) { in commit()
139 for (const auto &B : Blocks) { in calculateSerializedSize()
/openbsd-src/gnu/llvm/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
H A DFunctionSummary.h97 llvm::SmallBitVector &Blocks = I->second.VisitedBasicBlocks; in markVisitedBasicBlock() local
99 if (TotalIDs > Blocks.size()) { in markVisitedBasicBlock()
100 Blocks.resize(TotalIDs); in markVisitedBasicBlock()
103 Blocks.set(ID); in markVisitedBasicBlock()

12345678