Searched refs:BBs (Results 1 - 25 of 32) sorted by relevance

12

/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/
H A DInstIterator.h37 BB_t *BBs; // BasicBlocksType
54 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
58 : BBs(II.BBs), BB(II.BB), BI(II.BI) {}
61 : BBs(&m.getBasicBlockList()), BB(BBs->begin()) { // begin ctor
62 if (BB != BBs->end()) {
69 : BBs(&m.getBasicBlockList()), BB(BBs
[all...]
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DIndirectBrExpandPass.cpp116 SmallVector<BasicBlock *, 4> BBs;
145 int BBIndex = BBs.size() + 1;
146 BBs.push_back(&BB);
158 if (BBs.empty()) {
193 // Otherwise we need to create a new block to hold the switch across BBs,
212 auto *SI = SwitchInst::Create(SwitchValue, BBs[0], BBs.size(), SwitchBB);
215 for (int i : llvm::seq<int>(1, BBs.size()))
216 SI->addCase(ConstantInt::get(CommonITy, i + 1), BBs[i]); local
H A DWasmEHPrepare.cpp153 // Erase the specified BBs if the BB does not have any remaining predecessors,
156 static void eraseDeadBBsAndChildren(const Container &BBs) { argument
157 SmallVector<BasicBlock *, 8> WL(BBs.begin(), BBs.end());
H A DMachineCSE.cpp851 SmallVector<MachineDomTreeNode *, 32> BBs; local
855 BBs.push_back(DT->getRootNode());
857 auto Node = BBs.pop_back_val();
860 BBs.push_back(Child);
865 } while (!BBs.empty());
H A DShrinkWrap.cpp314 static MachineBasicBlock *FindIDom(MachineBasicBlock &Block, ListOfBBs BBs, argument
317 for (MachineBasicBlock *BB : BBs) {
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DInlineSimple.cpp60 const auto &BBs = CS.getCaller()->getBasicBlockList(); variable
61 if (!BBs.empty()) {
62 auto DI = OptimizationRemark(DEBUG_TYPE, "", DebugLoc(), &BBs.front());
H A DBlockExtractor.cpp195 for (auto &BBs : GroupsOfBlocks) {
197 for (BasicBlock *BB : BBs) {
210 CodeExtractorAnalysisCache CEAC(*BBs[0]->getParent());
213 LLVM_DEBUG(dbgs() << "Extracted group '" << (*BBs.begin())->getName()
217 << (*BBs.begin())->getName() << "'\n");
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/
H A DLoopSink.cpp23 // InsertBBs = BBs that uses I
25 // DomBBs = BBs in InsertBBs that are dominated by BB
70 /// Return adjusted total frequency of \p BBs.
78 /// Freq(BBs) = sum(50, 49) = 99
79 /// Even if Freq(BBs) < Freq(Preheader), we will not sink from Preheade to
80 /// BBs as the difference is too small to justify the code size increase.
81 /// To model this, The adjusted Freq(BBs) will be:
82 /// AdjustedFreq(BBs) = 99 / SinkFrequencyPercentThreshold%
83 static BlockFrequency adjustedSumFreq(SmallPtrSetImpl<BasicBlock *> &BBs, argument
86 for (BasicBlock *B : BBs)
181 SmallPtrSet<BasicBlock *, 2> BBs; local
[all...]
H A DConstantHoisting.cpp203 /// Given \p BBs as input, find another set of BBs which collectively
204 /// dominates \p BBs and have the minimal sum of frequencies. Return the BB
205 /// set found in \p BBs.
208 SetVector<BasicBlock *> &BBs) {
209 assert(!BBs.count(Entry) && "Assume Entry is not in BBs");
212 // Candidates includes any block 'BB' in set 'BBs' that is not strictly
213 // dominated by any other blocks in set 'BBs', and all nodes in the path
216 for (auto BB : BBs) {
206 findBestInsertionSet(DominatorTree &DT, BlockFrequencyInfo &BFI, BasicBlock *Entry, SetVector<BasicBlock *> &BBs) argument
313 SetVector<BasicBlock *> BBs; local
[all...]
H A DPlaceSafepoints.cpp661 DenseSet<BasicBlock *> BBs; // new BBs + insertee local
672 scanInlinedCode(&*Start, &*After, Calls, BBs);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/
H A DDependenceGraphBuilder.h41 const BasicBlockListType &BBs)
42 : Graph(G), DI(D), BBList(BBs) {}
40 AbstractDependenceGraphBuilder(GraphType &G, DependenceInfo &D, const BasicBlockListType &BBs) argument
H A DDominanceFrontierImpl.h138 const std::set<BlockT *> &BBs = I->second; local
140 for (const BlockT *BB : BBs) {
H A DRegionInfoImpl.h122 // BBs that are not part of any loop are element of the Loop
903 RegionInfoBase<Tr>::getCommonRegion(SmallVectorImpl<BlockT *> &BBs) const {
904 RegionT *ret = getRegionFor(BBs.back());
905 BBs.pop_back();
907 for (BlockT *BB : BBs)
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUInline.cpp204 const auto &BBs = Caller->getBasicBlockList(); local
205 if (!BBs.empty()) {
206 auto DI = OptimizationRemark(DEBUG_TYPE, "", DebugLoc(), &BBs.front());
/freebsd-11-stable/contrib/llvm-project/llvm/tools/bugpoint/
H A DExtractFunction.cpp372 BugDriver::extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs, argument
384 // Extract all of the blocks except the ones in BBs.
389 if (std::find(BBs.begin(), BBs.end(), &BB) == BBs.end())
393 for (BasicBlock *BB : BBs) {
H A DCrashDebugger.cpp391 void simpleSimplifyCfg(Function &F, SmallVectorImpl<BasicBlock *> &BBs) { argument
395 for (auto *BB : BBs) {
452 bool ReduceCrashingBlocks::TestBlocks(std::vector<const BasicBlock *> &BBs) { argument
459 for (unsigned i = 0, e = BBs.size(); i != e; ++i)
460 Blocks.insert(cast<BasicBlock>(VMap[BBs[i]]));
467 outs() << " " << BBs[i]->getName();
528 BBs.clear();
534 BBs.push_back(cast<BasicBlock>(V));
571 std::vector<const BasicBlock *> &BBs) {
578 for (const auto *BB : BBs)
570 TestBlocks( std::vector<const BasicBlock *> &BBs) argument
675 TestBlocks(std::vector<const BasicBlock *> &BBs) argument
[all...]
H A DMiscompilation.cpp477 Expected<bool> TestFuncs(const std::vector<BasicBlock *> &BBs);
485 ReduceMiscompiledBlocks::TestFuncs(const std::vector<BasicBlock *> &BBs) { argument
489 if (!BBs.empty()) {
490 outs() << "but these " << BBs.size() << " blocks are extracted: ";
491 for (unsigned i = 0, e = BBs.size() < 10 ? BBs.size() : 10; i != e; ++i)
492 outs() << BBs[i]->getName() << " ";
493 if (BBs.size() > 10)
510 for (unsigned i = 0, e = BBs.size(); i != e; ++i) {
511 BasicBlock *BB = cast<BasicBlock>(VMap[BBs[
[all...]
H A DBugDriver.h208 /// only detail is that M is actually a module cloned from the one the BBs are
213 extractMappedBlocksFromModule(const std::vector<BasicBlock *> &BBs,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DSpeculateAnalyses.cpp28 SmallVector<const BasicBlock *, 8> BBs; local
39 BBs.emplace_back(&BB);
41 return BBs;
/freebsd-11-stable/contrib/llvm-project/llvm/tools/llvm-extract/
H A Dllvm-extract.cpp268 SmallVector<BasicBlock *, 16> BBs; local
282 BBs.push_back(&*Res);
284 GroupOfBBs.push_back(BBs);
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/
H A DBasicBlockUtils.h43 /// Replace contents of every block in \p BBs with single unreachable
47 void DetatchDeadBlocks(ArrayRef <BasicBlock *> BBs,
56 /// no predecessors that are not being deleted themselves. \p BBs must have no
61 void DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs,
H A DCodeExtractor.h119 CodeExtractor(ArrayRef<BasicBlock *> BBs, DominatorTree *DT = nullptr,
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/
H A DBasicBlockUtils.cpp55 ArrayRef<BasicBlock *> BBs,
58 for (auto *BB : BBs) {
93 void llvm::DeleteDeadBlocks(ArrayRef <BasicBlock *> BBs, DomTreeUpdater *DTU, argument
97 SmallPtrSet<BasicBlock *, 4> Dead(BBs.begin(), BBs.end());
98 assert(Dead.size() == BBs.size() && "Duplicating blocks?");
105 DetatchDeadBlocks(BBs, DTU ? &Updates : nullptr, KeepOneInputPHIs);
110 for (BasicBlock *BB : BBs)
54 DetatchDeadBlocks( ArrayRef<BasicBlock *> BBs, SmallVectorImpl<DominatorTree::UpdateType> *Updates, bool KeepOneInputPHIs) argument
H A DFunctionComparator.cpp362 // They are BBs in the same function. Order by which comes first in the
914 // the strategy compare() uses to compare functions by walking the BBs in depth
925 SmallVector<const BasicBlock *, 8> BBs; local
930 BBs.push_back(&F.getEntryBlock());
931 VisitedBBs.insert(BBs[0]);
932 while (!BBs.empty()) {
933 const BasicBlock *BB = BBs.pop_back_val();
935 // opcodes into BBs wouldn't affect the hash, only the order of the opcodes
944 BBs.push_back(Term->getSuccessor(i));
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyLowerEmscriptenEHSjLj.cpp953 // Because we are creating new BBs while processing and don't want to make
954 // all these newly created BBs candidates again for longjmp processing, we
955 // first make the vector of candidate BBs.
956 std::vector<BasicBlock *> BBs; local
958 BBs.push_back(&BB);
960 // BBs.size() will change within the loop, so we query it every time
961 for (unsigned I = 0; I < BBs.size(); I++) {
962 BasicBlock *BB = BBs[I];
1048 BBs.push_back(Tail);

Completed in 337 milliseconds

12