git: 3b6fbe6e987a - stable/13 - msun: correct comment

From: Konstantin Belousov <kib_at_FreeBSD.org>
Date: Thu, 22 Sep 2022 11:20:03 UTC
```The branch stable/13 has been updated by kib:

URL: https://cgit.FreeBSD.org/src/commit/?id=3b6fbe6e987a02e16d87b65a0b7ee2f2c5936ed1

commit 3b6fbe6e987a02e16d87b65a0b7ee2f2c5936ed1
Author:     Steve Kargl <kargl@FreeBSD.org>
AuthorDate: 2022-09-19 18:38:48 +0000
Commit:     Konstantin Belousov <kib@FreeBSD.org>
CommitDate: 2022-09-22 11:19:23 +0000

msun: correct comment

PR:     266503

(cherry picked from commit 620d855faca136d661a86dfa4cf74dd4f8794740)
---
lib/msun/src/e_jn.c | 12 ++++++------
1 file changed, 6 insertions(+), 6 deletions(-)

diff --git a/lib/msun/src/e_jn.c b/lib/msun/src/e_jn.c
index c7ba7da6567b..5aaebd400065 100644
--- a/lib/msun/src/e_jn.c
+++ b/lib/msun/src/e_jn.c
@@ -22,15 +22,15 @@ __FBSDID("\$FreeBSD\$");
*	y0(0)=y1(0)=yn(n,0) = -inf with division by zero signal;
*	y0(-ve)=y1(-ve)=yn(n,-ve) are NaN with invalid signal.
* Note 2. About jn(n,x), yn(n,x)
- *	For n=0, j0(x) is called,
- *	for n=1, j1(x) is called,
- *	for n<x, forward recursion us used starting
+ *	For n=0, j0(x) is called.
+ *	For n=1, j1(x) is called.
+ *	For n<x, forward recursion is used starting
*	from values of j0(x) and j1(x).
- *	for n>x, a continued fraction approximation to
+ *	For n>x, a continued fraction approximation to
*	j(n,x)/j(n-1,x) is evaluated and then backward
*	recursion is used starting from a supposed value
- *	for j(n,x). The resulting value of j(0,x) is
- *	compared with the actual value to correct the
+ *	for j(n,x). The resulting values of j(0,x) or j(1,x) are
+ *	compared with the actual values to correct the
*	supposed value of j(n,x).
*
*	yn(n,x) is similar in all respects, except
```