HomeSort by: relevance | last modified time | path
    Searched refs:SplitBB (Results 1 - 11 of 11) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Target/AMDGPU/
SILateBranchLowering.cpp 89 MachineBasicBlock *SplitBB = MBB.splitAt(MI, /*UpdateLiveIns*/ true);
94 for (MachineBasicBlock *Succ : SplitBB->successors()) {
95 DTUpdates.push_back({DomTreeT::Insert, SplitBB, Succ});
98 DTUpdates.push_back({DomTreeT::Insert, &MBB, SplitBB});
SILowerControlFlow.cpp 471 MachineBasicBlock *SplitBB = &MBB;
473 SplitBB = MBB.splitAt(MI, /*UpdateLiveIns*/true, LIS);
492 return SplitBB;
584 MachineBasicBlock *SplitBB = &MBB;
604 SplitBB = emitEndCf(MI);
630 return SplitBB;
SIWholeQuadMode.cpp 739 MachineBasicBlock *SplitBB =
764 if (SplitBB != BB) {
768 for (MachineBasicBlock *Succ : SplitBB->successors()) {
769 DTUpdates.push_back({DomTreeT::Insert, SplitBB, Succ});
772 DTUpdates.push_back({DomTreeT::Insert, BB, SplitBB});
781 .addMBB(SplitBB);
785 return SplitBB;
SIISelLowering.cpp 3379 MachineBasicBlock *SplitBB = BB->splitAt(MI, false /*UpdateLiveIns*/);
3382 return SplitBB;
  /src/external/apache2/llvm/dist/llvm/include/llvm/Transforms/Utils/
PredicateInfo.h 146 // If true, SplitBB is the true successor, otherwise it's the false successor.
148 PredicateBranch(Value *Op, BasicBlock *BranchBB, BasicBlock *SplitBB,
150 : PredicateWithEdge(PT_Branch, Op, BranchBB, SplitBB, Condition),
BasicBlockUtils.h 184 /// of preds inside the loop, SplitBB is the new loop exit block, and DestBB is
185 /// the old loop exit, now the successor of SplitBB.
187 BasicBlock *SplitBB, BasicBlock *DestBB);
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Scalar/
CallSiteSplitting.cpp 239 /// Insert this sequence right before `SplitBB`'s terminator, which will be
241 static void copyMustTailReturn(BasicBlock *SplitBB, Instruction *CI,
243 bool IsVoid = SplitBB->getParent()->getReturnType()->isVoidTy();
253 Instruction *TI = SplitBB->getTerminator();
SimpleLoopUnswitch.cpp 740 auto *SplitBB =
742 rewritePHINodesForExitAndUnswitchedBlocks(*DefaultExitBB, *SplitBB,
745 DefaultExitBB = SplitExitBBMap[DefaultExitBB] = SplitBB;
995 /// after the split block (`SplitBB`) that will be used to select between the
1016 Loop &L, BasicBlock *LoopPH, BasicBlock *SplitBB,
2081 BasicBlock *SplitBB = L.getLoopPreheader();
2082 BasicBlock *LoopPH = SplitEdge(SplitBB, L.getHeader(), &DT, &LI, MSSAU);
2094 L, LoopPH, SplitBB, ExitBlocks, ParentBB, SuccBB, RetainedSuccBB,
2118 SplitBB->getTerminator()->eraseFromParent();
2122 SplitBB->getInstList().splice(SplitBB->end(), ParentBB->getInstList(), TI)
    [all...]
JumpThreading.cpp 2927 BasicBlock *SplitBB = SI->getParent();
2934 // NewBB and SplitBB are newly created blocks which require insertion.
2936 Updates.reserve((2 * SplitBB->getTerminator()->getNumSuccessors()) + 3);
2937 Updates.push_back({DominatorTree::Insert, BB, SplitBB});
2939 Updates.push_back({DominatorTree::Insert, NewBB, SplitBB});
2940 // BB's successors were moved to SplitBB, update DTU accordingly.
2941 for (auto *Succ : successors(SplitBB)) {
2943 Updates.push_back({DominatorTree::Insert, SplitBB, Succ});
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
MachineBasicBlock.cpp 1015 MachineBasicBlock *SplitBB = MF->CreateMachineBasicBlock(getBasicBlock());
1017 MF->insert(++MachineFunction::iterator(this), SplitBB);
1018 SplitBB->splice(SplitBB->begin(), this, SplitPoint, end());
1020 SplitBB->transferSuccessorsAndUpdatePHIs(this);
1021 addSuccessor(SplitBB);
1024 addLiveIns(*SplitBB, LiveRegs);
1027 LIS->insertMBBInMaps(SplitBB);
1029 return SplitBB;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
BasicBlockUtils.cpp 715 BasicBlock *SplitBB, BasicBlock *DestBB) {
716 // SplitBB shouldn't have anything non-trivial in it yet.
717 assert((SplitBB->getFirstNonPHI() == SplitBB->getTerminator() ||
718 SplitBB->isLandingPad()) &&
719 "SplitBB has non-PHI nodes!");
723 int Idx = PN.getBasicBlockIndex(SplitBB);
730 if (VP->getParent() == SplitBB)
736 SplitBB->isLandingPad() ? &SplitBB->front() : SplitBB->getTerminator())
    [all...]

Completed in 62 milliseconds