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