Lines Matching +full:left +full:- +full:shifted
1 /* SPDX-License-Identifier: GPL-2.0-or-later */
3 * Divide a 64-bit unsigned number by a 32-bit unsigned number.
5 * non-zero to start with.
7 * the 64-bit quotient, and r4 contains the divisor.
30 li r10,-1 # to make it < 2^32, and shifting
39 divwu r11,r11,r9 # then we divide the shifted quantities
48 divwu r0,r6,r4 # perform the remaining 32-bit division
61 * -- Gabriel
69 * ashldi3: left shift
75 addi r7,r5,32 # could be xori, or addi with -32
76 slw r6,r3,r6 # t1 = count > 31 ? 0 : MSW << (32-count)
78 sraw r7,r3,r7 # t2 = MSW >> (count-32)
89 addi r7,r5,32 # could be xori, or addi with -32
90 srw r6,r4,r6 # t1 = count > 31 ? 0 : LSW >> (32-count)
91 slw r7,r4,r7 # t2 = count < 32 ? 0 : LSW << (count-32)
101 addi r7,r5,32 # could be xori, or addi with -32
102 slw r6,r3,r6 # t1 = count > 31 ? 0 : MSW << (32-count)
103 srw r7,r3,r7 # t2 = count < 32 ? 0 : MSW >> (count-32)