sl@0: /*--------------------------------------------------------------------
sl@0:  *© Portions copyright (c) 2006 Nokia Corporation.  All rights reserved.
sl@0:  *--------------------------------------------------------------------
sl@0: */
sl@0: /*-
sl@0:  * Copyright (c) 2003 Mike Barcroft <mike@FreeBSD.org>
sl@0:  * Copyright (c) 2002, 2003 David Schultz <das@FreeBSD.ORG>
sl@0:  * All rights reserved.
sl@0:  *
sl@0:  * Redistribution and use in source and binary forms, with or without
sl@0:  * modification, are permitted provided that the following conditions
sl@0:  * are met:
sl@0:  * 1. Redistributions of source code must retain the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer.
sl@0:  * 2. Redistributions in binary form must reproduce the above copyright
sl@0:  *    notice, this list of conditions and the following disclaimer in the
sl@0:  *    documentation and/or other materials provided with the distribution.
sl@0:  *
sl@0:  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
sl@0:  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
sl@0:  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
sl@0:  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
sl@0:  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
sl@0:  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
sl@0:  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
sl@0:  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
sl@0:  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
sl@0:  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
sl@0:  * SUCH DAMAGE.
sl@0:  *
sl@0:  * $FreeBSD: src/lib/libc/gen/fpclassify.c,v 1.2 2005/02/06 03:23:31 das Exp $
sl@0:  */
sl@0: 
sl@0: #include <sys/endian.h>
sl@0: 
sl@0: #include <math.h>
sl@0: #include <stdint.h>
sl@0: 
sl@0: #include "fpmath.h"
sl@0: 
sl@0: 
sl@0: EXPORT_C int __fpclassifyf(float f)
sl@0: {
sl@0: 	union IEEEf2bits u;
sl@0: 
sl@0: 	u.f = f;
sl@0: 	if (u.bits.exp == 0) {
sl@0: 		if (u.bits.man == 0)
sl@0: 			return (FP_ZERO);
sl@0: 		return (FP_SUBNORMAL);
sl@0: 	}
sl@0: 	if (u.bits.exp == 255) {
sl@0: 		if (u.bits.man == 0)
sl@0: 			return (FP_INFINITE);
sl@0: 		return (FP_NAN);
sl@0: 	}
sl@0: 	return (FP_NORMAL);
sl@0: }
sl@0: 
sl@0: EXPORT_C int __fpclassifyd(double d)
sl@0: {
sl@0: 	union IEEEd2bits u;
sl@0: 
sl@0: 	u.d = d;
sl@0: 	if (u.bits.exp == 0) {
sl@0: 		if ((u.bits.manl | u.bits.manh) == 0)
sl@0: 			return (FP_ZERO);
sl@0: 		return (FP_SUBNORMAL);
sl@0: 	}
sl@0: 	if (u.bits.exp == 2047) {
sl@0: 		if ((u.bits.manl | u.bits.manh) == 0)
sl@0: 			return (FP_INFINITE);
sl@0: 		return (FP_NAN);
sl@0: 	}
sl@0: 	return (FP_NORMAL);
sl@0: }
sl@0: 
sl@0: 
sl@0: EXPORT_C int __fpclassifyl(long double e)
sl@0: {
sl@0: 	union IEEEl2bits u;
sl@0: 
sl@0: 	u.e = e;
sl@0: 	if (u.bits.exp == 0) {
sl@0: 		if ((u.bits.manl | u.bits.manh) == 0)
sl@0: 			return (FP_ZERO);
sl@0: 		return (FP_SUBNORMAL);
sl@0: 	}
sl@0: 	mask_nbit_l(u);		/* Mask normalization bit if applicable. */
sl@0: 	if (u.bits.exp == 32767) {
sl@0: 		if ((u.bits.manl | u.bits.manh) == 0)
sl@0: 			return (FP_INFINITE);
sl@0: 		return (FP_NAN);
sl@0: 	}
sl@0: 	return (FP_NORMAL);
sl@0: }
sl@0: