Lines Matching full:eax
31 movl 16(%esp), %eax // low word of b
34 xorl %ecx, %eax
35 xorl %ecx, %edx // EDX:EAX = (b < 0) ? not(b) : b
36 subl %ecx, %eax
37 sbbl %ecx, %edx // EDX:EAX = abs(b)
39 movl %eax, 16(%esp) // store abs(b) back to stack
42 movl 8(%esp), %eax // low word of b
45 xorl %ecx, %eax
46 xorl %ecx, %edx // EDX:EAX = (a < 0) ? not(a) : a
47 subl %ecx, %eax
48 sbbl %ecx, %edx // EDX:EAX = abs(a)
50 movl %eax, 8(%esp) // store abs(a) back to stack
60 movl 20(%esp), %eax // Construct bhi, containing bits [1+i:32+i] of b
62 shrl %cl, %eax // Practically, this means that bhi is given by:
63 shrl %eax //
66 orl %eax, %ebx //
68 movl 12(%esp), %eax // to [2] if the high word is larger than bhi
74 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r
78 shrl %eax
79 shrl %cl, %eax // q = qs >> (1 + i)
80 movl %eax, %edi
84 subl %eax, %ebx
86 movl 28(%esp), %eax
87 imull %edi, %eax // q*bhi
88 subl %eax, %ecx // ECX:EBX = a - q*b
93 1: movl %ebx, %eax
96 addl %esi, %eax // Restore correct sign to result
98 xorl %esi, %eax
117 shrl %eax
118 orl $0x80000000, %eax
119 shrl %cl, %eax // q = (1:qs) >> (1 + i)
120 movl %eax, %edi
124 subl %eax, %ebx
126 movl 28(%esp), %eax
127 imull %edi, %eax // q*bhi
128 subl %eax, %ecx // ECX:EBX = a - q*b
133 3: movl %ebx, %eax
136 addl %esi, %eax // Restore correct sign to result
138 xorl %esi, %eax
147 movl 16(%esp), %eax // Find qhi and rhi such that
151 movl %eax, %ebx //
152 movl 12(%esp), %eax // Find rlo such that
154 movl %edx, %eax // rhi:alo = qlo*b + rlo with 0 ? rlo < b
158 addl %esi, %eax // Restore correct sign to result
160 xorl %esi, %eax
