// Gcd
//
// gcd
//
// Greatest common divisor
//
// gcd(a, b) via Euclidean algorithm
//
// Inputs:    2
// Outputs:   1
// Constants: 0


#include <math.h>
#include "ts.h"


ts_parameter_t const ts_gcd_p = { .n_inputs = 2, .n_outputs = 1, .n_constants = 0, .params_size = 0 };

uint_t ts_gcd_offset( ts_constant_t const *c )
{
	( void )c;
	return ( 0 );
}

int ts_gcd(
	fp_t * const *y, uint_t y_n,
	fp_t const * const *x, uint_t x_n,
	uint_t n, ts_constant_t const *c
)
{
	TS_PROLOGUE( ts_gcd_p );
	(void)c;
 for( uint_t i = 0; i < n; ++i )
	{
		fp_t ax = fabs(x[0][i]);
		fp_t bx = fabs(x[1][i]);
		if (ax > 9223372036854775807.0 || bx > 9223372036854775807.0)
		{
			y[0][i] = 0;
			continue;
		}
		long a = (long)ax;
		long b = (long)bx;
		while( b )
		{
			long t = b;
			b = a % b;
			a = t;
		}
		y[0][i] = (fp_t)fabs((fp_t)a);
	}
	return 0;
}