Home
last modified time | relevance | path

Searched defs:BBI (Results 1 – 25 of 45) sorted by relevance

12

/external/llvm/lib/CodeGen/
DIfConversion.cpp147 BBInfo &BBI; member
324 BBInfo &BBI = Token->BBI; in INITIALIZE_PASS_DEPENDENCY() local
452 bool IfConverter::ReverseBranchCondition(BBInfo &BBI) { in ReverseBranchCondition()
644 void IfConverter::ScanInstructions(BBInfo &BBI) { in ScanInstructions()
727 bool IfConverter::FeasibilityAnalysis(BBInfo &BBI, in FeasibilityAnalysis()
783 BBInfo &BBI = BBAnalysis[BB->getNumber()]; in AnalyzeBlock() local
1001 void IfConverter::RemoveExtraEdges(BBInfo &BBI) { in RemoveExtraEdges()
1071 bool IfConverter::IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) { in IfConvertSimple()
1157 bool IfConverter::IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) { in IfConvertTriangle()
1304 bool IfConverter::IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, in IfConvertDiamond()
[all …]
DPHIElimination.cpp539 for (const auto &BBI : MBB) { in analyzePHINodes() local
558 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); in SplitPHIEdges() local
DGCRootLowering.cpp298 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE; in FindSafePoints() local
DLiveVariables.cpp711 for (const auto &BBI : MBB) { in analyzePHINodes() local
771 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); in addNewBlock() local
DAnalysis.cpp513 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) { in isInTailCallPosition() local
/external/llvm/lib/Transforms/Scalar/
DTailRecursionElimination.cpp410 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; /*in loop*/) { in runTRE() local
520 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { in getCommonReturnValue() local
581 BasicBlock::iterator BBI(TI); in FindTRECandidate() local
642 BasicBlock::iterator BBI(CI); in EliminateRecursiveTailCall() local
781 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) in EliminateRecursiveTailCall() local
DMergedLoadStoreMotion.cpp260 for (BasicBlock::iterator BBI = BB1->begin(), BBE = BB1->end(); BBI != BBE; in canHoistFromBlock() local
367 for (BasicBlock::iterator BBI = Succ0->begin(), BBE = Succ0->end(); in mergeLoads() local
DSimplifyCFGPass.cpp60 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; ) { in mergeEmptyReturnBlocks() local
DDeadStoreElimination.cpp490 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { in runOnBasicBlock() local
820 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){ in handleEndBlock() local
DMemCpyOptimizer.cpp485 bool MemCpyOpt::processStore(StoreInst *SI, BasicBlock::iterator &BBI) { in processStore()
565 bool MemCpyOpt::processMemSet(MemSetInst *MSI, BasicBlock::iterator &BBI) { in processMemSet()
/external/llvm/lib/Analysis/
DLoads.cpp121 BasicBlock::iterator BBI = ScanFrom->getIterator(), in isSafeToLoadUnconditionally() local
DLazyValueInfo.cpp537 static LVILatticeVal getFromRangeMetadata(Instruction *BBI) { in getFromRangeMetadata()
575 Instruction *BBI = dyn_cast<Instruction>(Val); in solveBlockValue() local
787 Instruction *BBI) { in mergeAssumeBlockValueConstantRange()
813 Instruction *BBI, in solveBlockValueConstantRange()
/external/llvm/unittests/IR/
DDominatorTreeTest.cpp36 BasicBlock::iterator BBI = BB0->begin(); in runOnFunction() local
DPassManagerTest.cpp41 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) in run() local
/external/llvm/lib/Transforms/Utils/
DLoopUnroll.cpp373 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local
460 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local
DSimplifyCFG.cpp172 for (BasicBlock::iterator BBI = (*I)->begin(); in SafeToMergeTerminators() local
211 for (BasicBlock::iterator BBI = (*I)->begin(); in isProfitableToFoldUnconditional() local
1060 for (BasicBlock::iterator BBI = SI->begin(); in isSafeToHoistInvoke() local
1155 for (BasicBlock::iterator BBI = SI->begin(); in HoistThenElseCodeToIf() local
1192 for (BasicBlock::iterator BBI = SI->begin(); in HoistThenElseCodeToIf() local
1519 for (BasicBlock::iterator BBI = ThenBB->begin(), in SpeculativelyExecuteBB() local
1691 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) { in BlockIsSimpleEnoughToThreadThrough() local
1764 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) { in FoldCondBranchOnPHI() local
2733 BasicBlock::iterator BBI = BB->begin(); in SimplifyCondBranchToCondBranch() local
3225 for (BasicBlock::iterator BBI = EdgeBB->begin(); in SimplifyBranchOnICmpChain() local
[all …]
DLoopSimplify.cpp84 Function::iterator BBI = --NewBB->getIterator(); in placeSplitBlockCarefully() local
98 Function::iterator BBI = SplitPreds[i]->getIterator(); in placeSplitBlockCarefully() local
DLoopUnrollRuntime.cpp77 for (BasicBlock::iterator BBI = (*SBI)->begin(); in ConnectProlog() local
DLocal.cpp828 BasicBlock::iterator BBI = BB->begin(); in TryToSimplifyUncondBranchFromEmptyBlock() local
1210 BasicBlock::iterator BBI = I->getIterator(), BBE = BB->end(); in changeToUnreachable() local
1253 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ in markAliveBlocks() local
/external/llvm/lib/Transforms/InstCombine/
DInstCombineLoadStoreAlloca.cpp791 BasicBlock::iterator BBI(LI); in visitLoadInst() local
1061 BasicBlock::iterator BBI(SI); in visitStoreInst() local
1181 BasicBlock::iterator BBI(OtherBB->getTerminator()); in SimplifyStoreAtEndOfBlock() local
/external/llvm/lib/Transforms/IPO/
DLoopExtractor.cpp262 Function::iterator BBI = MF->begin(); in runOnModule() local
/external/llvm/lib/Target/AArch64/
DAArch64BranchRelaxation.cpp135 const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()]; in dumpBBs() local
/external/llvm/lib/Target/NVPTX/
DNVPTXGenericToNVVM.cpp112 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE; in runOnModule() local
/external/llvm/lib/Transforms/ObjCARC/
DObjCARCContract.cpp432 BasicBlock::iterator BBI = Inst->getIterator(); in tryToPeepholeInstruction() local
/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h379 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); in FindExistingPHI() local

12