| /external/llvm/lib/Transforms/Scalar/ |
| D | SimplifyCFGPass.cpp | 90 BasicBlock::iterator BBI = I, BBE = BB->end(); in changeToUnreachable() local
129 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ in markAliveBlocks() local
233 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; ) { in mergeEmptyReturnBlocks() local
|
| D | TailRecursionElimination.cpp | 322 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { in getCommonReturnValue() local
384 BasicBlock::iterator BBI = TI; in FindTRECandidate() local
446 BasicBlock::iterator BBI = CI; in EliminateRecursiveTailCall() local
583 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) in EliminateRecursiveTailCall() local
|
| D | DeadStoreElimination.cpp | 495 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { in runOnBasicBlock() local
753 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){ in handleEndBlock() local
|
| D | MemCpyOptimizer.cpp | 481 bool MemCpyOpt::processStore(StoreInst *SI, BasicBlock::iterator &BBI) { in processStore()
552 bool MemCpyOpt::processMemSet(MemSetInst *MSI, BasicBlock::iterator &BBI) { in processMemSet()
|
| D | CodeGenPrepare.cpp | 282 BasicBlock::iterator BBI = BI; in EliminateMostlyEmptyBlocks() local
316 BasicBlock::const_iterator BBI = BB->begin(); in CanMergeBlocks() local
406 for (BasicBlock::iterator BBI = DestBB->begin(); in EliminateMostlyEmptyBlock() local
|
| /external/llvm/lib/CodeGen/ |
| D | IfConversion.cpp | 141 BBInfo &BBI; member
308 BBInfo &BBI = Token->BBI; in INITIALIZE_PASS_DEPENDENCY() local
437 bool IfConverter::ReverseBranchCondition(BBInfo &BBI) { in ReverseBranchCondition()
629 void IfConverter::ScanInstructions(BBInfo &BBI) { in ScanInstructions()
716 bool IfConverter::FeasibilityAnalysis(BBInfo &BBI, in FeasibilityAnalysis()
752 BBInfo &BBI = BBAnalysis[BB->getNumber()]; in AnalyzeBlock() local
957 void IfConverter::RemoveExtraEdges(BBInfo &BBI) { in RemoveExtraEdges()
1024 bool IfConverter::IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) { in IfConvertSimple()
1096 bool IfConverter::IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) { in IfConvertTriangle()
1207 bool IfConverter::IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, in IfConvertDiamond()
[all …]
|
| D | StrongPHIElimination.cpp | 241 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
274 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
285 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
302 MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
528 for (std::vector<MachineInstr*>::const_iterator BBI = DefInstrs.begin(), in SplitInterferencesForBasicBlock() local
596 for (MachineBasicBlock::iterator BBI = (*SI)->begin(), BBE = (*SI)->end(); in SplitInterferencesForBasicBlock() local
|
| D | PHIElimination.cpp | 533 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); in analyzePHINodes() local
550 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); in SplitPHIEdges() local
|
| D | Analysis.cpp | 290 for (BasicBlock::const_iterator BBI = prior(prior(ExitBB->end())); ; in isInTailCallPosition() local
|
| D | GCStrategy.cpp | 379 for (MachineFunction::iterator BBI = MF.begin(), in FindSafePoints() local
|
| D | LiveVariables.cpp | 707 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); in analyzePHINodes() local
788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); in addNewBlock() local
|
| /external/llvm/lib/Transforms/Utils/ |
| D | LCSSA.cpp | 141 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end(); in runOnLoop() local
227 for (SmallVectorImpl<BasicBlock*>::const_iterator BBI = ExitBlocks.begin(), in ProcessInstruction() local
|
| D | LoopUnroll.cpp | 304 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local
390 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local
|
| D | SimplifyCFG.cpp | 127 for (BasicBlock::iterator BBI = (*I)->begin(); in SafeToMergeTerminators() local
168 for (BasicBlock::iterator BBI = (*I)->begin(); in isProfitableToFoldUnconditional() local
1041 for (BasicBlock::iterator BBI = SI->begin(); in isSafeToHoistInvoke() local
1137 for (BasicBlock::iterator BBI = SI->begin(); in HoistThenElseCodeToIf() local
1398 for (BasicBlock::iterator BBI = ThenBB->begin(), in SpeculativelyExecuteBB() local
1521 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) { in BlockIsSimpleEnoughToThreadThrough() local
1594 for (BasicBlock::iterator BBI = BB->begin(); &*BBI != BI; ++BBI) { in FoldCondBranchOnPHI() local
2273 BasicBlock::iterator BBI = BB->begin(); in SimplifyCondBranchToCondBranch() local
2760 for (BasicBlock::iterator BBI = EdgeBB->begin(); in SimplifyBranchOnICmpChain() local
2893 BasicBlock::iterator BBI = UI; in SimplifyUnreachable() local
[all …]
|
| D | LoopSimplify.cpp | 498 Function::iterator BBI = NewBB; --BBI; in PlaceSplitBlockCarefully() local
512 Function::iterator BBI = SplitPreds[i]; in PlaceSplitBlockCarefully() local
|
| D | LoopUnrollRuntime.cpp | 70 for (BasicBlock::iterator BBI = (*SBI)->begin(); in ConnectProlog() local
|
| /external/llvm/lib/Transforms/InstCombine/ |
| D | InstCombineLoadStoreAlloca.cpp | 366 BasicBlock::iterator BBI = &LI; in visitLoadInst() local
601 BasicBlock::iterator BBI = &SI; in visitStoreInst() local
727 BasicBlock::iterator BBI = OtherBB->getTerminator(); in SimplifyStoreAtEndOfBlock() local
|
| /external/llvm/lib/Analysis/ |
| D | Loads.cpp | 102 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); in isSafeToLoadUnconditionally() local
|
| D | ProfileEstimatorPass.cpp | 366 for (std::set<BasicBlock*>::iterator BBI = BBToVisit.begin(), BBE = BBToVisit.end(); in runOnFunction() local
|
| D | LazyValueInfo.cpp | 518 Instruction *BBI = dyn_cast<Instruction>(Val); in solveBlockValue() local
697 Instruction *BBI, in solveBlockValueConstantRange()
|
| /external/llvm/unittests/IR/ |
| D | DominatorTreeTest.cpp | 32 BasicBlock::iterator BBI = BB0->begin(); in runOnFunction() local
|
| /external/llvm/lib/Transforms/IPO/ |
| D | LoopExtractor.cpp | 256 Function::iterator BBI = MF->begin(); in runOnModule() local
|
| /external/llvm/lib/Transforms/ObjCARC/ |
| D | ObjCARCContract.cpp | 398 BasicBlock::iterator BBI = Inst; in runOnFunction() local
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| D | SSAUpdaterImpl.h | 377 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); in FindExistingPHI() local
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64BranchFixupPass.cpp | 323 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; in computeBlockSize() local
|