ARM64: Add NEON support

test/cctest/test-utils-arm64.cc

 // Copyright 2013 the V8 project authors. All rights reserved.
 // Redistribution and use in source and binary forms, with or without
 // modification, are permitted provided that the following conditions are
 // met:
 //
 //     * Redistributions of source code must retain the above copyright
 //       notice, this list of conditions and the following disclaimer.
 //     * Redistributions in binary form must reproduce the above
 //       copyright notice, this list of conditions and the following
 //       disclaimer in the documentation and/or other materials provided
@@ skipping 41 matching lines @@
 
 bool Equal64(uint64_t expected, const RegisterDump*, uint64_t result) {
   if (result != expected) {
     printf("Expected 0x%016" PRIx64 "\t Found 0x%016" PRIx64 "\n",
            expected, result);
   }
 
   return expected == result;
 }
 
+bool Equal128(vec128_t expected, const RegisterDump*, vec128_t result) {
+  if ((result.h != expected.h) || (result.l != expected.l)) {
+    printf("Expected 0x%016" PRIx64 "%016" PRIx64
+           "\t "
+           "Found 0x%016" PRIx64 "%016" PRIx64 "\n",
+           expected.h, expected.l, result.h, result.l);
+  }
+
+  return ((expected.h == result.h) && (expected.l == result.l));
+}
 
 bool EqualFP32(float expected, const RegisterDump*, float result) {
-  if (float_to_rawbits(expected) == float_to_rawbits(result)) {
+  if (bit_cast<uint32_t>(expected) == bit_cast<uint32_t>(result)) {
     return true;
   } else {
     if (std::isnan(expected) || (expected == 0.0)) {
       printf("Expected 0x%08" PRIx32 "\t Found 0x%08" PRIx32 "\n",
-             float_to_rawbits(expected), float_to_rawbits(result));
+             bit_cast<uint32_t>(expected), bit_cast<uint32_t>(result));
     } else {
-      printf("Expected %.9f (0x%08" PRIx32 ")\t "
+      printf("Expected %.9f (0x%08" PRIx32
+             ")\t "
              "Found %.9f (0x%08" PRIx32 ")\n",
-             expected, float_to_rawbits(expected),
-             result, float_to_rawbits(result));
+             expected, bit_cast<uint32_t>(expected), result,
+             bit_cast<uint32_t>(result));
     }
     return false;
   }
 }
 
 
 bool EqualFP64(double expected, const RegisterDump*, double result) {
-  if (double_to_rawbits(expected) == double_to_rawbits(result)) {
+  if (bit_cast<uint64_t>(expected) == bit_cast<uint64_t>(result)) {
     return true;
   }
 
   if (std::isnan(expected) || (expected == 0.0)) {
     printf("Expected 0x%016" PRIx64 "\t Found 0x%016" PRIx64 "\n",
-           double_to_rawbits(expected), double_to_rawbits(result));
+           bit_cast<uint64_t>(expected), bit_cast<uint64_t>(result));
   } else {
-    printf("Expected %.17f (0x%016" PRIx64 ")\t "
+    printf("Expected %.17f (0x%016" PRIx64
+           ")\t "
            "Found %.17f (0x%016" PRIx64 ")\n",
-           expected, double_to_rawbits(expected),
-           result, double_to_rawbits(result));
+           expected, bit_cast<uint64_t>(expected), result,
+           bit_cast<uint64_t>(result));
   }
   return false;
 }
 
 
 bool Equal32(uint32_t expected, const RegisterDump* core, const Register& reg) {
   CHECK(reg.Is32Bits());
   // Retrieve the corresponding X register so we can check that the upper part
   // was properly cleared.
   int64_t result_x = core->xreg(reg.code());
   if ((result_x & 0xffffffff00000000L) != 0) {
     printf("Expected 0x%08" PRIx32 "\t Found 0x%016" PRIx64 "\n",
            expected, result_x);
     return false;
   }
   uint32_t result_w = core->wreg(reg.code());
   return Equal32(expected, core, result_w);
 }
 
 
 bool Equal64(uint64_t expected,
              const RegisterDump* core,
              const Register& reg) {
   CHECK(reg.Is64Bits());
   uint64_t result = core->xreg(reg.code());
   return Equal64(expected, core, result);
 }
 
+bool Equal128(uint64_t expected_h, uint64_t expected_l,
+              const RegisterDump* core, const VRegister& vreg) {
+  CHECK(vreg.Is128Bits());
+  vec128_t expected = {expected_l, expected_h};
+  vec128_t result = core->qreg(vreg.code());
+  return Equal128(expected, core, result);
+}
 
