| Index: gcc/gmp/mpn/x86/k6/mode1o.asm
|
| diff --git a/gcc/gmp/mpn/x86/k6/mode1o.asm b/gcc/gmp/mpn/x86/k6/mode1o.asm
|
| deleted file mode 100644
|
| index f2998779112b407a35949b8c031ddfbb99de9cfa..0000000000000000000000000000000000000000
|
| --- a/gcc/gmp/mpn/x86/k6/mode1o.asm
|
| +++ /dev/null
|
| @@ -1,164 +0,0 @@
|
| -dnl AMD K6 mpn_modexact_1_odd -- exact division style remainder.
|
| -
|
| -dnl Copyright 2000, 2001, 2002, 2003, 2007 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
|
| -dnl modify it under the terms of the GNU Lesser General Public License as
|
| -dnl published by the Free Software Foundation; either version 3 of the
|
| -dnl License, or (at your option) any later version.
|
| -dnl
|
| -dnl The GNU MP Library is distributed in the hope that it will be useful,
|
| -dnl but WITHOUT ANY WARRANTY; without even the implied warranty of
|
| -dnl MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
|
| -dnl Lesser General Public 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 K6: 10.0 cycles/limb
|
| -
|
| -
|
| -C mp_limb_t mpn_modexact_1_odd (mp_srcptr src, mp_size_t size,
|
| -C mp_limb_t divisor);
|
| -C mp_limb_t mpn_modexact_1c_odd (mp_srcptr src, mp_size_t size,
|
| -C mp_limb_t divisor, mp_limb_t carry);
|
| -C
|
| -C A special case for high<divisor at the end measured only about 4 cycles
|
| -C faster, and so isn't used.
|
| -C
|
| -C A special case for size==1 using a divl rather than the inverse measured
|
| -C only about 5 cycles faster, and so isn't used. When size==1 and
|
| -C high<divisor it can skip a division and be a full 24 cycles faster, but
|
| -C this isn't an important case.
|
| -
|
| -defframe(PARAM_CARRY, 16)
|
| -defframe(PARAM_DIVISOR,12)
|
| -defframe(PARAM_SIZE, 8)
|
| -defframe(PARAM_SRC, 4)
|
| -
|
| - TEXT
|
| -
|
| - ALIGN(32)
|
| -PROLOGUE(mpn_modexact_1c_odd)
|
| -deflit(`FRAME',0)
|
| -
|
| - movl PARAM_DIVISOR, %ecx
|
| - pushl %esi FRAME_pushl()
|
| -
|
| - movl PARAM_CARRY, %edx
|
| - jmp L(start_1c)
|
| -
|
| -EPILOGUE()
|
| -
|
| -
|
| - ALIGN(16)
|
| -PROLOGUE(mpn_modexact_1_odd)
|
| -deflit(`FRAME',0)
|
| -
|
| - movl PARAM_DIVISOR, %ecx
|
| - pushl %esi FRAME_pushl()
|
| -
|
| - xorl %edx, %edx
|
| -L(start_1c):
|
| - pushl %edi FRAME_pushl()
|
| -
|
| - shrl %ecx C d/2
|
| - movl PARAM_DIVISOR, %esi
|
| -
|
| - andl $127, %ecx C d/2, 7 bits
|
| - pushl %ebp FRAME_pushl()
|
| -
|
| -ifdef(`PIC',`
|
| - LEA( binvert_limb_table, %edi)
|
| -Zdisp( movzbl, 0,(%ecx,%edi), %edi) C inv 8 bits
|
| -',`
|
| - movzbl binvert_limb_table(%ecx), %edi C inv 8 bits
|
| -')
|
| - leal (%edi,%edi), %ecx C 2*inv
|
| -
|
| - imull %edi, %edi C inv*inv
|
| -
|
| - movl PARAM_SRC, %eax
|
| - movl PARAM_SIZE, %ebp
|
| -
|
| - imull %esi, %edi C inv*inv*d
|
| -
|
| - pushl %ebx FRAME_pushl()
|
| - leal (%eax,%ebp,4), %ebx C src end
|
| -
|
| - subl %edi, %ecx C inv = 2*inv - inv*inv*d
|
| - leal (%ecx,%ecx), %edi C 2*inv
|
| -
|
| - imull %ecx, %ecx C inv*inv
|
| -
|
| - movl (%eax), %eax C src low limb
|
| - negl %ebp C -size
|
| -
|
| - imull %esi, %ecx C inv*inv*d
|
| -
|
| - subl %ecx, %edi C inv = 2*inv - inv*inv*d
|
| -
|
| - ASSERT(e,` C d*inv == 1 mod 2^BITS_PER_MP_LIMB
|
| - pushl %eax
|
| - movl %esi, %eax
|
| - imull %edi, %eax
|
| - cmpl $1, %eax
|
| - popl %eax')
|
| -
|
| - jmp L(entry)
|
| -
|
| -
|
| -C Rotating the mul to the top of the loop saves 1 cycle, presumably by
|
| -C hiding the loop control under the imul latency.
|
| -C
|
| -C The run time is 10 cycles, but decoding is only 9 (and the dependent chain
|
| -C only 8). It's not clear how to get down to 9 cycles.
|
| -C
|
| -C The xor and rcl to handle the carry bit could be an sbb instead, with the
|
| -C the carry bit add becoming a sub, but that doesn't save anything.
|
| -
|
| -L(top):
|
| - C eax (low product)
|
| - C ebx src end
|
| - C ecx carry bit, 0 or 1
|
| - C edx (high product, being carry limb)
|
| - C esi divisor
|
| - C edi inverse
|
| - C ebp counter, limbs, negative
|
| -
|
| - mull %esi
|
| -
|
| - movl (%ebx,%ebp,4), %eax
|
| - addl %ecx, %edx C apply carry bit to carry limb
|
| -
|
| -L(entry):
|
| - xorl %ecx, %ecx
|
| - subl %edx, %eax C apply carry limb
|
| -
|
| - rcll %ecx
|
| -
|
| - imull %edi, %eax
|
| -
|
| - incl %ebp
|
| - jnz L(top)
|
| -
|
| -
|
| -
|
| - popl %ebx
|
| - popl %ebp
|
| -
|
| - mull %esi
|
| -
|
| - popl %edi
|
| - popl %esi
|
| -
|
| - leal (%ecx,%edx), %eax
|
| -
|
| - ret
|
| -
|
| -EPILOGUE()
|
|
|