diff options
| author | Tobias Burnus <burnus@net-b.de> | 2010-08-19 09:34:05 +0200 |
|---|---|---|
| committer | Tobias Burnus <burnus@gcc.gnu.org> | 2010-08-19 09:34:05 +0200 |
| commit | d76799c7f0a13ab5a02487f2e6d4dfe10156b223 (patch) | |
| tree | 5eaaabee1f2a56ea3040c9f8a0e1512184045b4d /gcc | |
| parent | 29698e0f2fa1c77242782bc5c8c6a9327b8d32cf (diff) | |
| download | gcc-d76799c7f0a13ab5a02487f2e6d4dfe10156b223.zip gcc-d76799c7f0a13ab5a02487f2e6d4dfe10156b223.tar.gz gcc-d76799c7f0a13ab5a02487f2e6d4dfe10156b223.tar.bz2 | |
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
Diffstat (limited to 'gcc')
| -rw-r--r-- | gcc/fortran/ChangeLog | 6 | ||||
| -rw-r--r-- | gcc/fortran/intrinsic.texi | 4 | ||||
| -rw-r--r-- | gcc/fortran/simplify.c | 2 |
3 files changed, 9 insertions, 3 deletions
diff --git a/gcc/fortran/ChangeLog b/gcc/fortran/ChangeLog index 2c6e6f6..f5971dd 100644 --- a/gcc/fortran/ChangeLog +++ b/gcc/fortran/ChangeLog @@ -1,5 +1,11 @@ 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 PR fortran/33197 * check.c (gfc_check_bessel_n2): New function. diff --git a/gcc/fortran/intrinsic.texi b/gcc/fortran/intrinsic.texi index 3c82ffc..f258e51 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 d1e94af..6c30707 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, |