|
|
1.1 root 1: /*
2: * Copyright (c) 1988 Regents of the University of California.
3: * All rights reserved.
4: *
5: * Redistribution and use in source and binary forms are permitted
6: * provided that: (1) source distributions retain this entire copyright
7: * notice and comment, and (2) distributions including binaries display
8: * the following acknowledgement: ``This product includes software
9: * developed by the University of California, Berkeley and its contributors''
10: * in the documentation or other materials provided with the distribution
11: * and in all advertising materials mentioning features or use of this
12: * software. Neither the name of the University nor the names of its
13: * contributors may be used to endorse or promote products derived
14: * from this software without specific prior written permission.
15: * THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
16: * IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
17: * WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
18: *
19: * This code is derived from software contributed to Berkeley by
20: * Computer Consoles Inc.
21: */
22:
23: #if defined(LIBC_SCCS) && !defined(lint)
24: .asciz "@(#)udiv.s 1.5 (Berkeley) 6/1/90"
25: #endif /* LIBC_SCCS and not lint */
26:
27: /*
28: * Unsigned divide.
29: *
30: * udiv(dividend, divisor)
31: */
32: #include "DEFS.h"
33:
34: ASENTRY(udiv, 0)
35: bitl $0x80000000,8(fp) # if (divisor & 0x80000000){
36: jeql 1f
37: cmpl 8(fp),4(fp) # if (divisor > dividend )
38: jlequ 2f
39: clrl r0 # return(0);
40: ret
41: 2: # else
42: movl $1,r0 # return(1);}
43: ret
44: 1:
45: clrl r2 # return(dividend/divisor);
46: movl 4(fp),r3
47: ediv 8(fp),r2,r0,r1
48: ret
49:
50: /*
51: * audiv(dividendp, divisor) -- like udiv but uses address of dividend.
52: * Implements /= avoiding side effects in the dividend expression.
53: */
54: ASENTRY(audiv, 0)
55: bitl $0x80000000,8(fp) # if (divisor & 0x80000000){
56: jeql 1f
57: cmpl 8(fp),*4(fp) # if (divisor > dividend )
58: jlequ 2f
59: clrl r0 # return(0);
60: jbr 3f
61: 2: # else
62: movl $1,r0 # return(1);}
63: jbr 3f
64: 1:
65: clrl r2 # return(dividend/divisor);
66: movl *4(fp),r3
67: ediv 8(fp),r2,r0,r1
68: 3:
69: movl r0,*4(fp)
70: ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.