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