28  * int N;
29  * long double x, y, coef[N+1], polevl[];
31  * y = polevll( x, coef, N );
37  * Evaluates polynomial of degree N:
39  *                     2          N
41  *        0    1     2          N
45  * coef[0] = C  , ..., coef[N] = C  .
46  *            N                   0
48  *  The function p1evll() assumes that coef[N] = 1.0 and is
66  *  P[0] x^n  +  P[1] x^(n-1)  +  ...  +  P[n]
69 __polevll(long double x, const long double *P, int n)  in __polevll()  argument
76 	} while (--n);  in __polevll()
83  *  x^n  +  P[0] x^(n-1)  +  P[1] x^(n-2)  +  ...  +  P[n]
86 __p1evll(long double x, const long double *P, int n)  in __p1evll()  argument
90 	n -= 1;  in __p1evll()
94 	} while (--n);  in __p1evll()