[Turbofan] Add more integer SIMD operations for ARM.

src/compiler/wasm-compiler.cc

 // 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.
 
 #include "src/compiler/wasm-compiler.h"
 
 #include <memory>
 
 #include "src/isolate-inl.h"
 
@@ skipping 3405 matching lines @@
                               inputs[1], inputs[0]);
     case wasm::kExprI32x4LeS:
       return graph()->NewNode(jsgraph()->machine()->Int32x4GreaterThanOrEqual(),
                               inputs[1], inputs[0]);
     case wasm::kExprI32x4GtS:
       return graph()->NewNode(jsgraph()->machine()->Int32x4GreaterThan(),
                               inputs[0], inputs[1]);
     case wasm::kExprI32x4GeS:
       return graph()->NewNode(jsgraph()->machine()->Int32x4GreaterThanOrEqual(),
                               inputs[0], inputs[1]);
+    case wasm::kExprI32x4MinU:
+      return graph()->NewNode(jsgraph()->machine()->Uint32x4Min(), inputs[0],
+                              inputs[1]);
+    case wasm::kExprI32x4MaxU:
+      return graph()->NewNode(jsgraph()->machine()->Uint32x4Max(), inputs[0],
+                              inputs[1]);
     case wasm::kExprI32x4LtU:
       return graph()->NewNode(jsgraph()->machine()->Uint32x4GreaterThan(),
                               inputs[1], inputs[0]);
     case wasm::kExprI32x4LeU:
       return graph()->NewNode(
           jsgraph()->machine()->Uint32x4GreaterThanOrEqual(), inputs[1],
           inputs[0]);
     case wasm::kExprI32x4GtU:
       return graph()->NewNode(jsgraph()->machine()->Uint32x4GreaterThan(),
                               inputs[0], inputs[1]);
     case wasm::kExprI32x4GeU:
       return graph()->NewNode(
           jsgraph()->machine()->Uint32x4GreaterThanOrEqual(), inputs[0],
           inputs[1]);
     case wasm::kExprS32x4Select:
       return graph()->NewNode(jsgraph()->machine()->Simd32x4Select(), inputs[0],
                               inputs[1], inputs[2]);
     case wasm::kExprI16x8Splat:
       return graph()->NewNode(jsgraph()->machine()->CreateInt16x8(), inputs[0],
                               inputs[0], inputs[0], inputs[0], inputs[0],
                               inputs[0], inputs[0], inputs[0]);
     case wasm::kExprI16x8Neg:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Neg(), inputs[0]);
     case wasm::kExprI16x8Add:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Add(), inputs[0],
                               inputs[1]);
