Home
last modified time | relevance | path

Searched refs:VPBlockBase (Results 1 – 7 of 7) sorted by relevance

/freebsd/contrib/llvm-project/llvm/lib/Transforms/Vectorize/
H A DVPlanCFG.h129 using NodeRef = VPBlockBase *;
147 using NodeRef = const VPBlockBase *;
175 using NodeRef = VPBlockBase *;
193 using NodeRef = const VPBlockBase *;
214 vp_depth_first_shallow(VPBlockBase *G) {
226 vp_depth_first_deep(VPBlockBase *G) {
231 vp_depth_first_deep(const VPBlockBase *G) {
242 using NodeRef = VPBlockBase *;
257 using NodeRef = const VPBlockBase *;
275 using NodeRef = VPBlockBase *;
[all …]
H A DVPlan.cpp152 const VPBlockBase *Block = this; in getEntryBasicBlock()
159 VPBlockBase *Block = this; in getEntryBasicBlock()
174 const VPBlockBase *Block = this; in getExitingBasicBlock()
181 VPBlockBase *Block = this; in getExitingBasicBlock()
187 VPBlockBase *VPBlockBase::getEnclosingBlockWithSuccessors() { in getEnclosingBlockWithSuccessors()
195 VPBlockBase *VPBlockBase::getEnclosingBlockWithPredecessors() { in getEnclosingBlockWithPredecessors()
203 void VPBlockBase::deleteCFG(VPBlockBase *Entry) { in deleteCFG()
517 for (VPBlockBase *Succ : Succs) in splitAt()
525 for (VPBlockBase *Succ : Succs) in splitAt()
701 VPBlockBase::deleteCFG(Entry); in ~VPlan()
[all …]
H A DVPlanDominatorTree.h26 template <> struct DomTreeNodeTraits<VPBlockBase> {
27 using NodeType = VPBlockBase;
28 using NodePtr = VPBlockBase *;
38 using VPDominatorTree = DomTreeBase<VPBlockBase>;
40 using VPDomTreeNode = DomTreeNodeBase<VPBlockBase>;
H A DVPlanVerifier.cpp33 static bool hasDuplicates(const SmallVectorImpl<VPBlockBase *> &VPBlockVec) { in hasDuplicates()
34 SmallDenseSet<const VPBlockBase *, 8> VPBlockSet; in hasDuplicates()
48 for (const VPBlockBase *VPB : vp_depth_first_shallow(Region->getEntry())) { in verifyBlocksInRegion()
68 for (const VPBlockBase *Succ : Successors) { in verifyBlocksInRegion()
83 for (const VPBlockBase *Pred : Predecessors) { in verifyBlocksInRegion()
99 const VPBlockBase *Entry = Region->getEntry(); in verifyRegion()
100 const VPBlockBase *Exiting = Region->getExiting(); in verifyRegion()
118 for (const VPBlockBase *VPB : make_range( in verifyRegionRec()
119 df_iterator<const VPBlockBase *>::begin(Region->getEntry()), in verifyRegionRec()
120 df_iterator<const VPBlockBase *>::end(Region->getExiting()))) { in verifyRegionRec()
H A DVPlan.h422 class VPBlockBase {
599 void setTwoSuccessors(VPBlockBase *IfTrue, VPBlockBase *IfFalse) { in setTwoSuccessors()
2545 VPBlockBase *Entry;
2549 VPBlockBase *Exiting;
2556 VPRegionBlock(VPBlockBase *Entry, VPBlockBase *Exiting,
2934 void drawEdge(const VPBlockBase *From, const VPBlockBase *To, bool Hidden,
2977 static void insertBlockAfter(VPBlockBase *NewBlock, VPBlockBase *BlockPtr) { in insertBlockAfter()
2996 static void insertTwoBlocksAfter(VPBlockBase *IfTrue, VPBlockBase *IfFalse, in insertTwoBlocksAfter()
3013 static void connectBlocks(VPBlockBase *From, VPBlockBase *To) { in connectBlocks()
3024 static void disconnectBlocks(VPBlockBase *From, VPBlockBase *To) { in disconnectBlocks()
[all …]
H A DVPlanTransforms.cpp37 ReversePostOrderTraversal<VPBlockDeepTraversalWrapper<VPBlockBase *>> RPOT( in VPInstructionsToVPRecipes()
283 for (VPBlockBase *Pred : make_early_inc_range(Region1->getPredecessors())) { in mergeReplicateRegionsIntoSuccessors()
352 VPBlockBase *Region = createReplicateRegion(RepR, Plan); in addReplicateRegions()
466 ReversePostOrderTraversal<VPBlockDeepTraversalWrapper<VPBlockBase *>> RPOT( in removeDeadRecipes()
636 const VPBlockBase *ParentA = A->getParent(); in properlyDominates()
637 const VPBlockBase *ParentB = B->getParent(); in properlyDominates()
868 ReversePostOrderTraversal<VPBlockDeepTraversalWrapper<VPBlockBase *>> RPOT( in simplifyRecipes()
H A DVPlanHCFGBuilder.cpp105 SmallVector<VPBlockBase *, 2> VPBBPreds; in setVPBBPredsFromBB()
398 : static_cast<VPBlockBase *>(Successor)); in buildPlainCFG()