|
|
BSD 4.3reno
/*
* Copyright (c) 1988 Regents of the University of California.
* All rights reserved.
*
* Redistribution and use in source and binary forms are permitted
* provided that: (1) source distributions retain this entire copyright
* notice and comment, and (2) distributions including binaries display
* the following acknowledgement: ``This product includes software
* developed by the University of California, Berkeley and its contributors''
* in the documentation or other materials provided with the distribution
* and in all advertising materials mentioning features or use of this
* software. Neither the name of the University nor the names of its
* contributors may be used to endorse or promote products derived
* from this software without specific prior written permission.
* THIS SOFTWARE IS PROVIDED ``AS IS'' AND WITHOUT ANY EXPRESS OR
* IMPLIED WARRANTIES, INCLUDING, WITHOUT LIMITATION, THE IMPLIED
* WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR PURPOSE.
*
* This code is derived from software contributed to Berkeley by
* Computer Consoles Inc.
*/
#if defined(LIBC_SCCS) && !defined(lint)
.asciz "@(#)udiv.s 1.5 (Berkeley) 6/1/90"
#endif /* LIBC_SCCS and not lint */
/*
* Unsigned divide.
*
* udiv(dividend, divisor)
*/
#include "DEFS.h"
ASENTRY(udiv, 0)
bitl $0x80000000,8(fp) # if (divisor & 0x80000000){
jeql 1f
cmpl 8(fp),4(fp) # if (divisor > dividend )
jlequ 2f
clrl r0 # return(0);
ret
2: # else
movl $1,r0 # return(1);}
ret
1:
clrl r2 # return(dividend/divisor);
movl 4(fp),r3
ediv 8(fp),r2,r0,r1
ret
/*
* audiv(dividendp, divisor) -- like udiv but uses address of dividend.
* Implements /= avoiding side effects in the dividend expression.
*/
ASENTRY(audiv, 0)
bitl $0x80000000,8(fp) # if (divisor & 0x80000000){
jeql 1f
cmpl 8(fp),*4(fp) # if (divisor > dividend )
jlequ 2f
clrl r0 # return(0);
jbr 3f
2: # else
movl $1,r0 # return(1);}
jbr 3f
1:
clrl r2 # return(dividend/divisor);
movl *4(fp),r3
ediv 8(fp),r2,r0,r1
3:
movl r0,*4(fp)
ret
This archive runs on limited infrastructure. Preserving old code on modern bandwidth. Automated agents are requested to crawl responsibly.