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