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[] = "@(#)fixunsdfdi.c	8.1 (Berkeley) 6/4/93";
361573Srgrimes#endif /* LIBC_SCCS and not lint */
3792986Sobrien#include <sys/cdefs.h>
3892986Sobrien__FBSDID("$FreeBSD: stable/11/lib/libc/quad/fixunsdfdi.c 358230 2020-02-21 21:57:24Z dim $");
391573Srgrimes
401573Srgrimes#include "quad.h"
411573Srgrimes
42358230Sdim#define	ONE_FOURTH	(1L << (LONG_BITS - 2))
431573Srgrimes#define	ONE_HALF	(ONE_FOURTH * 2.0)
441573Srgrimes#define	ONE		(ONE_FOURTH * 4.0)
451573Srgrimes
461573Srgrimes/*
471573Srgrimes * Convert double to (unsigned) quad.
481573Srgrimes * Not sure what to do with negative numbers---for now, anything out
491573Srgrimes * of range becomes UQUAD_MAX.
501573Srgrimes */
511573Srgrimesu_quad_t
521573Srgrimes__fixunsdfdi(x)
531573Srgrimes	double x;
541573Srgrimes{
551573Srgrimes	double toppart;
561573Srgrimes	union uu t;
571573Srgrimes
581573Srgrimes	if (x < 0)
591573Srgrimes		return (UQUAD_MAX);	/* ??? should be 0?  ERANGE??? */
601573Srgrimes#ifdef notdef				/* this falls afoul of a GCC bug */
611573Srgrimes	if (x >= UQUAD_MAX)
621573Srgrimes		return (UQUAD_MAX);
631573Srgrimes#else					/* so we wire in 2^64-1 instead */
641573Srgrimes	if (x >= 18446744073709551615.0)
651573Srgrimes		return (UQUAD_MAX);
661573Srgrimes#endif
671573Srgrimes	/*
681573Srgrimes	 * Get the upper part of the result.  Note that the divide
691573Srgrimes	 * may round up; we want to avoid this if possible, so we
701573Srgrimes	 * subtract `1/2' first.
711573Srgrimes	 */
721573Srgrimes	toppart = (x - ONE_HALF) / ONE;
731573Srgrimes	/*
741573Srgrimes	 * Now build a u_quad_t out of the top part.  The difference
751573Srgrimes	 * between x and this is the bottom part (this may introduce
761573Srgrimes	 * a few fuzzy bits, but what the heck).  With any luck this
771573Srgrimes	 * difference will be nonnegative: x should wind up in the
781573Srgrimes	 * range [0..ULONG_MAX].  For paranoia, we assume [LONG_MIN..
791573Srgrimes	 * 2*ULONG_MAX] instead.
801573Srgrimes	 */
811573Srgrimes	t.ul[H] = (unsigned long)toppart;
821573Srgrimes	t.ul[L] = 0;
831573Srgrimes	x -= (double)t.uq;
841573Srgrimes	if (x < 0) {
851573Srgrimes		t.ul[H]--;
86358230Sdim		x += (double)ULONG_MAX;
871573Srgrimes	}
88358230Sdim	if (x > (double)ULONG_MAX) {
891573Srgrimes		t.ul[H]++;
90358230Sdim		x -= (double)ULONG_MAX;
911573Srgrimes	}
921573Srgrimes	t.ul[L] = (u_long)x;
931573Srgrimes	return (t.uq);
941573Srgrimes}
95