Home
last modified time | relevance | path

Searched refs:BBs (Results 1 – 25 of 40) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstIterator.h37 BB_t *BBs; // BasicBlocksType variable
54 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
58 : BBs(II.BBs), BB(II.BB), BI(II.BI) {} in InstIterator()
61 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor in InstIterator()
62 if (BB != BBs->end()) { in InstIterator()
69 : BBs(&m.getBasicBlockList()), BB(BBs->end()) { // end ctor in InstIterator()
80 return BB == y.BB && (BB == BBs->end() || BI == y.BI);
96 while (BB == BBs->end() || BI == BB->begin()) {
113 if (BB == BBs->end()) break; in advanceToNextBB()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp132 SmallVector<BasicBlock *, 4> BBs; in runImpl() local
161 int BBIndex = BBs.size() + 1; in runImpl()
162 BBs.push_back(&BB); in runImpl()
174 if (BBs.empty()) { in runImpl()
258 auto *SI = SwitchInst::Create(SwitchValue, BBs[0], BBs.size(), SwitchBB); in runImpl()
261 for (int i : llvm::seq<int>(1, BBs.size())) in runImpl()
262 SI->addCase(ConstantInt::get(CommonITy, i + 1), BBs[i]); in runImpl()
268 Updates.reserve(Updates.size() + BBs.size()); in runImpl()
269 for (BasicBlock *BB : BBs) { in runImpl()
H A DWasmEHPrepare.cpp175 static void eraseDeadBBsAndChildren(const Container &BBs) { in eraseDeadBBsAndChildren() argument
176 SmallVector<BasicBlock *, 8> WL(BBs.begin(), BBs.end()); in eraseDeadBBsAndChildren()
H A DMachineCSE.cpp903 SmallVector<MachineDomTreeNode *, 32> BBs; in PerformSimplePRE() local
907 BBs.push_back(DT->getRootNode()); in PerformSimplePRE()
909 auto Node = BBs.pop_back_val(); in PerformSimplePRE()
910 append_range(BBs, Node->children()); in PerformSimplePRE()
915 } while (!BBs.empty()); in PerformSimplePRE()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Instrumentation/
H A DBlockCoverageInference.h78 static std::string getBlockNames(ArrayRef<const BasicBlock *> BBs);
79 static std::string getBlockNames(BlockSet BBs) { in getBlockNames() argument
80 return getBlockNames(ArrayRef<const BasicBlock *>(BBs.begin(), BBs.end())); in getBlockNames()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DConstantHoisting.cpp215 SetVector<BasicBlock *> &BBs) { in findBestInsertionSet() argument
216 assert(!BBs.count(Entry) && "Assume Entry is not in BBs"); in findBestInsertionSet()
223 for (auto *BB : BBs) { in findBestInsertionSet()
242 } while (!BBs.count(Node)); in findBestInsertionSet()
275 bool NodeInBBs = BBs.count(Node); in findBestInsertionSet()
280 BBs.clear(); in findBestInsertionSet()
283 BBs.insert(Entry); in findBestInsertionSet()
285 BBs.insert_range(InsertPts); in findBestInsertionSet()
319 SetVector<BasicBlock *> BBs; in findConstantInsertionPoint() local
323 BBs.insert(MatInsertPt->getParent()); in findConstantInsertionPoint()
[all …]
H A DLoopSink.cpp78 static BlockFrequency adjustedSumFreq(SmallPtrSetImpl<BasicBlock *> &BBs, in adjustedSumFreq() argument
81 for (BasicBlock *B : BBs) in adjustedSumFreq()
83 if (BBs.size() > 1) in adjustedSumFreq()
191 SmallPtrSet<BasicBlock *, 2> BBs; in sinkInstruction() local
200 BBs.insert(UI->getParent()); in sinkInstruction()
214 BBs.insert(PhiBB); in sinkInstruction()
220 if (BBs.size() > MaxNumberOfUseBBsForSinking) in sinkInstruction()
225 findBBsToSinkInto(L, BBs, ColdLoopBBs, DT, BFI); in sinkInstruction()
H A DSimplifyCFGPass.cpp90 performBlockTailMerging(Function &F, ArrayRef<BasicBlock *> BBs, in performBlockTailMerging() argument
96 if (BBs.size() < 2) in performBlockTailMerging()
100 Updates->reserve(Updates->size() + BBs.size()); in performBlockTailMerging()
105 auto *Term = BBs[0]->getTerminator(); in performBlockTailMerging()
110 F.getContext(), Twine("common.") + Term->getOpcodeName(), &F, BBs[0]); in performBlockTailMerging()
115 /*NumReservedValues=*/BBs.size(), in performBlockTailMerging()
131 for (BasicBlock *BB : BBs) { in performBlockTailMerging()
219 for (ArrayRef<BasicBlock *> BBs : make_second_range(Structure)) in tailMergeBlocksWithSimilarFunctionTerminators()
220 Changed |= performBlockTailMerging(F, BBs, DTU ? &Updates : nullptr); in tailMergeBlocksWithSimilarFunctionTerminators()
H A DPlaceSafepoints.cpp660 DenseSet<BasicBlock *> BBs; // new BBs + insertee in InsertSafepointPoll() local
671 scanInlinedCode(&*Start, &*After, Calls, BBs); in InsertSafepointPoll()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DBlockExtractor.cpp155 for (auto &BBs : GroupsOfBlocks) { in runOnModule() local
157 for (BasicBlock *BB : BBs) { in runOnModule()
170 CodeExtractorAnalysisCache CEAC(*BBs[0]->getParent()); in runOnModule()
173 LLVM_DEBUG(dbgs() << "Extracted group '" << (*BBs.begin())->getName() in runOnModule()
177 << (*BBs.begin())->getName() << "'\n"); in runOnModule()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DStructuralHash.cpp270 SmallVector<const BasicBlock *, 8> BBs; in update() local
276 BBs.push_back(&F.getEntryBlock()); in update()
277 VisitedBBs.insert(BBs[0]); in update()
278 while (!BBs.empty()) { in update()
279 const BasicBlock *BB = BBs.pop_back_val(); in update()
287 BBs.push_back(Succ); in update()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/
H A DBlockCoverageInference.cpp356 BlockCoverageInference::getBlockNames(ArrayRef<const BasicBlock *> BBs) { in getBlockNames() argument
360 if (!BBs.empty()) { in getBlockNames()
361 OS << BBs.front()->getName(); in getBlockNames()
362 BBs = BBs.drop_front(); in getBlockNames()
364 for (auto *BB : BBs) in getBlockNames()
/freebsd/contrib/llvm-project/llvm/tools/bugpoint/
H A DCrashDebugger.cpp404 void simpleSimplifyCfg(Function &F, SmallVectorImpl<BasicBlock *> &BBs) { in simpleSimplifyCfg() argument
408 for (auto *BB : BBs) { in simpleSimplifyCfg()
464 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock *> &BBs) { in TestBlocks() argument
471 for (const BasicBlock *BB : BBs) in TestBlocks()
479 outs() << " " << BBs[i]->getName(); in TestBlocks()
534 BBs.clear(); in TestBlocks()
540 BBs.push_back(cast<BasicBlock>(V)); in TestBlocks()
577 std::vector<const BasicBlock *> &BBs) { in TestBlocks() argument
584 for (const auto *BB : BBs) in TestBlocks()
593 outs() << " " << BBs[i]->getName(); in TestBlocks()
[all …]
H A DMiscompilation.cpp479 Expected<bool> TestFuncs(const std::vector<BasicBlock *> &BBs);
487 ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock *> &BBs) { in TestFuncs() argument
491 if (!BBs.empty()) { in TestFuncs()
492 outs() << "but these " << BBs.size() << " blocks are extracted: "; in TestFuncs()
493 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i) in TestFuncs()
494 outs() << BBs[i]->getName() << " "; in TestFuncs()
495 if (BBs.size() > 10) in TestFuncs()
512 for (unsigned i = 0, e = BBs.size(); i != e; ++i) { in TestFuncs()
513 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[i]]); in TestFuncs()
H A DExtractFunction.cpp371 BugDriver::extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs, in extractMappedBlocksFromModule() argument
388 if (!llvm::is_contained(BBs, &BB)) in extractMappedBlocksFromModule()
392 for (BasicBlock *BB : BBs) { in extractMappedBlocksFromModule()
H A DBugDriver.h195 /// only detail is that M is actually a module cloned from the one the BBs are
200 extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs,
/freebsd/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceGraphBuilder.h45 const BasicBlockListType &BBs) in AbstractDependenceGraphBuilder() argument
46 : Graph(G), DI(D), BBList(BBs) {} in AbstractDependenceGraphBuilder()
H A DDominanceFrontierImpl.h58 const SetVector<BlockT *> &BBs = I->second; in print() local
60 for (const BlockT *BB : BBs) { in print()
H A DRegionInfoImpl.h866 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<BlockT *> &BBs) const { in getCommonRegion() argument
867 RegionT *ret = getRegionFor(BBs.back()); in getCommonRegion()
868 BBs.pop_back(); in getCommonRegion()
870 for (BlockT *BB : BBs) in getCommonRegion()
/freebsd/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DSpeculateAnalyses.cpp25 SmallVector<const BasicBlock *, 8> BBs; in findBBwithCalls() local
36 BBs.emplace_back(&BB); in findBBwithCalls()
38 return BBs; in findBBwithCalls()
/freebsd/contrib/llvm-project/llvm/tools/llvm-extract/
H A Dllvm-extract.cpp357 std::vector<BasicBlock *> BBs; in main() local
370 BBs.push_back(&*Res); in main()
372 GroupOfBBs.push_back(BBs); in main()
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp62 ArrayRef<BasicBlock *> BBs, in detachDeadBlocks() argument
65 for (auto *BB : BBs) { in detachDeadBlocks()
100 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU, in DeleteDeadBlocks() argument
104 SmallPtrSet<BasicBlock *, 4> Dead(llvm::from_range, BBs); in DeleteDeadBlocks()
105 assert(Dead.size() == BBs.size() && "Duplicating blocks?"); in DeleteDeadBlocks()
112 detachDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs); in DeleteDeadBlocks()
117 for (BasicBlock *BB : BBs) in DeleteDeadBlocks()
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h51 detachDeadBlocks(ArrayRef<BasicBlock *> BBs,
65 LLVM_ABI void DeleteDeadBlocks(ArrayRef<BasicBlock *> BBs,
H A DCodeExtractor.h154 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLowerEmscriptenEHSjLj.cpp1384 std::vector<BasicBlock *> BBs; in handleLongjmpableCallsForEmscriptenSjLj() local
1386 BBs.push_back(&BB); in handleLongjmpableCallsForEmscriptenSjLj()
1389 for (unsigned I = 0; I < BBs.size(); I++) { in handleLongjmpableCallsForEmscriptenSjLj()
1390 BasicBlock *BB = BBs[I]; in handleLongjmpableCallsForEmscriptenSjLj()
1537 BBs.push_back(Tail); in handleLongjmpableCallsForEmscriptenSjLj()

12