mirror of
https://sourceware.org/git/glibc.git
synced 2024-11-18 11:00:07 +00:00
61 lines
1.0 KiB
ArmAsm
61 lines
1.0 KiB
ArmAsm
|
/* 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>
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
|
||
|
|
FUNC__(remqu)
|
||
|
|
/* First set up the dividend. */
|
||
|
|
|
||
|
|
stq t10,0(sp)
|
||
|
|
ldt $f10,0(sp)
|
||
|
|
cvtqt $f10,$f10
|
||
|
|
ldit $f26, 18446744073709551616.0
|
||
|
|
addt $f26, $f10, $f26
|
||
|
|
fcmovlt $f10, $f26, $f10
|
||
|
|
|
||
|
|
|
||
|
|
/* Then set up the divisor. */
|
||
|
|
|
||
|
|
stq t11,0(sp)
|
||
|
|
ldt $f1,0(sp)
|
||
|
|
cvtqt $f1,$f1
|
||
|
|
ldit $f26, 18446744073709551616.0
|
||
|
|
addt $f26, $f1, $f26
|
||
|
|
fcmovlt $f1, $f26, $f1
|
||
|
|
|
||
|
|
|
||
|
|
/* Do the division. */
|
||
|
|
divt $f10,$f1,$f10
|
||
|
|
cvttqc $f10,$f10
|
||
|
|
|
||
|
|
/* Put the result in t12. */
|
||
|
|
stt $f10,0(sp)
|
||
|
|
ldq t12,0(sp)
|
||
|
|
|
||
|
|
|
||
|
|
/* Compute the remainder. */
|
||
|
|
mulq t11, t12, t11
|
||
|
|
subq t10, t11, t12
|
||
|
|
|
||
|
|
|
||
|
|
lda sp,16(sp)
|
||
|
|
ret zero,(t9),1
|
||
|
|
.end NAME__(remqu)
|