/freebsd-10-stable/contrib/llvm/include/llvm/Analysis/ |
H A D | PHITransAddr.h | 75 /// PredBB. This returns true on failure and sets Addr to null. 76 bool PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, 86 Value *PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, 97 Value *PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, 101 /// version of 'V' for the edge PredBB->CurBB into the end of the PredBB 106 BasicBlock *PredBB, const DominatorTree &DT,
|
H A D | LazyValueInfo.h | 65 /// PredBB to OldSucc to be from PredBB to NewSucc instead. 66 void threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, BasicBlock *NewSucc);
|
H A D | LoopInfoImpl.h | 356 BlockT *PredBB = ReverseCFGWorklist.back(); local 359 LoopT *Subloop = LI->getLoopFor(PredBB); 361 if (!DomTree.isReachableFromEntry(PredBB)) 365 LI->changeLoopFor(PredBB, L); 367 if (PredBB == L->getHeader()) 371 InvBlockTraits::child_begin(PredBB), 372 InvBlockTraits::child_end(PredBB)); 387 PredBB = Subloop->getHeader(); 393 InvBlockTraits::child_begin(PredBB), 394 PE = InvBlockTraits::child_end(PredBB); P [all...] |
/freebsd-10-stable/contrib/llvm/lib/CodeGen/ |
H A D | TailDuplication.cpp | 87 MachineBasicBlock *PredBB, 94 MachineBasicBlock *PredBB, 158 MachineBasicBlock *PredBB = *PI; local 162 if (PHIBB == PredBB) { 170 << PredBB->getNumber() << '\n'; 382 /// ProcessPHI - Process PHI node in TailBB by turning it into a copy in PredBB. 383 /// Remember the source register that's contributed by PredBB and update SSA 386 MachineInstr *MI, MachineBasicBlock *TailBB, MachineBasicBlock *PredBB, 391 unsigned SrcOpIdx = getPHISrcRegOpIdx(MI, PredBB); 402 AddSSAUpdateEntry(DefReg, NewDef, PredBB); 385 ProcessPHI( MachineInstr *MI, MachineBasicBlock *TailBB, MachineBasicBlock *PredBB, DenseMap<unsigned, unsigned> &LocalVRMap, SmallVectorImpl<std::pair<unsigned, unsigned> > &Copies, const DenseSet<unsigned> &RegsUsedByPhi, bool Remove) argument 416 DuplicateInstruction(MachineInstr *MI, MachineBasicBlock *TailBB, MachineBasicBlock *PredBB, MachineFunction &MF, DenseMap<unsigned, unsigned> &LocalVRMap, const DenseSet<unsigned> &UsedByPhi) argument 643 MachineBasicBlock *PredBB = *PI; local 671 MachineBasicBlock *PredBB = *PI; local 759 MachineBasicBlock *PredBB = *PI; local 925 MachineBasicBlock *PredBB = *PI; local [all...] |
H A D | BranchFolding.h | 97 MachineBasicBlock* PredBB); 107 MachineBasicBlock *PredBB); 109 MachineBasicBlock* PredBB); 110 bool CreateCommonTailOnlyBlock(MachineBasicBlock *&PredBB,
|
H A D | BranchFolding.cpp | 529 MachineBasicBlock *PredBB) { 539 if (MBB1 == PredBB || MBB2 == PredBB) { 541 unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I); 559 if (SuccBB && MBB1 != PredBB && MBB2 != PredBB && 595 MachineBasicBlock *PredBB) { 609 SuccBB, PredBB)) { 631 MachineBasicBlock *PredBB) { 638 if (SuccBB && CurMBB != PredBB) 522 ProfitableToMerge(MachineBasicBlock *MBB1, MachineBasicBlock *MBB2, unsigned minCommonTailLength, unsigned &CommonTailLen, MachineBasicBlock::iterator &I1, MachineBasicBlock::iterator &I2, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 592 ComputeSameTails(unsigned CurHash, unsigned minCommonTailLength, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 629 RemoveBlocksWithHash(unsigned CurHash, MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 650 CreateCommonTailOnlyBlock(MachineBasicBlock *&PredBB, MachineBasicBlock *SuccBB, unsigned maxCommonTailLength, unsigned &commonTailIndex) argument 710 TryTailMergeBlocks(MachineBasicBlock *SuccBB, MachineBasicBlock *PredBB) argument 872 MachineBasicBlock *PredBB = prior(I); local 1374 MachineBasicBlock *PredBB = *PI; local [all...] |
H A D | MachineSSAUpdater.cpp | 163 MachineBasicBlock *PredBB = *PI; local 164 unsigned PredVal = GetValueAtEndOfBlockInternal(PredBB); 165 PredValues.push_back(std::make_pair(PredBB, PredVal));
|
H A D | MachineBasicBlock.cpp | 902 MachineBasicBlock *PredBB = *PI; local 903 if (PredBB == NMBB) 905 if (!MDT->dominates(SucccDTNode, MDT->getNode(PredBB))) {
|
/freebsd-10-stable/contrib/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); 210 (!DT || DT->dominates(CastI->getParent(), PredBB))) 221 Value *GEPOp = PHITranslateSubExpr(GEP->getOperand(i), CurBB, PredBB, DT); 247 (!DT || DT->dominates(GEPI->getParent(), PredBB))) { 269 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT); 306 (!DT || DT->dominates(BO->getParent(), PredBB))) 321 /// PredBB. This returns true on failure and sets Addr to null. 322 bool PHITransAddr::PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB, argument 145 PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree *DT) argument 346 PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument 370 InsertPHITranslatedSubExpr(Value *InVal, BasicBlock *CurBB, BasicBlock *PredBB, const DominatorTree &DT, SmallVectorImpl<Instruction*> &NewInsts) argument [all...] |
H A D | LazyValueInfo.cpp | 396 /// edge from PredBB to OldSucc has been threaded to be from PredBB to 398 void threadEdge(BasicBlock *PredBB,BasicBlock *OldSucc,BasicBlock *NewSucc); 941 void LazyValueInfoCache::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, argument 1155 void LazyValueInfo::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, argument 1157 if (PImpl) getCache(PImpl).threadEdge(PredBB, OldSucc, NewSucc);
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/Scalar/ |
H A D | JumpThreading.cpp | 489 BasicBlock *PredBB = PN->getIncomingBlock(i); local 491 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB); 500 cast<Constant>(RHS), PredBB, BB); 507 Result.push_back(std::make_pair(KC, PredBB)); 895 BasicBlock *PredBB = *PI; local 898 if (!PredsScanned.insert(PredBB)) 902 BBIt = PredBB->end(); 904 Value *PredAvailable = FindAvailableLoadedValue(LoadedPtr, PredBB, BBIt, 6, 907 OneUnavailablePred = PredBB; 916 AvailablePreds.push_back(std::make_pair(PredBB, PredAvailabl 1195 BasicBlock *PredBB = PN->getIncomingBlock(i); local 1368 BasicBlock *PredBB; local 1512 BasicBlock *PredBB; local [all...] |
/freebsd-10-stable/contrib/llvm/lib/Target/XCore/ |
H A D | XCoreLowerThreadLocal.cpp | 141 BasicBlock *PredBB = PN->getIncomingBlock(I); local 142 if (PredBB->getTerminator()->getNumSuccessors() > 1) 143 PredBB = SplitEdge(PredBB, PN->getParent(), P); 144 Instruction *InsertPos = PredBB->getTerminator();
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/ObjCARC/ |
H A D | DependencyAnalysis.cpp | 230 BasicBlock *PredBB = *PI; local 231 if (Visited.insert(PredBB)) 232 Worklist.push_back(std::make_pair(PredBB, PredBB->end()));
|
/freebsd-10-stable/contrib/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 | BasicBlockUtils.cpp | 121 BasicBlock *PredBB = BB->getUniquePredecessor(); 122 if (!PredBB) return false; 125 if (PredBB == BB) return false; 127 if (isa<InvokeInst>(PredBB->getTerminator())) return false; 129 succ_iterator SI(succ_begin(PredBB)), SE(succ_end(PredBB)); 155 PredBB->getInstList().pop_back(); 159 BB->replaceAllUsesWith(PredBB); 162 PredBB->getInstList().splice(PredBB [all...] |
H A D | Local.cpp | 487 BasicBlock *PredBB = DestBB->getSinglePredecessor(); local 488 assert(PredBB && "Block doesn't have a single predecessor!"); 501 // Anything that branched to PredBB now branches to DestBB. 502 PredBB->replaceAllUsesWith(DestBB); 504 // Splice all the instructions from PredBB to DestBB. 505 PredBB->getTerminator()->eraseFromParent(); 506 DestBB->getInstList().splice(DestBB->begin(), PredBB->getInstList()); 511 BasicBlock *PredBBIDom = DT->getNode(PredBB)->getIDom()->getBlock(); 513 DT->eraseNode(PredBB); 517 PredBB 694 BasicBlock *PredBB = OldValPN->getIncomingBlock(i); local 707 BasicBlock *PredBB = BBPreds[i]; local [all...] |
H A D | SimplifyCFG.cpp | 1633 // Okay, we now know that all edges from PredBB should be revectored to 1635 BasicBlock *PredBB = PN->getIncomingBlock(i); local 1640 if (isa<IndirectBrInst>(PredBB->getTerminator())) continue; 1661 TranslateMap[PN] = PN->getIncomingValueForBlock(PredBB); 1688 // Loop over all of the edges from PredBB to BB, changing them to branch 1690 TerminatorInst *PredBBTI = PredBB->getTerminator(); 1693 BB->removePredecessor(PredBB);
|
/freebsd-10-stable/contrib/llvm/include/llvm/IR/ |
H A D | Value.h | 323 /// return the value in the PHI node corresponding to PredBB. If not, return 326 Value *DoPHITranslation(const BasicBlock *CurBB, const BasicBlock *PredBB); 329 const BasicBlock *PredBB) const{ 330 return const_cast<Value*>(this)->DoPHITranslation(CurBB, PredBB);
|
H A D | IRBuilder.h | 109 BasicBlock *PredBB = Phi->getIncomingBlock(U); local 110 assert(U != PredBB->getTerminator() && "critical edge not split"); 111 SetInsertPoint(PredBB, PredBB->getTerminator());
|
/freebsd-10-stable/contrib/llvm/lib/IR/ |
H A D | BasicBlock.cpp | 199 BasicBlock *PredBB = *PI; 202 if (*PI != PredBB) 207 return PredBB;
|
H A D | Value.cpp | 506 /// return the value in the PHI node corresponding to PredBB. If not, return 510 const BasicBlock *PredBB) { 513 return PN->getIncomingValueForBlock(PredBB); 509 DoPHITranslation(const BasicBlock *CurBB, const BasicBlock *PredBB) argument
|
/freebsd-10-stable/contrib/llvm/lib/Transforms/InstCombine/ |
H A D | InstructionCombining.cpp | 1538 BasicBlock *PredBB = FreeInstrBB->getSinglePredecessor(); local 1544 if (!PredBB) 1558 TerminatorInst *TI = PredBB->getTerminator();
|