Rename Int32{UMod,UDiv} to Uint32{Div,Mod} and Int64{UMod,UDiv} to Uint64{Div,Mod}.

src/compiler/machine-operator-reducer.cc

 // Copyright 2014 the V8 project authors. All rights reserved.
 // Use of this source code is governed by a BSD-style license that can be
 // found in the LICENSE file.
 
 #include "src/compiler/machine-operator-reducer.h"
 
 #include "src/base/bits.h"
 #include "src/codegen.h"
 #include "src/compiler/generic-node-inl.h"
 #include "src/compiler/graph.h"
@@ skipping 228 matching lines @@
         return ReplaceInt32(m.left().Value() / m.right().Value());
       }
       if (m.right().Is(-1)) {  // x / -1 => 0 - x
         node->set_op(machine()->Int32Sub());
         node->ReplaceInput(0, Int32Constant(0));
         node->ReplaceInput(1, m.left().node());
         return Changed(node);
       }
       break;
     }
-    case IrOpcode::kInt32UDiv: {
+    case IrOpcode::kUint32Div: {
       Uint32BinopMatcher m(node);
       if (m.right().Is(1)) return Replace(m.left().node());  // x / 1 => x
       // TODO(turbofan): if (m.left().Is(0))
       // TODO(turbofan): if (m.right().Is(0))
       // TODO(turbofan): if (m.LeftEqualsRight())
       if (m.IsFoldable() && !m.right().Is(0)) {  // K / K => K
         return ReplaceInt32(m.left().Value() / m.right().Value());
       }
       if (m.right().IsPowerOf2()) {  // x / 2^n => x >> n
         node->set_op(machine()->Word32Shr());
         node->ReplaceInput(1, Int32Constant(WhichPowerOf2(m.right().Value())));
         return Changed(node);
       }
       break;
     }
     case IrOpcode::kInt32Mod: {
       Int32BinopMatcher m(node);
       if (m.right().Is(1)) return ReplaceInt32(0);   // x % 1  => 0
       if (m.right().Is(-1)) return ReplaceInt32(0);  // x % -1 => 0
       // TODO(turbofan): if (m.left().Is(0))
       // TODO(turbofan): if (m.right().IsPowerOf2())
       // TODO(turbofan): if (m.right().Is(0))
       // TODO(turbofan): if (m.LeftEqualsRight())
       if (m.IsFoldable() && !m.right().Is(0)) {  // K % K => K
         return ReplaceInt32(m.left().Value() % m.right().Value());
       }
       break;
     }
-    case IrOpcode::kInt32UMod: {
+    case IrOpcode::kUint32Mod: {
       Uint32BinopMatcher m(node);
       if (m.right().Is(1)) return ReplaceInt32(0);  // x % 1 => 0
       // TODO(turbofan): if (m.left().Is(0))
       // TODO(turbofan): if (m.right().Is(0))
       // TODO(turbofan): if (m.LeftEqualsRight())
       if (m.IsFoldable() && !m.right().Is(0)) {  // K % K => K
         return ReplaceInt32(m.left().Value() % m.right().Value());
       }
       if (m.right().IsPowerOf2()) {  // x % 2^n => x & 2^n-1
         node->set_op(machine()->Word32And());
@@ skipping 236 matching lines @@
 MachineOperatorBuilder* MachineOperatorReducer::machine() const {
   return jsgraph()->machine();
 }
 
 
 Graph* MachineOperatorReducer::graph() const { return jsgraph()->graph(); }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8