intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo.

2010-08-19  Tobias Burnus  <burnus@net-b.de>

        * 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 2c6e6f65a775f2e9c16128a793310fe228ce2514..f5971dd54dcd9e2c605c61bfc46a83a932c708ae 100644 (file)
--- a/gcc/fortran/ChangeLog
+++ b/gcc/fortran/ChangeLog
@@ -1,3 +1,9 @@
+2010-08-19  Tobias Burnus  <burnus@net-b.de>
+
+       * intrinsic.texi (Bessel_jn, Bessel_yn): Fix typo.
+       * * simplify.c (gfc_simplify_bessel_yn): Change recursive
+       into recurrence.
+
 2010-08-19  Tobias Burnus  <burnus@net-b.de>
 
        PR fortran/36158

diff --git a/gcc/fortran/intrinsic.texi b/gcc/fortran/intrinsic.texi
index 3c82ffc2c142a2cbdecc6272d17b0aa7100c8362..f258e517674d3bbb807361b609bc0ca065e1b52b 100644 (file)
--- 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 d1e94af4db2b4c8e79f4f70bae27a802e774e514..6c3070738aeace1402bb459ae25f0b965bb58212 100644 (file)
--- 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,