Print this page
5261 libm should stop using synonyms.h
5298 fabs is 0-sized, confuses dis(1) and others
Reviewed by: Josef 'Jeff' Sipek <jeffpc@josefsipek.net>
Approved by: Gordon Ross <gwr@nexenta.com>
5262 libm needs to be carefully unifdef'd
5268 libm doesn't need to hide symbols which are already local
Reviewed by: Josef 'Jeff' Sipek <jeffpc@josefsipek.net>
Reviewed by: Igor Kozhukhov <ikozhukhov@gmail.com>
Reviewed by: Gordon Ross <gwr@nexenta.com>
Approved by: Gordon Ross <gwr@nexenta.com>


  10  * See the License for the specific language governing permissions
  11  * and limitations under the License.
  12  *
  13  * When distributing Covered Code, include this CDDL HEADER in each
  14  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
  15  * If applicable, add the following below this CDDL HEADER, with the
  16  * fields enclosed by brackets "[]" replaced with your own identifying
  17  * information: Portions Copyright [yyyy] [name of copyright owner]
  18  *
  19  * CDDL HEADER END
  20  */
  21 
  22 /*
  23  * Copyright 2011 Nexenta Systems, Inc.  All rights reserved.
  24  */
  25 /*
  26  * Copyright 2006 Sun Microsystems, Inc.  All rights reserved.
  27  * Use is subject to license terms.
  28  */
  29 
  30 #if defined(ELFOBJ)
  31 #pragma weak jnl = __jnl
  32 #pragma weak ynl = __ynl
  33 #endif
  34 
  35 /*
  36  * floating point Bessel's function of the 1st and 2nd kind
  37  * of order n: jn(n,x),yn(n,x);
  38  *
  39  * Special cases:
  40  *      y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
  41  *      y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
  42  * Note 2. About jn(n,x), yn(n,x)
  43  *      For n=0, j0(x) is called,
  44  *      for n=1, j1(x) is called,
  45  *      for n<x, forward recursion us used starting
  46  *      from values of j0(x) and j1(x).
  47  *      for n>x, a continued fraction approximation to
  48  *      j(n,x)/j(n-1,x) is evaluated and then backward
  49  *      recursion is used starting from a supposed value
  50  *      for j(n,x). The resulting value of j(0,x) is
  51  *      compared with the actual value to correct the
  52  *      supposed value of j(n,x).
  53  *




  10  * See the License for the specific language governing permissions
  11  * and limitations under the License.
  12  *
  13  * When distributing Covered Code, include this CDDL HEADER in each
  14  * file and include the License file at usr/src/OPENSOLARIS.LICENSE.
  15  * If applicable, add the following below this CDDL HEADER, with the
  16  * fields enclosed by brackets "[]" replaced with your own identifying
  17  * information: Portions Copyright [yyyy] [name of copyright owner]
  18  *
  19  * CDDL HEADER END
  20  */
  21 
  22 /*
  23  * Copyright 2011 Nexenta Systems, Inc.  All rights reserved.
  24  */
  25 /*
  26  * Copyright 2006 Sun Microsystems, Inc.  All rights reserved.
  27  * Use is subject to license terms.
  28  */
  29 
  30 #pragma weak __jnl = jnl
  31 #pragma weak __ynl = ynl


  32 
  33 /*
  34  * floating point Bessel's function of the 1st and 2nd kind
  35  * of order n: jn(n,x),yn(n,x);
  36  *
  37  * Special cases:
  38  *      y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
  39  *      y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
  40  * Note 2. About jn(n,x), yn(n,x)
  41  *      For n=0, j0(x) is called,
  42  *      for n=1, j1(x) is called,
  43  *      for n<x, forward recursion us used starting
  44  *      from values of j0(x) and j1(x).
  45  *      for n>x, a continued fraction approximation to
  46  *      j(n,x)/j(n-1,x) is evaluated and then backward
  47  *      recursion is used starting from a supposed value
  48  *      for j(n,x). The resulting value of j(0,x) is
  49  *      compared with the actual value to correct the
  50  *      supposed value of j(n,x).
  51  *