+    case wasm::kExprI16x8AddSaturateS:
+      return graph()->NewNode(jsgraph()->machine()->Int16x8AddSaturate(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI16x8Sub:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Sub(), inputs[0],
                               inputs[1]);
+    case wasm::kExprI16x8SubSaturateS:
+      return graph()->NewNode(jsgraph()->machine()->Int16x8SubSaturate(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI16x8Mul:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Mul(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8MinS:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Min(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8MaxS:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Max(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8Eq:
       return graph()->NewNode(jsgraph()->machine()->Int16x8Equal(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8Ne:
       return graph()->NewNode(jsgraph()->machine()->Int16x8NotEqual(),
                               inputs[0], inputs[1]);
     case wasm::kExprI16x8LtS:
       return graph()->NewNode(jsgraph()->machine()->Int16x8GreaterThan(),
                               inputs[1], inputs[0]);
     case wasm::kExprI16x8LeS:
       return graph()->NewNode(jsgraph()->machine()->Int16x8GreaterThanOrEqual(),
                               inputs[1], inputs[0]);
     case wasm::kExprI16x8GtS:
       return graph()->NewNode(jsgraph()->machine()->Int16x8GreaterThan(),
                               inputs[0], inputs[1]);
     case wasm::kExprI16x8GeS:
       return graph()->NewNode(jsgraph()->machine()->Int16x8GreaterThanOrEqual(),
                               inputs[0], inputs[1]);
+    case wasm::kExprI16x8AddSaturateU:
+      return graph()->NewNode(jsgraph()->machine()->Uint16x8AddSaturate(),
+                              inputs[0], inputs[1]);
+    case wasm::kExprI16x8SubSaturateU:
+      return graph()->NewNode(jsgraph()->machine()->Uint16x8SubSaturate(),
+                              inputs[0], inputs[1]);
+    case wasm::kExprI16x8MinU:
+      return graph()->NewNode(jsgraph()->machine()->Uint16x8Min(), inputs[0],
+                              inputs[1]);
+    case wasm::kExprI16x8MaxU:
+      return graph()->NewNode(jsgraph()->machine()->Uint16x8Max(), inputs[0],
+                              inputs[1]);
     case wasm::kExprI16x8LtU:
       return graph()->NewNode(jsgraph()->machine()->Uint16x8GreaterThan(),
                               inputs[1], inputs[0]);
     case wasm::kExprI16x8LeU:
       return graph()->NewNode(
           jsgraph()->machine()->Uint16x8GreaterThanOrEqual(), inputs[1],
           inputs[0]);
     case wasm::kExprI16x8GtU:
       return graph()->NewNode(jsgraph()->machine()->Uint16x8GreaterThan(),
                               inputs[0], inputs[1]);
     case wasm::kExprI16x8GeU:
       return graph()->NewNode(
           jsgraph()->machine()->Uint16x8GreaterThanOrEqual(), inputs[0],
           inputs[1]);
     case wasm::kExprI8x16Splat:
       return graph()->NewNode(jsgraph()->machine()->CreateInt8x16(), inputs[0],
                               inputs[0], inputs[0], inputs[0], inputs[0],
                               inputs[0], inputs[0], inputs[0], inputs[0],
                               inputs[0], inputs[0], inputs[0], inputs[0],
                               inputs[0], inputs[0], inputs[0]);
     case wasm::kExprI8x16Neg:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Neg(), inputs[0]);
     case wasm::kExprI8x16Add:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Add(), inputs[0],
                               inputs[1]);
+    case wasm::kExprI8x16AddSaturateS:
+      return graph()->NewNode(jsgraph()->machine()->Int8x16AddSaturate(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI8x16Sub:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Sub(), inputs[0],
                               inputs[1]);
+    case wasm::kExprI8x16SubSaturateS:
+      return graph()->NewNode(jsgraph()->machine()->Int8x16SubSaturate(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI8x16Mul:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Mul(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16MinS:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Min(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16MaxS:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Max(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16Eq:
       return graph()->NewNode(jsgraph()->machine()->Int8x16Equal(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16Ne:
       return graph()->NewNode(jsgraph()->machine()->Int8x16NotEqual(),
                               inputs[0], inputs[1]);
     case wasm::kExprI8x16LtS:
       return graph()->NewNode(jsgraph()->machine()->Int8x16GreaterThan(),
                               inputs[1], inputs[0]);
     case wasm::kExprI8x16LeS:
       return graph()->NewNode(jsgraph()->machine()->Int8x16GreaterThanOrEqual(),
                               inputs[1], inputs[0]);
     case wasm::kExprI8x16GtS:
       return graph()->NewNode(jsgraph()->machine()->Int8x16GreaterThan(),
                               inputs[0], inputs[1]);
     case wasm::kExprI8x16GeS:
       return graph()->NewNode(jsgraph()->machine()->Int8x16GreaterThanOrEqual(),
                               inputs[0], inputs[1]);
+    case wasm::kExprI8x16AddSaturateU:
+      return graph()->NewNode(jsgraph()->machine()->Uint8x16AddSaturate(),
+                              inputs[0], inputs[1]);
+    case wasm::kExprI8x16SubSaturateU:
+      return graph()->NewNode(jsgraph()->machine()->Uint8x16SubSaturate(),
+                              inputs[0], inputs[1]);
+    case wasm::kExprI8x16MinU:
+      return graph()->NewNode(jsgraph()->machine()->Uint8x16Min(), inputs[0],
+                              inputs[1]);
+    case wasm::kExprI8x16MaxU:
+      return graph()->NewNode(jsgraph()->machine()->Uint8x16Max(), inputs[0],
+                              inputs[1]);
     case wasm::kExprI8x16LtU:
       return graph()->NewNode(jsgraph()->machine()->Uint8x16GreaterThan(),
                               inputs[1], inputs[0]);
     case wasm::kExprI8x16LeU:
       return graph()->NewNode(
           jsgraph()->machine()->Uint8x16GreaterThanOrEqual(), inputs[1],
           inputs[0]);
     case wasm::kExprI8x16GtU:
       return graph()->NewNode(jsgraph()->machine()->Uint8x16GreaterThan(),
                               inputs[0], inputs[1]);
@@ skipping 32 matching lines @@
       return graph()->NewNode(jsgraph()->machine()->Int8x16ExtractLane(lane),
                               inputs[0]);
     case wasm::kExprI8x16ReplaceLane:
       return graph()->NewNode(jsgraph()->machine()->Int8x16ReplaceLane(lane),
                               inputs[0], inputs[1]);
     default:
       return graph()->NewNode(UnsupportedOpcode(opcode), nullptr);
   }
 }
 
+Node* WasmGraphBuilder::SimdShiftOp(wasm::WasmOpcode opcode, uint8_t shift,
+                                    const NodeVector& inputs) {
+  has_simd_ = true;
+  switch (opcode) {
+    case wasm::kExprI32x4Shl:
+      return graph()->NewNode(
+          jsgraph()->machine()->Int32x4ShiftLeftByScalar(shift), inputs[0]);
+    case wasm::kExprI32x4ShrS:
+      return graph()->NewNode(
+          jsgraph()->machine()->Int32x4ShiftRightByScalar(shift), inputs[0]);
+    case wasm::kExprI32x4ShrU:
+      return graph()->NewNode(
+          jsgraph()->machine()->Uint32x4ShiftRightByScalar(shift), inputs[0]);
+    case wasm::kExprI16x8Shl:
+      return graph()->NewNode(
+          jsgraph()->machine()->Int16x8ShiftLeftByScalar(shift), inputs[0]);
+    case wasm::kExprI16x8ShrS:
+      return graph()->NewNode(
+          jsgraph()->machine()->Int16x8ShiftRightByScalar(shift), inputs[0]);
+    case wasm::kExprI16x8ShrU:
+      return graph()->NewNode(
+          jsgraph()->machine()->Uint16x8ShiftRightByScalar(shift), inputs[0]);
+    case wasm::kExprI8x16Shl:
+      return graph()->NewNode(
+          jsgraph()->machine()->Int8x16ShiftLeftByScalar(shift), inputs[0]);
+    case wasm::kExprI8x16ShrS:
+      return graph()->NewNode(
+          jsgraph()->machine()->Int8x16ShiftRightByScalar(shift), inputs[0]);
+    case wasm::kExprI8x16ShrU:
+      return graph()->NewNode(
+          jsgraph()->machine()->Uint8x16ShiftRightByScalar(shift), inputs[0]);
+    default:
+      return graph()->NewNode(UnsupportedOpcode(opcode), nullptr);
+  }
+}
+
 static void RecordFunctionCompilation(CodeEventListener::LogEventsAndTags tag,
                                       Isolate* isolate, Handle<Code> code,
                                       const char* message, uint32_t index,
                                       const wasm::WasmName& module_name,
                                       const wasm::WasmName& func_name) {
   DCHECK(isolate->logger()->is_logging_code_events() ||
          isolate->is_profiling());
 
   ScopedVector<char> buffer(128);
   SNPrintF(buffer, "%s#%d:%.*s:%.*s", message, index, module_name.length(),
@@ skipping 422 matching lines @@
                             function_->code_start_offset),
            compile_ms);
   }
 
   return code;
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8