e_exp.S 3.0 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100
  1. /*
  2. * Copyright (c) 1993,94 Winning Strategies, Inc.
  3. * All rights reserved.
  4. *
  5. * Redistribution and use in source and binary forms, with or without
  6. * modification, are permitted provided that the following conditions
  7. * are met:
  8. * 1. Redistributions of source code must retain the above copyright
  9. * notice, this list of conditions and the following disclaimer.
  10. * 2. Redistributions in binary form must reproduce the above copyright
  11. * notice, this list of conditions and the following disclaimer in the
  12. * documentation and/or other materials provided with the distribution.
  13. * 3. All advertising materials mentioning features or use of this software
  14. * must display the following acknowledgement:
  15. * This product includes software developed by Winning Strategies, Inc.
  16. * 4. The name of the author may not be used to endorse or promote products
  17. * derived from this software without specific prior written permission.
  18. *
  19. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR ``AS IS'' AND ANY EXPRESS OR
  20. * IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE IMPLIED WARRANTIES
  21. * OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE ARE DISCLAIMED.
  22. * IN NO EVENT SHALL THE AUTHOR BE LIABLE FOR ANY DIRECT, INDIRECT,
  23. * INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT
  24. * NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE,
  25. * DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY
  26. * THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
  27. * (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE OF
  28. * THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
  29. */
  30. /*
  31. * Written by:
  32. * J.T. Conklin ([email protected]), Winning Strategies, Inc.
  33. */
  34. #include <i387/bsd_asm.h>
  35. /* e^x = 2^(x * log2(e)) */
  36. ENTRY(exp)
  37. /*
  38. * If x is +-Inf, then the subtraction would give Inf-Inf = NaN.
  39. * Avoid this. Also avoid it if x is NaN for convenience.
  40. */
  41. movl 8(%esp),%eax
  42. andl $0x7fffffff,%eax
  43. cmpl $0x7ff00000,%eax
  44. jae x_Inf_or_NaN
  45. fldl 4(%esp)
  46. /*
  47. * Extended precision is needed to reduce the maximum error from
  48. * hundreds of ulps to less than 1 ulp. Switch to it if necessary.
  49. * We may as well set the rounding mode to to-nearest and mask traps
  50. * if we switch.
  51. */
  52. fstcw 4(%esp)
  53. movl 4(%esp),%eax
  54. andl $0x0300,%eax
  55. cmpl $0x0300,%eax /* RC == 0 && PC == 3? */
  56. je 1f /* jump if mode is good */
  57. movl $0x137f,8(%esp)
  58. fldcw 8(%esp)
  59. 1:
  60. fldl2e
  61. fmulp /* x * log2(e) */
  62. fst %st(1)
  63. frndint /* int(x * log2(e)) */
  64. fst %st(2)
  65. fsubrp /* fract(x * log2(e)) */
  66. f2xm1 /* 2^(fract(x * log2(e))) - 1 */
  67. fld1
  68. faddp /* 2^(fract(x * log2(e))) */
  69. fscale /* e^x */
  70. fstp %st(1)
  71. je 1f
  72. fldcw 4(%esp)
  73. 1:
  74. ret
  75. x_Inf_or_NaN:
  76. /*
  77. * Return 0 if x is -Inf. Otherwise just return x; when x is Inf
  78. * this gives Inf, and when x is a NaN this gives the same result
  79. * as (x + x) (x quieted).
  80. */
  81. cmpl $0xfff00000,8(%esp)
  82. jne x_not_minus_Inf
  83. cmpl $0,4(%esp)
  84. jne x_not_minus_Inf
  85. fldz
  86. ret
  87. x_not_minus_Inf:
  88. fldl 4(%esp)
  89. ret
  90. END(exp)
  91. //