Lines Matching full:32

3  * Divide a 64-bit unsigned number by a 32-bit unsigned number.
4  * This routine assumes that the top 32 bits of the dividend are
30 	li	r10,-1		# to make it < 2^32, and shifting
48 	divwu	r0,r6,r4	# perform the remaining 32-bit division
73 	subfic	r6,r5,32
75 	addi	r7,r5,32	# could be xori, or addi with -32
76 	slw	r6,r3,r6	# t1 = count > 31 ? 0 : MSW << (32-count)
77 	rlwinm	r8,r7,0,32	# t3 = (count < 32) ? 32 : 0
78 	sraw	r7,r3,r7	# t2 = MSW >> (count-32)
80 	slw	r7,r7,r8	# t2 = (count < 32) ? 0 : t2
87 	subfic	r6,r5,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)
99 	subfic	r6,r5,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)