patch-2.1.9 linux/arch/sparc/lib/urem.S
Next file: linux/arch/sparc/mm/Makefile
Previous file: linux/arch/sparc/lib/umul.S
Back to the patch index
Back to the overall index
- Lines: 403
- Date:
Sat Nov 9 10:12:10 1996
- Orig file:
v2.1.8/linux/arch/sparc/lib/urem.S
- Orig date:
Sat Nov 25 02:59:13 1995
diff -u --recursive --new-file v2.1.8/linux/arch/sparc/lib/urem.S linux/arch/sparc/lib/urem.S
@@ -1,4 +1,4 @@
-/* $Id: urem.S,v 1.2 1995/11/25 00:59:11 davem Exp $
+/* $Id: urem.S,v 1.4 1996/09/30 02:22:42 davem Exp $
* urem.S: This routine was taken from glibc-1.09 and is covered
* by the GNU Library General Public License Version 2.
*/
@@ -46,22 +46,24 @@
! Ready to divide. Compute size of quotient; scale comparand.
orcc %o1, %g0, %o5
bne 1f
- mov %o0, %o3
+ mov %o0, %o3
! Divide by zero trap. If it returns, return 0 (about as
! wrong as possible, but that is what SunOS does...).
ta ST_DIV0
retl
- clr %o0
+ clr %o0
1:
cmp %o3, %o5 ! if %o1 exceeds %o0, done
blu Lgot_result ! (and algorithm fails otherwise)
- clr %o2
+ clr %o2
+
sethi %hi(1 << (32 - 4 - 1)), %g1
+
cmp %o3, %g1
blu Lnot_really_big
- clr %o4
+ clr %o4
! Here the dividend is >= 2**(31-N) or so. We must be careful here,
! as our usual N-at-a-shot divide step will cause overflow and havoc.
@@ -71,15 +73,18 @@
1:
cmp %o5, %g1
bgeu 3f
- mov 1, %g7
+ mov 1, %g7
+
sll %o5, 4, %o5
+
b 1b
- add %o4, 1, %o4
+ add %o4, 1, %o4
! Now compute %g7.
- 2: addcc %o5, %o5, %o5
+ 2:
+ addcc %o5, %o5, %o5
bcc Lnot_too_big
- add %g7, 1, %g7
+ add %g7, 1, %g7
! We get here if the %o1 overflowed while shifting.
! This means that %o3 has the high-order bit set.
@@ -87,15 +92,18 @@
sll %g1, 4, %g1 ! high order bit
srl %o5, 1, %o5 ! rest of %o5
add %o5, %g1, %o5
+
b Ldo_single_div
- sub %g7, 1, %g7
+ sub %g7, 1, %g7
Lnot_too_big:
- 3: cmp %o5, %o3
+ 3:
+ cmp %o5, %o3
blu 2b
- nop
+ nop
+
be Ldo_single_div
- nop
+ nop
/* NB: these are commented out in the V8-Sparc manual as well */
/* (I do not understand this) */
! %o5 > %o3: went too far: back up 1 step
@@ -112,19 +120,21 @@
Ldo_single_div:
subcc %g7, 1, %g7
bl Lend_regular_divide
- nop
+ nop
+
sub %o3, %o5, %o3
mov 1, %o2
+
b Lend_single_divloop
- nop
+ nop
Lsingle_divloop:
sll %o2, 1, %o2
bl 1f
- srl %o5, 1, %o5
+ srl %o5, 1, %o5
! %o3 >= 0
sub %o3, %o5, %o3
b 2f
- add %o2, 1, %o2
+ add %o2, 1, %o2
1: ! %o3 < 0
add %o3, %o5, %o3
sub %o2, 1, %o2
@@ -132,214 +142,214 @@
Lend_single_divloop:
subcc %g7, 1, %g7
bge Lsingle_divloop
- tst %o3
+ tst %o3
+
b,a Lend_regular_divide
Lnot_really_big:
1:
sll %o5, 4, %o5
+
cmp %o5, %o3
bleu 1b
- addcc %o4, 1, %o4
+ addcc %o4, 1, %o4
+
be Lgot_result
- sub %o4, 1, %o4
+ sub %o4, 1, %o4
tst %o3 ! set up for initial iteration
Ldivloop:
sll %o2, 4, %o2
! depth 1, accumulated bits 0
bl L.1.16
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 2, accumulated bits 1
bl L.2.17
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 3, accumulated bits 3
bl L.3.19
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 4, accumulated bits 7
bl L.4.23
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (7*2+1), %o2
-
+ b 9f
+ add %o2, (7*2+1), %o2
+
L.4.23:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (7*2-1), %o2
-
-
+ b 9f
+ add %o2, (7*2-1), %o2
+
L.3.19:
! remainder is negative
addcc %o3,%o5,%o3
! depth 4, accumulated bits 5
bl L.4.21
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (5*2+1), %o2
-
+ b 9f
+ add %o2, (5*2+1), %o2
+
L.4.21:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (5*2-1), %o2
-
-
-
+ b 9f
+ add %o2, (5*2-1), %o2
+
L.2.17:
! remainder is negative
addcc %o3,%o5,%o3
! depth 3, accumulated bits 1
bl L.3.17
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 4, accumulated bits 3
bl L.4.19
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (3*2+1), %o2
-
+ b 9f
+ add %o2, (3*2+1), %o2
+
L.4.19:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (3*2-1), %o2
-
-
+ b 9f
+ add %o2, (3*2-1), %o2
+
L.3.17:
! remainder is negative
addcc %o3,%o5,%o3
! depth 4, accumulated bits 1
bl L.4.17
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (1*2+1), %o2
+ b 9f
+ add %o2, (1*2+1), %o2
L.4.17:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (1*2-1), %o2
-
-
-
-
+ b 9f
+ add %o2, (1*2-1), %o2
+
L.1.16:
! remainder is negative
addcc %o3,%o5,%o3
! depth 2, accumulated bits -1
bl L.2.15
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 3, accumulated bits -1
bl L.3.15
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 4, accumulated bits -1
bl L.4.15
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (-1*2+1), %o2
-
+ b 9f
+ add %o2, (-1*2+1), %o2
+
L.4.15:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (-1*2-1), %o2
-
-
+ b 9f
+ add %o2, (-1*2-1), %o2
+
L.3.15:
! remainder is negative
addcc %o3,%o5,%o3
! depth 4, accumulated bits -3
bl L.4.13
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (-3*2+1), %o2
-
+ b 9f
+ add %o2, (-3*2+1), %o2
+
L.4.13:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (-3*2-1), %o2
-
-
-
+ b 9f
+ add %o2, (-3*2-1), %o2
+
L.2.15:
! remainder is negative
addcc %o3,%o5,%o3
! depth 3, accumulated bits -3
bl L.3.13
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
! depth 4, accumulated bits -5
bl L.4.11
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (-5*2+1), %o2
+ b 9f
+ add %o2, (-5*2+1), %o2
L.4.11:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (-5*2-1), %o2
-
-
+ b 9f
+ add %o2, (-5*2-1), %o2
+
L.3.13:
! remainder is negative
addcc %o3,%o5,%o3
! depth 4, accumulated bits -7
bl L.4.9
- srl %o5,1,%o5
+ srl %o5,1,%o5
! remainder is positive
subcc %o3,%o5,%o3
- b 9f
- add %o2, (-7*2+1), %o2
-
+ b 9f
+ add %o2, (-7*2+1), %o2
+
L.4.9:
! remainder is negative
addcc %o3,%o5,%o3
- b 9f
- add %o2, (-7*2-1), %o2
-
-
-
-
+ b 9f
+ add %o2, (-7*2-1), %o2
+
9:
Lend_regular_divide:
subcc %o4, 1, %o4
bge Ldivloop
- tst %o3
+ tst %o3
+
bl,a Lgot_result
! non-restoring fixup here (one instruction only!)
add %o3, %o1, %o3
-
Lgot_result:
retl
- mov %o3, %o0
+ mov %o3, %o0
+
+ .globl .urem_patch
+.urem_patch:
+ wr %g0, 0x0, %y
+ nop
+ nop
+ nop
+ udiv %o0, %o1, %o2
+ umul %o2, %o1, %o2
+ retl
+ sub %o0, %o2, %o0
FUNET's LINUX-ADM group, linux-adm@nic.funet.fi
TCL-scripts by Sam Shen, slshen@lbl.gov