/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | PhiValues.cpp | 167 for (const BasicBlock &BB : F) { 168 for (const PHINode &PN : BB.phis()) { 200 for (const BasicBlock &BB : F) 201 for (const PHINode &PN : BB.phis())
|
H A D | InstCount.cpp | 40 void visitBasicBlock(BasicBlock &BB) { ++TotalBlocks; } argument
|
H A D | LegacyDivergenceAnalysis.cpp | 19 // they converge at the immediately post-dominating BB of the paths. 253 BasicBlock *BB = InfluenceStack.back(); local 255 addSuccessorsToInfluenceRegion(BB, End, InfluenceRegion, InfluenceStack); 401 auto &BB = *BI; local 402 OS << "\n " << BB.getName() << ":\n"; 403 for (auto &I : BB.instructionsWithoutDebug()) {
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | ExpandMemCmp.cpp | 58 BasicBlock *BB = nullptr; member in struct:__anon1711::MemCmpExpansion::ResultBlock 253 BasicBlock *BB = BasicBlock::Create(CI->getContext(), "loadbb", local 255 LoadCmpBlocks.push_back(BB); 260 ResBlock.BB = BasicBlock::Create(CI->getContext(), "res_block", 417 BranchInst *CmpBr = BranchInst::Create(ResBlock.BB, NextBB, Cmp); 488 BranchInst *CmpBr = BranchInst::Create(NextBB, ResBlock.BB, Cmp); 507 BasicBlock::iterator InsertPt = ResBlock.BB->getFirstInsertionPt(); 508 Builder.SetInsertPoint(ResBlock.BB, InsertPt); 510 PhiRes->addIncoming(Res, ResBlock.BB); 515 BasicBlock::iterator InsertPt = ResBlock.BB 836 runOnBlock( BasicBlock &BB, const TargetLibraryInfo *TLI, const TargetTransformInfo *TTI, const TargetLowering* TL, const DataLayout& DL, ProfileSummaryInfo *PSI, BlockFrequencyInfo *BFI) argument [all...] |
H A D | PrologEpilogInserter.cpp | 130 void replaceFrameIndices(MachineBasicBlock *BB, MachineFunction &MF, 316 for (MachineFunction::iterator BB = MF.begin(), E = MF.end(); BB != E; ++BB) 317 for (MachineBasicBlock::iterator I = BB->begin(); I != BB->end(); ++I) 1160 MachineBasicBlock *BB = *DFI; local 1161 replaceFrameIndices(BB, MF, SPAdj); 1162 SPState[BB->getNumber()] = SPAdj; 1166 for (auto &BB 1175 replaceFrameIndices(MachineBasicBlock *BB, MachineFunction &MF, int &SPAdj) argument [all...] |
H A D | HardwareLoops.cpp | 400 BasicBlock *BB = L->getLoopPreheader(); local 401 if (UseLoopGuard && BB->getSinglePredecessor() && 402 cast<BranchInst>(BB->getTerminator())->isUnconditional()) 403 BB = BB->getSinglePredecessor(); 405 if (!isSafeToExpandAt(ExitCount, BB->getTerminator(), SE)) { 412 BB->getTerminator()); 422 BeginBB = UseLoopGuard ? BB : L->getLoopPreheader(); 424 << " - Expanded Count in " << BB->getName() << "\n"
|
H A D | TailDuplicator.cpp | 295 static bool isDefLiveOut(unsigned Reg, MachineBasicBlock *BB, argument 300 if (UseMI.getParent() != BB) 316 static void getRegsUsedByPHIs(const MachineBasicBlock &BB, argument 318 for (const auto &MI : BB) { 330 MachineBasicBlock *BB) { 334 LI->second.push_back(std::make_pair(BB, NewReg)); 337 Vals.push_back(std::make_pair(BB, NewReg)); 489 // Folded into the previous BB. 668 /// True if this BB has only one unconditional jump. 682 for (MachineBasicBlock *BB 329 addSSAUpdateEntry(unsigned OrigReg, unsigned NewReg, MachineBasicBlock *BB) argument 689 canCompletelyDuplicateBB(MachineBasicBlock &BB) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | LoopPredication.cpp | 975 BasicBlock *BB = L->getLoopPreheader(); local 976 if (!BB) 979 if (BasicBlock *Pred = BB->getSinglePredecessor()) 980 if (BB == Pred->getSingleSuccessor()) { 981 BB = Pred; 987 if (BasicBlock *Pred = BB->getSinglePredecessor()) { 993 IfTrueBB == BB) 1023 /// Return true if we can be fairly sure that executing block BB will probably 1026 static bool isVeryLikelyToDeopt(BasicBlock *BB) { argument 1027 while (BB [all...] |
H A D | LoopInterchange.cpp | 93 for (BasicBlock *BB : L->blocks()) { 94 // Scan the BB and collect legal loads and stores. 95 for (Instruction &I : *BB) { 348 bool containsUnsafeInstructions(BasicBlock *BB); 589 bool LoopInterchangeLegality::containsUnsafeInstructions(BasicBlock *BB) { argument 590 return any_of(*BB, [](const Instruction &I) { 968 for (auto *BB : OuterLoop->blocks()) 969 for (Instruction &I : BB->instructionsWithoutDebug()) 1036 for (BasicBlock *BB : InnerLoop->blocks()) { 1037 for (Instruction &Ins : *BB) { [all...] |
H A D | GVNSink.cpp | 133 for (BasicBlock *BB : Blocks) 134 ActiveBlocks.insert(BB); 136 for (BasicBlock *BB : Blocks) { 137 if (BB->size() <= 1) { 139 ActiveBlocks.remove(BB); 142 Insts.push_back(BB->getTerminator()->getPrevNode()); 539 auto *BB = Inst->getParent(); 540 for (auto I = std::next(Inst->getIterator()), E = BB->end(); 594 /// Create a ModelledPHI for each PHI in BB, adding to PHIs. 595 void analyzeInitialPHIs(BasicBlock *BB, ModelledPHISe [all...] |
H A D | Scalarizer.cpp | 82 // insert them before BBI in BB. If Cache is nonnull, use it to cache 94 BasicBlock *BB; member in class:__anon2755::Scatterer 250 : BB(bb), BBI(bbi), V(v), CachePtr(cachePtr) { 270 IRBuilder<> Builder(BB, BBI); 331 for (BasicBlock *BB : RPOT) { 332 for (BasicBlock::iterator II = BB->begin(), IE = BB->end(); II != IE;) { 350 BasicBlock *BB = &F->getEntryBlock(); local 351 return Scatterer(BB, BB 857 BasicBlock *BB = Op->getParent(); local [all...] |
H A D | EarlyCSE.cpp | 737 const BasicBlock *BB, const BasicBlock *Pred); 850 const BranchInst *BI, const BasicBlock *BB, 854 assert(BI->getSuccessor(0) == BB || BI->getSuccessor(1) == BB); 855 auto *TorF = (BI->getSuccessor(0) == BB) 856 ? ConstantInt::getTrue(BB->getContext()) 857 : ConstantInt::getFalse(BB->getContext()); 867 (BI->getSuccessor(0) == BB) ? Instruction::And : Instruction::Or; 879 << BB->getName() << "\n"); 885 BasicBlockEdge(Pred, BB))) { 849 handleBranchCondition(Instruction *CondInst, const BranchInst *BI, const BasicBlock *BB, const BasicBlock *Pred) argument 903 BasicBlock *BB = Node->getBlock(); local [all...] |
H A D | LoopUnswitch.cpp | 558 // Return true if the BasicBlock BB is unreachable from the loop header. 560 bool LoopUnswitch::isUnreachableDueToPreviousUnswitching(BasicBlock *BB) { argument 561 auto *Node = DT->getNode(BB)->getIDom(); 581 if (DT->dominates(UnreachableSucc, BB)) 683 for (const auto BB : currentLoop->blocks()) { 684 for (auto &I : *BB) { 828 /// Check to see if all paths from BB exit the loop with no side effects 834 static bool isTrivialLoopExitBlockHelper(Loop *L, BasicBlock *BB, argument 837 if (!Visited.insert(BB).second) { 842 if (!L->contains(BB)) { 869 isTrivialLoopExitBlock(Loop *L, BasicBlock *BB) argument 1334 BasicBlock *BB = *I; local [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/IR/ |
H A D | InstVisitor.h | 104 void visit(BasicBlock &BB) { argument 105 static_cast<SubClass*>(this)->visitBasicBlock(BB); 106 visit(BB.begin(), BB.end()); 112 void visit(BasicBlock *BB) { visit(*BB); } argument 145 void visitBasicBlock(BasicBlock &BB) {} argument
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | GCOVProfiling.cpp | 353 for (auto &BB : *F) { 357 Blocks.insert(std::make_pair(&BB, GCOVBlock(i++, os))); 369 GCOVBlock &getBlock(BasicBlock *BB) { 370 return Blocks.find(BB)->second; 597 for (auto &BB : F) { 598 for (auto &I : BB) { 764 for (auto &BB : F) { 765 GCOVBlock &Block = Func.getBlock(&BB); 766 Instruction *TI = BB.getTerminator(); 775 for (auto &I : BB) { [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCOpts.cpp | 525 void CheckForCFGHazards(const BasicBlock *BB, 528 bool VisitInstructionBottomUp(Instruction *Inst, BasicBlock *BB, 531 bool VisitBottomUp(BasicBlock *BB, 537 bool VisitTopDown(BasicBlock *BB, 758 CloneCallInstForBB(CallInst &CI, BasicBlock &BB, argument 770 const ColorVector &CV = BlockColors.find(&BB)->second; 1229 ObjCARCOpt::CheckForCFGHazards(const BasicBlock *BB, argument 1253 for (const BasicBlock *Succ : successors(BB)) { 1318 Instruction *Inst, BasicBlock *BB, BlotMapVector<Value *, RRInfo> &Retains, 1380 S.HandlePotentialUse(BB, Ins 1317 VisitInstructionBottomUp( Instruction *Inst, BasicBlock *BB, BlotMapVector<Value *, RRInfo> &Retains, BBState &MyStates) argument 1386 VisitBottomUp(BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates, BlotMapVector<Value *, RRInfo> &Retains) argument 1522 VisitTopDown(BasicBlock *BB, DenseMap<const BasicBlock *, BBState> &BBStates, DenseMap<Value *, RRInfo> &Releases) argument 1640 BasicBlock *BB = *PredStack.back().second++; local 2216 FindPredecessorRetainWithSafePath(const Value *Arg, BasicBlock *BB, Instruction *Autorelease, SmallPtrSetImpl<Instruction *> &DepInsts, SmallPtrSetImpl<const BasicBlock *> &Visited, ProvenanceAnalysis &PA) argument 2241 FindPredecessorAutoreleaseWithSafePath(const Value *Arg, BasicBlock *BB, ReturnInst *Ret, SmallPtrSetImpl<Instruction *> &DepInsts, SmallPtrSetImpl<const BasicBlock *> &V, ProvenanceAnalysis &PA) argument [all...] |
H A D | PtrState.cpp | 256 void BottomUpPtrState::HandlePotentialUse(BasicBlock *BB, Instruction *Inst, argument 268 const auto IP = BB->getFirstInsertionPt(); 269 InsertAfter = IP == BB->end() ? std::prev(BB->end()) : IP; 279 if (InsertAfter != BB->end())
|
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | ModuloSchedule.h | 169 MachineBasicBlock *BB; member in class:llvm::ModuloScheduleExpander 217 MachineBasicBlock *BB); 220 void rewriteScheduledInstr(MachineBasicBlock *BB, InstrMapTy &InstrMap, 282 MachineBasicBlock *BB; member in class:llvm::PeelingModuloScheduleExpander 321 /// Converts BB from the original loop body to the rewritten, pipelined 326 /// Peels one iteration of the rewritten kernel (BB) in the specified 341 Register getEquivalentRegisterIn(Register Reg, MachineBasicBlock *BB);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | InlineFunction.cpp | 148 void addIncomingPHIValuesFor(BasicBlock *BB) const { 149 addIncomingPHIValuesForInto(BB, OuterResumeDest); 520 /// This function analyze BB to see if there are any calls, and if so, 524 BasicBlock *BB, BasicBlock *UnwindEdge, 526 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E; ) { 573 return BB; 614 for (Function::iterator BB = FirstNewBlock->getIterator(), E = Caller->end(); 615 BB != E; ++BB) { 523 HandleCallsInBlockInlinedThroughInvoke( BasicBlock *BB, BasicBlock *UnwindEdge, UnwindDestMemoTy *FuncletUnwindMap = nullptr) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/MSP430/ |
H A D | MSP430ISelLowering.cpp | 1427 MachineBasicBlock *BB) const { 1428 MachineFunction *F = BB->getParent(); 1466 BuildMI(*BB, MI, dl, TII.get(MSP430::BIC16rc), MSP430::SR) 1472 BuildMI(*BB, MI, dl, TII.get(RrcOpc), DstReg) 1475 return BB; 1479 const BasicBlock *LLVM_BB = BB->getBasicBlock(); 1480 MachineFunction::iterator I = ++BB->getIterator(); 1491 RemBB->splice(RemBB->begin(), BB, std::next(MachineBasicBlock::iterator(MI)), 1492 BB->end()); 1493 RemBB->transferSuccessorsAndUpdatePHIs(BB); [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/ARM/ |
H A D | ARMParallelDSP.cpp | 225 bool Search(Value *V, BasicBlock *BB, Reduction &R); 226 bool RecordMemoryOps(BasicBlock *BB); 350 bool ARMParallelDSP::RecordMemoryOps(BasicBlock *BB) { argument 355 OrderedBasicBlock OrderedBB(BB); 360 for (auto &I : *BB) { 440 bool ARMParallelDSP::Search(Value *V, BasicBlock *BB, Reduction &R) { argument 448 if (I->getParent() != BB) 464 bool ValidLHS = Search(LHS, BB, R); 465 bool ValidRHS = Search(RHS, BB, R); 478 return Search(I->getOperand(0), BB, [all...] |
H A D | MVETailPredication.cpp | 146 auto FindLoopIterations = [](BasicBlock *BB) -> IntrinsicInst* { 147 for (auto &I : *BB) { 174 for (auto *BB : L->getBlocks()) { 175 for (auto &I : *BB) { 303 for (auto *BB : L->getBlocks()) { 304 for (auto &I : *BB) {
|
/freebsd-11-stable/sys/cddl/contrib/opensolaris/uts/common/sys/ |
H A D | sysmacros.h | 50 #define btod(BB) (((BB) + DEV_BSIZE - 1) >> DEV_BSHIFT) 51 #define btodt(BB) ((BB) >> DEV_BSHIFT) 52 #define lbtod(BB) (((offset_t)(BB) + DEV_BSIZE - 1) >> DEV_BSHIFT)
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/AggressiveInstCombine/ |
H A D | AggressiveInstCombine.cpp | 325 for (BasicBlock &BB : F) { 327 if (!DT.isReachableFromEntry(&BB)) 335 for (Instruction &I : make_range(BB.rbegin(), BB.rend())) { 344 for (BasicBlock &BB : F) 345 SimplifyInstructionsInBlock(&BB);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/PowerPC/ |
H A D | PPCLoopInstrFormPrep.cpp | 336 for (const auto &BB : L->blocks()) 337 for (auto &J : *BB) { 589 BasicBlock *BB = PI; local 590 Instruction *InsPoint = BB->getTerminator(); 692 for (auto &BB : L->blocks()) 693 if (BBChanged.count(BB)) 694 DeleteDeadPHIs(BB); 714 for (auto &BB : L->blocks()) 715 if (BBChanged.count(BB)) 716 DeleteDeadPHIs(BB); 728 BasicBlock *BB = MemI->getParent(); local [all...] |