Home
last modified time | relevance | path

Searched refs:BBI (Results 1 – 25 of 43) sorted by relevance

12

/external/llvm/lib/CodeGen/
DIfConversion.cpp140 BBInfo &BBI; member
146 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} in IfcvtToken()
177 bool ReverseBranchCondition(BBInfo &BBI);
185 void ScanInstructions(BBInfo &BBI);
188 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond,
192 void RemoveExtraEdges(BBInfo &BBI);
193 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind);
194 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind);
195 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind,
197 void PredicateBlock(BBInfo &BBI,
[all …]
DStrongPHIElimination.cpp241 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
242 BBI != BBE && BBI->isPHI(); ++BBI) { in runOnMachineFunction()
243 unsigned DestReg = BBI->getOperand(0).getReg(); in runOnMachineFunction()
245 PHISrcDefs[I].push_back(BBI); in runOnMachineFunction()
247 for (unsigned i = 1; i < BBI->getNumOperands(); i += 2) { in runOnMachineFunction()
248 MachineOperand &SrcMO = BBI->getOperand(i); in runOnMachineFunction()
274 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
275 BBI != BBE && BBI->isPHI(); ++BBI) { in runOnMachineFunction()
276 InsertCopiesForPHI(BBI, I); in runOnMachineFunction()
285 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); in runOnMachineFunction() local
[all …]
DPHIElimination.cpp412 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); in analyzePHINodes() local
413 BBI != BBE && BBI->isPHI(); ++BBI) in analyzePHINodes()
414 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) in analyzePHINodes()
415 ++VRegPHIUseCount[BBVRegPair(BBI->getOperand(i+1).getMBB()->getNumber(), in analyzePHINodes()
416 BBI->getOperand(i).getReg())]; in analyzePHINodes()
430 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); in SplitPHIEdges() local
431 BBI != BBE && BBI->isPHI(); ++BBI) { in SplitPHIEdges()
432 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) { in SplitPHIEdges()
433 unsigned Reg = BBI->getOperand(i).getReg(); in SplitPHIEdges()
434 MachineBasicBlock *PreMBB = BBI->getOperand(i+1).getMBB(); in SplitPHIEdges()
[all …]
DLiveVariables.cpp732 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); in analyzePHINodes() local
733 BBI != BBE && BBI->isPHI(); ++BBI) in analyzePHINodes()
734 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) in analyzePHINodes()
735 if (BBI->getOperand(i).readsReg()) in analyzePHINodes()
736 PHIVarInfo[BBI->getOperand(i + 1).getMBB()->getNumber()] in analyzePHINodes()
737 .push_back(BBI->getOperand(i).getReg()); in analyzePHINodes()
813 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); in addNewBlock() local
814 for (; BBI != BBE && BBI->isPHI(); ++BBI) { in addNewBlock()
816 Defs.insert(BBI->getOperand(0).getReg()); in addNewBlock()
819 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) in addNewBlock()
[all …]
DAnalysis.cpp293 for (BasicBlock::const_iterator BBI = prior(prior(ExitBB->end())); ; in isInTailCallPosition() local
294 --BBI) { in isInTailCallPosition()
295 if (&*BBI == I) in isInTailCallPosition()
298 if (isa<DbgInfoIntrinsic>(BBI)) in isInTailCallPosition()
300 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() || in isInTailCallPosition()
301 !isSafeToSpeculativelyExecute(BBI)) in isInTailCallPosition()
DGCStrategy.cpp378 for (MachineFunction::iterator BBI = MF.begin(), in FindSafePoints() local
379 BBE = MF.end(); BBI != BBE; ++BBI) in FindSafePoints()
380 for (MachineBasicBlock::iterator MI = BBI->begin(), in FindSafePoints()
381 ME = BBI->end(); MI != ME; ++MI) in FindSafePoints()
/external/llvm/lib/Transforms/InstCombine/
DInstCombineLoadStoreAlloca.cpp377 BasicBlock::iterator BBI = &LI; in visitLoadInst() local
378 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) in visitLoadInst()
612 BasicBlock::iterator BBI = &SI; in visitStoreInst() local
613 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts; in visitStoreInst()
615 --BBI; in visitStoreInst()
618 if (isa<DbgInfoIntrinsic>(BBI) || in visitStoreInst()
619 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) { in visitStoreInst()
624 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) { in visitStoreInst()
629 ++BBI; in visitStoreInst()
639 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { in visitStoreInst()
[all …]
DInstCombineMulDivRem.cpp325 BasicBlock::iterator BBI = &I, BBFront = I.getParent()->begin(); in SimplifyDivRemOfSelect() local
327 while (BBI != BBFront) { in SimplifyDivRemOfSelect()
328 --BBI; in SimplifyDivRemOfSelect()
331 if (isa<CallInst>(BBI) && !isa<IntrinsicInst>(BBI)) in SimplifyDivRemOfSelect()
335 for (Instruction::op_iterator I = BBI->op_begin(), E = BBI->op_end(); in SimplifyDivRemOfSelect()
339 Worklist.Add(BBI); in SimplifyDivRemOfSelect()
341 *I = NonNullOperand == 1 ? ConstantInt::getTrue(BBI->getContext()) : in SimplifyDivRemOfSelect()
342 ConstantInt::getFalse(BBI->getContext()); in SimplifyDivRemOfSelect()
343 Worklist.Add(BBI); in SimplifyDivRemOfSelect()
348 if (&*BBI == SI) in SimplifyDivRemOfSelect()
[all …]
/external/llvm/lib/Transforms/Scalar/
DSimplifyCFGPass.cpp82 BasicBlock::iterator BBI = I, BBE = BB->end(); in changeToUnreachable() local
83 while (BBI != BBE) { in changeToUnreachable()
84 if (!BBI->use_empty()) in changeToUnreachable()
85 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType())); in changeToUnreachable()
86 BB->getInstList().erase(BBI++); in changeToUnreachable()
123 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ in markAliveBlocks() local
124 if (CallInst *CI = dyn_cast<CallInst>(BBI)) { in markAliveBlocks()
129 ++BBI; in markAliveBlocks()
130 if (!isa<UnreachableInst>(BBI)) { in markAliveBlocks()
132 changeToUnreachable(BBI, false); in markAliveBlocks()
[all …]
DDeadStoreElimination.cpp454 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { in runOnBasicBlock() local
455 Instruction *Inst = BBI++; in runOnBasicBlock()
485 WeakVH NextInst(BBI); in runOnBasicBlock()
490 BBI = BB.begin(); in runOnBasicBlock()
491 else if (BBI != BB.begin()) // Revisit this instruction if possible. in runOnBasicBlock()
492 --BBI; in runOnBasicBlock()
540 BBI = Inst; in runOnBasicBlock()
541 if (BBI != BB.begin()) in runOnBasicBlock()
542 --BBI; in runOnBasicBlock()
697 for (BasicBlock::iterator BBI = BB.end(); BBI != BB.begin(); ){ in handleEndBlock() local
[all …]
DTailRecursionElimination.cpp309 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { in getCommonReturnValue() local
310 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()); in getCommonReturnValue()
371 BasicBlock::iterator BBI = TI; in FindTRECandidate() local
373 CI = dyn_cast<CallInst>(BBI); in FindTRECandidate()
377 if (BBI == BB->begin()) in FindTRECandidate()
379 --BBI; in FindTRECandidate()
432 BasicBlock::iterator BBI = CI; in EliminateRecursiveTailCall() local
433 for (++BBI; &*BBI != Ret; ++BBI) { in EliminateRecursiveTailCall()
434 if (CanMoveAboveCall(BBI, CI)) continue; in EliminateRecursiveTailCall()
441 CanTransformAccumulatorRecursion(BBI, CI))) { in EliminateRecursiveTailCall()
[all …]
DCodeGenPrepare.cpp270 BasicBlock::iterator BBI = BI; in EliminateMostlyEmptyBlocks() local
271 if (BBI != BB->begin()) { in EliminateMostlyEmptyBlocks()
272 --BBI; in EliminateMostlyEmptyBlocks()
273 while (isa<DbgInfoIntrinsic>(BBI)) { in EliminateMostlyEmptyBlocks()
274 if (BBI == BB->begin()) in EliminateMostlyEmptyBlocks()
276 --BBI; in EliminateMostlyEmptyBlocks()
278 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) in EliminateMostlyEmptyBlocks()
304 BasicBlock::const_iterator BBI = BB->begin(); in CanMergeBlocks() local
305 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) { in CanMergeBlocks()
346 BBI = DestBB->begin(); in CanMergeBlocks()
[all …]
/external/llvm/unittests/VMCore/
DDominatorTreeTest.cpp23 BasicBlock::iterator BBI = BB0->begin(); in runOnFunction() local
24 Instruction *Y1 = BBI++; in runOnFunction()
25 Instruction *Y2 = BBI++; in runOnFunction()
26 Instruction *Y3 = BBI++; in runOnFunction()
29 BBI = BB1->begin(); in runOnFunction()
30 Instruction *Y4 = BBI++; in runOnFunction()
33 BBI = BB2->begin(); in runOnFunction()
34 Instruction *Y5 = BBI++; in runOnFunction()
37 BBI = BB3->begin(); in runOnFunction()
38 Instruction *Y6 = BBI++; in runOnFunction()
[all …]
/external/llvm/lib/Analysis/
DLoads.cpp131 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); in isSafeToLoadUnconditionally() local
133 while (BBI != E) { in isSafeToLoadUnconditionally()
134 --BBI; in isSafeToLoadUnconditionally()
138 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && in isSafeToLoadUnconditionally()
139 !isa<DbgInfoIntrinsic>(BBI)) in isSafeToLoadUnconditionally()
142 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { in isSafeToLoadUnconditionally()
144 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) { in isSafeToLoadUnconditionally()
DLazyValueInfo.cpp378 Instruction *BBI, BasicBlock *BB);
518 Instruction *BBI = dyn_cast<Instruction>(Val); in solveBlockValue() local
519 if (BBI == 0 || BBI->getParent() != BB) { in solveBlockValue()
523 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { in solveBlockValue()
527 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) { in solveBlockValue()
535 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) || in solveBlockValue()
536 !BBI->getType()->isIntegerTy()) { in solveBlockValue()
545 BinaryOperator *BO = dyn_cast<BinaryOperator>(BBI); in solveBlockValue()
554 return ODCacheUpdater.markResult(solveBlockValueConstantRange(BBLV, BBI, BB)); in solveBlockValue()
693 Instruction *BBI, in solveBlockValueConstantRange() argument
[all …]
DProfileEstimatorPass.cpp366 for (std::set<BasicBlock*>::iterator BBI = BBToVisit.begin(), BBE = BBToVisit.end(); in runOnFunction() local
367 (BBI != BBE) && (!found); ++BBI) { in runOnFunction()
368 BasicBlock *BB = *BBI; in runOnFunction()
/external/llvm/lib/Transforms/Utils/
DLCSSA.cpp137 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end(); in runOnLoop() local
138 BBI != E; ++BBI) { in runOnLoop()
139 BasicBlock *BB = *BBI; in runOnLoop()
217 for (SmallVectorImpl<BasicBlock*>::const_iterator BBI = ExitBlocks.begin(), in ProcessInstruction() local
218 BBE = ExitBlocks.end(); BBI != BBE; ++BBI) { in ProcessInstruction()
219 BasicBlock *ExitBB = *BBI; in ProcessInstruction()
DSimplifyCFG.cpp116 for (BasicBlock::iterator BBI = (*I)->begin(); in SafeToMergeTerminators() local
117 isa<PHINode>(BBI); ++BBI) { in SafeToMergeTerminators()
118 PHINode *PN = cast<PHINode>(BBI); in SafeToMergeTerminators()
157 for (BasicBlock::iterator BBI = (*I)->begin(); in isProfitableToFoldUnconditional() local
158 isa<PHINode>(BBI); ++BBI) { in isProfitableToFoldUnconditional()
159 PHINode *PN = cast<PHINode>(BBI); in isProfitableToFoldUnconditional()
1038 for (BasicBlock::iterator BBI = SI->begin(); in isSafeToHoistInvoke() local
1039 (PN = dyn_cast<PHINode>(BBI)); ++BBI) { in isSafeToHoistInvoke()
1134 for (BasicBlock::iterator BBI = SI->begin(); in HoistThenElseCodeToIf() local
1135 (PN = dyn_cast<PHINode>(BBI)); ++BBI) { in HoistThenElseCodeToIf()
[all …]
DLoopUnroll.cpp304 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local
305 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { in UnrollLoop()
390 for (BasicBlock::iterator BBI = (*SI)->begin(); in UnrollLoop() local
391 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) { in UnrollLoop()
DLoopSimplify.cpp491 Function::iterator BBI = NewBB; --BBI; in PlaceSplitBlockCarefully() local
493 if (&*BBI == SplitPreds[i]) in PlaceSplitBlockCarefully()
505 Function::iterator BBI = SplitPreds[i]; in PlaceSplitBlockCarefully() local
506 if (++BBI != NewBB->getParent()->end() && in PlaceSplitBlockCarefully()
507 L->contains(BBI)) { in PlaceSplitBlockCarefully()
DLoopUnrollRuntime.cpp70 for (BasicBlock::iterator BBI = (*SBI)->begin(); in ConnectProlog() local
71 PHINode *PN = dyn_cast<PHINode>(BBI); ++BBI) { in ConnectProlog()
DPromoteMemoryToRegister.cpp181 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); in getInstructionIndex() local
182 BBI != E; ++BBI) in getInstructionIndex()
183 if (isInterestingInstruction(BBI)) in getInstructionIndex()
184 InstNumbers[BBI] = InstNo++; in getInstructionIndex()
657 BasicBlock::iterator BBI = BB->begin(); in run() local
658 while ((SomePHI = dyn_cast<PHINode>(BBI++)) && in run()
/external/llvm/lib/Target/ARM/
DARMConstantIslandPass.cpp360 const BasicBlockInfo &BBI = BBInfo[J]; in dumpBBs()
361 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) in dumpBBs()
362 << " kb=" << unsigned(BBI.KnownBits) in dumpBBs()
363 << " ua=" << unsigned(BBI.Unalign) in dumpBBs()
364 << " pa=" << unsigned(BBI.PostAlign) in dumpBBs()
798 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; in computeBlockSize() local
799 BBI.Size = 0; in computeBlockSize()
800 BBI.Unalign = 0; in computeBlockSize()
801 BBI.PostAlign = 0; in computeBlockSize()
805 BBI.Size += TII->GetInstSizeInBytes(I); in computeBlockSize()
[all …]
/external/llvm/lib/Transforms/IPO/
DLoopExtractor.cpp256 Function::iterator BBI = MF->begin(); in runOnModule() local
257 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); in runOnModule()
258 TranslatedBlocksToNotExtract.insert(BBI); in runOnModule()
/external/llvm/include/llvm/Transforms/Utils/
DSSAUpdaterImpl.h377 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); in FindExistingPHI() local
378 BBI != BBE; ++BBI) { in FindExistingPHI()
379 PhiT *SomePHI = Traits::InstrIsPHI(BBI); in FindExistingPHI()

12