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