From: Tobias Burnus Date: Thu, 19 Aug 2010 07:34:05 +0000 (+0200) Subject: intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo. X-Git-Tag: releases/gcc-4.6.0~4940 X-Git-Url: http://git.ipfire.org/cgi-bin/gitweb.cgi?a=commitdiff_plain;h=d76799c7f0a13ab5a02487f2e6d4dfe10156b223;p=thirdparty%2Fgcc.git intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo. 2010-08-19 Tobias Burnus * intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo. * * simplify.c (gfc_simplify_bessel_yn): Change recursive into recurrence. From-SVN: r163365 --- diff --git a/gcc/fortran/ChangeLog b/gcc/fortran/ChangeLog index 2c6e6f65a775..f5971dd54dcd 100644 --- a/gcc/fortran/ChangeLog +++ b/gcc/fortran/ChangeLog @@ -1,3 +1,9 @@ +2010-08-19 Tobias Burnus + + * intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo. + * * simplify.c (gfc_simplify_bessel_yn): Change recursive + into recurrence. + 2010-08-19 Tobias Burnus PR fortran/36158 diff --git a/gcc/fortran/intrinsic.texi b/gcc/fortran/intrinsic.texi index 3c82ffc2c142..f258e517674d 100644 --- a/gcc/fortran/intrinsic.texi +++ b/gcc/fortran/intrinsic.texi @@ -1661,7 +1661,7 @@ The return value is a scalar of type @code{REAL}. It has the same kind as @var{X}. @item @emph{Note}: -The transformational function uses a recurrance algorithm which might, +The transformational function uses a recurrence algorithm which might, for some values of @var{X}, lead to different results than calls to the elemental function. @@ -1821,7 +1821,7 @@ The return value is a scalar of type @code{REAL}. It has the same kind as @var{X}. @item @emph{Note}: -The transformational function uses a recurrance algorithm which might, +The transformational function uses a recurrence algorithm which might, for some values of @var{X}, lead to different results than calls to the elemental function. diff --git a/gcc/fortran/simplify.c b/gcc/fortran/simplify.c index d1e94af4db2b..6c3070738aea 100644 --- a/gcc/fortran/simplify.c +++ b/gcc/fortran/simplify.c @@ -1261,7 +1261,7 @@ gfc_simplify_bessel_n2 (gfc_expr *order1, gfc_expr *order2, gfc_expr *x, return result; } - /* Use the faster but more verbose recursion algorithm. Bessel functions + /* Use the faster but more verbose recurrence algorithm. Bessel functions are stable for downward recursion and Neumann functions are stable for upward recursion. It is x2rev = 2.0/x,