| Index: fusl/src/math/__polevll.c
|
| diff --git a/fusl/src/math/__polevll.c b/fusl/src/math/__polevll.c
|
| index ce1a84046b83679b95dbf54b84a6afc03a83df69..093b4bc3a85880ef310cfb49c6db77bfa5192513 100644
|
| --- a/fusl/src/math/__polevll.c
|
| +++ b/fusl/src/math/__polevll.c
|
| @@ -62,32 +62,30 @@
|
| * Polynomial evaluator:
|
| * P[0] x^n + P[1] x^(n-1) + ... + P[n]
|
| */
|
| -long double __polevll(long double x, const long double *P, int n)
|
| -{
|
| - long double y;
|
| +long double __polevll(long double x, const long double* P, int n) {
|
| + long double y;
|
|
|
| - y = *P++;
|
| - do {
|
| - y = y * x + *P++;
|
| - } while (--n);
|
| + y = *P++;
|
| + do {
|
| + y = y * x + *P++;
|
| + } while (--n);
|
|
|
| - return y;
|
| + return y;
|
| }
|
|
|
| /*
|
| * Polynomial evaluator:
|
| * x^n + P[0] x^(n-1) + P[1] x^(n-2) + ... + P[n]
|
| */
|
| -long double __p1evll(long double x, const long double *P, int n)
|
| -{
|
| - long double y;
|
| +long double __p1evll(long double x, const long double* P, int n) {
|
| + long double y;
|
|
|
| - n -= 1;
|
| - y = x + *P++;
|
| - do {
|
| - y = y * x + *P++;
|
| - } while (--n);
|
| + n -= 1;
|
| + y = x + *P++;
|
| + do {
|
| + y = y * x + *P++;
|
| + } while (--n);
|
|
|
| - return y;
|
| + return y;
|
| }
|
| #endif
|
|
|