Retro68/gcc/libgfortran/generated/bessel_r8.c

183 lines
4.4 KiB
C
Raw Normal View History

2012-03-27 23:13:14 +00:00
/* Implementation of the BESSEL_JN and BESSEL_YN transformational
function using a recurrence algorithm.
2018-12-28 15:30:48 +00:00
Copyright (C) 2010-2018 Free Software Foundation, Inc.
2012-03-27 23:13:14 +00:00
Contributed by Tobias Burnus <burnus@net-b.de>
This file is part of the GNU Fortran runtime library (libgfortran).
Libgfortran is free software; you can redistribute it and/or
modify it under the terms of the GNU General Public
License as published by the Free Software Foundation; either
version 3 of the License, or (at your option) any later version.
Libgfortran is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU General Public License for more details.
Under Section 7 of GPL version 3, you are granted additional
permissions described in the GCC Runtime Library Exception, version
3.1, as published by the Free Software Foundation.
You should have received a copy of the GNU General Public License and
a copy of the GCC Runtime Library Exception along with this program;
see the files COPYING3 and COPYING.RUNTIME respectively. If not, see
<http://www.gnu.org/licenses/>. */
#include "libgfortran.h"
#define MATHFUNC(funcname) funcname
#if defined (HAVE_GFC_REAL_8)
#if defined (HAVE_JN)
extern void bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1,
int n2, GFC_REAL_8 x);
export_proto(bessel_jn_r8);
void
bessel_jn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2, GFC_REAL_8 x)
{
int i;
index_type stride;
GFC_REAL_8 last1, last2, x2rev;
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
2014-09-21 17:33:12 +00:00
if (ret->base_addr == NULL)
2012-03-27 23:13:14 +00:00
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
2015-08-28 15:33:40 +00:00
ret->base_addr = xmallocarray (size, sizeof (GFC_REAL_8));
2012-03-27 23:13:14 +00:00
ret->offset = 0;
}
if (unlikely (n2 < n1))
return;
if (unlikely (compile_options.bounds_check)
&& GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
runtime_error("Incorrect extent in return value of BESSEL_JN "
"(%ld vs. %ld)", (long int) n2-n1,
(long int) GFC_DESCRIPTOR_EXTENT(ret,0));
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (unlikely (x == 0))
{
2014-09-21 17:33:12 +00:00
ret->base_addr[0] = 1;
2012-03-27 23:13:14 +00:00
for (i = 1; i <= n2-n1; i++)
2014-09-21 17:33:12 +00:00
ret->base_addr[i*stride] = 0;
2012-03-27 23:13:14 +00:00
return;
}
last1 = MATHFUNC(jn) (n2, x);
2014-09-21 17:33:12 +00:00
ret->base_addr[(n2-n1)*stride] = last1;
2012-03-27 23:13:14 +00:00
if (n1 == n2)
return;
last2 = MATHFUNC(jn) (n2 - 1, x);
2014-09-21 17:33:12 +00:00
ret->base_addr[(n2-n1-1)*stride] = last2;
2012-03-27 23:13:14 +00:00
if (n1 + 1 == n2)
return;
x2rev = GFC_REAL_8_LITERAL(2.)/x;
for (i = n2-n1-2; i >= 0; i--)
{
2014-09-21 17:33:12 +00:00
ret->base_addr[i*stride] = x2rev * (i+1+n1) * last2 - last1;
2012-03-27 23:13:14 +00:00
last1 = last2;
2014-09-21 17:33:12 +00:00
last2 = ret->base_addr[i*stride];
2012-03-27 23:13:14 +00:00
}
}
#endif
#if defined (HAVE_YN)
extern void bessel_yn_r8 (gfc_array_r8 * const restrict ret,
int n1, int n2, GFC_REAL_8 x);
export_proto(bessel_yn_r8);
void
bessel_yn_r8 (gfc_array_r8 * const restrict ret, int n1, int n2,
GFC_REAL_8 x)
{
int i;
index_type stride;
GFC_REAL_8 last1, last2, x2rev;
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
2014-09-21 17:33:12 +00:00
if (ret->base_addr == NULL)
2012-03-27 23:13:14 +00:00
{
size_t size = n2 < n1 ? 0 : n2-n1+1;
GFC_DIMENSION_SET(ret->dim[0], 0, size-1, 1);
2015-08-28 15:33:40 +00:00
ret->base_addr = xmallocarray (size, sizeof (GFC_REAL_8));
2012-03-27 23:13:14 +00:00
ret->offset = 0;
}
if (unlikely (n2 < n1))
return;
if (unlikely (compile_options.bounds_check)
&& GFC_DESCRIPTOR_EXTENT(ret,0) != (n2-n1+1))
runtime_error("Incorrect extent in return value of BESSEL_JN "
"(%ld vs. %ld)", (long int) n2-n1,
(long int) GFC_DESCRIPTOR_EXTENT(ret,0));
stride = GFC_DESCRIPTOR_STRIDE(ret,0);
if (unlikely (x == 0))
{
for (i = 0; i <= n2-n1; i++)
#if defined(GFC_REAL_8_INFINITY)
2014-09-21 17:33:12 +00:00
ret->base_addr[i*stride] = -GFC_REAL_8_INFINITY;
2012-03-27 23:13:14 +00:00
#else
2014-09-21 17:33:12 +00:00
ret->base_addr[i*stride] = -GFC_REAL_8_HUGE;
2012-03-27 23:13:14 +00:00
#endif
return;
}
last1 = MATHFUNC(yn) (n1, x);
2014-09-21 17:33:12 +00:00
ret->base_addr[0] = last1;
2012-03-27 23:13:14 +00:00
if (n1 == n2)
return;
last2 = MATHFUNC(yn) (n1 + 1, x);
2014-09-21 17:33:12 +00:00
ret->base_addr[1*stride] = last2;
2012-03-27 23:13:14 +00:00
if (n1 + 1 == n2)
return;
x2rev = GFC_REAL_8_LITERAL(2.)/x;
2015-08-28 15:33:40 +00:00
for (i = 2; i <= n2 - n1; i++)
2012-03-27 23:13:14 +00:00
{
#if defined(GFC_REAL_8_INFINITY)
if (unlikely (last2 == -GFC_REAL_8_INFINITY))
{
2014-09-21 17:33:12 +00:00
ret->base_addr[i*stride] = -GFC_REAL_8_INFINITY;
2012-03-27 23:13:14 +00:00
}
else
#endif
{
2014-09-21 17:33:12 +00:00
ret->base_addr[i*stride] = x2rev * (i-1+n1) * last2 - last1;
2012-03-27 23:13:14 +00:00
last1 = last2;
2014-09-21 17:33:12 +00:00
last2 = ret->base_addr[i*stride];
2012-03-27 23:13:14 +00:00
}
}
}
#endif
#endif