/external/llvm/lib/CodeGen/ |
IfConversion.cpp | 136 /// BBI - Corresponding BBInfo. 147 BBInfo &BBI; 153 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} 189 bool ReverseBranchCondition(BBInfo &BBI); 197 void ScanInstructions(BBInfo &BBI); 200 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond, 204 void RemoveExtraEdges(BBInfo &BBI); 205 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind); 206 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind); 207 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind [all...] |
PHIElimination.cpp | 539 for (const auto &BBI : MBB) { 540 if (!BBI.isPHI()) 542 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) 543 ++VRegPHIUseCount[BBVRegPair(BBI.getOperand(i+1).getMBB()->getNumber(), 544 BBI.getOperand(i).getReg())]; 558 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); 559 BBI != BBE && BBI->isPHI(); ++BBI) { 560 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) [all...] |
LiveVariables.cpp | 710 for (const auto &BBI : MBB) { 711 if (!BBI.isPHI()) 713 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) 714 if (BBI.getOperand(i).readsReg()) 715 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()] 716 .push_back(BBI.getOperand(i).getReg()); 793 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); 794 for (; BBI != BBE && BBI->isPHI(); ++BBI) { [all...] |
GCRootLowering.cpp | 298 for (MachineFunction::iterator BBI = MF.begin(), BBE = MF.end(); BBI != BBE; 299 ++BBI) 300 for (MachineBasicBlock::iterator MI = BBI->begin(), ME = BBI->end();
|
Analysis.cpp | 509 for (BasicBlock::const_iterator BBI = std::prev(ExitBB->end(), 2);; --BBI) { 510 if (&*BBI == I) 513 if (isa<DbgInfoIntrinsic>(BBI)) 515 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() || 516 !isSafeToSpeculativelyExecute(BBI))
|
/external/llvm/lib/Analysis/ |
Loads.cpp | 115 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); 121 while (BBI != E) { 122 --BBI; 126 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && 127 !isa<DbgInfoIntrinsic>(BBI)) 131 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) 133 else if (StoreInst *SI = dyn_cast<StoreInst>(BBI))
|
LazyValueInfo.cpp | 380 Instruction *BBI, BasicBlock *BB); 382 Instruction *BBI); 520 Instruction *BBI = dyn_cast<Instruction>(Val); 521 if (!BBI || BBI->getParent() != BB) { 528 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { 535 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) { 544 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) || 545 !BBI->getType()->isIntegerTy()) [all...] |
/external/llvm/lib/Transforms/Scalar/ |
DeadStoreElimination.cpp | 481 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { 482 Instruction *Inst = BBI++; 510 // DeleteDeadInstruction can delete the current instruction. Save BBI 512 WeakVH NextInst(BBI); 517 BBI = BB.begin(); 518 else if (BBI != BB.begin()) // Revisit this instruction if possible. 519 --BBI; 568 // cases, reset BBI. 569 BBI = Inst [all...] |
TailRecursionElimination.cpp | 403 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; /*in loop*/) { 404 BasicBlock *BB = BBI++; // FoldReturnAndProcessPred may delete BB. 513 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { 514 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()); 574 BasicBlock::iterator BBI = TI; 576 CI = dyn_cast<CallInst>(BBI); 580 if (BBI == BB->begin() [all...] |
SimplifyCFGPass.cpp | 59 for (Function::iterator BBI = F.begin(), E = F.end(); BBI != E; ) { 60 BasicBlock &BB = *BBI++;
|
MergedLoadStoreMotion.cpp | 258 for (BasicBlock::iterator BBI = BB1->begin(), BBE = BB1->end(); BBI != BBE; 259 ++BBI) { 260 Instruction *Inst = BBI; 369 for (BasicBlock::iterator BBI = Succ0->begin(), BBE = Succ0->end(); 370 BBI != BBE;) { 372 Instruction *I = BBI; 373 ++BBI;
|
Scalarizer.cpp | 49 // insert them before BBI in BB. If Cache is nonnull, use it to cache 51 Scatterer(BasicBlock *bb, BasicBlock::iterator bbi, Value *v, 62 BasicBlock::iterator BBI; 185 Scatterer::Scatterer(BasicBlock *bb, BasicBlock::iterator bbi, Value *v, 187 : BB(bb), BBI(bbi), V(v), CachePtr(cachePtr) { 207 IRBuilder<> Builder(BB, BBI); 250 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) { [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineLoadStoreAlloca.cpp | 707 BasicBlock::iterator BBI = &LI; 708 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) [all...] |
/external/llvm/unittests/IR/ |
DominatorTreeTest.cpp | 36 BasicBlock::iterator BBI = BB0->begin(); 37 Instruction *Y1 = BBI++; 38 Instruction *Y2 = BBI++; 39 Instruction *Y3 = BBI++; 42 BBI = BB1->begin(); 43 Instruction *Y4 = BBI++; 46 BBI = BB2->begin(); 47 Instruction *Y5 = BBI++; 50 BBI = BB3->begin(); 51 Instruction *Y6 = BBI++ [all...] |
PassManagerTest.cpp | 41 for (Function::iterator BBI = F.begin(), BBE = F.end(); BBI != BBE; ++BBI) 42 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
|
/external/llvm/lib/Transforms/Utils/ |
LCSSA.cpp | 104 for (SmallVectorImpl<BasicBlock *>::const_iterator BBI = ExitBlocks.begin(), 106 BBI != BBE; ++BBI) { 107 BasicBlock *ExitBB = *BBI; 230 for (Loop::block_iterator BBI = L.block_begin(), BBE = L.block_end(); 231 BBI != BBE; ++BBI) { 232 BasicBlock *BB = *BBI;
|
Local.cpp | 773 BasicBlock::iterator BBI = BB->begin(); 774 while (isa<PHINode>(*BBI)) { 775 for (Use &U : BBI->uses()) { 783 ++BBI; [all...] |
SimplifyCFG.cpp | 156 for (BasicBlock::iterator BBI = (*I)->begin(); 157 isa<PHINode>(BBI); ++BBI) { 158 PHINode *PN = cast<PHINode>(BBI); 197 for (BasicBlock::iterator BBI = (*I)->begin(); 198 isa<PHINode>(BBI); ++BBI) { 199 PHINode *PN = cast<PHINode>(BBI); [all...] |
LoopUnroll.cpp | 372 for (BasicBlock::iterator BBI = (*SI)->begin(); 373 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { 458 for (BasicBlock::iterator BBI = (*SI)->begin(); 459 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) {
|
PromoteMemoryToRegister.cpp | 218 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); BBI != E; 219 ++BBI) 220 if (isInterestingInstruction(BBI)) 221 InstNumbers[BBI] = InstNo++; 759 BasicBlock::iterator BBI = BB->begin(); 760 while ((SomePHI = dyn_cast<PHINode>(BBI++)) && [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCContract.cpp | 432 BasicBlock::iterator BBI = Inst; 439 if (&*BBI == InstParent->begin()) { 443 BBI = Pred->getTerminator(); 446 --BBI; 447 } while (IsNoopInstruction(BBI)); 449 if (&*BBI == GetArgRCIdentityRoot(Inst)) {
|
/external/llvm/lib/Transforms/IPO/ |
LoopExtractor.cpp | 260 Function::iterator BBI = MF->begin(); 261 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); 262 TranslatedBlocksToNotExtract.insert(BBI);
|
/external/llvm/lib/Target/NVPTX/ |
NVPTXGenericToNVVM.cpp | 112 for (Function::iterator BBI = I->begin(), BBE = I->end(); BBI != BBE; 113 ++BBI) { 114 for (BasicBlock::iterator II = BBI->begin(), IE = BBI->end(); II != IE;
|
/external/llvm/lib/Target/ARM/ |
ARMConstantIslandPass.cpp | 362 const BasicBlockInfo &BBI = BBInfo[J]; 363 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) 364 << " kb=" << unsigned(BBI.KnownBits) 365 << " ua=" << unsigned(BBI.Unalign) 366 << " pa=" << unsigned(BBI.PostAlign) 802 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; 803 BBI.Size = 0; 804 BBI.Unalign = 0; 805 BBI.PostAlign = 0; 809 BBI.Size += TII->GetInstSizeInBytes(I) [all...] |
/external/llvm/include/llvm/Transforms/Utils/ |
SSAUpdaterImpl.h | 379 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); 380 BBI != BBE; ++BBI) { 381 PhiT *SomePHI = Traits::InstrIsPHI(BBI);
|