1
0

__rem_pio2.c 4.2 KB

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