| /freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | Interval.h | 54 I = I->getNextNode();
114 return Top == Elm->getNextNode() || Bottom == Elm->getPrevNode(); in touches()
122 return iterator(Bottom != nullptr ? Bottom->getNextNode() : nullptr, *this); in end()
128 return iterator(Bottom != nullptr ? Bottom->getNextNode() : nullptr, in end()
186 Result.emplace_back(Intersection.Bottom->getNextNode(), Bottom);
224 : I == Top ? Top->getNextNode()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/ |
| H A D | DependencyGraph.cpp | 109 I = I->getNextNode(); in getTopMemDGNode()
336 for (auto *N = ChainTopN->getNextNode(), *LastN = ChainTopN; N != nullptr; in createNewNodes()
337 LastN = N, N = N->getNextNode()) { in createNewNodes()
338 assert(N == LastN->getNextNode() && "Bad chain!"); in createNewNodes()
366 for (auto *NextI = IncludingN ? I : I->getNextNode(); NextI != nullptr; in getMemDGNodeAfter()
367 NextI = NextI->getNextNode()) { in getMemDGNodeAfter()
410 Interval<Instruction> BelowIntvl(I->getNextNode(), DAGInterval.bottom()); in notifyCreateInstr()
424 assert(!(To != BB->end() && &*To == I->getNextNode()) && in notifyMoveInstr()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/ADT/ |
| H A D | ilist_node.h | 359 NodeTy *getNextNode() { in getNextNode() function
364 return List.getNextNode(*static_cast<NodeTy *>(this)); in getNextNode()
368 const NodeTy *getNextNode() const { in getNextNode() function
369 return const_cast<ilist_node_with_parent *>(this)->getNextNode(); in getNextNode()
|
| H A D | ilist.h | 309 pointer getNextNode(reference N) const {
316 const_pointer getNextNode(const_reference N) const {
317 return getNextNode(const_cast<reference >(N));
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/ |
| H A D | LiveRangeShrink.cpp | 91 for (MachineInstr *I = Old->getNextNode(); M.find(I)->second == OrderNew; in FindDominatedInstruction()
92 I = I->getNextNode()) in FindDominatedInstruction()
231 I = I->getNextNode()) in runOnMachineFunction()
|
| H A D | AssignmentTrackingAnalysis.cpp | 1468 VarLocInsertPt getNextNode(const DbgRecord *DVR) { in getNextNode() function
1474 VarLocInsertPt getNextNode(const Instruction *Inst) { in getNextNode() function
1475 const Instruction *Next = Inst->getNextNode(); in getNextNode()
1480 VarLocInsertPt getNextNode(VarLocInsertPt InsertPt) { in getNextNode() function
1482 return getNextNode(cast<const Instruction *>(InsertPt)); in getNextNode()
1483 return getNextNode(cast<const DbgRecord *>(InsertPt)); in getNextNode()
1498 auto InsertBefore = getNextNode(After); in emitDbgValue()
1580 auto InsertBefore = getNextNode(&I); in processUnknownStoreToVariable()
1661 auto InsertBefore = getNextNode(&I); in processUntaggedInstruction()
1852 auto *R = InsertBeforeMap.find(getNextNode(&After)); in resetInsertionPoint()
[all …]
|
| H A D | SafeStack.cpp | 455 IRB.SetInsertPoint(I->getNextNode()); in createStackRestorePoints()
558 IRB.SetInsertPoint(BasePointer->getNextNode()); in moveStaticAllocasToUnsafeStack()
566 IRB.SetInsertPoint(BasePointer->getNextNode()); in moveStaticAllocasToUnsafeStack()
598 IRB.SetInsertPoint(cast<Instruction>(NewArg)->getNextNode()); in moveStaticAllocasToUnsafeStack()
653 IRB.SetInsertPoint(BasePointer->getNextNode()); in moveStaticAllocasToUnsafeStack()
|
| H A D | TailDuplicator.cpp | 784 MachineBasicBlock *NextBB = PredBB->getNextNode(); in duplicateSimpleBB()
947 PredBB->updateTerminator(TailBB->getNextNode()); in tailDuplicate()
1014 PrevBB->updateTerminator(TailBB->getNextNode()); in tailDuplicate()
|
| /freebsd/contrib/llvm-project/llvm/lib/SandboxIR/ |
| H A D | Tracker.cpp | 161 if (BotLLVMI->getNextNode() != nullptr) in EraseFromParent()
162 NextLLVMIOrBB = BotLLVMI->getNextNode(); in EraseFromParent()
202 if (auto *NextI = RemovedI->getNextNode()) in RemoveFromParent()
273 if (auto *NextI = MovedI->getNextNode()) in MoveInstr()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
| H A D | PartiallyInlineLibCalls.cpp | 60 IRBuilder<> Builder(Call->getNextNode()); in optimizeSQRT()
65 Builder.getTrue(), Call->getNextNode(), /*Unreachable=*/false, in optimizeSQRT()
|
| H A D | MergedLoadStoreMotion.cpp | 197 !isStoreSinkBarrierInRange(*Store1->getNextNode(), BB1->back(), Loc1) && in canSinkFromBlock()
198 !isStoreSinkBarrierInRange(*Store0->getNextNode(), BB0->back(), Loc0) && in canSinkFromBlock()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARM/ |
| H A D | ARMBlockPlacement.cpp | 101 assert(WLS->getNextNode() == &Preheader->back()); in revertWhileToDoLoop()
252 MachineBasicBlock *BBNext = BB->getNextNode(); in moveBasicBlock()
|
| H A D | ARMConstantIslandPass.cpp | 368 MI.getOperand(0).getMBB() == MBB.getNextNode()) in AlignBlocks()
2291 MachineInstr *Load = User.MI->getNextNode(); in optimizeThumb2JumpTables()
2307 if (registerDefinedBetween(BaseReg, Load->getNextNode(), MBB->end(), TRI)) in optimizeThumb2JumpTables()
2311 MachineInstr *Add = Load->getNextNode(); in optimizeThumb2JumpTables()
2319 if (registerDefinedBetween(IdxReg, Add->getNextNode(), MI, TRI)) in optimizeThumb2JumpTables()
2327 if (registerDefinedBetween(IdxReg, Load->getNextNode(), MI, TRI)) in optimizeThumb2JumpTables()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/X86/ |
| H A D | X86AvoidTrailingCall.cpp | 99 MachineBasicBlock *NextMBB = MBB.getNextNode(); in runOnMachineFunction()
|
| /freebsd/contrib/llvm-project/llvm/include/llvm/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.h | 217 return Instr.getNextNode() ? *Instr.getNextNode() in getPointImpl()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SystemZ/ |
| H A D | SystemZLDCleanup.cpp | 136 MachineInstr *Next = I->getNextNode(); in SetRegister()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/ |
| H A D | SPIRVPreLegalizer.cpp | 411 Def->getNextNode() ? Def->getNextNode()->getIterator() : MBB.end(); in setInsertPtAfterDef()
639 MachineInstr *NextMI = MI.getNextNode(); in generateAssignInstrs()
851 MIB.setInsertPt(*MI.getParent(), MI.getNextNode()); in insertSpirvDecorations()
1000 if (MachineInstr *Next = MI->getNextNode()) { in processBlockAddr()
1003 Next = MI->getNextNode(); in processBlockAddr()
|
| H A D | SPIRVISelLowering.cpp | 306 for (FunDef = FunDef->getNextNode(); in validateFunCallMachineDef()
309 FunDef = FunDef->getNextNode(), OpIdx++) { in validateFunCallMachineDef()
619 MachineIRBuilder MIB(*I.getNextNode()); in insertLogicalCopyOnResult()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/ |
| H A D | SIPreEmitPeephole.cpp | 304 FalseMBB = SrcMBB.getNextNode(); in getBlockDestinations()
373 TII->getBranchDestBlock(MI) != MBB.getNextNode()) in mustRetainExeczBranch()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/ARC/ |
| H A D | ARCOptAddrMode.cpp | 253 MachineInstr *Result = Ldst.getNextNode(); in tryToCombine()
259 Result = Result->getNextNode(); in tryToCombine()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Coroutines/ |
| H A D | SpillUtils.cpp | 579 Instruction *InsertPt = CoroBegin->getNextNode(); in sinkSpillUsesAfterCoroBegin()
621 InsertPt = I->getNextNode()->getIterator(); in getSpillInsertionPt()
|
| /freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
| H A D | CodeMoverUtils.cpp | 287 if (Instruction *NextInst = I.getNextNode()) in collectInstructionsInBetween()
324 if (I.getNextNode() == &InsertPoint) in isSafeToMoveBefore()
|
| H A D | CallPromotionUtils.cpp | 306 auto Next = OrigInst->getNextNode(); in versionCallSiteWithCond()
314 Next = BitCast->getNextNode(); in versionCallSiteWithCond()
|
| /freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/ |
| H A D | WebAssemblyLowerEmscriptenEHSjLj.cpp | 1310 BasicBlock *Tail = SplitBlock(BB, CI->getNextNode()); in runSjLjOnFunction()
1450 Tail = SplitBlock(BB, ThrewResetSI->getNextNode()); in handleLongjmpableCallsForEmscriptenSjLj()
1456 Tail = SplitBlock(BB, CI->getNextNode()); in handleLongjmpableCallsForEmscriptenSjLj()
1593 BasicBlock *OrigEntry = Entry->getNextNode(); in handleLongjmpableCallsForWasmSjLj()
1672 for (auto *BB = &*F.begin(); BB; BB = BB->getNextNode()) { in handleLongjmpableCallsForWasmSjLj()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/ |
| H A D | RegBankSelect.cpp | 416 const MachineInstr *Next = MI.getNextNode(); in tryAvoidingSplit()
883 assert((!Before || !Instr.getNextNode() || !Instr.getNextNode()->isPHI()) && in InstrInsertPoint()
|