Lines Matching refs:ebx
26 pushl %ebx
27 movl 20(%esp), %ebx // Find the index i of the leading bit in b.
28 bsrl %ebx, %ecx // If the high word of b is zero, jump to
38 shll %cl, %ebx // (low word of b) >> (1 + i)
39 orl %eax, %ebx //
42 cmpl %ebx, %edx // to avoid overflowing the upcoming divide.
47 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r
55 movl 12(%esp), %ebx
56 movl 16(%esp), %ecx // ECX:EBX = a
57 subl %eax, %ebx
58 sbbl %edx, %ecx // ECX:EBX = a - q*blo
61 subl %eax, %ecx // ECX:EBX = a - q*b
64 addl 20(%esp), %ebx // otherwise
65 adcl 24(%esp), %ecx // ECX:EBX = a - (q-1)*b = result
66 1: movl %ebx, %eax
70 popl %ebx
76 subl %ebx, %edx // subtract bhi from ahi so that divide will not
77 divl %ebx // overflow, and find q and r such that
91 movl 12(%esp), %ebx
92 movl 16(%esp), %ecx // ECX:EBX = a
93 subl %eax, %ebx
94 sbbl %edx, %ecx // ECX:EBX = a - q*blo
97 subl %eax, %ecx // ECX:EBX = a - q*b
100 addl 20(%esp), %ebx // otherwise
101 adcl 24(%esp), %ecx // ECX:EBX = a - (q-1)*b = result
102 3: movl %ebx, %eax
106 popl %ebx
117 movl %eax, %ebx //
121 popl %ebx //
