[turbofan] Further adapting machine graph verifier to code stubs.

src/code-stub-assembler.h

 // Copyright 2016 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.
 
 #ifndef V8_CODE_STUB_ASSEMBLER_H_
 #define V8_CODE_STUB_ASSEMBLER_H_
 
 #include <functional>
 
 #include "src/compiler/code-assembler.h"
@@ skipping 76 matching lines @@
   Node* UntagParameter(Node* value, ParameterMode mode) {
     if (mode != SMI_PARAMETERS) value = SmiUntag(value);
     return value;
   }
 
   Node* TagParameter(Node* value, ParameterMode mode) {
     if (mode != SMI_PARAMETERS) value = SmiTag(value);
     return value;
   }
 
+#define PARAMETER_BINARY_OPERATION(OpName, IntPtrOpName, SmiOpName, \
+                                   Int32OpName)                     \
+  Node* OpName(Node* value1, Node* value2, ParameterMode mode) {    \
+    if (mode == SMI_PARAMETERS) {                                   \
+      return SmiOpName(value1, value2);                             \
+    } else if (mode == INTPTR_PARAMETERS) {                         \
+      return IntPtrOpName(value1, value2);                          \
+    } else {                                                        \
+      DCHECK_EQ(INTEGER_PARAMETERS, mode);                          \
+      return Int32OpName(value1, value2);                           \
+    }                                                               \
+  }
+  PARAMETER_BINARY_OPERATION(IntPtrOrSmiAdd, IntPtrAdd, SmiAdd, Int32Add)
+  PARAMETER_BINARY_OPERATION(IntPtrOrSmiLessThan, IntPtrLessThan, SmiLessThan,
+                             Int32LessThan)
+  PARAMETER_BINARY_OPERATION(IntPtrOrSmiGreaterThan, IntPtrGreaterThan,
+                             SmiGreaterThan, Int32GreaterThan)
+  PARAMETER_BINARY_OPERATION(UintPtrOrSmiLessThan, UintPtrLessThan, SmiBelow,
+                             Uint32LessThan)
+
+#undef PARAMETER_BINARY_OPERATION
+
   Node* NoContextConstant();
 #define HEAP_CONSTANT_ACCESSOR(rootName, name) Node* name##Constant();
   HEAP_CONSTANT_LIST(HEAP_CONSTANT_ACCESSOR)
 #undef HEAP_CONSTANT_ACCESSOR
 
 #define HEAP_CONSTANT_TEST(rootName, name) Node* Is##name(Node* value);
   HEAP_CONSTANT_LIST(HEAP_CONSTANT_TEST)
 #undef HEAP_CONSTANT_TEST
 
   Node* HashSeed();
@@ skipping 28 matching lines @@
 
   // Smi operations.
   Node* SmiAdd(Node* a, Node* b);
   Node* SmiSub(Node* a, Node* b);
   Node* SmiEqual(Node* a, Node* b);
   Node* SmiAbove(Node* a, Node* b);
   Node* SmiAboveOrEqual(Node* a, Node* b);
   Node* SmiBelow(Node* a, Node* b);
   Node* SmiLessThan(Node* a, Node* b);
   Node* SmiLessThanOrEqual(Node* a, Node* b);
+  Node* SmiGreaterThan(Node* a, Node* b);
   Node* SmiMax(Node* a, Node* b);
   Node* SmiMin(Node* a, Node* b);
   // Computes a % b for Smi inputs a and b; result is not necessarily a Smi.
   Node* SmiMod(Node* a, Node* b);
   // Computes a * b for Smi inputs a and b; result is not necessarily a Smi.
   Node* SmiMul(Node* a, Node* b);
   Node* SmiOr(Node* a, Node* b) {
     return BitcastWordToTaggedSigned(
         WordOr(BitcastTaggedToWord(a), BitcastTaggedToWord(b)));
   }
@@ skipping 976 matching lines @@
   }
 #else
 #define CSA_SLOW_ASSERT(csa, x) ((void)0)
 #endif
 
 DEFINE_OPERATORS_FOR_FLAGS(CodeStubAssembler::AllocationFlags);
 
 }  // namespace internal
 }  // namespace v8
 #endif  // V8_CODE_STUB_ASSEMBLER_H_