Home
last modified time | relevance | path

Searched refs:getPrevNode (Results 1 – 25 of 43) sorted by relevance

12

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DInterval.h64 I = I != nullptr ? I->getPrevNode() : R.bottom();
114 return Top == Elm->getNextNode() || Bottom == Elm->getPrevNode(); in touches()
183 Result.emplace_back(Top, Intersection.Top->getPrevNode());
227 : I == Bottom ? Bottom->getPrevNode()
H A DDependencyGraph.h269 MemDGNode *getPrevNode() const { return PrevMemN; } in getPrevNode() function
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/SandboxVectorizer/
H A DDependencyGraph.cpp122 I = I->getPrevNode(); in getBotMemDGNode()
339 assert(N->getPrevNode() == LastN && "Bad chain!"); in createNewNodes()
351 for (auto *PrevI = IncludingN ? I : I->getPrevNode(); PrevI != nullptr; in getMemDGNodeBefore()
352 PrevI = PrevI->getPrevNode()) { in getMemDGNodeBefore()
404 Interval<Instruction> AboveIntvl(DAGInterval.top(), I->getPrevNode()); in notifyCreateInstr()
568 auto SrcRange = Interval<MemDGNode>(DstRange.top(), DstN.getPrevNode()); in extend()
597 Interval<MemDGNode>(SrcRangeFull.top(), DstN.getPrevNode()); in extend()
H A DScheduler.cpp257 for (auto *I = LowestI, *E = TopI->getPrevNode(); I != E; in trimSchedule()
258 I = I->getPrevNode()) { in trimSchedule()
/freebsd/contrib/llvm-project/llvm/include/llvm/ADT/
H A Dilist_node.h345 NodeTy *getPrevNode() { in getPrevNode() function
350 return List.getPrevNode(*static_cast<NodeTy *>(this)); in getPrevNode()
354 const NodeTy *getPrevNode() const { in getPrevNode() function
355 return const_cast<ilist_node_with_parent *>(this)->getPrevNode(); in getPrevNode()
H A Dilist.h297 pointer getPrevNode(reference N) const {
304 const_pointer getPrevNode(const_reference N) const {
305 return getPrevNode(const_cast<reference >(N));
/freebsd/contrib/llvm-project/llvm/lib/Target/ARM/
H A DARMBlockPlacement.cpp163 if (!LoopExit->getPrevNode()) in fixBackwardsWLS()
250 MachineBasicBlock *BBPrevious = BB->getPrevNode(); in moveBasicBlock()
254 MachineBasicBlock *BeforePrev = Before->getPrevNode(); in moveBasicBlock()
/freebsd/contrib/llvm-project/llvm/lib/Target/NVPTX/
H A DNVPTXLowerUnreachable.cpp114 if (const auto *Call = dyn_cast_or_null<CallInst>(I.getPrevNode())) { in isLoweredToTrap()
/freebsd/contrib/llvm-project/llvm/lib/Target/X86/
H A DX86AvoidStoreForwardingBlocks.cpp500 MachineInstr *LastLoad = LoadInst->getPrevNode(); in updateKillStatus()
506 LastLoad = LoadInst->getPrevNode()->getPrevNode(); in updateKillStatus()
513 getBaseOperand(StInst->getPrevNode()).setIsKill(StoreBase.isKill()); in updateKillStatus()
H A DX86LoadValueInjectionLoadHardening.cpp738 Prev = MI->getPrevNode(); in insertFences()
750 : InsertionPt->getPrevNode(); in insertFences()
H A DX86FixupLEAs.cpp879 LLVM_DEBUG(MI.getPrevNode()->dump();); in processInstrForSlow3OpLEA()
/freebsd/contrib/llvm-project/llvm/lib/Analysis/
H A DCtxProfAnalysis.cpp597 for (auto *Prev = CB.getPrevNode(); Prev; Prev = Prev->getPrevNode()) { in getCallsiteInstrumentation()
618 while ((Prev = Prev->getPrevNode())) in getSelectInstrumentation()
H A DMustExecute.cpp678 bool IsFirst = !(PP->getPrevNode()); in getMustBeExecutedPrevInstruction()
695 const Instruction *PrevPP = PP->getPrevNode(); in getMustBeExecutedPrevInstruction()
/freebsd/contrib/llvm-project/llvm/lib/Target/WebAssembly/
H A DWebAssemblyCFGStackify.cpp308 MachineBasicBlock *LayoutPred = MBB.getPrevNode(); in placeBlockMarker()
336 auto *LoopBottom = BeginToEnd[&MI]->getParent()->getPrevNode(); in placeBlockMarker()
562 auto *LoopBottom = BeginToEnd[&MI]->getParent()->getPrevNode(); in placeTryMarker()
755 auto *LoopBottom = BeginToEnd[&MI]->getParent()->getPrevNode(); in placeTryTableMarker()
1034 MachineBasicBlock *EHPadLayoutPred = MBB.getPrevNode(); in removeUnnecessaryInstrs()
1372 MachineBasicBlock *TrampolineLayoutPred = TrampolineBB->getPrevNode(); in getTrampolineBlock()
2388 Worklist.push_back(MBB->getPrevNode()->rbegin()); in fixEndsAtEndOfFunction()
H A DWebAssemblyRegStackify.cpp592 for (auto *I = MI->getPrevNode(); I; I = I->getPrevNode()) in getPrevNonDebugInst()
/freebsd/contrib/llvm-project/llvm/lib/IR/
H A DBasicBlock.cpp263 const Instruction *Prev = RI->getPrevNode(); in getTerminatingMustTailCall()
274 Prev = BI->getPrevNode(); in getTerminatingMustTailCall()
294 if (auto *CI = dyn_cast_or_null<CallInst>(RI->getPrevNode())) in getTerminatingDeoptimizeCall()
H A DInstruction.cpp1248 for (const Instruction *I = getPrevNode(); I; I = I->getPrevNode()) in getPrevNonDebugInstruction()
/freebsd/contrib/llvm-project/llvm/lib/Target/SPIRV/
H A DSPIRVStructurizer.cpp248 dyn_cast<IntrinsicInst>(BB->getTerminator()->getPrevNode()); in replaceIfBranchTargets()
1097 if (isMergeInstruction(SplitInstruction->getPrevNode())) in addHeaderToRemainingDivergentDAG()
1098 SplitInstruction = SplitInstruction->getPrevNode(); in addHeaderToRemainingDivergentDAG()
/freebsd/contrib/llvm-project/llvm/lib/Target/AMDGPU/
H A DAMDGPUUnifyDivergentExitNodes.cpp216 auto *CI = dyn_cast_or_null<CallInst>(RI->getPrevNode()); in run()
H A DSIOptimizeExecMasking.cpp768 MachineInstr &PossibleOrSaveexec = *MI.getPrevNode(); in tryRecordOrSaveexecXorSequence()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/GlobalISel/
H A DRegBankSelect.cpp915 return Instr.getPrevNode() && Instr.getPrevNode()->isTerminator(); in isSplit()
/freebsd/contrib/llvm-project/llvm/include/llvm/IR/
H A DDebugProgramInstruction.h200 DbgRecord *getPrevNode() { return &*std::prev(getIterator()); } in getPrevNode() function
/freebsd/contrib/llvm-project/llvm/lib/Transforms/IPO/
H A DHotColdSplitting.cpp154 dyn_cast_or_null<CallInst>(BB.getTerminator()->getPrevNode())) in unlikelyExecuted()
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DFixupStatepointCallerSaved.cpp441 MachineInstr *Reload = It->getPrevNode(); in insertReloadBefore()
/freebsd/contrib/llvm-project/llvm/lib/FuzzMutate/
H A DIRMutator.cpp127 if (IntrinsicInst *II = dyn_cast<IntrinsicInst>(UI->getPrevNode())) { in getEffectiveTerminator()

12