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