blob: 8ca3861ec4293cfa84fa9fd0ddea649dd7c19f36 (
plain)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
|
// 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;
}
|