/external/llvm/lib/Analysis/ |
Loads.cpp | 102 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); 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)) {
|
Lint.cpp | 609 BasicBlock::iterator BBI = L; 615 BB, BBI, 6, AA)) 617 if (BBI != BB->begin()) break; 620 BBI = BB->end();
|
LazyValueInfo.cpp | 378 Instruction *BBI, BasicBlock *BB); 518 Instruction *BBI = dyn_cast<Instruction>(Val); 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); [all...] |
/external/llvm/lib/Transforms/IPO/ |
LoopExtractor.cpp | 256 Function::iterator BBI = MF->begin(); 257 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); 258 TranslatedBlocksToNotExtract.insert(BBI);
|
/external/llvm/lib/Transforms/Scalar/ |
SimplifyCFGPass.cpp | 90 BasicBlock::iterator BBI = I, BBE = BB->end(); 91 while (BBI != BBE) { 92 if (!BBI->use_empty()) 93 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType())); 94 BB->getInstList().erase(BBI++); 129 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ 130 if (CallInst *CI = dyn_cast<CallInst>(BBI)) { [all...] |
TailRecursionElimination.cpp | 322 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { 323 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()); 384 BasicBlock::iterator BBI = TI; 386 CI = dyn_cast<CallInst>(BBI); 390 if (BBI == BB->begin()) 392 --BBI; 446 BasicBlock::iterator BBI = CI; 447 for (++BBI; &*BBI != Ret; ++BBI) [all...] |
CodeGenPrepare.cpp | 282 BasicBlock::iterator BBI = BI; 283 if (BBI != BB->begin()) { 284 --BBI; 285 while (isa<DbgInfoIntrinsic>(BBI)) { 286 if (BBI == BB->begin()) 288 --BBI; 290 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) 316 BasicBlock::const_iterator BBI = BB->begin(); 317 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) [all...] |
IndVarSimplify.cpp | 498 BasicBlock::iterator BBI = ExitBB->begin(); 499 while ((PN = dyn_cast<PHINode>(BBI++))) { [all...] |
/external/llvm/unittests/IR/ |
DominatorTreeTest.cpp | 32 BasicBlock::iterator BBI = BB0->begin(); 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/Target/AArch64/ |
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()]; 324 BBI.Size = 0; 325 BBI.Unalign = 0; 329 BBI.Size += TII->getInstSizeInBytes(*I); 333 BBI.Unalign = 2;
|
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineLoadStoreAlloca.cpp | 366 BasicBlock::iterator BBI = &LI; 367 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) 601 BasicBlock::iterator BBI = &SI; 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...] |
InstCombinePHI.cpp | 248 BasicBlock::iterator BBI = L, E = L->getParent()->end(); 250 for (++BBI; BBI != E; ++BBI) 251 if (BBI->mayWriteToMemory()) [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCContract.cpp | 398 BasicBlock::iterator BBI = Inst; 405 if (&*BBI == InstParent->begin()) { 409 BBI = Pred->getTerminator(); 412 --BBI; 413 } while (isNoopInstruction(BBI)); 415 if (&*BBI == GetObjCArg(Inst)) {
|
ObjCARCOpts.cpp | [all...] |
/external/llvm/lib/CodeGen/ |
LiveVariables.cpp | 707 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); 708 BBI != BBE && BBI->isPHI(); ++BBI) 709 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) 710 if (BBI->getOperand(i).readsReg()) 711 PHIVarInfo[BBI->getOperand(i + 1).getMBB()->getNumber()] 712 .push_back(BBI->getOperand(i).getReg()); 788 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); 789 for (; BBI != BBE && BBI->isPHI(); ++BBI) [all...] |
MachineBasicBlock.cpp | 345 MachineFunction::iterator BBI = NewBefore; 346 getParent()->splice(++BBI, this); [all...] |
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 != BBE && BBI->isPHI(); ++BBI) [all...] |
BranchFolding.cpp | 670 MachineBasicBlock::iterator BBI = 679 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI); [all...] |
IfConversion.cpp | 130 /// BBI - Corresponding BBInfo. 141 BBInfo &BBI; 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, IfcvtKind Kind [all...] |
/external/llvm/lib/Transforms/Utils/ |
Local.cpp | 616 BasicBlock::iterator BBI = BB->begin(); 617 while (isa<PHINode>(*BBI)) { 618 for (Value::use_iterator UI = BBI->use_begin(), E = BBI->use_end(); 627 ++BBI; [all...] |
LoopSimplify.cpp | 498 Function::iterator BBI = NewBB; --BBI; 500 if (&*BBI == SplitPreds[i]) 512 Function::iterator BBI = SplitPreds[i]; 513 if (++BBI != NewBB->getParent()->end() && 514 L->contains(BBI)) {
|
PromoteMemoryToRegister.cpp | 181 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); 182 BBI != E; ++BBI) 183 if (isInterestingInstruction(BBI)) 184 InstNumbers[BBI] = InstNo++; 665 BasicBlock::iterator BBI = BB->begin(); 666 while ((SomePHI = dyn_cast<PHINode>(BBI++)) && [all...] |
SimplifyCFG.cpp | 127 for (BasicBlock::iterator BBI = (*I)->begin(); 128 isa<PHINode>(BBI); ++BBI) { 129 PHINode *PN = cast<PHINode>(BBI); 168 for (BasicBlock::iterator BBI = (*I)->begin(); 169 isa<PHINode>(BBI); ++BBI) { 170 PHINode *PN = cast<PHINode>(BBI); [all...] |
/external/llvm/lib/Bitcode/Reader/ |
BitcodeReader.cpp | [all...] |
/external/llvm/lib/Target/ARM/ |
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) 798 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; 799 BBI.Size = 0; 800 BBI.Unalign = 0; 801 BBI.PostAlign = 0; 805 BBI.Size += TII->GetInstSizeInBytes(I) [all...] |