compiler/stdc/math/s_fpclassify.c

   1 /*-
   2  * Copyright (c) 2004 David Schultz <das@FreeBSD.ORG>
   3  * All rights reserved.
   4  *
   5  * Redistribution and use in source and binary forms, with or without
   6  * modification, are permitted provided that the following conditions
   7  * are met:
   8  * 1. Redistributions of source code must retain the above copyright
   9  *    notice, this list of conditions and the following disclaimer.
  10  * 2. Redistributions in binary form must reproduce the above copyright
  11  *    notice, this list of conditions and the following disclaimer in the
  12  *    documentation and/or other materials provided with the distribution.
  13  *
  14  * THIS SOFTWARE IS PROVIDED BY THE AUTHOR AND CONTRIBUTORS ``AS IS'' AND
  15  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  16  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  17  * ARE DISCLAIMED.  IN NO EVENT SHALL THE AUTHOR OR CONTRIBUTORS BE LIABLE
  18  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  19  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  20  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  21  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  22  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  23  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  24  * SUCH DAMAGE.
  25  *
  26  * $FreeBSD$
  27  */
  28
  29 #include "math.h"
  30 #include "math_private.h"
  31
  32 #include "fpmath.h"
  33
  34 int
  35 __fpclassifyf(float f)
  36 {
  37         union IEEEf2bits u;
  38
  39         u.f = f;
  40         if (u.bits.exp == 255) {
  41            if (u.bits.man == 0) {
  42                    return FP_INFINITE;
  43            } else {
  44                    return FP_NAN;
  45            }
  46         } else if (u.bits.exp != 0) {
  47                 return FP_NORMAL;
  48         } else if (u.bits.man == 0) {
  49                 return FP_ZERO;
  50         } else {
  51                 return FP_SUBNORMAL;
  52         }
  53 }
  54
  55 int
  56 __fpclassifyd(double d)
  57 {
  58         union IEEEd2bits u;
  59
  60         u.d = d;
  61         if (u.bits.exp == 2047) {
  62                 if (u.bits.manl == 0 && u.bits.manh == 0) {
  63                         return FP_INFINITE;
  64                 } else {
  65                         return FP_NAN;
  66                 }
  67         } else if (u.bits.exp != 0) {
  68                 return FP_NORMAL;
  69         } else if (u.bits.manl == 0 && u.bits.manh == 0) {
  70                 return FP_ZERO;
  71         } else {
  72                 return FP_SUBNORMAL;
  73         }
  74 }
  75
  76 int
  77 __fpclassifyl(long double e)
  78 {
  79         union IEEEl2bits u;
  80
  81         u.e = e;
  82         mask_nbit_l(u);
  83         if (u.bits.exp == 32767) {
  84                 if (u.bits.manl == 0 && u.bits.manh == 0) {
  85                         return FP_INFINITE;
  86                 } else {
  87                         return FP_NAN;
  88                 }
  89         } else if (u.bits.exp != 0) {
  90                 return FP_NORMAL;
  91         } else if (u.bits.manl == 0 && u.bits.manh == 0) {
  92                 return FP_ZERO;
  93         } else {
  94                 return FP_SUBNORMAL;
  95         }
  96 }