mirror/gcc
2
0
Fork 0
mirror of git://gcc.gnu.org/git/gcc.git synced 2025-02-26 01:25:55 +08:00
Code Issues Packages Projects Releases Wiki Activity

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

Browse Source 
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
This commit is contained in:
Tobias Burnus 2010-08-19 09:34:05 +02:00 committed by Tobias Burnus
parent 29698e0f2f
commit d76799c7f0
3 changed files with 9 additions and 3 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

6
gcc/fortran/ChangeLog
View File

@ -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

4
gcc/fortran/intrinsic.texi
View File

@ -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.

2
gcc/fortran/simplify.c
View File

@ -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,