1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
|
/* Test of modf*() function family.
Copyright (C) 2012-2016 Free Software Foundation, Inc.
This program is free software: you can redistribute it and/or modify
it under the terms of the GNU General Public License as published by
the Free Software Foundation; either version 3 of the License, or
(at your option) any later version.
This program is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
You should have received a copy of the GNU General Public License
along with this program. If not, see <http://www.gnu.org/licenses/>. */
static void
test_function (void)
{
int i;
const DOUBLE TWO_MANT_DIG =
/* Assume MANT_DIG <= 5 * 31.
Use the identity
n = floor(n/5) + floor((n+1)/5) + ... + floor((n+4)/5). */
(DOUBLE) (1U << ((MANT_DIG - 1) / 5))
* (DOUBLE) (1U << ((MANT_DIG - 1 + 1) / 5))
* (DOUBLE) (1U << ((MANT_DIG - 1 + 2) / 5))
* (DOUBLE) (1U << ((MANT_DIG - 1 + 3) / 5))
* (DOUBLE) (1U << ((MANT_DIG - 1 + 4) / 5));
/* Randomized tests. */
for (i = 0; i < SIZEOF (RANDOM); i++)
{
DOUBLE x = RANDOM[i]; /* 0.0 <= x < 1.0 */
DOUBLE y;
DOUBLE z;
y = MODF (x, &z);
ASSERT (z == L_(0.0));
ASSERT (y == x);
y = MODF (- x, &z);
ASSERT (z == L_(0.0));
ASSERT (y == - x);
y = MODF (L_(1.0) + x, &z);
ASSERT (z == L_(1.0));
y -= x;
ASSERT (y >= - L_(1.0) / TWO_MANT_DIG);
ASSERT (y <= L_(1.0) / TWO_MANT_DIG);
y = MODF (- L_(1.0) - x, &z);
ASSERT (z == - L_(1.0));
y -= - x;
ASSERT (y >= - L_(1.0) / TWO_MANT_DIG);
ASSERT (y <= L_(1.0) / TWO_MANT_DIG);
}
}
volatile DOUBLE x;
DOUBLE y;
DOUBLE z;
|
