4 return x / (-0x7fffffffL - 1L);
10 return x % (-0x7fffffffL - 1L);
13 /* Since we have a negative divisor, this equation must hold for the
14 results of / and %; no specific results are guaranteed. */
16 std_eqn (long num, long denom, long quot, long rem)
18 /* For completeness, a check for "ABS (rem) < ABS (denom)" belongs here,
19 but causes trouble on 32-bit machines and isn't worthwhile. */
20 return quot * (-0x7fffffffL - 1L) + rem == num;
25 -1L, 0x7fffffffL, -0x7fffffffL - 1L
33 i < sizeof (nums) / sizeof (nums[0]);
35 if (std_eqn (nums[i], -0x7fffffffL - 1L, f (nums[i]), r (nums[i])) == 0)