Lines Matching +full:ls +full:- +full:bits
1 /* SPDX-License-Identifier: GPL-2.0 */
3 /*---------------------------------------------------------------------------+
10 | Australia. E-mail billm@suburbia.net |
15 +---------------------------------------------------------------------------*/
17 /*---------------------------------------------------------------------------+
22 | be in the range [1.0 .. 4.0), to 64 bits accuracy. |
27 +---------------------------------------------------------------------------*/
35 #define FPU_accum_3 -4(%ebp) /* ms word */
36 #define FPU_accum_2 -8(%ebp)
37 #define FPU_accum_1 -12(%ebp)
38 #define FPU_accum_0 -16(%ebp)
41 * The de-normalised argument:
46 #define FPU_fsqrt_arg_2 -20(%ebp) /* ms word */
47 #define FPU_fsqrt_arg_1 -24(%ebp)
48 #define FPU_fsqrt_arg_0 -28(%ebp) /* ls word, at most the ms bit is set */
63 /* The de-normalised argument:
73 .long 0 /* ls word, at most the ms bit is set */
132 * to 30 bits or so. This will then allow two iterations at better
156 * Now that an estimate accurate to about 30 bits has been obtained (in %esi),
157 * we improve it to 60 bits or so.
160 * guess := guess + (n - guess^2) / (2 * guess)
232 /* Now the square root has been computed to better than 60 bits. */
235 movl %edi,%eax /* ls word of guess */
329 * The result in %esi:%edi:%esi should be good to about 90 bits here,
366 * is known to be accurate to about 90 bits.
368 movl %edi,%eax /* ls word of guess */
370 movl %edx,%ebx /* 2nd ls word of square */
371 movl %eax,%ecx /* ls word of square */
423 movl %edi,%eax /* ls word of guess */
425 movl %edx,%ebx /* 2nd ls word of square */
426 movl %eax,%ecx /* ls word of square */