1*84d9c625SLionel Sambuc /* $NetBSD: floatdidf.c,v 1.10 2013/02/03 01:48:53 matt Exp $ */
22fe8fb19SBen Gras
32fe8fb19SBen Gras /*-
42fe8fb19SBen Gras * Copyright (c) 1992, 1993
52fe8fb19SBen Gras * The Regents of the University of California. All rights reserved.
62fe8fb19SBen Gras *
72fe8fb19SBen Gras * This software was developed by the Computer Systems Engineering group
82fe8fb19SBen Gras * at Lawrence Berkeley Laboratory under DARPA contract BG 91-66 and
92fe8fb19SBen Gras * contributed to Berkeley.
102fe8fb19SBen Gras *
112fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
122fe8fb19SBen Gras * modification, are permitted provided that the following conditions
132fe8fb19SBen Gras * are met:
142fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
152fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
162fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
172fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
182fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
192fe8fb19SBen Gras * 3. Neither the name of the University nor the names of its contributors
202fe8fb19SBen Gras * may be used to endorse or promote products derived from this software
212fe8fb19SBen Gras * without specific prior written permission.
222fe8fb19SBen Gras *
232fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
242fe8fb19SBen Gras * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
252fe8fb19SBen Gras * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
262fe8fb19SBen Gras * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
272fe8fb19SBen Gras * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
282fe8fb19SBen Gras * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
292fe8fb19SBen Gras * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
302fe8fb19SBen Gras * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
312fe8fb19SBen Gras * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
322fe8fb19SBen Gras * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
332fe8fb19SBen Gras * SUCH DAMAGE.
342fe8fb19SBen Gras */
352fe8fb19SBen Gras
362fe8fb19SBen Gras #include <sys/cdefs.h>
372fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
382fe8fb19SBen Gras #if 0
392fe8fb19SBen Gras static char sccsid[] = "@(#)floatdidf.c 8.1 (Berkeley) 6/4/93";
402fe8fb19SBen Gras #else
41*84d9c625SLionel Sambuc __RCSID("$NetBSD: floatdidf.c,v 1.10 2013/02/03 01:48:53 matt Exp $");
422fe8fb19SBen Gras #endif
432fe8fb19SBen Gras #endif /* LIBC_SCCS and not lint */
442fe8fb19SBen Gras
45*84d9c625SLionel Sambuc #if defined(SOFTFLOAT) || defined(__ARM_EABI__)
46f14fb602SLionel Sambuc #include "softfloat/softfloat-for-gcc.h"
47f14fb602SLionel Sambuc #endif
48f14fb602SLionel Sambuc
492fe8fb19SBen Gras #include "quad.h"
502fe8fb19SBen Gras
512fe8fb19SBen Gras /*
522fe8fb19SBen Gras * Convert (signed) quad to double.
532fe8fb19SBen Gras */
542fe8fb19SBen Gras double
__floatdidf(quad_t x)55f14fb602SLionel Sambuc __floatdidf(quad_t x)
562fe8fb19SBen Gras {
572fe8fb19SBen Gras double d;
582fe8fb19SBen Gras union uu u;
592fe8fb19SBen Gras int neg;
602fe8fb19SBen Gras
612fe8fb19SBen Gras /*
622fe8fb19SBen Gras * Get an unsigned number first, by negating if necessary.
632fe8fb19SBen Gras */
642fe8fb19SBen Gras if (x < 0)
652fe8fb19SBen Gras u.q = -x, neg = 1;
662fe8fb19SBen Gras else
672fe8fb19SBen Gras u.q = x, neg = 0;
682fe8fb19SBen Gras
692fe8fb19SBen Gras /*
702fe8fb19SBen Gras * Now u.ul[H] has the factor of 2^32 (or whatever) and u.ul[L]
712fe8fb19SBen Gras * has the units. Ideally we could just set d, add INT_BITS to
722fe8fb19SBen Gras * its exponent, and then add the units, but this is portable
732fe8fb19SBen Gras * code and does not know how to get at an exponent. Machine-
742fe8fb19SBen Gras * specific code may be able to do this more efficiently.
752fe8fb19SBen Gras */
76f14fb602SLionel Sambuc d = (double)u.ul[H] * (((int)1 << (unsigned int)(INT_BITS - 2)) * 4.0);
772fe8fb19SBen Gras d += u.ul[L];
782fe8fb19SBen Gras
792fe8fb19SBen Gras return (neg ? -d : d);
802fe8fb19SBen Gras }
81