/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/Analysis/ |
H A D | MustExecute.h | 74 /// Returns true iff the block \p BB potentially may throw exception. It can 76 virtual bool blockMayThrow(const BasicBlock *BB) const = 0; 82 /// Return true if we must reach the block \p BB under assumption that the 84 bool allLoopPathsLeadToBlock(const Loop *CurLoop, const BasicBlock *BB, 115 virtual bool blockMayThrow(const BasicBlock *BB) const; 144 virtual bool blockMayThrow(const BasicBlock *BB) const; 155 /// we enter \p BB under assumption that \p CurLoop is entered. 156 bool doesNotWriteMemoryBefore(const BasicBlock *BB, const Loop *CurLoop) 165 /// \p Inst into the basic block \p BB. It will make all cache updates to keep 167 void insertInstructionTo(const Instruction *Inst, const BasicBlock *BB); [all...] |
H A D | ProfileSummaryInfo.h | 130 /// Returns true if BasicBlock \p BB is considered hot. 131 bool isHotBlock(const BasicBlock *BB, BlockFrequencyInfo *BFI); 132 /// Returns true if BasicBlock \p BB is considered cold. 133 bool isColdBlock(const BasicBlock *BB, BlockFrequencyInfo *BFI); 134 /// Returns true if BasicBlock \p BB is considered hot with regard to a given 137 const BasicBlock *BB, BlockFrequencyInfo *BFI);
|
H A D | LazyValueInfo.h | 83 Constant *getConstant(Value *V, BasicBlock *BB, Instruction *CxtI = nullptr); 88 ConstantRange getConstantRange(Value *V, BasicBlock *BB, Instruction *CxtI = nullptr); 107 void eraseBlock(BasicBlock *BB);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | RewriteStatepointsForGC.cpp | 965 BasicBlock *BB = I->getParent(); 966 int NumPreds = pred_size(BB); 1222 normalizeForInvokeSafepoint(BasicBlock *BB, BasicBlock *InvokeParent, argument 1224 BasicBlock *Ret = BB; 1225 if (!BB->getUniquePredecessor()) 1226 Ret = SplitBlockPredecessors(BB, InvokeParent, "", &DT); 2563 for (BasicBlock &BB : F) 2564 if (BB.getUniquePredecessor()) { 2566 FoldSingleEntryPHINodes(&BB); 2589 for (BasicBlock &BB 2672 computeLiveOutSeed(BasicBlock *BB, SetVector<Value *> &LiveTmp) argument 2688 computeKillSet(BasicBlock *BB) argument 2717 checkBasicSSA(DominatorTree &DT, GCPtrLivenessData &Data, BasicBlock &BB) argument 2751 BasicBlock *BB = Worklist.pop_back_val(); local 2794 BasicBlock *BB = Inst->getParent(); local [all...] |
H A D | DeadStoreElimination.cpp | 651 /// Find all blocks that will unconditionally lead to the block BB and append 654 BasicBlock *BB, DominatorTree *DT) { 655 for (pred_iterator I = pred_begin(BB), E = pred_end(BB); I != E; ++I) { 657 if (Pred == BB) continue; 682 BasicBlock *BB = Blocks.pop_back_val(); local 683 Instruction *InstPt = BB->getTerminator(); 684 if (BB == F->getParent()) InstPt = F; 687 MD->getPointerDependencyFrom(Loc, false, InstPt->getIterator(), BB); 717 Dep = MD->getPointerDependencyFrom(Loc, false, BBI, BB); 653 findUnconditionalPreds(SmallVectorImpl<BasicBlock *> &Blocks, BasicBlock *BB, DominatorTree *DT) argument 762 handleEndBlock(BasicBlock &BB, AliasAnalysis *AA, MemoryDependenceResults *MD, const TargetLibraryInfo *TLI, InstOverlapIntervalsTy &IOL, OrderedBasicBlock &OBB, MapVector<Instruction *, bool> &ThrowableInst) argument 1089 eliminateDeadStores(BasicBlock &BB, AliasAnalysis *AA, MemoryDependenceResults *MD, DominatorTree *DT, const TargetLibraryInfo *TLI) argument [all...] |
H A D | CorrelatedValuePropagation.cpp | 216 BasicBlock *BB = P->getParent(); local 221 Value *V = LVI->getConstantOnEdge(Incoming, P->getIncomingBlock(i), BB, P); 234 Condition, P->getIncomingBlock(i), BB, P)) { 254 P->getIncomingBlock(i), BB, P) != 341 BasicBlock *BB = I->getParent(); local 345 if (isa<Instruction>(Cond) && cast<Instruction>(Cond)->getParent() == BB) 349 pred_iterator PB = pred_begin(BB), PE = pred_end(BB); 355 for (auto *Succ : successors(BB)) 372 BB, S [all...] |
H A D | GVN.cpp | 240 /// BB - The basic block in question. 241 BasicBlock *BB = nullptr; member in struct:llvm::gvn::AvailableValueInBlock 246 static AvailableValueInBlock get(BasicBlock *BB, AvailableValue &&AV) { argument 248 Res.BB = BB; 253 static AvailableValueInBlock get(BasicBlock *BB, Value *V, argument 255 return get(BB, AvailableValue::get(V, Offset)); 258 static AvailableValueInBlock getUndef(BasicBlock *BB) { argument 259 return get(BB, AvailableValue::getUndef()); 265 return AV.MaterializeAdjustedValue(LI, BB 659 IsValueFullyAvailableInBlock(BasicBlock *BB, DenseMap<BasicBlock*, char> &FullyAvailableBlocks, uint32_t RecurseDepth) argument 751 BasicBlock *BB = AV.BB; local 1445 hasUsersIn(Value *V, BasicBlock *BB) argument 1629 areAllValsInBB(uint32_t Num, const BasicBlock *BB, GVN &Gvn) argument 1754 findLeader(const BasicBlock *BB, uint32_t num) argument 2134 BasicBlock *BB = &*FI++; local 2175 processBlock(BasicBlock *BB) argument 2481 BasicBlock *BB = local 2553 addDeadBlock(BasicBlock *BB) argument [all...] |
H A D | LowerAtomic.cpp | 118 static bool runOnBasicBlock(BasicBlock &BB) { argument 120 for (BasicBlock::iterator DI = BB.begin(), DE = BB.end(); DI != DE;) { 141 for (BasicBlock &BB : F) { 142 Changed |= runOnBasicBlock(BB);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | LoopUnrollPeel.cpp | 92 all_of(Exits, [](const BasicBlock *BB) { 93 return BB->getTerminatingDeoptimizeCall(); 177 for (auto *BB : L.blocks()) { 178 auto *BI = dyn_cast<BranchInst>(BB->getTerminator()); 183 if (L.getLoopLatch() == BB) 507 for (LoopBlocksDFS::RPOIterator BB = BlockBegin; BB != BlockEnd; ++BB) { 508 BasicBlock *NewBB = CloneBasicBlock(*BB, VMap, ".peel", F); 514 VMap[*BB] [all...] |
H A D | LoopUnrollRuntime.cpp | 320 for (LoopBlocksDFS::RPOIterator BB = BlockBegin; BB != BlockEnd; ++BB) { 321 BasicBlock *NewBB = CloneBasicBlock(*BB, VMap, "." + suffix, F); 327 if (CreateRemainderLoop || LI->getLoopFor(*BB) != L || ParentLoop) 328 addClonedBlockToLoopInfo(*BB, NewBB, LI, NewLoops); 330 VMap[*BB] = NewBB; 331 if (Header == *BB) { 338 if (Header == *BB) { 343 BasicBlock *IDomBB = DT->getNode(*BB) [all...] |
H A D | LowerSwitch.cpp | 92 BasicBlock* BB; member in struct:__anon2786::LowerSwitch::CaseRange 95 : Low(low), High(high), BB(bb) {} 176 for (BasicBlock* BB: DeleteList) { 177 LVI->eraseBlock(BB); 178 DeleteDeadBlock(BB); 200 /// Update the first occurrence of the "switch statement" BB in the PHI 201 /// node with the "new" BB. The other occurrences will: 204 /// have more than one outcoming edge into the same BB if they all have the same 265 fixPhis(Begin->BB, OrigBlock, Predecessor, NumMergedCases); 266 return Begin->BB; [all...] |
H A D | DemoteRegToStack.cpp | 50 BasicBlock *BB = SplitCriticalEdge(II, SuccNum); local 51 assert(BB && "Unable to split critical edge."); 52 (void)BB;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Analysis/ |
H A D | LoopInfo.cpp | 421 // Check that 'BB' doesn't have any uses outside of the 'L' 422 static bool isBlockInLCSSAForm(const Loop &L, const BasicBlock &BB, 424 for (const Instruction &I : BB) { 441 if (UserBB != &BB && !L.contains(UserBB) && 451 return all_of(this->blocks(), [&](const BasicBlock *BB) { 452 return isBlockInLCSSAForm(*this, *BB, DT); 460 return all_of(this->blocks(), [&](const BasicBlock *BB) { 461 return isBlockInLCSSAForm(*LI.getLoopFor(BB), *BB, DT); 477 for (BasicBlock *BB [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/Mips/ |
H A D | Mips16HardFloat.cpp | 46 static void EmitInlineAsm(LLVMContext &C, BasicBlock *BB, StringRef AsmText) { argument 54 CallInst::Create(IA, AsmArgs, "", BB); 279 BasicBlock *BB = BasicBlock::Create(Context, "entry", FStub); local 342 EmitInlineAsm(Context, BB, AsmText); 344 new UnreachableInst(Context, BB); 382 for (auto &BB: F) 383 for (auto &I: BB) { 464 BasicBlock *BB = BasicBlock::Create(Context, "entry", FStub); local 478 EmitInlineAsm(Context, BB, AsmText); 480 new UnreachableInst(FStub->getContext(), BB); [all...] |
H A D | MipsISelLowering.cpp | 1296 MachineBasicBlock *BB) const { 1301 return emitAtomicBinaryPartword(MI, BB, 1); 1303 return emitAtomicBinaryPartword(MI, BB, 2); 1305 return emitAtomicBinary(MI, BB); 1307 return emitAtomicBinary(MI, BB); 1310 return emitAtomicBinaryPartword(MI, BB, 1); 1312 return emitAtomicBinaryPartword(MI, BB, 2); 1314 return emitAtomicBinary(MI, BB); 1316 return emitAtomicBinary(MI, BB); 1319 return emitAtomicBinaryPartword(MI, BB, 1616 emitSignExtendToI32InReg( MachineInstr &MI, MachineBasicBlock *BB, unsigned Size, unsigned DstReg, unsigned SrcReg) const argument 1646 emitAtomicBinaryPartword( MachineInstr &MI, MachineBasicBlock *BB, unsigned Size) const argument 1894 emitAtomicCmpSwapPartword( MachineInstr &MI, MachineBasicBlock *BB, unsigned Size) const argument 4544 emitPseudoSELECT(MachineInstr &MI, MachineBasicBlock *BB, bool isFPCmp, unsigned Opc) const argument [all...] |
/freebsd-11-stable/contrib/llvm-project/compiler-rt/lib/fuzzer/ |
H A D | FuzzerDataFlowTrace.cpp | 40 // BBs, and X,Y,Z, if present, are the indecies of covered BB. 41 // BB #0, which is the entry block, is not explicitly listed. 57 uint32_t BB = 0; local 58 SS >> BB; local 60 CoveredBlocks.push_back(BB); 65 for (auto BB : CoveredBlocks) 66 if (BB >= NumBlocks) return false; 77 for (auto BB : CoveredBlocks) 78 Counters[BB]++;
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/IR/ |
H A D | IRBuilder.cpp | 46 Module &M = *BB->getParent()->getParent(); 57 assert(BB && BB->getParent() && "No current function!"); 58 return BB->getParent()->getReturnType(); 69 BB->getInstList().insert(InsertPt, BCI); 106 Module *M = BB->getParent()->getParent(); 134 Module *M = BB->getParent()->getParent(); 175 Module *M = BB->getParent()->getParent(); 216 Module *M = BB->getParent()->getParent(); 254 Module *M = BB [all...] |
/freebsd-11-stable/contrib/llvm-project/clang/lib/CodeGen/ |
H A D | CGBuilder.h | 33 llvm::BasicBlock *BB, 57 CGBuilderTy(const CodeGenTypeCache &TypeCache, llvm::BasicBlock *BB) argument 58 : CGBuilderBaseTy(BB), TypeCache(TypeCache) {} 181 const llvm::DataLayout &DL = BB->getParent()->getParent()->getDataLayout(); 201 const llvm::DataLayout &DL = BB->getParent()->getParent()->getDataLayout(); 219 const llvm::DataLayout &DL = BB->getParent()->getParent()->getDataLayout(); 234 const llvm::DataLayout &DL = BB->getParent()->getParent()->getDataLayout(); 260 const llvm::DataLayout &DL = BB->getParent()->getParent()->getDataLayout(); 308 const llvm::DataLayout &DL = BB->getParent()->getParent()->getDataLayout();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/CodeGen/ |
H A D | DwarfEHPrepare.cpp | 172 BasicBlock *BB = RI->getParent(); local 175 simplifyCFG(BB, TTI); 187 for (BasicBlock &BB : Fn) { 188 if (auto *RI = dyn_cast<ResumeInst>(BB.getTerminator())) 190 if (auto *LP = BB.getLandingPadInst()) 219 // Instead of creating a new BB and PHI node, just append the call to
|
H A D | MachineLICM.cpp | 155 // Register pressure on path leading from loop preheader to current BB. 235 bool IsGuaranteedToExecute(MachineBasicBlock *BB); 252 void InitRegPressure(MachineBasicBlock *BB); 275 void InitCSEMap(MachineBasicBlock *BB); 538 for (MachineBasicBlock *BB : CurLoop->getBlocks()) { 541 const MachineLoop *ML = MLI->getLoopFor(BB); 547 for (const auto &LI : BB->liveins()) { 553 for (MachineInstr &MI : *BB) 610 for (MachineBasicBlock *BB : CurLoop->getBlocks()) { 611 if (!BB 649 IsGuaranteedToExecute(MachineBasicBlock *BB) argument 721 MachineBasicBlock *BB = Node->getBlock(); local 843 InitRegPressure(MachineBasicBlock *BB) argument 1377 InitCSEMap(MachineBasicBlock *BB) argument [all...] |
/freebsd-11-stable/contrib/llvm-project/llvm/include/llvm/CodeGen/ |
H A D | MachineModuleInfo.h | 227 MCSymbol *getAddrLabelSymbol(const BasicBlock *BB) { argument 228 return getAddrLabelSymbolToEmit(BB).front(); 234 ArrayRef<MCSymbol *> getAddrLabelSymbolToEmit(const BasicBlock *BB);
|
H A D | LiveVariables.h | 174 /// register which is used in a PHI node. We map that to the BB the vreg 276 MachineBasicBlock *BB); 278 MachineBasicBlock *BB, 292 /// addNewBlock - Add a new basic block BB between DomBB and SuccBB. All 294 /// as passing live through BB. This method assumes that the machine code is 296 void addNewBlock(MachineBasicBlock *BB,
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
H A D | WebAssemblyExceptionInfo.cpp | 132 // Add successors dominated by the current BB to the worklist. 161 if (const auto *BB = MBB->getBasicBlock()) 162 if (BB->hasName()) 163 OS << "." << BB->getName();
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
H A D | SIModeRegister.cpp | 384 for (MachineBasicBlock &BB : MF) 385 processBlockPhase1(BB, TII); 390 for (MachineBasicBlock &BB : MF) 391 Phase2List.push(&BB); 399 for (MachineBasicBlock &BB : MF) 400 processBlockPhase3(BB, TII);
|
/freebsd-11-stable/contrib/llvm-project/llvm/lib/Transforms/Instrumentation/ |
H A D | PoisonChecking.cpp | 262 for (BasicBlock &BB : F) 263 for (auto I = BB.begin(); isa<PHINode>(&*I); I++) { 274 for (BasicBlock &BB : F) 275 for (Instruction &I : BB) { 302 for (BasicBlock &BB : F) 303 for (auto I = BB.begin(); isa<PHINode>(&*I); I++) {
|