Searched defs:DestBB (Results 1 - 9 of 9) sorted by relevance

/external/llvm/lib/Transforms/InstCombine/
H A DInstCombineLoadStoreAlloca.cpp574 BasicBlock *DestBB = StoreBB->getTerminator()->getSuccessor(0); local
578 pred_iterator PI = pred_begin(DestBB);
585 if (++PI == pred_end(DestBB))
594 if (++PI != pred_end(DestBB))
599 if (StoreBB == DestBB || OtherBB == DestBB)
667 MergedVal = InsertNewInstBefore(PN, DestBB->front());
672 BBI = DestBB->getFirstInsertionPt();
/external/llvm/lib/Transforms/Utils/
H A DBreakCriticalEdges.cpp123 /// is the new loop exit block, and DestBB is the old loop exit, now the
127 BasicBlock *DestBB) {
133 for (BasicBlock::iterator I = DestBB->begin();
178 BasicBlock *DestBB = TI->getSuccessor(SuccNum); local
182 if (DestBB->isLandingPad()) return 0;
186 TIBB->getName() + "." + DestBB->getName() + "_crit_edge");
188 BranchInst *NewBI = BranchInst::Create(DestBB, NewBB);
199 // If there are any PHI nodes in DestBB, we need to update them so that they
203 for (BasicBlock::iterator I = DestBB->begin(); isa<PHINode>(I); ++I) {
220 // If there are any other edges from TIBB to DestBB, updat
125 CreatePHIsForSplitLoopExit(SmallVectorImpl<BasicBlock *> &Preds, BasicBlock *SplitBB, BasicBlock *DestBB) argument
[all...]
H A DLocal.cpp429 /// MergeBasicBlockIntoOnlyPred - DestBB is a block with one predecessor and its
430 /// predecessor is known to have one successor (DestBB!). Eliminate the edge
431 /// between them, moving the instructions in the predecessor into DestBB and
434 void llvm::MergeBasicBlockIntoOnlyPred(BasicBlock *DestBB, Pass *P) { argument
436 while (PHINode *PN = dyn_cast<PHINode>(DestBB->begin())) {
444 BasicBlock *PredBB = DestBB->getSinglePredecessor();
447 // Zap anything that took the address of DestBB. Not doing this will give the
449 if (DestBB->hasAddressTaken()) {
450 BlockAddress *BA = BlockAddress::get(DestBB);
458 // Anything that branched to PredBB now branches to DestBB
[all...]
/external/llvm/lib/Analysis/
H A DProfileInfo.cpp312 /// Replaces all occurrences of RmBB in the ProfilingInfo with DestBB.
314 /// occurrences of RmBB with DestBB.
317 replaceAllUses(const BasicBlock *RmBB, const BasicBlock *DestBB) { argument
319 << " with " << DestBB->getName() << "\n");
320 const Function *F = DestBB->getParent();
332 if (e.second == DestBB) {
335 newedge = getEdge(DestBB, e.second);
340 if (e.first == DestBB) {
343 newedge = getEdge(e.first, DestBB);
352 Edge newedge = getEdge(DestBB, DestB
[all...]
/external/llvm/lib/Transforms/Scalar/
H A DCodeGenPrepare.cpp112 bool CanMergeBlocks(const BasicBlock *BB, const BasicBlock *DestBB) const;
227 BasicBlock *DestBB = BI->getSuccessor(0); local
228 if (DestBB == BB)
231 if (!CanMergeBlocks(BB, DestBB))
240 /// CanMergeBlocks - Return true if we can merge BB into DestBB if there is a
244 const BasicBlock *DestBB) const {
253 if (User->getParent() != DestBB || !isa<PHINode>(User))
255 // If User is inside DestBB block and it is a PHINode then check
258 if (User->getParent() == DestBB) {
270 // If BB and DestBB contai
314 BasicBlock *DestBB = BI->getSuccessor(0); local
316 DEBUG(dbgs() << "MERGING MOSTLY EMPTY BLOCKS - BEFORE:\\n" << *BB << *DestBB); local
[all...]
H A DJumpThreading.cpp1095 BasicBlock *DestBB; local
1097 DestBB = 0;
1099 DestBB = BI->getSuccessor(cast<ConstantInt>(Val)->isZero());
1101 DestBB = SI->findCaseValue(cast<ConstantInt>(Val)).getCaseSuccessor();
1105 DestBB = cast<BlockAddress>(Val)->getBasicBlock();
1110 OnlyDest = DestBB;
1111 else if (OnlyDest != DestBB)
1114 PredToDestList.push_back(std::make_pair(Pred, DestBB));
/external/llvm/lib/Bitcode/Reader/
H A DBitcodeReader.cpp2287 BasicBlock *DestBB = getBasicBlock(Record[1+3+i*2]); local
2288 if (CaseVal == 0 || DestBB == 0) {
2292 SI->addCase(CaseVal, DestBB);
2308 if (BasicBlock *DestBB = getBasicBlock(Record[2+i])) {
2309 IBI->addDestination(DestBB);
/external/llvm/lib/Target/ARM/
H A DARMConstantIslandPass.cpp1527 bool ARMConstantIslands::isBBInRange(MachineInstr *MI,MachineBasicBlock *DestBB, argument
1531 unsigned DestOffset = BBInfo[DestBB->getNumber()].Offset;
1533 DEBUG(dbgs() << "Branch of destination BB#" << DestBB->getNumber()
1554 MachineBasicBlock *DestBB = MI->getOperand(0).getMBB(); local
1556 // Check to see if the DestBB is already in-range.
1557 if (isBBInRange(MI, DestBB, Br.MaxDisp))
1595 MachineBasicBlock *DestBB = MI->getOperand(0).getMBB(); local
1630 BMI->getOperand(0).setMBB(DestBB);
1649 DEBUG(dbgs() << " Insert B to BB#" << DestBB->getNumber()
1660 BuildMI(MBB, DebugLoc(), TII->get(Br.UncondBr)).addMBB(DestBB)
1796 MachineBasicBlock *DestBB = Br.MI->getOperand(0).getMBB(); local
1826 MachineBasicBlock *DestBB = Br.MI->getOperand(0).getMBB(); local
[all...]
/external/llvm/lib/VMCore/
H A DInstructions.cpp3295 void IndirectBrInst::addDestination(BasicBlock *DestBB) { argument
3302 OperandList[OpNo] = DestBB;

Completed in 101 milliseconds