|
|
1.1 root 1: /*
2: * Copyright (c) 1990 Regents of the University of California.
3: * All rights reserved.
4: *
5: * This code is derived from software contributed to Berkeley by
6: * Chris Torek.
7: *
8: * Redistribution and use in source and binary forms are permitted
9: * provided that: (1) source distributions retain this entire copyright
10: * notice and comment, and (2) distributions including binaries display
11: * the following acknowledgement: ``This product includes software
12: * developed by the University of California, Berkeley and its contributors''
13: * in the documentation or other materials provided with the distribution
14: * and in all advertising materials mentioning features or use of this
15: * software. Neither the name of the University nor the names of its
16: * contributors may be used to endorse or promote products derived
17: * from this software without specific prior written permission.
18: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
19: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
20: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
21: */
22:
23: #if defined(LIBC_SCCS) && !defined(lint)
24: static char sccsid[] = "@(#)div.c 5.1 (Berkeley) 5/16/90";
25: #endif /* LIBC_SCCS and not lint */
26:
27: #include <stdlib.h> /* div_t */
28:
29: /*
30: * I AM NOT SURE THIS IS COMPLETELY PORTABLE
31: * (or that it is even right)
32: */
33: div_t
34: div(num, denom)
35: int num, denom;
36: {
37: div_t r;
38:
39: /* avoid deep thought */
40: if (num > 0 && denom < 0) {
41: num = -num;
42: denom = -denom;
43: }
44: r.quot = num / denom;
45: r.rem = num % denom;
46: if (num < 0 && denom > 0) {
47: /*
48: * Machine division and remainer may work either way. The
49: * ANSI standard says that |r.quot| < |n/d| (where n/d
50: * computed in infinite precision). If the remainder is
51: * positive, we got the `wrong' answer, so fix it.
52: */
53: if (r.rem > 0) {
54: r.quot++;
55: r.rem -= denom;
56: }
57: }
58: return (r);
59: }
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.