diff --git a/src/coreclr/jit/morph.cpp b/src/coreclr/jit/morph.cpp
index 20f6238a9f6a5..eb8511bcbb755 100644
--- a/src/coreclr/jit/morph.cpp
+++ b/src/coreclr/jit/morph.cpp
@@ -9108,11 +9108,10 @@ GenTree* Compiler::fgMorphSmpOp(GenTree* tree, MorphAddrContext* mac, bool* optA
 
         case GT_UMOD:
 
-#ifdef TARGET_ARMARCH
 //
 // Note for TARGET_ARMARCH we don't have  a remainder instruction, so we don't do this optimization
 //
-#else  // TARGET_XARCH
+#ifdef TARGET_X86
             // If this is an unsigned long mod with a constant divisor,
             // then don't morph to a helper call - it can be done faster inline using idiv.
 
@@ -9145,7 +9144,7 @@ GenTree* Compiler::fgMorphSmpOp(GenTree* tree, MorphAddrContext* mac, bool* optA
                     return tree;
                 }
             }
-#endif // TARGET_XARCH
+#endif // TARGET_X86
 
         ASSIGN_HELPER_FOR_MOD:
 
@@ -12433,7 +12432,8 @@ GenTree* Compiler::fgMorphModToSubMulDiv(GenTreeOp* tree)
 //
 GenTree* Compiler::fgMorphUModToAndSub(GenTreeOp* tree)
 {
-    JITDUMP("\nMorphing UMOD [%06u] to And/Sub\n", dspTreeID(tree));
+    JITDUMP("\nMorphing UMOD [%06u] to And/Sub (before)\n", dspTreeID(tree));
+    DISPTREE(tree);
 
     assert(tree->OperIs(GT_UMOD));
     assert(tree->gtOp2->IsIntegralConstUnsignedPow2());
@@ -12447,6 +12447,9 @@ GenTree* Compiler::fgMorphUModToAndSub(GenTreeOp* tree)
 
     DEBUG_DESTROY_NODE(tree->gtOp2);
     DEBUG_DESTROY_NODE(tree);
+    
+    JITDUMP("\nMorphing UMOD [%06u] to And/Sub (after)\n", dspTreeID(tree));
+    DISPTREE(newTree);
 
     return newTree;
 }