/external/llvm/lib/CodeGen/ |
D | IfConversion.cpp | 147 BBInfo &BBI; member 153 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} in IfcvtToken() 187 bool ReverseBranchCondition(BBInfo &BBI); 195 void ScanInstructions(BBInfo &BBI); 198 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond, 202 void RemoveExtraEdges(BBInfo &BBI); 203 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind); 204 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind); 205 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, 207 void PredicateBlock(BBInfo &BBI, [all …]
|
D | ErlangGC.cpp | 63 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE; in findCustomSafePoints() local 64 ++BBI) in findCustomSafePoints() 65 for (MachineBasicBlock::iterator MI = BBI->begin(), ME = BBI->end(); in findCustomSafePoints()
|
D | LiveVariables.cpp | 705 for (const auto &BBI : MBB) { in analyzePHINodes() local 706 if (!BBI.isPHI()) in analyzePHINodes() 708 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) in analyzePHINodes() 709 if (BBI.getOperand(i).readsReg()) in analyzePHINodes() 710 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()] in analyzePHINodes() 711 .push_back(BBI.getOperand(i).getReg()); in analyzePHINodes() 788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); in addNewBlock() local 789 for (; BBI != BBE && BBI->isPHI(); ++BBI) { in addNewBlock() 791 Defs.insert(BBI->getOperand(0).getReg()); in addNewBlock() 794 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) in addNewBlock() [all …]
|
D | PHIElimination.cpp | 536 for (const auto &BBI : MBB) { in analyzePHINodes() local 537 if (!BBI.isPHI()) in analyzePHINodes() 539 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) in analyzePHINodes() 540 ++VRegPHIUseCount[BBVRegPair(BBI.getOperand(i+1).getMBB()->getNumber(), in analyzePHINodes() 541 BBI.getOperand(i).getReg())]; in analyzePHINodes() 555 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); in SplitPHIEdges() local 556 BBI != BBE && BBI->isPHI(); ++BBI) { in SplitPHIEdges() 557 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) { in SplitPHIEdges() 558 unsigned Reg = BBI->getOperand(i).getReg(); in SplitPHIEdges() 559 MachineBasicBlock *PreMBB = BBI->getOperand(i+1).getMBB(); in SplitPHIEdges() [all …]
|
D | Analysis.cpp | 501 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) { in isInTailCallPosition() local 502 if (&*BBI == I) in isInTailCallPosition() 505 if (isa<DbgInfoIntrinsic>(BBI)) in isInTailCallPosition() 507 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() || in isInTailCallPosition() 508 !isSafeToSpeculativelyExecute(BBI)) in isInTailCallPosition()
|
D | GCStrategy.cpp | 371 for (MachineFunction::iterator BBI = MF.begin(), in FindSafePoints() local 372 BBE = MF.end(); BBI != BBE; ++BBI) in FindSafePoints() 373 for (MachineBasicBlock::iterator MI = BBI->begin(), in FindSafePoints() 374 ME = BBI->end(); MI != ME; ++MI) in FindSafePoints()
|
/external/llvm/lib/MC/MCAnalysis/ |
D | MCObjectDisassembler.cpp | 261 BBInfo &BBI = BBInfos[*CI]; in buildCFG() local 262 if (!BBI.Atom) continue; in buildCFG() 264 MCFunction &MCFN = *Module->createFunction(BBI.Atom->getName()); in buildCFG() 268 Worklist.insert(&BBI); in buildCFG() 270 BBInfo *BBI = Worklist[wi]; in buildCFG() local 271 if (!BBI->Atom) in buildCFG() 273 BBI->BB = &MCFN.createBlock(*BBI->Atom); in buildCFG() 275 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI->Succs.end(); in buildCFG() 278 for (BBInfoSetTy::iterator PI = BBI->Preds.begin(), PE = BBI->Preds.end(); in buildCFG() 285 BBInfo *BBI = Worklist[wi]; in buildCFG() local [all …]
|
D | MCModuleYAML.cpp | 338 for (MCFunction::const_iterator BBI = MCF.begin(), BBE = MCF.end(); in dumpFunction() local 339 BBI != BBE; ++BBI) { in dumpFunction() 340 const MCBasicBlock &MCBB = **BBI; in dumpFunction() 408 for (BBIt BBI = FI->BasicBlocks.begin(), BBE = FI->BasicBlocks.end(); in parse() local 409 BBI != BBE; ++BBI) { in parse() 410 AddrToTextAtomTy::const_iterator It = TAByAddr.find(BBI->Address); in parse() 415 for (BBIt BBI = FI->BasicBlocks.begin(), BBE = FI->BasicBlocks.end(); in parse() local 416 BBI != BBE; ++BBI) { in parse() 417 MCBasicBlock *MCBB = MCFN->find(BBI->Address); in parse() 420 for (AddrIt PI = BBI->Preds.begin(), PE = BBI->Preds.end(); PI != PE; in parse() [all …]
|
/external/llvm/lib/Transforms/InstCombine/ |
D | InstCombineLoadStoreAlloca.cpp | 389 BasicBlock::iterator BBI = &LI; in visitLoadInst() local 390 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) in visitLoadInst() 636 BasicBlock::iterator BBI = &SI; in visitStoreInst() local 637 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts; in visitStoreInst() 639 --BBI; in visitStoreInst() 642 if (isa<DbgInfoIntrinsic>(BBI) || in visitStoreInst() 643 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) { in visitStoreInst() 648 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) { in visitStoreInst() 653 ++BBI; in visitStoreInst() 663 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { in visitStoreInst() [all …]
|
/external/llvm/lib/Transforms/Scalar/ |
D | DeadStoreElimination.cpp | 497 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { in runOnBasicBlock() local 498 Instruction *Inst = BBI++; in runOnBasicBlock() 528 WeakVH NextInst(BBI); in runOnBasicBlock() 533 BBI = BB.begin(); in runOnBasicBlock() 534 else if (BBI != BB.begin()) // Revisit this instruction if possible. in runOnBasicBlock() 535 --BBI; in runOnBasicBlock() 583 BBI = Inst; in runOnBasicBlock() 584 if (BBI != BB.begin()) in runOnBasicBlock() 585 --BBI; in runOnBasicBlock() 739 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){ in handleEndBlock() local [all …]
|
D | TailRecursionElimination.cpp | 517 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { in getCommonReturnValue() local 518 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()); in getCommonReturnValue() 579 BasicBlock::iterator BBI = TI; in FindTRECandidate() local 581 CI = dyn_cast<CallInst>(BBI); in FindTRECandidate() 585 if (BBI == BB->begin()) in FindTRECandidate() 587 --BBI; in FindTRECandidate() 641 BasicBlock::iterator BBI = CI; in EliminateRecursiveTailCall() local 642 for (++BBI; &*BBI != Ret; ++BBI) { in EliminateRecursiveTailCall() 643 if (CanMoveAboveCall(BBI, CI)) continue; in EliminateRecursiveTailCall() 650 CanTransformAccumulatorRecursion(BBI, CI))) { in EliminateRecursiveTailCall() [all …]
|
D | SimplifyCFGPass.cpp | 78 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; ) { in mergeEmptyReturnBlocks() local 79 BasicBlock &BB = *BBI++; in mergeEmptyReturnBlocks()
|
/external/llvm/unittests/IR/ |
D | DominatorTreeTest.cpp | 35 BasicBlock::iterator BBI = BB0->begin(); in runOnFunction() local 36 Instruction *Y1 = BBI++; in runOnFunction() 37 Instruction *Y2 = BBI++; in runOnFunction() 38 Instruction *Y3 = BBI++; in runOnFunction() 41 BBI = BB1->begin(); in runOnFunction() 42 Instruction *Y4 = BBI++; in runOnFunction() 45 BBI = BB2->begin(); in runOnFunction() 46 Instruction *Y5 = BBI++; in runOnFunction() 49 BBI = BB3->begin(); in runOnFunction() 50 Instruction *Y6 = BBI++; in runOnFunction() [all …]
|
D | PassManagerTest.cpp | 38 for (Function::iterator BBI = F->begin(), BBE = F->end(); BBI != BBE; ++BBI) in run() local 39 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE; in run()
|
/external/llvm/lib/Analysis/ |
D | Loads.cpp | 102 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); in isSafeToLoadUnconditionally() local 104 while (BBI != E) { in isSafeToLoadUnconditionally() 105 --BBI; in isSafeToLoadUnconditionally() 109 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && in isSafeToLoadUnconditionally() 110 !isa<DbgInfoIntrinsic>(BBI)) in isSafeToLoadUnconditionally() 113 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { in isSafeToLoadUnconditionally() 115 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) { in isSafeToLoadUnconditionally()
|
D | LazyValueInfo.cpp | 379 Instruction *BBI, BasicBlock *BB); 519 Instruction *BBI = dyn_cast<Instruction>(Val); in solveBlockValue() local 520 if (!BBI || BBI->getParent() != BB) { in solveBlockValue() 524 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { in solveBlockValue() 528 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) { in solveBlockValue() 536 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) || in solveBlockValue() 537 !BBI->getType()->isIntegerTy()) { in solveBlockValue() 546 BinaryOperator *BO = dyn_cast<BinaryOperator>(BBI); in solveBlockValue() 555 return ODCacheUpdater.markResult(solveBlockValueConstantRange(BBLV, BBI, BB)); in solveBlockValue() 698 Instruction *BBI, in solveBlockValueConstantRange() argument [all …]
|
/external/llvm/lib/Transforms/Utils/ |
D | LCSSA.cpp | 103 for (SmallVectorImpl<BasicBlock *>::const_iterator BBI = ExitBlocks.begin(), in processInstruction() local 105 BBI != BBE; ++BBI) { in processInstruction() 106 BasicBlock *ExitBB = *BBI; in processInstruction() 197 for (Loop::block_iterator BBI = L.block_begin(), BBE = L.block_end(); in formLCSSA() local 198 BBI != BBE; ++BBI) { in formLCSSA() 199 BasicBlock *BB = *BBI; in formLCSSA()
|
D | SimplifyCFG.cpp | 135 for (BasicBlock::iterator BBI = (*I)->begin(); in SafeToMergeTerminators() local 136 isa<PHINode>(BBI); ++BBI) { in SafeToMergeTerminators() 137 PHINode *PN = cast<PHINode>(BBI); in SafeToMergeTerminators() 176 for (BasicBlock::iterator BBI = (*I)->begin(); in isProfitableToFoldUnconditional() local 177 isa<PHINode>(BBI); ++BBI) { in isProfitableToFoldUnconditional() 178 PHINode *PN = cast<PHINode>(BBI); in isProfitableToFoldUnconditional() 986 for (BasicBlock::iterator BBI = SI->begin(); in isSafeToHoistInvoke() local 987 (PN = dyn_cast<PHINode>(BBI)); ++BBI) { in isSafeToHoistInvoke() 1068 for (BasicBlock::iterator BBI = SI->begin(); in HoistThenElseCodeToIf() local 1069 (PN = dyn_cast<PHINode>(BBI)); ++BBI) { in HoistThenElseCodeToIf() [all …]
|
D | Local.cpp | 755 BasicBlock::iterator BBI = BB->begin(); in TryToSimplifyUncondBranchFromEmptyBlock() local 756 while (isa<PHINode>(*BBI)) { in TryToSimplifyUncondBranchFromEmptyBlock() 757 for (Use &U : BBI->uses()) { in TryToSimplifyUncondBranchFromEmptyBlock() 765 ++BBI; in TryToSimplifyUncondBranchFromEmptyBlock() 1141 BasicBlock::iterator BBI = I, BBE = BB->end(); in changeToUnreachable() local 1142 while (BBI != BBE) { in changeToUnreachable() 1143 if (!BBI->use_empty()) in changeToUnreachable() 1144 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType())); in changeToUnreachable() 1145 BB->getInstList().erase(BBI++); in changeToUnreachable() 1180 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ in markAliveBlocks() local [all …]
|
D | LoopUnroll.cpp | 327 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local 328 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { in UnrollLoop() 413 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local 414 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) { in UnrollLoop()
|
/external/llvm/lib/Transforms/ObjCARC/ |
D | ObjCARCContract.cpp | 374 BasicBlock::iterator BBI = Inst; in runOnFunction() local 381 if (&*BBI == InstParent->begin()) { in runOnFunction() 385 BBI = Pred->getTerminator(); in runOnFunction() 388 --BBI; in runOnFunction() 389 } while (IsNoopInstruction(BBI)); in runOnFunction() 391 if (&*BBI == GetObjCArg(Inst)) { in runOnFunction()
|
/external/llvm/lib/Target/ARM/ |
D | ARMConstantIslandPass.cpp | 361 const BasicBlockInfo &BBI = BBInfo[J]; in dumpBBs() 362 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) in dumpBBs() 363 << " kb=" << unsigned(BBI.KnownBits) in dumpBBs() 364 << " ua=" << unsigned(BBI.Unalign) in dumpBBs() 365 << " pa=" << unsigned(BBI.PostAlign) in dumpBBs() 800 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; in computeBlockSize() local 801 BBI.Size = 0; in computeBlockSize() 802 BBI.Unalign = 0; in computeBlockSize() 803 BBI.PostAlign = 0; in computeBlockSize() 807 BBI.Size += TII->GetInstSizeInBytes(I); in computeBlockSize() [all …]
|
/external/llvm/lib/Target/NVPTX/ |
D | NVPTXGenericToNVVM.cpp | 112 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE; in runOnModule() local 113 ++BBI) { in runOnModule() 114 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE; in runOnModule()
|
/external/llvm/lib/Transforms/IPO/ |
D | LoopExtractor.cpp | 260 Function::iterator BBI = MF->begin(); in runOnModule() local 261 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); in runOnModule() 262 TranslatedBlocksToNotExtract.insert(BBI); in runOnModule()
|
/external/llvm/include/llvm/Transforms/Utils/ |
D | SSAUpdaterImpl.h | 379 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); in FindExistingPHI() local 380 BBI != BBE; ++BBI) { in FindExistingPHI() 381 PhiT *SomePHI = Traits::InstrIsPHI(BBI); in FindExistingPHI()
|