[Fortran] PR36158 - Add transformational version of BESSEL_JN intrinsic

Submitted by Tobias Burnus on Aug. 19, 2010, 7:36 a.m.

Details

Message ID 4C6CDEF2.8050602@net-b.de
State New
Headers show

Commit Message

Tobias Burnus Aug. 19, 2010, 7:36 a.m.
On 08/19/2010 09:30 AM, Tobias Burnus wrote:
> Thanks for reviewing. Committed as Rev. 163364.

It helps if one not only finds typos before committal but also fixes 
them before committal ...

Committed as Rev. 163365.

Tobias

Patch hide | download patch | download mbox

Index: gcc/fortran/ChangeLog
===================================================================
--- gcc/fortran/ChangeLog	(revision 163364)
+++ gcc/fortran/ChangeLog	(working copy)
@@ -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.
Index: gcc/fortran/intrinsic.texi
===================================================================
--- gcc/fortran/intrinsic.texi	(revision 163364)
+++ gcc/fortran/intrinsic.texi	(working copy)
@@ -1661,7 +1661,7 @@ 
 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 @@ 
 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.
 
Index: gcc/fortran/simplify.c
===================================================================
--- gcc/fortran/simplify.c	(revision 163364)
+++ gcc/fortran/simplify.c	(working copy)
@@ -1261,7 +1261,7 @@ 
       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,