HomeSort by relevance Sort by last modified time
    Searched refs:PredBB (Results 1 - 21 of 21) sorted by null

  /external/llvm/include/llvm/Analysis/
PHITransAddr.h 71 /// PredBB. This returns true on failure and sets Addr to null.
72 bool PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB,
82 Value *PHITranslateWithInsertion(BasicBlock *CurBB, BasicBlock *PredBB,
93 Value *PHITranslateSubExpr(Value *V, BasicBlock *CurBB, BasicBlock *PredBB,
97 /// version of 'V' for the edge PredBB->CurBB into the end of the PredBB
102 BasicBlock *PredBB, const DominatorTree &DT,
LazyValueInfo.h 63 /// PredBB to OldSucc to be from PredBB to NewSucc instead.
64 void threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc, BasicBlock *NewSucc);
  /external/llvm/lib/CodeGen/
TailDuplication.cpp 83 MachineBasicBlock *PredBB,
90 MachineBasicBlock *PredBB,
148 MachineBasicBlock *PredBB = *PI;
152 if (PHIBB == PredBB) {
160 << PredBB->getNumber() << '\n';
372 /// ProcessPHI - Process PHI node in TailBB by turning it into a copy in PredBB.
373 /// Remember the source register that's contributed by PredBB and update SSA
377 MachineBasicBlock *PredBB,
383 unsigned SrcOpIdx = getPHISrcRegOpIdx(MI, PredBB);
394 AddSSAUpdateEntry(DefReg, NewDef, PredBB);
    [all...]
BranchFolding.h 97 MachineBasicBlock* PredBB);
106 MachineBasicBlock *PredBB);
108 MachineBasicBlock* PredBB);
109 bool CreateCommonTailOnlyBlock(MachineBasicBlock *&PredBB,
BranchFolding.cpp 522 MachineBasicBlock *PredBB) {
532 if (MBB1 == PredBB || MBB2 == PredBB) {
534 unsigned NumTerms = CountTerminators(MBB1 == PredBB ? MBB2 : MBB1, I);
552 if (SuccBB && MBB1 != PredBB && MBB2 != PredBB &&
587 MachineBasicBlock *PredBB) {
601 SuccBB, PredBB)) {
623 MachineBasicBlock *PredBB) {
630 if (SuccBB && CurMBB != PredBB)
    [all...]
MachineSSAUpdater.cpp 163 MachineBasicBlock *PredBB = *PI;
164 unsigned PredVal = GetValueAtEndOfBlockInternal(PredBB);
165 PredValues.push_back(std::make_pair(PredBB, PredVal));
StrongPHIElimination.cpp 669 MachineBasicBlock *PredBB = PHI->getOperand(i + 1).getMBB();
676 SlotIndex PredIndex = LI->getMBBEndIdx(PredBB);
686 = InsertedSrcCopyMap.find(std::make_pair(PredBB, PHIColor));
696 CopyInsertPoint = findPHICopyInsertPoint(PredBB, MBB, SrcReg);
698 MachineInstr *CopyInstr = BuildMI(*PredBB,
709 InsertedSrcCopySet.insert(std::make_pair(PredBB, SrcReg));
720 if (!InsertedSrcCopyMap.count(std::make_pair(PredBB, PHIColor)))
721 InsertedSrcCopyMap[std::make_pair(PredBB, PHIColor)] = CopyInstr;
    [all...]
MachineBasicBlock.cpp 604 MachineBasicBlock *PredBB = *PI;
605 if (PredBB == NMBB)
607 if (!MDT->dominates(SucccDTNode, MDT->getNode(PredBB))) {
  /external/llvm/lib/Analysis/
PHITransAddr.cpp 145 BasicBlock *PredBB,
170 return AddAsInput(PN->getIncomingValueForBlock(PredBB));
190 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);
246 (!DT || DT->dominates(GEPI->getParent(), PredBB))) {
268 Value *LHS = PHITranslateSubExpr(Inst->getOperand(0), CurBB, PredBB, DT);
305 (!DT || DT->dominates(BO->getParent(), PredBB)))
320 /// PredBB. This returns true on failure and sets Addr to null.
321 bool PHITransAddr::PHITranslateValue(BasicBlock *CurBB, BasicBlock *PredBB,
    [all...]
LazyValueInfo.cpp 431 /// edge from PredBB to OldSucc has been threaded to be from PredBB to
433 void threadEdge(BasicBlock *PredBB,BasicBlock *OldSucc,BasicBlock *NewSucc);
936 void LazyValueInfoCache::threadEdge(BasicBlock *PredBB, BasicBlock *OldSucc,
    [all...]
  /external/llvm/lib/Transforms/Scalar/
JumpThreading.cpp 473 BasicBlock *PredBB = PN->getIncomingBlock(i);
475 Value *RHS = Cmp->getOperand(1)->DoPHITranslation(BB, PredBB);
484 cast<Constant>(RHS), PredBB, BB);
491 Result.push_back(std::make_pair(KC, PredBB));
    [all...]
ObjCARC.cpp     [all...]
  /external/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp 120 BasicBlock *PredBB = BB->getUniquePredecessor();
121 if (!PredBB) return false;
124 if (PredBB == BB) return false;
126 if (isa<InvokeInst>(PredBB->getTerminator())) return false;
128 succ_iterator SI(succ_begin(PredBB)), SE(succ_end(PredBB));
154 PredBB->getInstList().pop_back();
158 BB->replaceAllUsesWith(PredBB);
161 PredBB->getInstList().splice(PredBB->end(), BB->getInstList())
    [all...]
SSAUpdater.cpp 131 BasicBlock *PredBB = SomePhi->getIncomingBlock(i);
132 Value *PredVal = GetValueAtEndOfBlock(PredBB);
133 PredValues.push_back(std::make_pair(PredBB, PredVal));
144 BasicBlock *PredBB = *PI;
145 Value *PredVal = GetValueAtEndOfBlock(PredBB);
146 PredValues.push_back(std::make_pair(PredBB, PredVal));
Local.cpp 436 BasicBlock *PredBB = DestBB->getSinglePredecessor();
437 assert(PredBB && "Block doesn't have a single predecessor!");
450 // Anything that branched to PredBB now branches to DestBB.
451 PredBB->replaceAllUsesWith(DestBB);
453 // Splice all the instructions from PredBB to DestBB.
454 PredBB->getTerminator()->eraseFromParent();
455 DestBB->getInstList().splice(DestBB->begin(), PredBB->getInstList());
460 BasicBlock *PredBBIDom = DT->getNode(PredBB)->getIDom()->getBlock();
462 DT->eraseNode(PredBB);
466 PI->replaceAllUses(PredBB, DestBB)
    [all...]
SimplifyCFG.cpp     [all...]
  /external/llvm/include/llvm/
Value.h 289 /// return the value in the PHI node corresponding to PredBB. If not, return
292 Value *DoPHITranslation(const BasicBlock *CurBB, const BasicBlock *PredBB);
295 const BasicBlock *PredBB) const{
296 return const_cast<Value*>(this)->DoPHITranslation(CurBB, PredBB);
  /external/llvm/lib/VMCore/
BasicBlock.cpp 199 BasicBlock *PredBB = *PI;
202 if (*PI != PredBB)
207 return PredBB;
Value.cpp 400 /// return the value in the PHI node corresponding to PredBB. If not, return
404 const BasicBlock *PredBB) {
407 return PN->getIncomingValueForBlock(PredBB);
Verifier.cpp     [all...]
  /external/llvm/include/llvm/Support/
IRBuilder.h 98 BasicBlock *PredBB = Phi->getIncomingBlock(U);
99 assert(U != PredBB->getTerminator() && "critical edge not split");
100 SetInsertPoint(PredBB, PredBB->getTerminator());
    [all...]

Completed in 2571 milliseconds