Allocate typed array for rempio2 result.

src/third_party/fdlibm/fdlibm.cc

 // The following is adapted from fdlibm (http://www.netlib.org/fdlibm).
 //
 // ====================================================
 // Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
 //
 // Developed at SunSoft, a Sun Microsystems, Inc. business.
 // Permission to use, copy, modify, and distribute this
 // software is freely granted, provided that this notice
 // is preserved.
 // ====================================================
@@ skipping 108 matching lines @@
     7.54978941586159635335e-08,  // 0x3E74442D, 0x00000000
     5.39030252995776476554e-15,  // 0x3CF84698, 0x80000000
     3.28200341580791294123e-22,  // 0x3B78CC51, 0x60000000
     1.27065575308067607349e-29,  // 0x39F01B83, 0x80000000
     1.22933308981111328932e-36,  // 0x387A2520, 0x40000000
     2.73370053816464559624e-44,  // 0x36E38222, 0x80000000
     2.16741683877804819444e-51   // 0x3569F31D, 0x00000000
 };
 
 
-int __kernel_rem_pio2(double* x, double* y, int e0, int nx) {
+INLINE(int __kernel_rem_pio2(double* x, double* y, int e0, int nx)) {
   static const int32_t jk = 3;
   double fw;
   int32_t jx = nx - 1;
   int32_t jv = (e0 - 3) / 24;
   if (jv < 0) jv = 0;
   int32_t q0 = e0 - 24 * (jv + 1);
   int32_t m = jx + jk;
 
-  double f[10];
+  double f[20];
   for (int i = 0, j = jv - jx; i <= m; i++, j++) {
     f[i] = (j < 0) ? zero : static_cast<double>(two_over_pi[j]);
   }
 
-  double q[10];
+  double q[20];
   for (int i = 0; i <= jk; i++) {
     fw = 0.0;
     for (int j = 0; j <= jx; j++) fw += x[j] * f[jx + i - j];
     q[i] = fw;
   }
 
   int32_t jz = jk;
 
 recompute:
 
-  int32_t iq[10];
+  int32_t iq[20];
   double z = q[jz];
   for (int i = 0, j = jz; j > 0; i++, j--) {
     fw = static_cast<double>(static_cast<int32_t>(twon24 * z));
     iq[i] = static_cast<int32_t>(z - two24 * fw);
     z = q[j - 1] + fw;
   }
 
   z = scalbn(z, q0);
   z -= 8.0 * std::floor(z * 0.125);
   int32_t n = static_cast<int32_t>(z);
@@ skipping 70 matching lines @@
       iq[jz] = static_cast<int32_t>(z);
     }
   }
 
   fw = scalbn(one, q0);
   for (int i = jz; i >= 0; i--) {
     q[i] = fw * static_cast<double>(iq[i]);
     fw *= twon24;
   }
 
-  double fq[10];
+  double fq[20];
   for (int i = jz; i >= 0; i--) {
     fw = 0.0;
     for (int k = 0; k <= jk && k <= jz - i; k++) fw += PIo2[k] * q[i + k];
     fq[jz - i] = fw;
   }
 
   fw = 0.0;
   for (int i = jz; i >= 0; i--) fw += fq[i];
   y[0] = (ih == 0) ? fw : -fw;
   fw = fq[0] - fw;
@@ skipping 29 matching lines @@
   int n = __kernel_rem_pio2(tx, y, e0, nx);
   if (hx < 0) {
     y[0] = -y[0];
     y[1] = -y[1];
     return -n;
   }
   return n;
 }
 }
 }  // namespace v8::internal