Fix x64 regression during ia32 lea port

test/unittests/compiler/node-matchers-unittest.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/common-operator.h"
 #include "src/compiler/graph.h"
 #include "src/compiler/machine-operator.h"
 #include "src/compiler/node.h"
 #include "src/compiler/node-matchers.h"
 #include "src/compiler/opcodes.h"
@@ skipping 372 matching lines @@
   USE(d7);
   const Operator* d8_op = common()->Int64Constant(8);
   Node* d8 = graph()->NewNode(d8_op);
   USE(d8);
   const Operator* d9_op = common()->Int64Constant(9);
   Node* d9 = graph()->NewNode(d9_op);
   USE(d8);
   const Operator* d15_op = common()->Int64Constant(15);
   Node* d15 = graph()->NewNode(d15_op);
   USE(d15);
+  const Operator* d15_32_op = common()->Int32Constant(15);
+  Node* d15_32 = graph()->NewNode(d15_32_op);
+  USE(d15_32);
 
   const Operator* b0_op = common()->Parameter(0);
   Node* b0 = graph()->NewNode(b0_op, graph()->start());
   USE(b0);
   const Operator* b1_op = common()->Parameter(1);
   Node* b1 = graph()->NewNode(b1_op, graph()->start());
   USE(b0);
 
   const Operator* p1_op = common()->Parameter(3);
   Node* p1 = graph()->NewNode(p1_op, graph()->start());
@@ skipping 41 matching lines @@
   // 2 INPUT
 
   // (B0 + B1) -> [B0, 0, B1, NULL]
   BaseWithIndexAndDisplacement64Matcher match1(graph()->NewNode(a_op, b0, b1));
   CheckBaseWithIndexAndDisplacement(&match1, b1, 0, b0, NULL);
 
   // (B0 + D15) -> [NULL, 0, B0, D15]
   BaseWithIndexAndDisplacement64Matcher match2(graph()->NewNode(a_op, b0, d15));
   CheckBaseWithIndexAndDisplacement(&match2, NULL, 0, b0, d15);
 
+  BaseWithIndexAndDisplacement64Matcher match2_32(
+      graph()->NewNode(a_op, b0, d15_32));
+  CheckBaseWithIndexAndDisplacement(&match2_32, NULL, 0, b0, d15_32);
+
   // (D15 + B0) -> [NULL, 0, B0, D15]
   BaseWithIndexAndDisplacement64Matcher match3(graph()->NewNode(a_op, d15, b0));
   CheckBaseWithIndexAndDisplacement(&match3, NULL, 0, b0, d15);
 
   // (B0 + M1) -> [p1, 0, B0, NULL]
   BaseWithIndexAndDisplacement64Matcher match4(graph()->NewNode(a_op, b0, m1));
   CheckBaseWithIndexAndDisplacement(&match4, p1, 0, b0, NULL);
 
   // (M1 + B0) -> [p1, 0, B0, NULL]
   m1 = graph()->NewNode(m_op, p1, d1);
@@ skipping 253 matching lines @@
   temp = graph()->NewNode(a_op, b0, d15);
   BaseWithIndexAndDisplacement64Matcher match50(
       graph()->NewNode(a_op, m3, temp));
   CheckBaseWithIndexAndDisplacement(&match50, m3, 0, b0, d15);
 }
 
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8