lib/libc/quad/fixunsdfdi.c

   1 /*-
   2  * Copyright (c) 1992, 1993
   3  *      The Regents of the University of California.  All rights reserved.
   4  *
   5  * This software was developed by the Computer Systems Engineering group
   6  * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
   7  * contributed to Berkeley.
   8  *
   9  * Redistribution and use in source and binary forms, with or without
  10  * modification, are permitted provided that the following conditions
  11  * are met:
  12  * 1. Redistributions of source code must retain the above copyright
  13  *    notice, this list of conditions and the following disclaimer.
  14  * 2. Redistributions in binary form must reproduce the above copyright
  15  *    notice, this list of conditions and the following disclaimer in the
  16  *    documentation and/or other materials provided with the distribution.
  17  * 3. All advertising materials mentioning features or use of this software
  18  *    must display the following acknowledgement:
  19  *      This product includes software developed by the University of
  20  *      California, Berkeley and its contributors.
  21  * 4. Neither the name of the University nor the names of its contributors
  22  *    may be used to endorse or promote products derived from this software
  23  *    without specific prior written permission.
  24  *
  25  * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
  26  * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
  27  * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
  28  * ARE DISCLAIMED.  IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
  29  * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
  30  * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
  31  * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
  32  * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
  33  * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
  34  * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
  35  * SUCH DAMAGE.
  36  *
  37  * @(#)fixunsdfdi.c     8.1 (Berkeley) 6/4/93
  38  */
  39
  40 #include "quad.h"
  41
  42 #define ONE_FOURTH      (1 << (LONG_BITS - 2))
  43 #define ONE_HALF        (ONE_FOURTH * 2.0)
  44 #define ONE             (ONE_FOURTH * 4.0)
  45
  46 /*
  47  * Convert double to (unsigned) quad.
  48  * Not sure what to do with negative numbers---for now, anything out
  49  * of range becomes UQUAD_MAX.
  50  */
  51 u_quad_t
  52 __fixunsdfdi(x)
  53         double x;
  54 {
  55         double toppart;
  56         union uu t;
  57
  58         if (x < 0)
  59                 return (UQUAD_MAX);     /* ??? should be 0?  ERANGE??? */
  60 #ifdef notdef                           /* this falls afoul of a GCC bug */
  61         if (x >= UQUAD_MAX)
  62                 return (UQUAD_MAX);
  63 #else                                   /* so we wire in 2^64-1 instead */
  64         if (x >= 18446744073709551615.0)
  65                 return (UQUAD_MAX);
  66 #endif
  67         /*
  68          * Get the upper part of the result.  Note that the divide
  69          * may round up; we want to avoid this if possible, so we
  70          * subtract `1/2' first.
  71          */
  72         toppart = (x - ONE_HALF) / ONE;
  73         /*
  74          * Now build a u_quad_t out of the top part.  The difference
  75          * between x and this is the bottom part (this may introduce
  76          * a few fuzzy bits, but what the heck).  With any luck this
  77          * difference will be nonnegative: x should wind up in the
  78          * range [0..ULONG_MAX].  For paranoia, we assume [LONG_MIN..
  79          * 2*ULONG_MAX] instead.
  80          */
  81         t.ul[H] = (unsigned long)toppart;
  82         t.ul[L] = 0;
  83         x -= (double)t.uq;
  84         if (x < 0) {
  85                 t.ul[H]--;
  86                 x += ULONG_MAX;
  87         }
  88         if (x > ULONG_MAX) {
  89                 t.ul[H]++;
  90                 x -= ULONG_MAX;
  91         }
  92         t.ul[L] = (u_long)x;
  93         return (t.uq);
  94 }