blob: b58f1bfddc45530d981843909e1900491adee8a5 (
plain)
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
|
long
f (long x)
{
return x / (-0x7fffffffL - 1L);
}
long
r (long x)
{
return x % (-0x7fffffffL - 1L);
}
/* Since we have a negative divisor, this equation must hold for the
results of / and %; no specific results are guaranteed. */
long
std_eqn (long num, long denom, long quot, long rem)
{
/* For completeness, a check for "ABS (rem) < ABS (denom)" belongs here,
but causes trouble on 32-bit machines and isn't worthwhile. */
return quot * (-0x7fffffffL - 1L) + rem == num;
}
long nums[] =
{
-1L, 0x7fffffffL, -0x7fffffffL - 1L
};
main ()
{
int i;
for (i = 0;
i < sizeof (nums) / sizeof (nums[0]);
i++)
if (std_eqn (nums[i], -0x7fffffffL - 1L, f (nums[i]), r (nums[i])) == 0)
abort ();
exit (0);
}
|
