/external/llvm/lib/Analysis/ |
Loads.cpp | 130 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); 132 while (BBI != E) { 133 --BBI; 137 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && 138 !isa<DbgInfoIntrinsic>(BBI)) 141 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { 143 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
|
Lint.cpp | 572 BasicBlock::iterator BBI = L; 578 BB, BBI, 6, AA)) 580 if (BBI != BB->begin()) break; 583 BBI = BB->end();
|
LazyValueInfo.cpp | 413 Instruction *BBI, BasicBlock *BB); 540 Instruction *BBI = dyn_cast<Instruction>(Val); 541 if (BBI == 0 || BBI->getParent() != BB) { 545 if (PHINode *PN = dyn_cast<PHINode>(BBI)) { 549 if (AllocaInst *AI = dyn_cast<AllocaInst>(BBI)) { 557 if ((!isa<BinaryOperator>(BBI) && !isa<CastInst>(BBI)) || 558 !BBI->getType()->isIntegerTy()) { 567 BinaryOperator *BO = dyn_cast<BinaryOperator>(BBI); [all...] |
/external/llvm/lib/Transforms/IPO/ |
LoopExtractor.cpp | 255 Function::iterator BBI = MF->begin(); 256 std::advance(BBI, std::distance(F->begin(), Function::iterator(BB))); 257 TranslatedBlocksToNotExtract.insert(BBI);
|
/external/llvm/lib/Transforms/Scalar/ |
SimplifyCFGPass.cpp | 82 BasicBlock::iterator BBI = I, BBE = BB->end(); 83 while (BBI != BBE) { 84 if (!BBI->use_empty()) 85 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType())); 86 BB->getInstList().erase(BBI++); 124 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ 125 if (CallInst *CI = dyn_cast<CallInst>(BBI)) { [all...] |
TailRecursionElimination.cpp | 309 for (Function::iterator BBI = F->begin(), E = F->end(); BBI != E; ++BBI) { 310 ReturnInst *RI = dyn_cast<ReturnInst>(BBI->getTerminator()); 371 BasicBlock::iterator BBI = TI; 373 CI = dyn_cast<CallInst>(BBI); 377 if (BBI == BB->begin()) 379 --BBI; 432 BasicBlock::iterator BBI = CI; 433 for (++BBI; &*BBI != Ret; ++BBI) [all...] |
CodeGenPrepare.cpp | 188 BasicBlock::iterator BBI = BI; 189 if (BBI != BB->begin()) { 190 --BBI; 191 while (isa<DbgInfoIntrinsic>(BBI)) { 192 if (BBI == BB->begin()) 194 --BBI; 196 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) 222 BasicBlock::const_iterator BBI = BB->begin(); 223 while (const PHINode *PN = dyn_cast<PHINode>(BBI++)) [all...] |
IndVarSimplify.cpp | 515 BasicBlock::iterator BBI = ExitBB->begin(); 516 while ((PN = dyn_cast<PHINode>(BBI++))) { [all...] |
ObjCARC.cpp | [all...] |
/external/llvm/lib/Transforms/InstCombine/ |
InstCombineLoadStoreAlloca.cpp | 173 BasicBlock::iterator BBI = &LI; 174 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) 408 BasicBlock::iterator BBI = &SI; 409 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts; 411 --BBI; 414 if (isa<DbgInfoIntrinsic>(BBI) || 415 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) { 420 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) { 425 ++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/CodeGen/ |
MachineBasicBlock.cpp | 277 MachineFunction::iterator BBI = NewBefore; 278 getParent()->splice(++BBI, this);
|
StrongPHIElimination.cpp | 242 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); 243 BBI != BBE && BBI->isPHI(); ++BBI) { 244 unsigned DestReg = BBI->getOperand(0).getReg(); 246 PHISrcDefs[I].push_back(BBI); 248 for (unsigned i = 1; i < BBI->getNumOperands(); i += 2) { 249 MachineOperand &SrcMO = BBI->getOperand(i); 275 for (MachineBasicBlock::iterator BBI = I->begin(), BBE = I->end(); 276 BBI != BBE && BBI->isPHI(); ++BBI) [all...] |
BranchFolding.cpp | 663 MachineBasicBlock::iterator BBI = 672 MachineBasicBlock *newMBB = SplitMBBAt(*MBB, BBI); [all...] |
IfConversion.cpp | 128 /// BBI - Corresponding BBInfo. 139 BBInfo &BBI; 145 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} 175 bool ReverseBranchCondition(BBInfo &BBI); 183 void ScanInstructions(BBInfo &BBI); 186 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond, 190 void RemoveExtraEdges(BBInfo &BBI); 191 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind); 192 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind); 193 bool IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind [all...] |
/external/llvm/lib/Transforms/Utils/ |
Local.cpp | 576 BasicBlock::iterator BBI = BB->begin(); 577 while (isa<PHINode>(*BBI)) { 578 for (Value::use_iterator UI = BBI->use_begin(), E = BBI->use_end(); 587 ++BBI; [all...] |
LoopSimplify.cpp | 484 Function::iterator BBI = NewBB; --BBI; 486 if (&*BBI == SplitPreds[i]) 498 Function::iterator BBI = SplitPreds[i]; 499 if (++BBI != NewBB->getParent()->end() && 500 L->contains(BBI)) {
|
PromoteMemoryToRegister.cpp | 179 for (BasicBlock::const_iterator BBI = BB->begin(), E = BB->end(); 180 BBI != E; ++BBI) 181 if (isInterestingInstruction(BBI)) 182 InstNumbers[BBI] = InstNo++; 654 BasicBlock::iterator BBI = BB->begin(); 655 while ((SomePHI = dyn_cast<PHINode>(BBI++)) && [all...] |
SimplifyCFG.cpp | 96 for (BasicBlock::iterator BBI = (*I)->begin(); 97 isa<PHINode>(BBI); ++BBI) { 98 PHINode *PN = cast<PHINode>(BBI); [all...] |
/external/llvm/lib/CodeGen/SelectionDAG/ |
SelectionDAGBuilder.cpp | [all...] |
/external/llvm/lib/Target/ARM/ |
ARMISelLowering.cpp | [all...] |