1 ###################################
3 # Copyright (C) 2009-2018 Free Software Foundation, Inc.
5 # Contributed by Michael Eager <eager@eagercon.com>.
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
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.
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.
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/>.
28 # Unsigned modulo operation for 32 bit integers.
29 # Input : op1 in Reg r5
31 # Output: op1 mod op2 in Reg r3
33 #######################################
35 /* An executable stack is *not* required for these functions. */
37 .section .note.GNU-stack,"",%progbits
43 .type __umodsi3,@function
52 BEQI r6,$LaDiv_By_Zero # Div_by_Zero # Division Error
53 BEQId r5,$LaResult_Is_Zero # Result is Zero
54 ADDIK r3,r0,0 # Clear div
55 ADDIK r30,r0,0 # clear mod
56 ADDIK r29,r0,32 # Initialize the loop count
58 # Check if r6 and r5 are equal # if yes, return 0
60 beqi r18,$LaRETURN_HERE
62 # Check if (uns)r6 is greater than (uns)r5. In that case, just return r5
66 blti r6,$LaRETURN_HERE
68 rsub r18,r5,r6 # MICROBLAZEcmp
69 bgti r18,$LaRETURN_HERE
71 # If r6 [bit 31] is set, then return result as r5-r6
75 addik r18,r0,0x7fffffff
80 # First part: try to find the first '1' in the r5
84 ADD r5,r5,r5 # left shift logical r5
88 ADD r5,r5,r5 # left shift logical r5 get the '1' into the Carry
89 ADDC r3,r3,r3 # Move that bit into the Mod register
90 rSUB r31,r6,r3 # Try to subtract (r3 a r6)
91 BLTi r31,$LaMOD_TOO_SMALL
92 OR r3,r0,r31 # Move the r31 to mod since the result was positive
97 ADD r30,r30,r30 # Shift in the '1' into div
103 or r3,r0,r0 # set result to 0
105 # Restore values of CSRs and that of r3 and the divisor and the dividend
112 .size __umodsi3, . - __umodsi3