dnl  x86 mpn_gcd_1 optimised for processors with fast BSF.

dnl  Based on the K7 gcd_1.asm, by Kevin Ryde.  Rehacked by Torbjorn Granlund.

dnl  Copyright 2000-2002, 2005, 2009, 2011, 2012 Free Software Foundation, Inc.

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 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.
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 General Public License
dnl  for more details.
dnl
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/.

include(`../config.m4')


C	     cycles/bit (approx)
C AMD K7	 7.80
C AMD K8,K9	 7.79
C AMD K10	 4.08
C AMD bd1	 ?
C AMD bobcat	 7.82
C Intel P4-2	14.9
C Intel P4-3/4	14.0
C Intel P6/13	 5.09
C Intel core2	 4.22
C Intel NHM	 5.00
C Intel SBR	 5.00
C Intel atom	17.1
C VIA nano	?
C Numbers measured with: speed -CD -s16-32 -t16 mpn_gcd_1

C Threshold of when to call bmod when U is one limb.  Should be about
C (time_in_cycles(bmod_1,1) + call_overhead) / (cycles/bit).
define(`BMOD_THRES_LOG2', 6)


define(`up',    `%edi')
define(`n',     `%esi')
define(`v0',    `%edx')


ASM_START()
	TEXT
	ALIGN(16)
PROLOGUE(mpn_gcd_1)
	push	%edi
	push	%esi

	mov	12(%esp), up
	mov	16(%esp), n
	mov	20(%esp), v0

	mov	(up), %eax	C U low limb
	or	v0, %eax
	bsf	%eax, %eax	C min(ctz(u0),ctz(v0))

	bsf	v0, %ecx
	shr	%cl, v0

	push	%eax		C preserve common twos over call
	push	v0		C preserve v0 argument over call

	cmp	$1, n
	jnz	L(reduce_nby1)

C Both U and V are single limbs, reduce with bmod if u0 >> v0.
	mov	(up), %ecx
	mov	%ecx, %eax
	shr	$BMOD_THRES_LOG2, %ecx
	cmp	%ecx, v0
	ja	L(reduced)
	jmp	L(bmod)

L(reduce_nby1):
	cmp	$BMOD_1_TO_MOD_1_THRESHOLD, n
	jl	L(bmod)
ifdef(`PIC_WITH_EBX',`
	push	%ebx
	call	L(movl_eip_to_ebx)
	add	$_GLOBAL_OFFSET_TABLE_, %ebx
')
	push	v0		C param 3
	push	n		C param 2
	push	up		C param 1
	CALL(	mpn_mod_1)
	jmp	L(called)

L(bmod):
ifdef(`PIC_WITH_EBX',`dnl
	push	%ebx
	call	L(movl_eip_to_ebx)
	add	$_GLOBAL_OFFSET_TABLE_, %ebx
')
	push	v0		C param 3
	push	n		C param 2
	push	up		C param 1
	CALL(	mpn_modexact_1_odd)

L(called):
	add	$12, %esp	C deallocate params
ifdef(`PIC_WITH_EBX',`dnl
	pop	%ebx
')
L(reduced):
	pop	%edx

	bsf	%eax, %ecx
C	test	%eax, %eax	C FIXME: does this lower latency?
	jnz	L(mid)
	jmp	L(end)

	ALIGN(16)		C               K10   BD    C2    NHM   SBR
L(top):	cmovc(	%esi, %eax)	C if x-y < 0    0,3   0,3   0,6   0,5   0,5
	cmovc(	%edi, %edx)	C use x,y-x     0,3   0,3   2,8   1,7   1,7
L(mid):	shr	%cl, %eax	C               1,7   1,6   2,8   2,8   2,8
	mov	%edx, %esi	C               1     1     4     3     3
	sub	%eax, %esi	C               2     2     5     4     4
	bsf	%esi, %ecx	C               3     3     6     5     5
	mov	%eax, %edi	C               2     2     3     3     4
	sub	%edx, %eax	C               2     2     4     3     4
	jnz	L(top)		C

L(end):	pop	%ecx
	mov	%edx, %eax
	shl	%cl, %eax

	pop	%esi
	pop	%edi
	ret

ifdef(`PIC_WITH_EBX',`dnl
L(movl_eip_to_ebx):
	mov	(%esp), %ebx
	ret
')
EPILOGUE()