Searched defs:BBI (Results 1 - 23 of 23) sorted by relevance

/external/llvm/lib/Analysis/
H A DLoads.cpp121 BasicBlock::iterator BBI = ScanFrom->getIterator(), local
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)) {
H A DLint.cpp638 BasicBlock::iterator BBI = L->getIterator(); local
646 BB, BBI, DefMaxInstsToScan, AA))
648 if (BBI != BB->begin()) break;
651 BBI = BB->end();
H A DLazyValueInfo.cpp393 Instruction *BBI, BasicBlock *BB);
395 Instruction *BBI);
537 static LVILatticeVal getFromRangeMetadata(Instruction *BBI) { argument
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); local
576 if (!BBI || BBI->getParent() != BB) {
583 if (PHINode *PN = dyn_cast<PHINode>(BBI)) {
785 mergeAssumeBlockValueConstantRange(Value *Val, LVILatticeVal &BBLV, Instruction *BBI) argument
812 solveBlockValueConstantRange(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument
[all...]
/external/llvm/lib/Transforms/IPO/
H A DLoopExtractor.cpp262 Function::iterator BBI = MF->begin(); local
263 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB)));
264 TranslatedBlocksToNotExtract.insert(&*BBI);
/external/llvm/unittests/IR/
H A DDominatorTreeTest.cpp36 BasicBlock::iterator BBI = BB0->begin(); variable
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/
H A DAArch64BranchRelaxation.cpp135 const BasicBlockInfo &BBI = BlockInfo[MBB.getNumber()]; local
136 dbgs() << format("BB#%u\toffset=%08x\t", MBB.getNumber(), BBI.Offset)
137 << format("size=%#x\n", BBI.Size);
/external/llvm/lib/Transforms/Utils/
H A DLoopSimplify.cpp84 Function::iterator BBI = --NewBB->getIterator(); local
86 if (&*BBI == SplitPreds[i])
98 Function::iterator BBI = SplitPreds[i]->getIterator(); local
99 if (++BBI != NewBB->getParent()->end() && L->contains(&*BBI)) {
H A DPromoteMemoryToRegister.cpp208 for (const Instruction &BBI : *BB)
209 if (isInterestingInstruction(&BBI))
210 InstNumbers[&BBI] = InstNo++;
758 BasicBlock::iterator BBI = BB->begin(); local
759 while ((SomePHI = dyn_cast<PHINode>(BBI++)) &&
H A DLocal.cpp828 BasicBlock::iterator BBI = BB->begin(); local
829 while (isa<PHINode>(*BBI)) {
830 for (Use &U : BBI->uses()) {
838 ++BBI;
1210 BasicBlock::iterator BBI = I->getIterator(), BBE = BB->end(); local
1211 while (BBI != BBE) {
1212 if (!BBI->use_empty())
1213 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType()));
1214 BB->getInstList().erase(BBI
[all...]
H A DSimplifyCFG.cpp172 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);
1060 for (BasicBlock::iterator BBI = SI->begin();
1061 (PN = dyn_cast<PHINode>(BBI));
3443 BasicBlock::iterator BBI = UI->getIterator(); local
[all...]
/external/llvm/lib/CodeGen/
H A DLiveVariables.cpp711 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(); local
772 for (; BBI != BBE && BBI->isPHI(); ++BBI) {
[all...]
H A DBranchFolding.cpp717 MachineBasicBlock::iterator BBI = local
731 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI, BB);
H A DIfConversion.cpp136 /// BBI - Corresponding BBInfo.
147 BBInfo &BBI; member in struct:__anon12203::IfConverter::IfcvtToken
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, IfcvtKin
324 BBInfo &BBI = Token->BBI; local
452 ReverseBranchCondition(BBInfo &BBI) argument
644 ScanInstructions(BBInfo &BBI) argument
727 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch) argument
783 BBInfo &BBI = BBAnalysis[BB->getNumber()]; local
1001 RemoveExtraEdges(BBInfo &BBI) argument
1071 IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) argument
1157 IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) argument
1304 IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2) argument
1548 PredicateBlock(BBInfo &BBI, MachineBasicBlock::iterator E, SmallVectorImpl<MachineOperand> &Cond, SmallSet<unsigned, 4> *LaterRedefs) argument
[all...]
H A DCodeGenPrepare.cpp368 BasicBlock::iterator BBI = BI->getIterator(); local
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(); local
403 while (const PHINode *PN = dyn_cast<PHINode>(BBI
[all...]
/external/llvm/lib/Transforms/InstCombine/
H A DInstCombinePHI.cpp249 BasicBlock::iterator BBI = L->getIterator(), E = L->getParent()->end(); local
251 for (++BBI; BBI != E; ++BBI)
252 if (BBI->mayWriteToMemory())
/external/llvm/lib/Transforms/Scalar/
H A DMemCpyOptimizer.cpp335 bool processStore(StoreInst *SI, BasicBlock::iterator &BBI);
336 bool processMemSet(MemSetInst *SI, BasicBlock::iterator &BBI);
485 bool MemCpyOpt::processStore(StoreInst *SI, BasicBlock::iterator &BBI) { argument
558 BBI = I->getIterator(); // Don't invalidate iterator.
565 bool MemCpyOpt::processMemSet(MemSetInst *MSI, BasicBlock::iterator &BBI) { argument
571 BBI = I->getIterator(); // Don't invalidate iterator.
H A DScalarizer.cpp49 // insert them before BBI in BB. If Cache is nonnull, use it to cache
62 BasicBlock::iterator BBI; member in class:__anon12986::Scatterer
187 : BB(bb), BBI(bbi), V(v), CachePtr(cachePtr) {
207 IRBuilder<> Builder(BB, BBI);
H A DIndVarSimplify.cpp579 BasicBlock::iterator BBI = ExitBB->begin(); local
580 while ((PN = dyn_cast<PHINode>(BBI++))) {
/external/llvm/lib/Target/ARM/
H A DARMConstantIslandPass.cpp377 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)
902 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local
903 BBI.Size = 0;
904 BBI.Unalign = 0;
905 BBI.PostAlign = 0;
909 BBI
1050 const BasicBlockInfo &BBI = BBInfo[U.MI->getParent()->getNumber()]; local
[all...]
H A DARMISelLowering.cpp8071 MachineFunction::iterator BBI = ++BB->getIterator(); local
8075 Fn->insert(BBI, RSBBB);
8076 Fn->insert(BBI, SinkBB);
/external/llvm/lib/Target/Mips/
H A DMipsConstantIslandPass.cpp434 const BasicBlockInfo &BBI = BBInfo[J];
435 dbgs() << format("%08x BB#%u\t", BBI.Offset, J)
813 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local
814 BBI.Size = 0;
818 BBI.Size += TII->GetInstSizeInBytes(I);
1013 const BasicBlockInfo &BBI = BBInfo[Block];
1018 << format("%#x-%x\t", BBI.Offset, BBI.postOffset()) << *MI
/external/llvm/lib/Transforms/ObjCARC/
H A DObjCARCOpts.cpp1038 const DenseMap<const BasicBlock *, BBState>::iterator BBI = local
1040 assert(BBI != BBStates.end());
1041 const BottomUpPtrState &SuccS = BBI->second.getPtrBottomUpState(Arg);
/external/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp2947 Function::iterator BBI = Fn->begin(), BBE = Fn->end(); local
2949 if (BBI == BBE)
2951 ++BBI;
2953 BB = &*BBI;

Completed in 653 milliseconds