1*f14fb602SLionel Sambuc /* $NetBSD: div.c,v 1.8 2012/06/25 22:32:45 abs Exp $ */
22fe8fb19SBen Gras
32fe8fb19SBen Gras /*
42fe8fb19SBen Gras * Copyright (c) 1990, 1993
52fe8fb19SBen Gras * The Regents of the University of California. All rights reserved.
62fe8fb19SBen Gras *
72fe8fb19SBen Gras * This code is derived from software contributed to Berkeley by
82fe8fb19SBen Gras * Chris Torek.
92fe8fb19SBen Gras *
102fe8fb19SBen Gras * Redistribution and use in source and binary forms, with or without
112fe8fb19SBen Gras * modification, are permitted provided that the following conditions
122fe8fb19SBen Gras * are met:
132fe8fb19SBen Gras * 1. Redistributions of source code must retain the above copyright
142fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer.
152fe8fb19SBen Gras * 2. Redistributions in binary form must reproduce the above copyright
162fe8fb19SBen Gras * notice, this list of conditions and the following disclaimer in the
172fe8fb19SBen Gras * documentation and/or other materials provided with the distribution.
182fe8fb19SBen Gras * 3. Neither the name of the University nor the names of its contributors
192fe8fb19SBen Gras * may be used to endorse or promote products derived from this software
202fe8fb19SBen Gras * without specific prior written permission.
212fe8fb19SBen Gras *
222fe8fb19SBen Gras * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
232fe8fb19SBen Gras * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
242fe8fb19SBen Gras * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
252fe8fb19SBen Gras * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
262fe8fb19SBen Gras * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
272fe8fb19SBen Gras * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
282fe8fb19SBen Gras * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
292fe8fb19SBen Gras * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
302fe8fb19SBen Gras * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
312fe8fb19SBen Gras * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
322fe8fb19SBen Gras * SUCH DAMAGE.
332fe8fb19SBen Gras */
342fe8fb19SBen Gras
352fe8fb19SBen Gras #include <sys/cdefs.h>
362fe8fb19SBen Gras #if defined(LIBC_SCCS) && !defined(lint)
372fe8fb19SBen Gras #if 0
382fe8fb19SBen Gras static char sccsid[] = "@(#)div.c 8.1 (Berkeley) 6/4/93";
392fe8fb19SBen Gras #else
40*f14fb602SLionel Sambuc __RCSID("$NetBSD: div.c,v 1.8 2012/06/25 22:32:45 abs Exp $");
412fe8fb19SBen Gras #endif
422fe8fb19SBen Gras #endif /* LIBC_SCCS and not lint */
432fe8fb19SBen Gras
442fe8fb19SBen Gras #include <stdlib.h> /* div_t */
452fe8fb19SBen Gras
462fe8fb19SBen Gras div_t
div(int num,int denom)47*f14fb602SLionel Sambuc div(int num, int denom)
482fe8fb19SBen Gras {
492fe8fb19SBen Gras div_t r;
502fe8fb19SBen Gras
512fe8fb19SBen Gras r.quot = num / denom;
522fe8fb19SBen Gras r.rem = num % denom;
532fe8fb19SBen Gras /*
542fe8fb19SBen Gras * The ANSI standard says that |r.quot| <= |n/d|, where
552fe8fb19SBen Gras * n/d is to be computed in infinite precision. In other
562fe8fb19SBen Gras * words, we should always truncate the quotient towards
572fe8fb19SBen Gras * 0, never -infinity.
582fe8fb19SBen Gras *
592fe8fb19SBen Gras * Machine division and remainer may work either way when
602fe8fb19SBen Gras * one or both of n or d is negative. If only one is
612fe8fb19SBen Gras * negative and r.quot has been truncated towards -inf,
622fe8fb19SBen Gras * r.rem will have the same sign as denom and the opposite
632fe8fb19SBen Gras * sign of num; if both are negative and r.quot has been
642fe8fb19SBen Gras * truncated towards -inf, r.rem will be positive (will
652fe8fb19SBen Gras * have the opposite sign of num). These are considered
662fe8fb19SBen Gras * `wrong'.
672fe8fb19SBen Gras *
682fe8fb19SBen Gras * If both are num and denom are positive, r will always
692fe8fb19SBen Gras * be positive.
702fe8fb19SBen Gras *
712fe8fb19SBen Gras * This all boils down to:
722fe8fb19SBen Gras * if num >= 0, but r.rem < 0, we got the wrong answer.
732fe8fb19SBen Gras * In that case, to get the right answer, add 1 to r.quot and
742fe8fb19SBen Gras * subtract denom from r.rem.
752fe8fb19SBen Gras */
762fe8fb19SBen Gras if (num >= 0 && r.rem < 0) {
772fe8fb19SBen Gras r.quot++;
782fe8fb19SBen Gras r.rem -= denom;
792fe8fb19SBen Gras }
802fe8fb19SBen Gras return (r);
812fe8fb19SBen Gras }
82