s_fpclassify.c 2.4 KB

12345678910111213141516171819202122232425262728293031323334353637383940414243444546474849505152535455565758596061626364656667686970717273747576777879808182838485868788899091929394959697
  1. /*-
  2. * Copyright (c) 2004 David Schultz <das@FreeBSD.ORG>
  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. *
  14. * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  15. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  16. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  17. * ARE DISCLAIMED. IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  18. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  20. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  21. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  22. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  23. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  24. * SUCH DAMAGE.
  25. *
  26. */
  27. #include <openlibm.h>
  28. #include "fpmath.h"
  29. int
  30. __fpclassifyd(double d)
  31. {
  32. union IEEEd2bits u;
  33. u.d = d;
  34. if (u.bits.exp == 2047) {
  35. if (u.bits.manl == 0 && u.bits.manh == 0) {
  36. return FP_INFINITE;
  37. } else {
  38. return FP_NAN;
  39. }
  40. } else if (u.bits.exp != 0) {
  41. return FP_NORMAL;
  42. } else if (u.bits.manl == 0 && u.bits.manh == 0) {
  43. return FP_ZERO;
  44. } else {
  45. return FP_SUBNORMAL;
  46. }
  47. }
  48. int
  49. __fpclassifyf(float f)
  50. {
  51. union IEEEf2bits u;
  52. u.f = f;
  53. if (u.bits.exp == 255) {
  54. if (u.bits.man == 0) {
  55. return FP_INFINITE;
  56. } else {
  57. return FP_NAN;
  58. }
  59. } else if (u.bits.exp != 0) {
  60. return FP_NORMAL;
  61. } else if (u.bits.man == 0) {
  62. return FP_ZERO;
  63. } else {
  64. return FP_SUBNORMAL;
  65. }
  66. }
  67. int
  68. __fpclassifyl(long double e)
  69. {
  70. union IEEEl2bits u;
  71. u.e = e;
  72. mask_nbit_l(u);
  73. if (u.bits.exp == 32767) {
  74. if (u.bits.manl == 0 && u.bits.manh == 0) {
  75. return FP_INFINITE;
  76. } else {
  77. return FP_NAN;
  78. }
  79. } else if (u.bits.exp != 0) {
  80. return FP_NORMAL;
  81. } else if (u.bits.manl == 0 && u.bits.manh == 0) {
  82. return FP_ZERO;
  83. } else {
  84. return FP_SUBNORMAL;
  85. }
  86. }