/external/llvm/lib/Analysis/ |
Loads.cpp | 121 BasicBlock::iterator BBI = ScanFrom->getIterator(), 128 while (BBI != E) { 129 --BBI; 133 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && 134 !isa<DbgInfoIntrinsic>(BBI)) 139 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { 142 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
|
Lint.cpp | 638 BasicBlock::iterator BBI = L->getIterator(); 646 BB, BBI, DefMaxInstsToScan, AA)) 648 if (BBI != BB->begin()) break; 651 BBI = BB->end();
|
LazyValueInfo.cpp | 393 Instruction *BBI, BasicBlock *BB); 395 Instruction *BBI); 537 static LVILatticeVal getFromRangeMetadata(Instruction *BBI) { 538 switch (BBI->getOpcode()) { 543 if (MDNode *Ranges = BBI->getMetadata(LLVMContext::MD_range)) 544 if (isa<IntegerType>(BBI->getType())) { 575 Instruction *BBI = dyn_cast<Instruction>(Val); 576 if (!BBI || BBI->getParent() != BB) { 583 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { [all...] |
/external/llvm/lib/Transforms/IPO/ |
LoopExtractor.cpp | 262 Function::iterator BBI = MF->begin(); 263 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); 264 TranslatedBlocksToNotExtract.insert(&*BBI);
|
/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...] |
/external/llvm/lib/Target/AArch64/ |
AArch64BranchRelaxation.cpp | 135 const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()]; 136 dbgs() << format("BB#%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset) 137 << format("size=%#x\n", BBI.Size);
|
/external/llvm/lib/CodeGen/ |
LiveVariables.cpp | 711 for (const auto &BBI : MBB) { 712 if (!BBI.isPHI()) 714 for (unsigned i = 1, e = BBI.getNumOperands(); i != e; i += 2) 715 if (BBI.getOperand(i).readsReg()) 716 PHIVarInfo[BBI.getOperand(i + 1).getMBB()->getNumber()] 717 .push_back(BBI.getOperand(i).getReg()); 771 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); 772 for (; BBI != BBE && BBI->isPHI(); ++BBI) { [all...] |
BranchFolding.cpp | 717 MachineBasicBlock::iterator BBI = 731 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI, BB); [all...] |
IfConversion.cpp | 136 /// BBI - Corresponding BBInfo. 147 BBInfo &BBI; 153 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} 192 bool ReverseBranchCondition(BBInfo &BBI); 200 void ScanInstructions(BBInfo &BBI); 202 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond, 206 void RemoveExtraEdges(BBInfo &BBI); 207 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind); 208 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind); 209 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind [all...] |
CodeGenPrepare.cpp | 368 BasicBlock::iterator BBI = BI->getIterator(); 369 if (BBI != BB->begin()) { 370 --BBI; 371 while (isa<DbgInfoIntrinsic>(BBI)) { 372 if (BBI == BB->begin()) 374 --BBI; 376 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) 402 BasicBlock::const_iterator BBI = BB->begin(); 403 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) [all...] |
/external/llvm/lib/Transforms/Utils/ |
LoopSimplify.cpp | 84 Function::iterator BBI = --NewBB->getIterator(); 86 if (&*BBI == SplitPreds[i]) 98 Function::iterator BBI = SplitPreds[i]->getIterator(); 99 if (++BBI != NewBB->getParent()->end() && L->contains(&*BBI)) { [all...] |
PromoteMemoryToRegister.cpp | 208 for (const Instruction &BBI : *BB) 209 if (isInterestingInstruction(&BBI)) 210 InstNumbers[&BBI] = InstNo++; 758 BasicBlock::iterator BBI = BB->begin(); 759 while ((SomePHI = dyn_cast<PHINode>(BBI++)) && [all...] |
Local.cpp | 828 BasicBlock::iterator BBI = BB->begin(); 829 while (isa<PHINode>(*BBI)) { 830 for (Use &U : BBI->uses()) { 838 ++BBI; [all...] |
SimplifyCFG.cpp | 172 for (BasicBlock::iterator BBI = (*I)->begin(); 173 isa<PHINode>(BBI); ++BBI) { 174 PHINode *PN = cast<PHINode>(BBI); 211 for (BasicBlock::iterator BBI = (*I)->begin(); 212 isa<PHINode>(BBI); ++BBI) { 213 PHINode *PN = cast<PHINode>(BBI); [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombinePHI.cpp | 249 BasicBlock::iterator BBI = L->getIterator(), E = L->getParent()->end(); 251 for (++BBI; BBI != E; ++BBI) 252 if (BBI->mayWriteToMemory()) [all...] |
/external/llvm/lib/Transforms/Scalar/ |
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);
|
IndVarSimplify.cpp | 579 BasicBlock::iterator BBI = ExitBB->begin(); 580 while ((PN = dyn_cast<PHINode>(BBI++))) { [all...] |
/external/llvm/lib/Target/Mips/ |
MipsConstantIslandPass.cpp | 434 const BasicBlockInfo &BBI = BBInfo[J]; 435 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) 813 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; 814 BBI.Size = 0; 818 BBI.Size += TII->GetInstSizeInBytes(I); [all...] |
/external/llvm/lib/Target/ARM/ |
ARMConstantIslandPass.cpp | 377 const BasicBlockInfo &BBI = BBInfo[J]; 378 dbgs() << format("%08x BB#%u\t", BBI.Offset, J) 379 << " kb=" << unsigned(BBI.KnownBits) 380 << " ua=" << unsigned(BBI.Unalign) 381 << " pa=" << unsigned(BBI.PostAlign) [all...] |
ARMISelLowering.cpp | [all...] |
/external/llvm/lib/Transforms/ObjCARC/ |
ObjCARCOpts.cpp | [all...] |
/external/llvm/lib/Bitcode/Reader/ |
BitcodeReader.cpp | [all...] |