]> git.ipfire.org Git - thirdparty/glibc.git/blame - math/w_jnl_compat.c
x86-64: Add vector log1p/log1pf implementation to libmvec
[thirdparty/glibc.git] / math / w_jnl_compat.c
CommitLineData
ee188d55 1/* w_jnl.c -- long double version of w_jn.c.
ee188d55
RM
2 */
3
4/*
5 * ====================================================
6 * Copyright (C) 1993 by Sun Microsystems, Inc. All rights reserved.
7 *
8 * Developed at SunPro, a Sun Microsystems, Inc. business.
9 * Permission to use, copy, modify, and distribute this
10 * software is freely granted, provided that this notice
11 * is preserved.
12 * ====================================================
13 */
14
15#if defined(LIBM_SCCS) && !defined(lint)
16static char rcsid[] = "$NetBSD: $";
17#endif
18
19/*
20 * wrapper jn(int n, double x), yn(int n, double x)
21 * floating point Bessel's function of the 1st and 2nd kind
22 * of order n
23 *
24 * Special cases:
25 * y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
26 * y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
27 * Note 2. About jn(n,x), yn(n,x)
28 * For n=0, j0(x) is called,
29 * for n=1, j1(x) is called,
30 * for n<x, forward recursion us used starting
31 * from values of j0(x) and j1(x).
32 * for n>x, a continued fraction approximation to
33 * j(n,x)/j(n-1,x) is evaluated and then backward
34 * recursion is used starting from a supposed value
35 * for j(n,x). The resulting value of j(0,x) is
36 * compared with the actual value to correct the
37 * supposed value of j(n,x).
38 *
39 * yn(n,x) is similar in all respects, except
40 * that forward recursion is used for all
41 * values of n>1.
42 *
43 */
44
9d13fb24 45#include <math.h>
9277c064 46#include <math_private.h>
813378e9 47#include <math-svid-compat.h>
92892fdb 48#include <libm-alias-ldouble.h>
ee188d55 49
4f3647e4 50#if LIBM_SVID_COMPAT
8db21882 51long double __jnl(int n, long double x) /* wrapper jnl */
ee188d55 52{
4f3647e4 53# ifdef _IEEE_LIBM
ee188d55 54 return __ieee754_jnl(n,x);
4f3647e4 55# else
ee188d55
RM
56 long double z;
57 z = __ieee754_jnl(n,x);
c36e1d23
JM
58 if (_LIB_VERSION == _IEEE_
59 || _LIB_VERSION == _POSIX_
d81f90cc 60 || isnan(x))
c36e1d23 61 return z;
ee188d55 62 if(fabsl(x)>X_TLOSS) {
41bf21a1 63 return __kernel_standard_l((double)n,x,238); /* jn(|x|>X_TLOSS,n) */
ee188d55
RM
64 } else
65 return z;
4f3647e4 66# endif
ee188d55 67}
92892fdb 68libm_alias_ldouble (__jn, jn)
ee188d55 69
8db21882 70long double __ynl(int n, long double x) /* wrapper ynl */
ee188d55 71{
4f3647e4 72# ifdef _IEEE_LIBM
ee188d55 73 return __ieee754_ynl(n,x);
4f3647e4 74# else
ee188d55
RM
75 long double z;
76 z = __ieee754_ynl(n,x);
d81f90cc 77 if(_LIB_VERSION == _IEEE_ || isnan(x) ) return z;
ee188d55
RM
78 if(x <= 0.0){
79 if(x==0.0)
80 /* d= -one/(x-x); */
41bf21a1 81 return __kernel_standard_l((double)n,x,212);
ee188d55
RM
82 else
83 /* d = zero/(x-x); */
41bf21a1 84 return __kernel_standard_l((double)n,x,213);
ee188d55 85 }
c36e1d23 86 if(x>X_TLOSS && _LIB_VERSION != _POSIX_) {
41bf21a1 87 return __kernel_standard_l((double)n,x,239); /* yn(x>X_TLOSS,n) */
ee188d55
RM
88 } else
89 return z;
4f3647e4 90# endif
ee188d55 91}
92892fdb 92libm_alias_ldouble (__yn, yn)
4f3647e4 93#endif