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