-bool EqualFP32(float expected,
-               const RegisterDump* core,
-               const FPRegister& fpreg) {
+bool EqualFP32(float expected, const RegisterDump* core,
+               const VRegister& fpreg) {
   CHECK(fpreg.Is32Bits());
   // Retrieve the corresponding D register so we can check that the upper part
   // was properly cleared.
   uint64_t result_64 = core->dreg_bits(fpreg.code());
   if ((result_64 & 0xffffffff00000000L) != 0) {
     printf("Expected 0x%08" PRIx32 " (%f)\t Found 0x%016" PRIx64 "\n",
-           float_to_rawbits(expected), expected, result_64);
+           bit_cast<uint32_t>(expected), expected, result_64);
     return false;
   }
 
   return EqualFP32(expected, core, core->sreg(fpreg.code()));
 }
 
-
-bool EqualFP64(double expected,
-               const RegisterDump* core,
-               const FPRegister& fpreg) {
+bool EqualFP64(double expected, const RegisterDump* core,
+               const VRegister& fpreg) {
   CHECK(fpreg.Is64Bits());
   return EqualFP64(expected, core, core->dreg(fpreg.code()));
 }
 
 
 bool Equal64(const Register& reg0,
              const RegisterDump* core,
              const Register& reg1) {
   CHECK(reg0.Is64Bits() && reg1.Is64Bits());
   int64_t expected = core->xreg(reg0.code());
@@ skipping 38 matching lines @@
 
 bool EqualRegisters(const RegisterDump* a, const RegisterDump* b) {
   for (unsigned i = 0; i < kNumberOfRegisters; i++) {
     if (a->xreg(i) != b->xreg(i)) {
       printf("x%d\t Expected 0x%016" PRIx64 "\t Found 0x%016" PRIx64 "\n",
              i, a->xreg(i), b->xreg(i));
       return false;
     }
   }
 
-  for (unsigned i = 0; i < kNumberOfFPRegisters; i++) {
+  for (unsigned i = 0; i < kNumberOfVRegisters; i++) {
     uint64_t a_bits = a->dreg_bits(i);
     uint64_t b_bits = b->dreg_bits(i);
     if (a_bits != b_bits) {
       printf("d%d\t Expected 0x%016" PRIx64 "\t Found 0x%016" PRIx64 "\n",
              i, a_bits, b_bits);
       return false;
     }
   }
 
   return true;
@@ skipping 19 matching lines @@
       list |= (1UL << n);
       i++;
     }
   }
   // Check that we got enough registers.
   CHECK(CountSetBits(list, kNumberOfRegisters) == reg_count);
 
   return list;
 }
 
-
-RegList PopulateFPRegisterArray(FPRegister* s, FPRegister* d, FPRegister* v,
-                                int reg_size, int reg_count, RegList allowed) {
+RegList PopulateVRegisterArray(VRegister* s, VRegister* d, VRegister* v,
+                               int reg_size, int reg_count, RegList allowed) {
   RegList list = 0;
   int i = 0;
-  for (unsigned n = 0; (n < kNumberOfFPRegisters) && (i < reg_count); n++) {
+  for (unsigned n = 0; (n < kNumberOfVRegisters) && (i < reg_count); n++) {
     if (((1UL << n) & allowed) != 0) {
       // Only assigned allowed registers.
       if (v) {
-        v[i] = FPRegister::Create(n, reg_size);
+        v[i] = VRegister::Create(n, reg_size);
       }
       if (d) {
-        d[i] = FPRegister::Create(n, kDRegSizeInBits);
+        d[i] = VRegister::Create(n, kDRegSizeInBits);
       }
       if (s) {
-        s[i] = FPRegister::Create(n, kSRegSizeInBits);
+        s[i] = VRegister::Create(n, kSRegSizeInBits);
       }
       list |= (1UL << n);
       i++;
     }
   }
   // Check that we got enough registers.
-  CHECK(CountSetBits(list, kNumberOfFPRegisters) == reg_count);
+  CHECK(CountSetBits(list, kNumberOfVRegisters) == reg_count);
 
   return list;
 }
 
 
 void Clobber(MacroAssembler* masm, RegList reg_list, uint64_t const value) {
   Register first = NoReg;
   for (unsigned i = 0; i < kNumberOfRegisters; i++) {
     if (reg_list & (1UL << i)) {
       Register xn = Register::Create(i, kXRegSizeInBits);
       // We should never write into csp here.
       CHECK(!xn.Is(csp));
       if (!xn.IsZero()) {
         if (!first.IsValid()) {
           // This is the first register we've hit, so construct the literal.
           __ Mov(xn, value);
           first = xn;
         } else {
           // We've already loaded the literal, so re-use the value already
           // loaded into the first register we hit.
           __ Mov(xn, first);
         }
       }
     }
   }
 }
 
 
 void ClobberFP(MacroAssembler* masm, RegList reg_list, double const value) {
-  FPRegister first = NoFPReg;
-  for (unsigned i = 0; i < kNumberOfFPRegisters; i++) {
+  VRegister first = NoVReg;
+  for (unsigned i = 0; i < kNumberOfVRegisters; i++) {
     if (reg_list & (1UL << i)) {
-      FPRegister dn = FPRegister::Create(i, kDRegSizeInBits);
+      VRegister dn = VRegister::Create(i, kDRegSizeInBits);
       if (!first.IsValid()) {
         // This is the first register we've hit, so construct the literal.
         __ Fmov(dn, value);
         first = dn;
       } else {
         // We've already loaded the literal, so re-use the value already loaded
         // into the first register we hit.
         __ Fmov(dn, first);
       }
     }
   }
 }
 
 
 void Clobber(MacroAssembler* masm, CPURegList reg_list) {
   if (reg_list.type() == CPURegister::kRegister) {
     // This will always clobber X registers.
     Clobber(masm, reg_list.list());
-  } else if (reg_list.type() == CPURegister::kFPRegister) {
+  } else if (reg_list.type() == CPURegister::kVRegister) {
     // This will always clobber D registers.
     ClobberFP(masm, reg_list.list());
   } else {
     UNREACHABLE();
   }
 }
 
 
 void RegisterDump::Dump(MacroAssembler* masm) {
   CHECK(__ StackPointer().Is(csp));
@@ skipping 10 matching lines @@
   Register tmp = x2;
   Register dump_base_w = dump_base.W();
   Register dump_w = dump.W();
   Register tmp_w = tmp.W();
 
   // Offsets into the dump_ structure.
   const int x_offset = offsetof(dump_t, x_);
   const int w_offset = offsetof(dump_t, w_);
   const int d_offset = offsetof(dump_t, d_);
   const int s_offset = offsetof(dump_t, s_);
+  const int q_offset = offsetof(dump_t, q_);
   const int sp_offset = offsetof(dump_t, sp_);
   const int wsp_offset = offsetof(dump_t, wsp_);
   const int flags_offset = offsetof(dump_t, flags_);
 
   __ Push(xzr, dump_base, dump, tmp);
 
   // Load the address where we will dump the state.
   __ Mov(dump_base, reinterpret_cast<uint64_t>(&dump_));
 
   // Dump the stack pointer (csp and wcsp).
@@ skipping 14 matching lines @@
 
   // Dump W registers.
   __ Add(dump, dump_base, w_offset);
   for (unsigned i = 0; i < kNumberOfRegisters; i += 2) {
     __ Stp(Register::WRegFromCode(i), Register::WRegFromCode(i + 1),
            MemOperand(dump, i * kWRegSize));
   }
 
   // Dump D registers.
   __ Add(dump, dump_base, d_offset);
-  for (unsigned i = 0; i < kNumberOfFPRegisters; i += 2) {
-    __ Stp(FPRegister::DRegFromCode(i), FPRegister::DRegFromCode(i + 1),
+  for (unsigned i = 0; i < kNumberOfVRegisters; i += 2) {
+    __ Stp(VRegister::DRegFromCode(i), VRegister::DRegFromCode(i + 1),
            MemOperand(dump, i * kDRegSize));
   }
 
   // Dump S registers.
   __ Add(dump, dump_base, s_offset);
-  for (unsigned i = 0; i < kNumberOfFPRegisters; i += 2) {
-    __ Stp(FPRegister::SRegFromCode(i), FPRegister::SRegFromCode(i + 1),
+  for (unsigned i = 0; i < kNumberOfVRegisters; i += 2) {
+    __ Stp(VRegister::SRegFromCode(i), VRegister::SRegFromCode(i + 1),
            MemOperand(dump, i * kSRegSize));
   }
 
+  // Dump Q registers.
+  __ Add(dump, dump_base, q_offset);
+  for (unsigned i = 0; i < kNumberOfVRegisters; i += 2) {
+    __ Stp(VRegister::QRegFromCode(i), VRegister::QRegFromCode(i + 1),
+           MemOperand(dump, i * kQRegSize));
+  }
+
   // Dump the flags.
   __ Mrs(tmp, NZCV);
   __ Str(tmp, MemOperand(dump_base, flags_offset));
 
   // To dump the values that were in tmp amd dump, we need a new scratch
   // register.  We can use any of the already dumped registers since we can
   // easily restore them.
   Register dump2_base = x10;
   Register dump2 = x11;
   CHECK(!AreAliased(dump_base, dump, tmp, dump2_base, dump2));
@@ skipping 19 matching lines @@
 
   // Restore the MacroAssembler's scratch registers.
   masm->TmpList()->set_list(old_tmp_list);
   masm->FPTmpList()->set_list(old_fptmp_list);
 
   completed_ = true;
 }
 
 }  // namespace internal
 }  // namespace v8