Delete references after Rat.

src/coreclr/jit/block.cpp

@@ -951,7 +951,7 @@ bool BasicBlock::isEmpty()
     }
     else
     {
-        for (GenTree* node : LIR::AsRange(this).NonPhiNodes())
+        for (GenTree* node : LIR::AsRange(this))
         {
             if (node->OperGet() != GT_IL_OFFSET)
             {

src/coreclr/jit/codegenlinear.cpp

@@ -403,7 +403,7 @@ void CodeGen::genCodeForBBlist()
         // Set the use-order numbers for each node.
         {
             int useNum = 0;
-            for (GenTree* node : LIR::AsRange(block).NonPhiNodes())
+            for (GenTree* node : LIR::AsRange(block))
             {
                 assert((node->gtDebugFlags & GTF_DEBUG_NODE_CG_CONSUMED) == 0);
 
@@ -422,7 +422,7 @@ void CodeGen::genCodeForBBlist()
 #endif // DEBUG
 
         IL_OFFSETX currentILOffset = BAD_IL_OFFSET;
-        for (GenTree* node : LIR::AsRange(block).NonPhiNodes())
+        for (GenTree* node : LIR::AsRange(block))
         {
             // Do we have a new IL offset?
             if (node->OperGet() == GT_IL_OFFSET)

src/coreclr/jit/decomposelongs.cpp

@@ -101,7 +101,7 @@ void DecomposeLongs::DecomposeRangeHelper()
 {
     assert(m_range != nullptr);
 
-    GenTree* node = Range().FirstNonPhiNode();
+    GenTree* node = Range().FirstNode();
     while (node != nullptr)
     {
         node = DecomposeNode(node);

src/coreclr/jit/fgopt.cpp

@@ -1659,25 +1659,12 @@ void Compiler::fgCompactBlocks(BasicBlock* block, BasicBlock* bNext)
         LIR::Range& nextRange  = LIR::AsRange(bNext);
 
         // Does the next block have any phis?
-        GenTree*           nextFirstNonPhi = nullptr;
-        LIR::ReadOnlyRange nextPhis        = nextRange.PhiNodes();
-        if (!nextPhis.IsEmpty())
-        {
-            GenTree* blockLastPhi = blockRange.LastPhiNode();
-            nextFirstNonPhi       = nextPhis.LastNode()->gtNext;
-
-            LIR::Range phisToMove = nextRange.Remove(std::move(nextPhis));
-            blockRange.InsertAfter(blockLastPhi, std::move(phisToMove));
-        }
-        else
-        {
-            nextFirstNonPhi = nextRange.FirstNode();
-        }
+        GenTree* nextNode = nextRange.FirstNode();
 
-        // Does the block have any other code?
-        if (nextFirstNonPhi != nullptr)
+        // Does the block have any code?
+        if (nextNode != nullptr)
         {
-            LIR::Range nextNodes = nextRange.Remove(nextFirstNonPhi, nextRange.LastNode());
+            LIR::Range nextNodes = nextRange.Remove(nextNode, nextRange.LastNode());
             blockRange.InsertAtEnd(std::move(nextNodes));
         }
     }

src/coreclr/jit/lclvars.cpp

@@ -4518,7 +4518,7 @@ void Compiler::lvaComputeRefCounts(bool isRecompute, bool setSlotNumbers)
             assert(isRecompute);
 
             const BasicBlock::weight_t weight = block->getBBWeight(this);
-            for (GenTree* node : LIR::AsRange(block).NonPhiNodes())
+            for (GenTree* node : LIR::AsRange(block))
             {
                 switch (node->OperGet())
                 {

src/coreclr/jit/lir.cpp

@@ -432,57 +432,17 @@ LIR::Range::Range(GenTree* firstNode, GenTree* lastNode) : ReadOnlyRange(firstNo
 }
 
 //------------------------------------------------------------------------
-// LIR::Range::LastPhiNode: Returns the last phi node in the range or
-//                          `nullptr` if no phis exist.
+// LIR::Range::FirstNonCatchArgNode: Returns the first node after all catch arg nodes in this range.
 //
-GenTree* LIR::Range::LastPhiNode() const
+GenTree* LIR::Range::FirstNonCatchArgNode() const
 {
-    GenTree* lastPhiNode = nullptr;
     for (GenTree* node : *this)
     {
-        if (!node->IsPhiNode())
-        {
-            break;
-        }
-
-        lastPhiNode = node;
-    }
-
-    return lastPhiNode;
-}
-
-//------------------------------------------------------------------------
-// LIR::Range::FirstNonPhiNode: Returns the first non-phi node in the
-//                              range or `nullptr` if no non-phi nodes
-//                              exist.
-//
-GenTree* LIR::Range::FirstNonPhiNode() const
-{
-    for (GenTree* node : *this)
-    {
-        if (!node->IsPhiNode())
-        {
-            return node;
-        }
-    }
-
-    return nullptr;
-}
-
-//------------------------------------------------------------------------
-// LIR::Range::FirstNonPhiOrCatchArgNode: Returns the first node after all
-//                                        phi or catch arg nodes in this
-//                                        range.
-//
-GenTree* LIR::Range::FirstNonPhiOrCatchArgNode() const
-{
-    for (GenTree* node : NonPhiNodes())
-    {
-        if (node->OperGet() == GT_CATCH_ARG)
+        if (node->OperIs(GT_CATCH_ARG))
         {
             continue;
         }
-        else if ((node->OperGet() == GT_STORE_LCL_VAR) && (node->gtGetOp1()->OperGet() == GT_CATCH_ARG))
+        else if ((node->OperIs(GT_STORE_LCL_VAR)) && (node->gtGetOp1()->OperIs(GT_CATCH_ARG)))
         {
             continue;
         }
@@ -493,35 +453,6 @@ GenTree* LIR::Range::FirstNonPhiOrCatchArgNode() const
     return nullptr;
 }
 
-//------------------------------------------------------------------------
-// LIR::Range::PhiNodes: Returns the range of phi nodes inside this range.
-//
-LIR::ReadOnlyRange LIR::Range::PhiNodes() const
-{
-    GenTree* lastPhiNode = LastPhiNode();
-    if (lastPhiNode == nullptr)
-    {
-        return ReadOnlyRange();
-    }
-
-    return ReadOnlyRange(m_firstNode, lastPhiNode);
-}
-
-//------------------------------------------------------------------------
-// LIR::Range::PhiNodes: Returns the range of non-phi nodes inside this
-//                       range.
-//
-LIR::ReadOnlyRange LIR::Range::NonPhiNodes() const
-{
-    GenTree* firstNonPhiNode = FirstNonPhiNode();
-    if (firstNonPhiNode == nullptr)
-    {
-        return ReadOnlyRange();
-    }
-
-    return ReadOnlyRange(firstNonPhiNode, m_lastNode);
-}
-
 //------------------------------------------------------------------------
 // LIR::Range::InsertBefore: Inserts a node before another node in this range.
 //

src/coreclr/jit/lir.h

@@ -92,15 +92,14 @@ class LIR final
     //     // View the block as a range
     //     LIR::Range& blockRange = LIR::AsRange(block);
     //
-    //     // Create a range from the first non-phi node in the block to the
-    //     // last node in the block
-    //     LIR::ReadOnlyRange nonPhis = blockRange.NonPhiNodes();
+    //     // Create a read only range from from it.
+    //     LIR::ReadOnlyRange readRange = blockRange;
     //
     //     // Remove the last node from the block
     //     blockRange.Remove(blockRange.LastNode());
     //
     // After the removal of the last node in the block, the last node of
-    // nonPhis is no longer linked to any of the other nodes in nonPhis. Due
+    // readRange is no longer linked to any of the other nodes in readRange. Due
     // to issues such as the above, some care must be taken in order to
     // ensure that ranges are not used once they have been invalidated.
     //
@@ -256,12 +255,7 @@ class LIR final
         Range();
         Range(Range&& other);
 
-        GenTree* LastPhiNode() const;
-        GenTree* FirstNonPhiNode() const;
-        GenTree* FirstNonPhiOrCatchArgNode() const;
-
-        ReadOnlyRange PhiNodes() const;
-        ReadOnlyRange NonPhiNodes() const;
+        GenTree* FirstNonCatchArgNode() const;
 
         void InsertBefore(GenTree* insertionPoint, GenTree* node);
         void InsertAfter(GenTree* insertionPoint, GenTree* node);

src/coreclr/jit/liveness.cpp

@@ -501,7 +501,7 @@ void Compiler::fgPerBlockLocalVarLiveness()
         compCurBB = block;
         if (block->IsLIR())
         {
-            for (GenTree* node : LIR::AsRange(block).NonPhiNodes())
+            for (GenTree* node : LIR::AsRange(block))
             {
                 fgPerNodeLocalVarLiveness(node);
             }
@@ -1873,14 +1873,13 @@ void Compiler::fgComputeLifeLIR(VARSET_TP& life, BasicBlock* block, VARSET_VALAR
 
     noway_assert(VarSetOps::IsSubset(this, keepAliveVars, life));
 
-    LIR::Range& blockRange      = LIR::AsRange(block);
-    GenTree*    firstNonPhiNode = blockRange.FirstNonPhiNode();
-    if (firstNonPhiNode == nullptr)
+    LIR::Range& blockRange = LIR::AsRange(block);
+    GenTree*    firstNode  = blockRange.FirstNode();
+    if (firstNode == nullptr)
     {
         return;
     }
-    for (GenTree *node = blockRange.LastNode(), *next = nullptr, *end = firstNonPhiNode->gtPrev; node != end;
-         node = next)
+    for (GenTree *node = blockRange.LastNode(), *next = nullptr, *end = firstNode->gtPrev; node != end; node = next)
     {
         next = node->gtPrev;
 

src/coreclr/jit/lower.cpp

@@ -4037,7 +4037,7 @@ void Lowering::InsertPInvokeMethodProlog()
     store->AsOp()->gtOp1 = call;
     store->gtFlags |= GTF_VAR_DEF;
 
-    GenTree* const insertionPoint = firstBlockRange.FirstNonPhiOrCatchArgNode();
+    GenTree* const insertionPoint = firstBlockRange.FirstNonCatchArgNode();
 
     comp->fgMorphTree(store);
     firstBlockRange.InsertBefore(insertionPoint, LIR::SeqTree(comp, store));

src/coreclr/jit/lsra.cpp

@@ -7803,7 +7803,7 @@ void LinearScan::handleOutgoingCriticalEdges(BasicBlock* block)
                 // so if we have only EH vars, we'll do that instead of splitting the edge.
                 if ((compiler->compHndBBtabCount > 0) && VarSetOps::IsSubset(compiler, edgeResolutionSet, exceptVars))
                 {
-                    GenTree*        insertionPoint = LIR::AsRange(succBlock).FirstNonPhiNode();
+                    GenTree*        insertionPoint = LIR::AsRange(succBlock).FirstNode();
                     VarSetOps::Iter edgeSetIter(compiler, edgeResolutionSet);
                     unsigned        edgeVarIndex = 0;
                     while (edgeSetIter.NextElem(&edgeVarIndex))
@@ -8178,7 +8178,7 @@ void LinearScan::resolveEdge(BasicBlock*      fromBlock,
     GenTree* insertionPoint = nullptr;
     if (resolveType == ResolveSplit || resolveType == ResolveCritical)
     {
-        insertionPoint = LIR::AsRange(block).FirstNonPhiNode();
+        insertionPoint = LIR::AsRange(block).FirstNode();
     }
 
     // If this is an edge between EH regions, we may have "extra" live-out EH vars.
@@ -9436,7 +9436,7 @@ void LinearScan::TupleStyleDump(LsraTupleDumpMode mode)
                    splitEdgeInfo.toBBNum);
         }
 
-        for (GenTree* node : LIR::AsRange(block).NonPhiNodes())
+        for (GenTree* node : LIR::AsRange(block))
         {
             GenTree* tree = node;
 
@@ -10358,7 +10358,7 @@ void LinearScan::verifyFinalAllocation()
                     bool foundNonResolutionNode = false;
 
                     LIR::Range& currentBlockRange = LIR::AsRange(currentBlock);
-                    for (GenTree* node : currentBlockRange.NonPhiNodes())
+                    for (GenTree* node : currentBlockRange)
                     {
                         if (IsResolutionNode(currentBlockRange, node))
                         {
@@ -10666,7 +10666,7 @@ void LinearScan::verifyFinalAllocation()
 
             // Verify the moves in this block
             LIR::Range& currentBlockRange = LIR::AsRange(currentBlock);
-            for (GenTree* node : currentBlockRange.NonPhiNodes())
+            for (GenTree* node : currentBlockRange)
             {
                 assert(IsResolutionNode(currentBlockRange, node));
                 if (IsResolutionMove(node))

src/coreclr/jit/lsrabuild.cpp

@@ -2334,7 +2334,7 @@ void LinearScan::buildIntervals()
         }
 
         LIR::Range& blockRange = LIR::AsRange(block);
-        for (GenTree* node : blockRange.NonPhiNodes())
+        for (GenTree* node : blockRange)
         {
             // We increment the location of each tree node by 2 so that the node definition, if any,
             // is at a new location and doesn't interfere with the uses.