aboutsummaryrefslogtreecommitdiff
path: root/src/benchmarks/cfrac/pgcd.c
diff options
context:
space:
mode:
Diffstat (limited to 'src/benchmarks/cfrac/pgcd.c')
-rw-r--r--src/benchmarks/cfrac/pgcd.c24
1 files changed, 0 insertions, 24 deletions
diff --git a/src/benchmarks/cfrac/pgcd.c b/src/benchmarks/cfrac/pgcd.c
deleted file mode 100644
index a72a8a7..0000000
--- a/src/benchmarks/cfrac/pgcd.c
+++ /dev/null
@@ -1,24 +0,0 @@
-#include "precision.h"
-
-/*
- * Euclid's Algorithm
- *
- * Given u and v, calculated and return their greatest common divisor.
- */
-precision pgcd(u, v)
- precision u, v;
-{
- precision u3 = pnew(pabs(pparm(u))), v3 = pnew(pabs(pparm(v)));
- precision q = pUndef, r = pUndef;
-
- while (pnez(v3)) {
- pdivmod(u3, v3, &q, &r);
- pset(&u3, v3);
- pset(&v3, r);
- }
-
- pdestroy(v3);
- pdestroy(q); pdestroy(r);
- pdestroy(u); pdestroy(v);
- return presult(u3); /* result always positive */
-}