Home
last modified time | relevance | path

Searched refs:NewTop (Results 1 – 4 of 4) sorted by relevance

/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Vectorize/SandboxVectorizer/
H A DInterval.h206 auto *NewTop = Top->comesBefore(Other.Top) ? Top : Other.Top; in getUnionInterval() local
208 return {NewTop, NewBottom}; in getUnionInterval()
223 T *NewTop = Top->getIterator() == BeforeIt ? I variable
229 Top = NewTop;
/freebsd/contrib/llvm-project/llvm/lib/CodeGen/
H A DMachineBlockPlacement.cpp554 BlockFrequency FallThroughGains(const MachineBasicBlock *NewTop,
2080 const MachineBasicBlock *NewTop, const MachineBasicBlock *OldTop, in FallThroughGains() argument
2086 MBFI->getBlockFreq(NewTop) * MBPI->getEdgeProbability(NewTop, ExitBB); in FallThroughGains()
2088 MBFI->getBlockFreq(NewTop) * MBPI->getEdgeProbability(NewTop, OldTop); in FallThroughGains()
2093 for (MachineBasicBlock *Pred : NewTop->predecessors()) { in FallThroughGains()
2099 MBFI->getBlockFreq(Pred) * MBPI->getEdgeProbability(Pred, NewTop); in FallThroughGains()
2112 if ((Succ == NewTop) || (Succ == BestPred) || !LoopBlockSet.count(Succ)) in FallThroughGains()
2126 MBPI->getEdgeProbability(BestPred, NewTop); in FallThroughGains()
2249 MachineBasicBlock *NewTop = L.getHeader(); in findBestLoopTop() local
2250 while (NewTop != OldTop) { in findBestLoopTop()
[all …]
H A DSafeStack.cpp687 Value *NewTop = IRB.CreateIntToPtr( in moveDynamicAllocasToUnsafeStack() local
693 IRB.CreateStore(NewTop, UnsafeStackPtr); in moveDynamicAllocasToUnsafeStack()
695 IRB.CreateStore(NewTop, DynamicTop); in moveDynamicAllocasToUnsafeStack()
697 Value *NewAI = IRB.CreatePointerCast(NewTop, AI->getType()); in moveDynamicAllocasToUnsafeStack()
/freebsd/contrib/llvm-project/llvm/lib/Target/Hexagon/
H A DHexagonISelDAGToDAGHVX.cpp691 unsigned reset(unsigned NewTop) { in reset()
692 List.resize(NewTop+1); in reset()
693 return NewTop; in reset()