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