11573Srgrimes/*- 21573Srgrimes * Copyright (c) 1992, 1993 31573Srgrimes * The Regents of the University of California. All rights reserved. 41573Srgrimes * 51573Srgrimes * This software was developed by the Computer Systems Engineering group 61573Srgrimes * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and 71573Srgrimes * contributed to Berkeley. 81573Srgrimes * 91573Srgrimes * Redistribution and use in source and binary forms, with or without 101573Srgrimes * modification, are permitted provided that the following conditions 111573Srgrimes * are met: 121573Srgrimes * 1. Redistributions of source code must retain the above copyright 131573Srgrimes * notice, this list of conditions and the following disclaimer. 141573Srgrimes * 2. Redistributions in binary form must reproduce the above copyright 151573Srgrimes * notice, this list of conditions and the following disclaimer in the 161573Srgrimes * documentation and/or other materials provided with the distribution. 171573Srgrimes * 4. Neither the name of the University nor the names of its contributors 181573Srgrimes * may be used to endorse or promote products derived from this software 191573Srgrimes * without specific prior written permission. 201573Srgrimes * 211573Srgrimes * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND 221573Srgrimes * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE 231573Srgrimes * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE 241573Srgrimes * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE 251573Srgrimes * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL 261573Srgrimes * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS 271573Srgrimes * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION) 281573Srgrimes * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT 291573Srgrimes * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY 301573Srgrimes * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF 311573Srgrimes * SUCH DAMAGE. 321573Srgrimes */ 331573Srgrimes 341573Srgrimes#if defined(LIBC_SCCS) && !defined(lint) 351573Srgrimesstatic char sccsid[] = "@(#)fixunssfdi.c 8.1 (Berkeley) 6/4/93"; 361573Srgrimes#endif /* LIBC_SCCS and not lint */ 3792986Sobrien#include <sys/cdefs.h> 3892986Sobrien__FBSDID("$FreeBSD$"); 391573Srgrimes 401573Srgrimes#include "quad.h" 411573Srgrimes 421573Srgrimes#define ONE_FOURTH (1 << (LONG_BITS - 2)) 431573Srgrimes#define ONE_HALF (ONE_FOURTH * 2.0) 441573Srgrimes#define ONE (ONE_FOURTH * 4.0) 451573Srgrimes 461573Srgrimes/* 471573Srgrimes * Convert float to (unsigned) quad. We do most of our work in double, 481573Srgrimes * out of sheer paranoia. 491573Srgrimes * 501573Srgrimes * Not sure what to do with negative numbers---for now, anything out 511573Srgrimes * of range becomes UQUAD_MAX. 521573Srgrimes * 531573Srgrimes * N.B.: must use new ANSI syntax (sorry). 541573Srgrimes */ 551573Srgrimesu_quad_t 561573Srgrimes__fixunssfdi(float f) 571573Srgrimes{ 581573Srgrimes double x, toppart; 591573Srgrimes union uu t; 601573Srgrimes 611573Srgrimes if (f < 0) 621573Srgrimes return (UQUAD_MAX); /* ??? should be 0? ERANGE??? */ 631573Srgrimes#ifdef notdef /* this falls afoul of a GCC bug */ 641573Srgrimes if (f >= UQUAD_MAX) 651573Srgrimes return (UQUAD_MAX); 661573Srgrimes#else /* so we wire in 2^64-1 instead */ 671573Srgrimes if (f >= 18446744073709551615.0) 681573Srgrimes return (UQUAD_MAX); 691573Srgrimes#endif 701573Srgrimes x = f; 711573Srgrimes /* 721573Srgrimes * Get the upper part of the result. Note that the divide 731573Srgrimes * may round up; we want to avoid this if possible, so we 741573Srgrimes * subtract `1/2' first. 751573Srgrimes */ 761573Srgrimes toppart = (x - ONE_HALF) / ONE; 771573Srgrimes /* 781573Srgrimes * Now build a u_quad_t out of the top part. The difference 791573Srgrimes * between x and this is the bottom part (this may introduce 801573Srgrimes * a few fuzzy bits, but what the heck). With any luck this 811573Srgrimes * difference will be nonnegative: x should wind up in the 821573Srgrimes * range [0..ULONG_MAX]. For paranoia, we assume [LONG_MIN.. 831573Srgrimes * 2*ULONG_MAX] instead. 841573Srgrimes */ 851573Srgrimes t.ul[H] = (unsigned long)toppart; 861573Srgrimes t.ul[L] = 0; 871573Srgrimes x -= (double)t.uq; 881573Srgrimes if (x < 0) { 891573Srgrimes t.ul[H]--; 901573Srgrimes x += ULONG_MAX; 911573Srgrimes } 921573Srgrimes if (x > ULONG_MAX) { 931573Srgrimes t.ul[H]++; 941573Srgrimes x -= ULONG_MAX; 951573Srgrimes } 961573Srgrimes t.ul[L] = (u_long)x; 971573Srgrimes return (t.uq); 981573Srgrimes} 99