head 1.1; branch 1.1.1; access; symbols netbsd-11-0-RC4:1.1.1.2 netbsd-11-0-RC3:1.1.1.2 netbsd-11-0-RC2:1.1.1.2 netbsd-11-0-RC1:1.1.1.2 perseant-exfatfs-base-20250801:1.1.1.2 netbsd-11:1.1.1.2.0.18 netbsd-11-base:1.1.1.2 netbsd-10-1-RELEASE:1.1.1.2 perseant-exfatfs-base-20240630:1.1.1.2 perseant-exfatfs:1.1.1.2.0.16 perseant-exfatfs-base:1.1.1.2 netbsd-8-3-RELEASE:1.1.1.1 netbsd-9-4-RELEASE:1.1.1.2 netbsd-10-0-RELEASE:1.1.1.2 netbsd-10-0-RC6:1.1.1.2 netbsd-10-0-RC5:1.1.1.2 netbsd-10-0-RC4:1.1.1.2 netbsd-10-0-RC3:1.1.1.2 netbsd-10-0-RC2:1.1.1.2 netbsd-10-0-RC1:1.1.1.2 netbsd-10:1.1.1.2.0.14 netbsd-10-base:1.1.1.2 netbsd-9-3-RELEASE:1.1.1.2 gmp-6-2-1:1.1.1.2 cjep_sun2x-base1:1.1.1.2 cjep_sun2x:1.1.1.2.0.12 cjep_sun2x-base:1.1.1.2 cjep_staticlib_x-base1:1.1.1.2 netbsd-9-2-RELEASE:1.1.1.2 cjep_staticlib_x:1.1.1.2.0.10 cjep_staticlib_x-base:1.1.1.2 netbsd-9-1-RELEASE:1.1.1.2 gmp-6-2-0:1.1.1.2 phil-wifi-20200421:1.1.1.2 phil-wifi-20200411:1.1.1.2 is-mlppp:1.1.1.2.0.8 is-mlppp-base:1.1.1.2 phil-wifi-20200406:1.1.1.2 netbsd-8-2-RELEASE:1.1.1.1 netbsd-9-0-RELEASE:1.1.1.2 netbsd-9-0-RC2:1.1.1.2 netbsd-9-0-RC1:1.1.1.2 phil-wifi-20191119:1.1.1.2 netbsd-9:1.1.1.2.0.6 netbsd-9-base:1.1.1.2 phil-wifi-20190609:1.1.1.2 netbsd-8-1-RELEASE:1.1.1.1 netbsd-8-1-RC1:1.1.1.1 pgoyette-compat-merge-20190127:1.1.1.2 pgoyette-compat-20190127:1.1.1.2 pgoyette-compat-20190118:1.1.1.2 pgoyette-compat-1226:1.1.1.2 pgoyette-compat-1126:1.1.1.2 pgoyette-compat-1020:1.1.1.2 pgoyette-compat-0930:1.1.1.2 pgoyette-compat-0906:1.1.1.2 netbsd-7-2-RELEASE:1.1.1.1 pgoyette-compat-0728:1.1.1.2 netbsd-8-0-RELEASE:1.1.1.1 phil-wifi:1.1.1.2.0.4 phil-wifi-base:1.1.1.2 pgoyette-compat-0625:1.1.1.2 netbsd-8-0-RC2:1.1.1.1 pgoyette-compat-0521:1.1.1.2 pgoyette-compat-0502:1.1.1.2 pgoyette-compat-0422:1.1.1.2 netbsd-8-0-RC1:1.1.1.1 pgoyette-compat-0415:1.1.1.2 pgoyette-compat-0407:1.1.1.2 pgoyette-compat-0330:1.1.1.2 pgoyette-compat-0322:1.1.1.2 pgoyette-compat-0315:1.1.1.2 netbsd-7-1-2-RELEASE:1.1.1.1 pgoyette-compat:1.1.1.2.0.2 pgoyette-compat-base:1.1.1.2 netbsd-7-1-1-RELEASE:1.1.1.1 matt-nb8-mediatek:1.1.1.1.0.26 matt-nb8-mediatek-base:1.1.1.1 gmp-6-1-2:1.1.1.2 perseant-stdc-iso10646:1.1.1.1.0.24 perseant-stdc-iso10646-base:1.1.1.1 netbsd-8:1.1.1.1.0.22 netbsd-8-base:1.1.1.1 prg-localcount2-base3:1.1.1.1 prg-localcount2-base2:1.1.1.1 prg-localcount2-base1:1.1.1.1 prg-localcount2:1.1.1.1.0.20 prg-localcount2-base:1.1.1.1 pgoyette-localcount-20170426:1.1.1.1 bouyer-socketcan-base1:1.1.1.1 pgoyette-localcount-20170320:1.1.1.1 netbsd-7-1:1.1.1.1.0.18 netbsd-7-1-RELEASE:1.1.1.1 netbsd-7-1-RC2:1.1.1.1 netbsd-7-nhusb-base-20170116:1.1.1.1 bouyer-socketcan:1.1.1.1.0.16 bouyer-socketcan-base:1.1.1.1 pgoyette-localcount-20170107:1.1.1.1 netbsd-7-1-RC1:1.1.1.1 pgoyette-localcount-20161104:1.1.1.1 netbsd-7-0-2-RELEASE:1.1.1.1 localcount-20160914:1.1.1.1 netbsd-7-nhusb:1.1.1.1.0.14 netbsd-7-nhusb-base:1.1.1.1 pgoyette-localcount-20160806:1.1.1.1 pgoyette-localcount-20160726:1.1.1.1 pgoyette-localcount:1.1.1.1.0.12 pgoyette-localcount-base:1.1.1.1 netbsd-7-0-1-RELEASE:1.1.1.1 netbsd-7-0:1.1.1.1.0.10 netbsd-7-0-RELEASE:1.1.1.1 netbsd-7-0-RC3:1.1.1.1 netbsd-7-0-RC2:1.1.1.1 netbsd-7-0-RC1:1.1.1.1 tls-maxphys-base:1.1.1.1 tls-maxphys:1.1.1.1.0.8 netbsd-7:1.1.1.1.0.6 netbsd-7-base:1.1.1.1 yamt-pagecache:1.1.1.1.0.4 yamt-pagecache-base9:1.1.1.1 tls-earlyentropy:1.1.1.1.0.2 tls-earlyentropy-base:1.1.1.1 riastradh-xf86-video-intel-2-7-1-pre-2-21-15:1.1.1.1 riastradh-drm2-base3:1.1.1.1 gmp-5-1-3:1.1.1.1 gmp:1.1.1; locks; strict; comment @;; @; 1.1 date 2013.11.29.07.49.49; author mrg; state Exp; branches 1.1.1.1; next ; commitid L2Av4PuGmdoL39fx; 1.1.1.1 date 2013.11.29.07.49.49; author mrg; state Exp; branches 1.1.1.1.4.1 1.1.1.1.8.1; next 1.1.1.2; commitid L2Av4PuGmdoL39fx; 1.1.1.2 date 2017.08.22.09.40.49; author mrg; state Exp; branches; next ; commitid W5kmAIk8hwVpSb4A; 1.1.1.1.4.1 date 2013.11.29.07.49.49; author yamt; state dead; branches; next 1.1.1.1.4.2; commitid nx2BSsHy0NPeAxBx; 1.1.1.1.4.2 date 2014.05.22.14.09.05; author yamt; state Exp; branches; next ; commitid nx2BSsHy0NPeAxBx; 1.1.1.1.8.1 date 2013.11.29.07.49.49; author tls; state dead; branches; next 1.1.1.1.8.2; commitid jTnpym9Qu0o4R1Nx; 1.1.1.1.8.2 date 2014.08.19.23.59.54; author tls; state Exp; branches; next ; commitid jTnpym9Qu0o4R1Nx; desc @@ 1.1 log @Initial revision @ text @dnl x86-32 mpn_mod_1_1p, requiring cmov. dnl Contributed to the GNU project by Niels Möller and Torbjorn Granlund. dnl dnl Copyright 2010, 2011 Free Software Foundation, Inc. dnl dnl This file is part of the GNU MP Library. dnl dnl The GNU MP Library is free software; you can redistribute it and/or modify dnl it under the terms of the GNU Lesser General Public License as published dnl by the Free Software Foundation; either version 3 of the License, or (at dnl your option) any later version. dnl dnl The GNU MP Library is distributed in the hope that it will be useful, but dnl WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public dnl License for more details. dnl dnl You should have received a copy of the GNU Lesser General Public License dnl along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. include(`../config.m4') C cycles/limb C P5 ? C P6 model 0-8,10-12 ? C P6 model 9 (Banias) ? C P6 model 13 (Dothan) ? C P4 model 0 (Willamette) ? C P4 model 1 (?) ? C P4 model 2 (Northwood) ? C P4 model 3 (Prescott) ? C P4 model 4 (Nocona) ? C AMD K6 ? C AMD K7 7 C AMD K8 ? define(`B2mb', `%ebx') define(`r0', `%esi') define(`r2', `%ebp') define(`t0', `%edi') define(`ap', `%ecx') C Also shift count C Stack frame C pre 36(%esp) C b 32(%esp) C n 28(%esp) C ap 24(%esp) C return 20(%esp) C %ebp 16(%esp) C %edi 12(%esp) C %esi 8(%esp) C %ebx 4(%esp) C B2mod (%esp) define(`B2modb', `(%esp)') define(`n', `28(%esp)') define(`b', `32(%esp)') define(`pre', `36(%esp)') C mp_limb_t C mpn_mod_1_1p (mp_srcptr ap, mp_size_t n, mp_limb_t b, mp_limb_t pre[4]) C C The pre array contains bi, cnt, B1modb, B2modb C Note: This implementation needs B1modb only when cnt > 0 ASM_START() TEXT ALIGN(8) PROLOGUE(mpn_mod_1_1p) push %ebp push %edi push %esi push %ebx mov 32(%esp), %ebp C pre[] mov 12(%ebp), %eax C B2modb push %eax C Put it on stack mov n, %edx mov 24(%esp), ap lea (ap, %edx, 4), ap mov -4(ap), %eax cmp $3, %edx jnc L(first) mov -8(ap), r0 jmp L(reduce_two) L(first): C First iteration, no r2 mull B2modb mov -12(ap), r0 add %eax, r0 mov -8(ap), %eax adc %edx, %eax sbb r2, r2 sub $3, n lea -16(ap), ap jz L(reduce_three) mov B2modb, B2mb sub b, B2mb lea (B2mb, r0), t0 jmp L(mid) ALIGN(16) L(top): C Loopmixed to 7 c/l on k7 add %eax, r0 lea (B2mb, r0), t0 mov r2, %eax adc %edx, %eax sbb r2, r2 L(mid): mull B2modb and B2modb, r2 add r0, r2 decl n mov (ap), r0 cmovc( t0, r2) lea -4(ap), ap jnz L(top) add %eax, r0 mov r2, %eax adc %edx, %eax sbb r2, r2 L(reduce_three): C Eliminate r2 and b, r2 sub r2, %eax L(reduce_two): mov pre, %ebp movb 4(%ebp), %cl test %cl, %cl jz L(normalized) C Unnormalized, use B1modb to reduce to size < B b mull 8(%ebp) xor t0, t0 add %eax, r0 adc %edx, t0 mov t0, %eax C Left-shift to normalize shld %cl, r0, %eax C Always use shld? shl %cl, r0 jmp L(udiv) L(normalized): mov %eax, t0 sub b, t0 cmovnc( t0, %eax) L(udiv): lea 1(%eax), t0 mull (%ebp) mov b, %ebx C Needed in register for lea add r0, %eax adc t0, %edx imul %ebx, %edx sub %edx, r0 cmp r0, %eax lea (%ebx, r0), %eax cmovnc( r0, %eax) cmp %ebx, %eax jnc L(fix) L(ok): shr %cl, %eax add $4, %esp pop %ebx pop %esi pop %edi pop %ebp ret L(fix): sub %ebx, %eax jmp L(ok) EPILOGUE() PROLOGUE(mpn_mod_1_1p_cps) push %ebp mov 12(%esp), %ebp push %esi bsr %ebp, %ecx push %ebx xor $31, %ecx mov 16(%esp), %esi sal %cl, %ebp mov %ebp, %edx not %edx mov $-1, %eax div %ebp C On K7, invert_limb would be a few cycles faster. mov %eax, (%esi) C store bi mov %ecx, 4(%esi) C store cnt neg %ebp mov $1, %edx shld %cl, %eax, %edx imul %ebp, %edx shr %cl, %edx imul %ebp, %eax mov %edx, 8(%esi) C store B1modb mov %eax, 12(%esi) C store B2modb pop %ebx pop %esi pop %ebp ret EPILOGUE() @ 1.1.1.1 log @initial import GMP 5.1.3 sources. changes include: fixes for: - mpn_sbpi1_div_qr_sec and mpn_sbpi1_div_r_sec - mpz_powm_ui - AMD family 11h - mpz_powm_sec and mpn_powm_sec - ASSERT() fixes - gcd, gcdext, and invert function fixes - some PPC division operations @ text @@ 1.1.1.2 log @initial import of GMP 6.1.2. main changes from 5.1.3 below. notes: - support for thumb-less ARM chips was in our port of 5.1.3, but a similar method has been provided upstream now - someone should look at the AVX failure reports, and fix them Changes between GMP version 6.1.0 and 6.1.1 FEATURES * Work around faulty cpuid on some recent Intel chips (this allows GMP to run on Skylake Pentiums). * Support thumb-less ARM chips. Changes between GMP version 6.0.* and 6.1.0 BUGS FIXED * The public function mpn_com is now correctly declared in gmp.h. * Healed possible failures of mpn_sec_sqr for non-cryptographic sizes for some obsolete CPUs. * Various problems related to precision for mpf have been fixed. * Fixed ABI incompatible stack alignment in calls from assembly code. * Fixed PIC bug in popcount affecting Intel processors using the 32-bit ABI. SPEEDUPS * Speedup for Intel Broadwell and Skylake through assembly code making use of new ADX instructions. * Square root is now faster when the remainder is not needed. Also the speed to compute the k-th root improved, for small sizes. FEATURES * New C++ functions gcd and lcm for mpz_class. * New public mpn functions mpn_divexact_1, mpn_zero_p, and mpn_cnd_swap. * New public mpq_cmp_z function, to efficiently compare rationals with integers. * Support for more 32-bit arm processors. * Support for AVX-less modern x86 CPUs. (Such support might be missing either because the CPU vendor chose to disable AVX, or because the running kernel lacks AVX context switch support.) * Support for NetBSD under Xen; we switch off AVX unconditionally under NetBSD since a bug in NetBSD makes AVX fail under Xen. MISC * Tuned values for FFT multiplications are provided for larger number on many platforms. Changes between GMP version 5.1.* and 6.0.0 BUGS FIXED * The function mpz_invert now considers any number invertible in Z/1Z. * The mpn multiply code now handles operands of more than 2^31 limbs correctly. (Note however that the mpz code is limited to 2^32 bits on 32-bit hosts and 2^37 bits on 64-bit hosts.) SPEEDUPS * Plain division of large operands is faster and more monotonous in operand size. * Major speedup for ARM, in particular ARM Cortex-A15, thanks to improved assembly. * Speedup for Intel Sandy Bridge, Ivy Bridge, Haswell, thanks to rewritten and vastly expanded assembly support. Speedup also for the older Core 2 and Nehalem. * Faster mixed arithmetic between mpq_class and double. FEATURES * Support for new Intel and AMD CPUs. * New public functions mpn_sec_mul and mpn_sec_sqr, implementing side-channel silent multiplication and squaring. * New public functions mpn_sec_div_qr and mpn_sec_div_r, implementing side-channel silent division. * New public functions mpn_cnd_add_n and mpn_cnd_sub_n. Side-channel silent conditional addition and subtraction. * New public function mpn_sec_powm, implementing side-channel silent modexp. * New public function mpn_sec_invert, implementing side-channel silent modular inversion. * Better support for applications which use the mpz_t type, but nevertheless need to call some of the lower-level mpn functions. See the documentation for mpz_limbs_read and related functions. @ text @d3 2 a4 2 dnl Contributed to the GNU project by Niels Möller and Torbjorn Granlund. d6 1 a6 1 d10 3 a12 13 dnl it under the terms of either: dnl dnl * the GNU Lesser General Public License as published by the Free dnl Software Foundation; either version 3 of the License, or (at your dnl option) any later version. dnl dnl or dnl dnl * the GNU General Public License as published by the Free Software dnl Foundation; either version 2 of the License, or (at your option) any dnl later version. dnl dnl or both in parallel, as here. d16 2 a17 2 dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License dnl for more details. d19 2 a20 3 dnl You should have received copies of the GNU General Public License and the dnl GNU Lesser General Public License along with the GNU MP Library. If not, dnl see https://www.gnu.org/licenses/. d98 1 a98 1 subl $3, n @ 1.1.1.1.8.1 log @file mod_1_1.asm was added on branch tls-maxphys on 2014-08-19 23:59:54 +0000 @ text @d1 210 @ 1.1.1.1.8.2 log @Rebase to HEAD as of a few days ago. @ text @a0 210 dnl x86-32 mpn_mod_1_1p, requiring cmov. dnl Contributed to the GNU project by Niels Möller and Torbjorn Granlund. dnl dnl Copyright 2010, 2011 Free Software Foundation, Inc. dnl dnl This file is part of the GNU MP Library. dnl dnl The GNU MP Library is free software; you can redistribute it and/or modify dnl it under the terms of the GNU Lesser General Public License as published dnl by the Free Software Foundation; either version 3 of the License, or (at dnl your option) any later version. dnl dnl The GNU MP Library is distributed in the hope that it will be useful, but dnl WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public dnl License for more details. dnl dnl You should have received a copy of the GNU Lesser General Public License dnl along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. include(`../config.m4') C cycles/limb C P5 ? C P6 model 0-8,10-12 ? C P6 model 9 (Banias) ? C P6 model 13 (Dothan) ? C P4 model 0 (Willamette) ? C P4 model 1 (?) ? C P4 model 2 (Northwood) ? C P4 model 3 (Prescott) ? C P4 model 4 (Nocona) ? C AMD K6 ? C AMD K7 7 C AMD K8 ? define(`B2mb', `%ebx') define(`r0', `%esi') define(`r2', `%ebp') define(`t0', `%edi') define(`ap', `%ecx') C Also shift count C Stack frame C pre 36(%esp) C b 32(%esp) C n 28(%esp) C ap 24(%esp) C return 20(%esp) C %ebp 16(%esp) C %edi 12(%esp) C %esi 8(%esp) C %ebx 4(%esp) C B2mod (%esp) define(`B2modb', `(%esp)') define(`n', `28(%esp)') define(`b', `32(%esp)') define(`pre', `36(%esp)') C mp_limb_t C mpn_mod_1_1p (mp_srcptr ap, mp_size_t n, mp_limb_t b, mp_limb_t pre[4]) C C The pre array contains bi, cnt, B1modb, B2modb C Note: This implementation needs B1modb only when cnt > 0 ASM_START() TEXT ALIGN(8) PROLOGUE(mpn_mod_1_1p) push %ebp push %edi push %esi push %ebx mov 32(%esp), %ebp C pre[] mov 12(%ebp), %eax C B2modb push %eax C Put it on stack mov n, %edx mov 24(%esp), ap lea (ap, %edx, 4), ap mov -4(ap), %eax cmp $3, %edx jnc L(first) mov -8(ap), r0 jmp L(reduce_two) L(first): C First iteration, no r2 mull B2modb mov -12(ap), r0 add %eax, r0 mov -8(ap), %eax adc %edx, %eax sbb r2, r2 sub $3, n lea -16(ap), ap jz L(reduce_three) mov B2modb, B2mb sub b, B2mb lea (B2mb, r0), t0 jmp L(mid) ALIGN(16) L(top): C Loopmixed to 7 c/l on k7 add %eax, r0 lea (B2mb, r0), t0 mov r2, %eax adc %edx, %eax sbb r2, r2 L(mid): mull B2modb and B2modb, r2 add r0, r2 decl n mov (ap), r0 cmovc( t0, r2) lea -4(ap), ap jnz L(top) add %eax, r0 mov r2, %eax adc %edx, %eax sbb r2, r2 L(reduce_three): C Eliminate r2 and b, r2 sub r2, %eax L(reduce_two): mov pre, %ebp movb 4(%ebp), %cl test %cl, %cl jz L(normalized) C Unnormalized, use B1modb to reduce to size < B b mull 8(%ebp) xor t0, t0 add %eax, r0 adc %edx, t0 mov t0, %eax C Left-shift to normalize shld %cl, r0, %eax C Always use shld? shl %cl, r0 jmp L(udiv) L(normalized): mov %eax, t0 sub b, t0 cmovnc( t0, %eax) L(udiv): lea 1(%eax), t0 mull (%ebp) mov b, %ebx C Needed in register for lea add r0, %eax adc t0, %edx imul %ebx, %edx sub %edx, r0 cmp r0, %eax lea (%ebx, r0), %eax cmovnc( r0, %eax) cmp %ebx, %eax jnc L(fix) L(ok): shr %cl, %eax add $4, %esp pop %ebx pop %esi pop %edi pop %ebp ret L(fix): sub %ebx, %eax jmp L(ok) EPILOGUE() PROLOGUE(mpn_mod_1_1p_cps) push %ebp mov 12(%esp), %ebp push %esi bsr %ebp, %ecx push %ebx xor $31, %ecx mov 16(%esp), %esi sal %cl, %ebp mov %ebp, %edx not %edx mov $-1, %eax div %ebp C On K7, invert_limb would be a few cycles faster. mov %eax, (%esi) C store bi mov %ecx, 4(%esi) C store cnt neg %ebp mov $1, %edx shld %cl, %eax, %edx imul %ebp, %edx shr %cl, %edx imul %ebp, %eax mov %edx, 8(%esi) C store B1modb mov %eax, 12(%esi) C store B2modb pop %ebx pop %esi pop %ebp ret EPILOGUE() @ 1.1.1.1.4.1 log @file mod_1_1.asm was added on branch yamt-pagecache on 2014-05-22 14:09:05 +0000 @ text @d1 210 @ 1.1.1.1.4.2 log @sync with head. for a reference, the tree before this commit was tagged as yamt-pagecache-tag8. this commit was splitted into small chunks to avoid a limitation of cvs. ("Protocol error: too many arguments") @ text @a0 210 dnl x86-32 mpn_mod_1_1p, requiring cmov. dnl Contributed to the GNU project by Niels Möller and Torbjorn Granlund. dnl dnl Copyright 2010, 2011 Free Software Foundation, Inc. dnl dnl This file is part of the GNU MP Library. dnl dnl The GNU MP Library is free software; you can redistribute it and/or modify dnl it under the terms of the GNU Lesser General Public License as published dnl by the Free Software Foundation; either version 3 of the License, or (at dnl your option) any later version. dnl dnl The GNU MP Library is distributed in the hope that it will be useful, but dnl WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY dnl or FITNESS FOR A PARTICULAR PURPOSE. See the GNU Lesser General Public dnl License for more details. dnl dnl You should have received a copy of the GNU Lesser General Public License dnl along with the GNU MP Library. If not, see http://www.gnu.org/licenses/. include(`../config.m4') C cycles/limb C P5 ? C P6 model 0-8,10-12 ? C P6 model 9 (Banias) ? C P6 model 13 (Dothan) ? C P4 model 0 (Willamette) ? C P4 model 1 (?) ? C P4 model 2 (Northwood) ? C P4 model 3 (Prescott) ? C P4 model 4 (Nocona) ? C AMD K6 ? C AMD K7 7 C AMD K8 ? define(`B2mb', `%ebx') define(`r0', `%esi') define(`r2', `%ebp') define(`t0', `%edi') define(`ap', `%ecx') C Also shift count C Stack frame C pre 36(%esp) C b 32(%esp) C n 28(%esp) C ap 24(%esp) C return 20(%esp) C %ebp 16(%esp) C %edi 12(%esp) C %esi 8(%esp) C %ebx 4(%esp) C B2mod (%esp) define(`B2modb', `(%esp)') define(`n', `28(%esp)') define(`b', `32(%esp)') define(`pre', `36(%esp)') C mp_limb_t C mpn_mod_1_1p (mp_srcptr ap, mp_size_t n, mp_limb_t b, mp_limb_t pre[4]) C C The pre array contains bi, cnt, B1modb, B2modb C Note: This implementation needs B1modb only when cnt > 0 ASM_START() TEXT ALIGN(8) PROLOGUE(mpn_mod_1_1p) push %ebp push %edi push %esi push %ebx mov 32(%esp), %ebp C pre[] mov 12(%ebp), %eax C B2modb push %eax C Put it on stack mov n, %edx mov 24(%esp), ap lea (ap, %edx, 4), ap mov -4(ap), %eax cmp $3, %edx jnc L(first) mov -8(ap), r0 jmp L(reduce_two) L(first): C First iteration, no r2 mull B2modb mov -12(ap), r0 add %eax, r0 mov -8(ap), %eax adc %edx, %eax sbb r2, r2 sub $3, n lea -16(ap), ap jz L(reduce_three) mov B2modb, B2mb sub b, B2mb lea (B2mb, r0), t0 jmp L(mid) ALIGN(16) L(top): C Loopmixed to 7 c/l on k7 add %eax, r0 lea (B2mb, r0), t0 mov r2, %eax adc %edx, %eax sbb r2, r2 L(mid): mull B2modb and B2modb, r2 add r0, r2 decl n mov (ap), r0 cmovc( t0, r2) lea -4(ap), ap jnz L(top) add %eax, r0 mov r2, %eax adc %edx, %eax sbb r2, r2 L(reduce_three): C Eliminate r2 and b, r2 sub r2, %eax L(reduce_two): mov pre, %ebp movb 4(%ebp), %cl test %cl, %cl jz L(normalized) C Unnormalized, use B1modb to reduce to size < B b mull 8(%ebp) xor t0, t0 add %eax, r0 adc %edx, t0 mov t0, %eax C Left-shift to normalize shld %cl, r0, %eax C Always use shld? shl %cl, r0 jmp L(udiv) L(normalized): mov %eax, t0 sub b, t0 cmovnc( t0, %eax) L(udiv): lea 1(%eax), t0 mull (%ebp) mov b, %ebx C Needed in register for lea add r0, %eax adc t0, %edx imul %ebx, %edx sub %edx, r0 cmp r0, %eax lea (%ebx, r0), %eax cmovnc( r0, %eax) cmp %ebx, %eax jnc L(fix) L(ok): shr %cl, %eax add $4, %esp pop %ebx pop %esi pop %edi pop %ebp ret L(fix): sub %ebx, %eax jmp L(ok) EPILOGUE() PROLOGUE(mpn_mod_1_1p_cps) push %ebp mov 12(%esp), %ebp push %esi bsr %ebp, %ecx push %ebx xor $31, %ecx mov 16(%esp), %esi sal %cl, %ebp mov %ebp, %edx not %edx mov $-1, %eax div %ebp C On K7, invert_limb would be a few cycles faster. mov %eax, (%esi) C store bi mov %ecx, 4(%esi) C store cnt neg %ebp mov $1, %edx shld %cl, %eax, %edx imul %ebp, %edx shr %cl, %edx imul %ebp, %eax mov %edx, 8(%esi) C store B1modb mov %eax, 12(%esi) C store B2modb pop %ebx pop %esi pop %ebp ret EPILOGUE() @