2N/A/*
2N/A * Copyright 2008 Sun Microsystems, Inc. All rights reserved.
2N/A * Use is subject to license terms.
2N/A */
2N/A
2N/A/*
2N/A * Copyright (c) 1990, 1993
2N/A * The Regents of the University of California. All rights reserved.
2N/A *
2N/A * This code is derived from software contributed to Berkeley by
2N/A * Chris Torek.
2N/A *
2N/A * Redistribution and use in source and binary forms, with or without
2N/A * modification, are permitted provided that the following conditions
2N/A * are met:
2N/A * 1. Redistributions of source code must retain the above copyright
2N/A * notice, this list of conditions and the following disclaimer.
2N/A * 2. Redistributions in binary form must reproduce the above copyright
2N/A * notice, this list of conditions and the following disclaimer in the
2N/A * documentation and/or other materials provided with the distribution.
2N/A * 3. All advertising materials mentioning features or use of this software
2N/A * must display the following acknowledgement:
2N/A * This product includes software developed by the University of
2N/A * California, Berkeley and its contributors.
2N/A * 4. Neither the name of the University nor the names of its contributors
2N/A * may be used to endorse or promote products derived from this software
2N/A * without specific prior written permission.
2N/A *
2N/A * THIS SOFTWARE IS PROVIDED BY THE REGENTS AND CONTRIBUTORS ``AS IS'' AND
2N/A * ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
2N/A * IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE
2N/A * ARE DISCLAIMED. IN NO EVENT SHALL THE REGENTS OR CONTRIBUTORS BE LIABLE
2N/A * FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, EXEMPLARY, OR CONSEQUENTIAL
2N/A * DAMAGES (INCLUDING, BUT NOT LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS
2N/A * OR SERVICES; LOSS OF USE, DATA, OR PROFITS; OR BUSINESS INTERRUPTION)
2N/A * HOWEVER CAUSED AND ON ANY THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT
2N/A * LIABILITY, OR TORT (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY
2N/A * OUT OF THE USE OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF
2N/A * SUCH DAMAGE.
2N/A */
2N/A
2N/A#pragma ident "%Z%%M% %I% %E% SMI"
2N/A
2N/A#include "lint.h"
2N/A#include <sys/types.h>
2N/A#include <stdlib.h>
2N/A
2N/Adiv_t
2N/Adiv(num, denom)
2N/A int num, denom;
2N/A{
2N/A div_t r;
2N/A
2N/A r.quot = num / denom;
2N/A r.rem = num % denom;
2N/A /*
2N/A * The ANSI standard says that |r.quot| <= |n/d|, where
2N/A * n/d is to be computed in infinite precision. In other
2N/A * words, we should always truncate the quotient towards
2N/A * 0, never -infinity.
2N/A *
2N/A * Machine division and remainer may work either way when
2N/A * one or both of n or d is negative. If only one is
2N/A * negative and r.quot has been truncated towards -inf,
2N/A * r.rem will have the same sign as denom and the opposite
2N/A * sign of num; if both are negative and r.quot has been
2N/A * truncated towards -inf, r.rem will be positive (will
2N/A * have the opposite sign of num). These are considered
2N/A * `wrong'.
2N/A *
2N/A * If both are num and denom are positive, r will always
2N/A * be positive.
2N/A *
2N/A * This all boils down to:
2N/A * if num >= 0, but r.rem < 0, we got the wrong answer.
2N/A * In that case, to get the right answer, add 1 to r.quot and
2N/A * subtract denom from r.rem.
2N/A */
2N/A if (num >= 0 && r.rem < 0) {
2N/A r.quot++;
2N/A r.rem -= denom;
2N/A }
2N/A return (r);
2N/A}
2N/A
2N/Aldiv_t
2N/Aldiv(num, denom)
2N/A long num, denom;
2N/A{
2N/A ldiv_t r;
2N/A
2N/A /* see div() for comments */
2N/A
2N/A r.quot = num / denom;
2N/A r.rem = num % denom;
2N/A if (num >= 0 && r.rem < 0) {
2N/A r.quot++;
2N/A r.rem -= denom;
2N/A }
2N/A return (r);
2N/A}