1*8a6a9560SDaniel Boulby /*- 2*8a6a9560SDaniel Boulby * Copyright (c) 1989 Regents of the University of California. 3*8a6a9560SDaniel Boulby * All rights reserved. 4*8a6a9560SDaniel Boulby * 5*8a6a9560SDaniel Boulby * Redistribution and use in source and binary forms, with or without 6*8a6a9560SDaniel Boulby * modification, are permitted provided that the following conditions 7*8a6a9560SDaniel Boulby * are met: 8*8a6a9560SDaniel Boulby * 1. Redistributions of source code must retain the above copyright 9*8a6a9560SDaniel Boulby * notice, this list of conditions and the following disclaimer. 10*8a6a9560SDaniel Boulby * 2. Redistributions in binary form must reproduce the above copyright 11*8a6a9560SDaniel Boulby * notice, this list of conditions and the following disclaimer in the 12*8a6a9560SDaniel Boulby * documentation and/or other materials provided with the distribution. 13*8a6a9560SDaniel Boulby * 3. Neither the name of the University nor the names of its contributors 14*8a6a9560SDaniel Boulby * may be used to endorse or promote products derived from this software 15*8a6a9560SDaniel Boulby * without specific prior written permission. 16*8a6a9560SDaniel Boulby * 17*8a6a9560SDaniel Boulby * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 18*8a6a9560SDaniel Boulby * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 19*8a6a9560SDaniel Boulby * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 20*8a6a9560SDaniel Boulby * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 21*8a6a9560SDaniel Boulby * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 22*8a6a9560SDaniel Boulby * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 23*8a6a9560SDaniel Boulby * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 24*8a6a9560SDaniel Boulby * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 25*8a6a9560SDaniel Boulby * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 26*8a6a9560SDaniel Boulby * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 27*8a6a9560SDaniel Boulby * SUCH DAMAGE. 28*8a6a9560SDaniel Boulby * 29*8a6a9560SDaniel Boulby * from: @(#)float.h 7.1 (Berkeley) 5/8/90 30*8a6a9560SDaniel Boulby * $FreeBSD$ 31*8a6a9560SDaniel Boulby */ 32*8a6a9560SDaniel Boulby 33*8a6a9560SDaniel Boulby #ifndef _MACHINE_FLOAT_H_ 34*8a6a9560SDaniel Boulby #define _MACHINE_FLOAT_H_ 35*8a6a9560SDaniel Boulby 36*8a6a9560SDaniel Boulby #include <sys/cdefs.h> 37*8a6a9560SDaniel Boulby 38*8a6a9560SDaniel Boulby __BEGIN_DECLS 39*8a6a9560SDaniel Boulby extern int __flt_rounds(void); 40*8a6a9560SDaniel Boulby __END_DECLS 41*8a6a9560SDaniel Boulby 42*8a6a9560SDaniel Boulby #define FLT_RADIX 2 /* b */ 43*8a6a9560SDaniel Boulby #define FLT_ROUNDS __flt_rounds() 44*8a6a9560SDaniel Boulby #if __ISO_C_VISIBLE >= 1999 45*8a6a9560SDaniel Boulby #define FLT_EVAL_METHOD 0 46*8a6a9560SDaniel Boulby #define DECIMAL_DIG 17 /* max precision in decimal digits */ 47*8a6a9560SDaniel Boulby #endif 48*8a6a9560SDaniel Boulby 49*8a6a9560SDaniel Boulby #define FLT_MANT_DIG 24 /* p */ 50*8a6a9560SDaniel Boulby #define FLT_EPSILON 1.19209290E-07F /* b**(1-p) */ 51*8a6a9560SDaniel Boulby #define FLT_DIG 6 /* floor((p-1)*log10(b))+(b == 10) */ 52*8a6a9560SDaniel Boulby #define FLT_MIN_EXP (-125) /* emin */ 53*8a6a9560SDaniel Boulby #define FLT_MIN 1.17549435E-38F /* b**(emin-1) */ 54*8a6a9560SDaniel Boulby #define FLT_MIN_10_EXP (-37) /* ceil(log10(b**(emin-1))) */ 55*8a6a9560SDaniel Boulby #define FLT_MAX_EXP 128 /* emax */ 56*8a6a9560SDaniel Boulby #define FLT_MAX 3.40282347E+38F /* (1-b**(-p))*b**emax */ 57*8a6a9560SDaniel Boulby #define FLT_MAX_10_EXP 38 /* floor(log10((1-b**(-p))*b**emax)) */ 58*8a6a9560SDaniel Boulby #if __ISO_C_VISIBLE >= 2011 59*8a6a9560SDaniel Boulby #define FLT_TRUE_MIN 1.40129846E-45F /* b**(emin-p) */ 60*8a6a9560SDaniel Boulby #define FLT_DECIMAL_DIG 9 /* ceil(1+p*log10(b)) */ 61*8a6a9560SDaniel Boulby #define FLT_HAS_SUBNORM 1 62*8a6a9560SDaniel Boulby #endif /* __ISO_C_VISIBLE >= 2011 */ 63*8a6a9560SDaniel Boulby 64*8a6a9560SDaniel Boulby #define DBL_MANT_DIG 53 65*8a6a9560SDaniel Boulby #define DBL_EPSILON 2.2204460492503131E-16 66*8a6a9560SDaniel Boulby #define DBL_DIG 15 67*8a6a9560SDaniel Boulby #define DBL_MIN_EXP (-1021) 68*8a6a9560SDaniel Boulby #define DBL_MIN 2.2250738585072014E-308 69*8a6a9560SDaniel Boulby #define DBL_MIN_10_EXP (-307) 70*8a6a9560SDaniel Boulby #define DBL_MAX_EXP 1024 71*8a6a9560SDaniel Boulby #define DBL_MAX 1.7976931348623157E+308 72*8a6a9560SDaniel Boulby #define DBL_MAX_10_EXP 308 73*8a6a9560SDaniel Boulby #if __ISO_C_VISIBLE >= 2011 74*8a6a9560SDaniel Boulby #define DBL_TRUE_MIN 4.9406564584124654E-324 75*8a6a9560SDaniel Boulby #define DBL_DECIMAL_DIG 17 76*8a6a9560SDaniel Boulby #define DBL_HAS_SUBNORM 1 77*8a6a9560SDaniel Boulby #endif /* __ISO_C_VISIBLE >= 2011 */ 78*8a6a9560SDaniel Boulby 79*8a6a9560SDaniel Boulby #define LDBL_MANT_DIG 113 80*8a6a9560SDaniel Boulby #define LDBL_EPSILON 1.925929944387235853055977942584927319E-34L 81*8a6a9560SDaniel Boulby #define LDBL_DIG 33 82*8a6a9560SDaniel Boulby #define LDBL_MIN_EXP (-16381) 83*8a6a9560SDaniel Boulby #define LDBL_MIN 3.362103143112093506262677817321752603E-4932L 84*8a6a9560SDaniel Boulby #define LDBL_MIN_10_EXP (-4931) 85*8a6a9560SDaniel Boulby #define LDBL_MAX_EXP (+16384) 86*8a6a9560SDaniel Boulby #define LDBL_MAX 1.189731495357231765085759326628007016E+4932L 87*8a6a9560SDaniel Boulby #define LDBL_MAX_10_EXP (+4932) 88*8a6a9560SDaniel Boulby #if __ISO_C_VISIBLE >= 2011 89*8a6a9560SDaniel Boulby #define LDBL_TRUE_MIN 6.475175119438025110924438958227646552E-4966L 90*8a6a9560SDaniel Boulby #define LDBL_DECIMAL_DIG 36 91*8a6a9560SDaniel Boulby #define LDBL_HAS_SUBNORM 1 92*8a6a9560SDaniel Boulby #endif /* __ISO_C_VISIBLE >= 2011 */ 93*8a6a9560SDaniel Boulby 94*8a6a9560SDaniel Boulby #endif /* _MACHINE_FLOAT_H_ */ 95