__rem_pio2.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174175176177
  1. /* origin: FreeBSD /usr/src/lib/msun/src/e_rem_pio2.c */
  2. /*
  3. * ====================================================
  4. * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  5. *
  6. * Developed at SunSoft, a Sun Microsystems, Inc. business.
  7. * Permission to use, copy, modify, and distribute this
  8. * software is freely granted, provided that this notice
  9. * is preserved.
  10. * ====================================================
  11. *
  12. * Optimized by Bruce D. Evans.
  13. */
  14. /* __rem_pio2(x,y)
  15. *
  16. * return the remainder of x rem pi/2 in y[0]+y[1]
  17. * use __rem_pio2_large() for large x
  18. */
  19. #include "libm.h"
  20. #if FLT_EVAL_METHOD==0 || FLT_EVAL_METHOD==1
  21. #define EPS DBL_EPSILON
  22. #elif FLT_EVAL_METHOD==2
  23. #define EPS LDBL_EPSILON
  24. #endif
  25. /*
  26. * invpio2: 53 bits of 2/pi
  27. * pio2_1: first 33 bit of pi/2
  28. * pio2_1t: pi/2 - pio2_1
  29. * pio2_2: second 33 bit of pi/2
  30. * pio2_2t: pi/2 - (pio2_1+pio2_2)
  31. * pio2_3: third 33 bit of pi/2
  32. * pio2_3t: pi/2 - (pio2_1+pio2_2+pio2_3)
  33. */
  34. static const double
  35. toint = 1.5/EPS,
  36. invpio2 = 6.36619772367581382433e-01, /* 0x3FE45F30, 0x6DC9C883 */
  37. pio2_1 = 1.57079632673412561417e+00, /* 0x3FF921FB, 0x54400000 */
  38. pio2_1t = 6.07710050650619224932e-11, /* 0x3DD0B461, 0x1A626331 */
  39. pio2_2 = 6.07710050630396597660e-11, /* 0x3DD0B461, 0x1A600000 */
  40. pio2_2t = 2.02226624879595063154e-21, /* 0x3BA3198A, 0x2E037073 */
  41. pio2_3 = 2.02226624871116645580e-21, /* 0x3BA3198A, 0x2E000000 */
  42. pio2_3t = 8.47842766036889956997e-32; /* 0x397B839A, 0x252049C1 */
  43. /* caller must handle the case when reduction is not needed: |x| ~<= pi/4 */
  44. int __rem_pio2(double x, double *y)
  45. {
  46. union {double f; uint64_t i;} u = {x};
  47. double_t z,w,t,r,fn;
  48. double tx[3],ty[2];
  49. uint32_t ix;
  50. int sign, n, ex, ey, i;
  51. sign = u.i>>63;
  52. ix = u.i>>32 & 0x7fffffff;
  53. if (ix <= 0x400f6a7a) { /* |x| ~<= 5pi/4 */
  54. if ((ix & 0xfffff) == 0x921fb) /* |x| ~= pi/2 or 2pi/2 */
  55. goto medium; /* cancellation -- use medium case */
  56. if (ix <= 0x4002d97c) { /* |x| ~<= 3pi/4 */
  57. if (!sign) {
  58. z = x - pio2_1; /* one round good to 85 bits */
  59. y[0] = z - pio2_1t;
  60. y[1] = (z-y[0]) - pio2_1t;
  61. return 1;
  62. } else {
  63. z = x + pio2_1;
  64. y[0] = z + pio2_1t;
  65. y[1] = (z-y[0]) + pio2_1t;
  66. return -1;
  67. }
  68. } else {
  69. if (!sign) {
  70. z = x - 2*pio2_1;
  71. y[0] = z - 2*pio2_1t;
  72. y[1] = (z-y[0]) - 2*pio2_1t;
  73. return 2;
  74. } else {
  75. z = x + 2*pio2_1;
  76. y[0] = z + 2*pio2_1t;
  77. y[1] = (z-y[0]) + 2*pio2_1t;
  78. return -2;
  79. }
  80. }
  81. }
  82. if (ix <= 0x401c463b) { /* |x| ~<= 9pi/4 */
  83. if (ix <= 0x4015fdbc) { /* |x| ~<= 7pi/4 */
  84. if (ix == 0x4012d97c) /* |x| ~= 3pi/2 */
  85. goto medium;
  86. if (!sign) {
  87. z = x - 3*pio2_1;
  88. y[0] = z - 3*pio2_1t;
  89. y[1] = (z-y[0]) - 3*pio2_1t;
  90. return 3;
  91. } else {
  92. z = x + 3*pio2_1;
  93. y[0] = z + 3*pio2_1t;
  94. y[1] = (z-y[0]) + 3*pio2_1t;
  95. return -3;
  96. }
  97. } else {
  98. if (ix == 0x401921fb) /* |x| ~= 4pi/2 */
  99. goto medium;
  100. if (!sign) {
  101. z = x - 4*pio2_1;
  102. y[0] = z - 4*pio2_1t;
  103. y[1] = (z-y[0]) - 4*pio2_1t;
  104. return 4;
  105. } else {
  106. z = x + 4*pio2_1;
  107. y[0] = z + 4*pio2_1t;
  108. y[1] = (z-y[0]) + 4*pio2_1t;
  109. return -4;
  110. }
  111. }
  112. }
  113. if (ix < 0x413921fb) { /* |x| ~< 2^20*(pi/2), medium size */
  114. medium:
  115. /* rint(x/(pi/2)), Assume round-to-nearest. */
  116. fn = (double_t)x*invpio2 + toint - toint;
  117. n = (int32_t)fn;
  118. r = x - fn*pio2_1;
  119. w = fn*pio2_1t; /* 1st round, good to 85 bits */
  120. y[0] = r - w;
  121. u.f = y[0];
  122. ey = u.i>>52 & 0x7ff;
  123. ex = ix>>20;
  124. if (ex - ey > 16) { /* 2nd round, good to 118 bits */
  125. t = r;
  126. w = fn*pio2_2;
  127. r = t - w;
  128. w = fn*pio2_2t - ((t-r)-w);
  129. y[0] = r - w;
  130. u.f = y[0];
  131. ey = u.i>>52 & 0x7ff;
  132. if (ex - ey > 49) { /* 3rd round, good to 151 bits, covers all cases */
  133. t = r;
  134. w = fn*pio2_3;
  135. r = t - w;
  136. w = fn*pio2_3t - ((t-r)-w);
  137. y[0] = r - w;
  138. }
  139. }
  140. y[1] = (r - y[0]) - w;
  141. return n;
  142. }
  143. /*
  144. * all other (large) arguments
  145. */
  146. if (ix >= 0x7ff00000) { /* x is inf or NaN */
  147. y[0] = y[1] = x - x;
  148. return 0;
  149. }
  150. /* set z = scalbn(|x|,-ilogb(x)+23) */
  151. u.f = x;
  152. u.i &= (uint64_t)-1>>12;
  153. u.i |= (uint64_t)(0x3ff + 23)<<52;
  154. z = u.f;
  155. for (i=0; i < 2; i++) {
  156. tx[i] = (double)(int32_t)z;
  157. z = (z-tx[i])*0x1p24;
  158. }
  159. tx[i] = z;
  160. /* skip zero terms, first term is non-zero */
  161. while (tx[i] == 0.0)
  162. i--;
  163. n = __rem_pio2_large(tx,ty,(int)(ix>>20)-(0x3ff+23),i+1,1);
  164. if (sign) {
  165. y[0] = -ty[0];
  166. y[1] = -ty[1];
  167. return -n;
  168. }
  169. y[0] = ty[0];
  170. y[1] = ty[1];
  171. return n;
  172. }