1995-02-18 04:14:40 +08:00
|
|
|
/* This file is generated from divrem.m4; DO NOT EDIT! */
|
|
|
|
|
/* For each N divided by D, we do:
|
|
|
|
|
result = (double) N / (double) D
|
|
|
|
|
Then, for each N mod D, we do:
|
|
|
|
|
result = N - (D * divMODE (N, D))
|
|
|
|
|
|
|
|
|
|
FIXME:
|
|
|
|
|
The q and qu versions won't deal with operands > 50 bits. We also
|
|
|
|
|
don't check for divide by zero. */
|
|
|
|
|
|
|
|
|
|
#include "DEFS.h"
|
|
|
|
|
#if 0
|
|
|
|
|
/* We do not handle div by zero yet. */
|
|
|
|
|
#include <machine/pal.h>
|
|
|
|
|
#endif
|
|
|
|
|
#include <sysdep.h>
|
|
|
|
|
|
1995-03-10 10:59:52 +08:00
|
|
|
/* Avoid the definition of ret that we set in the alpha sysdep.h. */
|
|
|
|
|
#undef ret
|
|
|
|
|
|
1995-02-18 04:14:40 +08:00
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
FUNC__(remlu)
|
|
|
|
|
/* First set up the dividend. */
|
|
|
|
|
zapnot t10, 0xf, t10
|
|
|
|
|
|
|
|
|
|
stq t10,0(sp)
|
|
|
|
|
ldt $f10,0(sp)
|
|
|
|
|
cvtqt $f10,$f10
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Then set up the divisor. */
|
|
|
|
|
zapnot t11, 0xf, t11
|
|
|
|
|
|
|
|
|
|
stq t11,0(sp)
|
|
|
|
|
ldt $f1,0(sp)
|
|
|
|
|
cvtqt $f1,$f1
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Do the division. */
|
|
|
|
|
divt $f10,$f1,$f10
|
|
|
|
|
cvttqc $f10,$f10
|
|
|
|
|
|
|
|
|
|
/* Put the result in t12. */
|
|
|
|
|
stt $f10,0(sp)
|
|
|
|
|
ldq t12,0(sp)
|
|
|
|
|
sextl t12, t12
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
/* Compute the remainder. */
|
|
|
|
|
mull t11, t12, t11
|
|
|
|
|
subl t10, t11, t12
|
|
|
|
|
|
|
|
|
|
|
|
|
|
|
lda sp,16(sp)
|
|
|
|
|
ret zero,(t9),1
|
|
|
|
|
.end NAME__(remlu)
|
