| /external/llvm/lib/Transforms/Utils/ |
| BreakCriticalEdges.cpp | 148 BasicBlock *NewBB = BasicBlock::Create(TI->getContext(),
151 BranchInst *NewBI = BranchInst::Create(DestBB, NewBB);
155 TI->setSuccessor(SuccNum, NewBB);
160 F.getBasicBlockList().insert(++FBBI, NewBB);
163 // merge incoming values from NewBB instead of from TIBB.
167 // We no longer enter through TIBB, now we come in through NewBB.
169 // TIBB to come from NewBB.
179 PN->setIncomingBlock(BBIdx, NewBB);
193 // We found another edge to DestBB, go to NewBB instead.
194 TI->setSuccessor(i, NewBB);
[all...] |
| CloneFunction.cpp | 43 BasicBlock *NewBB = BasicBlock::Create(BB->getContext(), "", F);
44 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix);
54 NewBB->getInstList().push_back(NewInst);
72 return NewBB;
310 BasicBlock *NewBB;
311 BBEntry = NewBB = BasicBlock::Create(BB->getContext());
312 if (BB->hasName()) NewBB->setName(BB->getName()+NameSuffix);
326 VMap[OldBBAddr] = BlockAddress::get(NewFunc, NewBB);
338 Director->handleInstruction(VMap, &*II, NewBB);
381 NewBB->getInstList().push_back(NewInst)
[all...] |
| LoopUnrollRuntime.cpp | 166 BasicBlock *NewBB = CloneBasicBlock(*BB, VMap, ".prol", F);
167 NewBlocks.push_back(NewBB);
170 NewLoop->addBasicBlockToLoop(NewBB, *LI);
172 ParentLoop->addBasicBlockToLoop(NewBB, *LI);
174 VMap[*BB] = NewBB;
178 InsertTop->getTerminator()->setSuccessor(0, NewBB);
186 BranchInst *LatchBR = cast<BranchInst>(NewBB->getTerminator());
200 NewIdx->addIncoming(IdxSub, NewBB);
|
| BasicBlockUtils.cpp | 316 static void UpdateAnalysisInformation(BasicBlock *OldBB, BasicBlock *NewBB,
322 DT->splitBlock(NewBB);
383 InnermostPredLoop->addBasicBlockToLoop(NewBB, *LI);
385 L->addBasicBlockToLoop(NewBB, *LI);
387 L->moveToHeader(NewBB);
392 /// from NewBB. This also updates AliasAnalysis, if available.
393 static void UpdatePHINodes(BasicBlock *OrigBB, BasicBlock *NewBB,
396 // Otherwise, create a new PHI node in NewBB for each PHI node in OrigBB.
433 PN->addIncoming(InVal, NewBB);
439 // Create the new PHI node, insert it into NewBB at the end of the bloc
[all...] |
| CodeExtractor.cpp | 215 BasicBlock *NewBB = Header->splitBasicBlock(AfterPHIs,
222 Blocks.insert(NewBB);
223 Header = NewBB;
228 DT->splitBlock(NewBB);
235 // changing them to branch to NewBB instead.
239 TI->replaceUsesOfWith(OldPred, NewBB);
243 // just have to update the PHI nodes now, inserting PHI nodes into NewBB.
249 PN->getName() + ".ce", &NewBB->front());
|
| LoopSimplify.cpp | 80 static void placeSplitBlockCarefully(BasicBlock *NewBB,
83 // Check to see if NewBB is already well placed.
84 Function::iterator BBI = --NewBB->getIterator();
99 if (++BBI != NewBB->getParent()->end() && L->contains(&*BBI)) {
110 NewBB->moveAfter(FoundBB);
147 // Make sure that NewBB is put someplace intelligent, which doesn't mess up
284 BasicBlock *NewBB = SplitBlockPredecessors(Header, OuterLoopPreds, ".outer",
287 // Make sure that NewBB is put someplace intelligent, which doesn't mess up
289 placeSplitBlockCarefully(NewBB, OuterLoopPreds, L);
[all...] |
| LowerSwitch.cpp | 168 static void fixPhis(BasicBlock *SuccBB, BasicBlock *OrigBB, BasicBlock *NewBB,
180 PN->setIncomingBlock(Idx, NewBB);
|
| /external/llvm/include/llvm/CodeGen/ |
| MachineDominators.h | 47 MachineBasicBlock *NewBB;
56 /// Invariant: NewBBs == all the basic blocks contained in the NewBB
59 /// such as BB == elt.NewBB.
205 inline void splitBlock(MachineBasicBlock* NewBB) {
207 DT->splitBlock(NewBB);
222 /// split with NewBB.
235 MachineBasicBlock *NewBB) {
236 bool Inserted = NewBBs.insert(NewBB).second;
240 CriticalEdgesToSplit.push_back({FromBB, ToBB, NewBB});
|
| /external/llvm/lib/Target/AArch64/ |
| AArch64BranchRelaxation.cpp | 228 MachineBasicBlock *NewBB =
230 MF->insert(++OrigBB->getIterator(), NewBB);
232 // Splice the instructions starting with MI over to NewBB.
233 NewBB->splice(NewBB->end(), OrigBB, MI, OrigBB->end());
235 // Add an unconditional branch from OrigBB to NewBB.
239 BuildMI(OrigBB, DebugLoc(), TII->get(AArch64::B)).addMBB(NewBB);
242 BlockInfo.insert(BlockInfo.begin() + NewBB->getNumber(), BasicBlockInfo());
253 computeBlockSize(*NewBB);
260 return NewBB;
[all...] |
| AArch64PromoteConstant.cpp | 372 BasicBlock *NewBB = NewPt->getParent();
381 if (NewBB == CurBB) {
393 BasicBlock *CommonDominator = DT.findNearestCommonDominator(NewBB, CurBB);
398 if (CommonDominator != NewBB) {
405 // else, CommonDominator is the block of NewBB, hence NewBB is the last
|
| /external/llvm/lib/CodeGen/ |
| MachineDominators.cpp | 84 if (PredBB == Edge.NewBB)
115 // We know FromBB dominates NewBB.
116 MachineDomTreeNode *NewDTNode = DT->addNewBlock(Edge.NewBB, Edge.FromBB);
|
| ShrinkWrap.cpp | 454 MachineBasicBlock *NewBB;
459 NewBB = Save;
465 NewBB = Restore;
467 updateSaveRestorePoints(*NewBB, RS.get());
|
| StackProtector.cpp | 436 BasicBlock *NewBB = BB->splitBasicBlock(RI->getIterator(), "SP_return");
440 DT->addNewBlock(NewBB, BB);
449 NewBB->moveAfter(BB);
462 B.CreateCondBr(Cmp, NewBB, FailBB, Weights);
|
| ShadowStackGCLowering.cpp | 166 BasicBlock *NewBB = CallBB->splitBasicBlock(
171 NewBB->getInstList().remove(CI);
179 InvokeInst::Create(CI->getCalledValue(), NewBB, CleanupBB, Args,
|
| /external/llvm/lib/Target/NVPTX/ |
| NVPTXLowerAggrCopies.cpp | 67 BasicBlock *NewBB =
69 BasicBlock *LoopBB = BasicBlock::Create(Context, "loadstoreloop", &F, NewBB);
106 NewBB);
212 BasicBlock *NewBB =
214 BasicBlock *LoopBB = BasicBlock::Create(Context, "loadstoreloop", &F, NewBB);
238 NewBB);
|
| /external/llvm/lib/Target/Mips/ |
| MipsConstantIslandPass.cpp | 393 void updateForInsertedWaterBlock(MachineBasicBlock *NewBB);
852 (MachineBasicBlock *NewBB) {
854 NewBB->getParent()->RenumberBlocks(NewBB);
858 BBInfo.insert(BBInfo.begin() + NewBB->getNumber(), BasicBlockInfo());
863 std::lower_bound(WaterList.begin(), WaterList.end(), NewBB,
865 WaterList.insert(IP, NewBB);
880 MachineBasicBlock *NewBB =
883 MF->insert(MBBI, NewBB);
885 // Splice the instructions starting with MI over to NewBB
[all...] |
| /external/llvm/include/llvm/Support/ |
| GenericDomTree.h | 250 // NewBB is split and now it has one successor. Update dominator tree to
254 typename GraphT::NodeType *NewBB) {
255 assert(std::distance(GraphT::child_begin(NewBB),
256 GraphT::child_end(NewBB)) == 1 &&
257 "NewBB should have a single successor!");
258 typename GraphT::NodeType *NewBBSucc = *GraphT::child_begin(NewBB);
263 PI = InvTraits::child_begin(NewBB),
264 PE = InvTraits::child_end(NewBB);
276 if (ND != NewBB && !DT.dominates(NewBBSucc, ND) &&
283 // Find NewBB's immediate dominator and create new dominator tree node fo
[all...] |
| /external/llvm/lib/Target/ARM/ |
| ARMConstantIslandPass.cpp | 295 void updateForInsertedWaterBlock(MachineBasicBlock *NewBB);
[all...] |
| /external/llvm/lib/Transforms/Scalar/ |
| JumpThreading.cpp | 171 BasicBlock *NewBB, BasicBlock *SuccBB);
[all...] |
| PlaceSafepoints.cpp | 633 BasicBlock *NewBB = SplitEdge(Term->getParent(), Header, &DT);
634 PollsNeeded.push_back(NewBB->getTerminator());
[all...] |
| LoopUnswitch.cpp | [all...] |
| /external/llvm/include/llvm/Analysis/ |
| LoopInfo.h | 264 /// information. NewBB is set to be a new member of the current loop.
269 void addBasicBlockToLoop(BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LI);
712 auto *NewBB = NewLoc->getParent();
716 if (OldBB == NewBB)
720 auto *NewLoop = getLoopFor(NewBB);
743 if (UBB != NewBB && getLoopFor(UBB) != NewLoop)
762 // new use block won't simply be NewBB.
765 if (DefBlock != NewBB && getLoopFor(DefBlock) != NewLoop)
|
| LoopInfoImpl.h | 180 /// information. NewBB is set to be a new member of the current loop.
187 addBasicBlockToLoop(BlockT *NewBB, LoopInfoBase<BlockT, LoopT> &LIB) {
190 assert(NewBB && "Cannot add a null basic block to the loop!");
191 assert(!LIB[NewBB] && "BasicBlock already in the loop!");
196 LIB.BBMap[NewBB] = L;
200 L->addBlockEntry(NewBB);
|
| /external/llvm/include/llvm/Transforms/Utils/ |
| Cloning.h | 172 BasicBlock *NewBB) = 0;
|
| /external/llvm/lib/Transforms/Vectorize/ |
| LoopVectorize.cpp | [all...] |
