arch/mips/math-emu/sp_sqrt.c

   1 /* IEEE754 floating point arithmetic
   2  * single precision square root
   3  */
   4 /*
   5  * MIPS floating point support
   6  * Copyright (C) 1994-2000 Algorithmics Ltd.
   7  *
   8  *  This program is free software; you can distribute it and/or modify it
   9  *  under the terms of the GNU General Public License (Version 2) as
  10  *  published by the Free Software Foundation.
  11  *
  12  *  This program is distributed in the hope it will be useful, but WITHOUT
  13  *  ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or
  14  *  FITNESS FOR A PARTICULAR PURPOSE.  See the GNU General Public License
  15  *  for more details.
  16  *
  17  *  You should have received a copy of the GNU General Public License along
  18  *  with this program; if not, write to the Free Software Foundation, Inc.,
  19  *  51 Franklin St, Fifth Floor, Boston, MA  02110-1301  USA.
  20  */
  21
  22 #include "ieee754sp.h"
  23
  24 union ieee754sp ieee754sp_sqrt(union ieee754sp x)
  25 {
  26         int ix, s, q, m, t, i;
  27         unsigned int r;
  28         COMPXSP;
  29
  30         /* take care of Inf and NaN */
  31
  32         EXPLODEXSP;
  33         ieee754_clearcx();
  34         FLUSHXSP;
  35
  36         /* x == INF or NAN? */
  37         switch (xc) {
  38         case IEEE754_CLASS_QNAN:
  39                 /* sqrt(Nan) = Nan */
  40                 return ieee754sp_nanxcpt(x);
  41
  42         case IEEE754_CLASS_SNAN:
  43                 ieee754_setcx(IEEE754_INVALID_OPERATION);
  44                 return ieee754sp_nanxcpt(ieee754sp_indef());
  45
  46         case IEEE754_CLASS_ZERO:
  47                 /* sqrt(0) = 0 */
  48                 return x;
  49
  50         case IEEE754_CLASS_INF:
  51                 if (xs) {
  52                         /* sqrt(-Inf) = Nan */
  53                         ieee754_setcx(IEEE754_INVALID_OPERATION);
  54                         return ieee754sp_nanxcpt(ieee754sp_indef());
  55                 }
  56                 /* sqrt(+Inf) = Inf */
  57                 return x;
  58
  59         case IEEE754_CLASS_DNORM:
  60         case IEEE754_CLASS_NORM:
  61                 if (xs) {
  62                         /* sqrt(-x) = Nan */
  63                         ieee754_setcx(IEEE754_INVALID_OPERATION);
  64                         return ieee754sp_nanxcpt(ieee754sp_indef());
  65                 }
  66                 break;
  67         }
  68
  69         ix = x.bits;
  70
  71         /* normalize x */
  72         m = (ix >> 23);
  73         if (m == 0) {           /* subnormal x */
  74                 for (i = 0; (ix & 0x00800000) == 0; i++)
  75                         ix <<= 1;
  76                 m -= i - 1;
  77         }
  78         m -= 127;               /* unbias exponent */
  79         ix = (ix & 0x007fffff) | 0x00800000;
  80         if (m & 1)              /* odd m, double x to make it even */
  81                 ix += ix;
  82         m >>= 1;                /* m = [m/2] */
  83
  84         /* generate sqrt(x) bit by bit */
  85         ix += ix;
  86         q = s = 0;              /* q = sqrt(x) */
  87         r = 0x01000000;         /* r = moving bit from right to left */
  88
  89         while (r != 0) {
  90                 t = s + r;
  91                 if (t <= ix) {
  92                         s = t + r;
  93                         ix -= t;
  94                         q += r;
  95                 }
  96                 ix += ix;
  97                 r >>= 1;
  98         }
  99
 100         if (ix != 0) {
 101                 ieee754_setcx(IEEE754_INEXACT);
 102                 switch (ieee754_csr.rm) {
 103                 case FPU_CSR_RU:
 104                         q += 2;
 105                         break;
 106                 case FPU_CSR_RN:
 107                         q += (q & 1);
 108                         break;
 109                 }
 110         }
 111         ix = (q >> 1) + 0x3f000000;
 112         ix += (m << 23);
 113         x.bits = ix;
 114         return x;
 115 }