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
43 movl 8(%esp), %eax // low word of b
46 xorl %ecx, %eax
47 xorl %ecx, %edx // EDX:EAX = (a < 0) ? not(a) : a
48 subl %ecx, %eax
49 sbbl %ecx, %edx // EDX:EAX = abs(a)
51 movl %eax, 8(%esp) // store abs(a) back to stack
61 movl 20(%esp), %eax // Construct bhi, containing bits [1+i:32+i] of b
63 shrl %cl, %eax // Practically, this means that bhi is given by:
64 shrl %eax //
67 orl %eax, %ebx //
69 movl 12(%esp), %eax // to [1] if the high word is larger than bhi
75 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r
79 shrl %eax
80 shrl %cl, %eax // q = qs >> (1 + i)
81 movl %eax, %edi
85 subl %eax, %ebx
87 movl 28(%esp), %eax
88 imull %edi, %eax // q*bhi
89 subl %eax, %ecx // ECX:EBX = a - q*b
92 movl %edi, %eax
94 addl %esi, %eax // Restore correct sign to result
96 xorl %esi, %eax
116 shrl %eax
117 orl $0x80000000, %eax
118 shrl %cl, %eax // q = (1:qs) >> (1 + i)
119 movl %eax, %edi
123 subl %eax, %ebx
125 movl 28(%esp), %eax
126 imull %edi, %eax // q*bhi
127 subl %eax, %ecx // ECX:EBX = a - q*b
130 movl %edi, %eax
132 addl %esi, %eax // Restore correct sign to result
134 xorl %esi, %eax
144 movl 16(%esp), %eax // Find qhi and rhi such that
148 movl %eax, %ebx //
149 movl 12(%esp), %eax // Find qlo such that
153 addl %esi, %eax // Restore correct sign to result
155 xorl %esi, %eax
