s_atan.c 4.4 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143
  1. /* @(#)s_atan.c 5.1 93/09/24 */
  2. /*
  3. * ====================================================
  4. * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
  5. *
  6. * Developed at SunPro, 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. #if defined(LIBM_SCCS) && !defined(lint)
  13. static char rcsid[] = "$NetBSD: s_atan.c,v 1.8 1995/05/10 20:46:45 jtc Exp $";
  14. #endif
  15. /* atan(x)
  16. * Method
  17. * 1. Reduce x to positive by atan(x) = -atan(-x).
  18. * 2. According to the integer k=4t+0.25 chopped, t=x, the argument
  19. * is further reduced to one of the following intervals and the
  20. * arctangent of t is evaluated by the corresponding formula:
  21. *
  22. * [0,7/16] atan(x) = t-t^3*(a1+t^2*(a2+...(a10+t^2*a11)...)
  23. * [7/16,11/16] atan(x) = atan(1/2) + atan( (t-0.5)/(1+t/2) )
  24. * [11/16.19/16] atan(x) = atan( 1 ) + atan( (t-1)/(1+t) )
  25. * [19/16,39/16] atan(x) = atan(3/2) + atan( (t-1.5)/(1+1.5t) )
  26. * [39/16,INF] atan(x) = atan(INF) + atan( -1/t )
  27. *
  28. * Constants:
  29. * The hexadecimal values are the intended ones for the following
  30. * constants. The decimal values may be used, provided that the
  31. * compiler will convert from decimal to binary accurately enough
  32. * to produce the hexadecimal values shown.
  33. */
  34. #include "math.h"
  35. #include "math_private.h"
  36. libm_hidden_proto(fabs)
  37. #ifdef __STDC__
  38. static const double atanhi[] = {
  39. #else
  40. static double atanhi[] = {
  41. #endif
  42. 4.63647609000806093515e-01, /* atan(0.5)hi 0x3FDDAC67, 0x0561BB4F */
  43. 7.85398163397448278999e-01, /* atan(1.0)hi 0x3FE921FB, 0x54442D18 */
  44. 9.82793723247329054082e-01, /* atan(1.5)hi 0x3FEF730B, 0xD281F69B */
  45. 1.57079632679489655800e+00, /* atan(inf)hi 0x3FF921FB, 0x54442D18 */
  46. };
  47. #ifdef __STDC__
  48. static const double atanlo[] = {
  49. #else
  50. static double atanlo[] = {
  51. #endif
  52. 2.26987774529616870924e-17, /* atan(0.5)lo 0x3C7A2B7F, 0x222F65E2 */
  53. 3.06161699786838301793e-17, /* atan(1.0)lo 0x3C81A626, 0x33145C07 */
  54. 1.39033110312309984516e-17, /* atan(1.5)lo 0x3C700788, 0x7AF0CBBD */
  55. 6.12323399573676603587e-17, /* atan(inf)lo 0x3C91A626, 0x33145C07 */
  56. };
  57. #ifdef __STDC__
  58. static const double aT[] = {
  59. #else
  60. static double aT[] = {
  61. #endif
  62. 3.33333333333329318027e-01, /* 0x3FD55555, 0x5555550D */
  63. -1.99999999998764832476e-01, /* 0xBFC99999, 0x9998EBC4 */
  64. 1.42857142725034663711e-01, /* 0x3FC24924, 0x920083FF */
  65. -1.11111104054623557880e-01, /* 0xBFBC71C6, 0xFE231671 */
  66. 9.09088713343650656196e-02, /* 0x3FB745CD, 0xC54C206E */
  67. -7.69187620504482999495e-02, /* 0xBFB3B0F2, 0xAF749A6D */
  68. 6.66107313738753120669e-02, /* 0x3FB10D66, 0xA0D03D51 */
  69. -5.83357013379057348645e-02, /* 0xBFADDE2D, 0x52DEFD9A */
  70. 4.97687799461593236017e-02, /* 0x3FA97B4B, 0x24760DEB */
  71. -3.65315727442169155270e-02, /* 0xBFA2B444, 0x2C6A6C2F */
  72. 1.62858201153657823623e-02, /* 0x3F90AD3A, 0xE322DA11 */
  73. };
  74. libm_hidden_proto(atan)
  75. #ifdef __STDC__
  76. static const double
  77. #else
  78. static double
  79. #endif
  80. one = 1.0,
  81. huge = 1.0e300;
  82. #ifdef __STDC__
  83. double atan(double x)
  84. #else
  85. double atan(x)
  86. double x;
  87. #endif
  88. {
  89. double w,s1,s2,z;
  90. int32_t ix,hx,id;
  91. GET_HIGH_WORD(hx,x);
  92. ix = hx&0x7fffffff;
  93. if(ix>=0x44100000) { /* if |x| >= 2^66 */
  94. u_int32_t low;
  95. GET_LOW_WORD(low,x);
  96. if(ix>0x7ff00000||
  97. (ix==0x7ff00000&&(low!=0)))
  98. return x+x; /* NaN */
  99. if(hx>0) return atanhi[3]+atanlo[3];
  100. else return -atanhi[3]-atanlo[3];
  101. } if (ix < 0x3fdc0000) { /* |x| < 0.4375 */
  102. if (ix < 0x3e200000) { /* |x| < 2^-29 */
  103. if(huge+x>one) return x; /* raise inexact */
  104. }
  105. id = -1;
  106. } else {
  107. x = fabs(x);
  108. if (ix < 0x3ff30000) { /* |x| < 1.1875 */
  109. if (ix < 0x3fe60000) { /* 7/16 <=|x|<11/16 */
  110. id = 0; x = (2.0*x-one)/(2.0+x);
  111. } else { /* 11/16<=|x|< 19/16 */
  112. id = 1; x = (x-one)/(x+one);
  113. }
  114. } else {
  115. if (ix < 0x40038000) { /* |x| < 2.4375 */
  116. id = 2; x = (x-1.5)/(one+1.5*x);
  117. } else { /* 2.4375 <= |x| < 2^66 */
  118. id = 3; x = -1.0/x;
  119. }
  120. }}
  121. /* end of argument reduction */
  122. z = x*x;
  123. w = z*z;
  124. /* break sum from i=0 to 10 aT[i]z**(i+1) into odd and even poly */
  125. s1 = z*(aT[0]+w*(aT[2]+w*(aT[4]+w*(aT[6]+w*(aT[8]+w*aT[10])))));
  126. s2 = w*(aT[1]+w*(aT[3]+w*(aT[5]+w*(aT[7]+w*aT[9]))));
  127. if (id<0) return x - x*(s1+s2);
  128. else {
  129. z = atanhi[id] - ((x*(s1+s2) - atanlo[id]) - x);
  130. return (hx<0)? -z:z;
  131. }
  132. }
  133. libm_hidden_def(atan)