ieee.h 4.6 KB

123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145
  1. /* $OpenBSD: ieee.h,v 1.2 2008/09/07 20:36:06 martynas Exp $ */
  2. /* $NetBSD: ieee.h,v 1.1 1996/09/30 16:34:25 ws Exp $ */
  3. /*
  4. * Copyright (c) 1992, 1993
  5. * The Regents of the University of California. All rights reserved.
  6. *
  7. * This software was developed by the Computer Systems Engineering group
  8. * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
  9. * contributed to Berkeley.
  10. *
  11. * All advertising materials mentioning features or use of this software
  12. * must display the following acknowledgement:
  13. * This product includes software developed by the University of
  14. * California, Lawrence Berkeley Laboratory.
  15. *
  16. * Redistribution and use in source and binary forms, with or without
  17. * modification, are permitted provided that the following conditions
  18. * are met:
  19. * 1. Redistributions of source code must retain the above copyright
  20. * notice, this list of conditions and the following disclaimer.
  21. * 2. Redistributions in binary form must reproduce the above copyright
  22. * notice, this list of conditions and the following disclaimer in the
  23. * documentation and/or other materials provided with the distribution.
  24. * 3. Neither the name of the University nor the names of its contributors
  25. * may be used to endorse or promote products derived from this software
  26. * without specific prior written permission.
  27. *
  28. * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  29. * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  30. * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  31. * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  32. * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  33. * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  34. * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  35. * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  36. * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  37. * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  38. * SUCH DAMAGE.
  39. *
  40. * @(#)ieee.h 8.1 (Berkeley) 6/11/93
  41. */
  42. /*
  43. * ieee.h defines the machine-dependent layout of the machine's IEEE
  44. * floating point. It does *not* define (yet?) any of the rounding
  45. * mode bits, exceptions, and so forth.
  46. */
  47. /*
  48. * Define the number of bits in each fraction and exponent.
  49. *
  50. * k k+1
  51. * Note that 1.0 x 2 == 0.1 x 2 and that denorms are represented
  52. *
  53. * (-exp_bias+1)
  54. * as fractions that look like 0.fffff x 2 . This means that
  55. *
  56. * -126
  57. * the number 0.10000 x 2 , for instance, is the same as the normalized
  58. *
  59. * -127 -128
  60. * float 1.0 x 2 . Thus, to represent 2 , we need one leading zero
  61. *
  62. * -129
  63. * in the fraction; to represent 2 , we need two, and so on. This
  64. *
  65. * (-exp_bias-fracbits+1)
  66. * implies that the smallest denormalized number is 2
  67. *
  68. * for whichever format we are talking about: for single precision, for
  69. *
  70. * -126 -149
  71. * instance, we get .00000000000000000000001 x 2 , or 1.0 x 2 , and
  72. *
  73. * -149 == -127 - 23 + 1.
  74. */
  75. #include <sys/types.h>
  76. #define SNG_EXPBITS 8
  77. #define SNG_FRACBITS 23
  78. #define DBL_EXPBITS 11
  79. #define DBL_FRACHBITS 20
  80. #define DBL_FRACLBITS 32
  81. #define DBL_FRACBITS 52
  82. #define EXT_EXPBITS 15
  83. #define EXT_FRACHBITS 32
  84. #define EXT_FRACLBITS 32
  85. #define EXT_FRACBITS 64
  86. #define EXT_TO_ARRAY32(p, a) do { \
  87. (a)[0] = (uint32_t)(p)->ext_fracl; \
  88. (a)[1] = (uint32_t)(p)->ext_frach; \
  89. } while(0)
  90. struct ieee_single {
  91. u_int sng_frac:23;
  92. u_int sng_exp:8;
  93. u_int sng_sign:1;
  94. };
  95. struct ieee_double {
  96. u_int dbl_fracl;
  97. u_int dbl_frach:20;
  98. u_int dbl_exp:11;
  99. u_int dbl_sign:1;
  100. };
  101. struct ieee_ext {
  102. u_int ext_fracl;
  103. u_int ext_frach;
  104. u_int ext_exp:15;
  105. u_int ext_sign:1;
  106. u_int ext_padl:16;
  107. u_int ext_padh;
  108. };
  109. /*
  110. * Floats whose exponent is in [1..INFNAN) (of whatever type) are
  111. * `normal'. Floats whose exponent is INFNAN are either Inf or NaN.
  112. * Floats whose exponent is zero are either zero (iff all fraction
  113. * bits are zero) or subnormal values.
  114. *
  115. * A NaN is a `signalling NaN' if its QUIETNAN bit is clear in its
  116. * high fraction; if the bit is set, it is a `quiet NaN'.
  117. */
  118. #define SNG_EXP_INFNAN 255
  119. #define DBL_EXP_INFNAN 2047
  120. #define EXT_EXP_INFNAN 32767
  121. #if 0
  122. #define SNG_QUIETNAN (1 << 22)
  123. #define DBL_QUIETNAN (1 << 19)
  124. #define EXT_QUIETNAN (1 << 15)
  125. #endif
  126. /*
  127. * Exponent biases.
  128. */
  129. #define SNG_EXP_BIAS 127
  130. #define DBL_EXP_BIAS 1023
  131. #define EXT_EXP_BIAS 16383