/macosx-10.10/llvmCore-3425.0.34/lib/CodeGen/ |
H A D | IfConversion.cpp | 129 /// BBI - Corresponding BBInfo. 140 BBInfo &BBI; member in struct:__anon10214::IfConverter::IfcvtToken 146 : BBI(b), Kind(k), NeedSubsumption(s), NumDups(d), NumDups2(d2) {} 177 bool ReverseBranchCondition(BBInfo &BBI); 185 void ScanInstructions(BBInfo &BBI); 188 bool FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Cond, 192 void RemoveExtraEdges(BBInfo &BBI); 193 bool IfConvertSimple(BBInfo &BBI, IfcvtKind Kind); 194 bool IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind); 195 bool IfConvertDiamond(BBInfo &BBI, IfcvtKin 307 BBInfo &BBI = Token->BBI; local 436 ReverseBranchCondition(BBInfo &BBI) argument 628 ScanInstructions(BBInfo &BBI) argument 715 FeasibilityAnalysis(BBInfo &BBI, SmallVectorImpl<MachineOperand> &Pred, bool isTriangle, bool RevBranch) argument 751 BBInfo &BBI = BBAnalysis[BB->getNumber()]; local 956 RemoveExtraEdges(BBInfo &BBI) argument 1024 IfConvertSimple(BBInfo &BBI, IfcvtKind Kind) argument 1096 IfConvertTriangle(BBInfo &BBI, IfcvtKind Kind) argument 1207 IfConvertDiamond(BBInfo &BBI, IfcvtKind Kind, unsigned NumDups1, unsigned NumDups2) argument 1436 PredicateBlock(BBInfo &BBI, MachineBasicBlock::iterator E, SmallVectorImpl<MachineOperand> &Cond, SmallSet<unsigned, 4> &Redefs, SmallSet<unsigned, 4> *LaterRedefs) argument [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 | PHIElimination.cpp | 412 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); 413 BBI != BBE && BBI->isPHI(); ++BBI) 414 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) 415 ++VRegPHIUseCount[BBVRegPair(BBI->getOperand(i+1).getMBB()->getNumber(), 416 BBI->getOperand(i).getReg())]; 430 for (MachineBasicBlock::iterator BBI = MBB.begin(), BBE = MBB.end(); 431 BBI != BBE && BBI [all...] |
H A D | LiveVariables.cpp | 730 for (MachineBasicBlock::const_iterator BBI = I->begin(), BBE = I->end(); 731 BBI != BBE && BBI->isPHI(); ++BBI) 732 for (unsigned i = 1, e = BBI->getNumOperands(); i != e; i += 2) 733 if (BBI->getOperand(i).readsReg()) 734 PHIVarInfo[BBI->getOperand(i + 1).getMBB()->getNumber()] 735 .push_back(BBI->getOperand(i).getReg()); 811 MachineBasicBlock::iterator BBI = SuccBB->begin(), BBE = SuccBB->end(); local 812 for (; BBI ! [all...] |
H A D | Analysis.cpp | 293 for (BasicBlock::const_iterator BBI = prior(prior(ExitBB->end())); ; 294 --BBI) { 295 if (&*BBI == I) 298 if (isa<DbgInfoIntrinsic>(BBI)) 300 if (BBI->mayHaveSideEffects() || BBI->mayReadFromMemory() || 301 !isSafeToSpeculativelyExecute(BBI))
|
H A D | GCStrategy.cpp | 378 for (MachineFunction::iterator BBI = MF.begin(), 379 BBE = MF.end(); BBI != BBE; ++BBI) 380 for (MachineBasicBlock::iterator MI = BBI->begin(), 381 ME = BBI->end(); MI != ME; ++MI)
|
/macosx-10.10/llvmCore-3425.0.34/unittests/VMCore/ |
H A D | DominatorTreeTest.cpp | 23 BasicBlock::iterator BBI = BB0->begin(); local 24 Instruction *Y1 = BBI++; 25 Instruction *Y2 = BBI++; 26 Instruction *Y3 = BBI++; 29 BBI = BB1->begin(); 30 Instruction *Y4 = BBI++; 33 BBI = BB2->begin(); 34 Instruction *Y5 = BBI++; 37 BBI = BB3->begin(); 38 Instruction *Y6 = BBI [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Scalar/ |
H A D | SimplifyCFGPass.cpp | 82 BasicBlock::iterator BBI = I, BBE = BB->end(); local 83 while (BBI != BBE) { 84 if (!BBI->use_empty()) 85 BBI->replaceAllUsesWith(UndefValue::get(BBI->getType())); 86 BB->getInstList().erase(BBI++); 123 for (BasicBlock::iterator BBI = BB->begin(), E = BB->end(); BBI != E;++BBI){ 124 if (CallInst *CI = dyn_cast<CallInst>(BBI)) { [all...] |
H A D | DeadStoreElimination.cpp | 495 for (BasicBlock::iterator BBI = BB.begin(), BBE = BB.end(); BBI != BBE; ) { 496 Instruction *Inst = BBI++; 524 // DeleteDeadInstruction can delete the current instruction. Save BBI 526 WeakVH NextInst(BBI); 531 BBI = BB.begin(); 532 else if (BBI != BB.begin()) // Revisit this instruction if possible. 533 --BBI; 580 // cases, reset BBI. 581 BBI [all...] |
H A D | 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; local 373 CI = dyn_cast<CallInst>(BBI); 377 if (BBI == BB->begin()) 379 --BBI; 432 BasicBlock::iterator BBI = CI; local 433 for (++BBI; [all...] |
H A D | CodeGenPrepare.cpp | 355 BasicBlock::iterator BBI = BI; local 356 if (BBI != BB->begin()) { 357 --BBI; 358 while (isa<DbgInfoIntrinsic>(BBI)) { 359 if (BBI == BB->begin()) 361 --BBI; 363 if (!isa<DbgInfoIntrinsic>(BBI) && !isa<PHINode>(BBI)) 389 BasicBlock::const_iterator BBI = BB->begin(); local 390 while (const PHINode *PN = dyn_cast<PHINode>(BBI [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/InstCombine/ |
H A D | InstCombineLoadStoreAlloca.cpp | 383 BasicBlock::iterator BBI = &LI; 384 if (Value *AvailableVal = FindAvailableLoadedValue(Op, LI.getParent(), BBI,6)) 618 BasicBlock::iterator BBI = &SI; local 619 for (unsigned ScanInsts = 6; BBI != SI.getParent()->begin() && ScanInsts; 621 --BBI; 624 if (isa<DbgInfoIntrinsic>(BBI) || 625 (isa<BitCastInst>(BBI) && BBI->getType()->isPointerTy())) { 630 if (StoreInst *PrevSI = dyn_cast<StoreInst>(BBI)) { 635 ++BBI; [all...] |
H A D | InstCombineMulDivRem.cpp | 325 BasicBlock::iterator BBI = &I, BBFront = I.getParent()->begin(); 327 while (BBI != BBFront) { 328 --BBI; 331 if (isa<CallInst>(BBI) && !isa<IntrinsicInst>(BBI)) 335 for (Instruction::op_iterator I = BBI->op_begin(), E = BBI->op_end(); 339 Worklist.Add(BBI); 341 *I = NonNullOperand == 1 ? ConstantInt::getTrue(BBI->getContext()) : 342 ConstantInt::getFalse(BBI [all...] |
/macosx-10.10/llvmCore-3425.0.34/lib/Analysis/ |
H A D | Loads.cpp | 131 BasicBlock::iterator BBI = ScanFrom, E = ScanFrom->getParent()->begin(); local 133 while (BBI != E) { 134 --BBI; 138 if (isa<CallInst>(BBI) && BBI->mayWriteToMemory() && 139 !isa<DbgInfoIntrinsic>(BBI)) 142 if (LoadInst *LI = dyn_cast<LoadInst>(BBI)) { 144 } else if (StoreInst *SI = dyn_cast<StoreInst>(BBI)) {
|
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); 692 solveBlockValueConstantRange(LVILatticeVal &BBLV, Instruction *BBI, BasicBlock *BB) argument [all...] |
H A D | ProfileEstimatorPass.cpp | 366 for (std::set<BasicBlock*>::iterator BBI = BBToVisit.begin(), BBE = BBToVisit.end(); 367 (BBI != BBE) && (!found); ++BBI) { 368 BasicBlock *BB = *BBI;
|
/macosx-10.10/llvmCore-3425.0.34/lib/Transforms/Utils/ |
H A D | LCSSA.cpp | 137 for (Loop::block_iterator BBI = L->block_begin(), E = L->block_end(); 138 BBI != E; ++BBI) { 139 BasicBlock *BB = *BBI; 217 for (SmallVectorImpl<BasicBlock*>::const_iterator BBI = ExitBlocks.begin(), 218 BBE = ExitBlocks.end(); BBI != BBE; ++BBI) { 219 BasicBlock *ExitBB = *BBI;
|
H A D | SimplifyCFG.cpp | 122 for (BasicBlock::iterator BBI = (*I)->begin(); 123 isa<PHINode>(BBI); ++BBI) { 124 PHINode *PN = cast<PHINode>(BBI); 163 for (BasicBlock::iterator BBI = (*I)->begin(); 164 isa<PHINode>(BBI); ++BBI) { 165 PHINode *PN = cast<PHINode>(BBI); 1040 for (BasicBlock::iterator BBI = SI->begin(); 1041 (PN = dyn_cast<PHINode>(BBI)); 2241 BasicBlock::iterator BBI = BB->begin(); local 2847 BasicBlock::iterator BBI = UI; local [all...] |
H A D | LoopUnroll.cpp | 304 for (BasicBlock::iterator BBI = (*SI)->begin(); 305 PHINode *phi = dyn_cast<PHINode>(BBI); ++BBI) { 390 for (BasicBlock::iterator BBI = (*SI)->begin(); 391 PHINode *Phi = dyn_cast<PHINode>(BBI); ++BBI) {
|
H A D | LoopSimplify.cpp | 491 Function::iterator BBI = NewBB; --BBI; local 493 if (&*BBI == SplitPreds[i]) 505 Function::iterator BBI = SplitPreds[i]; local 506 if (++BBI != NewBB->getParent()->end() && 507 L->contains(BBI)) {
|
H A D | LoopUnrollRuntime.cpp | 70 for (BasicBlock::iterator BBI = (*SBI)->begin(); 71 PHINode *PN = dyn_cast<PHINode>(BBI); ++BBI) {
|
H A D | 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++; 657 BasicBlock::iterator BBI = BB->begin(); local 658 while ((SomePHI = dyn_cast<PHINode>(BBI++)) &&
|
/macosx-10.10/llvmCore-3425.0.34/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);
|
/macosx-10.10/llvmCore-3425.0.34/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) 798 BasicBlockInfo &BBI = BBInfo[MBB->getNumber()]; local 799 BBI.Size = 0; 800 BBI.Unalign = 0; 801 BBI.PostAlign = 0; 805 BBI 946 const BasicBlockInfo &BBI = BBInfo[U.MI->getParent()->getNumber()]; local [all...] |
/macosx-10.10/llvmCore-3425.0.34/include/llvm/Transforms/Utils/ |
H A D | SSAUpdaterImpl.h | 377 for (typename BlkT::iterator BBI = BB->begin(), BBE = BB->end(); 378 BBI != BBE; ++BBI) { 379 PhiT *SomePHI = Traits::InstrIsPHI(BBI);
|