/external/llvm/lib/Transforms/ObjCARC/ |
H A D | DependencyAnalysis.cpp | 248 BasicBlock *PredBB = *PI; local 249 if (Visited.insert(PredBB).second) 250 Worklist.push_back(std::make_pair(PredBB, PredBB->end()));
|
/external/llvm/lib/Analysis/ |
H A D | PHITransAddr.cpp | 146 BasicBlock *PredBB, 171 return AddAsInput(PN->getIncomingValueForBlock(PredBB)); 191 Value *PHIIn = PHITranslateSubExpr(Cast->getOperand(0), CurBB, PredBB, DT); 209 (!DT || DT->dominates(CastI->getParent(), PredBB))) 220 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT); 245 (!DT || DT->dominates(GEPI->getParent(), PredBB))) { 267 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT); 303 (!DT || DT->dominates(BO->getParent(), PredBB))) 318 /// PredBB. This returns true on failure and sets Addr to null. 319 bool PHITransAddr::PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, argument 145 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument 343 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument 367 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument [all...] |
H A D | LazyValueInfo.cpp | 407 /// PredBB to OldSucc has been threaded to be from PredBB to NewSucc. 408 void threadEdge(BasicBlock *PredBB,BasicBlock *OldSucc,BasicBlock *NewSucc); 1041 void LazyValueInfoCache::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, argument 1269 void LazyValueInfo::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, argument 1272 const DataLayout &DL = PredBB->getModule()->getDataLayout(); 1273 getCache(PImpl, AC, &DL, DT).threadEdge(PredBB, OldSucc, NewSucc);
|
/external/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 139 BasicBlock *PredBB = PN->getIncomingBlock(I); local 140 if (PredBB->getTerminator()->getNumSuccessors() > 1) 141 PredBB = SplitEdge(PredBB, PN->getParent()); 142 Instruction *InsertPos = PredBB->getTerminator();
|
/external/llvm/include/llvm/Analysis/ |
H A D | LoopInfoImpl.h | 357 BlockT *PredBB = ReverseCFGWorklist.back(); local 360 LoopT *Subloop = LI->getLoopFor(PredBB); 362 if (!DomTree.isReachableFromEntry(PredBB)) 366 LI->changeLoopFor(PredBB, L); 368 if (PredBB == L->getHeader()) 372 InvBlockTraits::child_begin(PredBB), 373 InvBlockTraits::child_end(PredBB)); 388 PredBB = Subloop->getHeader(); 394 InvBlockTraits::child_begin(PredBB), 395 PE = InvBlockTraits::child_end(PredBB); P [all...] |
/external/llvm/lib/CodeGen/ |
H A D | MachineSSAUpdater.cpp | 165 MachineBasicBlock *PredBB = *PI; local 166 unsigned PredVal = GetValueAtEndOfBlockInternal(PredBB); 167 PredValues.push_back(std::make_pair(PredBB, PredVal));
|
H A D | TailDuplication.cpp | 92 MachineBasicBlock *PredBB, 99 MachineBasicBlock *PredBB, 173 MachineBasicBlock *PredBB = *PI; local 177 if (PHIBB == PredBB) { 185 << PredBB->getNumber() << '\n'; 393 /// ProcessPHI - Process PHI node in TailBB by turning it into a copy in PredBB. 394 /// Remember the source register that's contributed by PredBB and update SSA 397 MachineInstr *MI, MachineBasicBlock *TailBB, MachineBasicBlock *PredBB, 402 unsigned SrcOpIdx = getPHISrcRegOpIdx(MI, PredBB); 413 AddSSAUpdateEntry(DefReg, NewDef, PredBB); 396 ProcessPHI( MachineInstr *MI, MachineBasicBlock *TailBB, MachineBasicBlock *PredBB, DenseMap<unsigned, unsigned> &LocalVRMap, SmallVectorImpl<std::pair<unsigned, unsigned> > &Copies, const DenseSet<unsigned> &RegsUsedByPhi, bool Remove) argument 427 DuplicateInstruction(MachineInstr *MI, MachineBasicBlock *TailBB, MachineBasicBlock *PredBB, MachineFunction &MF, DenseMap<unsigned, unsigned> &LocalVRMap, const DenseSet<unsigned> &UsedByPhi) argument 653 MachineBasicBlock *PredBB = *PI; local 681 MachineBasicBlock *PredBB = *PI; local 770 MachineBasicBlock *PredBB = *PI; local 934 MachineBasicBlock *PredBB = *PI; local [all...] |
H A D | BranchFolding.cpp | 560 MachineBasicBlock *PredBB) { 570 if (MBB1 == PredBB || MBB2 == PredBB) { 572 unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I); 590 if (SuccBB && MBB1 != PredBB && MBB2 != PredBB && 625 MachineBasicBlock *PredBB) { 638 SuccBB, PredBB)) { 660 MachineBasicBlock *PredBB) { 667 if (SuccBB && CurMBB != PredBB) 553 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, unsigned minCommonTailLength, unsigned &CommonTailLen, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 622 ComputeSameTails(unsigned CurHash, unsigned minCommonTailLength, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 658 RemoveBlocksWithHash(unsigned CurHash, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 679 CreateCommonTailOnlyBlock(MachineBasicBlock *&PredBB, MachineBasicBlock *SuccBB, unsigned maxCommonTailLength, unsigned &commonTailIndex) argument 795 TryTailMergeBlocks(MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 963 MachineBasicBlock *PredBB = std::prev(I); local 1504 MachineBasicBlock *PredBB = *PI; local [all...] |
/external/llvm/lib/IR/ |
H A D | Value.cpp | 612 const BasicBlock *PredBB) { 615 return PN->getIncomingValueForBlock(PredBB); 611 DoPHITranslation(const BasicBlock *CurBB, const BasicBlock *PredBB) argument
|
/external/llvm/lib/Transforms/Utils/ |
H A D | SSAUpdater.cpp | 102 BasicBlock *PredBB = SomePhi->getIncomingBlock(i); local 103 Value *PredVal = GetValueAtEndOfBlock(PredBB); 104 PredValues.push_back(std::make_pair(PredBB, PredVal)); 115 BasicBlock *PredBB = *PI; local 116 Value *PredVal = GetValueAtEndOfBlock(PredBB); 117 PredValues.push_back(std::make_pair(PredBB, PredVal));
|
H A D | Local.cpp | 508 BasicBlock *PredBB = DestBB->getSinglePredecessor(); local 509 assert(PredBB && "Block doesn't have a single predecessor!"); 522 // Anything that branched to PredBB now branches to DestBB. 523 PredBB->replaceAllUsesWith(DestBB); 525 // Splice all the instructions from PredBB to DestBB. 526 PredBB->getTerminator()->eraseFromParent(); 527 DestBB->getInstList().splice(DestBB->begin(), PredBB->getInstList()); 529 // If the PredBB is the entry block of the function, move DestBB up to 530 // become the entry block after we erase PredBB. 531 if (PredBB 717 BasicBlock *PredBB = OldValPN->getIncomingBlock(i); local 730 BasicBlock *PredBB = BBPreds[i]; local [all...] |
H A D | SimplifyCFG.cpp | 1713 // Okay, we now know that all edges from PredBB should be revectored to 1715 BasicBlock *PredBB = PN->getIncomingBlock(i); local 1720 if (isa<IndirectBrInst>(PredBB->getTerminator())) continue; 1741 TranslateMap[PN] = PN->getIncomingValueForBlock(PredBB); 1768 // Loop over all of the edges from PredBB to BB, changing them to branch 1770 TerminatorInst *PredBBTI = PredBB->getTerminator(); 1773 BB->removePredecessor(PredBB);
|
/external/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 509 BasicBlock *PredBB = PN->getIncomingBlock(i); local 511 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB); 520 cast<Constant>(RHS), PredBB, BB, 528 Result.push_back(std::make_pair(KC, PredBB)); 931 BasicBlock *PredBB = *PI; local 934 if (!PredsScanned.insert(PredBB).second) 938 BBIt = PredBB->end(); 940 Value *PredAvailable = FindAvailableLoadedValue(LoadedPtr, PredBB, BBIt, 6, 943 OneUnavailablePred = PredBB; 952 AvailablePreds.push_back(std::make_pair(PredBB, PredAvailabl 1241 BasicBlock *PredBB = PN->getIncomingBlock(i); local 1414 BasicBlock *PredBB; local 1557 BasicBlock *PredBB; local [all...] |
/external/llvm/include/llvm/IR/ |
H A D | IRBuilder.h | 110 BasicBlock *PredBB = Phi->getIncomingBlock(U); local 111 assert(U != PredBB->getTerminator() && "critical edge not split"); 112 SetInsertPoint(PredBB, PredBB->getTerminator());
|
/external/llvm/lib/Transforms/InstCombine/ |
H A D | InstructionCombining.cpp | 1929 BasicBlock *PredBB = FreeInstrBB->getSinglePredecessor(); local 1935 if (!PredBB) 1949 TerminatorInst *TI = PredBB->getTerminator();
|