diff options
| author | Florian Fischer <florian.fl.fischer@fau.de> | 2019-08-24 17:57:51 +0200 |
|---|---|---|
| committer | Florian Fischer <florian.fl.fischer@fau.de> | 2019-08-24 17:57:51 +0200 |
| commit | 77ac9ce0a5c55d4f79f8fb8f7daa59ddb53cb507 (patch) | |
| tree | 93d4e30a207265af03394d347bfff76ba677f3ce /src/benchmarks/cfrac/pgcd.c | |
| parent | 971adefadb94e8780b1a73f08ed11d76c2ead8a2 (diff) | |
| download | allocbench-77ac9ce0a5c55d4f79f8fb8f7daa59ddb53cb507.tar.gz allocbench-77ac9ce0a5c55d4f79f8fb8f7daa59ddb53cb507.zip | |
add cfrac benchmark
Diffstat (limited to 'src/benchmarks/cfrac/pgcd.c')
| -rw-r--r-- | src/benchmarks/cfrac/pgcd.c | 24 |
1 files changed, 24 insertions, 0 deletions
diff --git a/src/benchmarks/cfrac/pgcd.c b/src/benchmarks/cfrac/pgcd.c new file mode 100644 index 0000000..a72a8a7 --- /dev/null +++ b/src/benchmarks/cfrac/pgcd.c @@ -0,0 +1,24 @@ +#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 */ +} |
