e_rem_pio2l.h 4.5 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149
  1. /* From: @(#)e_rem_pio2.c 1.4 95/01/18 */
  2. /*
  3. * ====================================================
  4. * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  5. * Copyright (c) 2008 Steven G. Kargl, David Schultz, Bruce D. Evans.
  6. *
  7. * Developed at SunSoft, a Sun Microsystems, Inc. business.
  8. * Permission to use, copy, modify, and distribute this
  9. * software is freely granted, provided that this notice
  10. * is preserved.
  11. * ====================================================
  12. *
  13. * Optimized by Bruce D. Evans.
  14. */
  15. #include <sys/cdefs.h>
  16. __FBSDID("$FreeBSD: src/lib/msun/ld80/e_rem_pio2l.h,v 1.3 2011/06/18 13:56:33 benl Exp $");
  17. /* ld80 version of __ieee754_rem_pio2l(x,y)
  18. *
  19. * return the remainder of x rem pi/2 in y[0]+y[1]
  20. * use __kernel_rem_pio2()
  21. */
  22. #include <float.h>
  23. #include "math.h"
  24. #include "math_private.h"
  25. #include "fpmath.h"
  26. #define BIAS (LDBL_MAX_EXP - 1)
  27. /*
  28. * invpio2: 64 bits of 2/pi
  29. * pio2_1: first 39 bits of pi/2
  30. * pio2_1t: pi/2 - pio2_1
  31. * pio2_2: second 39 bits of pi/2
  32. * pio2_2t: pi/2 - (pio2_1+pio2_2)
  33. * pio2_3: third 39 bits of pi/2
  34. * pio2_3t: pi/2 - (pio2_1+pio2_2+pio2_3)
  35. */
  36. static const double
  37. zero = 0.00000000000000000000e+00, /* 0x00000000, 0x00000000 */
  38. two24 = 1.67772160000000000000e+07, /* 0x41700000, 0x00000000 */
  39. pio2_1 = 1.57079632679597125389e+00, /* 0x3FF921FB, 0x54444000 */
  40. pio2_2 = -1.07463465549783099519e-12, /* -0x12e7b967674000.0p-92 */
  41. pio2_3 = 6.36831716351370313614e-25; /* 0x18a2e037074000.0p-133 */
  42. #if defined(__amd64__) || defined(__i386__)
  43. /* Long double constants are slow on these arches, and broken on i386. */
  44. static const volatile double
  45. invpio2hi = 6.3661977236758138e-01, /* 0x145f306dc9c883.0p-53 */
  46. invpio2lo = -3.9356538861223811e-17, /* -0x16b00000000000.0p-107 */
  47. pio2_1thi = -1.0746346554971943e-12, /* -0x12e7b9676733af.0p-92 */
  48. pio2_1tlo = 8.8451028997905949e-29, /* 0x1c080000000000.0p-146 */
  49. pio2_2thi = 6.3683171635109499e-25, /* 0x18a2e03707344a.0p-133 */
  50. pio2_2tlo = 2.3183081793789774e-41, /* 0x10280000000000.0p-187 */
  51. pio2_3thi = -2.7529965190440717e-37, /* -0x176b7ed8fbbacc.0p-174 */
  52. pio2_3tlo = -4.2006647512740502e-54; /* -0x19c00000000000.0p-230 */
  53. #define invpio2 ((long double)invpio2hi + invpio2lo)
  54. #define pio2_1t ((long double)pio2_1thi + pio2_1tlo)
  55. #define pio2_2t ((long double)pio2_2thi + pio2_2tlo)
  56. #define pio2_3t ((long double)pio2_3thi + pio2_3tlo)
  57. #else
  58. static const long double
  59. invpio2 = 6.36619772367581343076e-01L, /* 0xa2f9836e4e44152a.0p-64 */
  60. pio2_1t = -1.07463465549719416346e-12L, /* -0x973dcb3b399d747f.0p-103 */
  61. pio2_2t = 6.36831716351095013979e-25L, /* 0xc51701b839a25205.0p-144 */
  62. pio2_3t = -2.75299651904407171810e-37L; /* -0xbb5bf6c7ddd660ce.0p-185 */
  63. #endif
  64. static inline __always_inline int
  65. __ieee754_rem_pio2l(long double x, long double *y)
  66. {
  67. union IEEEl2bits u,u1;
  68. long double z,w,t,r,fn;
  69. double tx[3],ty[2];
  70. int e0,ex,i,j,nx,n;
  71. int16_t expsign;
  72. u.e = x;
  73. expsign = u.xbits.expsign;
  74. ex = expsign & 0x7fff;
  75. if (ex < BIAS + 25 || (ex == BIAS + 25 && u.bits.manh < 0xc90fdaa2)) {
  76. /* |x| ~< 2^25*(pi/2), medium size */
  77. /* Use a specialized rint() to get fn. Assume round-to-nearest. */
  78. fn = x*invpio2+0x1.8p63;
  79. fn = fn-0x1.8p63;
  80. #ifdef HAVE_EFFICIENT_IRINT
  81. n = irint(fn);
  82. #else
  83. n = fn;
  84. #endif
  85. r = x-fn*pio2_1;
  86. w = fn*pio2_1t; /* 1st round good to 102 bit */
  87. {
  88. union IEEEl2bits u2;
  89. int ex1;
  90. j = ex;
  91. y[0] = r-w;
  92. u2.e = y[0];
  93. ex1 = u2.xbits.expsign & 0x7fff;
  94. i = j-ex1;
  95. if(i>22) { /* 2nd iteration needed, good to 141 */
  96. t = r;
  97. w = fn*pio2_2;
  98. r = t-w;
  99. w = fn*pio2_2t-((t-r)-w);
  100. y[0] = r-w;
  101. u2.e = y[0];
  102. ex1 = u2.xbits.expsign & 0x7fff;
  103. i = j-ex1;
  104. if(i>61) { /* 3rd iteration need, 180 bits acc */
  105. t = r; /* will cover all possible cases */
  106. w = fn*pio2_3;
  107. r = t-w;
  108. w = fn*pio2_3t-((t-r)-w);
  109. y[0] = r-w;
  110. }
  111. }
  112. }
  113. y[1] = (r-y[0])-w;
  114. return n;
  115. }
  116. /*
  117. * all other (large) arguments
  118. */
  119. if(ex==0x7fff) { /* x is inf or NaN */
  120. y[0]=y[1]=x-x; return 0;
  121. }
  122. /* set z = scalbn(|x|,ilogb(x)-23) */
  123. u1.e = x;
  124. e0 = ex - BIAS - 23; /* e0 = ilogb(|x|)-23; */
  125. u1.xbits.expsign = ex - e0;
  126. z = u1.e;
  127. for(i=0;i<2;i++) {
  128. tx[i] = (double)((int32_t)(z));
  129. z = (z-tx[i])*two24;
  130. }
  131. tx[2] = z;
  132. nx = 3;
  133. while(tx[nx-1]==zero) nx--; /* skip zero term */
  134. n = __kernel_rem_pio2(tx,ty,e0,nx,2);
  135. r = (long double)ty[0] + ty[1];
  136. w = ty[1] - (r - ty[0]);
  137. if(expsign<0) {y[0] = -r; y[1] = -w; return -n;}
  138. y[0] = r; y[1] = w; return n;
  139. }