[turbofan] Byte and word memory operands in x64 cmp/test. Fixes arithmetic_op_8 in assembler-x64.cc

src/compiler/code-stub-assembler.h

 // Copyright 2015 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_COMPILER_CODE_STUB_ASSEMBLER_H_
 #define V8_COMPILER_CODE_STUB_ASSEMBLER_H_
 
 #include <map>
 
 // Clients of this interface shouldn't depend on lots of compiler internals.
@@ skipping 37 matching lines @@
   V(Float64GreaterThanOrEqual)                \
   V(IntPtrAdd)                                \
   V(IntPtrSub)                                \
   V(Int32Add)                                 \
   V(Int32Sub)                                 \
   V(Int32Mul)                                 \
   V(Int32GreaterThan)                         \
   V(Int32GreaterThanOrEqual)                  \
   V(Int32LessThan)                            \
   V(Int32LessThanOrEqual)                     \
+  V(Uint32LessThan)                           \
   V(WordEqual)                                \
   V(WordNotEqual)                             \
   V(WordOr)                                   \
   V(WordAnd)                                  \
   V(WordXor)                                  \
   V(WordShl)                                  \
   V(WordShr)                                  \
   V(WordSar)                                  \
   V(WordRor)                                  \
   V(Word32Equal)                              \
@@ skipping 233 matching lines @@
   // Returns a node that is true if the given bit is set in |word32|.
   template <typename T>
   Node* BitFieldDecode(Node* word32) {
     return BitFieldDecode(word32, T::kShift, T::kMask);
   }
 
   Node* BitFieldDecode(Node* word32, uint32_t shift, uint32_t mask);
 
   // Branching helpers.
   // TODO(danno): Can we be more cleverish wrt. edge-split?
+  void BranchIf(Node* condition, Label* if_true, Label* if_false);
   void BranchIfInt32LessThan(Node* a, Node* b, Label* if_true, Label* if_false);
   void BranchIfSmiLessThan(Node* a, Node* b, Label* if_true, Label* if_false);
   void BranchIfSmiLessThanOrEqual(Node* a, Node* b, Label* if_true,
                                   Label* if_false);
   void BranchIfFloat64Equal(Node* a, Node* b, Label* if_true, Label* if_false);
   void BranchIfFloat64LessThan(Node* a, Node* b, Label* if_true,
                                Label* if_false);
   void BranchIfFloat64LessThanOrEqual(Node* a, Node* b, Label* if_true,
                                       Label* if_false);
   void BranchIfFloat64GreaterThan(Node* a, Node* b, Label* if_true,
@@ skipping 81 matching lines @@
   // Map of variables to the list of value nodes that have been added from each
   // merge path in their order of merging.
   std::map<Variable::Impl*, std::vector<Node*>> variable_merges_;
 };
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8
 
 #endif  // V8_COMPILER_CODE_STUB_ASSEMBLER_H_