[llvm] 24790a7 - [Hexagon] Use llvm::children (NFC)

[Kazu Hirata via llvm-commits]

Author: Kazu Hirata
Date: 2024-01-20T18:57:31-08:00
New Revision: 24790a778822e14abcb09c696bf5113c9a23bf81

URL: https://github.com/llvm/llvm-project/commit/24790a778822e14abcb09c696bf5113c9a23bf81
DIFF: https://github.com/llvm/llvm-project/commit/24790a778822e14abcb09c696bf5113c9a23bf81.diff

LOG: [Hexagon] Use llvm::children (NFC)

Added: 
    

Modified: 
    llvm/lib/Target/Hexagon/HexagonEarlyIfConv.cpp

Removed: 
    


################################################################################
diff  --git a/llvm/lib/Target/Hexagon/HexagonEarlyIfConv.cpp b/llvm/lib/Target/Hexagon/HexagonEarlyIfConv.cpp
index f7227dca3b6031..cb820e2158992d 100644
--- a/llvm/lib/Target/Hexagon/HexagonEarlyIfConv.cpp
+++ b/llvm/lib/Target/Hexagon/HexagonEarlyIfConv.cpp
@@ -601,8 +601,6 @@ bool HexagonEarlyIfConversion::visitBlock(MachineBasicBlock *B,
   // Visit all dominated blocks from the same loop first, then process B.
   MachineDomTreeNode *N = MDT->getNode(B);
 
-  using GTN = GraphTraits<MachineDomTreeNode *>;
-
   // We will change CFG/DT during this traversal, so take precautions to
   // avoid problems related to invalidated iterators. In fact, processing
   // a child C of B cannot cause another child to be removed, but it can
@@ -611,7 +609,7 @@ bool HexagonEarlyIfConversion::visitBlock(MachineBasicBlock *B,
   // prior to processing B, so there is no need to process it again.
   // Simply keep a list of children of B, and traverse that list.
   using DTNodeVectType = SmallVector<MachineDomTreeNode *, 4>;
-  DTNodeVectType Cn(GTN::child_begin(N), GTN::child_end(N));
+  DTNodeVectType Cn(llvm::children<MachineDomTreeNode *>(N));
   for (auto &I : Cn) {
     MachineBasicBlock *SB = I->getBlock();
     if (!Deleted.count(SB))