[WASM SIMD] Implement packing and unpacking integer conversions.

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/assembler-inl.h"
 #include "src/base/platform/elapsed-timer.h"
@@ skipping 3228 matching lines @@
       return graph()->NewNode(jsgraph()->machine()->F32x4Le(), inputs[1],
                               inputs[0]);
     case wasm::kExprI32x4Splat:
       return graph()->NewNode(jsgraph()->machine()->I32x4Splat(), inputs[0]);
     case wasm::kExprI32x4SConvertF32x4:
       return graph()->NewNode(jsgraph()->machine()->I32x4SConvertF32x4(),
                               inputs[0]);
     case wasm::kExprI32x4UConvertF32x4:
       return graph()->NewNode(jsgraph()->machine()->I32x4UConvertF32x4(),
                               inputs[0]);
+    case wasm::kExprI32x4SConvertI16x8Low:
+      return graph()->NewNode(jsgraph()->machine()->I32x4SConvertI16x8Low(),
+                              inputs[0]);
+    case wasm::kExprI32x4SConvertI16x8High:
+      return graph()->NewNode(jsgraph()->machine()->I32x4SConvertI16x8High(),
+                              inputs[0]);
     case wasm::kExprI32x4Neg:
       return graph()->NewNode(jsgraph()->machine()->I32x4Neg(), inputs[0]);
     case wasm::kExprI32x4Add:
       return graph()->NewNode(jsgraph()->machine()->I32x4Add(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4Sub:
       return graph()->NewNode(jsgraph()->machine()->I32x4Sub(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4Mul:
       return graph()->NewNode(jsgraph()->machine()->I32x4Mul(), inputs[0],
@@ skipping 15 matching lines @@
                               inputs[1]);
     case wasm::kExprI32x4LeS:
       return graph()->NewNode(jsgraph()->machine()->I32x4LeS(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4GtS:
       return graph()->NewNode(jsgraph()->machine()->I32x4LtS(), inputs[1],
                               inputs[0]);
     case wasm::kExprI32x4GeS:
       return graph()->NewNode(jsgraph()->machine()->I32x4LeS(), inputs[1],
                               inputs[0]);
+    case wasm::kExprI32x4UConvertI16x8Low:
+      return graph()->NewNode(jsgraph()->machine()->I32x4UConvertI16x8Low(),
+                              inputs[0]);
+    case wasm::kExprI32x4UConvertI16x8High:
+      return graph()->NewNode(jsgraph()->machine()->I32x4UConvertI16x8High(),
+                              inputs[0]);
     case wasm::kExprI32x4MinU:
       return graph()->NewNode(jsgraph()->machine()->I32x4MinU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4MaxU:
       return graph()->NewNode(jsgraph()->machine()->I32x4MaxU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4LtU:
       return graph()->NewNode(jsgraph()->machine()->I32x4LtU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4LeU:
       return graph()->NewNode(jsgraph()->machine()->I32x4LeU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI32x4GtU:
       return graph()->NewNode(jsgraph()->machine()->I32x4LtU(), inputs[1],
                               inputs[0]);
     case wasm::kExprI32x4GeU:
       return graph()->NewNode(jsgraph()->machine()->I32x4LeU(), inputs[1],
                               inputs[0]);
     case wasm::kExprI16x8Splat:
       return graph()->NewNode(jsgraph()->machine()->I16x8Splat(), inputs[0]);
+    case wasm::kExprI16x8SConvertI8x16Low:
+      return graph()->NewNode(jsgraph()->machine()->I16x8SConvertI8x16Low(),
+                              inputs[0]);
+    case wasm::kExprI16x8SConvertI8x16High:
+      return graph()->NewNode(jsgraph()->machine()->I16x8SConvertI8x16High(),
+                              inputs[0]);
     case wasm::kExprI16x8Neg:
       return graph()->NewNode(jsgraph()->machine()->I16x8Neg(), inputs[0]);
+    case wasm::kExprI16x8SConvertI32x4:
+      return graph()->NewNode(jsgraph()->machine()->I16x8SConvertI32x4(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI16x8Add:
       return graph()->NewNode(jsgraph()->machine()->I16x8Add(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8AddSaturateS:
       return graph()->NewNode(jsgraph()->machine()->I16x8AddSaturateS(),
                               inputs[0], inputs[1]);
     case wasm::kExprI16x8Sub:
       return graph()->NewNode(jsgraph()->machine()->I16x8Sub(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8SubSaturateS:
@@ skipping 19 matching lines @@
                               inputs[1]);
     case wasm::kExprI16x8LeS:
       return graph()->NewNode(jsgraph()->machine()->I16x8LeS(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8GtS:
       return graph()->NewNode(jsgraph()->machine()->I16x8LtS(), inputs[1],
                               inputs[0]);
     case wasm::kExprI16x8GeS:
       return graph()->NewNode(jsgraph()->machine()->I16x8LeS(), inputs[1],
                               inputs[0]);
+    case wasm::kExprI16x8UConvertI8x16Low:
+      return graph()->NewNode(jsgraph()->machine()->I16x8UConvertI8x16Low(),
+                              inputs[0]);
+    case wasm::kExprI16x8UConvertI8x16High:
+      return graph()->NewNode(jsgraph()->machine()->I16x8UConvertI8x16High(),
+                              inputs[0]);
+    case wasm::kExprI16x8UConvertI32x4:
+      return graph()->NewNode(jsgraph()->machine()->I16x8UConvertI32x4(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI16x8AddSaturateU:
       return graph()->NewNode(jsgraph()->machine()->I16x8AddSaturateU(),
                               inputs[0], inputs[1]);
     case wasm::kExprI16x8SubSaturateU:
       return graph()->NewNode(jsgraph()->machine()->I16x8SubSaturateU(),
                               inputs[0], inputs[1]);
     case wasm::kExprI16x8MinU:
       return graph()->NewNode(jsgraph()->machine()->I16x8MinU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8MaxU:
       return graph()->NewNode(jsgraph()->machine()->I16x8MaxU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8LtU:
       return graph()->NewNode(jsgraph()->machine()->I16x8LtU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8LeU:
       return graph()->NewNode(jsgraph()->machine()->I16x8LeU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI16x8GtU:
       return graph()->NewNode(jsgraph()->machine()->I16x8LtU(), inputs[1],
                               inputs[0]);
     case wasm::kExprI16x8GeU:
       return graph()->NewNode(jsgraph()->machine()->I16x8LeU(), inputs[1],
                               inputs[0]);
     case wasm::kExprI8x16Splat:
       return graph()->NewNode(jsgraph()->machine()->I8x16Splat(), inputs[0]);
     case wasm::kExprI8x16Neg:
       return graph()->NewNode(jsgraph()->machine()->I8x16Neg(), inputs[0]);
+    case wasm::kExprI8x16SConvertI16x8:
+      return graph()->NewNode(jsgraph()->machine()->I8x16SConvertI16x8(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI8x16Add:
       return graph()->NewNode(jsgraph()->machine()->I8x16Add(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16AddSaturateS:
       return graph()->NewNode(jsgraph()->machine()->I8x16AddSaturateS(),
                               inputs[0], inputs[1]);
     case wasm::kExprI8x16Sub:
       return graph()->NewNode(jsgraph()->machine()->I8x16Sub(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16SubSaturateS:
@@ skipping 19 matching lines @@
                               inputs[1]);
     case wasm::kExprI8x16LeS:
       return graph()->NewNode(jsgraph()->machine()->I8x16LeS(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16GtS:
       return graph()->NewNode(jsgraph()->machine()->I8x16LtS(), inputs[1],
                               inputs[0]);
     case wasm::kExprI8x16GeS:
       return graph()->NewNode(jsgraph()->machine()->I8x16LeS(), inputs[1],
                               inputs[0]);
+    case wasm::kExprI8x16UConvertI16x8:
+      return graph()->NewNode(jsgraph()->machine()->I8x16UConvertI16x8(),
+                              inputs[0], inputs[1]);
     case wasm::kExprI8x16AddSaturateU:
       return graph()->NewNode(jsgraph()->machine()->I8x16AddSaturateU(),
                               inputs[0], inputs[1]);
     case wasm::kExprI8x16SubSaturateU:
       return graph()->NewNode(jsgraph()->machine()->I8x16SubSaturateU(),
                               inputs[0], inputs[1]);
     case wasm::kExprI8x16MinU:
       return graph()->NewNode(jsgraph()->machine()->I8x16MinU(), inputs[0],
                               inputs[1]);
     case wasm::kExprI8x16MaxU:
@@ skipping 632 matching lines @@
     wasm::ModuleBytesEnv* module_env, const wasm::WasmFunction* function) {
   WasmCompilationUnit unit(isolate, module_env, function);
   unit.InitializeHandles();
   unit.ExecuteCompilation();
   return unit.FinishCompilation(thrower);
 }
 
 }  // namespace compiler
 }  // namespace internal
 }  // namespace v8