|
|
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 "@(#)urem.s 1.4 (Berkeley) 6/1/90" ! 25: #endif /* LIBC_SCCS and not lint */ ! 26: ! 27: /* ! 28: * Unsigned remainder. ! 29: * ! 30: * urem(dividend, divisor) ! 31: */ ! 32: #include "DEFS.h" ! 33: ! 34: ASENTRY(urem, 0) ! 35: bitl $0x80000000,8(fp) # if (divisor & 0x80000000){ ! 36: jeql 1f ! 37: movl 4(fp),r0 ! 38: cmpl 8(fp),r0 # if (divisor <= dividend ) ! 39: jgtru 2f ! 40: subl2 8(fp),r0 # return(dividend-divisor); ! 41: 2: # else return(dividend);} ! 42: ret ! 43: 1: ! 44: clrl r2 # return(dividend%divisor); ! 45: movl 4(fp),r3 ! 46: ediv 8(fp),r2,r1,r0 ! 47: ret ! 48: ! 49: /* ! 50: * aurem(dividendp, divisor) -- like urem but uses address of dividend. ! 51: * Implements %= avoiding side effects in the dividend expression. ! 52: */ ! 53: ASENTRY(aurem, 0) ! 54: bitl $0x80000000,8(fp) # if (divisor & 0x80000000){ ! 55: jeql 1f ! 56: movl *4(fp),r0 ! 57: cmpl 8(fp),r0 # if (divisor <= dividend ) ! 58: jgtru 2f ! 59: subl2 8(fp),r0 # return(dividend-divisor); ! 60: # else return(dividend);} ! 61: jbr 2f ! 62: 1: ! 63: clrl r2 # return(dividend%divisor); ! 64: movl *4(fp),r3 ! 65: ediv 8(fp),r2,r1,r0 ! 66: 2: ! 67: movl r0,*4(fp) ! 68: ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.