Mercurial > hg > CbC > CbC_gcc

comparison libgcc/config/microblaze/modsi3.asm @ 68:561a7518be6b

Find changesets by keywords (author, files, the commit message), revision number or hash, or revset expression.
update gcc-4.6
author Nobuyasu Oshiro <dimolto@cr.ie.u-ryukyu.ac.jp>
date Sun, 21 Aug 2011 07:07:55 +0900
parents
children
comparison
equal deleted inserted replaced
67:f6334be47118 68:561a7518be6b
1 ###################################
2 #
3 # Copyright 2009, 2010 Free Software Foundation, Inc.
4 #
5 # Contributed by Michael Eager <eager@eagercon.com>.
6 #
7 # This file is free software; you can redistribute it and/or modify it
8 # under the terms of the GNU General Public License as published by the
9 # Free Software Foundation; either version 3, or (at your option) any
10 # later version.
11 #
12 # GCC is distributed in the hope that it will be useful, but WITHOUT
13 # ANY WARRANTY; without even the implied warranty of MERCHANTABILITY
14 # or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public
15 # License for more details.
16 #
17 # Under Section 7 of GPL version 3, you are granted additional
18 # permissions described in the GCC Runtime Library Exception, version
19 # 3.1, as published by the Free Software Foundation.
20 #
21 # You should have received a copy of the GNU General Public License and
22 # a copy of the GCC Runtime Library Exception along with this program;
23 # see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
24 # <http://www.gnu.org/licenses/>.
25 #
26 # modsi3.asm
27 #
28 # modulo operation for 32 bit integers.
29 # Input : op1 in Reg r5
30 # op2 in Reg r6
31 # Output: op1 mod op2 in Reg r3
32 #
33 #######################################
34
35 .globl __modsi3
36 .ent __modsi3
37 .type __modsi3,@function
38 __modsi3:
39 .frame r1,0,r15
40
41 addik r1,r1,-16
42 swi r28,r1,0
43 swi r29,r1,4
44 swi r30,r1,8
45 swi r31,r1,12
46
47 BEQI r6,$LaDiv_By_Zero # Div_by_Zero # Division Error
48 BEQI r5,$LaResult_Is_Zero # Result is Zero
49 BGEId r5,$LaR5_Pos
50 ADD r28,r5,r0 # Get the sign of the result [ Depends only on the first arg]
51 RSUBI r5,r5,0 # Make r5 positive
52 $LaR5_Pos:
53 BGEI r6,$LaR6_Pos
54 RSUBI r6,r6,0 # Make r6 positive
55 $LaR6_Pos:
56 ADDIK r3,r0,0 # Clear mod
57 ADDIK r30,r0,0 # clear div
58 ADDIK r29,r0,32 # Initialize the loop count
59 # First part try to find the first '1' in the r5
60 $LaDIV1:
61 ADD r5,r5,r5 # left shift logical r5
62 BGEID r5,$LaDIV1 #
63 ADDIK r29,r29,-1
64 $LaDIV2:
65 ADD r5,r5,r5 # left shift logical r5 get the '1' into the Carry
66 ADDC r3,r3,r3 # Move that bit into the Mod register
67 rSUB r31,r6,r3 # Try to subtract (r30 a r6)
68 BLTi r31,$LaMOD_TOO_SMALL
69 OR r3,r0,r31 # Move the r31 to mod since the result was positive
70 ADDIK r30,r30,1
71 $LaMOD_TOO_SMALL:
72 ADDIK r29,r29,-1
73 BEQi r29,$LaLOOP_END
74 ADD r30,r30,r30 # Shift in the '1' into div
75 BRI $LaDIV2 # Div2
76 $LaLOOP_END:
77 BGEI r28,$LaRETURN_HERE
78 BRId $LaRETURN_HERE
79 rsubi r3,r3,0 # Negate the result
80 $LaDiv_By_Zero:
81 $LaResult_Is_Zero:
82 or r3,r0,r0 # set result to 0 [Both mod as well as div are 0]
83 $LaRETURN_HERE:
84 # Restore values of CSRs and that of r3 and the divisor and the dividend
85 lwi r28,r1,0
86 lwi r29,r1,4
87 lwi r30,r1,8
88 lwi r31,r1,12
89 rtsd r15,8
90 addik r1,r1,16
91 .end __modsi3
92 .size __modsi3, . - __modsi3
93