Home
last modified time | relevance | path

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

1234567

/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/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()
/freebsd/contrib/llvm-project/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 __anon5f812d3b0111::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 __anon5f812d3b0111::LoopBlocks
212 Blocks.insert(Entry); in calculate()
[all …]
H A DWebAssemblyExceptionInfo.h47 std::vector<MachineBasicBlock *> Blocks;
73 void addToBlocksVector(MachineBasicBlock *MBB) { Blocks.push_back(MBB); } in addBlock()
75 Blocks.push_back(MBB); in addBlock()
78 ArrayRef<MachineBasicBlock *> getBlocks() const { return Blocks; }
85 unsigned getNumBlocks() const { return Blocks.size(); } in getBlocksVector()
86 std::vector<MachineBasicBlock *> &getBlocksVector() { return Blocks; } in getBlocksSet()
103 void reserveBlocks(unsigned Size) { Blocks.reserve(Size); }
105 std::reverse(Blocks.begin() + From, Blocks.end());
46 std::vector<MachineBasicBlock *> Blocks; global() variable
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DFixIrreducible.cpp116 SetVector<BasicBlock *> &Blocks, in INITIALIZE_PASS_DEPENDENCY()
125 return L == NewLoop || !Blocks.contains(L->getHeader()); in INITIALIZE_PASS_DEPENDENCY()
166 SetVector<BasicBlock *> &Blocks,
171 assert(Blocks.count(H)); in createNaturalLoopInternal()
220 for (auto *BB : Blocks) { in createNaturalLoopInternal()
233 reconnectChildLoops(LI, ParentLoop, NewLoop, Blocks, Headers); in createNaturalLoopInternal()
254 SetVector<BasicBlock *> &Blocks, in unwrapBlock()
256 createNaturalLoopInternal(LI, DT, nullptr, Blocks, Headers); in createNaturalLoop()
260 SetVector<BasicBlock *> &Blocks, in createNaturalLoop()
262 createNaturalLoopInternal(LI, DT, &L, Blocks, Header
169 createNaturalLoopInternal(LoopInfo & LI,DominatorTree & DT,Loop * ParentLoop,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoopInternal() argument
257 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Function * F,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
263 createNaturalLoop(LoopInfo & LI,DominatorTree & DT,Loop & L,SetVector<BasicBlock * > & Blocks,SetVector<BasicBlock * > & Headers) createNaturalLoop() argument
275 SetVector<BasicBlock *> Blocks; makeReducible() local
[all...]
H A DCodeExtractor.cpp253 Blocks(buildExtractionBlockSet(BBs, DT, AllowVarArgs, AllowAlloca)), in CodeExtractor()
262 Blocks(buildExtractionBlockSet(L.getBlocks(), &DT, in CodeExtractor()
269 static bool definedInRegion(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInRegion() argument
271 if (Blocks.count(I->getParent())) in definedInRegion()
279 static bool definedInCaller(const SetVector<BasicBlock *> &Blocks, Value *V) { in definedInCaller() argument
282 if (!Blocks.count(I->getParent())) in definedInCaller()
287 static BasicBlock *getCommonExitBlock(const SetVector<BasicBlock *> &Blocks) { in getCommonExitBlock() argument
292 if (Blocks.count(Succ)) in getCommonExitBlock()
304 if (any_of(Blocks, hasNonCommonExitSucc)) in getCommonExitBlock()
376 Function *Func = (*Blocks.begin())->getParent(); in isLegalToShrinkwrapLifetimeMarkers()
[all …]
H A DSampleProfileInference.cpp626 auto &Block = Func.Blocks[I]; in joinIsolatedComponents()
633 Func.Blocks[Func.Entry].Flow += 1; in joinIsolatedComponents()
636 Func.Blocks[Jump->Target].Flow += 1; in joinIsolatedComponents()
655 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findReachable()
687 if (Func.Blocks[Source].isExit() && Target == AnyExitBlock) in findShortestPath()
703 (Func.Blocks[Src].isExit() && Target == AnyExitBlock)) in findShortestPath()
706 for (auto *Jump : Func.Blocks[Src].SuccJumps) { in findShortestPath()
722 if (Func.Blocks[I].isExit() && Parent[I] != nullptr) { in findShortestPath()
758 std::min(Func.Blocks[Func.Entry].Flow, in jumpDistance()
765 uint64_t NumBlocks() const { return Func.Blocks.size(); } in NumBlocks()
[all …]
/freebsd/contrib/llvm-project/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 …]
/freebsd/contrib/llvm-project/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 …]
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DGVNSink.cpp113 ArrayRef<BasicBlock *> Blocks; member in __anonac6bc9b30111::LockstepReverseIterator
119 LockstepReverseIterator(ArrayRef<BasicBlock *> Blocks) : Blocks(Blocks) { in LockstepReverseIterator() argument
126 for (BasicBlock *BB : Blocks) in reset()
129 for (BasicBlock *BB : Blocks) { in reset()
152 void restrictToBlocks(SmallSetVector<BasicBlock *, 4> &Blocks) { in restrictToBlocks() argument
154 if (!Blocks.contains((*II)->getParent())) { in restrictToBlocks()
193 SmallVector<BasicBlock *, 4> Blocks; member
224 SmallVector<BasicBlock *, 4> Blocks; member in __anonac6bc9b30111::ModelledPHI
246 Blocks.push_back(P.first); in ModelledPHI()
262 assert(Values.size() > 1 && Blocks.size() > 1 && in verifyModelledPHI()
[all …]
H A DMergeICmps.cpp405 BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi,
413 [](const auto &Blocks) { return Blocks.size() > 1; }); in atLeastOneMerged() argument
431 static unsigned getMinOrigOrder(const BCECmpChain::ContiguousBlocks &Blocks) { in getMinOrigOrder() argument
433 for (const BCECmpBlock &Block : Blocks) in getMinOrigOrder()
441 mergeBlocks(std::vector<BCECmpBlock> &&Blocks) { in mergeBlocks() argument
445 llvm::sort(Blocks, in mergeBlocks()
452 for (BCECmpBlock &Block : Blocks) { in mergeBlocks()
473 BCECmpChain::BCECmpChain(const std::vector<BasicBlock *> &Blocks, PHINode &Phi, in BCECmpChain() argument
476 assert(!Blocks.empty() && "a chain should have at least one block"); in BCECmpChain()
480 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()
/freebsd/contrib/llvm-project/llvm/include/llvm/Support/
H A DGenericLoopInfo.h65 std::vector<BlockT *> Blocks; variable
175 return Blocks; in getBlocks()
189 return Blocks.size(); in getNumBlocks()
196 return Blocks; in getBlocksVector()
417 Blocks.push_back(BB);
421 /// interface to reverse Blocks[from, end of loop] in this loop
424 std::reverse(Blocks.begin() + from, Blocks.end());
427 /// interface to do reserve() for Blocks in addBlockEntry()
430 Blocks in addBlockEntry()
[all...]
/freebsd/contrib/llvm-project/clang/lib/AST/Interp/
H A DEvaluationResult.cpp178 llvm::SetVector<const Block *> &Blocks) { in collectBlocks() argument
187 Blocks.insert(Ptr.block()); in collectBlocks()
197 collectBlocks(FieldPtr, Blocks); in collectBlocks()
201 if (isUsefulPtr(Pointee) && !Blocks.contains(Pointee.block())) in collectBlocks()
202 collectBlocks(Pointee, Blocks); in collectBlocks()
207 if (isUsefulPtr(ElemPointee) && !Blocks.contains(ElemPointee.block())) in collectBlocks()
208 collectBlocks(ElemPointee, Blocks); in collectBlocks()
213 collectBlocks(ElemPtr, Blocks); in collectBlocks()
223 llvm::SetVector<const Block *> Blocks; in checkReturnValue() local
225 collectBlocks(Ptr, Blocks); in checkReturnValue()
[all …]
/freebsd/contrib/llvm-project/llvm/tools/bugpoint/
H A DCrashDebugger.cpp473 SmallPtrSet<BasicBlock *, 8> Blocks; in TestBlocks() local
475 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]])); in TestBlocks()
478 unsigned NumPrint = Blocks.size(); in TestBlocks()
483 if (NumPrint < Blocks.size()) in TestBlocks()
484 outs() << "... <" << Blocks.size() << " total>"; in TestBlocks()
490 if (!Blocks.count(&BB) && BB.getTerminator()->getNumSuccessors()) { in TestBlocks()
516 for (BasicBlock *BB : Blocks) in TestBlocks()
523 if (!Blocks.count(&BB)) in TestBlocks()
586 SmallPtrSet<const BasicBlock *, 8> Blocks; in TestBlocks() local
588 Blocks.insert(cast<BasicBlock>(VMap[BB])); in TestBlocks()
[all …]
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DSampleProfileInference.h55 std::vector<FlowBlock> Blocks; member
219 BlockWeights[BB] = Func.Blocks[BlockIndex[BB]].Flow; in apply()
246 Func.Blocks.reserve(BasicBlocks.size()); in createFlowFunction()
257 Block.Index = Func.Blocks.size(); in createFlowFunction()
258 Func.Blocks.push_back(Block); in createFlowFunction()
274 Func.Blocks[Src].SuccJumps.push_back(&Jump); in createFlowFunction()
275 Func.Blocks[Dst].PredJumps.push_back(&Jump); in createFlowFunction()
282 for (size_t I = 0; I < Func.Blocks.size(); I++) { in createFlowFunction()
283 if (Func.Blocks[I].isEntry()) { in createFlowFunction()
291 auto &EntryBlock = Func.Blocks[Fun in createFlowFunction()
[all...]
/freebsd/contrib/llvm-project/clang/include/clang/Analysis/Analyses/
H A DPostOrderCFGView.h108 std::vector<const CFGBlock *> Blocks; variable
121 iterator begin() { return Blocks.rbegin(); } in begin()
122 iterator end() { return Blocks.rend(); } in end()
124 const_iterator begin() const { return Blocks.rbegin(); } in begin()
125 const_iterator end() const { return Blocks.rend(); } in end()
/freebsd/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp62 SL.Blocks = Layout.StreamMap[StreamIndex]; in createIndexedStream()
73 SL.Blocks = Layout.DirectoryBlocks; in createDirectoryStream()
174 if (StreamLayout.Blocks[Last] != StreamLayout.Blocks[Last + 1] - 1) in readLongestContiguousChunk()
185 uint64_t MsfOffset = blockToOffset(StreamLayout.Blocks[First], BlockSize); in readLongestContiguousChunk()
214 uint64_t E = StreamLayout.Blocks[BlockNum]; in tryReadContiguously()
216 if (StreamLayout.Blocks[I + BlockNum] != E) in tryReadContiguously()
226 uint64_t FirstBlockAddr = StreamLayout.Blocks[BlockNum]; in tryReadContiguously()
250 uint64_t StreamBlockAddr = StreamLayout.Blocks[BlockNum]; in readBytes()
330 SL.Blocks in createIndexedStream()
[all...]
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A DGenericCycleInfo.h68 BlockSetVectorT Blocks; variable
80 Blocks.clear(); in clear()
86 void appendBlock(BlockT *Block) { Blocks.insert(Block); } in appendBlock()
111 bool contains(const BlockT *Block) const { return Blocks.contains(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()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
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()
H A DMachinePostDominators.cpp96 ArrayRef<MachineBasicBlock *> Blocks) const { in findNearestCommonDominator()
97 assert(!Blocks.empty()); in findNearestCommonDominator()
99 MachineBasicBlock *NCD = Blocks.front(); in findNearestCommonDominator()
100 for (MachineBasicBlock *BB : Blocks.drop_front()) { in findNearestCommonDominator()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/Analysis/
H A DSPIRVConvergenceRegionAnalysis.h58 SmallPtrSet<BasicBlock *, 8> Blocks = {}; variable
67 BasicBlock *Entry, SmallPtrSet<BasicBlock *, 8> &&Blocks,
75 Blocks(std::move(CR.Blocks)) {} in ConvergenceRegion()
81 bool contains(const BasicBlock *BB) const { return Blocks.count(BB) != 0; } in contains()
H A DSPIRVConvergenceRegionAnalysis.cpp103 if (Child->Blocks.count(Entry) != 0) { in findParentRegion()
129 Blocks.insert(&B); in ConvergenceRegion()
138 SmallPtrSet<BasicBlock *, 8> &&Blocks, SmallPtrSet<BasicBlock *, 2> &&Exits) in ConvergenceRegion() argument
140 Exits(std::move(Exits)), Blocks(std::move(Blocks)) { in ConvergenceRegion()
142 assert(this->Blocks.count(BB) != 0); in ConvergenceRegion()
143 assert(this->Blocks.count(this->Entry) != 0); in ConvergenceRegion()
182 for (const auto &Block : Blocks) { in dump()
/freebsd/contrib/llvm-project/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()

1234567