/external/llvm/lib/Analysis/ |
H A D | Loads.cpp | 102 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); local 104 while (BBI != E) { 105 --BBI; 109 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && 110 !isa<DbgInfoIntrinsic>(BBI)) 113 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { 115 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
|
H A D | Lint.cpp | 609 BasicBlock::iterator BBI = L; local 615 BB, BBI, 6, AA)) 617 if (BBI != BB->begin()) break; 620 BBI = BB->end();
|
H A D | LazyValueInfo.cpp | 378 Instruction *BBI, BasicBlock *BB); 518 Instruction *BBI = dyn_cast<Instruction>(Val); local 519 if (BBI == 0 || BBI->getParent() != BB) { 523 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { 527 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) { 535 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) || 536 !BBI->getType()->isIntegerTy()) { 545 BinaryOperator *BO = dyn_cast<BinaryOperator>(BBI); 696 solveBlockValueConstantRange(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument [all...] |
/external/llvm/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 89 BasicBlock::iterator BBI = I, BBE = BB->end(); local 90 while (BBI != BBE) { 91 if (!BBI->use_empty()) 92 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType())); 93 BB->getInstList().erase(BBI++); 128 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ 129 if (CallInst *CI = dyn_cast<CallInst>(BBI)) { [all...] |
H A D | TailRecursionElimination.cpp | 345 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { 346 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()); 407 BasicBlock::iterator BBI = TI; local 409 CI = dyn_cast<CallInst>(BBI); 413 if (BBI == BB->begin()) 415 --BBI; 469 BasicBlock::iterator BBI = CI; local 470 for (++BBI; [all...] |
H A D | MemCpyOptimizer.cpp | 330 bool processStore(StoreInst *SI, BasicBlock::iterator &BBI); 331 bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI); 481 bool MemCpyOpt::processStore(StoreInst *SI, BasicBlock::iterator &BBI) { argument 545 BBI = I; // Don't invalidate iterator. 552 bool MemCpyOpt::processMemSet(MemSetInst *MSI, BasicBlock::iterator &BBI) { argument 558 BBI = I; // Don't invalidate iterator.
|
H A D | CodeGenPrepare.cpp | 285 BasicBlock::iterator BBI = BI; local 286 if (BBI != BB->begin()) { 287 --BBI; 288 while (isa<DbgInfoIntrinsic>(BBI)) { 289 if (BBI == BB->begin()) 291 --BBI; 293 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) 319 BasicBlock::const_iterator BBI = BB->begin(); local 320 while (const PHINode *PN = dyn_cast<PHINode>(BBI [all...] |
H A D | IndVarSimplify.cpp | 498 BasicBlock::iterator BBI = ExitBB->begin(); local 499 while ((PN = dyn_cast<PHINode>(BBI++))) {
|
/external/llvm/unittests/IR/ |
H A D | DominatorTreeTest.cpp | 32 BasicBlock::iterator BBI = BB0->begin(); local 33 Instruction *Y1 = BBI++; 34 Instruction *Y2 = BBI++; 35 Instruction *Y3 = BBI++; 38 BBI = BB1->begin(); 39 Instruction *Y4 = BBI++; 42 BBI = BB2->begin(); 43 Instruction *Y5 = BBI++; 46 BBI = BB3->begin(); 47 Instruction *Y6 = BBI [all...] |
/external/llvm/lib/MC/ |
H A D | MCObjectDisassembler.cpp | 180 BBInfo &BBI = BBInfos[*CI]; local 181 if (!BBI.Atom) continue; 183 MCFunction &MCFN = *Module->createFunction(BBI.Atom->getName()); 187 Worklist.insert(&BBI); 189 BBInfo *BBI = Worklist[WI]; local 190 if (!BBI->Atom) 192 BBI->BB = &MCFN.createBlock(*BBI->Atom); 194 for (BBInfoSetTy::iterator SI = BBI->Succs.begin(), SE = BBI 204 BBInfo *BBI = Worklist[WI]; local [all...] |
/external/llvm/lib/Transforms/IPO/ |
H A D | LoopExtractor.cpp | 256 Function::iterator BBI = MF->begin(); local 257 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); 258 TranslatedBlocksToNotExtract.insert(BBI);
|
/external/llvm/lib/Transforms/ObjCARC/ |
H A D | ObjCARCContract.cpp | 373 BasicBlock::iterator BBI = Inst; local 380 if (&*BBI == InstParent->begin()) { 384 BBI = Pred->getTerminator(); 387 --BBI; 388 } while (IsNoopInstruction(BBI)); 390 if (&*BBI == GetObjCArg(Inst)) {
|
/external/llvm/lib/Target/AArch64/ |
H A D | AArch64BranchFixupPass.cpp | 177 const BasicBlockInfo &BBI = BBInfo[J]; 178 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) 179 << " kb=" << unsigned(BBI.KnownBits) 180 << " ua=" << unsigned(BBI.Unalign) 323 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local 324 BBI.Size = 0; 325 BBI.Unalign = 0; 329 BBI.Size += TII->getInstSizeInBytes(*I); 333 BBI.Unalign = 2;
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstCombineLoadStoreAlloca.cpp | 366 BasicBlock::iterator BBI = &LI; 367 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) 601 BasicBlock::iterator BBI = &SI; local 602 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts; 604 --BBI; 607 if (isa<DbgInfoIntrinsic>(BBI) || 608 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) { 613 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) { 618 ++BBI; [all...] |
H A D | InstCombinePHI.cpp | 248 BasicBlock::iterator BBI = L, E = L->getParent()->end(); local 250 for (++BBI; BBI != E; ++BBI) 251 if (BBI->mayWriteToMemory())
|
/external/llvm/lib/Transforms/Utils/ |
H A D | LoopSimplify.cpp | 499 Function::iterator BBI = NewBB; --BBI; local 501 if (&*BBI == SplitPreds[i]) 513 Function::iterator BBI = SplitPreds[i]; local 514 if (++BBI != NewBB->getParent()->end() && 515 L->contains(BBI)) {
|
H A D | Local.cpp | 758 BasicBlock::iterator BBI = BB->begin(); local 759 while (isa<PHINode>(*BBI)) { 760 for (Value::use_iterator UI = BBI->use_begin(), E = BBI->use_end(); 769 ++BBI;
|
H A D | PromoteMemoryToRegister.cpp | 261 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); BBI != E; 262 ++BBI) 263 if (isInterestingInstruction(BBI)) 264 InstNumbers[BBI] = InstNo++; 819 BasicBlock::iterator BBI = BB->begin(); local 820 while ((SomePHI = dyn_cast<PHINode>(BBI++)) &&
|
/external/llvm/lib/CodeGen/ |
H A D | LiveVariables.cpp | 706 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); 707 BBI != BBE && BBI->isPHI(); ++BBI) 708 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) 709 if (BBI->getOperand(i).readsReg()) 710 PHIVarInfo[BBI->getOperand(i + 1).getMBB()->getNumber()] 711 .push_back(BBI->getOperand(i).getReg()); 787 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); local 788 for (; BBI ! [all...] |
H A D | StrongPHIElimination.cpp | 241 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); 242 BBI != BBE && BBI->isPHI(); ++BBI) { 243 unsigned DestReg = BBI->getOperand(0).getReg(); 245 PHISrcDefs[I].push_back(BBI); 247 for (unsigned i = 1; i < BBI->getNumOperands(); i += 2) { 248 MachineOperand &SrcMO = BBI->getOperand(i); 274 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); 275 BBI ! 302 MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); local [all...] |
H A D | BranchFolding.cpp | 672 MachineBasicBlock::iterator BBI = local 686 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI, BB);
|
H A D | MachineBasicBlock.cpp | 382 MachineFunction::iterator BBI = NewBefore; local 383 getParent()->splice(++BBI, this);
|
H A D | IfConversion.cpp | 130 /// BBI - Corresponding BBInfo. 141 BBInfo &BBI; member in struct:__anon21152::IfConverter::IfcvtToken 147 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} 178 bool ReverseBranchCondition(BBInfo &BBI); 186 void ScanInstructions(BBInfo &BBI); 189 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond, 193 void RemoveExtraEdges(BBInfo &BBI); 194 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind); 195 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind); 196 bool IfConvertDiamond(BBInfo &BBI, IfcvtKin 308 BBInfo &BBI = Token->BBI; local 437 ReverseBranchCondition(BBInfo &BBI) argument 629 ScanInstructions(BBInfo &BBI) argument 716 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch) argument 752 BBInfo &BBI = BBAnalysis[BB->getNumber()]; local 957 RemoveExtraEdges(BBInfo &BBI) argument 1024 IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) argument 1104 IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) argument 1224 IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2) argument 1458 PredicateBlock(BBInfo &BBI, MachineBasicBlock::iterator E, SmallVectorImpl<MachineOperand> &Cond, SmallSet<unsigned, 4> &Redefs, SmallSet<unsigned, 4> *LaterRedefs) argument [all...] |
/external/llvm/lib/Bitcode/Reader/ |
H A D | BitcodeReader.cpp | 1516 Function::iterator BBI = Fn->begin(), BBE = Fn->end(); local 1518 if (BBI == BBE) 1520 ++BBI; 1522 V = BlockAddress::get(Fn, BBI);
|
/external/llvm/lib/Target/ARM/ |
H A D | ARMConstantIslandPass.cpp | 360 const BasicBlockInfo &BBI = BBInfo[J]; 361 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) 362 << " kb=" << unsigned(BBI.KnownBits) 363 << " ua=" << unsigned(BBI.Unalign) 364 << " pa=" << unsigned(BBI.PostAlign) 799 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local 800 BBI.Size = 0; 801 BBI.Unalign = 0; 802 BBI.PostAlign = 0; 806 BBI 947 const BasicBlockInfo &BBI = BBInfo[U.MI->getParent()->getNumber()]; local [all...] |