/*
|
/*
|
FUNCTION
|
FUNCTION
|
<<div>>---divide two integers
|
<<div>>---divide two integers
|
|
|
INDEX
|
INDEX
|
div
|
div
|
|
|
ANSI_SYNOPSIS
|
ANSI_SYNOPSIS
|
#include <stdlib.h>
|
#include <stdlib.h>
|
div_t div(int <[n]>, int <[d]>);
|
div_t div(int <[n]>, int <[d]>);
|
|
|
TRAD_SYNOPSIS
|
TRAD_SYNOPSIS
|
#include <stdlib.h>
|
#include <stdlib.h>
|
div_t div(<[n]>, <[d]>)
|
div_t div(<[n]>, <[d]>)
|
int <[n]>, <[d]>;
|
int <[n]>, <[d]>;
|
|
|
DESCRIPTION
|
DESCRIPTION
|
Divide
|
Divide
|
@tex
|
@tex
|
$n/d$,
|
$n/d$,
|
@end tex
|
@end tex
|
@ifnottex
|
@ifnottex
|
<[n]>/<[d]>,
|
<[n]>/<[d]>,
|
@end ifnottex
|
@end ifnottex
|
returning quotient and remainder as two integers in a structure <<div_t>>.
|
returning quotient and remainder as two integers in a structure <<div_t>>.
|
|
|
RETURNS
|
RETURNS
|
The result is represented with the structure
|
The result is represented with the structure
|
|
|
. typedef struct
|
. typedef struct
|
. {
|
. {
|
. int quot;
|
. int quot;
|
. int rem;
|
. int rem;
|
. } div_t;
|
. } div_t;
|
|
|
where the <<quot>> field represents the quotient, and <<rem>> the
|
where the <<quot>> field represents the quotient, and <<rem>> the
|
remainder. For nonzero <[d]>, if `<<<[r]> = div(<[n]>,<[d]>);>>' then
|
remainder. For nonzero <[d]>, if `<<<[r]> = div(<[n]>,<[d]>);>>' then
|
<[n]> equals `<<<[r]>.rem + <[d]>*<[r]>.quot>>'.
|
<[n]> equals `<<<[r]>.rem + <[d]>*<[r]>.quot>>'.
|
|
|
To divide <<long>> rather than <<int>> values, use the similar
|
To divide <<long>> rather than <<int>> values, use the similar
|
function <<ldiv>>.
|
function <<ldiv>>.
|
|
|
PORTABILITY
|
PORTABILITY
|
<<div>> is ANSI.
|
<<div>> is ANSI.
|
|
|
No supporting OS subroutines are required.
|
No supporting OS subroutines are required.
|
*/
|
*/
|
|
|
/*
|
/*
|
* Copyright (c) 1990 Regents of the University of California.
|
* Copyright (c) 1990 Regents of the University of California.
|
* All rights reserved.
|
* All rights reserved.
|
*
|
*
|
* This code is derived from software contributed to Berkeley by
|
* This code is derived from software contributed to Berkeley by
|
* Chris Torek.
|
* Chris Torek.
|
*
|
*
|
* Redistribution and use in source and binary forms, with or without
|
* Redistribution and use in source and binary forms, with or without
|
* modification, are permitted provided that the following conditions
|
* modification, are permitted provided that the following conditions
|
* are met:
|
* are met:
|
* 1. Redistributions of source code must retain the above copyright
|
* 1. Redistributions of source code must retain the above copyright
|
* notice, this list of conditions and the following disclaimer.
|
* notice, this list of conditions and the following disclaimer.
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* 2. Redistributions in binary form must reproduce the above copyright
|
* notice, this list of conditions and the following disclaimer in the
|
* notice, this list of conditions and the following disclaimer in the
|
* documentation and/or other materials provided with the distribution.
|
* documentation and/or other materials provided with the distribution.
|
* 3. All advertising materials mentioning features or use of this software
|
* 3. All advertising materials mentioning features or use of this software
|
* must display the following acknowledgement:
|
* must display the following acknowledgement:
|
* This product includes software developed by the University of
|
* This product includes software developed by the University of
|
* California, Berkeley and its contributors.
|
* California, Berkeley and its contributors.
|
* 4. Neither the name of the University nor the names of its contributors
|
* 4. Neither the name of the University nor the names of its contributors
|
* may be used to endorse or promote products derived from this software
|
* may be used to endorse or promote products derived from this software
|
* without specific prior written permission.
|
* without specific prior written permission.
|
*
|
*
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
|
* SUCH DAMAGE.
|
* SUCH DAMAGE.
|
*/
|
*/
|
|
|
#include <_ansi.h>
|
#include <_ansi.h>
|
#include <stdlib.h> /* div_t */
|
#include <stdlib.h> /* div_t */
|
|
|
div_t
|
div_t
|
_DEFUN (div, (num, denom),
|
_DEFUN (div, (num, denom),
|
int num _AND
|
int num _AND
|
int denom)
|
int denom)
|
{
|
{
|
div_t r;
|
div_t r;
|
|
|
r.quot = num / denom;
|
r.quot = num / denom;
|
r.rem = num % denom;
|
r.rem = num % denom;
|
/*
|
/*
|
* The ANSI standard says that |r.quot| <= |n/d|, where
|
* The ANSI standard says that |r.quot| <= |n/d|, where
|
* n/d is to be computed in infinite precision. In other
|
* n/d is to be computed in infinite precision. In other
|
* words, we should always truncate the quotient towards
|
* words, we should always truncate the quotient towards
|
* 0, never -infinity or +infinity.
|
* 0, never -infinity or +infinity.
|
*
|
*
|
* Machine division and remainer may work either way when
|
* Machine division and remainer may work either way when
|
* one or both of n or d is negative. If only one is
|
* one or both of n or d is negative. If only one is
|
* negative and r.quot has been truncated towards -inf,
|
* negative and r.quot has been truncated towards -inf,
|
* r.rem will have the same sign as denom and the opposite
|
* r.rem will have the same sign as denom and the opposite
|
* sign of num; if both are negative and r.quot has been
|
* sign of num; if both are negative and r.quot has been
|
* truncated towards -inf, r.rem will be positive (will
|
* truncated towards -inf, r.rem will be positive (will
|
* have the opposite sign of num). These are considered
|
* have the opposite sign of num). These are considered
|
* `wrong'.
|
* `wrong'.
|
*
|
*
|
* If both are num and denom are positive, r will always
|
* If both are num and denom are positive, r will always
|
* be positive.
|
* be positive.
|
*
|
*
|
* This all boils down to:
|
* This all boils down to:
|
* if num >= 0, but r.rem < 0, we got the wrong answer.
|
* if num >= 0, but r.rem < 0, we got the wrong answer.
|
* In that case, to get the right answer, add 1 to r.quot and
|
* In that case, to get the right answer, add 1 to r.quot and
|
* subtract denom from r.rem.
|
* subtract denom from r.rem.
|
* if num < 0, but r.rem > 0, we also have the wrong answer.
|
* if num < 0, but r.rem > 0, we also have the wrong answer.
|
* In this case, to get the right answer, subtract 1 from r.quot and
|
* In this case, to get the right answer, subtract 1 from r.quot and
|
* add denom to r.rem.
|
* add denom to r.rem.
|
*/
|
*/
|
if (num >= 0 && r.rem < 0) {
|
if (num >= 0 && r.rem < 0) {
|
++r.quot;
|
++r.quot;
|
r.rem -= denom;
|
r.rem -= denom;
|
}
|
}
|
else if (num < 0 && r.rem > 0) {
|
else if (num < 0 && r.rem > 0) {
|
--r.quot;
|
--r.quot;
|
r.rem += denom;
|
r.rem += denom;
|
}
|
}
|
return (r);
|
return (r);
|
}
|
}
|
|
|
