1 /* Copyright (C) 1992, 1997 Free Software Foundation, Inc.
2 This file is part of the GNU C Library.
4 The GNU C Library is free software; you can redistribute it and/or
5 modify it under the terms of the GNU Lesser General Public
6 License as published by the Free Software Foundation; either
7 version 2.1 of the License, or (at your option) any later version.
9 The GNU C Library is distributed in the hope that it will be useful,
10 but WITHOUT ANY WARRANTY; without even the implied warranty of
11 MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
12 Lesser General Public License for more details.
14 You should have received a copy of the GNU Lesser General Public
15 License along with the GNU C Library; if not, see
16 <http://www.gnu.org/licenses/>. */
21 /* Return the `ldiv_t' representation of NUMER over DENOM. */
23 ldiv (long int numer, long int denom)
27 result.quot = numer / denom;
28 result.rem = numer % denom;
30 /* The ANSI standard says that |QUOT| <= |NUMER / DENOM|, where
31 NUMER / DENOM is to be computed in infinite precision. In
32 other words, we should always truncate the quotient towards
33 zero, never -infinity. Machine division and remainer may
34 work either way when one or both of NUMER or DENOM is
35 negative. If only one is negative and QUOT has been
36 truncated towards -infinity, REM will have the same sign as
37 DENOM and the opposite sign of NUMER; if both are negative
38 and QUOT has been truncated towards -infinity, REM will be
39 positive (will have the opposite sign of NUMER). These are
40 considered `wrong'. If both are NUM and DENOM are positive,
41 RESULT will always be positive. This all boils down to: if
42 NUMER >= 0, but REM < 0, we got the wrong answer. In that
43 case, to get the right answer, add 1 to QUOT and subtract
46 if (numer >= 0 && result.rem < 0)