1 ###################################-
3 # Copyright (C) 2009-2024 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 divide operation.
29 # Input : Divisor in Reg r5
31 # Output: Result in Reg r3
33 #######################################
35 /* An executable stack is *not* required for these functions. */
37 .section .note.GNU-stack,"",%progbits
43 .type __udivsi3,@function
52 BEQI r6,$LaDiv_By_Zero # Div_by_Zero # Division Error
53 BEQID r5,$LaResult_Is_Zero # Result is Zero
54 ADDIK r30,r0,0 # Clear mod
55 ADDIK r29,r0,32 # Initialize the loop count
57 # Check if r6 and r5 are equal # if yes, return 1
59 BEQID r18,$LaRETURN_HERE
62 # Check if (uns)r6 is greater than (uns)r5. In that case, just return 0
65 ADD r3,r0,r0 # We would anyways clear r3
66 BLTI r6,$LaRETURN_HERE # r6[bit 31 = 1] hence is greater
68 RSUB r18,r6,r5 # MICROBLAZEcmp
69 BLTI r18,$LaRETURN_HERE
71 # If r6 [bit 31] is set, then return result as 1
77 # First part try to find the first '1' in the r5
81 ADD r5,r5,r5 # left shift logical r5
85 ADD r5,r5,r5 # left shift logical r5 get the '1' into the Carry
86 ADDC r30,r30,r30 # Move that bit into the Mod register
87 RSUB r31,r6,r30 # Try to subtract (r30 a r6)
88 BLTI r31,$LaMOD_TOO_SMALL
89 OR r30,r0,r31 # Move the r31 to mod since the result was positive
94 ADD r3,r3,r3 # Shift in the '1' into div
100 OR r3,r0,r0 # set result to 0
102 # Restore values of CSRs and that of r3 and the divisor and the dividend
109 .size __udivsi3, . - __udivsi3